{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"a9718cbe27e9","filters":{"venue":"Advances in Operations Research"}},"results":[{"id":"W2124986648","doi":"10.1155/2009/252989","title":"Mathematical Programming Approaches to Classification Problems","year":2009,"lang":"en","type":"article","venue":"Advances in Operations Research","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Laurentian University","funders":"","keywords":"Linear discriminant analysis; Computer science; Discriminant; Flexibility (engineering); Machine learning; Support vector machine; Context (archaeology); Artificial intelligence; Mathematical optimization; Covariance; Goal programming; Process (computing); Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.684554646724707,"gpt":0.5742336040941309,"spread":0.1103210426305761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002184871,0.0001254734,0.0002202762,0.0002606202,0.0002484367,0.0001064654,0.0002607778,0.00006827203,0.00003820857],"category_scores_gemma":[0.003412475,0.0001051572,0.00002789906,0.0008166409,0.0001099537,0.0004587535,0.00005199046,0.0003957938,0.00005083604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232547,"about_ca_system_score_gemma":0.00006065196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002959174,"about_ca_topic_score_gemma":0.0001001839,"domain_scores_codex":[0.9977888,0.0003386069,0.0004334608,0.0004081415,0.0005266356,0.0005043846],"domain_scores_gemma":[0.9983972,0.0008809089,0.00001695557,0.00039462,0.0001635961,0.0001467594],"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.000009424827,0.0002568861,0.00001043616,0.00004207313,0.000001413521,0.000001800199,0.0006783254,0.003388269,0.0003157676,0.7705176,0.00002239296,0.2247556],"study_design_scores_gemma":[0.0001751643,0.0002177935,0.00009251431,0.0001003017,0.000002560593,0.000003733703,0.0005649683,0.06122908,0.0002778237,0.9329125,0.004276101,0.0001474032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003474472,0.0002072034,0.9814897,0.002377155,0.00002344981,0.001424033,0.000004679328,0.00005942151,0.01093988],"genre_scores_gemma":[0.2733633,0.00006359265,0.7254098,0.00003335143,0.00004339155,0.0005251346,0.000004306111,0.00001366102,0.0005434775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2698888,"threshold_uncertainty_score":0.4288188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513208540","doi":"10.1155/2016/5017369","title":"Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions","year":2016,"lang":"en","type":"article","venue":"Advances in Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Subadditivity; Knapsack problem; Integer (computer science); Integer programming; Mathematics; Generator (circuit theory); Duality (order theory); Linear programming; Class (philosophy); Discrete mathematics; Mathematical optimization; Combinatorics; Computer science; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.2457099591087016,"gpt":0.5069657763647945,"spread":0.2612558172560928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001998806,0.0001871858,0.0003545076,0.0006007418,0.0004579392,0.00006002654,0.0003632692,0.000122885,0.0002659967],"category_scores_gemma":[0.006832878,0.0001392906,0.00009617006,0.0012598,0.0005705715,0.0009791869,0.0001591824,0.0002847646,0.00001319882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003650422,"about_ca_system_score_gemma":0.0003324631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000510409,"about_ca_topic_score_gemma":0.0004793409,"domain_scores_codex":[0.9968393,0.0005561779,0.0007453755,0.0005328814,0.0006669833,0.0006592539],"domain_scores_gemma":[0.9947159,0.002073204,0.00007476595,0.0005342105,0.002469374,0.000132566],"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.001082346,0.002618263,0.001682239,0.0006403267,0.000240508,0.00001506517,0.001729578,0.5364303,0.1397518,0.1471335,0.001976683,0.1666994],"study_design_scores_gemma":[0.003701019,0.0004616207,0.00003484739,0.0003782269,0.00002738223,0.000009682259,0.00187914,0.7923366,0.1543602,0.01703438,0.02914264,0.0006343111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03177328,0.0005157312,0.9644915,0.0005897496,0.0001468721,0.001918203,0.0003967445,0.00005602443,0.0001118214],"genre_scores_gemma":[0.08545673,0.0005828209,0.9098945,0.000008418979,0.0001907648,0.001468486,0.0000932605,0.00007220008,0.002232789],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2559063,"threshold_uncertainty_score":0.8180086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229454424","doi":"10.1155/2022/6357701","title":"Optimal HARA Investments with Terminal VaR Constraints","year":2022,"lang":"en","type":"article","venue":"Advances in Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Kurtosis; Economics; Value at risk; Econometrics; Vector autoregression; Portfolio; Constraint (computer-aided design); Sharpe ratio; Risk aversion (psychology); Investment strategy; Expected utility hypothesis; Risk management; Microeconomics; Mathematics; Financial economics; Statistics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.05641709270933117,"gpt":0.3405876113744449,"spread":0.2841705186651137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006245047,0.00008362202,0.0001604928,0.0003455871,0.0007163082,0.000069969,0.0003456495,0.00002404931,0.0006166091],"category_scores_gemma":[0.0001068183,0.00009283795,0.00001994082,0.0009699936,0.0002967065,0.000375334,0.0001594728,0.0003910462,0.0001599233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001920946,"about_ca_system_score_gemma":0.0001320549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001598702,"about_ca_topic_score_gemma":0.0001182731,"domain_scores_codex":[0.9988305,0.00001772731,0.000318053,0.0003790517,0.0001217743,0.0003328816],"domain_scores_gemma":[0.9995213,0.0000633399,0.00003531386,0.0002502982,0.00007008079,0.00005966027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002189504,0.0001780648,0.002150239,0.000008528164,0.000005202032,0.00001268034,0.0003740451,0.02953849,0.00001054153,0.9647888,0.00004404819,0.00286747],"study_design_scores_gemma":[0.004550955,0.001932681,0.02110723,0.00007109802,0.000007931325,0.000236036,0.00567665,0.09955655,0.0001898324,0.4266176,0.4386832,0.001370228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2518165,0.01010532,0.6497431,0.002727434,0.0003427124,0.002178172,0.001123202,0.00007458731,0.08188905],"genre_scores_gemma":[0.9819337,0.0001789045,0.01525531,0.0001377617,0.00004556431,0.001731861,0.00004612916,0.00001548581,0.0006552713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7301173,"threshold_uncertainty_score":0.6751437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}