{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"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"},"query_hash":"f7b58334fe5f","filters":{"venue":"Open Journal of Mathematical Optimization"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05671464999326987,"gpt":0.3344459630127415,"spread":0.2777313130194716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205089,0.00009372809,0.0003234725,0.00004835514,0.0001894769,0.0001513577,0.0003325435,0.00006652609,0.0000595583],"category_scores_gemma":[0.007516754,0.00004696227,0.00009187364,0.0003604473,0.00009795329,0.0001386512,0.000155983,0.0001293191,2.204383e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002207527,"about_ca_system_score_gemma":0.0001341417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001035976,"about_ca_topic_score_gemma":0.000001999777,"domain_scores_codex":[0.9987831,0.0001186295,0.0006039523,0.00008293946,0.000282593,0.0001288597],"domain_scores_gemma":[0.9960447,0.002481556,0.0006510582,0.0001889338,0.0005897896,0.00004398575],"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.0002977243,0.0004709051,0.0002680955,0.00204046,0.0003651213,0.000005583378,0.002618578,0.003784402,0.0003712568,0.981191,0.002587329,0.005999558],"study_design_scores_gemma":[0.001516623,0.0002722354,0.0003077178,0.0007893203,0.0002501142,0.0002834581,0.001811518,0.03618108,0.006682665,0.9512666,0.0004662554,0.0001724454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08626069,0.0007726228,0.9079299,0.003268924,0.0002177478,0.000569398,0.00002342971,0.000005238288,0.0009520357],"genre_scores_gemma":[0.7379452,0.0004720333,0.2593922,0.0001685203,0.0001013493,0.00002350139,0.000004285269,0.00003568913,0.001857216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6516845,"threshold_uncertainty_score":0.8998799,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06688709976136888,"gpt":0.3818794323535867,"spread":0.3149923325922179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002033846,0.0002616321,0.0005849719,0.0002629956,0.0002198862,0.003443709,0.001319716,0.0001111213,0.0006728694],"category_scores_gemma":[0.0004887787,0.000188665,0.0003746969,0.0006021521,0.00007015027,0.001145197,0.0002856299,0.0003829402,0.00006297145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001289136,"about_ca_system_score_gemma":0.0003390179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003535881,"about_ca_topic_score_gemma":3.819471e-7,"domain_scores_codex":[0.9974573,0.0001907051,0.00108468,0.0003431875,0.0005781215,0.0003459727],"domain_scores_gemma":[0.9979324,0.0005336941,0.000469078,0.0003317928,0.0004640557,0.0002689423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001758713,0.001359176,0.00001246008,0.001184139,0.0007612627,0.0002877372,0.003267007,0.7736562,0.00009679452,0.1365721,0.01736605,0.06526125],"study_design_scores_gemma":[0.0005355274,0.0007735094,0.000005997278,0.001509028,0.0002585387,0.0002328595,0.00003886286,0.9756187,0.0001449695,0.01022397,0.01043056,0.0002274508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002773088,0.00181308,0.9889627,0.004538109,0.001717608,0.0004099009,0.000006910527,0.00002613028,0.002248235],"genre_scores_gemma":[0.06325282,0.0002616681,0.9304822,0.0001792038,0.0006727988,0.00001246775,0.00000814654,0.00005247862,0.005078234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2019625,"threshold_uncertainty_score":0.9975908,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1038214223330567,"gpt":0.3153965647146535,"spread":0.2115751423815969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001086242,0.0005536229,0.001526536,0.0004439027,0.000209036,0.0008009006,0.0006469795,0.0005005154,0.0001025304],"category_scores_gemma":[0.0005213876,0.0005324265,0.0003467493,0.0003745374,0.00009589842,0.000915819,0.0005782202,0.0006176294,5.608238e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002426853,"about_ca_system_score_gemma":0.0002169469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002592561,"about_ca_topic_score_gemma":8.953066e-7,"domain_scores_codex":[0.9968141,0.0001696647,0.001663995,0.0004277931,0.0005185846,0.0004058492],"domain_scores_gemma":[0.9971986,0.0004071174,0.0008739433,0.0004588426,0.000786981,0.0002744932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001001245,0.0001340273,0.000001469894,0.0005475548,0.0003482263,0.00003728517,0.0006272263,0.9957591,0.0002303209,0.001231293,0.0001846304,0.0007987874],"study_design_scores_gemma":[0.001166732,0.00007632414,2.742766e-7,0.002672117,0.0005568727,0.0001551188,0.0002273509,0.9792919,0.003045083,0.01226411,0.00001848425,0.0005256603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01576827,0.0007932911,0.9800278,0.0001117144,0.0002972028,0.001095194,0.00001991696,0.0001166794,0.001769917],"genre_scores_gemma":[0.06717279,0.001513082,0.9307107,0.00009287161,0.0002646983,0.00002634474,0.00006472395,0.0001340611,0.00002072426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05140452,"threshold_uncertainty_score":0.9997127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06268050422370516,"gpt":0.3521685173705242,"spread":0.289488013146819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003229328,0.0002722534,0.0009072928,0.0001499815,0.0001774255,0.001462299,0.003015286,0.0001613391,0.00009766757],"category_scores_gemma":[0.001340562,0.000232869,0.0003549017,0.0002421019,0.00002652364,0.0006070576,0.00216859,0.0007041338,0.000006595577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005848323,"about_ca_system_score_gemma":0.0002191826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002439712,"about_ca_topic_score_gemma":7.305916e-8,"domain_scores_codex":[0.9974601,0.0002768848,0.001152502,0.0004032098,0.000470752,0.0002365162],"domain_scores_gemma":[0.9963263,0.001051488,0.001529633,0.0004362337,0.0004690489,0.0001872607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001306287,0.0002871074,0.000006269733,0.002814024,0.0004378123,0.0000852058,0.003550644,0.5277005,0.0001162277,0.3711466,0.00301413,0.09071092],"study_design_scores_gemma":[0.0003579243,0.0001108611,0.000001206781,0.001050158,0.00007127968,0.0001874575,0.00003142969,0.7308016,0.0001235497,0.2668249,0.0002510975,0.0001885235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000258177,0.0001048245,0.9906217,0.006635526,0.0003270529,0.0007026628,0.00001121833,0.000036863,0.00153427],"genre_scores_gemma":[0.0005939315,0.00004558173,0.9985135,0.0003634984,0.0003745057,0.00002058356,0.00001261371,0.00002805163,0.00004776549],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2031011,"threshold_uncertainty_score":0.9995743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04185271483798456,"gpt":0.3248309299069888,"spread":0.2829782150690042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002165686,0.0001120192,0.0002743006,0.0000977713,0.00008901272,0.001459219,0.001914257,0.00004576888,0.0001599983],"category_scores_gemma":[0.0004358432,0.00007922773,0.00006159644,0.0003362461,0.00002986507,0.001611998,0.0005588655,0.000298717,0.00001432754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002403035,"about_ca_system_score_gemma":0.0001461004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002587326,"about_ca_topic_score_gemma":1.605782e-7,"domain_scores_codex":[0.9985564,0.0001448805,0.0005628307,0.0002279468,0.0003571996,0.000150734],"domain_scores_gemma":[0.9988898,0.0002156142,0.0002268366,0.0004290163,0.0001365486,0.0001021525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009816555,0.0001113607,0.00002518657,0.0004098311,0.0002236081,0.0001565221,0.001721244,0.7160177,0.0001203075,0.1303907,0.001987593,0.1488262],"study_design_scores_gemma":[0.0002018989,0.000063667,0.000005932672,0.0003586772,0.00002948952,0.0004970122,0.00003230489,0.9776734,0.00003429482,0.01989596,0.001110709,0.00009664403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001457812,0.0001725896,0.9926912,0.002205466,0.0003172075,0.0001459097,0.000003636825,0.00004439421,0.004273876],"genre_scores_gemma":[0.07246377,0.00001440022,0.9270137,0.00005576781,0.0001749201,0.000001574843,0.000008527138,0.00001312236,0.0002542376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2616557,"threshold_uncertainty_score":0.9995773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}