{"meta":{"query_hash":"a9718cbe27e9","filters":{"venue":"Advances in Operations Research"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/a9718cbe27e9","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.684554646724707,"score_gpt":0.5742336040941309,"score_spread":0.11032104263057607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124986648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034744723,0.00020720343,0.9814897,0.0023771555,0.00002344981,0.001424033,0.0000046793284,0.00005942151,0.010939878],"genre_scores_gemma":[0.2733633,0.00006359265,0.7254098,0.000033351433,0.00004339155,0.00052513456,0.0000043061114,0.0000136610215,0.0005434775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977888,0.00033860686,0.00043346078,0.00040814152,0.00052663556,0.00050438463],"domain_scores_gemma":[0.9983972,0.0008809089,0.000016955571,0.00039462,0.00016359614,0.00014675935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021848714,0.00012547338,0.00022027624,0.00026062017,0.0002484367,0.00010646539,0.00026077777,0.00006827203,0.00003820857],"category_scores_gemma":[0.0034124753,0.00010515725,0.000027899065,0.00081664085,0.000109953726,0.00045875346,0.00005199046,0.00039579385,0.000050836043],"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.000009424827,0.00025688607,0.00001043616,0.000042073134,0.0000014135214,0.0000018001995,0.00067832536,0.0033882686,0.00031576757,0.77051765,0.000022392964,0.22475557],"study_design_scores_gemma":[0.00017516428,0.00021779348,0.00009251431,0.00010030165,0.0000025605934,0.0000037337034,0.0005649683,0.06122908,0.0002778237,0.9329125,0.0042761005,0.00014740323],"about_ca_topic_score_codex":0.000002959174,"about_ca_topic_score_gemma":0.00010018395,"teacher_disagreement_score":0.26988882,"about_ca_system_score_codex":0.0001232547,"about_ca_system_score_gemma":0.000060651957,"threshold_uncertainty_score":0.4288188},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.24570995910870164,"score_gpt":0.5069657763647945,"score_spread":0.2612558172560928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513208540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031773277,0.0005157312,0.96449155,0.0005897496,0.0001468721,0.0019182032,0.00039674446,0.00005602443,0.000111821355],"genre_scores_gemma":[0.08545673,0.00058282085,0.9098945,0.000008418979,0.0001907648,0.0014684862,0.0000932605,0.000072200084,0.0022327893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683934,0.0005561779,0.00074537547,0.0005328814,0.0006669833,0.00065925386],"domain_scores_gemma":[0.99471587,0.0020732044,0.00007476595,0.00053421047,0.0024693739,0.00013256604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988064,0.0001871858,0.00035450762,0.00060074177,0.00045793917,0.00006002654,0.00036326915,0.00012288503,0.00026599667],"category_scores_gemma":[0.0068328776,0.00013929061,0.00009617006,0.0012597999,0.00057057146,0.0009791869,0.00015918243,0.00028476457,0.00001319882],"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.0010823462,0.0026182625,0.0016822388,0.0006403267,0.00024050797,0.00001506517,0.0017295785,0.5364303,0.13975176,0.14713354,0.001976683,0.1666994],"study_design_scores_gemma":[0.0037010193,0.00046162072,0.00003484739,0.00037822692,0.000027382232,0.000009682259,0.00187914,0.7923366,0.15436018,0.017034376,0.02914264,0.00063431106],"about_ca_topic_score_codex":0.000051040905,"about_ca_topic_score_gemma":0.00047934087,"teacher_disagreement_score":0.25590628,"about_ca_system_score_codex":0.00036504216,"about_ca_system_score_gemma":0.00033246313,"threshold_uncertainty_score":0.8180086},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05641709270933117,"score_gpt":0.3405876113744449,"score_spread":0.2841705186651137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229454424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25181645,0.010105316,0.6497431,0.0027274336,0.00034271242,0.0021781719,0.0011232016,0.00007458731,0.08188905],"genre_scores_gemma":[0.9819337,0.00017890452,0.015255307,0.0001377617,0.000045564306,0.0017318613,0.000046129157,0.000015485813,0.00065527135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988305,0.000017727309,0.00031805297,0.00037905172,0.00012177427,0.00033288158],"domain_scores_gemma":[0.9995213,0.0000633399,0.000035313864,0.00025029818,0.00007008079,0.000059660266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006245047,0.00008362202,0.00016049281,0.0003455871,0.00071630825,0.000069969,0.0003456495,0.000024049308,0.00061660906],"category_scores_gemma":[0.00010681831,0.00009283795,0.000019940824,0.00096999365,0.0002967065,0.00037533397,0.00015947277,0.0003910462,0.0001599233],"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.000021895039,0.00017806485,0.0021502387,0.0000085281645,0.0000052020323,0.000012680343,0.00037404514,0.029538492,0.000010541535,0.9647888,0.00004404819,0.0028674705],"study_design_scores_gemma":[0.004550955,0.0019326814,0.021107228,0.000071098024,0.000007931325,0.00023603601,0.00567665,0.09955655,0.00018983237,0.42661756,0.43868324,0.0013702285],"about_ca_topic_score_codex":0.00015987018,"about_ca_topic_score_gemma":0.000118273056,"teacher_disagreement_score":0.73011726,"about_ca_system_score_codex":0.00019209457,"about_ca_system_score_gemma":0.00013205493,"threshold_uncertainty_score":0.6751437},"labels":[],"label_agreement":null}]}