{"meta":{"query_hash":"f7b58334fe5f","filters":{"venue":"Open Journal of Mathematical Optimization"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/f7b58334fe5f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Open+Journal+of+Mathematical+Optimization"},"results":[{"id":"W2971016812","doi":"10.5802/ojmo.2","title":"Revisiting a Cutting-Plane Method for Perfect Matchings","year":2020,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","topic":"Complexity and Algorithms in Graphs","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":"Carleton University; University of Toronto","funders":"","keywords":"Counterexample; Linear programming; Uniqueness; Mathematics; Cutting-plane method; Matching (statistics); Algorithm; Mathematical optimization; Point (geometry); Polynomial; Sequence (biology); Time complexity; Applied mathematics; Discrete mathematics; Integer programming; Mathematical analysis; Geometry","score_opus":0.06268050422370516,"score_gpt":0.3521685173705242,"score_spread":0.28948801314681905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971016812","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.0017575801,0.00034758012,0.9936132,0.00022615961,0.00013610993,0.000069173984,0.00006772551,0.00038658816,0.0033958966],"genre_scores_gemma":[0.027363798,0.0005664735,0.96575457,0.00023127883,0.00015097224,0.000163355,0.00024988514,0.0005491649,0.004970453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754274,0.00055822235,0.00015518436,0.0005407238,0.0010172363,0.0001859254],"domain_scores_gemma":[0.997494,0.0014109152,0.000121371195,0.00041316156,0.00046773782,0.00009273825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025176315,0.0020873107,0.0020507777,0.0022307,0.001002874,0.0023103587,0.0034925863,0.0028944171,0.016092021],"category_scores_gemma":[0.009480339,0.0015649193,0.0037282314,0.0029967786,0.0016019805,0.004439637,0.0036419753,0.005876025,0.0048141414],"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.00021330564,0.00023033547,0.00061125506,0.00063588907,0.00018072697,0.00020613654,0.00028063095,0.2646155,0.007697653,0.25194424,0.01364791,0.45973647],"study_design_scores_gemma":[0.00008357268,0.00010845288,0.0001213339,0.0001018196,0.00004195483,0.00013393714,0.00005514527,0.8078227,0.0019173693,0.16270307,0.02687632,0.000034229965],"about_ca_topic_score_codex":0.0050433916,"about_ca_topic_score_gemma":0.0048911674,"teacher_disagreement_score":0.016092021,"about_ca_system_score_codex":0.0015261271,"about_ca_system_score_gemma":0.002018254,"threshold_uncertainty_score":0.053833187},"labels":[],"label_agreement":null},{"id":"W3097005701","doi":"10.5802/ojmo.6","title":"Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses","year":2021,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Centre de Recherches Mathématiques; Simons Foundation","keywords":"Moore–Penrose pseudoinverse; Mathematics; Norm (philosophy); Rank (graph theory); Inverse; Generalized inverse; Computation; Low-rank approximation; Least-squares function approximation; Matrix norm; Applied mathematics; Mathematical optimization; Algorithm; Combinatorics; Pure mathematics; Eigenvalues and eigenvectors; Statistics","score_opus":0.10382142233305668,"score_gpt":0.31539656471465355,"score_spread":0.21157514238159686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097005701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036440727,0.00012231004,0.99492395,0.00024333605,0.000011511346,0.00001485943,0.000025498979,0.00007612117,0.00093836104],"genre_scores_gemma":[0.2796437,0.0006468277,0.71462,0.00037029784,0.00012683518,0.00023116927,0.00018800596,0.00026835338,0.0039048132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.00043634296,0.00003613636,0.00012638356,0.00015579608,0.000054102187],"domain_scores_gemma":[0.99769336,0.0016153931,0.0002337942,0.00022550597,0.0001510991,0.000080870275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977458,0.0013792175,0.0013298508,0.0005211912,0.000363966,0.0015648514,0.0013828177,0.0015534497,0.0024969939],"category_scores_gemma":[0.0060665146,0.0007011156,0.0012037444,0.0005153885,0.001964324,0.0023429675,0.002259745,0.002081869,0.00067887135],"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.00007949165,0.000078107216,0.00053627405,0.00028990174,0.000074576215,0.00013498511,0.00018962116,0.6525718,0.0050291447,0.28973454,0.0022285453,0.049053017],"study_design_scores_gemma":[0.000006939159,0.00003574118,0.000049451784,0.000017985083,0.0000067084634,0.000022346132,0.000013150176,0.93528074,0.0007900214,0.06307993,0.00068451714,0.000012398734],"about_ca_topic_score_codex":0.0013879495,"about_ca_topic_score_gemma":0.0019381229,"teacher_disagreement_score":0.0024969939,"about_ca_system_score_codex":0.0007257855,"about_ca_system_score_gemma":0.0009677191,"threshold_uncertainty_score":0.010565162},"labels":[],"label_agreement":null},{"id":"W3178931227","doi":"10.5802/ojmo.7","title":"The difference vectors for convex sets and a resolution of the geometry conjecture","year":2021,"lang":"en","type":"article","venue":"Open Journal of Mathematical Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Intersection (aeronautics); Conjecture; Mathematics; Convex geometry; Regular polygon; Convex set; Hilbert space; Geometry; Space (punctuation); Point (geometry); Combinatorics; Pure mathematics; Convex optimization; Computer science","score_opus":0.056714649993269875,"score_gpt":0.3344459630127415,"score_spread":0.2777313130194716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178931227","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.21804354,0.002346448,0.68484294,0.011665261,0.00056809507,0.000066217784,0.00042797576,0.00014484233,0.08189466],"genre_scores_gemma":[0.9277886,0.00088235474,0.0600998,0.0007813537,0.0004937459,0.00009033511,0.00027877738,0.000082634506,0.0095025245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981912,0.00070843083,0.0000729944,0.00027093253,0.00055095623,0.0002056234],"domain_scores_gemma":[0.99516356,0.00330231,0.0003903426,0.00039585336,0.00046131536,0.00028664543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033079172,0.00048194206,0.0006934805,0.001641701,0.0009828756,0.0025732915,0.0017465433,0.0014316849,0.0077382135],"category_scores_gemma":[0.0131376805,0.00033104152,0.0009642044,0.0011252573,0.0049349824,0.007229258,0.0041479333,0.0038169865,0.00047071718],"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.000007993288,0.0000023950704,0.00006137203,0.000009111801,0.0000015749507,0.000013153066,0.000024863271,0.000919778,0.00016299645,0.99739957,0.0002333334,0.0011638522],"study_design_scores_gemma":[0.000008520473,0.000013411479,0.00014846308,0.000009475443,0.0000016879139,0.000028621631,0.0000393046,0.01355182,0.00019313936,0.9846147,0.001384708,0.000006238791],"about_ca_topic_score_codex":0.00096436887,"about_ca_topic_score_gemma":0.00055188657,"teacher_disagreement_score":0.0077382135,"about_ca_system_score_codex":0.0016484767,"about_ca_system_score_gemma":0.0008493549,"threshold_uncertainty_score":0.025886893},"labels":[],"label_agreement":null},{"id":"W4396860342","doi":"10.5802/ojmo.27","title":"Cardinality-constrained structured data-fitting problems","year":2024,"lang":"en","type":"article","venue":"Open Journal of Mathematical Optimization","topic":"Machine Learning and Algorithms","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":"University of British Columbia","funders":"","keywords":"Cardinality (data modeling); Dual (grammatical number); Iterated function; Mathematical optimization; Constraint (computer-aided design); Computer science; Simple (philosophy); Algorithm; Identification (biology); Mathematics; Data mining","score_opus":0.041852714837984556,"score_gpt":0.3248309299069888,"score_spread":0.2829782150690042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396860342","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.0022660873,0.00009142274,0.9968105,0.00015986052,0.000016296613,0.000043076085,0.000088679706,0.00009204739,0.00043207334],"genre_scores_gemma":[0.13777567,0.0004640554,0.8569955,0.00026370492,0.00015762706,0.0006273593,0.0011197298,0.00027774804,0.0023186235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968087,0.0013551031,0.00017357165,0.0007287103,0.0007221952,0.00021159729],"domain_scores_gemma":[0.9912888,0.005770589,0.0007683662,0.001003563,0.0008827603,0.00028594272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005497186,0.0017277771,0.0027785536,0.0017690674,0.0009731404,0.002611625,0.0039380416,0.0034806265,0.004528982],"category_scores_gemma":[0.023514178,0.0014273524,0.0021291908,0.0024930846,0.0021996398,0.0037140464,0.0059049665,0.004428595,0.0010434437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00012732224,0.000106134954,0.0010664598,0.00032936994,0.00011005777,0.00020571482,0.00017736027,0.81512594,0.0014135952,0.103306435,0.004222216,0.0738094],"study_design_scores_gemma":[0.000015628792,0.000021657328,0.000059363752,0.000027869839,0.000007820811,0.000052136675,0.000026515054,0.942421,0.0005152055,0.05594114,0.0008983672,0.000013205683],"about_ca_topic_score_codex":0.001803496,"about_ca_topic_score_gemma":0.0015019996,"teacher_disagreement_score":0.005497186,"about_ca_system_score_codex":0.0012132314,"about_ca_system_score_gemma":0.0026273835,"threshold_uncertainty_score":0.029072225},"labels":[],"label_agreement":null},{"id":"W4401035172","doi":"10.5802/ojmo.31","title":"Tight analyses for subgradient descent I: Lower bounds","year":2024,"lang":"lv","type":"article","venue":"Open Journal of Mathematical Optimization","topic":"Machine Learning and Algorithms","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 British Columbia","funders":"","keywords":"Subgradient method; Mathematics; Lipschitz continuity; Upper and lower bounds; Differentiable function; Combinatorics; Convex function; Descent (aeronautics); Matching (statistics); Regular polygon; Function (biology); Discrete mathematics; Mathematical optimization; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.06688709976136888,"score_gpt":0.38187943235358673,"score_spread":0.31499233259221787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401035172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010524043,0.00621964,0.92764556,0.0052663563,0.00062275986,0.00018089019,0.0006400722,0.0011487114,0.04775198],"genre_scores_gemma":[0.4947587,0.0101742735,0.41814664,0.00679127,0.0023006897,0.0020578848,0.0031877584,0.004639428,0.05794335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99190044,0.0030365016,0.00025125835,0.0010852715,0.0024507088,0.0012758637],"domain_scores_gemma":[0.968591,0.022514813,0.0015186693,0.0025981606,0.003277055,0.0015003852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013092006,0.005197703,0.0038091,0.0037932934,0.0023098784,0.0065405634,0.004728997,0.0043731984,0.018129278],"category_scores_gemma":[0.07342727,0.0020667827,0.0036492066,0.0034080176,0.0048407903,0.009240924,0.0066945977,0.013446942,0.0038471115],"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.00061144517,0.00033891044,0.0021635778,0.001042491,0.00027332664,0.00034065166,0.0004334284,0.26174027,0.0019680974,0.63215095,0.04424894,0.054688044],"study_design_scores_gemma":[0.000048796344,0.00012444111,0.0004680329,0.0003324039,0.00008559354,0.000085180516,0.00008307617,0.6955363,0.0009709148,0.29310143,0.009127178,0.000036606907],"about_ca_topic_score_codex":0.009993123,"about_ca_topic_score_gemma":0.008642033,"teacher_disagreement_score":0.018129278,"about_ca_system_score_codex":0.0078076543,"about_ca_system_score_gemma":0.005496039,"threshold_uncertainty_score":0.06923801},"labels":[],"label_agreement":null}]}