{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Salihah Alwadani","is_ca":true},{"name":"Heinz H. Bauschke","is_ca":true},{"name":"J. P. Revalski","is_ca":false},{"name":"Xianfu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003307917,0.0004819421,0.0006934805,0.001641701,0.0009828756,0.002573292,0.001746543,0.001431685,0.007738214],"category_scores_gemma":[0.01313768,0.0003310415,0.0009642044,0.001125257,0.004934982,0.007229258,0.004147933,0.003816986,0.0004707172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648477,"about_ca_system_score_gemma":0.0008493549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009643689,"about_ca_topic_score_gemma":0.0005518866,"domain_scores_codex":[0.9981912,0.0007084308,0.0000729944,0.0002709325,0.0005509562,0.0002056234],"domain_scores_gemma":[0.9951636,0.00330231,0.0003903426,0.0003958534,0.0004613154,0.0002866454],"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.000007993288,0.00000239507,0.00006137203,0.000009111801,0.000001574951,0.00001315307,0.00002486327,0.000919778,0.0001629965,0.9973996,0.0002333334,0.001163852],"study_design_scores_gemma":[0.000008520473,0.00001341148,0.0001484631,0.000009475443,0.000001687914,0.00002862163,0.0000393046,0.01355182,0.0001931394,0.9846147,0.001384708,0.000006238791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2180435,0.002346448,0.6848429,0.01166526,0.0005680951,0.00006621778,0.0004279758,0.0001448423,0.08189466],"genre_scores_gemma":[0.9277886,0.0008823547,0.0600998,0.0007813537,0.0004937459,0.00009033511,0.0002787774,0.00008263451,0.009502525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007738214,"threshold_uncertainty_score":0.02588689,"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","authors":[{"name":"Nicholas J. A. Harvey","is_ca":true},{"name":"Chris Liaw","is_ca":false},{"name":"Sikander Randhawa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01309201,0.005197703,0.0038091,0.003793293,0.002309878,0.006540563,0.004728997,0.004373198,0.01812928],"category_scores_gemma":[0.07342727,0.002066783,0.003649207,0.003408018,0.00484079,0.009240924,0.006694598,0.01344694,0.003847111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007807654,"about_ca_system_score_gemma":0.005496039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009993123,"about_ca_topic_score_gemma":0.008642033,"domain_scores_codex":[0.9919004,0.003036502,0.0002512583,0.001085271,0.002450709,0.001275864],"domain_scores_gemma":[0.968591,0.02251481,0.001518669,0.002598161,0.003277055,0.001500385],"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.0006114452,0.0003389104,0.002163578,0.001042491,0.0002733266,0.0003406517,0.0004334284,0.2617403,0.001968097,0.6321509,0.04424894,0.05468804],"study_design_scores_gemma":[0.00004879634,0.0001244411,0.0004680329,0.0003324039,0.00008559354,0.00008518052,0.00008307617,0.6955363,0.0009709148,0.2931014,0.009127178,0.00003660691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01052404,0.00621964,0.9276456,0.005266356,0.0006227599,0.0001808902,0.0006400722,0.001148711,0.04775198],"genre_scores_gemma":[0.4947587,0.01017427,0.4181466,0.00679127,0.00230069,0.002057885,0.003187758,0.004639428,0.05794335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01812928,"threshold_uncertainty_score":0.06923801,"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","authors":[{"name":"Marcia Fampa","is_ca":false},{"name":"Jon Lee","is_ca":false},{"name":"Gabriel Ponte","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997746,0.001379217,0.001329851,0.0005211912,0.000363966,0.001564851,0.001382818,0.00155345,0.002496994],"category_scores_gemma":[0.006066515,0.0007011156,0.001203744,0.0005153885,0.001964324,0.002342968,0.002259745,0.002081869,0.0006788714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007257855,"about_ca_system_score_gemma":0.0009677191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001387949,"about_ca_topic_score_gemma":0.001938123,"domain_scores_codex":[0.9991912,0.000436343,0.00003613636,0.0001263836,0.0001557961,0.00005410219],"domain_scores_gemma":[0.9976934,0.001615393,0.0002337942,0.000225506,0.0001510991,0.00008087028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007949165,0.00007810722,0.000536274,0.0002899017,0.00007457622,0.0001349851,0.0001896212,0.6525718,0.005029145,0.2897345,0.002228545,0.04905302],"study_design_scores_gemma":[0.000006939159,0.00003574118,0.00004945178,0.00001798508,0.000006708463,0.00002234613,0.00001315018,0.9352807,0.0007900214,0.06307993,0.0006845171,0.00001239873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003644073,0.00012231,0.9949239,0.000243336,0.00001151135,0.00001485943,0.00002549898,0.00007612117,0.000938361],"genre_scores_gemma":[0.2796437,0.0006468277,0.71462,0.0003702978,0.0001268352,0.0002311693,0.000188006,0.0002683534,0.003904813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002496994,"threshold_uncertainty_score":0.01056516,"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","authors":[{"name":"Amber Q Chen","is_ca":true},{"name":"Kevin K. H. Cheung","is_ca":true},{"name":"P. Michael Kielstra","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517632,0.002087311,0.002050778,0.0022307,0.001002874,0.002310359,0.003492586,0.002894417,0.01609202],"category_scores_gemma":[0.009480339,0.001564919,0.003728231,0.002996779,0.001601981,0.004439637,0.003641975,0.005876025,0.004814141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001526127,"about_ca_system_score_gemma":0.002018254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005043392,"about_ca_topic_score_gemma":0.004891167,"domain_scores_codex":[0.9975427,0.0005582224,0.0001551844,0.0005407238,0.001017236,0.0001859254],"domain_scores_gemma":[0.997494,0.001410915,0.0001213712,0.0004131616,0.0004677378,0.00009273825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002133056,0.0002303355,0.0006112551,0.0006358891,0.000180727,0.0002061365,0.0002806309,0.2646155,0.007697653,0.2519442,0.01364791,0.4597365],"study_design_scores_gemma":[0.00008357268,0.0001084529,0.0001213339,0.0001018196,0.00004195483,0.0001339371,0.00005514527,0.8078227,0.001917369,0.1627031,0.02687632,0.00003422996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00175758,0.0003475801,0.9936132,0.0002261596,0.0001361099,0.00006917398,0.00006772551,0.0003865882,0.003395897],"genre_scores_gemma":[0.0273638,0.0005664735,0.9657546,0.0002312788,0.0001509722,0.000163355,0.0002498851,0.0005491649,0.004970453],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01609202,"threshold_uncertainty_score":0.05383319,"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","authors":[{"name":"Zhenan Fan","is_ca":true},{"name":"Fang Huang","is_ca":true},{"name":"Michael P. Friedlander","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005497186,0.001727777,0.002778554,0.001769067,0.0009731404,0.002611625,0.003938042,0.003480627,0.004528982],"category_scores_gemma":[0.02351418,0.001427352,0.002129191,0.002493085,0.00219964,0.003714046,0.005904966,0.004428595,0.001043444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213231,"about_ca_system_score_gemma":0.002627383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001803496,"about_ca_topic_score_gemma":0.001502,"domain_scores_codex":[0.9968087,0.001355103,0.0001735717,0.0007287103,0.0007221952,0.0002115973],"domain_scores_gemma":[0.9912888,0.005770589,0.0007683662,0.001003563,0.0008827603,0.0002859427],"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.0001273222,0.000106135,0.00106646,0.0003293699,0.0001100578,0.0002057148,0.0001773603,0.8151259,0.001413595,0.1033064,0.004222216,0.0738094],"study_design_scores_gemma":[0.00001562879,0.00002165733,0.00005936375,0.00002786984,0.000007820811,0.00005213667,0.00002651505,0.942421,0.0005152055,0.05594114,0.0008983672,0.00001320568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002266087,0.00009142274,0.9968105,0.0001598605,0.00001629661,0.00004307608,0.00008867971,0.00009204739,0.0004320733],"genre_scores_gemma":[0.1377757,0.0004640554,0.8569955,0.0002637049,0.0001576271,0.0006273593,0.00111973,0.000277748,0.002318623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005497186,"threshold_uncertainty_score":0.02907223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}