{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012135782,0.007973925,0.97735023,0.00203405,0.0002521399,0.000077330384,0.000114138755,0.000074394295,0.0109100705],"genre_scores_gemma":[0.109726146,0.033588197,0.83628285,0.0014722002,0.0036377998,0.0014587373,0.00056082004,0.00014959251,0.013123698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952785,0.002482499,0.00036502763,0.000537771,0.0011638136,0.00017235779],"domain_scores_gemma":[0.99215955,0.00631467,0.00041582514,0.00024649512,0.0007608895,0.00010258253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005912428,0.0026061495,0.0020621663,0.0026639618,0.0009065303,0.004314932,0.002534823,0.0022560554,0.005561387],"category_scores_gemma":[0.009822846,0.00067918235,0.0019340926,0.0042340616,0.0027535981,0.0031051743,0.002156803,0.005504814,0.0019247999],"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.000018423214,0.00007724087,0.00024066713,0.0006199631,0.00010984319,0.00010516114,0.00022551797,0.093243875,0.00030965873,0.8372944,0.006170448,0.061584745],"study_design_scores_gemma":[0.00001652067,0.000041359675,0.00011286911,0.00010937157,0.00002153551,0.000069160065,0.00005539468,0.20436768,0.00016670907,0.7781389,0.01688024,0.000020253055],"about_ca_topic_score_codex":0.0015836322,"about_ca_topic_score_gemma":0.0011492152,"teacher_disagreement_score":0.005912428,"about_ca_system_score_codex":0.0020707066,"about_ca_system_score_gemma":0.0022679586,"threshold_uncertainty_score":0.03126824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04905515,0.00026348428,0.93711823,0.00044531023,0.00006818192,0.00011609988,0.00012751309,0.0003630224,0.012443009],"genre_scores_gemma":[0.7433782,0.0005938506,0.24826159,0.00026314205,0.00011077632,0.0004276528,0.00037045788,0.0003908839,0.0062034396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736255,0.0013459988,0.0001115177,0.0002447987,0.00063014927,0.00030502758],"domain_scores_gemma":[0.9940002,0.0040838756,0.00042819246,0.00063825195,0.0005974441,0.00025199325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061088568,0.0015163154,0.0013374169,0.0013954823,0.0007317268,0.002997599,0.0013162807,0.000956432,0.004408859],"category_scores_gemma":[0.014508461,0.00066347374,0.001704075,0.0013087122,0.002713123,0.0038846687,0.0030122788,0.0046460913,0.0007817518],"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.000118619304,0.00007023518,0.0003834823,0.000100258614,0.000021369573,0.00011084068,0.00014114792,0.17214493,0.001854316,0.8000752,0.0014140701,0.023565566],"study_design_scores_gemma":[0.000047005815,0.00013477729,0.00013128757,0.00005511387,0.000014506335,0.00007118063,0.0000372607,0.4666327,0.0040682764,0.5258622,0.0029177626,0.000028020313],"about_ca_topic_score_codex":0.0004644102,"about_ca_topic_score_gemma":0.00042988738,"teacher_disagreement_score":0.0061088568,"about_ca_system_score_codex":0.001691354,"about_ca_system_score_gemma":0.0019658613,"threshold_uncertainty_score":0.03230709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23015215,0.0007937459,0.74294466,0.00083528034,0.00006105952,0.000092993905,0.0001455607,0.00017362667,0.024800923],"genre_scores_gemma":[0.96560717,0.00035069007,0.028549306,0.000078538855,0.000022455391,0.000053328014,0.000044934193,0.00003520463,0.005258445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991346,0.00042411793,0.000033366872,0.000109013316,0.00014045645,0.00015854008],"domain_scores_gemma":[0.99737775,0.0017381399,0.00031640177,0.00015118132,0.00019969506,0.00021676467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022573017,0.0007743366,0.0008858146,0.00048402575,0.00029760756,0.0022861103,0.0006839031,0.0010324552,0.0035343727],"category_scores_gemma":[0.010068258,0.0005371714,0.000589495,0.00037203747,0.0010138067,0.002167394,0.0013169785,0.0012316826,0.00034878345],"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.00016958792,0.000095793235,0.0010961721,0.000065782246,0.000049901,0.00022871728,0.0000810055,0.7207254,0.0020470307,0.25611368,0.0009592163,0.018367719],"study_design_scores_gemma":[0.000022117654,0.00011985631,0.00036564466,0.000028540897,0.000019648747,0.000051329003,0.00005812534,0.91806734,0.000646102,0.079932325,0.0006732361,0.000015829342],"about_ca_topic_score_codex":0.0010425757,"about_ca_topic_score_gemma":0.00077454693,"teacher_disagreement_score":0.0035343727,"about_ca_system_score_codex":0.0010558125,"about_ca_system_score_gemma":0.0010151811,"threshold_uncertainty_score":0.011937916},"labels":[],"label_agreement":null}]}