{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Soulef Smaoui","is_ca":false},{"name":"Habib Chabchoub","is_ca":false},{"name":"Belaı̈d Aouni","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005912428,0.00260615,0.002062166,0.002663962,0.0009065303,0.004314932,0.002534823,0.002256055,0.005561387],"category_scores_gemma":[0.009822846,0.0006791824,0.001934093,0.004234062,0.002753598,0.003105174,0.002156803,0.005504814,0.0019248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002070707,"about_ca_system_score_gemma":0.002267959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001583632,"about_ca_topic_score_gemma":0.001149215,"domain_scores_codex":[0.9952785,0.002482499,0.0003650276,0.000537771,0.001163814,0.0001723578],"domain_scores_gemma":[0.9921595,0.00631467,0.0004158251,0.0002464951,0.0007608895,0.0001025825],"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.00001842321,0.00007724087,0.0002406671,0.0006199631,0.0001098432,0.0001051611,0.000225518,0.09324387,0.0003096587,0.8372944,0.006170448,0.06158474],"study_design_scores_gemma":[0.00001652067,0.00004135968,0.0001128691,0.0001093716,0.00002153551,0.00006916007,0.00005539468,0.2043677,0.0001667091,0.7781389,0.01688024,0.00002025306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001213578,0.007973925,0.9773502,0.00203405,0.0002521399,0.00007733038,0.0001141388,0.00007439429,0.01091007],"genre_scores_gemma":[0.1097261,0.0335882,0.8362828,0.0014722,0.0036378,0.001458737,0.00056082,0.0001495925,0.0131237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005912428,"threshold_uncertainty_score":0.03126824,"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)","authors":[{"name":"Kevin K. H. Cheung","is_ca":true},{"name":"Babak Moazzez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006108857,0.001516315,0.001337417,0.001395482,0.0007317268,0.002997599,0.001316281,0.000956432,0.004408859],"category_scores_gemma":[0.01450846,0.0006634737,0.001704075,0.001308712,0.002713123,0.003884669,0.003012279,0.004646091,0.0007817518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001691354,"about_ca_system_score_gemma":0.001965861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004644102,"about_ca_topic_score_gemma":0.0004298874,"domain_scores_codex":[0.9973626,0.001345999,0.0001115177,0.0002447987,0.0006301493,0.0003050276],"domain_scores_gemma":[0.9940002,0.004083876,0.0004281925,0.0006382519,0.0005974441,0.0002519932],"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.0001186193,0.00007023518,0.0003834823,0.0001002586,0.00002136957,0.0001108407,0.0001411479,0.1721449,0.001854316,0.8000752,0.00141407,0.02356557],"study_design_scores_gemma":[0.00004700581,0.0001347773,0.0001312876,0.00005511387,0.00001450633,0.00007118063,0.0000372607,0.4666327,0.004068276,0.5258622,0.002917763,0.00002802031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04905515,0.0002634843,0.9371182,0.0004453102,0.00006818192,0.0001160999,0.0001275131,0.0003630224,0.01244301],"genre_scores_gemma":[0.7433782,0.0005938506,0.2482616,0.0002631421,0.0001107763,0.0004276528,0.0003704579,0.0003908839,0.00620344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006108857,"threshold_uncertainty_score":0.03230709,"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","authors":[{"name":"Marcos Escobar‐Anel","is_ca":true},{"name":"Maximilian Keller","is_ca":false},{"name":"Rudi Zagst","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257302,0.0007743366,0.0008858146,0.0004840257,0.0002976076,0.00228611,0.0006839031,0.001032455,0.003534373],"category_scores_gemma":[0.01006826,0.0005371714,0.000589495,0.0003720375,0.001013807,0.002167394,0.001316978,0.001231683,0.0003487834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055812,"about_ca_system_score_gemma":0.001015181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001042576,"about_ca_topic_score_gemma":0.0007745469,"domain_scores_codex":[0.9991346,0.0004241179,0.00003336687,0.0001090133,0.0001404565,0.0001585401],"domain_scores_gemma":[0.9973778,0.00173814,0.0003164018,0.0001511813,0.0001996951,0.0002167647],"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.0001695879,0.00009579324,0.001096172,0.00006578225,0.000049901,0.0002287173,0.0000810055,0.7207254,0.002047031,0.2561137,0.0009592163,0.01836772],"study_design_scores_gemma":[0.00002211765,0.0001198563,0.0003656447,0.0000285409,0.00001964875,0.000051329,0.00005812534,0.9180673,0.000646102,0.07993232,0.0006732361,0.00001582934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2301521,0.0007937459,0.7429447,0.0008352803,0.00006105952,0.00009299391,0.0001455607,0.0001736267,0.02480092],"genre_scores_gemma":[0.9656072,0.0003506901,0.02854931,0.00007853885,0.00002245539,0.00005332801,0.00004493419,0.00003520463,0.005258445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003534373,"threshold_uncertainty_score":0.01193792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}