{"meta":{"query_hash":"80010de21138","filters":{"venue":"INFORMS journal on computing"},"cohort_total":201,"direct_labels_cover":0,"predictions_cover":201,"exported":201,"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/80010de21138","api":"https://metacan.xera.ac/api/v1/cohort?venue=INFORMS+journal+on+computing"},"results":[{"id":"W1511489666","doi":"10.1287/ijoc.1080.0283","title":"Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Organizational Management and Leadership","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Integer programming; Computer science; Point (geometry); Production (economics); Integer (computer science); Symmetry breaking; Algorithm; Mathematics","score_opus":0.056480628773111,"score_gpt":0.2560955779263339,"score_spread":0.19961494915322292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511489666","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.0391943,0.0001337818,0.95554227,0.0002247809,0.000030028319,0.00015927835,0.00013891974,0.00013934806,0.0044373083],"genre_scores_gemma":[0.467418,0.00035313668,0.5281845,0.00009719023,0.000041824205,0.00045123685,0.00029884055,0.00014670235,0.0030085798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984692,0.00079450436,0.000092008624,0.00021609712,0.00027751838,0.00015062648],"domain_scores_gemma":[0.9954581,0.0034084278,0.00046477228,0.0003207184,0.00023328888,0.00011467489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031361622,0.0012769756,0.0015876989,0.000639807,0.00072693976,0.0015768289,0.0015168461,0.00091941917,0.0046456456],"category_scores_gemma":[0.0066119093,0.0012244129,0.0018164503,0.0016169377,0.0011091733,0.0028737672,0.0009880324,0.0017964928,0.00046361715],"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.000054933967,0.000038959217,0.00019904126,0.00007706565,0.000026897362,0.0000678997,0.000032167067,0.9640589,0.0010553389,0.022865063,0.00035106228,0.011172634],"study_design_scores_gemma":[0.000026353338,0.000036033765,0.000075516225,0.000007148876,0.000010250923,0.000019291072,0.0000160781,0.9746996,0.00094909535,0.023527116,0.00062592403,0.0000076270853],"about_ca_topic_score_codex":0.004032204,"about_ca_topic_score_gemma":0.0047361716,"teacher_disagreement_score":0.0046456456,"about_ca_system_score_codex":0.0018009422,"about_ca_system_score_gemma":0.0021954286,"threshold_uncertainty_score":0.016585767},"labels":[],"label_agreement":null},{"id":"W1955062487","doi":"10.1287/ijoc.2015.0645","title":"Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of British Columbia","funders":"","keywords":"Mathematical optimization; Computer science; Workload; Scheduling (production processes); Linear programming; Dynamic programming; Queueing theory; Bellman equation; Dynamic priority scheduling; Schedule; Mathematics","score_opus":0.164072637517607,"score_gpt":0.4497476770576229,"score_spread":0.28567503954001594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1955062487","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.009146957,0.000048874645,0.9892697,0.00010116607,0.000014527825,0.000033372613,0.00001707736,0.00015407092,0.0012142854],"genre_scores_gemma":[0.6533083,0.00019746194,0.34233287,0.00011984372,0.00003842256,0.0004590604,0.00012489675,0.00013331667,0.0032858262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989191,0.0005511377,0.000046972233,0.00011252149,0.00025151815,0.00011876911],"domain_scores_gemma":[0.9959273,0.003043028,0.00028636848,0.00019726259,0.00043503856,0.00011101748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021453337,0.0006893904,0.0011820581,0.00062784477,0.00044214702,0.0010425017,0.001224624,0.0009338274,0.0025591978],"category_scores_gemma":[0.00837551,0.00073458406,0.0008253783,0.00063933735,0.000992019,0.0011479886,0.0013320411,0.0016768201,0.00034555403],"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.00002799015,0.00001157936,0.0001607553,0.000010635429,0.0000068306563,0.000012010078,0.000018990031,0.9893861,0.00019241321,0.0050707404,0.00008218089,0.0050197886],"study_design_scores_gemma":[0.0000034113054,0.000004214582,0.0000068765116,0.0000012704169,6.872496e-7,0.0000017366161,0.0000014078643,0.9989503,0.0000725153,0.0008714847,0.000084785206,0.0000013274374],"about_ca_topic_score_codex":0.010462509,"about_ca_topic_score_gemma":0.004743135,"teacher_disagreement_score":0.010462509,"about_ca_system_score_codex":0.0017340487,"about_ca_system_score_gemma":0.0026729896,"threshold_uncertainty_score":0.020803273},"labels":[],"label_agreement":null},{"id":"W1969556115","doi":"10.1287/ijoc.1100.0435","title":"Efficient and Reliable Computation of Birth-Death Process Performance Measures","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Arithmetic underflow; Population; Algorithm; Bounded function; Queueing theory; Computation; Truncation (statistics); Mathematical optimization; Range (aeronautics); Computer science; Applied mathematics; Statistics","score_opus":0.012062212585417818,"score_gpt":0.24650808103810595,"score_spread":0.23444586845268814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969556115","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.0066436715,0.00005314146,0.9912675,0.00006483869,0.000018554587,0.000036408444,0.000042013624,0.0011541898,0.0007196296],"genre_scores_gemma":[0.3172708,0.00017142615,0.67937165,0.00009594306,0.000059398415,0.0003223817,0.00032196153,0.00041165942,0.0019748444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824727,0.00034306073,0.00014076466,0.00027934072,0.0007821814,0.00020740634],"domain_scores_gemma":[0.99188626,0.004007517,0.00079878647,0.0010866966,0.0019860116,0.00023475758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035074025,0.001203396,0.0011680112,0.0018745225,0.0009806047,0.0023042602,0.002280198,0.0013053213,0.002859219],"category_scores_gemma":[0.025089776,0.00068913755,0.00070460036,0.0011011064,0.001069078,0.002338452,0.0022684291,0.0022231024,0.0014508174],"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.00014761252,0.000073016585,0.00246335,0.00007044084,0.000044318233,0.00012128607,0.00016028552,0.8398935,0.0040042237,0.046812758,0.0019387569,0.104270376],"study_design_scores_gemma":[0.000013724912,0.000010177267,0.00011921187,0.000007098924,0.000004388582,0.00002010843,0.000007915261,0.9829557,0.0015083078,0.014950308,0.0003932668,0.000009817933],"about_ca_topic_score_codex":0.0036046132,"about_ca_topic_score_gemma":0.0026931802,"teacher_disagreement_score":0.0036046132,"about_ca_system_score_codex":0.0019325579,"about_ca_system_score_gemma":0.0035017626,"threshold_uncertainty_score":0.018549144},"labels":[],"label_agreement":null},{"id":"W1987039917","doi":"10.1287/ijoc.1040.0080","title":"The Minmax Relative Regret Median Problem on Networks","year":2005,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Minimax; Mathematical optimization; Interval (graph theory); Function (biology); Node (physics); Mathematics; Value (mathematics); Computer science; Combinatorics; Statistics","score_opus":0.018278798887708964,"score_gpt":0.23456226917631032,"score_spread":0.21628347028860134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987039917","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.054573115,0.0010593148,0.9357748,0.0012192518,0.00008611844,0.0000907438,0.0007003166,0.0004859698,0.006010319],"genre_scores_gemma":[0.6659681,0.0016685633,0.31777287,0.00033186984,0.00041748767,0.0003927061,0.0013374322,0.00032843146,0.011782627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982862,0.000771391,0.00006354636,0.00039793688,0.00020943349,0.0002715246],"domain_scores_gemma":[0.9976169,0.0016281601,0.00029193153,0.00017748892,0.00014196067,0.00014349837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026350091,0.0013124357,0.0024757395,0.00088007905,0.0009186801,0.00238872,0.0018672283,0.0024271437,0.0055023185],"category_scores_gemma":[0.006645534,0.0007322458,0.00088774954,0.0018559933,0.0011253736,0.005196608,0.0019989128,0.0018509754,0.0006855505],"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.00035726532,0.00006173583,0.0003920179,0.0001419459,0.00005828287,0.000089006644,0.00008633248,0.91418207,0.00080096436,0.04500728,0.0039063278,0.03491669],"study_design_scores_gemma":[0.000040518793,0.000064475804,0.00019360044,0.00001623283,0.000013867763,0.0000634503,0.000052824646,0.8600093,0.00062693475,0.1368869,0.0020179632,0.000013939443],"about_ca_topic_score_codex":0.0023160316,"about_ca_topic_score_gemma":0.0018927373,"teacher_disagreement_score":0.0055023185,"about_ca_system_score_codex":0.0020398682,"about_ca_system_score_gemma":0.00086669094,"threshold_uncertainty_score":0.018407047},"labels":[],"label_agreement":null},{"id":"W2002577241","doi":"10.1287/ijoc.1070.0228","title":"An Algorithm for Computing Minimal% Coxian Representations","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Research Council Canada; Chinese Academy of Sciences","keywords":"Set (abstract data type); Representation (politics); Algorithm; Laplace transform; Distribution (mathematics); Function (biology); Mathematics; Computer science; Mathematical analysis","score_opus":0.053115135207849364,"score_gpt":0.3986818688883142,"score_spread":0.3455667336804648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002577241","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.0131450845,0.0000679832,0.98131096,0.00009739936,0.000030967316,0.00006788116,0.00016933406,0.0014974352,0.0036128908],"genre_scores_gemma":[0.13297196,0.00006767183,0.8631176,0.000049798244,0.000023250393,0.00013876567,0.00078445725,0.00039469672,0.0024518932],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955565,0.00006217043,0.000036460944,0.00009563473,0.00017271873,0.00007731557],"domain_scores_gemma":[0.99901414,0.00042058673,0.00006517941,0.0001796737,0.00027153268,0.000048931965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094292,0.0006368497,0.0006974064,0.001597392,0.0008692386,0.001525235,0.0013734918,0.0005832265,0.0107047055],"category_scores_gemma":[0.0039429413,0.00037091467,0.0008543823,0.0010226985,0.00066042104,0.0018183984,0.0018463235,0.0011224176,0.0024790012],"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.00036023752,0.00013274586,0.0014790338,0.0002930848,0.000076201475,0.00016977788,0.000295614,0.067133226,0.015209912,0.22289485,0.010081904,0.6818734],"study_design_scores_gemma":[0.00011835141,0.000110935674,0.00046481687,0.000048658625,0.000043335076,0.00022378014,0.0002362324,0.5988848,0.01767674,0.36495394,0.017177181,0.00006121684],"about_ca_topic_score_codex":0.0014857464,"about_ca_topic_score_gemma":0.0021520047,"teacher_disagreement_score":0.0107047055,"about_ca_system_score_codex":0.00083048776,"about_ca_system_score_gemma":0.0015598988,"threshold_uncertainty_score":0.03581077},"labels":[],"label_agreement":null},{"id":"W2003457692","doi":"10.1287/ijoc.1060.0196","title":"Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Royal Military College of Canada; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable neighborhood search; Mathematical optimization; Heuristic; Variable (mathematics); Metaheuristic; Simple (philosophy); Mathematics; Metric (unit); Resolution (logic); Fixed cost; Dual (grammatical number); Local search (optimization); Computer science; Engineering; Artificial intelligence; Operations management","score_opus":0.03282244739683856,"score_gpt":0.2662847082374216,"score_spread":0.23346226084058305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003457692","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.09578269,0.0007098465,0.8905191,0.00043936248,0.000093452676,0.00017117483,0.0002414477,0.00025336753,0.0117895305],"genre_scores_gemma":[0.5709993,0.00034559195,0.42273772,0.0001265419,0.000058993257,0.0003908222,0.0003386015,0.00012021329,0.0048821103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996271,0.00021287761,0.000009131288,0.00004077186,0.000067508096,0.000042529748],"domain_scores_gemma":[0.9992167,0.0005747665,0.000068146954,0.00003383936,0.00006632309,0.000040239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012987414,0.00062271435,0.0012902835,0.00081877736,0.00040691372,0.000770823,0.0007573027,0.00092035916,0.0033777682],"category_scores_gemma":[0.0024517996,0.00044340122,0.0005501843,0.0009272679,0.00069441437,0.0005445287,0.0007218489,0.0009000393,0.00029425576],"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.000058278554,0.000046901117,0.00020428636,0.00005415255,0.000017306824,0.000038284834,0.000013684181,0.9762681,0.0002530397,0.010869448,0.0008145002,0.0113620935],"study_design_scores_gemma":[0.000017563187,0.000019942128,0.000048863087,0.0000052447117,0.0000043401637,0.000009468342,0.0000059749464,0.9957658,0.00010897564,0.0036719313,0.00033978603,0.0000021030296],"about_ca_topic_score_codex":0.003890245,"about_ca_topic_score_gemma":0.003795907,"teacher_disagreement_score":0.003890245,"about_ca_system_score_codex":0.00084698614,"about_ca_system_score_gemma":0.0013788464,"threshold_uncertainty_score":0.011299729},"labels":[],"label_agreement":null},{"id":"W2008959214","doi":"10.1287/ijoc.12.2.104.11897","title":"Minmax Regret Median Location on a Network Under Uncertainty","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regret; Minimax; Mathematical optimization; Node (physics); Interval (graph theory); Mathematics; Function (biology); Computer science; Time complexity; Algorithm; Combinatorics; Statistics","score_opus":0.023380886780252845,"score_gpt":0.24072696097421967,"score_spread":0.21734607419396682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008959214","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.047142725,0.0008664416,0.9443959,0.0012758904,0.000071387556,0.000069466834,0.0006381338,0.0005130237,0.0050270646],"genre_scores_gemma":[0.7127525,0.001160817,0.27542955,0.000288944,0.00023769858,0.00025593187,0.0011269044,0.00023668497,0.0085109575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857676,0.00062936713,0.000055112145,0.00030310408,0.00017639202,0.0002592184],"domain_scores_gemma":[0.9967231,0.0023561616,0.0003701435,0.00019999553,0.0002051546,0.00014545323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025666542,0.0013862038,0.0026754835,0.00083183404,0.0009255127,0.0021164736,0.00179161,0.002523537,0.004390273],"category_scores_gemma":[0.006955198,0.0006997929,0.0008652201,0.0018566357,0.0011662791,0.0040559866,0.0020269668,0.001690248,0.00070832035],"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.00021930692,0.000029671868,0.00030274113,0.00008382927,0.000026852946,0.000058834525,0.00004813176,0.9521197,0.00035712027,0.025491253,0.002366624,0.018895932],"study_design_scores_gemma":[0.000017482891,0.000035159304,0.00010153337,0.000011016704,0.00000771311,0.000031036972,0.000032927117,0.94473517,0.00033733656,0.05401646,0.00066630344,0.000007901362],"about_ca_topic_score_codex":0.0043207314,"about_ca_topic_score_gemma":0.0037167806,"teacher_disagreement_score":0.004390273,"about_ca_system_score_codex":0.002576457,"about_ca_system_score_gemma":0.0013645412,"threshold_uncertainty_score":0.018693566},"labels":[],"label_agreement":null},{"id":"W2013001756","doi":"10.1287/ijoc.1050.0157","title":"A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary<i>M(t)/M/s(t)</i>Queueing Systems with Exhaustive Discipline","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Approximation algorithm; Computation; Approximation error; Computer science; Ordinary differential equation; Mathematical optimization; Solver; Set (abstract data type); Closure (psychology); Applied mathematics; Mathematics; Differential equation; Algorithm; Statistics; Mathematical analysis","score_opus":0.05855104518789757,"score_gpt":0.3763409439001331,"score_spread":0.31778989871223556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013001756","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.22853617,0.0045631276,0.75878197,0.00031301723,0.00014363352,0.00019217466,0.00017058855,0.0031077152,0.0041915765],"genre_scores_gemma":[0.6342534,0.0027615405,0.3609247,0.000108320855,0.00006173537,0.00021305581,0.00041791148,0.00029959617,0.00095971214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.0012222484,0.00038552,0.0004224936,0.0012896669,0.00013439407],"domain_scores_gemma":[0.98160833,0.013218118,0.00094364194,0.0017237792,0.0022825783,0.00022354649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238201,0.0008144796,0.0011426945,0.0011018735,0.000596443,0.0009720956,0.0019820735,0.0012037422,0.0013356934],"category_scores_gemma":[0.020699387,0.00059256144,0.0006868931,0.0019329865,0.00052623625,0.0016301473,0.00060318137,0.0008784513,0.0004340254],"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.0011694744,0.00089196267,0.0063366964,0.00086613896,0.00030421565,0.00006940358,0.00046552386,0.52290696,0.010411413,0.007806477,0.0019694827,0.44680226],"study_design_scores_gemma":[0.000092822826,0.00032360243,0.0013621515,0.000058041354,0.000038217986,0.0000619127,0.00007538925,0.98559254,0.00909074,0.0015060799,0.0017682364,0.000030154244],"about_ca_topic_score_codex":0.0069936016,"about_ca_topic_score_gemma":0.0039624413,"teacher_disagreement_score":0.0069936016,"about_ca_system_score_codex":0.0011094983,"about_ca_system_score_gemma":0.0013589031,"threshold_uncertainty_score":0.022414029},"labels":[],"label_agreement":null},{"id":"W2026120045","doi":"10.1287/ijoc.2013.0576","title":"On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Lattice (music); Pseudorandom number generator; Mathematics; Random number generation; Class (philosophy); Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Artificial intelligence","score_opus":0.010668193145422323,"score_gpt":0.23740402245263292,"score_spread":0.2267358293072106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026120045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55401903,0.0007715768,0.41368723,0.0007308661,0.00009658226,0.000121658464,0.00016208271,0.0002868719,0.030124119],"genre_scores_gemma":[0.9710807,0.00027758515,0.025067579,0.00006520807,0.000091174035,0.000086539534,0.00010406188,0.00005811885,0.003168928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00015160421,0.00001713397,0.000064468244,0.00009670891,0.000085814594],"domain_scores_gemma":[0.9975292,0.0013636178,0.00043474665,0.00024122496,0.00023473153,0.00019647542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075002766,0.0002926161,0.0005518639,0.0010082321,0.00083295925,0.001420044,0.00062711333,0.0007529753,0.002993849],"category_scores_gemma":[0.0044150255,0.00027109517,0.0005297988,0.00055128615,0.0018585012,0.0014359826,0.0007301689,0.0009169063,0.00040531676],"study_design_candidate":"simulation_or_modeling","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.00006718995,0.000026318108,0.00064268184,0.00003789381,0.000012235311,0.00028131262,0.00015338391,0.033089314,0.005507891,0.9541535,0.00060350425,0.005424894],"study_design_scores_gemma":[0.00007981448,0.00012782398,0.00065367745,0.000022711749,0.000011669397,0.00048342368,0.00008391532,0.4100859,0.0030865925,0.583124,0.0021911508,0.00004945879],"about_ca_topic_score_codex":0.0004036495,"about_ca_topic_score_gemma":0.0002980204,"teacher_disagreement_score":0.002993849,"about_ca_system_score_codex":0.00048640257,"about_ca_system_score_gemma":0.00036777937,"threshold_uncertainty_score":0.010015428},"labels":[],"label_agreement":null},{"id":"W2027524005","doi":"10.1287/ijoc.1100.0388","title":"Combining Constraint Programming and Local Search for Job-Shop Scheduling","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; U.S. Department of Energy","keywords":"Tabu search; Constraint programming; Computer science; Job shop scheduling; Mathematical optimization; Guided Local Search; Flow shop scheduling; Hybrid algorithm (constraint satisfaction); Job shop; Local search (optimization); Scheduling (production processes); Iterated local search; Algorithm; Mathematics; Constraint logic programming; Schedule","score_opus":0.016612609349493813,"score_gpt":0.26632303167577015,"score_spread":0.24971042232627633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027524005","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.007011356,0.00022999995,0.98928845,0.00011753322,0.000020022506,0.000072753304,0.000026162905,0.0006260078,0.0026076506],"genre_scores_gemma":[0.25726783,0.00038972907,0.73917514,0.00020647077,0.00007592687,0.00038330417,0.0001229813,0.00026335154,0.0021152184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982609,0.0007855543,0.00006278719,0.00019578426,0.0005895257,0.00010536216],"domain_scores_gemma":[0.9963581,0.0027568564,0.00017712437,0.00029337252,0.00032312796,0.00009135423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026239892,0.00086338614,0.0012809132,0.0010697407,0.0006201279,0.0013612327,0.001945228,0.0010161288,0.0021857873],"category_scores_gemma":[0.0066166087,0.0005576619,0.00069859147,0.0024091455,0.000904112,0.0015831965,0.0015710598,0.0014468803,0.0006017668],"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.00008038448,0.00009969343,0.00036176384,0.00014329878,0.00008021111,0.000054155567,0.00006508654,0.85413784,0.0019348473,0.021826876,0.0013477752,0.11986815],"study_design_scores_gemma":[0.000010591512,0.000023069635,0.00004215157,0.0000050728613,0.000008572222,0.00001003518,0.000006311581,0.99373615,0.0006120834,0.0049290755,0.00061013864,0.000006745968],"about_ca_topic_score_codex":0.0069294316,"about_ca_topic_score_gemma":0.008932111,"teacher_disagreement_score":0.0069294316,"about_ca_system_score_codex":0.001107608,"about_ca_system_score_gemma":0.0017802167,"threshold_uncertainty_score":0.013877153},"labels":[],"label_agreement":null},{"id":"W2031790563","doi":"10.1287/ijoc.1080.0281","title":"Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Copula (linguistics); Multivariate random variable; Univariate; Marginal distribution; Applied mathematics; Multivariate normal distribution; Rate of convergence; Bivariate analysis; Inverse; Random variable; Multivariate statistics; Statistics; Geometry; Computer science","score_opus":0.05511673661127251,"score_gpt":0.34573107416913745,"score_spread":0.2906143375578649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031790563","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.008151074,0.00010885545,0.9904912,0.00006128144,0.000011186946,0.000029208131,0.000030368465,0.0005670923,0.0005497365],"genre_scores_gemma":[0.25192967,0.00021308618,0.74497736,0.00015787676,0.00003623413,0.00014644765,0.0003293932,0.00052356365,0.0016863145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815613,0.00086510484,0.000076728,0.000276757,0.00048326646,0.00014205002],"domain_scores_gemma":[0.9906997,0.006689541,0.00065018336,0.0009008983,0.0008207053,0.00023908362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053312364,0.0010199843,0.0011713348,0.0016012555,0.0006128308,0.0012261863,0.0016521032,0.0012348226,0.002718003],"category_scores_gemma":[0.025722006,0.0007591173,0.0012697859,0.0017254815,0.0011258138,0.0018998918,0.001966449,0.002192778,0.0011375502],"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.0001870506,0.00012491072,0.0035911128,0.00016568699,0.000108220454,0.0002290647,0.00022167648,0.8032329,0.004711198,0.06505235,0.0030809517,0.11929487],"study_design_scores_gemma":[0.0000044167446,0.000007132811,0.00014235287,0.0000047987273,0.0000024977087,0.00002424086,0.0000074123323,0.99434,0.00048704608,0.0046795052,0.0002948647,0.000005735607],"about_ca_topic_score_codex":0.0074744835,"about_ca_topic_score_gemma":0.006405663,"teacher_disagreement_score":0.0074744835,"about_ca_system_score_codex":0.0014181526,"about_ca_system_score_gemma":0.0022598698,"threshold_uncertainty_score":0.028194606},"labels":[],"label_agreement":null},{"id":"W2057096900","doi":"10.1287/ijoc.12.4.317.11880","title":"Approximation of Point Sets by 1-Corner Polygonal Chains","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Monotone polygon; Polygonal chain; Point (geometry); Plane (geometry); Set (abstract data type); Computational geometry; Mathematics; Facility location problem; Combinatorics; Geometry; Mathematical optimization; Field (mathematics); Computer science; Regular polygon; Pure mathematics","score_opus":0.011064204731102003,"score_gpt":0.24432164614904872,"score_spread":0.23325744141794671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057096900","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.14558724,0.0004432697,0.8486679,0.00021690533,0.000030419462,0.000075078235,0.00024698218,0.0002453157,0.0044869483],"genre_scores_gemma":[0.6328238,0.0005807845,0.36302862,0.0000653501,0.000035092387,0.00016531328,0.0005482754,0.00010308228,0.0026497212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930716,0.00017624263,0.000041441992,0.00011747671,0.00025693086,0.000100683545],"domain_scores_gemma":[0.99815434,0.0011884088,0.00023854352,0.00018874342,0.00012396809,0.00010593566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075006625,0.00068010564,0.0012203419,0.0011541668,0.00045056056,0.0015611189,0.0013822827,0.0012556136,0.0030362413],"category_scores_gemma":[0.005848962,0.00072128366,0.0007210775,0.0017243722,0.001026104,0.0018392884,0.0023635624,0.0012710509,0.00046075106],"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.00011750405,0.000040394327,0.0018142932,0.00008974164,0.000023439388,0.00012958104,0.00013206019,0.9394724,0.001893515,0.03284481,0.00060063094,0.022841617],"study_design_scores_gemma":[0.000015375146,0.000033659006,0.00012286232,0.000021116528,0.0000033896883,0.000030387335,0.00003278674,0.97798514,0.0005928967,0.020510001,0.0006460477,0.0000062995337],"about_ca_topic_score_codex":0.0028330213,"about_ca_topic_score_gemma":0.0029125537,"teacher_disagreement_score":0.0030362413,"about_ca_system_score_codex":0.0009245296,"about_ca_system_score_gemma":0.0005128273,"threshold_uncertainty_score":0.0101572275},"labels":[],"label_agreement":null},{"id":"W2059816321","doi":"10.1287/ijoc.1040.0117","title":"The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Shortest path problem; Mathematical optimization; Vehicle routing problem; Benchmark (surveying); Mathematics; Column generation; Relaxation (psychology); Integer (computer science); Path (computing); Scheduling (production processes); Routing (electronic design automation); Computer science; Combinatorics; Graph","score_opus":0.006429132118342962,"score_gpt":0.22400800837229531,"score_spread":0.21757887625395236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059816321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56865185,0.0027468875,0.35798565,0.0023697088,0.00025345507,0.00059585634,0.0063834284,0.00075350964,0.060259666],"genre_scores_gemma":[0.76884097,0.00128007,0.20902431,0.00030554374,0.00008486674,0.00041933855,0.007396282,0.00035792714,0.012290694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.00021378418,0.000030775805,0.00017097517,0.00013331874,0.00026152798],"domain_scores_gemma":[0.9985279,0.0009359372,0.00018763523,0.00009451184,0.00014870486,0.00010533407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073316053,0.0013429896,0.0008703516,0.0005847059,0.0008312759,0.0013216453,0.0011518614,0.0009509392,0.0072938963],"category_scores_gemma":[0.0025244579,0.00046923832,0.0013082923,0.0017008819,0.0006182919,0.0016677711,0.0006933857,0.0022124525,0.00043631403],"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.0002852612,0.00033259965,0.0010024564,0.0005283007,0.000056756584,0.0003366605,0.000115444585,0.9179599,0.0033349777,0.029613035,0.010061785,0.03637279],"study_design_scores_gemma":[0.0001076476,0.0001465414,0.0010680062,0.000036187885,0.000035263532,0.00020845931,0.00019499155,0.95642656,0.0024638383,0.03283006,0.0064545707,0.000027918504],"about_ca_topic_score_codex":0.016723324,"about_ca_topic_score_gemma":0.016459635,"teacher_disagreement_score":0.016723324,"about_ca_system_score_codex":0.0015690447,"about_ca_system_score_gemma":0.002510711,"threshold_uncertainty_score":0.033252},"labels":[],"label_agreement":null},{"id":"W2063249983","doi":"10.1287/ijoc.2014.0596","title":"Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"RNA Interference and Gene Delivery","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite embedding; Semidefinite programming; Rounding; Relaxation (psychology); Reduction (mathematics); Mathematical optimization; Computer science; Cutting-plane method; Constraint (computer-aided design); Constraint programming; Theory of computation; Mathematics; Algorithm; Integer programming; Quadratically constrained quadratic program; Stochastic programming; Quadratic programming","score_opus":0.01886628998821299,"score_gpt":0.2622147740495262,"score_spread":0.2433484840613132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063249983","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.006726485,0.000065509965,0.9905618,0.00013721013,0.000022444441,0.000051976338,0.00003511623,0.00013071248,0.0022688198],"genre_scores_gemma":[0.21838029,0.00029719225,0.7769549,0.00027099953,0.000052083135,0.00045380805,0.0002224683,0.00025530596,0.0031129164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00075944926,0.00004285053,0.00016727168,0.00027001183,0.000072667084],"domain_scores_gemma":[0.99476683,0.004253329,0.00030997043,0.00026674804,0.0002942279,0.00010893371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031489758,0.0013073592,0.0010535362,0.0004517839,0.0004024741,0.0011733683,0.0009931059,0.0007790375,0.00358205],"category_scores_gemma":[0.006048419,0.0007579669,0.0011474442,0.00045853993,0.0015480584,0.0010806039,0.0013649605,0.002716189,0.0005656535],"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.00007812903,0.00010382347,0.00026811627,0.0001360495,0.00003427256,0.00007978952,0.00008215479,0.9084606,0.0035567225,0.05528335,0.0014000072,0.030517016],"study_design_scores_gemma":[0.000016869244,0.000033872104,0.000017944512,0.00000798138,0.0000036220144,0.0000104103865,0.00001067206,0.98060626,0.0008896638,0.017850919,0.0005468077,0.0000050459585],"about_ca_topic_score_codex":0.0011164173,"about_ca_topic_score_gemma":0.0016658884,"teacher_disagreement_score":0.00358205,"about_ca_system_score_codex":0.00082991377,"about_ca_system_score_gemma":0.0010686045,"threshold_uncertainty_score":0.016653538},"labels":[],"label_agreement":null},{"id":"W2078760931","doi":"10.1287/ijoc.2014.0604","title":"Computing the Distribution for the Number of Renewals with Bulk Arrivals","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Laplace transform; Extension (predicate logic); Mathematics; Applied mathematics; Distribution (mathematics); Laplace distribution; Maple; Discrete time and continuous time; Laplace's method; Work (physics); Mathematical optimization; Mathematical analysis; Computer science; Statistics","score_opus":0.016335804549050374,"score_gpt":0.3018363466641695,"score_spread":0.2855005421151191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078760931","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.19223432,0.0001443499,0.8012645,0.00015174557,0.00003566082,0.000040692863,0.0002997043,0.0013165859,0.0045123915],"genre_scores_gemma":[0.76178026,0.00015060435,0.23374906,0.00004116336,0.000033038363,0.0000812101,0.00058299495,0.00022526844,0.0033563334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997241,0.00003160174,0.00001799926,0.00006695787,0.00011969488,0.000039685496],"domain_scores_gemma":[0.9961146,0.0027421662,0.00024035646,0.00031584804,0.00047764817,0.00010946553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703533,0.00026928063,0.0003494774,0.0012420588,0.0003295078,0.0011347515,0.0008248919,0.0004836273,0.004064679],"category_scores_gemma":[0.009949402,0.0002346091,0.00038262716,0.00091236335,0.0005360188,0.0013138785,0.00054785307,0.0006681701,0.0008918666],"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.00037925725,0.000102032885,0.012708478,0.00017040473,0.000040255403,0.0004045584,0.0002902342,0.7860392,0.016827345,0.07981399,0.0019316194,0.10129258],"study_design_scores_gemma":[0.000005721782,0.00001393015,0.00086408405,0.0000066365283,0.0000033405524,0.0001002031,0.000029490267,0.9867916,0.003063168,0.008743518,0.0003700923,0.000008134239],"about_ca_topic_score_codex":0.0019929905,"about_ca_topic_score_gemma":0.0018894181,"teacher_disagreement_score":0.004064679,"about_ca_system_score_codex":0.00091455877,"about_ca_system_score_gemma":0.0010105304,"threshold_uncertainty_score":0.013597727},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","score_opus":0.03735851513923256,"score_gpt":0.2758705309087951,"score_spread":0.23851201576956255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082030917","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.028982304,0.0008809008,0.9603658,0.00029949224,0.000080826634,0.0003043969,0.0003544389,0.002390489,0.006341273],"genre_scores_gemma":[0.12519671,0.00049519166,0.87056386,0.00016441212,0.00006630255,0.0004212462,0.0009786718,0.0003358826,0.0017777815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.00049478665,0.000057863832,0.00017088056,0.00026377753,0.00028524306],"domain_scores_gemma":[0.996042,0.0028695143,0.00021344937,0.00043970693,0.0003170109,0.00011829777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016695799,0.0016441513,0.0014497353,0.0017164996,0.0009916943,0.0011803646,0.001882039,0.0014208921,0.0059963553],"category_scores_gemma":[0.005549254,0.0009783533,0.0012985868,0.002302965,0.0008001095,0.0024931652,0.0013193765,0.0020375417,0.0010626176],"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.00056839106,0.00024957387,0.0008078709,0.00048649602,0.00012302904,0.00023952487,0.00026046936,0.68848443,0.00657354,0.04931434,0.023025714,0.22986665],"study_design_scores_gemma":[0.00024989416,0.00014142928,0.00039380777,0.000049829152,0.000057364985,0.00011053257,0.0001134176,0.940041,0.0037229843,0.046440355,0.008643202,0.000036235375],"about_ca_topic_score_codex":0.006011101,"about_ca_topic_score_gemma":0.01111024,"teacher_disagreement_score":0.006011101,"about_ca_system_score_codex":0.0015897191,"about_ca_system_score_gemma":0.0029047043,"threshold_uncertainty_score":0.020059764},"labels":[],"label_agreement":null},{"id":"W2095153636","doi":"10.1287/ijoc.2013.0568","title":"The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematical optimization; Heuristics; Benders' decomposition; Mathematics; Generalization; Tabu search; Quadratic programming; Context (archaeology); Minimax; Heuristic; Quadratic equation; Interval (graph theory); Computer science; Combinatorics","score_opus":0.009813052214419407,"score_gpt":0.19792504483950749,"score_spread":0.18811199262508807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095153636","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.022310864,0.00017209374,0.97405803,0.00018208072,0.000031396095,0.000045403813,0.00014411466,0.00018274422,0.0028733024],"genre_scores_gemma":[0.5470673,0.00047886703,0.4456654,0.00016375439,0.00017038938,0.00022599894,0.0005597167,0.00020398093,0.0054645455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847275,0.0006054128,0.00005234379,0.00032261963,0.00036765274,0.00017921483],"domain_scores_gemma":[0.9981199,0.0010332781,0.0003553962,0.00022640415,0.0001643347,0.00010063165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026001204,0.0012115475,0.0011117883,0.00057282444,0.00045535972,0.0013843213,0.0016418862,0.0013746258,0.0036572113],"category_scores_gemma":[0.006759182,0.00047972,0.00087183283,0.0010503543,0.0009078446,0.0017340413,0.0011687835,0.0014980457,0.0006196762],"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.000101746235,0.00006407704,0.00019163122,0.00008484417,0.000027024653,0.000067867506,0.00003595315,0.95132154,0.0013449145,0.022073379,0.001038565,0.02364851],"study_design_scores_gemma":[0.000017699376,0.00007476544,0.00012904925,0.000008830295,0.000009043217,0.000043400858,0.000014663912,0.9805996,0.0011069835,0.017098777,0.0008885279,0.000008628817],"about_ca_topic_score_codex":0.0015455539,"about_ca_topic_score_gemma":0.00095349224,"teacher_disagreement_score":0.0036572113,"about_ca_system_score_codex":0.0009032127,"about_ca_system_score_gemma":0.0011785671,"threshold_uncertainty_score":0.013750911},"labels":[],"label_agreement":null},{"id":"W2096541983","doi":"10.1287/ijoc.13.3.172.12627","title":"Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI<sup>X</sup>/Geom/m","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Markov chain; Queue; Queueing theory; Bulk queue; State (computer science); Observer (physics); Random variable; Algorithm; Discrete time and continuous time; Real-time computing; Mathematical optimization; Mathematics; Computer network; Statistics","score_opus":0.012753032955314256,"score_gpt":0.24455783897218092,"score_spread":0.23180480601686665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096541983","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.2063412,0.0006409901,0.7901597,0.00033160782,0.000055855817,0.00003458482,0.00011008805,0.00023274032,0.0020931894],"genre_scores_gemma":[0.9729646,0.00023647917,0.024762979,0.000023833993,0.00003375706,0.00003263019,0.000049254562,0.000020043208,0.0018764712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976593,0.000066039145,0.000014290742,0.000038663686,0.0000741743,0.00004096915],"domain_scores_gemma":[0.9991296,0.000530809,0.00012417466,0.00004887074,0.0001255347,0.00004097518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086103764,0.00037770093,0.00038321395,0.00038910983,0.0002783097,0.0009778049,0.0010105517,0.0006835799,0.0006733994],"category_scores_gemma":[0.0022606517,0.00020522907,0.00038783255,0.00039585377,0.00051586697,0.000817858,0.00033678918,0.0005445972,0.00012728931],"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.00008394501,0.000039255294,0.002013756,0.000043494892,0.000024477942,0.00010638049,0.0000772882,0.95735013,0.004751798,0.029725702,0.00028654686,0.005497326],"study_design_scores_gemma":[0.0000015696427,0.000003991241,0.00014435686,9.1388864e-7,0.0000019319145,0.0000049814207,0.0000029488424,0.9977582,0.00023661986,0.0017885234,0.000054468983,0.0000015875227],"about_ca_topic_score_codex":0.008706346,"about_ca_topic_score_gemma":0.003191336,"teacher_disagreement_score":0.008706346,"about_ca_system_score_codex":0.0011512942,"about_ca_system_score_gemma":0.00085664104,"threshold_uncertainty_score":0.017311335},"labels":[],"label_agreement":null},{"id":"W2096788301","doi":"10.1287/ijoc.1110.0458","title":"Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Innovation Foundation","keywords":"Mathematical optimization; Benders' decomposition; Integer programming; Tabu search; Decomposition; Set (abstract data type); Branch and cut; Truck; Constraint programming; Computer science; Integer (computer science); Branch and price; Facility location problem; Constraint (computer-aided design); Mathematics; Stochastic programming; Engineering","score_opus":0.06676374751484022,"score_gpt":0.28343941804884426,"score_spread":0.21667567053400405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096788301","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.008797229,0.0000652928,0.986384,0.00018710065,0.00002568066,0.00010795714,0.000095763826,0.00026549742,0.0040715565],"genre_scores_gemma":[0.13390605,0.00023591731,0.8616863,0.00022056322,0.00003777014,0.00035081952,0.00036597744,0.00012940845,0.003067227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.00034253008,0.000030616782,0.00010294302,0.00020901395,0.000111182235],"domain_scores_gemma":[0.9987941,0.0008709326,0.00010926379,0.000069063404,0.00012167469,0.000034964865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015721964,0.0015681558,0.0009044144,0.0011923312,0.0007219789,0.0015583439,0.0010220226,0.0011767907,0.0062385034],"category_scores_gemma":[0.0030498526,0.000916401,0.0015128396,0.0012799723,0.0010628373,0.0015411063,0.0010104717,0.0017705804,0.000796232],"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.00007353827,0.00008967262,0.0002650648,0.00011696909,0.000041685656,0.000080498394,0.000055892815,0.92468965,0.0026953185,0.03180425,0.0012759169,0.038811598],"study_design_scores_gemma":[0.000031389733,0.00004467448,0.0000368227,0.000014857158,0.00001597151,0.000021512133,0.000028715618,0.9779279,0.0013069239,0.019476801,0.0010859052,0.000008506691],"about_ca_topic_score_codex":0.0050514955,"about_ca_topic_score_gemma":0.0064082984,"teacher_disagreement_score":0.0062385034,"about_ca_system_score_codex":0.0014102478,"about_ca_system_score_gemma":0.0023631363,"threshold_uncertainty_score":0.020869851},"labels":[],"label_agreement":null},{"id":"W2096845859","doi":"10.1287/ijoc.1110.0493","title":"Static Network Reliability Estimation via Generalized Splitting","year":2012,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Reliability (semiconductor); Monte Carlo method; Computer science; Graph; Algorithm; Set (abstract data type); Exploit; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Mathematics; Theoretical computer science; Statistics; Artificial intelligence","score_opus":0.008376867683933403,"score_gpt":0.22905180316735826,"score_spread":0.22067493548342487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096845859","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.014000422,0.00006242118,0.9850144,0.000043450684,0.000009907909,0.00001848432,0.000026311709,0.00031089742,0.00051372295],"genre_scores_gemma":[0.64009184,0.00016061593,0.35802665,0.00007037236,0.00004299127,0.00013935176,0.00027440814,0.0001494895,0.0010443104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992386,0.0002746351,0.000027920494,0.00016881723,0.00022930541,0.00006072478],"domain_scores_gemma":[0.9976547,0.0011065131,0.00035970885,0.00043516577,0.00034133924,0.000102559025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551423,0.0010427654,0.0011855988,0.0013256699,0.00041494836,0.0006331936,0.0019486748,0.0007918257,0.0010170605],"category_scores_gemma":[0.00569737,0.0006019802,0.0007362492,0.0009271981,0.0008409823,0.0016270183,0.0013792325,0.0008957684,0.00026588503],"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.000048062262,0.000015346555,0.0009720662,0.000022662747,0.000031164695,0.00004694684,0.000047842615,0.9589395,0.0023562869,0.0076607126,0.00038449664,0.02947499],"study_design_scores_gemma":[0.0000026080327,0.0000074135482,0.00006871845,0.0000017633644,0.000002337647,0.000009932608,0.000002294292,0.9957806,0.00028255716,0.0037314177,0.00010772982,0.0000026187822],"about_ca_topic_score_codex":0.004263365,"about_ca_topic_score_gemma":0.0024530734,"teacher_disagreement_score":0.004263365,"about_ca_system_score_codex":0.00078879937,"about_ca_system_score_gemma":0.0008503631,"threshold_uncertainty_score":0.008477092},"labels":[],"label_agreement":null},{"id":"W2096910555","doi":"10.1287/ijoc.2014.0600","title":"Districting for Arc Routing","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Arc routing; Roulette; Tabu search; Social connectedness; Compact space; Mathematical optimization; Subroutine; Routing (electronic design automation); Computer science; Heuristic; Context (archaeology); Vehicle routing problem; Mathematics","score_opus":0.017903501821924746,"score_gpt":0.2714472516494821,"score_spread":0.25354374982755734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096910555","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.007121161,0.0006446631,0.98172045,0.000112102716,0.000056794313,0.00009260791,0.00007887351,0.00035951572,0.009813772],"genre_scores_gemma":[0.2104119,0.00091533165,0.7791955,0.00009857188,0.000074258365,0.00021236346,0.00028964164,0.00028262386,0.008519917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993216,0.0002695138,0.00002657374,0.0001468032,0.00014824385,0.00008735293],"domain_scores_gemma":[0.99950135,0.00026006656,0.00005428413,0.000097015785,0.00005202368,0.000035194236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573811,0.00071451336,0.0008457977,0.0011542279,0.00093523617,0.0012473548,0.001277228,0.00074152957,0.010629008],"category_scores_gemma":[0.0017000628,0.00044881803,0.0008174178,0.0014960243,0.00094536546,0.0015304273,0.0012664028,0.0011333574,0.0013910494],"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.00008471062,0.00006824967,0.0005892031,0.00037415093,0.000042585063,0.00009041975,0.00014872763,0.5287827,0.0049414425,0.18332393,0.00428257,0.27727124],"study_design_scores_gemma":[0.00003984266,0.00023300792,0.0005170517,0.000106417756,0.00005485115,0.00030604677,0.00016535188,0.7484349,0.0061983196,0.1806518,0.06324143,0.00005100743],"about_ca_topic_score_codex":0.0019850044,"about_ca_topic_score_gemma":0.0032168971,"teacher_disagreement_score":0.010629008,"about_ca_system_score_codex":0.00109787,"about_ca_system_score_gemma":0.0008258385,"threshold_uncertainty_score":0.035557568},"labels":[],"label_agreement":null},{"id":"W2097828930","doi":"10.1287/ijoc.1100.0425","title":"An Improved Primal Simplex Algorithm for Degenerate Linear Programs","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Degeneracy (biology); Simplex algorithm; Simplex; Linear programming; Degenerate energy levels; Criss-cross algorithm; Algorithm; Mathematics; Mathematical optimization; Linear-fractional programming; Function (biology); Sequence (biology); Computer science; Combinatorics","score_opus":0.05516187897734527,"score_gpt":0.3963921387197743,"score_spread":0.34123025974242904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097828930","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.0030657812,0.00014308763,0.99356383,0.00007714318,0.00003917622,0.000067091,0.000039357463,0.00039219638,0.0026123424],"genre_scores_gemma":[0.06784378,0.00021453568,0.92759633,0.00009656021,0.000060921364,0.0003156994,0.00021992842,0.0003128888,0.003339343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852645,0.00060318445,0.00006865304,0.00018538372,0.00047388533,0.00014238826],"domain_scores_gemma":[0.99873227,0.0005765576,0.00009056206,0.00017269269,0.00033560494,0.00009220515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020620076,0.0012816179,0.0019483143,0.0012843589,0.00092799927,0.0014693486,0.0018984373,0.0017352757,0.0074590514],"category_scores_gemma":[0.005127673,0.00093497644,0.0011970788,0.0014534309,0.0010846778,0.001665281,0.0026597374,0.0032165681,0.0021354407],"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.00028256926,0.00017597708,0.0005436665,0.00022180278,0.00006821665,0.00017543939,0.00018401779,0.7099596,0.004136184,0.097860254,0.0065827547,0.17980953],"study_design_scores_gemma":[0.00003400828,0.00003110243,0.000033887878,0.000012205362,0.0000053229064,0.000041058847,0.000009070627,0.9818287,0.00067364407,0.014440632,0.0028811225,0.000009215032],"about_ca_topic_score_codex":0.0023910392,"about_ca_topic_score_gemma":0.002175996,"teacher_disagreement_score":0.0074590514,"about_ca_system_score_codex":0.000908025,"about_ca_system_score_gemma":0.0022661693,"threshold_uncertainty_score":0.024953008},"labels":[],"label_agreement":null},{"id":"W2099501018","doi":"10.1287/ijoc.1080.0312","title":"<b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Evolutionary algorithm; Computer science; Particle swarm optimization; Mathematical optimization; Routing (electronic design automation); Metaheuristic; Genetic algorithm; Algorithm; Memetic algorithm; Mathematics","score_opus":0.02023764090783845,"score_gpt":0.28665828310789365,"score_spread":0.2664206422000552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099501018","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00794549,0.8290173,0.10166829,0.00498741,0.0039697797,0.00006525436,0.0003330365,0.0004665532,0.051546935],"genre_scores_gemma":[0.07860588,0.82363063,0.06903772,0.0017087306,0.0049372814,0.00007533705,0.0011611485,0.0001725392,0.020670677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962986,0.00007588654,0.000040143346,0.000071647184,0.00014961192,0.00003277339],"domain_scores_gemma":[0.9990872,0.00044017658,0.000064678934,0.000046708163,0.00033815444,0.000023103834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592518,0.00060215173,0.000732421,0.0013851877,0.00032620277,0.0015760801,0.0009993069,0.001141096,0.008729851],"category_scores_gemma":[0.0020222352,0.00025444734,0.00051360286,0.0040495256,0.00030464437,0.001792319,0.00036300064,0.0005598536,0.0038689922],"study_design_candidate":"not_applicable","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.00008048144,0.00007430379,0.0006558403,0.0030552668,0.000106010615,0.00011426659,0.000022866638,0.010996848,0.0028042027,0.01025651,0.049923558,0.92190987],"study_design_scores_gemma":[0.000031242755,0.00024550673,0.0025458261,0.002509544,0.00031466855,0.0015520654,0.00013749632,0.050103363,0.009048258,0.020015877,0.9134266,0.00006957828],"about_ca_topic_score_codex":0.0016606546,"about_ca_topic_score_gemma":0.001766009,"teacher_disagreement_score":0.008729851,"about_ca_system_score_codex":0.00035959863,"about_ca_system_score_gemma":0.00066713424,"threshold_uncertainty_score":0.02920425},"labels":[],"label_agreement":null},{"id":"W2100711246","doi":"10.1287/ijoc.1060.0202","title":"Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; FIFO and LIFO accounting; Variable (mathematics); Mathematical optimization; Variable neighborhood search; Heuristic; 2-opt; Traveling purchaser problem; Heuristics; Computer science; Mathematics; FIFO (computing and electronics); Metaheuristic; Artificial intelligence","score_opus":0.01899676715682416,"score_gpt":0.2579686718548559,"score_spread":0.23897190469803173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100711246","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.3541658,0.00085247366,0.63589597,0.00034529413,0.00004693177,0.0001498599,0.00017307099,0.0007728917,0.0075977324],"genre_scores_gemma":[0.75909126,0.00019703113,0.23736355,0.00005139825,0.00002041983,0.00017029876,0.00025584974,0.00010082213,0.0027494137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996575,0.00016119218,0.000010972969,0.000050282324,0.00006898283,0.00005101428],"domain_scores_gemma":[0.9993783,0.00044702285,0.00006898619,0.000030781768,0.00003931326,0.00003556107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092940306,0.00040279113,0.00076773233,0.00056643336,0.00044984493,0.00057902973,0.00087079505,0.0006147842,0.0018781385],"category_scores_gemma":[0.0022377912,0.00024153404,0.00030991714,0.0007162089,0.0004654262,0.0009907556,0.00051181985,0.0005421403,0.00020317556],"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.00018465787,0.00013954188,0.000990119,0.000046770998,0.000019999654,0.00006155059,0.00006232527,0.9471568,0.0008603702,0.0076204664,0.0009960148,0.041861273],"study_design_scores_gemma":[0.000030307365,0.00006377478,0.000137493,0.000003818645,0.000005924369,0.000013166996,0.000021565544,0.99649256,0.00032048358,0.0025216474,0.00038532758,0.000003849689],"about_ca_topic_score_codex":0.00574484,"about_ca_topic_score_gemma":0.006432203,"teacher_disagreement_score":0.00574484,"about_ca_system_score_codex":0.0006796408,"about_ca_system_score_gemma":0.00072229374,"threshold_uncertainty_score":0.011422813},"labels":[],"label_agreement":null},{"id":"W2101083806","doi":"10.1287/ijoc.1110.0476","title":"A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministère de l'Education Nationale, de l'Enseignement Superieur et de la Recherche","keywords":"Travelling salesman problem; Branch and cut; 2-opt; Bottleneck traveling salesman problem; Branch and bound; Mathematical optimization; Mathematics; Maximum cut; Algorithm; Traveling purchaser problem; Constraint (computer-aided design); Hamiltonian path; Computer science; Integer programming; Combinatorics; Graph","score_opus":0.025452194892687716,"score_gpt":0.26221907165372105,"score_spread":0.23676687676103333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101083806","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.001380712,0.000111230576,0.9966749,0.000065845146,0.000017925342,0.0000421589,0.000028669103,0.00016051302,0.0015181438],"genre_scores_gemma":[0.023797618,0.00021933857,0.9745009,0.00006570087,0.000023993756,0.00015716242,0.00010936374,0.00011149119,0.0010144894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999201,0.00024809732,0.000039109942,0.0001497794,0.0002704148,0.00009171264],"domain_scores_gemma":[0.9992405,0.00038395167,0.00007712044,0.00009142354,0.00015806923,0.000049020407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014384675,0.0012046167,0.0013133222,0.00093654153,0.0009834386,0.000989633,0.0017486312,0.0017008455,0.0041799014],"category_scores_gemma":[0.0029180716,0.000498187,0.0010659294,0.0018961168,0.0007095213,0.0013740485,0.0015827859,0.0022181843,0.00094983133],"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.00007141533,0.000089380505,0.00033701462,0.00026492824,0.00005540983,0.00013399139,0.00010075787,0.607971,0.0025876611,0.062008094,0.0053952434,0.32098502],"study_design_scores_gemma":[0.000027481708,0.00003588549,0.00008228501,0.000022251103,0.000014587133,0.00007603474,0.00001532518,0.9633011,0.0008566881,0.029277252,0.006278807,0.000012291953],"about_ca_topic_score_codex":0.0026382555,"about_ca_topic_score_gemma":0.004116727,"teacher_disagreement_score":0.0041799014,"about_ca_system_score_codex":0.0011148178,"about_ca_system_score_gemma":0.0015438116,"threshold_uncertainty_score":0.01398313},"labels":[],"label_agreement":null},{"id":"W2103364890","doi":"10.1287/ijoc.1050.0168","title":"Discrepancy-Based Additive Bounding Procedures","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Search tree; Constraint (computer-aided design); Constraint satisfaction problem; Relaxation (psychology); Mathematical optimization; Mathematics; Branch and bound; Key (lock); Upper and lower bounds; Constraint satisfaction; Local consistency; Computer science; Constraint programming; Node (physics); Simple (philosophy); Search algorithm; Artificial intelligence","score_opus":0.009396840119445738,"score_gpt":0.2564636089048323,"score_spread":0.24706676878538653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103364890","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.0016679311,0.00011899953,0.99552333,0.00012346717,0.000020801035,0.000028984585,0.00004302272,0.0002268783,0.0022466106],"genre_scores_gemma":[0.16926615,0.0004610793,0.8234909,0.00037369176,0.00010673982,0.00034792296,0.0003204087,0.0005051637,0.005127852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99440235,0.0021105115,0.00027322795,0.0008500573,0.0018951857,0.00046875552],"domain_scores_gemma":[0.98771244,0.006972579,0.0008614195,0.0030804374,0.0010060915,0.0003670209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055950405,0.0019051597,0.0014839217,0.0016999034,0.0008988365,0.002630718,0.0050724032,0.0020882655,0.0077034836],"category_scores_gemma":[0.023607982,0.0010093917,0.0018844743,0.0020906376,0.0027132109,0.0062970947,0.006658049,0.005442258,0.002168895],"study_design_candidate":"simulation_or_modeling","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.00012111958,0.00009202226,0.0007643788,0.00018379897,0.000054828863,0.00009894716,0.00023398768,0.38464582,0.003194238,0.50888443,0.004340018,0.09738634],"study_design_scores_gemma":[0.000021968266,0.000050550363,0.000092713366,0.000046942034,0.0000201375,0.000072611285,0.000022633061,0.83373207,0.0021603026,0.15678146,0.006976892,0.000021692313],"about_ca_topic_score_codex":0.001686754,"about_ca_topic_score_gemma":0.0020085482,"teacher_disagreement_score":0.0077034836,"about_ca_system_score_codex":0.001674291,"about_ca_system_score_gemma":0.0025327855,"threshold_uncertainty_score":0.029589772},"labels":[],"label_agreement":null},{"id":"W2104293546","doi":"10.1287/ijoc.1030.0045","title":"An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; George Mason University; National Science Foundation","keywords":"Laplace transform; Convergence (economics); Applied mathematics; Queueing theory; Mathematical optimization; Algorithm; Mathematics; Queue; Computer science; Distribution (mathematics); Probability distribution; Mathematical proof; Mathematical analysis","score_opus":0.01100501900988031,"score_gpt":0.2535491209065889,"score_spread":0.24254410189670855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104293546","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.0055079814,0.00008224207,0.9913886,0.00012997101,0.000038597875,0.00009474584,0.00007373432,0.0018093428,0.00087471993],"genre_scores_gemma":[0.08146564,0.00009643171,0.9157126,0.000115219205,0.000040613028,0.0002796159,0.00024149379,0.00018272141,0.0018656658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996574,0.000057734516,0.000037126945,0.00008057774,0.00011460656,0.000052453845],"domain_scores_gemma":[0.99912816,0.0004766857,0.00008274929,0.00007516725,0.00019045056,0.000046764097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989357,0.0010154945,0.0006415818,0.0013605419,0.00088836346,0.0011776406,0.0013763452,0.0013409179,0.0058138026],"category_scores_gemma":[0.0045587295,0.00046577016,0.0005550208,0.0010758754,0.00056647713,0.0011325598,0.0013012103,0.0014716065,0.0024619845],"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.00050128245,0.000264699,0.0038664693,0.00026599056,0.000113084694,0.00038942386,0.00032347703,0.41456416,0.013665426,0.056576617,0.009801652,0.49966767],"study_design_scores_gemma":[0.00010791127,0.00004685943,0.00027098274,0.000014269147,0.00001540907,0.00009355977,0.000023063205,0.97800285,0.0033533797,0.01604234,0.002008801,0.00002058366],"about_ca_topic_score_codex":0.007069292,"about_ca_topic_score_gemma":0.0072730333,"teacher_disagreement_score":0.007069292,"about_ca_system_score_codex":0.0011437834,"about_ca_system_score_gemma":0.0026503052,"threshold_uncertainty_score":0.019449115},"labels":[],"label_agreement":null},{"id":"W2105283503","doi":"10.1287/ijoc.1050.0150","title":"A Projection-Based Reduction Approach to Computing Sensitivity of Steady-State Response of Nonlinear Circuits","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"McGill University; Carleton University; University of Ottawa","funders":"","keywords":"Sensitivity (control systems); Reduction (mathematics); Nonlinear system; Projection (relational algebra); Subspace topology; Computation; Mathematics; Algorithm; Dimension (graph theory); Steady state (chemistry); TRACE (psycholinguistics); Electronic circuit; State space; Mathematical optimization; Control theory (sociology); Computer science; Mathematical analysis","score_opus":0.020323715149856002,"score_gpt":0.2620965604808178,"score_spread":0.2417728453309618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105283503","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.0053370115,0.000021454583,0.9937337,0.00003218596,0.000008876456,0.000020906366,0.000011366789,0.00027323284,0.00056126673],"genre_scores_gemma":[0.24080054,0.0001258359,0.75635135,0.000061205814,0.000030120684,0.00018026777,0.000098610486,0.0002102531,0.0021418203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975437,0.00007180139,0.000011764619,0.000037883186,0.00010719293,0.000016955371],"domain_scores_gemma":[0.99946815,0.00032145897,0.000030887488,0.000074747404,0.00008430872,0.000020456133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058156205,0.00068816886,0.00058409484,0.00051050313,0.0003522868,0.0004956505,0.00070594053,0.00055397727,0.0018890764],"category_scores_gemma":[0.0019068251,0.00041411747,0.0006170527,0.00030087327,0.0006487441,0.00076221506,0.0009810821,0.0011616816,0.00038269119],"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.000106786785,0.000075589836,0.0006213633,0.00012273478,0.00007139605,0.00010742631,0.0001838646,0.74817437,0.040047802,0.04207397,0.0009460573,0.16746867],"study_design_scores_gemma":[0.000003466293,0.000015049741,0.000060731374,0.0000024811418,0.0000032956862,0.000017199001,0.0000035693229,0.9904766,0.003685561,0.0053028045,0.00042288587,0.0000063619987],"about_ca_topic_score_codex":0.0014272986,"about_ca_topic_score_gemma":0.0011892556,"teacher_disagreement_score":0.0018890764,"about_ca_system_score_codex":0.00047297796,"about_ca_system_score_gemma":0.0007679741,"threshold_uncertainty_score":0.0063195825},"labels":[],"label_agreement":null},{"id":"W2105318109","doi":"10.1287/ijoc.1080.0270","title":"Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Mathematical optimization; Cutting-plane method; Relaxation (psychology); Linear programming; Semidefinite embedding; Mathematics; Computer science; Integer programming; Algorithm; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.05195044819780355,"score_gpt":0.24838863633661756,"score_spread":0.19643818813881403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105318109","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.033013538,0.00017705452,0.9625115,0.00015601631,0.000021447364,0.00004830146,0.00018959868,0.000533717,0.0033489144],"genre_scores_gemma":[0.26087657,0.0002869544,0.73575,0.00008600163,0.000029248222,0.00030775543,0.0006236006,0.00026590485,0.0017739674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993231,0.00030222328,0.00003088533,0.00014025967,0.00012882346,0.00007481172],"domain_scores_gemma":[0.9979202,0.0014356673,0.0002408275,0.00013934678,0.00018389811,0.00008013398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012112291,0.0019307286,0.001749957,0.0009539047,0.0003898041,0.0012134619,0.00087703735,0.0011103288,0.0034018382],"category_scores_gemma":[0.004260864,0.0010045375,0.001082984,0.0013067785,0.0009448634,0.0016056569,0.0012355784,0.0016014673,0.00069003727],"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.00003576756,0.000032337157,0.00021121133,0.000070523696,0.000025917707,0.000035384823,0.000026055995,0.9731891,0.0010718273,0.006245063,0.00079144904,0.018265324],"study_design_scores_gemma":[0.000014333245,0.00004225401,0.00004564754,0.000008111114,0.0000054551656,0.000011160804,0.000025215699,0.9897357,0.0006887717,0.009116663,0.00030067962,0.0000059512427],"about_ca_topic_score_codex":0.0021560006,"about_ca_topic_score_gemma":0.0034731044,"teacher_disagreement_score":0.0034018382,"about_ca_system_score_codex":0.00082337006,"about_ca_system_score_gemma":0.0015490288,"threshold_uncertainty_score":0.011380315},"labels":[],"label_agreement":null},{"id":"W2106614282","doi":"10.1287/ijoc.1040.0118","title":"Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Ford Motor Company","keywords":"Computer science; Proxy (statistics); World Wide Web; Database","score_opus":0.008596965794737562,"score_gpt":0.25175117410807557,"score_spread":0.243154208313338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106614282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8992086,0.0015490702,0.092791796,0.00049287645,0.00007261955,0.0001861656,0.00015159642,0.00030110477,0.005246152],"genre_scores_gemma":[0.99116194,0.00032986587,0.00791645,0.000035822464,0.00002060392,0.000034034,0.000045958986,0.000032704625,0.00042259146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947807,0.0018753598,0.0002234494,0.00055301463,0.001373235,0.0011942746],"domain_scores_gemma":[0.93081963,0.05627098,0.004521995,0.003435359,0.0041477066,0.0008043461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008366493,0.00096033,0.0012394759,0.001312242,0.00087420526,0.0018008205,0.001585802,0.0014227959,0.00094353565],"category_scores_gemma":[0.04609974,0.00047829,0.00068443286,0.0017655863,0.0018797937,0.0033186374,0.0010388601,0.0018205747,0.00016074418],"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.0006374712,0.000309571,0.008772665,0.00014531167,0.00010427015,0.00033897694,0.00020776264,0.9396356,0.010518506,0.021469967,0.00069988344,0.017160112],"study_design_scores_gemma":[0.00002981516,0.00019275825,0.0024287535,0.000013356705,0.00007248757,0.00016546021,0.00013841684,0.9843891,0.008149967,0.0040934514,0.00029532582,0.00003100999],"about_ca_topic_score_codex":0.009584868,"about_ca_topic_score_gemma":0.006190223,"teacher_disagreement_score":0.009584868,"about_ca_system_score_codex":0.0077232537,"about_ca_system_score_gemma":0.0034551013,"threshold_uncertainty_score":0.056036413},"labels":[],"label_agreement":null},{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","score_opus":0.02831864026295009,"score_gpt":0.2741303086561243,"score_spread":0.24581166839317423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108911946","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.005575381,0.00070613984,0.98797464,0.0003066277,0.00006188166,0.00014839372,0.00018771038,0.0002799911,0.0047592223],"genre_scores_gemma":[0.09317124,0.0010863928,0.90005,0.00018153802,0.00012242813,0.0006261446,0.0007101484,0.00021297159,0.0038391103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.0004122475,0.00006844925,0.0002062371,0.0003285257,0.00014489795],"domain_scores_gemma":[0.99803287,0.0013028865,0.0002067745,0.00009721113,0.00028519562,0.00007501413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019858945,0.0020592522,0.0020409352,0.0015311912,0.00086257374,0.0024664104,0.002196633,0.0019550556,0.0069074226],"category_scores_gemma":[0.004341541,0.0010735594,0.0012816247,0.0029450844,0.00092606014,0.0020293244,0.0014930967,0.0030974373,0.0010574758],"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.00005178081,0.00009166099,0.00020913269,0.00013039351,0.00003556495,0.000060558228,0.0000496114,0.9157146,0.00045076545,0.027830033,0.0026381884,0.05273772],"study_design_scores_gemma":[0.000027261427,0.000020767387,0.000035913465,0.000016719177,0.000009413842,0.000019314295,0.00002273975,0.97945887,0.00024893705,0.018550333,0.0015839111,0.000005807394],"about_ca_topic_score_codex":0.005980784,"about_ca_topic_score_gemma":0.005287342,"teacher_disagreement_score":0.0069074226,"about_ca_system_score_codex":0.0017927514,"about_ca_system_score_gemma":0.0023035873,"threshold_uncertainty_score":0.023107648},"labels":[],"label_agreement":null},{"id":"W2110344857","doi":"10.1287/ijoc.1090.0323","title":"Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Inequality; Mathematical optimization; Matrix (chemical analysis); Constraint (computer-aided design); Linear programming; Linear inequality; Algorithm; Computer science","score_opus":0.09771958865612318,"score_gpt":0.431514757271499,"score_spread":0.33379516861537584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110344857","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.004222866,0.00008464193,0.9928637,0.00011606488,0.0000109940165,0.00006163865,0.000121029785,0.000065348475,0.0024536469],"genre_scores_gemma":[0.23743406,0.0005150685,0.7563653,0.00014050162,0.00014203043,0.00086786726,0.00080829737,0.000206617,0.0035201984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906183,0.0037540235,0.00043604325,0.0010289649,0.0035040702,0.0006586396],"domain_scores_gemma":[0.9716579,0.022799877,0.0017431915,0.0012430222,0.00224119,0.00031484323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057260646,0.0013697526,0.0012636537,0.0024858816,0.00108782,0.0028097925,0.0021952353,0.0011909901,0.0074999323],"category_scores_gemma":[0.037470173,0.0010278157,0.0022337555,0.0038261297,0.0025062677,0.0034748176,0.0027904597,0.0029859545,0.0009786801],"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.00015580053,0.00008722564,0.0009959609,0.00038793636,0.00011602895,0.00022883095,0.0002930152,0.46669924,0.003146885,0.4590147,0.0023414986,0.066532955],"study_design_scores_gemma":[0.00001760013,0.000054054763,0.0002107317,0.000055791552,0.000018527304,0.000060252834,0.00003795119,0.82573885,0.0019329098,0.16953556,0.0023126358,0.000025231495],"about_ca_topic_score_codex":0.0038708062,"about_ca_topic_score_gemma":0.0021336451,"teacher_disagreement_score":0.0074999323,"about_ca_system_score_codex":0.0015912956,"about_ca_system_score_gemma":0.0018404839,"threshold_uncertainty_score":0.030282736},"labels":[],"label_agreement":null},{"id":"W2110438635","doi":"10.1287/ijoc.1060.0191","title":"Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; McGill University","keywords":"Interdiction; Lagrangian relaxation; Mathematical optimization; Solver; Flow network; Maximum flow problem; Branch and bound; Minimum-cost flow problem; Integer programming; Flow (mathematics); Set (abstract data type); Computer science; Pareto principle; Branch and cut; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Algorithm","score_opus":0.005485217191066163,"score_gpt":0.2239149665857092,"score_spread":0.21842974939464305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110438635","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.005880706,0.0001213882,0.98847497,0.0001250119,0.000024195655,0.000058151345,0.000109165805,0.00026638267,0.004940046],"genre_scores_gemma":[0.11895003,0.00019795648,0.87608594,0.00008365522,0.000027652655,0.0002848682,0.00046626714,0.00015046571,0.003753104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994635,0.00016729833,0.000021219857,0.00010312703,0.00014878219,0.000096053394],"domain_scores_gemma":[0.9992675,0.00044507554,0.000068125984,0.00006726195,0.00011195907,0.000040034225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134531,0.0012202854,0.0011803726,0.00088878674,0.0006679622,0.0011081321,0.0016743316,0.0012718156,0.0075885667],"category_scores_gemma":[0.0025156324,0.00053052825,0.00069671526,0.0011902625,0.0005708174,0.0017243392,0.0014395185,0.0016252974,0.0010464491],"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.00007770361,0.00007593213,0.00033583824,0.00015391463,0.00004084435,0.00006457306,0.00006306111,0.87970674,0.0010306014,0.032556474,0.004122239,0.08177217],"study_design_scores_gemma":[0.000020210857,0.000023879045,0.000069828435,0.000011287862,0.000006792093,0.00003449007,0.000019167985,0.98243713,0.0006688594,0.014886607,0.0018158254,0.000005984822],"about_ca_topic_score_codex":0.003978888,"about_ca_topic_score_gemma":0.0045134374,"teacher_disagreement_score":0.0075885667,"about_ca_system_score_codex":0.00082376716,"about_ca_system_score_gemma":0.0019651477,"threshold_uncertainty_score":0.025386274},"labels":[],"label_agreement":null},{"id":"W2111731757","doi":"10.1287/ijoc.1090.0335","title":"A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Subgradient method; Heuristic; Computer science; Queue; Branch and bound; Transshipment (information security); Nonlinear system; Upper and lower bounds; Flow network; Nonlinear programming; Integer (computer science); Piecewise linear function; Network congestion; Cutting-plane method; Integer programming; Mathematics","score_opus":0.03055224279145047,"score_gpt":0.27175312602159096,"score_spread":0.2412008832301405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111731757","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.018999895,0.00021900519,0.97583824,0.00021207408,0.000029342978,0.00014756538,0.00007430967,0.00016363921,0.0043158876],"genre_scores_gemma":[0.51102734,0.00028945037,0.48070347,0.00015868379,0.000033206812,0.00056590943,0.00018558057,0.0001180005,0.006918275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924123,0.0003810705,0.000020155436,0.000089809684,0.000144092,0.00012359142],"domain_scores_gemma":[0.99905545,0.00065432314,0.000096237214,0.00003330287,0.00010173297,0.00005902408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019107715,0.0010076665,0.0013248994,0.0010460987,0.00083433546,0.0008911471,0.0012781535,0.0011434158,0.00374491],"category_scores_gemma":[0.0024736654,0.0009782633,0.00070540723,0.0010122432,0.001065629,0.0011789601,0.0011007693,0.0012201751,0.00037764295],"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.000029950328,0.000020674173,0.00008739144,0.000025818255,0.000009464288,0.000029911052,0.00002156402,0.9885633,0.00027143143,0.0046627354,0.00033783892,0.0059398958],"study_design_scores_gemma":[0.000012000431,0.000021636217,0.000027036527,0.0000041856647,0.0000031238847,0.0000056005097,0.0000082250435,0.99706453,0.0001428508,0.0023214908,0.00038542983,0.000003840293],"about_ca_topic_score_codex":0.009009489,"about_ca_topic_score_gemma":0.009513904,"teacher_disagreement_score":0.009009489,"about_ca_system_score_codex":0.0017839201,"about_ca_system_score_gemma":0.0033443924,"threshold_uncertainty_score":0.017914057},"labels":[],"label_agreement":null},{"id":"W2114172542","doi":"10.1287/ijoc.13.3.245.12633","title":"On the Design Problem of Multitechnology Networks","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Tabu search; Network planning and design; Mathematical optimization; Heuristic; Integer programming; Modular design; Computer science; Integer (computer science); Port (circuit theory); Upper and lower bounds; Branch and bound; Topology (electrical circuits); Algorithm; Mathematics; Engineering; Computer network; Combinatorics","score_opus":0.019565517382526265,"score_gpt":0.22006778884535558,"score_spread":0.2005022714628293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114172542","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.023333708,0.0026827916,0.95809036,0.0016961116,0.00012356702,0.00020668043,0.000176913,0.00012098858,0.013568829],"genre_scores_gemma":[0.3602272,0.0054806275,0.61775696,0.00076371705,0.00027631957,0.0010501435,0.0005639745,0.00015733206,0.013723657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.0011994836,0.00006127295,0.00026988063,0.00035749623,0.00018819261],"domain_scores_gemma":[0.9971366,0.0022742343,0.00019217338,0.00012975649,0.00017224667,0.00009492238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312294,0.0015888665,0.0013555385,0.0009839695,0.0008648558,0.0020660334,0.0012277786,0.0024286164,0.0050517013],"category_scores_gemma":[0.005532168,0.00088706805,0.0013158715,0.0020060674,0.0020180496,0.002340059,0.0013164049,0.0016712171,0.0007136665],"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.00003919905,0.000052793483,0.00022880889,0.00021615869,0.000033074233,0.00008582772,0.00006275321,0.8944594,0.00039321542,0.08808255,0.0013201222,0.015026081],"study_design_scores_gemma":[0.000060667906,0.00009667199,0.00011226774,0.00007460258,0.0000198752,0.00009425077,0.0000760618,0.85392445,0.00050119613,0.13452423,0.0105001535,0.000015558117],"about_ca_topic_score_codex":0.0029379968,"about_ca_topic_score_gemma":0.0027315526,"teacher_disagreement_score":0.0050517013,"about_ca_system_score_codex":0.0020252918,"about_ca_system_score_gemma":0.0018408158,"threshold_uncertainty_score":0.016899645},"labels":[],"label_agreement":null},{"id":"W2116208947","doi":"10.1287/ijoc.1030.0065","title":"The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach","year":2005,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Quadratic equation; Cutting-plane method; Quadratic programming; Feasible region; Quadratically constrained quadratic program; Quadratic function; Active set method; Isotropic quadratic form; Plane (geometry); Variational inequality; Applied mathematics; Mathematical optimization; Binary quadratic form; Geometry; Nonlinear programming; Nonlinear system; Integer programming","score_opus":0.07408299595125604,"score_gpt":0.40876509385333865,"score_spread":0.3346820979020826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116208947","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.0004745371,0.000065169465,0.99866474,0.000046468664,0.000012436852,0.000020788317,0.000014094451,0.00004722939,0.00065456517],"genre_scores_gemma":[0.037563685,0.00024137535,0.9596171,0.000100898986,0.00005226998,0.0002367729,0.00013112555,0.00018967249,0.0018670554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988109,0.000476002,0.000042492666,0.00012919582,0.000443784,0.0000976079],"domain_scores_gemma":[0.99840266,0.00089999277,0.00009811161,0.00012456678,0.00039590296,0.00007889265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029158653,0.0014334789,0.0013461328,0.0014987671,0.0006024678,0.0016092622,0.002696801,0.0017691255,0.0047499584],"category_scores_gemma":[0.0055975635,0.00095488597,0.0012107175,0.0013961603,0.0012804557,0.0015534075,0.0023492498,0.0037466395,0.0010834726],"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.000098526536,0.00010679249,0.00039219434,0.00027734807,0.0000640023,0.00010836131,0.00014762697,0.52542937,0.004381167,0.2980447,0.0051826714,0.16576721],"study_design_scores_gemma":[0.0000191335,0.000037690057,0.000047681064,0.00001979157,0.0000074178347,0.000029270328,0.000012439595,0.9497329,0.0008376711,0.04484123,0.0044039716,0.000010786979],"about_ca_topic_score_codex":0.002440297,"about_ca_topic_score_gemma":0.0018766142,"teacher_disagreement_score":0.0047499584,"about_ca_system_score_codex":0.0014510294,"about_ca_system_score_gemma":0.0018031825,"threshold_uncertainty_score":0.015890181},"labels":[],"label_agreement":null},{"id":"W2116717082","doi":"10.1287/ijoc.12.4.261.11882","title":"Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; George Mason University; National Science Foundation","keywords":"Mathematics; Queue; Exponential function; Laplace transform; Applied mathematics; Steady state (chemistry); Exponential distribution; Heavy-tailed distribution; Mathematical optimization; Probability distribution; Computer science; Statistics; Mathematical analysis","score_opus":0.015289215175012884,"score_gpt":0.2948225607351147,"score_spread":0.27953334556010184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116717082","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.0068114754,0.0008955317,0.9853909,0.00041933314,0.000081639264,0.000044087305,0.00010515029,0.00029633316,0.0059556076],"genre_scores_gemma":[0.19712698,0.0030421314,0.7874982,0.00027532873,0.00021151212,0.00052994775,0.0005145279,0.0002550737,0.010546243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963963,0.00015494712,0.000017014001,0.00003077273,0.00012953962,0.00002811978],"domain_scores_gemma":[0.9989292,0.0007430532,0.00007793881,0.00009873043,0.00012617714,0.00002493907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010556258,0.0006566134,0.0005036185,0.00083362625,0.00043569994,0.00087323657,0.0011481489,0.0010450965,0.004490469],"category_scores_gemma":[0.003132363,0.00031476968,0.0006425976,0.0010936065,0.00060366996,0.0012900911,0.00082857325,0.0015396541,0.0012704114],"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.000033706867,0.00012459554,0.00097609987,0.00020156094,0.000053508713,0.00012763687,0.00007851714,0.58290267,0.002106786,0.3242568,0.0045964983,0.08454158],"study_design_scores_gemma":[0.0000054655134,0.0000033496374,0.000067752524,0.000009744112,0.0000023320167,0.000011986707,0.0000053191557,0.9635465,0.0002546863,0.03458052,0.001507703,0.0000046096543],"about_ca_topic_score_codex":0.0030291148,"about_ca_topic_score_gemma":0.0034976152,"teacher_disagreement_score":0.004490469,"about_ca_system_score_codex":0.0007667175,"about_ca_system_score_gemma":0.0011371581,"threshold_uncertainty_score":0.015022099},"labels":[],"label_agreement":null},{"id":"W2116913423","doi":"10.1287/ijoc.1100.0383","title":"Algorithms for Coxianization of Phase-Type Generators","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Generator (circuit theory); Eigenvalues and eigenvectors; Type (biology); Phase (matter); Algorithm; Computer science; Mathematics; Physics; Power (physics); Thermodynamics","score_opus":0.02065572123318676,"score_gpt":0.3019533648761951,"score_spread":0.28129764364300835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116913423","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.0059430096,0.00005389551,0.99185586,0.000054480442,0.000018663006,0.00006951635,0.00004944763,0.0005510937,0.0014040846],"genre_scores_gemma":[0.106834985,0.00009569299,0.88888633,0.000064631655,0.000041096013,0.0002197649,0.00043696447,0.00034459482,0.003075847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991499,0.00019065132,0.00007105833,0.00019891777,0.00025291884,0.00013658166],"domain_scores_gemma":[0.9972114,0.0015430395,0.00020943598,0.0004911723,0.00043765918,0.00010726435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475702,0.0009979806,0.0010042876,0.0013840372,0.00090936216,0.0012302804,0.0017259793,0.00084056094,0.010439381],"category_scores_gemma":[0.0063151605,0.00055446697,0.0009794823,0.0010102686,0.00094169495,0.001978888,0.0026782241,0.0016149462,0.0026341195],"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.00050470914,0.00017839285,0.0015147817,0.0003079493,0.000079554666,0.00016042353,0.00043902363,0.21010996,0.011898246,0.23235199,0.009249949,0.53320503],"study_design_scores_gemma":[0.00015885833,0.000109650246,0.00017343705,0.00002435832,0.000019086272,0.00013555658,0.00012659976,0.7647285,0.0071142083,0.22064614,0.0067320364,0.00003148193],"about_ca_topic_score_codex":0.0013998876,"about_ca_topic_score_gemma":0.00239347,"teacher_disagreement_score":0.010439381,"about_ca_system_score_codex":0.0010552362,"about_ca_system_score_gemma":0.0017311967,"threshold_uncertainty_score":0.034923136},"labels":[],"label_agreement":null},{"id":"W2117833774","doi":"10.1287/ijoc.1080.0291","title":"Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Routing (electronic design automation); Operations research; Vendor; Inventory theory; Vehicle routing problem; Time horizon; Markov decision process; Column generation; Markov chain; Inventory management; Inventory control; Markov process; Mathematics; Operations management; Engineering","score_opus":0.03873982677101141,"score_gpt":0.26712172372284937,"score_spread":0.22838189695183797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117833774","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.030442826,0.0011253248,0.96320224,0.00033173745,0.0000635975,0.0001874472,0.00024796775,0.00033684765,0.0040619476],"genre_scores_gemma":[0.6280134,0.001473841,0.36771277,0.0001692077,0.0000601788,0.0004371007,0.0006531236,0.000102389466,0.001378042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987489,0.00082215766,0.000054076223,0.000099214136,0.00013609664,0.00013962605],"domain_scores_gemma":[0.996971,0.0024849498,0.00019299891,0.00009058324,0.00012633434,0.0001340944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017712285,0.0010627183,0.0013568883,0.0009692993,0.0006499379,0.0010882268,0.0012378473,0.0010083512,0.0028372477],"category_scores_gemma":[0.0033931856,0.00070383394,0.0009509049,0.0016948292,0.0008656497,0.0016846139,0.0009908302,0.0013111919,0.00034195065],"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.000045311786,0.000031815278,0.0001539497,0.00004721085,0.00002776365,0.000043723616,0.000034394907,0.9708562,0.00015668276,0.018547818,0.00072815764,0.009326985],"study_design_scores_gemma":[0.000026013557,0.000028068438,0.000042616586,0.0000132488585,0.000008969081,0.00001714098,0.00002265613,0.9720675,0.00010681111,0.02694617,0.00071376533,0.0000070921774],"about_ca_topic_score_codex":0.0046873004,"about_ca_topic_score_gemma":0.007053175,"teacher_disagreement_score":0.0046873004,"about_ca_system_score_codex":0.0015695916,"about_ca_system_score_gemma":0.0017459673,"threshold_uncertainty_score":0.011388302},"labels":[],"label_agreement":null},{"id":"W2118552209","doi":"10.1287/ijoc.14.3.261.115","title":"Symbolic Computation of Moments in Priority Queues","year":2002,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Operator (biology); Priority queue; Moment (physics); Computer science; Computation; Mean value analysis; Queue; Laplace transform; Taylor series; Partition (number theory); Set (abstract data type); Applied mathematics; Algorithm; Layered queueing network; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.020560555334924905,"score_gpt":0.2599327109370633,"score_spread":0.23937215560213843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118552209","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.05295368,0.00021192219,0.94059205,0.00016006173,0.00003475424,0.00002215701,0.00006515314,0.0005165397,0.0054437052],"genre_scores_gemma":[0.78123134,0.0004031008,0.21360964,0.00005180378,0.0000657285,0.000084075735,0.000115375595,0.00018011629,0.004258811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00014717894,0.000026084732,0.00003584182,0.00018710998,0.00006169468],"domain_scores_gemma":[0.9983165,0.0012899099,0.00012318688,0.00010568957,0.000115143324,0.000049485086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443118,0.00045638747,0.0005593555,0.0008813387,0.0005677406,0.0016117694,0.0009030879,0.0004941028,0.0027800708],"category_scores_gemma":[0.0065344158,0.00036692416,0.00047691574,0.00095317705,0.0011197297,0.002050004,0.0011694228,0.0009755317,0.00044906858],"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.00008972844,0.000028086519,0.0004883539,0.0000588408,0.000012836022,0.00015837897,0.00024737185,0.29753125,0.0023845464,0.67073214,0.0007399795,0.027528409],"study_design_scores_gemma":[0.000011402576,0.000009788343,0.00004615054,0.000007745196,0.0000032051478,0.000014280855,0.000017437167,0.8670212,0.00095820136,0.13131453,0.00059028144,0.000005822394],"about_ca_topic_score_codex":0.001944631,"about_ca_topic_score_gemma":0.001983085,"teacher_disagreement_score":0.0027800708,"about_ca_system_score_codex":0.0011616107,"about_ca_system_score_gemma":0.0009222975,"threshold_uncertainty_score":0.009300292},"labels":[],"label_agreement":null},{"id":"W2120930954","doi":"10.1287/ijoc.2013.0549","title":"An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Column (typography); Computer science; Routing (electronic design automation); Set (abstract data type); Upper and lower bounds; Path (computing); Shortest path problem; Enumeration; Vehicle routing problem; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.023142711761351704,"score_gpt":0.26970206619011905,"score_spread":0.24655935442876734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120930954","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.0048725926,0.00013912657,0.9902126,0.00012780262,0.000052825228,0.00014181866,0.00017153089,0.0011539413,0.003127825],"genre_scores_gemma":[0.06460728,0.000153267,0.93240756,0.00011442542,0.000029795563,0.00023866328,0.0007871323,0.00022090053,0.0014408962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00019664288,0.00003586745,0.00016552581,0.00024737098,0.00015218051],"domain_scores_gemma":[0.99878806,0.0007014324,0.000082656305,0.00022380504,0.0001642778,0.00003976952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503183,0.0015498542,0.0010894202,0.0011546,0.0008848226,0.0012144077,0.0015842099,0.0011733706,0.010682932],"category_scores_gemma":[0.0025993106,0.0006992479,0.0009669454,0.0017913133,0.0006598061,0.0018238202,0.0010856056,0.0017792841,0.0018826105],"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.00025158632,0.0003268795,0.000648673,0.0003311379,0.00007631815,0.00016990313,0.00011647509,0.51915824,0.0059378506,0.040629618,0.015388116,0.41696522],"study_design_scores_gemma":[0.000086137,0.00006848846,0.00013477851,0.000018803781,0.000021920057,0.00014730144,0.000036236215,0.969543,0.002273621,0.023674088,0.003975893,0.000019802856],"about_ca_topic_score_codex":0.0053256466,"about_ca_topic_score_gemma":0.0065474887,"teacher_disagreement_score":0.010682932,"about_ca_system_score_codex":0.0013710088,"about_ca_system_score_gemma":0.002287284,"threshold_uncertainty_score":0.03573799},"labels":[],"label_agreement":null},{"id":"W2121094316","doi":"10.1287/ijoc.1030.0046","title":"The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extreme point; Mathematical optimization; Constraint (computer-aided design); Point (geometry); Feasible region; Nonlinear programming; Nonlinear system; Mathematics; Projection (relational algebra); Computer science; Algorithm; Combinatorics","score_opus":0.1117965981494792,"score_gpt":0.4271677390108882,"score_spread":0.31537114086140905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121094316","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.0012312565,0.000064637,0.99771607,0.000035357647,0.000010625113,0.000023713836,0.0000100158495,0.00011343315,0.00079487177],"genre_scores_gemma":[0.137868,0.00035202943,0.85816085,0.00007437592,0.000048827882,0.000354993,0.00013046672,0.00015529475,0.0028552415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.00027661427,0.000031530457,0.0001463759,0.00040961447,0.000048332062],"domain_scores_gemma":[0.9985013,0.0009088011,0.00014048342,0.00014806933,0.00024888443,0.00005250007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012163932,0.0011182831,0.0011725086,0.0008262419,0.00083359797,0.0007555276,0.0013154447,0.0012250609,0.0032516117],"category_scores_gemma":[0.0049664285,0.0005645068,0.0006518249,0.0011101924,0.0011899082,0.001762748,0.0014729461,0.0021289638,0.0008261065],"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.000090480775,0.000037554215,0.00023708664,0.00015538886,0.00004871143,0.00008156308,0.000099973106,0.8208858,0.0038810687,0.045476172,0.0021872055,0.126819],"study_design_scores_gemma":[0.000018436902,0.000039605664,0.000045863348,0.000010045626,0.000005625866,0.000029663186,0.000009194652,0.9856793,0.0013211379,0.01088851,0.0019400662,0.000012493628],"about_ca_topic_score_codex":0.0050927536,"about_ca_topic_score_gemma":0.0034369589,"teacher_disagreement_score":0.0050927536,"about_ca_system_score_codex":0.00064593944,"about_ca_system_score_gemma":0.0017832919,"threshold_uncertainty_score":0.010877728},"labels":[],"label_agreement":null},{"id":"W2121266360","doi":"10.1287/ijoc.1100.0439","title":"A Hybrid Heuristic for an Inventory Routing Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":199,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Stockout; Mathematical optimization; Heuristic; Benchmark (surveying); Computer science; Integer programming; Service level; Inventory control; Operations research; Inventory theory; Routing (electronic design automation); Set (abstract data type); Time horizon; Vehicle routing problem; Tabu search; Mathematics","score_opus":0.05024524965669892,"score_gpt":0.28063752694019994,"score_spread":0.23039227728350103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121266360","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.079882436,0.0008672458,0.90089613,0.00036312582,0.000110768255,0.0003500613,0.00031459265,0.0012500534,0.015965631],"genre_scores_gemma":[0.47933617,0.00045580624,0.5138586,0.00023928327,0.00005284755,0.0006938986,0.0003632022,0.0001507531,0.004849407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941266,0.0002849832,0.000018851233,0.00006886341,0.00012052479,0.00009414271],"domain_scores_gemma":[0.99917525,0.00059147587,0.000062089486,0.00005367134,0.000070637565,0.000046906196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094399555,0.00092373224,0.0009478773,0.001147782,0.0005331877,0.0013731577,0.0016229902,0.0014824993,0.0043793623],"category_scores_gemma":[0.0016624588,0.0006228449,0.0006211874,0.0013220343,0.0006709321,0.0009927517,0.00081584003,0.00071112864,0.0005448065],"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.00010089806,0.00011959771,0.00027785244,0.00009433208,0.00004112332,0.00010235003,0.00006184674,0.95047843,0.0010710455,0.011299202,0.001487832,0.03486556],"study_design_scores_gemma":[0.00004719007,0.00006353238,0.000050135506,0.000012116524,0.000011998225,0.00003236998,0.0000241512,0.9952028,0.0003134052,0.0030383738,0.0011966795,0.0000071655604],"about_ca_topic_score_codex":0.003859259,"about_ca_topic_score_gemma":0.0045954753,"teacher_disagreement_score":0.0043793623,"about_ca_system_score_codex":0.001161686,"about_ca_system_score_gemma":0.0012864941,"threshold_uncertainty_score":0.014650404},"labels":[],"label_agreement":null},{"id":"W2121515906","doi":"10.1287/ijoc.1050.0148","title":"Waiting-Time Distribution of <i>M/D<sub>N</sub>/1</i> Queues Through Numerical Laplace Inversion","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Queue; Laplace transform; Inversion (geology); Mathematics; Recursion (computer science); Burke's theorem; Numerical analysis; Applied mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis; Fork–join queue; Queue management system; Geology","score_opus":0.009484064999067985,"score_gpt":0.2327397478342008,"score_spread":0.2232556828351328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121515906","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.32077464,0.00019819746,0.6740669,0.0003682253,0.000023179491,0.000035396344,0.00006217373,0.00035254666,0.0041186903],"genre_scores_gemma":[0.9482935,0.000113673166,0.050055876,0.00003943838,0.000020016572,0.000021660937,0.00004857489,0.00004477234,0.0013624842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.00006474635,0.0000073399106,0.000017431132,0.00007427993,0.000029013718],"domain_scores_gemma":[0.99820435,0.00125299,0.00017633142,0.00009050642,0.0002272148,0.000048616537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011270575,0.00022353524,0.0002116447,0.0004937076,0.00029731658,0.00069639256,0.0007034088,0.0003871643,0.0010040671],"category_scores_gemma":[0.004947617,0.00020525293,0.00029230997,0.00042109535,0.0007826527,0.0009515891,0.00039631687,0.0006401022,0.00014019133],"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.00016706703,0.000078522,0.005879372,0.00005339091,0.000019799092,0.00012492927,0.0003118645,0.88614494,0.0080619175,0.07334086,0.0006532281,0.025164055],"study_design_scores_gemma":[0.000004983799,0.0000061117958,0.00016655789,0.0000019198046,0.0000013418331,0.000007902178,0.000010844565,0.9965528,0.0007042467,0.002463197,0.00007674149,0.0000033556948],"about_ca_topic_score_codex":0.008478194,"about_ca_topic_score_gemma":0.004232988,"teacher_disagreement_score":0.008478194,"about_ca_system_score_codex":0.0011347932,"about_ca_system_score_gemma":0.0011482752,"threshold_uncertainty_score":0.016857684},"labels":[],"label_agreement":null},{"id":"W2122752725","doi":"10.1287/ijoc.1030.0051","title":"Meta-Heuristics for a Class of Demand-Responsive Transit Systems","year":2005,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Vehicle routing problem; Tabu search; Class (philosophy); Schedule; Set (abstract data type); Greedy algorithm; Operations research; Constructive; Routing (electronic design automation); Algorithm; Process (computing); Artificial intelligence; Mathematics","score_opus":0.040122124225718085,"score_gpt":0.26618417644949705,"score_spread":0.22606205222377895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122752725","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.07792746,0.0019545201,0.90498537,0.00058931124,0.000077948105,0.00050474476,0.00036393892,0.00058889465,0.0130078355],"genre_scores_gemma":[0.64054817,0.0011595967,0.35289538,0.00021159112,0.000066869885,0.0007648545,0.000297948,0.00011526555,0.003940306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00033292765,0.000026940781,0.000069412745,0.000090290465,0.00010842845],"domain_scores_gemma":[0.99865484,0.0009997453,0.00014868648,0.00006410055,0.00007652644,0.00005601293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013920433,0.0010645082,0.0009120374,0.0012556848,0.00047667758,0.0016441663,0.0013878088,0.001481508,0.0022376252],"category_scores_gemma":[0.0026842668,0.0007296942,0.0008570967,0.0012188089,0.0007380796,0.0008320224,0.00064477633,0.001195749,0.0002323463],"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.000033855136,0.000036449783,0.0001322477,0.000053671865,0.000032356405,0.0000478721,0.000037711336,0.9784228,0.00026857387,0.013346167,0.00043338683,0.0071548703],"study_design_scores_gemma":[0.000040917745,0.00004077696,0.00006830725,0.000019652947,0.000015183768,0.000019257228,0.000035817433,0.9909961,0.0002560412,0.0074351677,0.0010676251,0.000005012732],"about_ca_topic_score_codex":0.0037100383,"about_ca_topic_score_gemma":0.0041980958,"teacher_disagreement_score":0.0037100383,"about_ca_system_score_codex":0.001629028,"about_ca_system_score_gemma":0.0015201161,"threshold_uncertainty_score":0.011819482},"labels":[],"label_agreement":null},{"id":"W2123577276","doi":"10.1287/ijoc.1070.0251","title":"Efficient Jump Ahead for 𝔽<sub>2</sub>-Linear Random Number Generators","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science","keywords":"Modulo; Mathematics; Matrix multiplication; Pseudorandom number generator; Jump; Time complexity; Disjoint sets; Discrete mathematics; Random number generation; Matrix (chemical analysis); Multiplication (music); Sequence (biology); State (computer science); Combinatorics; Algorithm; Iterated function","score_opus":0.02100252490413513,"score_gpt":0.2610842207849916,"score_spread":0.24008169588085648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123577276","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.11728208,0.000302336,0.87083745,0.00024130456,0.00009465668,0.00021167815,0.00015210385,0.0057151876,0.0051632836],"genre_scores_gemma":[0.57555085,0.00013749245,0.41437,0.00010281174,0.000043402153,0.00018152794,0.0003460262,0.00032618054,0.008941576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994566,0.000098615856,0.00004451901,0.00008924464,0.0002084944,0.000102535465],"domain_scores_gemma":[0.9988858,0.00067621766,0.00011999769,0.00016052948,0.00010879426,0.000048620463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000620054,0.00046798357,0.0005746958,0.00065382896,0.00055997964,0.0007230962,0.00081005844,0.00051144214,0.00763553],"category_scores_gemma":[0.0023805187,0.000311106,0.0003735297,0.00049213896,0.00050761574,0.001476961,0.0010447308,0.00079001725,0.0016600539],"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.0015833201,0.00023026034,0.0015457924,0.0003666201,0.00004637985,0.0007612801,0.0005436819,0.09671807,0.086077265,0.16285746,0.009934297,0.63933563],"study_design_scores_gemma":[0.00018662385,0.0003347553,0.00046191565,0.000035790654,0.000022099792,0.0003592846,0.00006277869,0.8719975,0.061181754,0.058151588,0.007150207,0.00005580516],"about_ca_topic_score_codex":0.0008168649,"about_ca_topic_score_gemma":0.0018557133,"teacher_disagreement_score":0.00763553,"about_ca_system_score_codex":0.00066436594,"about_ca_system_score_gemma":0.0007264394,"threshold_uncertainty_score":0.025543392},"labels":[],"label_agreement":null},{"id":"W2124475618","doi":"10.1287/ijoc.1100.0406","title":"A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Mathematical optimization; Set packing; Bin; Branch and bound; Mathematics; Heuristics; Branch and cut; Algorithm; Branching (polymer chemistry); Set (abstract data type); Scheduling (production processes); Computer science; Integer programming","score_opus":0.0101253620362066,"score_gpt":0.22448248848650484,"score_spread":0.21435712645029825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124475618","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.0031814028,0.00018929385,0.99340856,0.00018255011,0.00005079924,0.00014871327,0.00005161969,0.00034758679,0.0024394707],"genre_scores_gemma":[0.03090531,0.00022348097,0.9662881,0.000073369265,0.00004317515,0.00030223044,0.0001923057,0.00015393658,0.0018181198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989367,0.00024341466,0.00006986788,0.00014915799,0.00044817736,0.00015261902],"domain_scores_gemma":[0.999019,0.0005505595,0.00007091121,0.00009746479,0.00019096954,0.00007110162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011518181,0.0012067086,0.0015399694,0.0011777427,0.0011555512,0.0015758248,0.0022297238,0.0018475772,0.011466521],"category_scores_gemma":[0.0042714374,0.0008438058,0.0010305105,0.0026267061,0.00077547674,0.00241947,0.00266595,0.0030295642,0.0020003773],"study_design_candidate":"simulation_or_modeling","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.000185434,0.00032510445,0.0005921123,0.00031417172,0.00008810638,0.00024998173,0.00021163297,0.40410617,0.0052379537,0.072088666,0.013998253,0.50260246],"study_design_scores_gemma":[0.00011344301,0.00008609007,0.00012449254,0.000022537062,0.00002672277,0.00015191866,0.000036730744,0.95261234,0.0015315771,0.038195472,0.007075271,0.000023472503],"about_ca_topic_score_codex":0.0030195813,"about_ca_topic_score_gemma":0.0035222333,"teacher_disagreement_score":0.011466521,"about_ca_system_score_codex":0.0010880324,"about_ca_system_score_gemma":0.002409001,"threshold_uncertainty_score":0.038359404},"labels":[],"label_agreement":null},{"id":"W2124761764","doi":"10.1287/ijoc.1080.0307","title":"A Constraint Programming Approach for Solving a Queueing Design and Control Problem","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Queueing theory; Mathematical optimization; Computer science; Constraint (computer-aided design); Decomposition; Benders' decomposition; Constraint programming; Stochastic programming; Control (management); Variety (cybernetics); Operations research; Service (business); Engineering; Mathematics; Artificial intelligence; Computer network; Economics","score_opus":0.0969777626073913,"score_gpt":0.35893173602124734,"score_spread":0.26195397341385607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124761764","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.0010059952,0.00018951131,0.9958994,0.00027201805,0.000040165345,0.00009452086,0.00009938024,0.000074098134,0.0023249525],"genre_scores_gemma":[0.08156649,0.0009981093,0.91172624,0.00032373995,0.00017355643,0.0012183407,0.0003810484,0.00008805491,0.0035243623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754745,0.0010325052,0.00013595873,0.00040725397,0.0006348635,0.00024197242],"domain_scores_gemma":[0.9950913,0.0040201386,0.00021059993,0.000115683964,0.00041754852,0.00014468358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003675616,0.0022789834,0.0016477588,0.0011690714,0.0011186113,0.002624808,0.0024539744,0.002268168,0.0061037],"category_scores_gemma":[0.0069200536,0.001170495,0.0019719538,0.0027441448,0.001665614,0.0013941919,0.0016598895,0.0036650037,0.00072470383],"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.00004073359,0.000069698355,0.00013530631,0.00018108661,0.00005608924,0.000100538644,0.00006793631,0.90653706,0.0005293828,0.063582964,0.0018693359,0.026829837],"study_design_scores_gemma":[0.000037372174,0.00003482493,0.000035285942,0.000023303419,0.000018549257,0.000021595017,0.000019345725,0.97117054,0.0002382057,0.0257529,0.002635559,0.000012607944],"about_ca_topic_score_codex":0.018255295,"about_ca_topic_score_gemma":0.012400994,"teacher_disagreement_score":0.018255295,"about_ca_system_score_codex":0.0027886012,"about_ca_system_score_gemma":0.0055808383,"threshold_uncertainty_score":0.036298096},"labels":[],"label_agreement":null},{"id":"W2125126715","doi":"10.1287/ijoc.1110.0489","title":"A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; 2-opt; Traveling purchaser problem; Pickup; Branch and cut; Mathematical optimization; Algorithm; Computer science; Path (computing); Mathematics; Branch and bound; Shortest path problem; Nearest neighbour algorithm; Combinatorial optimization; Hamiltonian path; Stack (abstract data type); Integer programming; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03182662460064117,"score_gpt":0.25576659836804566,"score_spread":0.2239399737674045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125126715","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.014791531,0.00044224484,0.976014,0.0003569026,0.00008548023,0.0003519455,0.00032966695,0.0012880962,0.006340229],"genre_scores_gemma":[0.06487407,0.0002665427,0.92999417,0.00009518611,0.000044993103,0.00040765258,0.000887387,0.00027139802,0.003158619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.00016989217,0.00004216499,0.00019568163,0.0001756275,0.00015546591],"domain_scores_gemma":[0.99896,0.0006558377,0.00008246423,0.00007959368,0.00013836128,0.000083808874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145009,0.0017157249,0.0016855034,0.0012058383,0.0014263476,0.0017172929,0.0019865865,0.0019629186,0.011928862],"category_scores_gemma":[0.0026262626,0.0009768426,0.0011023391,0.002477041,0.0005210926,0.002312678,0.0016309081,0.0024236687,0.001901169],"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.00026208165,0.00048677129,0.00060220365,0.0002889971,0.00008560285,0.00021287304,0.00016615813,0.5627932,0.0025370605,0.023711564,0.016350918,0.39250252],"study_design_scores_gemma":[0.00011203178,0.000100164,0.00013797266,0.00002015575,0.000024361078,0.00007051909,0.00005813568,0.9787714,0.000806287,0.016094238,0.003790536,0.000014217336],"about_ca_topic_score_codex":0.008820892,"about_ca_topic_score_gemma":0.008912121,"teacher_disagreement_score":0.011928862,"about_ca_system_score_codex":0.001414026,"about_ca_system_score_gemma":0.003013035,"threshold_uncertainty_score":0.039906025},"labels":[],"label_agreement":null},{"id":"W2126919183","doi":"10.1287/ijoc.1060.0188","title":"From the Guest Editor—Special Cluster on Operations Research in Electrical and Computer Engineering","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"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":"Computer science; Cluster (spacecraft); Industrial engineering; Operations research; Software engineering; Engineering drawing; Programming language; Engineering","score_opus":0.021075315727685177,"score_gpt":0.2818554157100492,"score_spread":0.260780099982364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126919183","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024845274,0.0101253595,0.0013165881,0.06682773,0.90911245,0.00005316071,0.00015994142,0.00009645404,0.012059873],"genre_scores_gemma":[0.0019211207,0.00832146,0.000581187,0.012159221,0.9549865,0.000064700165,0.000095319476,0.000112698865,0.021757806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938955,0.0012148536,0.0008264602,0.0011878512,0.002487822,0.00038750924],"domain_scores_gemma":[0.970008,0.010474011,0.001635052,0.0011750127,0.01417377,0.0025342104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069096107,0.0030030622,0.0029064945,0.0030801685,0.0020741718,0.0092897685,0.0022521515,0.007136823,0.056171566],"category_scores_gemma":[0.03284406,0.0010279239,0.001754081,0.0025690529,0.0019865779,0.004085607,0.0013703868,0.012681052,0.030547809],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000035627585,0.000022422324,0.00009321828,0.00015208464,0.0000131238685,0.00006244672,0.00001114652,0.00014207882,0.00005296258,0.0014025753,0.98733926,0.010673065],"study_design_scores_gemma":[0.000053944117,0.00006040308,0.0004905603,0.00039769543,0.000027782964,0.00038414824,0.000039747305,0.0013626962,0.00018053694,0.003877121,0.9930875,0.000037824524],"about_ca_topic_score_codex":0.0010666634,"about_ca_topic_score_gemma":0.0017728835,"teacher_disagreement_score":0.056171566,"about_ca_system_score_codex":0.0034978797,"about_ca_system_score_gemma":0.0036839987,"threshold_uncertainty_score":0.18791258},"labels":[],"label_agreement":null},{"id":"W2128811073","doi":"10.1287/ijoc.1110.0454","title":"A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Computer science; Hybrid algorithm (constraint satisfaction); Algorithm; Mathematical optimization; Constraint programming; Guided Local Search; Scheduling (production processes); Constraint (computer-aided design); Heuristic; Dynamic programming; Constraint logic programming; Mathematics; Stochastic programming","score_opus":0.025654230530110424,"score_gpt":0.2752020308302267,"score_spread":0.24954780030011628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128811073","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.006377932,0.000267619,0.9893401,0.000097584256,0.00003533054,0.0000981873,0.00009140741,0.0009244128,0.0027674804],"genre_scores_gemma":[0.071930654,0.000186044,0.9246969,0.00012865965,0.0000284139,0.00032658508,0.00027751923,0.00026170086,0.0021633895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908316,0.00037120716,0.000040138653,0.00013006535,0.0002769995,0.000098402896],"domain_scores_gemma":[0.9989623,0.00063691573,0.00006759032,0.000088200315,0.00020334193,0.000041595784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012646116,0.000995183,0.0011089261,0.0013592843,0.00083617517,0.0012012831,0.002184279,0.0013229097,0.0048587685],"category_scores_gemma":[0.0029396177,0.0006999269,0.0007680448,0.0027816247,0.0006232615,0.0013199747,0.0009665797,0.0012961921,0.0011285681],"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.00016307588,0.00014311234,0.0005258476,0.00013067985,0.00010018636,0.00006540255,0.00008288277,0.67260283,0.002259991,0.017459864,0.00548922,0.30097687],"study_design_scores_gemma":[0.00004336234,0.000032995627,0.000084187646,0.000008651229,0.000011324565,0.000035342673,0.000014340761,0.99269897,0.00058128516,0.0040018894,0.0024767711,0.000010921597],"about_ca_topic_score_codex":0.01249953,"about_ca_topic_score_gemma":0.010067717,"teacher_disagreement_score":0.01249953,"about_ca_system_score_codex":0.00096517225,"about_ca_system_score_gemma":0.00205233,"threshold_uncertainty_score":0.024853587},"labels":[],"label_agreement":null},{"id":"W2129946839","doi":"10.1287/ijoc.1080.0296","title":"Accelerating Benders Decomposition by Local Branching","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":164,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Branching (polymer chemistry); Mathematical optimization; Branch and bound; Mathematics; Decomposition; Upper and lower bounds; Algorithm; Computer science","score_opus":0.016081907554113695,"score_gpt":0.24108229443550394,"score_spread":0.22500038688139024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129946839","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.012173672,0.0001022206,0.98332363,0.000058941507,0.000018647095,0.00003183913,0.000012434966,0.0006268627,0.003651816],"genre_scores_gemma":[0.19758835,0.00026961652,0.7980997,0.00009966326,0.000034735356,0.00013223778,0.00009403498,0.00035173024,0.0033299895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00020094913,0.000026823667,0.0001052484,0.00025208993,0.000101205485],"domain_scores_gemma":[0.99891996,0.0006066598,0.00009054548,0.00018658505,0.00013810673,0.000058155223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148034,0.0010804649,0.000792387,0.00087637664,0.00048065584,0.0008942551,0.0009226952,0.0008045803,0.0068946676],"category_scores_gemma":[0.0028578301,0.00048906746,0.00071499357,0.0009558161,0.0007374939,0.0015843877,0.0015415275,0.002030561,0.0014753297],"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.00024760937,0.00013767283,0.00049946277,0.00016058127,0.000039598795,0.00011230476,0.00017349239,0.6437176,0.034461148,0.07101348,0.002199779,0.24723732],"study_design_scores_gemma":[0.00005339406,0.00008159406,0.00010924606,0.000021275908,0.000017228243,0.00005505215,0.00002915753,0.95923346,0.009821321,0.026970843,0.0035942325,0.000013126796],"about_ca_topic_score_codex":0.0011948734,"about_ca_topic_score_gemma":0.0021271412,"teacher_disagreement_score":0.0068946676,"about_ca_system_score_codex":0.0006671899,"about_ca_system_score_gemma":0.0007641245,"threshold_uncertainty_score":0.023064971},"labels":[],"label_agreement":null},{"id":"W2132499281","doi":"10.1287/ijoc.1060.0208","title":"The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Production schedule; Heuristic; Operations research; Schedule; Memetic algorithm; Heuristics; Genetic algorithm; Mathematics","score_opus":0.015318365491527371,"score_gpt":0.2665560813810715,"score_spread":0.25123771588954413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132499281","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.21397914,0.0010187523,0.77044016,0.0011555316,0.00014572551,0.0006844255,0.0014309179,0.00046900095,0.010676393],"genre_scores_gemma":[0.5922015,0.0010802865,0.39179292,0.00016386999,0.00015524859,0.00092168344,0.0019736006,0.00021204089,0.011498849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00014858182,0.000038510443,0.00021857013,0.00011854611,0.000110507346],"domain_scores_gemma":[0.9990025,0.0005465122,0.00018624133,0.00006726233,0.00007832783,0.0001191006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011632683,0.0015033102,0.0016400629,0.00090857066,0.0009919283,0.0014639029,0.0015137431,0.0017607505,0.0074627344],"category_scores_gemma":[0.0024095846,0.00068760506,0.0012570028,0.0018077131,0.0008476538,0.002083148,0.0009309718,0.001032932,0.0007465535],"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.00056278566,0.0003888003,0.0018317777,0.00071183563,0.00017961724,0.0008380613,0.00025619092,0.8662512,0.011756282,0.027125986,0.004220911,0.08587669],"study_design_scores_gemma":[0.00018261069,0.0008515997,0.0017027715,0.00004652304,0.000118410746,0.0005905338,0.00025582893,0.951303,0.004350911,0.03163519,0.00891633,0.00004632302],"about_ca_topic_score_codex":0.0035858387,"about_ca_topic_score_gemma":0.0030780917,"teacher_disagreement_score":0.0074627344,"about_ca_system_score_codex":0.001390256,"about_ca_system_score_gemma":0.0023854407,"threshold_uncertainty_score":0.024965346},"labels":[],"label_agreement":null},{"id":"W2133434949","doi":"10.1287/ijoc.13.4.345.9731","title":"Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Université de Montréal","funders":"University of Melbourne; National Science Foundation","keywords":"Estimator; Variance reduction; Mathematics; Minimum-variance unbiased estimator; Imaging phantom; Queueing theory; Applied mathematics; Variance (accounting); Upper and lower bounds; Bias of an estimator; Harmonic; Mathematical optimization; Algorithm; Statistics; Mathematical analysis; Physics; Monte Carlo method","score_opus":0.021545803696729978,"score_gpt":0.27105548440786903,"score_spread":0.24950968071113905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133434949","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.0058342637,0.000092268856,0.9936991,0.00004307074,0.000013824044,0.00002410241,0.000009994721,0.00010689878,0.0001765316],"genre_scores_gemma":[0.49832436,0.00029638104,0.49912676,0.00014543413,0.00011218554,0.00016147755,0.00015444781,0.00015612361,0.0015227789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698645,0.0012672793,0.00013288454,0.0003294901,0.00111452,0.00016939103],"domain_scores_gemma":[0.98641807,0.009596756,0.0011703902,0.0008771378,0.0016780406,0.00025961176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00645206,0.0007536519,0.0010538498,0.0011566778,0.00037788926,0.0012350566,0.0018879089,0.00093111466,0.0010261955],"category_scores_gemma":[0.029833145,0.0006465935,0.00046374422,0.0006316557,0.001431265,0.002786666,0.0016825781,0.0016211724,0.00022466472],"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.00027865532,0.00010182,0.0029493948,0.00014834372,0.00010168879,0.000115662064,0.0001791016,0.74953175,0.0071022045,0.11932419,0.0013513943,0.1188158],"study_design_scores_gemma":[0.000010253202,0.0000469478,0.0002672584,0.0000053292943,0.000006293268,0.000027155267,0.000006017151,0.98122555,0.0014053033,0.0165134,0.00047211535,0.000014472826],"about_ca_topic_score_codex":0.0013396383,"about_ca_topic_score_gemma":0.0011480061,"teacher_disagreement_score":0.00645206,"about_ca_system_score_codex":0.0012404309,"about_ca_system_score_gemma":0.001315993,"threshold_uncertainty_score":0.03412211},"labels":[],"label_agreement":null},{"id":"W2137804648","doi":"10.1287/ijoc.2013.0589","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro","keywords":"Dominating set; Connected dominating set; Cardinality (data modeling); Algorithm; Mathematics; Branch and cut; Set (abstract data type); Branch and bound; Benders' decomposition; Strongly connected component; Graph; Mathematical optimization; Combinatorics; Computer science; Integer programming; Minimum spanning tree; Vertex (graph theory)","score_opus":0.02272631946703941,"score_gpt":0.3144781079620658,"score_spread":0.2917517884950264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137804648","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.013411933,0.0011439219,0.97806907,0.00038195925,0.00008168019,0.00017734437,0.00024663168,0.00080629997,0.005681242],"genre_scores_gemma":[0.09495296,0.0007584892,0.89904755,0.00018832633,0.00009396362,0.00043905625,0.000817766,0.00024443676,0.0034575067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983985,0.00059207744,0.00008278608,0.00030511737,0.00047122783,0.00015029083],"domain_scores_gemma":[0.9976801,0.0013602378,0.0002094535,0.00038699343,0.00023068425,0.00013248369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520643,0.002276688,0.0015505737,0.0018358339,0.00091633725,0.001776734,0.0025727858,0.0019290413,0.0039200895],"category_scores_gemma":[0.0058625364,0.0009903357,0.0012292273,0.003941756,0.000949015,0.0037687994,0.0019674534,0.0027401638,0.0010914161],"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.00027951616,0.0003818801,0.0007414028,0.00037567108,0.00012779744,0.00008445082,0.0001836074,0.633697,0.002492825,0.07360381,0.009426702,0.27860537],"study_design_scores_gemma":[0.00008964175,0.00011089607,0.00021781916,0.000033588705,0.000034918667,0.000096741045,0.00003779939,0.92334837,0.0014056048,0.06979767,0.004804391,0.000022579248],"about_ca_topic_score_codex":0.0023977675,"about_ca_topic_score_gemma":0.0032857256,"teacher_disagreement_score":0.0039200895,"about_ca_system_score_codex":0.0016698304,"about_ca_system_score_gemma":0.0017993598,"threshold_uncertainty_score":0.0131139755},"labels":[],"label_agreement":null},{"id":"W2139218870","doi":"10.1287/ijoc.1040.0103","title":"A New Mathematical-Programming Framework for Facility-Layout Design","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Facility location problem; Relaxation (psychology); Mathematics","score_opus":0.024341853022406157,"score_gpt":0.2593529290570322,"score_spread":0.23501107603462607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139218870","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.00015854134,0.000097400545,0.9978417,0.00007459161,0.000023331808,0.000026000875,0.00003325607,0.000051430652,0.0016936746],"genre_scores_gemma":[0.018691242,0.00057496555,0.97714007,0.00010718741,0.000093161296,0.00037403053,0.00015629728,0.00011970101,0.0027432845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977132,0.0008316817,0.000097848824,0.00028794276,0.0008962213,0.00017305186],"domain_scores_gemma":[0.9988034,0.0006115022,0.00012148717,0.00013059888,0.00026238477,0.000070639835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911212,0.0022753023,0.0014500024,0.0016408516,0.0009937955,0.0026499322,0.0038376844,0.0017242916,0.008699426],"category_scores_gemma":[0.003922302,0.0012166527,0.0024298667,0.0028039988,0.001646661,0.0026611823,0.0023662522,0.0038112681,0.0029827438],"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.000018104754,0.000057759997,0.00012690917,0.00029890187,0.00003898893,0.000081796694,0.00006797734,0.50094306,0.0011562383,0.4467297,0.0053424337,0.045138057],"study_design_scores_gemma":[0.000025597328,0.00004383994,0.000037275448,0.000046412744,0.000018992827,0.00009700508,0.000019738325,0.83146495,0.00071000087,0.13800687,0.029506465,0.000022937902],"about_ca_topic_score_codex":0.003548246,"about_ca_topic_score_gemma":0.0050359913,"teacher_disagreement_score":0.008699426,"about_ca_system_score_codex":0.0022956906,"about_ca_system_score_gemma":0.0037263366,"threshold_uncertainty_score":0.029102445},"labels":[],"label_agreement":null},{"id":"W2139575211","doi":"10.1287/ijoc.12.3.223.12638","title":"A Simplex-Based Tabu Search Method for Capacitated Network Design","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":167,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Simplex; Integer programming; Set (abstract data type); Network planning and design; Integer (computer science); Mathematics; Column generation; Computer science; Fixed charge; Algorithm; Combinatorics","score_opus":0.04292685753506973,"score_gpt":0.30508229562650413,"score_spread":0.2621554380914344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139575211","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.0048064105,0.00036201795,0.98923045,0.0000739589,0.000043619275,0.00010686576,0.00013442629,0.0010367752,0.00420549],"genre_scores_gemma":[0.1052816,0.00034268977,0.89001787,0.00009245845,0.000032481235,0.00075541844,0.00035275554,0.00047597772,0.0026486884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992034,0.00048066015,0.000018552488,0.00005425315,0.0002009649,0.000042159652],"domain_scores_gemma":[0.9988888,0.0007011346,0.00006525282,0.00007893318,0.00023323159,0.000032583484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012257291,0.0011941525,0.0011928747,0.0014409552,0.0008240129,0.00097108184,0.0012807521,0.0011485979,0.007239245],"category_scores_gemma":[0.0039300816,0.0007674427,0.0006585634,0.0027237935,0.0005648971,0.00072458514,0.0008054352,0.0013036373,0.0017874934],"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.00006849281,0.000053343578,0.00022360476,0.00009152642,0.00005076225,0.000024991024,0.00005121809,0.86184484,0.000953318,0.009965228,0.003375842,0.12329687],"study_design_scores_gemma":[0.00001321796,0.000016927097,0.000027523358,0.00000775626,0.000004909984,0.000008453397,0.0000063861276,0.9959014,0.00025794932,0.0025686957,0.0011816524,0.000005162606],"about_ca_topic_score_codex":0.006000961,"about_ca_topic_score_gemma":0.0053104847,"teacher_disagreement_score":0.007239245,"about_ca_system_score_codex":0.000840631,"about_ca_system_score_gemma":0.001646204,"threshold_uncertainty_score":0.024217725},"labels":[],"label_agreement":null},{"id":"W2142975476","doi":"10.1287/ijoc.2013.0553","title":"Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convexity; Mathematical optimization; Convex optimization; Generalization; Convex function; Computer science; Regular polygon; Gradient descent; Mathematics; Artificial intelligence","score_opus":0.05892505650074767,"score_gpt":0.39245925833899264,"score_spread":0.333534201838245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142975476","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.014487648,0.00071847107,0.9821138,0.00069441466,0.000045807617,0.00004067552,0.00004618578,0.00010881222,0.0017441997],"genre_scores_gemma":[0.735594,0.002301543,0.2549113,0.0004841691,0.00026615945,0.00037503388,0.00020216055,0.00019194574,0.0056737084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981628,0.001014139,0.000070392045,0.00022324405,0.0003848342,0.0001445492],"domain_scores_gemma":[0.9863853,0.010884069,0.0011083264,0.00057156634,0.0008059194,0.000244795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005311024,0.0011896658,0.0016881966,0.00094802765,0.00055415946,0.0013017122,0.0016170624,0.0017448989,0.0020813162],"category_scores_gemma":[0.016377863,0.00088762864,0.0010202918,0.0013048253,0.0023968369,0.0024903978,0.0016827055,0.0022026636,0.00024390935],"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.000078223755,0.000060239057,0.0012511456,0.00012306253,0.00008181439,0.00016102508,0.00007411403,0.8435483,0.00066693884,0.13356306,0.0011071272,0.019284846],"study_design_scores_gemma":[0.000009073915,0.000015275135,0.00013235366,0.000008906034,0.000005647786,0.000015616839,0.0000061545143,0.9688588,0.00014657131,0.03049754,0.00029823143,0.0000058467604],"about_ca_topic_score_codex":0.0049410886,"about_ca_topic_score_gemma":0.0034023635,"teacher_disagreement_score":0.005311024,"about_ca_system_score_codex":0.001975571,"about_ca_system_score_gemma":0.0015934281,"threshold_uncertainty_score":0.028087735},"labels":[],"label_agreement":null},{"id":"W2143984912","doi":"10.1287/ijoc.2014.0636","title":"Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Column generation; Mathematical optimization; Sizing; Lagrangian relaxation; Heuristic; Relaxation (psychology); Reduction (mathematics); Computer science; State space; Dual (grammatical number); Heuristics; Scheme (mathematics); Mathematics; Space (punctuation); Lagrange multiplier; Algorithm","score_opus":0.03690088290032218,"score_gpt":0.2450230181373212,"score_spread":0.20812213523699902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143984912","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.015283456,0.00034045233,0.977724,0.00024357127,0.000045497523,0.00009326961,0.00032573982,0.000148093,0.005795831],"genre_scores_gemma":[0.33558378,0.0012587227,0.6541416,0.00013887374,0.00015453176,0.00046571324,0.00081241503,0.0002513129,0.007193045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962175,0.00017214028,0.000014346972,0.00004348015,0.00008466252,0.00006371846],"domain_scores_gemma":[0.9991905,0.0005768826,0.00008499944,0.00005039331,0.00004826776,0.000048919228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694162,0.000839868,0.000593917,0.00077217096,0.00032558883,0.0009899404,0.00080341194,0.0006617725,0.008509359],"category_scores_gemma":[0.002732874,0.00049297727,0.001007621,0.0013638397,0.0004022806,0.0010936981,0.0007148873,0.001579218,0.00070136087],"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.00013354259,0.00007878608,0.00025795342,0.00019221113,0.000030726544,0.00006747367,0.00006642981,0.8755417,0.0022284328,0.06456196,0.0036148343,0.053225916],"study_design_scores_gemma":[0.00002757352,0.00005041028,0.0001328362,0.000016305437,0.000012627666,0.000026541205,0.000023483144,0.96591485,0.000566163,0.031454884,0.0017664523,0.000007899329],"about_ca_topic_score_codex":0.0016561096,"about_ca_topic_score_gemma":0.0024580786,"teacher_disagreement_score":0.008509359,"about_ca_system_score_codex":0.0010434983,"about_ca_system_score_gemma":0.0013415464,"threshold_uncertainty_score":0.028466642},"labels":[],"label_agreement":null},{"id":"W2144303296","doi":"10.1287/ijoc.1090.0341","title":"Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada); HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Speedup; Constrained Shortest Path First; Shortest path problem; Vehicle routing problem; Path (computing); Scheduling (production processes); Routing (electronic design automation); Context (archaeology); Longest path problem; K shortest path routing; Mathematics; Parallel computing; Theoretical computer science; Computer network","score_opus":0.017409394862990268,"score_gpt":0.28754947685326876,"score_spread":0.2701400819902785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144303296","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.017996378,0.00035319454,0.9749463,0.00029440963,0.00005685243,0.00007764087,0.000111682435,0.00028923224,0.0058741737],"genre_scores_gemma":[0.3132844,0.000719815,0.6762821,0.00012279097,0.00006280886,0.0003550663,0.00030916577,0.0003204954,0.00854332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993641,0.0002458319,0.000015481543,0.00005293286,0.00025801983,0.00006360163],"domain_scores_gemma":[0.99911124,0.0005660652,0.00006736421,0.0001112047,0.000120147655,0.000023839348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815429,0.00077864784,0.0004929601,0.0009233327,0.00053051737,0.00072463276,0.0009816057,0.0007074633,0.0063925325],"category_scores_gemma":[0.004045456,0.00036346182,0.00052693894,0.0014422506,0.00074643537,0.0015349706,0.00075478136,0.0013465809,0.00077072304],"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.00011839224,0.00009370592,0.0004219424,0.00014798285,0.00003555448,0.00008307785,0.00007155813,0.66738075,0.0028534005,0.18185475,0.0043249195,0.14261387],"study_design_scores_gemma":[0.000026565314,0.000058552618,0.00021664688,0.000019164156,0.000020974128,0.00005358057,0.000018473102,0.90117526,0.0024819463,0.09069688,0.005215892,0.0000159167],"about_ca_topic_score_codex":0.0048282505,"about_ca_topic_score_gemma":0.0061296043,"teacher_disagreement_score":0.0063925325,"about_ca_system_score_codex":0.0008774173,"about_ca_system_score_gemma":0.0013769174,"threshold_uncertainty_score":0.021385193},"labels":[],"label_agreement":null},{"id":"W2147640578","doi":"10.1287/ijoc.1050.0154","title":"Using Eigenvectors to Partition Circuits","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Partition (number theory); Eigenvalues and eigenvectors; Computer science; Mathematics; Electronic circuit; Arithmetic; Combinatorics; Engineering; Physics; Electrical engineering","score_opus":0.027372000564207362,"score_gpt":0.25504836344767023,"score_spread":0.22767636288346288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147640578","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.009425058,0.00010723308,0.98614186,0.000057297042,0.000029260698,0.00003883443,0.00008129546,0.00041726348,0.0037018952],"genre_scores_gemma":[0.15078364,0.00039480295,0.8406411,0.00009481011,0.000048098307,0.00021121542,0.000509682,0.00044656688,0.0068700234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943453,0.00012952415,0.00003301926,0.0001262936,0.00019392544,0.00008270081],"domain_scores_gemma":[0.999258,0.00031405146,0.000071881994,0.00011665873,0.00020719621,0.000032272113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050785195,0.0012244361,0.00058220676,0.0020435972,0.00077548815,0.0014954688,0.0005898775,0.00056782586,0.007076204],"category_scores_gemma":[0.0029878588,0.0005150764,0.00057840726,0.0015361403,0.000900128,0.0016922269,0.0007946566,0.0008869612,0.0018692777],"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.00015285308,0.00007576408,0.0011681562,0.00018245741,0.00004392024,0.00014446754,0.0002703373,0.3928315,0.034613904,0.19737017,0.005891716,0.36725467],"study_design_scores_gemma":[0.000049327213,0.0000872646,0.0005999814,0.000042490043,0.000022474758,0.00015768023,0.00012230697,0.7945261,0.0123519795,0.17609985,0.015907498,0.000032953907],"about_ca_topic_score_codex":0.0046920236,"about_ca_topic_score_gemma":0.0068992693,"teacher_disagreement_score":0.007076204,"about_ca_system_score_codex":0.0009688718,"about_ca_system_score_gemma":0.0009703171,"threshold_uncertainty_score":0.023672283},"labels":[],"label_agreement":null},{"id":"W2150118366","doi":"10.1287/ijoc.1060.0190","title":"Efficient Computations for the Discrete GI/G/1 System","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Program for New Century Excellent Talents in University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queue; Computation; Discrete time and continuous time; Computer science; Mathematical optimization; Discrete system; Algorithm; Mathematics; Discrete mathematics; Applied mathematics; Statistics; Computer network","score_opus":0.014892103570001347,"score_gpt":0.26742301415472086,"score_spread":0.2525309105847195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150118366","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.17478043,0.00030037854,0.8132524,0.0008782244,0.00008792389,0.00006867073,0.00028194682,0.0010474506,0.0093026],"genre_scores_gemma":[0.83401185,0.0001560252,0.16200964,0.00011076628,0.000060666553,0.00008769407,0.0003157057,0.00011493248,0.0031327382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.000081459795,0.000013921264,0.000046703273,0.00009633497,0.000114733855],"domain_scores_gemma":[0.99851197,0.0009840659,0.000116086165,0.00014563483,0.00014125509,0.00010102077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979117,0.0005334503,0.00071909773,0.0005864277,0.00066279725,0.0010363824,0.0011153053,0.0007366942,0.0044907928],"category_scores_gemma":[0.0039611035,0.00034393175,0.00039093505,0.000707872,0.0007389988,0.0011667997,0.0011059942,0.0011944387,0.00054641056],"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.000116016185,0.000037398353,0.0011577525,0.00007026156,0.00001725835,0.00016483958,0.00011349546,0.9066408,0.0014198404,0.06677595,0.0016519076,0.021834534],"study_design_scores_gemma":[0.000006155136,0.0000025916424,0.000048504106,0.0000013533463,0.0000011400318,0.000006226764,0.0000064473597,0.9908635,0.00012907626,0.008802363,0.00013077912,0.0000018463383],"about_ca_topic_score_codex":0.00979336,"about_ca_topic_score_gemma":0.010653571,"teacher_disagreement_score":0.00979336,"about_ca_system_score_codex":0.0013033877,"about_ca_system_score_gemma":0.0015011679,"threshold_uncertainty_score":0.019472718},"labels":[],"label_agreement":null},{"id":"W2150336620","doi":"10.1287/ijoc.1040.0127","title":"Integer Linear Programming Models for Global Routing","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Branch and price; Branch and cut; Linear programming; Mathematical optimization; Integer (computer science); Mathematics; Linear programming relaxation; Routing (electronic design automation); Branch and bound; Computer science; Programming language","score_opus":0.016612840833262452,"score_gpt":0.25495493552169163,"score_spread":0.23834209468842918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150336620","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.0012751842,0.0052459603,0.953803,0.0015202609,0.0002676989,0.0001019838,0.00068276795,0.00042829066,0.036674805],"genre_scores_gemma":[0.27049822,0.020534046,0.63474727,0.0017788474,0.001463011,0.002179396,0.0037452602,0.00082981435,0.06422416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869317,0.0006293148,0.000055246084,0.00019646114,0.00028680908,0.00013900577],"domain_scores_gemma":[0.99847454,0.0011060955,0.00013060818,0.000067446854,0.00018362985,0.000037661353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015304339,0.0025763223,0.0012912651,0.00082420994,0.0005285882,0.0026768441,0.0019533369,0.0022653318,0.014447214],"category_scores_gemma":[0.0037186018,0.0007569091,0.0012025572,0.002392655,0.0010172452,0.0021137956,0.0013248704,0.0043691243,0.0042087156],"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.00003830474,0.000072097406,0.0001684112,0.0002908353,0.00004424045,0.00010121409,0.00010183083,0.58504766,0.00030132374,0.35675594,0.017468473,0.03960963],"study_design_scores_gemma":[0.000025815718,0.000024875315,0.000056025754,0.00006925954,0.000013643684,0.00003268645,0.00003937636,0.7581052,0.00011508857,0.21212864,0.02937592,0.000013391333],"about_ca_topic_score_codex":0.006046705,"about_ca_topic_score_gemma":0.0056607807,"teacher_disagreement_score":0.014447214,"about_ca_system_score_codex":0.0020124777,"about_ca_system_score_gemma":0.0020713343,"threshold_uncertainty_score":0.048330724},"labels":[],"label_agreement":null},{"id":"W2151460223","doi":"10.1287/ijoc.1090.0321","title":"Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; National Science Foundation","keywords":"Convexity; Solver; Mathematical optimization; Computer science; Tree (set theory); Nonlinear programming; Optimization problem; Constraint satisfaction problem; Mathematics; Nonlinear system; Artificial intelligence; Combinatorics","score_opus":0.052302519371251174,"score_gpt":0.39954861114794427,"score_spread":0.3472460917766931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151460223","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.03748724,0.00032039295,0.9574556,0.00042856066,0.000027691536,0.000069044916,0.00018429827,0.00027849473,0.0037486306],"genre_scores_gemma":[0.4391779,0.00046789568,0.5560163,0.00015705705,0.00006797558,0.0002537359,0.0006232044,0.00035979497,0.002876063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984701,0.00073198235,0.000071137816,0.0002451818,0.00036389494,0.00011758704],"domain_scores_gemma":[0.9848016,0.011317939,0.0011148907,0.0012610019,0.0010998739,0.00040463125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018302,0.0009982636,0.0009955377,0.0035811686,0.0012845253,0.002585301,0.0012787532,0.0013162331,0.003620051],"category_scores_gemma":[0.019487588,0.0006470343,0.0012001627,0.0029424476,0.002520247,0.0039475737,0.0018811302,0.0020593295,0.000620514],"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.00017606687,0.00013089384,0.007659807,0.0002506254,0.00008726704,0.00040850506,0.00074874563,0.26311785,0.003586691,0.5958985,0.0061122123,0.12182281],"study_design_scores_gemma":[0.00001089034,0.000022472042,0.0006634734,0.00005008219,0.000019077705,0.000106870546,0.00009618564,0.7132318,0.0015193712,0.28199905,0.002259587,0.0000211955],"about_ca_topic_score_codex":0.002760921,"about_ca_topic_score_gemma":0.0036224166,"teacher_disagreement_score":0.003620051,"about_ca_system_score_codex":0.0012506442,"about_ca_system_score_gemma":0.00091745594,"threshold_uncertainty_score":0.012110293},"labels":[],"label_agreement":null},{"id":"W2152972178","doi":"10.1287/ijoc.1120.0514","title":"Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling","year":2012,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Column generation; Scheduling (production processes); Grammar; Mathematical optimization; Context-free grammar; Rule-based machine translation; Artificial intelligence; Mathematics","score_opus":0.061927155787091875,"score_gpt":0.3074853138278305,"score_spread":0.24555815804073863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152972178","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.016721787,0.00015380952,0.97649336,0.00026256466,0.00007499024,0.0002362414,0.00030741974,0.001976067,0.0037737966],"genre_scores_gemma":[0.20326284,0.0002019273,0.7917368,0.00017222183,0.00004674593,0.00041320742,0.0009930324,0.0005007187,0.0026725957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925655,0.00023391924,0.000032928354,0.00014282542,0.0002232122,0.00011054337],"domain_scores_gemma":[0.9983896,0.001041974,0.00008649046,0.00020116309,0.00017315248,0.0001075722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092547876,0.00092099304,0.00094698905,0.00087103236,0.00083077024,0.0010449447,0.0016009726,0.0010616624,0.009538951],"category_scores_gemma":[0.0031837258,0.0005879752,0.0010784437,0.0017790308,0.0007494597,0.0012796011,0.0011107636,0.0017357318,0.0013100791],"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.00009992546,0.00021311514,0.00062182883,0.00014978646,0.000040756528,0.00015864553,0.00010442261,0.78515184,0.004302324,0.027667934,0.009291224,0.17219815],"study_design_scores_gemma":[0.000038366157,0.000035336,0.000098765435,0.0000059665795,0.000011299267,0.0000331553,0.00002957317,0.9759553,0.0016885216,0.019538969,0.0025529794,0.0000116814945],"about_ca_topic_score_codex":0.008113592,"about_ca_topic_score_gemma":0.013064961,"teacher_disagreement_score":0.009538951,"about_ca_system_score_codex":0.0012160091,"about_ca_system_score_gemma":0.00333949,"threshold_uncertainty_score":0.031910956},"labels":[],"label_agreement":null},{"id":"W2157541676","doi":"10.1287/ijoc.1100.0446","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Mathematical optimization; Computer science; Metaheuristic; Branch and bound; Scheduling (production processes); Benchmark (surveying); Constraint logic programming; Mathematics; Stochastic programming","score_opus":0.03676578007654528,"score_gpt":0.25975812623899247,"score_spread":0.22299234616244717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157541676","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.001193368,0.0005657748,0.9920122,0.00027273502,0.00008692389,0.00006606535,0.000113643226,0.00008187788,0.0056073093],"genre_scores_gemma":[0.08253561,0.0024882841,0.90975404,0.00028599976,0.00023876126,0.00035280688,0.00034468493,0.00013825178,0.00386163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795437,0.0007155312,0.00008847136,0.00033015493,0.0007422969,0.00016904737],"domain_scores_gemma":[0.9984976,0.0010190639,0.00009547458,0.000101889425,0.00021386301,0.00007208978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015332564,0.0013338876,0.0012418157,0.001126413,0.00078658096,0.0017779354,0.002379835,0.0011773305,0.004750445],"category_scores_gemma":[0.004358509,0.0006938739,0.0013227252,0.002454772,0.0012459875,0.0017167184,0.0011393169,0.0027730088,0.0006742927],"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.000035804016,0.00007831175,0.00011054433,0.00024463545,0.0000469821,0.00012802448,0.00004817585,0.751153,0.0010516493,0.17451812,0.0035568783,0.069027945],"study_design_scores_gemma":[0.00002892454,0.00004217987,0.00006345053,0.000045195546,0.000025215228,0.00007112346,0.000020781257,0.88938016,0.0008126227,0.09878137,0.010705333,0.000023662746],"about_ca_topic_score_codex":0.0068405666,"about_ca_topic_score_gemma":0.007280212,"teacher_disagreement_score":0.0068405666,"about_ca_system_score_codex":0.0013071365,"about_ca_system_score_gemma":0.0035501602,"threshold_uncertainty_score":0.01589179},"labels":[],"label_agreement":null},{"id":"W2159152015","doi":"10.1287/ijoc.1110.0463","title":"A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Broadcasting (networking); Node (physics); Wireless sensor network; Computer science; Tree (set theory); Wireless; Energy consumption; Wireless network; Branch and cut; Mathematical optimization; Energy (signal processing); Exponential function; Computer network; Mathematics; Algorithm; Integer programming; Telecommunications","score_opus":0.027168394556127684,"score_gpt":0.23032226209390816,"score_spread":0.20315386753778047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159152015","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.005244483,0.00090340327,0.988226,0.0006053328,0.000075550546,0.0002035743,0.00016728054,0.00015391057,0.004420374],"genre_scores_gemma":[0.0912212,0.0015696661,0.90232664,0.00028131212,0.0001724315,0.00068736734,0.00054383115,0.00018109016,0.0030163797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849486,0.00081239187,0.00005429415,0.0001793491,0.00033923847,0.00011986439],"domain_scores_gemma":[0.9976029,0.0019293835,0.00012152216,0.00007764108,0.00018260775,0.00008586269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024458484,0.0018889029,0.0017212353,0.0014990396,0.0010744424,0.0018589735,0.0021477174,0.0022289187,0.0051637297],"category_scores_gemma":[0.0057777176,0.0009301171,0.0011569771,0.003035339,0.0011050486,0.002146646,0.0012451451,0.0029789077,0.00068452547],"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.000088376095,0.00016348284,0.00036168183,0.0003640346,0.000073206844,0.00013133885,0.00011914756,0.85559416,0.00089076615,0.0535161,0.005768886,0.08292876],"study_design_scores_gemma":[0.000045393615,0.000061825405,0.00009028279,0.00004857968,0.000024645202,0.00007496807,0.000053604967,0.94605285,0.0004569723,0.04919908,0.0038813872,0.000010376487],"about_ca_topic_score_codex":0.0042465846,"about_ca_topic_score_gemma":0.004523087,"teacher_disagreement_score":0.0051637297,"about_ca_system_score_codex":0.0016338916,"about_ca_system_score_gemma":0.002311456,"threshold_uncertainty_score":0.01727438},"labels":[],"label_agreement":null},{"id":"W2159266597","doi":"10.1287/ijoc.15.4.412.24889","title":"The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing Problems","year":2003,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Queueing theory; Interval (graph theory); Binary number; Applied mathematics; Matrix (chemical analysis); Markov process; Boundary (topology); Extension (predicate logic); Mathematical optimization; Combinatorics; Computer science; Mathematical analysis; Statistics; Arithmetic; Physics","score_opus":0.04761154075326107,"score_gpt":0.26872835384338367,"score_spread":0.2211168130901226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159266597","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.042380787,0.00021598053,0.9547854,0.00019094748,0.00002794352,0.000038505794,0.00001549878,0.0001773107,0.0021676414],"genre_scores_gemma":[0.631339,0.00045130798,0.36592826,0.00007547193,0.00006410144,0.00016570088,0.00005417795,0.0001019686,0.0018199466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937373,0.0003585183,0.000028149616,0.00005073154,0.00013340154,0.000055476183],"domain_scores_gemma":[0.9945234,0.0046659824,0.00031044532,0.00013251806,0.0002479738,0.000119629025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019586848,0.00080167473,0.00052142923,0.002126034,0.0007716336,0.0010487684,0.00086349226,0.001045594,0.0014926994],"category_scores_gemma":[0.014943625,0.00057174306,0.00055177265,0.00094043615,0.0016429487,0.0020342313,0.00097368285,0.0009132622,0.0002373785],"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.000082033206,0.000093186034,0.0018051041,0.0001264429,0.000038536033,0.00015118925,0.0003381718,0.6550158,0.003584743,0.2964062,0.00079622027,0.04156236],"study_design_scores_gemma":[0.000006760843,0.000012899229,0.00009949967,0.000008689071,0.000002596551,0.000018176348,0.000017323264,0.9543958,0.00045779257,0.04479839,0.00017311232,0.000009029777],"about_ca_topic_score_codex":0.0016215383,"about_ca_topic_score_gemma":0.0013314227,"teacher_disagreement_score":0.002126034,"about_ca_system_score_codex":0.00080062816,"about_ca_system_score_gemma":0.0008297457,"threshold_uncertainty_score":0.010358632},"labels":[],"label_agreement":null},{"id":"W2160558046","doi":"10.1287/ijoc.1100.0443","title":"An Algorithm for Fitting Heavy-Tailed Distributions via Generalized Hyperexponentials","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Log-normal distribution; Weibull distribution; Heavy-tailed distribution; Mathematics; Probability density function; Distribution fitting; Pareto principle; Distribution (mathematics); Generalized Pareto distribution; Monotone polygon; Algorithm; Applied mathematics; Monotonic function; Mathematical optimization; K-distribution; Distribution function; Probability distribution; Function (biology); Lomax distribution; Statistics; Mathematical analysis; Extreme value theory","score_opus":0.1095553153408824,"score_gpt":0.3746015193686009,"score_spread":0.2650462040277185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160558046","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.0011769758,0.000036803212,0.9981548,0.000029129236,0.000012167726,0.000032611002,0.000014389356,0.0004044603,0.00013867392],"genre_scores_gemma":[0.02876541,0.00011375301,0.9694662,0.00008711886,0.000030388062,0.00017003562,0.00014718136,0.00031578206,0.0009040576],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820316,0.00054775964,0.00014464358,0.00032824028,0.00062958186,0.00014646615],"domain_scores_gemma":[0.9938176,0.0032093765,0.0003845497,0.0008209009,0.0015764717,0.00019106778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160193,0.0014594343,0.0012756967,0.0026408401,0.0011325112,0.0018730476,0.003065902,0.0019683235,0.005376323],"category_scores_gemma":[0.016297126,0.0010394829,0.0018404541,0.002200132,0.0009921669,0.0035126484,0.0026553757,0.003512555,0.0033475235],"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.0003106227,0.00019511224,0.0040978333,0.0002696172,0.00015671385,0.00031876419,0.0003983354,0.32532066,0.01153356,0.049268134,0.0050201695,0.6031105],"study_design_scores_gemma":[0.000032796794,0.000035024488,0.000295058,0.000022910835,0.000016952945,0.00020335669,0.00004698246,0.9729769,0.002856795,0.019724282,0.0037518644,0.0000370149],"about_ca_topic_score_codex":0.004351324,"about_ca_topic_score_gemma":0.0035718458,"teacher_disagreement_score":0.005376323,"about_ca_system_score_codex":0.0012281138,"about_ca_system_score_gemma":0.0023255863,"threshold_uncertainty_score":0.022001505},"labels":[],"label_agreement":null},{"id":"W2161012868","doi":"10.1287/ijoc.1090.0346","title":"<b>From the Editor</b>—Special Cluster on High-Throughput Optimization","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Throughput; Computer science; Cluster (spacecraft); Volume (thermodynamics); Computer network; Telecommunications","score_opus":0.011059547167431322,"score_gpt":0.24904338042663587,"score_spread":0.23798383325920455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161012868","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002286446,0.0048626056,0.0022374555,0.12684931,0.85950017,0.000019185758,0.00010903504,0.00017961228,0.006014035],"genre_scores_gemma":[0.0030619362,0.004697363,0.0012573211,0.050761405,0.906199,0.000029961568,0.00009956976,0.00029261605,0.03360081],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976572,0.00042271038,0.00029853894,0.0004331868,0.000995294,0.0001930846],"domain_scores_gemma":[0.9872859,0.0029960321,0.0005832198,0.000578685,0.007240099,0.0013161938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026094874,0.0017730648,0.0023353826,0.0020928693,0.0017929119,0.004364721,0.0021101234,0.0053232247,0.020618316],"category_scores_gemma":[0.012250123,0.00066250894,0.0013804559,0.0013476594,0.0012951073,0.0023275365,0.0007557372,0.009138642,0.015939051],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000044224827,0.000010921928,0.00005972866,0.000061512736,0.000015621608,0.000064383086,0.0000053572116,0.00007713256,0.00016163677,0.00064307265,0.9912504,0.0076061906],"study_design_scores_gemma":[0.000033148754,0.000045632118,0.0005538097,0.00011771626,0.000050779905,0.00037340357,0.000025082605,0.0016168145,0.0009931112,0.0023740942,0.99376935,0.0000469765],"about_ca_topic_score_codex":0.0019624103,"about_ca_topic_score_gemma":0.00572373,"teacher_disagreement_score":0.020618316,"about_ca_system_score_codex":0.0021687422,"about_ca_system_score_gemma":0.0014870578,"threshold_uncertainty_score":0.06897515},"labels":[],"label_agreement":null},{"id":"W2162009963","doi":"10.1287/ijoc.1070.0225","title":"Time-Indexed Formulations and the Total Weighted Tardiness Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tardiness; Column generation; Mathematical optimization; Mathematics; Integer programming; Time horizon; Computer science; Job shop scheduling","score_opus":0.006188593073335101,"score_gpt":0.21915751475273254,"score_spread":0.21296892167939743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162009963","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.007586009,0.00044167237,0.978053,0.00034049916,0.00009627132,0.00009009815,0.0001834986,0.00013417954,0.013074724],"genre_scores_gemma":[0.16445631,0.001616078,0.8118096,0.00023954867,0.00025773182,0.00046569036,0.000808402,0.00027067645,0.020076027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989869,0.0003814421,0.000048493766,0.00012239013,0.0003453751,0.000115460876],"domain_scores_gemma":[0.9991805,0.00041663297,0.00012416525,0.000060669387,0.00016229854,0.00005569768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010495641,0.0012318704,0.0005901932,0.0006758766,0.00047003606,0.0014874189,0.0014513223,0.00079070113,0.0069249277],"category_scores_gemma":[0.0022464306,0.00046275416,0.00078879,0.0013731093,0.0006397515,0.0016662753,0.00073665316,0.0017484657,0.00076401676],"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.00012057787,0.00021614452,0.0001699435,0.0002816471,0.000049473685,0.00024151581,0.00016814661,0.52747965,0.0052859294,0.36863655,0.008109967,0.08924038],"study_design_scores_gemma":[0.000068176276,0.00014303703,0.00012936017,0.00005652454,0.000025840913,0.00014044311,0.000094400886,0.7954707,0.0023716835,0.18645729,0.0150207365,0.000021795997],"about_ca_topic_score_codex":0.002071493,"about_ca_topic_score_gemma":0.0031046474,"teacher_disagreement_score":0.0069249277,"about_ca_system_score_codex":0.0010529762,"about_ca_system_score_gemma":0.0016838498,"threshold_uncertainty_score":0.02316618},"labels":[],"label_agreement":null},{"id":"W2163885069","doi":"10.1287/ijoc.1050.0138","title":"A Discrete Adjoint Variable Method for Printed-Circuit Board Computer-Aided Design","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sensitivity (control systems); Printed circuit board; Discretization; Microstrip; Grid; Variable (mathematics); Antenna (radio); Computer science; Microstrip antenna; Mathematics; Electronic engineering; Topology (electrical circuits); Geometry; Mathematical analysis; Telecommunications; Engineering","score_opus":0.014812254199576574,"score_gpt":0.26359353407756336,"score_spread":0.2487812798779868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163885069","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.0008870699,0.000025563038,0.9982199,0.00002708436,0.000012898318,0.0000112606,0.000011252195,0.00013198332,0.0006729738],"genre_scores_gemma":[0.09185639,0.00008469073,0.9051345,0.00007852387,0.000017306582,0.00021494263,0.00007672711,0.0001438359,0.0023931032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996306,0.0001305451,0.000010430463,0.000033049677,0.00017490533,0.00002036184],"domain_scores_gemma":[0.99952614,0.00028057618,0.00003674365,0.00004580014,0.00009279381,0.000017950908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086644694,0.00051547494,0.00051257416,0.0005335186,0.00028126713,0.0006277532,0.00063339673,0.00079308904,0.0034704942],"category_scores_gemma":[0.0014171927,0.0003854908,0.0005946332,0.00043740927,0.0006679078,0.0004065566,0.00057982,0.0010569355,0.00066999317],"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.000041647723,0.00005053399,0.00028949472,0.00011917711,0.00003135579,0.000045674253,0.000066838846,0.8775586,0.011879777,0.040702753,0.0014444677,0.06776973],"study_design_scores_gemma":[0.000008586634,0.000011662062,0.000024387764,0.000005046705,0.0000023263324,0.000010111123,0.0000037941668,0.99329776,0.0010116656,0.0036479174,0.0019725494,0.0000043589125],"about_ca_topic_score_codex":0.001161426,"about_ca_topic_score_gemma":0.0012701246,"teacher_disagreement_score":0.0034704942,"about_ca_system_score_codex":0.00039595037,"about_ca_system_score_gemma":0.0007418367,"threshold_uncertainty_score":0.011609912},"labels":[],"label_agreement":null},{"id":"W2165859768","doi":"10.1287/ijoc.1110.0488","title":"Assessing the Value of Dynamic Pricing in Network Revenue Management","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dynamic pricing; Mathematical optimization; Revenue management; Computer science; Revenue; Upper and lower bounds; Decomposition; Operations research; Mathematics; Economics; Microeconomics; Finance","score_opus":0.029118759173405916,"score_gpt":0.2606838341522386,"score_spread":0.2315650749788327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165859768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68895864,0.0021222176,0.28764483,0.0022512656,0.00012385934,0.00015026152,0.00021017047,0.00022891202,0.01830987],"genre_scores_gemma":[0.98685,0.00022711998,0.012449452,0.000037350972,0.000024754323,0.000018496861,0.000038715978,0.000016599719,0.00033757635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973144,0.0017218229,0.000049661332,0.000226769,0.000402932,0.0002843808],"domain_scores_gemma":[0.9708637,0.02583023,0.000910508,0.0009990894,0.00073966157,0.0006567885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006745108,0.00084386725,0.0011702897,0.0011605124,0.00082017394,0.0028248604,0.0019715063,0.0016224039,0.0021002355],"category_scores_gemma":[0.034399357,0.0005531294,0.00053088285,0.0016917589,0.0019496536,0.005451604,0.0018961609,0.002129966,0.0001481136],"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.00019542438,0.000095079326,0.0013527237,0.000040795847,0.000024718673,0.00004390652,0.000025890695,0.9642699,0.00024778963,0.022945428,0.00038768677,0.010370733],"study_design_scores_gemma":[0.000013749873,0.000043672637,0.00020499769,0.000006006388,0.0000066921098,0.000012065067,0.00002128136,0.9916466,0.0001365992,0.0077930368,0.000109562985,0.000005834669],"about_ca_topic_score_codex":0.0052017304,"about_ca_topic_score_gemma":0.0029643914,"teacher_disagreement_score":0.006745108,"about_ca_system_score_codex":0.0029369297,"about_ca_system_score_gemma":0.0017891293,"threshold_uncertainty_score":0.03567201},"labels":[],"label_agreement":null},{"id":"W2170296950","doi":"10.1287/ijoc.1040.0128","title":"A Memetic Heuristic for the Generalized Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Heuristic; Memetic algorithm; Assignment problem; Generalized assignment problem; Generalization; Integer programming; Matrix (chemical analysis); Mathematics; Weapon target assignment problem; Computer science; Branch and bound; Linear bottleneck assignment problem; Container (type theory); Linear programming; Quadratic equation; Local search (optimization); Optimization problem; Engineering","score_opus":0.01745726383268033,"score_gpt":0.2652813078728558,"score_spread":0.24782404404017547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170296950","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.03727227,0.00061619945,0.9496542,0.000648129,0.00021168489,0.00022639502,0.00011738512,0.0004999538,0.010753783],"genre_scores_gemma":[0.4883091,0.00048112308,0.50050676,0.0005517213,0.00015959858,0.00072280597,0.00025936775,0.00014074295,0.008868871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994723,0.00025642398,0.000017956036,0.000077010365,0.00009837609,0.00007783748],"domain_scores_gemma":[0.99919516,0.00051833177,0.00008197016,0.000061306404,0.000093599294,0.00004959519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905566,0.0009165267,0.0009324334,0.0010032248,0.0007519786,0.00088519405,0.0016477581,0.0016280597,0.0032797984],"category_scores_gemma":[0.0026036,0.0005699432,0.0007385412,0.0009627963,0.00094980514,0.00091147755,0.00094167166,0.00091780175,0.0004120097],"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.00008979223,0.00007130931,0.00015765567,0.00006831,0.000036988957,0.00010684122,0.000049699756,0.95348734,0.0007899151,0.010709982,0.0023974916,0.03203468],"study_design_scores_gemma":[0.00004654694,0.00004433778,0.00004144363,0.000010149934,0.000008050912,0.00003765846,0.000015363566,0.992301,0.00023259291,0.0058880537,0.00136861,0.000006140262],"about_ca_topic_score_codex":0.0027540186,"about_ca_topic_score_gemma":0.0027522552,"teacher_disagreement_score":0.0032797984,"about_ca_system_score_codex":0.0010792253,"about_ca_system_score_gemma":0.0013469998,"threshold_uncertainty_score":0.010972023},"labels":[],"label_agreement":null},{"id":"W2175971376","doi":"10.1287/ijoc.2015.0654","title":"Achieving Domain Consistency and Counting Solutions for Dispersion Constraints","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Heuristics; Consistency (knowledge bases); Benchmark (surveying); Mathematical optimization; Constraint programming; Constraint satisfaction; Computer science; Constraint satisfaction problem; Local consistency; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type); Heuristic; Mathematics; Algorithm; Stochastic programming; Artificial intelligence","score_opus":0.03486259221766811,"score_gpt":0.2661912026807494,"score_spread":0.2313286104630813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175971376","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.012201626,0.00017563965,0.9834273,0.00040984375,0.00002990412,0.00012856728,0.000099880905,0.0003587165,0.0031685242],"genre_scores_gemma":[0.1290236,0.00024665133,0.86720777,0.00030352751,0.00006643445,0.00035597206,0.00048117494,0.00038190556,0.0019329784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916123,0.0036945443,0.00047939914,0.0012776493,0.0022370003,0.00069905363],"domain_scores_gemma":[0.9726015,0.020890038,0.0013673307,0.0029094152,0.0018339838,0.00039773912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077335294,0.001915651,0.0019493622,0.002685941,0.0016333557,0.0034797469,0.003248033,0.0027741997,0.0050142817],"category_scores_gemma":[0.04982541,0.0010950847,0.0022497408,0.0039293054,0.0022630426,0.0063125393,0.004058387,0.0041705454,0.0009493682],"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.00023701084,0.00033448666,0.0027245528,0.00046633166,0.00014273022,0.00023975,0.0005518677,0.4388511,0.00497769,0.3053537,0.008696307,0.23742448],"study_design_scores_gemma":[0.00007157849,0.00008196378,0.00021728504,0.00008407162,0.0000424647,0.00012411087,0.00018018838,0.7468912,0.004406851,0.2437399,0.0041321064,0.000028289182],"about_ca_topic_score_codex":0.002416467,"about_ca_topic_score_gemma":0.0029232693,"teacher_disagreement_score":0.0077335294,"about_ca_system_score_codex":0.0016047003,"about_ca_system_score_gemma":0.00331261,"threshold_uncertainty_score":0.040899277},"labels":[],"label_agreement":null},{"id":"W2187140470","doi":"10.1287/ijoc.2015.0648","title":"Discrete Optimization with Decision Diagrams","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Binary decision diagram; Solver; Integer programming; Lagrangian relaxation; Mathematical optimization; Satisfiability; Mathematics; Benchmark (surveying); True quantified Boolean formula; Boolean satisfiability problem; Linear programming; Linear programming relaxation; Algorithm; Computer science","score_opus":0.016549421733042496,"score_gpt":0.2819093452471662,"score_spread":0.26535992351412374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187140470","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.002084241,0.00030317644,0.9933587,0.00020292825,0.00003451776,0.000046177578,0.00006888377,0.00020105623,0.0037002761],"genre_scores_gemma":[0.12823458,0.0009196142,0.86657,0.000173203,0.000058048285,0.0003000619,0.00031685748,0.00016645352,0.0032611627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979163,0.00096471055,0.00011565921,0.00029118624,0.0005669259,0.00014523139],"domain_scores_gemma":[0.9974975,0.0019305537,0.00012337646,0.00019534574,0.00017552011,0.00007767539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023311656,0.0012901556,0.0009211637,0.0009378439,0.0005125495,0.0022337555,0.0011808224,0.0011538683,0.0053298036],"category_scores_gemma":[0.0069376696,0.00078076095,0.0014099838,0.0013767285,0.0015128289,0.0018835596,0.001713731,0.002435977,0.0009597537],"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.00006806472,0.000047499798,0.00031697002,0.00025493873,0.000042285003,0.000046913472,0.00007046738,0.59777874,0.0011050709,0.33543763,0.0020226622,0.06280869],"study_design_scores_gemma":[0.000043990964,0.000031117816,0.000040557385,0.000041111296,0.000013347086,0.000021041255,0.000012589901,0.7817537,0.00093246845,0.20695315,0.010146441,0.000010518113],"about_ca_topic_score_codex":0.0031882082,"about_ca_topic_score_gemma":0.0033228558,"teacher_disagreement_score":0.0053298036,"about_ca_system_score_codex":0.0016726229,"about_ca_system_score_gemma":0.002404502,"threshold_uncertainty_score":0.017830014},"labels":[],"label_agreement":null},{"id":"W2188576392","doi":"10.1287/ijoc.2015.0649","title":"Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Quadratic equation; Algorithm; Branch and cut; Heuristic; Routing (electronic design automation); Mathematical optimization; Metaheuristic; Computer science; Mathematics; Integer programming","score_opus":0.028336016636880533,"score_gpt":0.2709757504084353,"score_spread":0.24263973377155476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188576392","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.009510393,0.001141947,0.979506,0.00035911927,0.00008617358,0.00010859526,0.0001358662,0.00036410397,0.008787732],"genre_scores_gemma":[0.21880648,0.0012842367,0.77343035,0.00021455402,0.00012387511,0.00041373316,0.00053250615,0.00019312027,0.0050010616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988675,0.00040956054,0.000051292493,0.00018763552,0.000318901,0.00016509659],"domain_scores_gemma":[0.9973157,0.0019494123,0.0001928667,0.00020642107,0.0002665363,0.00006911431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016112078,0.0014678703,0.00092025223,0.0010799515,0.00078460685,0.0016427869,0.0019506011,0.0016789592,0.0059258537],"category_scores_gemma":[0.0058636065,0.00078638387,0.0008523831,0.002810637,0.0008972064,0.0017450368,0.0011917889,0.0020988379,0.00083799945],"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.000047497888,0.00009763144,0.00021047141,0.00013806502,0.000023353909,0.000030687657,0.000058451653,0.90492094,0.0003101008,0.03592358,0.002366579,0.05587261],"study_design_scores_gemma":[0.000023433719,0.000020301188,0.000054035612,0.00001354992,0.000006693836,0.00001585077,0.000025574931,0.97518426,0.00016724509,0.023068704,0.0014150238,0.000005309065],"about_ca_topic_score_codex":0.0067305723,"about_ca_topic_score_gemma":0.00846839,"teacher_disagreement_score":0.0067305723,"about_ca_system_score_codex":0.0019713168,"about_ca_system_score_gemma":0.0024330101,"threshold_uncertainty_score":0.019823968},"labels":[],"label_agreement":null},{"id":"W2195470006","doi":"10.1287/ijoc.2015.0656","title":"Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Simplex; Identification (biology); Computer science; Linear programming; Simplex algorithm; Set (abstract data type); Mathematics; Algorithm","score_opus":0.052930139662826864,"score_gpt":0.42609743697313057,"score_spread":0.37316729731030374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195470006","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.019713309,0.0005120345,0.9679806,0.00042528514,0.00011018855,0.00014614912,0.0002091827,0.00060141284,0.0103018135],"genre_scores_gemma":[0.20928876,0.0005914625,0.78504986,0.00023629995,0.00012759006,0.00052252086,0.00062230875,0.0005707876,0.002990351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937589,0.0029124569,0.00024479997,0.0009612918,0.001808526,0.00031414573],"domain_scores_gemma":[0.9891349,0.005439186,0.0005754589,0.0034702264,0.001186909,0.00019332861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008408146,0.0015664032,0.0020758703,0.001570475,0.0010156464,0.0038122078,0.003089031,0.0019198514,0.010478525],"category_scores_gemma":[0.030117285,0.00067338784,0.0015002618,0.002505413,0.0033547366,0.0056503466,0.0036092815,0.00540244,0.0012808272],"study_design_candidate":"simulation_or_modeling","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.00045104657,0.0002692887,0.0015496665,0.0006587125,0.00013050028,0.00014265941,0.00023436529,0.42359096,0.005594223,0.45983863,0.0041350317,0.10340509],"study_design_scores_gemma":[0.00006643296,0.0002825743,0.00046291403,0.00006339882,0.00002941668,0.00012114014,0.000087479515,0.8282988,0.00457536,0.15929176,0.0066869096,0.00003376797],"about_ca_topic_score_codex":0.0013045912,"about_ca_topic_score_gemma":0.00096043065,"teacher_disagreement_score":0.010478525,"about_ca_system_score_codex":0.0014279846,"about_ca_system_score_gemma":0.0020242138,"threshold_uncertainty_score":0.044467032},"labels":[],"label_agreement":null},{"id":"W2255734301","doi":"10.1287/ijoc.2015.0666","title":"Decomposition Methods for the Parallel Machine Scheduling Problem with Setups","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Solver; Mathematical optimization; Computer science; Travelling salesman problem; Scheduling (production processes); Metaheuristic; Decomposition; Benders' decomposition; Integer programming; Branch and bound; Algorithm; Mathematics; Routing (electronic design automation)","score_opus":0.015181017383475675,"score_gpt":0.3035211131566281,"score_spread":0.28834009577315245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255734301","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.0067320457,0.00035935585,0.98980206,0.00014660445,0.000043670083,0.00006546503,0.000057563753,0.00014471471,0.0026485655],"genre_scores_gemma":[0.19958414,0.00094750867,0.794213,0.00014901493,0.00013056597,0.00037540423,0.00039542286,0.0002905082,0.003914397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989286,0.00051721174,0.000041027306,0.00012774247,0.0002478469,0.00013755597],"domain_scores_gemma":[0.99818283,0.0013894992,0.00013726071,0.000097692035,0.00012171555,0.00007092351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021627098,0.0016302158,0.00111452,0.0012667599,0.0005608353,0.0009939228,0.0010678067,0.0011043146,0.004566712],"category_scores_gemma":[0.0050915848,0.00077652343,0.0017608686,0.0013496322,0.0008229512,0.0013756637,0.0013159178,0.0019936431,0.000646715],"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.000069768605,0.00008119724,0.00026081354,0.00016942142,0.000049204576,0.000051191368,0.000056268094,0.9272266,0.0014214537,0.02821457,0.0013158018,0.041083626],"study_design_scores_gemma":[0.000019599736,0.000024422456,0.00005318587,0.000014117281,0.00000836809,0.000016229222,0.000011320999,0.9804217,0.0002750127,0.018324314,0.00082735973,0.000004378563],"about_ca_topic_score_codex":0.002946181,"about_ca_topic_score_gemma":0.0025812185,"teacher_disagreement_score":0.004566712,"about_ca_system_score_codex":0.00096087507,"about_ca_system_score_gemma":0.0014966968,"threshold_uncertainty_score":0.015277147},"labels":[],"label_agreement":null},{"id":"W2267848830","doi":"10.1287/ijoc.2015.0668","title":"An AO<sup>*</sup> Based Exact Algorithm for the Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Vertex (graph theory); Computer science; Pruning; Mathematical optimization; Algorithm; Markov decision process; Vertex cover; Graph; Graph traversal; Time complexity; Markov process; Theoretical computer science; Mathematics","score_opus":0.025870594288043298,"score_gpt":0.2749130858102049,"score_spread":0.2490424915221616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267848830","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.05225732,0.00047988733,0.8978487,0.002613666,0.0002464923,0.00078708684,0.001797959,0.0054065282,0.03856234],"genre_scores_gemma":[0.24579512,0.00021798069,0.73828804,0.00056628475,0.00007037862,0.0003847366,0.0023025721,0.0005320362,0.011842836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991947,0.000092140566,0.000036715322,0.00018565715,0.00023031003,0.00026047198],"domain_scores_gemma":[0.99878305,0.00057056284,0.000113197,0.00017381016,0.00024399633,0.000115429495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295439,0.0010173363,0.0008591269,0.0008523863,0.0010408801,0.0012689818,0.0020515868,0.0011916142,0.011907366],"category_scores_gemma":[0.0039892723,0.00051672646,0.000857276,0.0017005387,0.00082637375,0.0015727122,0.0017292809,0.0015045152,0.0013349099],"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.00046361508,0.00029794298,0.00227559,0.00022894451,0.00005811657,0.00014129514,0.00013328056,0.4911267,0.0023575528,0.059565593,0.04732005,0.3960313],"study_design_scores_gemma":[0.0001066682,0.000043268225,0.00035588568,0.00001840947,0.00001753529,0.00004750639,0.00006211597,0.9661194,0.00092084537,0.026217727,0.0060766786,0.000013955083],"about_ca_topic_score_codex":0.16562338,"about_ca_topic_score_gemma":0.23467684,"teacher_disagreement_score":0.16562338,"about_ca_system_score_codex":0.003582331,"about_ca_system_score_gemma":0.013902706,"threshold_uncertainty_score":0.32931864},"labels":[],"label_agreement":null},{"id":"W2270320935","doi":"10.1287/ijoc.2015.0671","title":"Robust Critical Node Selection by Benders Decomposition","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":19,"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":"Robust optimization; Mathematical optimization; Benders' decomposition; Selection (genetic algorithm); Oracle; Node (physics); Computer science; Robustness (evolution); Set (abstract data type); Optimization problem; Cutting-plane method; Mathematics; Integer programming; Artificial intelligence","score_opus":0.14663306970124196,"score_gpt":0.4327073187144121,"score_spread":0.28607424901317013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270320935","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.012599956,0.00028792195,0.98348075,0.00014234209,0.000033610435,0.0001734524,0.00016801663,0.00017539562,0.0029385972],"genre_scores_gemma":[0.4066407,0.00076743064,0.5855449,0.00019052371,0.00008181392,0.0007971957,0.00092654506,0.00024433836,0.0048065865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860066,0.0006275698,0.000065015745,0.0002464421,0.0003017339,0.00015859096],"domain_scores_gemma":[0.998447,0.0010051786,0.00020451876,0.00007838648,0.00019026626,0.00007464483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002706,0.0020986032,0.0018508249,0.0020191646,0.00069208187,0.0015034612,0.0011145943,0.0013733213,0.005159635],"category_scores_gemma":[0.0044046124,0.00092062674,0.0016951486,0.0015932886,0.000846855,0.0016377588,0.0014432969,0.0016184312,0.0006277592],"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.00006236467,0.00003198996,0.00027688764,0.000078004916,0.000038745082,0.00007062349,0.000036075355,0.96301746,0.0009325431,0.012411997,0.0012263643,0.021816846],"study_design_scores_gemma":[0.00001776504,0.000042335356,0.00007913971,0.000015902458,0.000013609359,0.000029624598,0.000025148736,0.98046297,0.00044262284,0.017946694,0.0009155859,0.0000086251475],"about_ca_topic_score_codex":0.003372964,"about_ca_topic_score_gemma":0.0025921243,"teacher_disagreement_score":0.005159635,"about_ca_system_score_codex":0.0012697502,"about_ca_system_score_gemma":0.0018516645,"threshold_uncertainty_score":0.01726073},"labels":[],"label_agreement":null},{"id":"W2289296210","doi":"10.1287/ijoc.2015.0664","title":"Modeling with Metaconstraints and Semantic Typing of Variables","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Computer science; Exploit; Solver; Computation; Predicate (mathematical logic); Theoretical computer science; Variety (cybernetics); Algorithm; Artificial intelligence; Programming language","score_opus":0.014666814800067459,"score_gpt":0.2303182043340496,"score_spread":0.21565138953398214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289296210","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.0057284883,0.00014842217,0.9902412,0.00044724697,0.000048802183,0.00006246974,0.000115628456,0.00047023303,0.002737343],"genre_scores_gemma":[0.17281896,0.00049446797,0.81947064,0.0003291816,0.00008907644,0.00042399977,0.00039190368,0.0004336448,0.005548081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944511,0.002518497,0.000600718,0.00088844995,0.0011469055,0.0003943097],"domain_scores_gemma":[0.99133474,0.0037857555,0.0007646036,0.0031665352,0.00069171435,0.00025672832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071471087,0.0011624033,0.0008366167,0.0015574672,0.0014808944,0.005059264,0.0048056985,0.0022761782,0.0028474783],"category_scores_gemma":[0.01105215,0.00129911,0.0027330988,0.002474881,0.0050789453,0.010661832,0.0046399143,0.0035933706,0.0007172792],"study_design_candidate":"simulation_or_modeling","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.00005410189,0.000035829522,0.0007834829,0.00009996735,0.000030780706,0.00021071256,0.0007814163,0.059551843,0.0010480846,0.92049307,0.0009346645,0.015976049],"study_design_scores_gemma":[0.00003900733,0.000056187593,0.00015573988,0.00009887682,0.00006823415,0.00019474357,0.00026484643,0.31648642,0.0048728907,0.6334403,0.04427437,0.000048397855],"about_ca_topic_score_codex":0.0062527386,"about_ca_topic_score_gemma":0.0071375463,"teacher_disagreement_score":0.0071471087,"about_ca_system_score_codex":0.0017383702,"about_ca_system_score_gemma":0.0030099426,"threshold_uncertainty_score":0.037797928},"labels":[],"label_agreement":null},{"id":"W2311828527","doi":"10.1287/ijoc.2016.0744","title":"New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Enumeration; Routing (electronic design automation); Node (physics); Relaxation (psychology); State (computer science); Mathematics; Variable (mathematics); Computer science; Arc (geometry); Mathematical optimization; Algorithm; Combinatorics; Computer network; Engineering","score_opus":0.01893947499540653,"score_gpt":0.2695841109089779,"score_spread":0.25064463591357133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311828527","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.009632024,0.0004575521,0.97854155,0.00036447935,0.00014732603,0.00017588364,0.00023399021,0.00086939987,0.0095777055],"genre_scores_gemma":[0.08908887,0.00060995395,0.9051247,0.00020545162,0.0001923949,0.00028255043,0.00051210256,0.0003244598,0.003659532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814343,0.00038384006,0.000099657,0.0003242937,0.0008392349,0.00020952738],"domain_scores_gemma":[0.99753237,0.0011034901,0.00020826812,0.000623082,0.0004390703,0.000093764895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013398553,0.0014414033,0.00094923837,0.0011581767,0.0005486667,0.0015066249,0.0024723704,0.0009430121,0.007119032],"category_scores_gemma":[0.0078112604,0.000723348,0.0012642648,0.002020245,0.00086155924,0.0036321834,0.0018935953,0.0050123744,0.0017791383],"study_design_candidate":"simulation_or_modeling","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.00045347054,0.000496976,0.00087881496,0.00042257848,0.00007234586,0.0002069821,0.00018776026,0.3764988,0.022111006,0.15906338,0.012587281,0.42702064],"study_design_scores_gemma":[0.00007174067,0.00014302143,0.00032497724,0.000051515806,0.00003716154,0.00012770291,0.000035619356,0.93568563,0.007392079,0.03833306,0.017768154,0.000029242567],"about_ca_topic_score_codex":0.005046547,"about_ca_topic_score_gemma":0.0064825793,"teacher_disagreement_score":0.007119032,"about_ca_system_score_codex":0.0011479291,"about_ca_system_score_gemma":0.0023648266,"threshold_uncertainty_score":0.023815513},"labels":[],"label_agreement":null},{"id":"W2325136417","doi":"10.1287/ijoc.2015.0683","title":"Branch-and-Price for Personalized Multiactivity Tour Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Computer science; Time horizon; Mathematical optimization; Shortest path problem; Upper and lower bounds; Context (archaeology); Path (computing); Mathematics; Theoretical computer science; Graph","score_opus":0.11864144798097395,"score_gpt":0.39393687763682905,"score_spread":0.2752954296558551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325136417","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.024465492,0.0007912058,0.96412516,0.0005848135,0.000121341014,0.0002962611,0.00021264412,0.00086480496,0.008538282],"genre_scores_gemma":[0.31695172,0.0007468643,0.6726955,0.00029395818,0.00015674831,0.0006889616,0.00077146967,0.0005286675,0.0071660858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985676,0.00067574537,0.000054221935,0.00018388355,0.0002761401,0.00024248265],"domain_scores_gemma":[0.99696594,0.002385981,0.00015873411,0.00015753355,0.0001359023,0.00019586249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030167818,0.0016113934,0.0023425003,0.0013533939,0.0011457267,0.0017176184,0.0022104976,0.0021701728,0.012427875],"category_scores_gemma":[0.00471035,0.0010347965,0.0013768118,0.002465797,0.0009938404,0.0025824155,0.001441509,0.0029740427,0.0013401143],"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.00014271354,0.00017308586,0.0003738179,0.00015138903,0.000053666412,0.000081938255,0.000079691476,0.906763,0.00056170917,0.02801907,0.0036370342,0.059962884],"study_design_scores_gemma":[0.00003140036,0.00004492436,0.00005635847,0.000008730331,0.0000094526395,0.000015537798,0.000016045105,0.98106164,0.0001605006,0.017421477,0.0011680693,0.0000058390733],"about_ca_topic_score_codex":0.007543253,"about_ca_topic_score_gemma":0.008522831,"teacher_disagreement_score":0.012427875,"about_ca_system_score_codex":0.0022405195,"about_ca_system_score_gemma":0.0032034228,"threshold_uncertainty_score":0.041575372},"labels":[],"label_agreement":null},{"id":"W2348420909","doi":"10.1287/ijoc.2015.0686","title":"A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Scheduling (production processes); Computer science; Time horizon; Constraint programming; Knapsack problem; Mathematics; Stochastic programming","score_opus":0.07313580517315778,"score_gpt":0.3924170696532212,"score_spread":0.31928126448006344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348420909","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.0017001868,0.00013849359,0.99611086,0.00014527007,0.00003112181,0.000099117366,0.00007299929,0.0002012886,0.0015005863],"genre_scores_gemma":[0.04474505,0.00027614887,0.952602,0.00010641422,0.000049903792,0.00040233144,0.00027030168,0.00016753942,0.0013802652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.0003848157,0.000055303724,0.00020210267,0.00038442542,0.00016171823],"domain_scores_gemma":[0.9980586,0.0014172215,0.00012546557,0.00007315013,0.00023326701,0.000092134695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015591905,0.0019402131,0.0018892932,0.001576215,0.0010513669,0.0016902665,0.0022151638,0.0018974032,0.007400488],"category_scores_gemma":[0.004227599,0.0013139053,0.0013538264,0.0029653625,0.0007585056,0.0018067318,0.0014367384,0.0030191734,0.000991682],"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.00006823913,0.00012060204,0.00018604647,0.00013485846,0.00004215107,0.00006597767,0.00003665629,0.897911,0.00080692687,0.0133864265,0.003730023,0.08351108],"study_design_scores_gemma":[0.000017947916,0.000020303352,0.000028970268,0.000007440876,0.0000069604143,0.000016944894,0.0000069804964,0.9934122,0.00023957547,0.0054574492,0.00077996746,0.000005221389],"about_ca_topic_score_codex":0.013621611,"about_ca_topic_score_gemma":0.011676913,"teacher_disagreement_score":0.013621611,"about_ca_system_score_codex":0.0019504005,"about_ca_system_score_gemma":0.0037548412,"threshold_uncertainty_score":0.027084649},"labels":[],"label_agreement":null},{"id":"W2515696021","doi":"10.1287/ijoc.2016.0706","title":"The Surgical Patient Routing Problem: A Central Planner Approach","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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":"University of Pittsburgh; U.S. Department of Veterans Affairs; VA Pittsburgh Healthcare System; Office of Research and Development; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Planner; Computer science; Integer programming; Solver; Scheduling (production processes); Vehicle routing problem; Health care; Routing (electronic design automation); Operations research; Mathematical optimization; Artificial intelligence; Computer network; Algorithm","score_opus":0.012822173578996073,"score_gpt":0.23385218253269335,"score_spread":0.2210300089536973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515696021","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.02756589,0.0009978266,0.94012314,0.0034620008,0.00016618507,0.00063464383,0.0008217281,0.00052205625,0.025706492],"genre_scores_gemma":[0.49473706,0.0013507761,0.48001084,0.00076102413,0.000247841,0.0011904369,0.0010247009,0.00027191816,0.020405479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989003,0.0005280353,0.000033341963,0.00023013505,0.00014371696,0.0001644588],"domain_scores_gemma":[0.9982279,0.0011607467,0.00016112675,0.00007243537,0.00019076263,0.00018704848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027334276,0.0014536115,0.0013971525,0.0012829279,0.0009869115,0.0029446098,0.0028390207,0.0026389458,0.016510189],"category_scores_gemma":[0.004361177,0.0012925176,0.0011247783,0.002023191,0.001229574,0.002624507,0.0024561933,0.00228395,0.0009309585],"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.000109914195,0.0001131619,0.00036401965,0.000109323955,0.00004197093,0.00012339838,0.00006313659,0.94576657,0.00026165723,0.03209604,0.003575032,0.017375816],"study_design_scores_gemma":[0.000062617386,0.000041060193,0.000091691676,0.000015807123,0.000017839398,0.00003282889,0.00008054875,0.97490036,0.00016227872,0.02202549,0.0025588623,0.0000105563295],"about_ca_topic_score_codex":0.009603232,"about_ca_topic_score_gemma":0.012200999,"teacher_disagreement_score":0.016510189,"about_ca_system_score_codex":0.002819356,"about_ca_system_score_gemma":0.0059930366,"threshold_uncertainty_score":0.055232108},"labels":[],"label_agreement":null},{"id":"W2564296586","doi":"10.1287/ijoc.2016.0717","title":"Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Benders' decomposition; Mathematical optimization; Integer programming; Mathematics; Integer (computer science); Stochastic programming; Branch and cut; Linear programming relaxation; Relaxation (psychology); Variable (mathematics); Space (punctuation); Computer science","score_opus":0.06866419041123342,"score_gpt":0.35013955302237865,"score_spread":0.28147536261114525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564296586","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.006589468,0.00020900334,0.9901162,0.00018187433,0.00002757943,0.00006010926,0.00008772259,0.00011618518,0.0026118779],"genre_scores_gemma":[0.1435939,0.0007755781,0.84847426,0.0003034334,0.00013572522,0.00045225737,0.0005506571,0.0002753774,0.0054387497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967663,0.001748962,0.00013984826,0.00040371955,0.00065786374,0.00028330254],"domain_scores_gemma":[0.992767,0.00547663,0.0006301981,0.00037465803,0.00047983747,0.0002717369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006820685,0.0027595705,0.0018290788,0.0017215024,0.0006069283,0.0024023708,0.0015527968,0.0019250124,0.00683135],"category_scores_gemma":[0.015470001,0.0014657108,0.0020209036,0.0019774504,0.0017306168,0.0029481845,0.0023477112,0.005575963,0.0009227919],"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.00012189282,0.00007722853,0.00026508258,0.00016315246,0.00006686186,0.00007841672,0.00010536879,0.8382759,0.0014347542,0.1280931,0.0016191221,0.029699147],"study_design_scores_gemma":[0.000031651227,0.00006461556,0.00008823784,0.000049450042,0.000016100843,0.000026085914,0.000021364354,0.9042965,0.0008676374,0.092606924,0.0019189495,0.000012491618],"about_ca_topic_score_codex":0.0019357143,"about_ca_topic_score_gemma":0.002461967,"teacher_disagreement_score":0.00683135,"about_ca_system_score_codex":0.0020317265,"about_ca_system_score_gemma":0.002081557,"threshold_uncertainty_score":0.0360716},"labels":[],"label_agreement":null},{"id":"W2565839211","doi":"10.1287/ijoc.2016.0720","title":"Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s)","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Markov chain; Queueing theory; Bulk queue; Computer science; Mathematical optimization; Queue; Markov process; Applied mathematics; Mathematics; Statistics; Computer network","score_opus":0.014795973728286603,"score_gpt":0.24730424359293712,"score_spread":0.2325082698646505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565839211","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.16242819,0.00043347926,0.8264018,0.00074956985,0.000064528314,0.00010970933,0.00029919113,0.000577019,0.008936513],"genre_scores_gemma":[0.8709466,0.00027985292,0.12511376,0.00008656121,0.000073260366,0.00023160076,0.0004356086,0.0001242963,0.0027084323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00015746796,0.0000200103,0.00006819953,0.00011273902,0.00011247312],"domain_scores_gemma":[0.9954703,0.0038121913,0.00017587094,0.00013602182,0.0003082636,0.000097390424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015284022,0.0006233333,0.0010686106,0.0008520546,0.0008551866,0.0012891109,0.0011813055,0.0007507152,0.0052834814],"category_scores_gemma":[0.0067893337,0.00041933477,0.0007864183,0.00069730176,0.00080884626,0.0014778599,0.0008155727,0.0011864908,0.00043641133],"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.000054108452,0.000048785067,0.0008650478,0.00005237404,0.00001591549,0.000055978835,0.000043051477,0.9652834,0.00050280255,0.023379585,0.0004442374,0.0092548095],"study_design_scores_gemma":[0.0000021521078,0.000002730891,0.00003919519,0.0000012434757,0.0000010352035,0.0000022119248,0.0000039991637,0.99780995,0.000059036745,0.0020517374,0.000025703119,9.618867e-7],"about_ca_topic_score_codex":0.01099885,"about_ca_topic_score_gemma":0.009171858,"teacher_disagreement_score":0.01099885,"about_ca_system_score_codex":0.0018747984,"about_ca_system_score_gemma":0.00308351,"threshold_uncertainty_score":0.02186966},"labels":[],"label_agreement":null},{"id":"W2570103531","doi":"","title":"How significant are the known collision and element distinctness quantum algorithms","year":2003,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Collision; Element (criminal law); Algorithm; Quantum; Computer science; Quantum algorithm; Mathematics; Physics; Quantum mechanics; Programming language; Political science","score_opus":0.015044609118566062,"score_gpt":0.2394091873235028,"score_spread":0.22436457820493674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570103531","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.31952354,0.012902271,0.52190024,0.059888605,0.002642159,0.00015487078,0.0004964988,0.0005692821,0.081922546],"genre_scores_gemma":[0.9622505,0.0022433144,0.024243917,0.0014910391,0.0012448009,0.000060362236,0.00011383009,0.00015697889,0.008195286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993378,0.0028164727,0.00018920124,0.0009686331,0.0020715257,0.0005761324],"domain_scores_gemma":[0.9201443,0.06294857,0.0031135203,0.009076024,0.0029182127,0.0017993663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0082484735,0.0005367786,0.0016960776,0.0013308814,0.0028295466,0.0054933266,0.0032924272,0.004283082,0.014138676],"category_scores_gemma":[0.07797896,0.00076316966,0.0009577821,0.0017940857,0.010683839,0.029368063,0.0050068363,0.008020427,0.0013319858],"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.00024883068,0.00005066823,0.001366784,0.000111412664,0.000049692673,0.00003464142,0.00016594976,0.0070446073,0.0004248375,0.97281116,0.0017481981,0.015943263],"study_design_scores_gemma":[0.00004342,0.00003897173,0.00041551198,0.000023931605,0.000023807088,0.00008877232,0.00011939574,0.017329834,0.00081212836,0.9791068,0.0019729948,0.000024403544],"about_ca_topic_score_codex":0.0007728688,"about_ca_topic_score_gemma":0.0006565258,"teacher_disagreement_score":0.014138676,"about_ca_system_score_codex":0.0019181726,"about_ca_system_score_gemma":0.002632266,"threshold_uncertainty_score":0.04729855},"labels":[],"label_agreement":null},{"id":"W2579916312","doi":"10.1287/ijoc.2017.0746","title":"Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Lagrangian relaxation; Column generation; Sizing; Heuristic; Computer science; Selection (genetic algorithm); Mathematics; Machine learning","score_opus":0.022874710092888276,"score_gpt":0.306114812320784,"score_spread":0.28324010222789575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579916312","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.016164955,0.00026510813,0.97976905,0.00013266831,0.000029731458,0.00013212198,0.00002935701,0.0001489948,0.0033280815],"genre_scores_gemma":[0.35193485,0.0005329143,0.6404723,0.00018615683,0.00009995074,0.0004910621,0.00018956068,0.00013416316,0.005959104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00017762426,0.0000139818785,0.000054116055,0.00015345674,0.000049610644],"domain_scores_gemma":[0.99885,0.00085847016,0.00007639714,0.000046675967,0.00011308104,0.000055330744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841993,0.0007611999,0.0008236035,0.000856724,0.00044747794,0.00058649114,0.001255964,0.00072252273,0.003795061],"category_scores_gemma":[0.0025890048,0.0004204247,0.0007343831,0.00087788014,0.0006994531,0.0007954483,0.00085723144,0.000877945,0.00045381943],"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.00014132,0.000080831305,0.00051799347,0.00017836023,0.00004896247,0.000170429,0.00010634614,0.86682475,0.004121658,0.030452436,0.002269039,0.095087804],"study_design_scores_gemma":[0.000025538046,0.00006204115,0.000086019856,0.000009095881,0.000008513034,0.0000292944,0.000010479033,0.9928001,0.0005512699,0.0054536737,0.000959405,0.0000046791542],"about_ca_topic_score_codex":0.0019562496,"about_ca_topic_score_gemma":0.0026012855,"teacher_disagreement_score":0.003795061,"about_ca_system_score_codex":0.0006730215,"about_ca_system_score_gemma":0.0013719224,"threshold_uncertainty_score":0.01269573},"labels":[],"label_agreement":null},{"id":"W2582617327","doi":"10.1287/ijoc.2018.0817","title":"A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Production (economics); Decomposition; Routing (electronic design automation); Computer science; Business; Economics; Microeconomics; Chemistry; Computer network","score_opus":0.011765655494149048,"score_gpt":0.24953612547602821,"score_spread":0.23777046998187917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582617327","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.0010774644,0.00012753421,0.9946254,0.0001284384,0.000044553035,0.000054754415,0.000104961124,0.00022121318,0.003615805],"genre_scores_gemma":[0.029558858,0.0003699605,0.96538794,0.0001711686,0.00008800003,0.0003304163,0.00037802785,0.0002200193,0.0034955845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921966,0.00022676497,0.000047187812,0.00015727874,0.00025785045,0.00009127022],"domain_scores_gemma":[0.99940705,0.00027603246,0.000054020184,0.00010727614,0.000117667296,0.000038006387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014152607,0.0020118735,0.0010506716,0.0014014188,0.00074679684,0.0021264388,0.0020710712,0.0014367522,0.007934953],"category_scores_gemma":[0.0026309018,0.0007908134,0.0026774907,0.0014743424,0.0009012771,0.0018793939,0.0021294511,0.0032037974,0.0025013958],"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.0000625371,0.00011688362,0.00038155046,0.00029754514,0.00005669608,0.00012729786,0.0001185818,0.70477116,0.004301887,0.1695557,0.009747898,0.11046225],"study_design_scores_gemma":[0.00002367244,0.000037472233,0.00006773571,0.000033743458,0.000015329855,0.00006271786,0.000020838821,0.9496552,0.0009910323,0.038873143,0.010205806,0.000013367418],"about_ca_topic_score_codex":0.003982306,"about_ca_topic_score_gemma":0.005122611,"teacher_disagreement_score":0.007934953,"about_ca_system_score_codex":0.0021119295,"about_ca_system_score_gemma":0.0026788204,"threshold_uncertainty_score":0.026545107},"labels":[],"label_agreement":null},{"id":"W2612103136","doi":"10.1287/ijoc.2016.0738","title":"Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Subgradient method; Heuristics; Lagrangian relaxation; Mathematical optimization; Facility location problem; Modular design; Integer programming; Computer science; Scale (ratio); Mathematics","score_opus":0.02289423356633755,"score_gpt":0.2544070205952862,"score_spread":0.23151278702894865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612103136","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.036956865,0.00043084694,0.95530677,0.00034099462,0.000047558216,0.0002071805,0.0003126045,0.00066669687,0.0057304897],"genre_scores_gemma":[0.4215814,0.00039788274,0.57386583,0.00019937965,0.0000615523,0.00043812706,0.00065547554,0.00028893078,0.0025113625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899286,0.0005167527,0.000029688183,0.00012157571,0.00014966437,0.00018943941],"domain_scores_gemma":[0.99729973,0.0018714487,0.00036423802,0.00018676269,0.00014120086,0.00013658612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022919953,0.0012198619,0.0012087288,0.0012183406,0.00058187614,0.0011358514,0.0019357566,0.0010937961,0.0041219555],"category_scores_gemma":[0.0040358594,0.00094889296,0.0011422738,0.0019028988,0.00092306314,0.0014208333,0.0015822749,0.0014431044,0.0004985969],"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.000027504462,0.00003437438,0.00013444017,0.000054521977,0.000017033992,0.00005162362,0.00002275534,0.98313725,0.00025448087,0.0072910446,0.0011990662,0.0077758166],"study_design_scores_gemma":[0.000031370957,0.000022297292,0.00006012758,0.000009922891,0.000007674531,0.0000126665645,0.000019398049,0.9930282,0.00018951828,0.005924283,0.0006896015,0.000004877643],"about_ca_topic_score_codex":0.0063018613,"about_ca_topic_score_gemma":0.009210793,"teacher_disagreement_score":0.0063018613,"about_ca_system_score_codex":0.0018107685,"about_ca_system_score_gemma":0.0021266292,"threshold_uncertainty_score":0.013789356},"labels":[],"label_agreement":null},{"id":"W2734889840","doi":"10.1287/ijoc.2017.0747","title":"Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Branch and cut; Pruning; Branch and bound; Heuristic; Mathematics; Linear programming relaxation; Integer programming; Steiner tree problem; Linear programming; Routing (electronic design automation); Upper and lower bounds; Function (biology); Integer (computer science); Key (lock); Vehicle routing problem; Dual (grammatical number); Computer science","score_opus":0.02471797659407317,"score_gpt":0.2872649552065073,"score_spread":0.26254697861243415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734889840","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.0025774394,0.0012897869,0.9776618,0.00083006744,0.00018225625,0.00007966956,0.00017515714,0.0002991798,0.01690459],"genre_scores_gemma":[0.20313281,0.005175292,0.77532357,0.0010043975,0.0006969637,0.0010684357,0.0011823499,0.0012663846,0.011149825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946439,0.0017618766,0.00023995902,0.0005499347,0.0022599516,0.00054431235],"domain_scores_gemma":[0.9719453,0.022076242,0.0013043955,0.0021261154,0.0020778535,0.00047015236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007686043,0.0035160999,0.0013316637,0.0034136046,0.0013842692,0.0053739143,0.0029425903,0.0021213233,0.012399103],"category_scores_gemma":[0.045200218,0.0009311443,0.0021674866,0.00240467,0.0032522052,0.005707631,0.0043905643,0.0092792725,0.003703016],"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.00014163088,0.00012390513,0.0006543234,0.00050658046,0.00006969923,0.00019751476,0.00023477996,0.4596149,0.0038734353,0.45196724,0.008192864,0.074423015],"study_design_scores_gemma":[0.000019955716,0.00006083216,0.00015655125,0.00023423281,0.000029646437,0.000084959815,0.000048905426,0.667316,0.0028230064,0.31765607,0.011539985,0.00002979831],"about_ca_topic_score_codex":0.0022184881,"about_ca_topic_score_gemma":0.0036643944,"teacher_disagreement_score":0.012399103,"about_ca_system_score_codex":0.003448014,"about_ca_system_score_gemma":0.003535006,"threshold_uncertainty_score":0.04147917},"labels":[],"label_agreement":null},{"id":"W2735217689","doi":"10.1287/ijoc.2017.0745","title":"Collaborative Operating Room Planning and Scheduling","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University Health Network; University of Toronto","funders":"","keywords":"Schedule; Operations research; Scheduling (production processes); Operations management; Computer science; Profitability index; Health care; Flexibility (engineering); Business; Economics; Engineering","score_opus":0.07147119202570347,"score_gpt":0.4536454377199059,"score_spread":0.38217424569420244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735217689","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.030816372,0.00016061976,0.953745,0.00035904266,0.00004730375,0.0001897014,0.00027014638,0.00022696836,0.014184882],"genre_scores_gemma":[0.73979896,0.00035052464,0.24914576,0.00013934486,0.000052527073,0.00030664305,0.0005451972,0.00009905041,0.009561906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769443,0.0007362162,0.00010166775,0.00050176884,0.00047668375,0.00048923586],"domain_scores_gemma":[0.9982337,0.00088911783,0.0002837872,0.00018491305,0.00021959849,0.00018887725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018195672,0.00091086933,0.0008886966,0.0006669928,0.00070789526,0.0018133526,0.002103459,0.0010270238,0.008355415],"category_scores_gemma":[0.0035169807,0.0008004573,0.0011961984,0.0010235026,0.00094289443,0.0014751267,0.0015470138,0.00125514,0.00062650343],"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.00008269375,0.00005652911,0.00062689476,0.000054262713,0.000032164742,0.00007879886,0.00007334382,0.9501904,0.0010151328,0.027736718,0.0013389105,0.0187141],"study_design_scores_gemma":[0.000027521628,0.000050086903,0.00033545415,0.000007494275,0.0000147830015,0.00003310785,0.00006237269,0.97782075,0.00074152026,0.018707033,0.0021855228,0.000014356092],"about_ca_topic_score_codex":0.01045855,"about_ca_topic_score_gemma":0.010571217,"teacher_disagreement_score":0.01045855,"about_ca_system_score_codex":0.0021494585,"about_ca_system_score_gemma":0.0036701492,"threshold_uncertainty_score":0.027951598},"labels":[],"label_agreement":null},{"id":"W2738714010","doi":"10.1287/ijoc.2019.0893","title":"Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms","year":2020,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Benchmark (surveying); Heuristic; Bilinear interpolation; Generalization; Mathematical optimization; Computer science; Quadratic assignment problem; Algorithm; Quadratic equation; Variable neighborhood search; Point (geometry); Variable (mathematics); Mathematics; Combinatorial optimization; Metaheuristic","score_opus":0.02596002116034216,"score_gpt":0.30502324235123385,"score_spread":0.27906322119089166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738714010","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.48448256,0.002512513,0.4871582,0.0012437616,0.0003314802,0.00056300644,0.0013911548,0.0011448839,0.02117239],"genre_scores_gemma":[0.85284275,0.0004730084,0.14269462,0.000095421696,0.000047035643,0.00047750404,0.0012859639,0.00022976384,0.0018538705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955096,0.0023215648,0.00016474728,0.00068221474,0.0010927273,0.0002290981],"domain_scores_gemma":[0.9838778,0.010916795,0.00066036556,0.0029266807,0.001338078,0.00028027635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004477899,0.0006220173,0.00080842245,0.00083915127,0.000965444,0.0010067928,0.0014828107,0.0010125682,0.0035517514],"category_scores_gemma":[0.023137374,0.00038210428,0.0005208731,0.0011285831,0.0013808629,0.0027689016,0.0015175518,0.0015410938,0.0004755509],"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.0010191089,0.00201901,0.0036386987,0.0006972065,0.00012807988,0.00010615814,0.00034071738,0.78760755,0.011714351,0.08589494,0.009353311,0.09748082],"study_design_scores_gemma":[0.00007864716,0.00037459214,0.0010705402,0.000030752064,0.000017904516,0.00005948676,0.00016405314,0.9538042,0.008198313,0.033312976,0.0028682766,0.000020242689],"about_ca_topic_score_codex":0.0019073162,"about_ca_topic_score_gemma":0.0014230547,"teacher_disagreement_score":0.004477899,"about_ca_system_score_codex":0.0013760554,"about_ca_system_score_gemma":0.0007328532,"threshold_uncertainty_score":0.0236817},"labels":[],"label_agreement":null},{"id":"W2740927637","doi":"10.1287/ijoc.2017.0752","title":"Exact Approaches for Designing Multifacility Buy-at-Bulk Networks","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Mathematical optimization; Network planning and design; Facility location problem; Computer science; Routing (electronic design automation); Generalization; Path (computing); Set (abstract data type); Installation; Vehicle routing problem; Mathematics; Computer network","score_opus":0.09417393478273552,"score_gpt":0.2748539605980197,"score_spread":0.1806800258152842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740927637","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.023775805,0.0004536835,0.96838355,0.0003317629,0.00004196142,0.00016831647,0.00017655034,0.00036371202,0.0063047027],"genre_scores_gemma":[0.35778052,0.00058713905,0.63823825,0.00019515358,0.000058017995,0.00026112515,0.00030556094,0.00020147557,0.0023727696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979108,0.0009931147,0.00008168621,0.00023930595,0.0004620536,0.0003129615],"domain_scores_gemma":[0.99493307,0.003826444,0.0004371155,0.00036629906,0.00028293201,0.0001541998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037318387,0.0015179962,0.0014245069,0.0011830279,0.0007954362,0.0021239754,0.0024023124,0.0016227075,0.0070096245],"category_scores_gemma":[0.010687676,0.001277688,0.0008290977,0.002048468,0.001119918,0.0040696044,0.001730307,0.0016444839,0.00052141014],"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.00007223634,0.000067205736,0.00030445514,0.000114740236,0.000019705743,0.000046869984,0.000060162973,0.94546455,0.000677478,0.025590556,0.00090608513,0.026675897],"study_design_scores_gemma":[0.000023401066,0.000039718125,0.000051441144,0.000011734587,0.000008259165,0.000018523226,0.000031643376,0.98035,0.0003827208,0.018221265,0.0008558836,0.00000546657],"about_ca_topic_score_codex":0.0033324915,"about_ca_topic_score_gemma":0.0055480804,"teacher_disagreement_score":0.0070096245,"about_ca_system_score_codex":0.0024825246,"about_ca_system_score_gemma":0.0018396518,"threshold_uncertainty_score":0.02344954},"labels":[],"label_agreement":null},{"id":"W2756812726","doi":"10.1287/ijoc.2017.0757","title":"Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Submodular set function; Facility location problem; Mathematical optimization; Greedy algorithm; Integer programming; Heuristic; Linear programming; Exploit; Class (philosophy); Mathematics; Computer science; Property (philosophy); Integer (computer science); Representation (politics); Approximation algorithm; Algorithm","score_opus":0.08034702899539055,"score_gpt":0.3010403648272476,"score_spread":0.22069333583185707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756812726","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.005469381,0.00072468433,0.98531383,0.00065192365,0.00005440604,0.00008232713,0.00027603962,0.00032425753,0.0071032997],"genre_scores_gemma":[0.23104239,0.0013966202,0.7593109,0.0003714185,0.00020415933,0.0005304181,0.0009705432,0.00029669603,0.0058769104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989398,0.00039830775,0.000051504143,0.00018989203,0.00025088896,0.00016952619],"domain_scores_gemma":[0.99770916,0.0014908711,0.00025582252,0.00022955087,0.0002239901,0.000090634145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017503335,0.0013118233,0.0013643963,0.0011342582,0.00072228484,0.0027852736,0.0030014594,0.0020525272,0.0091541605],"category_scores_gemma":[0.00710447,0.0008035409,0.0011398466,0.003304237,0.00078475376,0.002856909,0.0020831858,0.002932048,0.0016136596],"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.00006348604,0.000115760595,0.00034161803,0.00017270367,0.00003860245,0.00006617457,0.00008994507,0.86712027,0.00035193263,0.07692761,0.0067141177,0.047997855],"study_design_scores_gemma":[0.000014166055,0.000009575146,0.000031823267,0.000016709117,0.000006109327,0.000020383288,0.000025880769,0.96705383,0.00011281144,0.031291783,0.0014124514,0.000004457815],"about_ca_topic_score_codex":0.00582648,"about_ca_topic_score_gemma":0.009065372,"teacher_disagreement_score":0.0091541605,"about_ca_system_score_codex":0.0033814379,"about_ca_system_score_gemma":0.0021708638,"threshold_uncertainty_score":0.030623734},"labels":[],"label_agreement":null},{"id":"W2764194122","doi":"10.1287/ijoc.2018.0878","title":"Spectral Analysis of the MIXMAX Random Number Generators","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Pseudorandom number generator; Hyperplane; Lattice (music); Discrete mathematics; Pseudorandomness; Combinatorics; Algorithm","score_opus":0.008121671946512048,"score_gpt":0.240716549680269,"score_spread":0.23259487773375695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764194122","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.41585284,0.0005893631,0.56616086,0.0006532464,0.00006768068,0.000081020866,0.00025044923,0.0002820547,0.016062446],"genre_scores_gemma":[0.97530985,0.00018677939,0.020042118,0.00006954679,0.00006073047,0.00010821112,0.00017257409,0.000059924794,0.0039902455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.00018133163,0.000015662406,0.00006233608,0.00014394613,0.00007732368],"domain_scores_gemma":[0.9968072,0.0017862811,0.00046805677,0.00024648072,0.000422894,0.00026911273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009637425,0.00042724638,0.00048450488,0.0011454086,0.00047379828,0.00088739564,0.00060217275,0.0005474464,0.003987814],"category_scores_gemma":[0.006499437,0.00027093833,0.00035048838,0.00045629524,0.0015263101,0.0012963117,0.0007837382,0.00082854397,0.0005207267],"study_design_candidate":"simulation_or_modeling","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.0001794297,0.000058683985,0.0019380646,0.0000746727,0.000026297465,0.00029224448,0.00016650684,0.09854843,0.0074915257,0.8784159,0.0013327543,0.011475602],"study_design_scores_gemma":[0.000023264793,0.000052284213,0.00062971516,0.000022413318,0.0000058919677,0.00012630894,0.000049832364,0.8079187,0.002193715,0.18790422,0.0010457298,0.000027843913],"about_ca_topic_score_codex":0.00048235772,"about_ca_topic_score_gemma":0.00037290723,"teacher_disagreement_score":0.003987814,"about_ca_system_score_codex":0.0006027952,"about_ca_system_score_gemma":0.00044304508,"threshold_uncertainty_score":0.013340592},"labels":[],"label_agreement":null},{"id":"W2766459328","doi":"10.1287/ijoc.2021.1125","title":"Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Benchmark (surveying); Computer science; Queueing theory; Integer (computer science); Integer programming; Queue; Class (philosophy); Optimization problem; Mathematics","score_opus":0.012020268927383589,"score_gpt":0.23685441276252428,"score_spread":0.2248341438351407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766459328","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.009951513,0.00028029492,0.9839766,0.00033068348,0.00006442038,0.000058764097,0.00006956376,0.00006344444,0.0052046315],"genre_scores_gemma":[0.5282762,0.001188445,0.4629927,0.00030085215,0.00017130941,0.00040542055,0.00027687332,0.00019949151,0.0061887824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990319,0.0005085472,0.0000347749,0.00008625474,0.00023209582,0.00010639861],"domain_scores_gemma":[0.99648076,0.0025571329,0.00021948021,0.00012532732,0.0005106542,0.00010664526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028502226,0.0012747991,0.0008964873,0.000630153,0.00048859033,0.001971662,0.0009225809,0.00086107006,0.0023577947],"category_scores_gemma":[0.006269929,0.00044272628,0.0010464978,0.00092627277,0.0011385378,0.0013294859,0.0010501856,0.0028912716,0.00023514837],"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.000025810265,0.000069394846,0.0003193629,0.000070131005,0.000014777424,0.00011285302,0.000065869666,0.87206495,0.0005456417,0.10956826,0.0019114767,0.015231535],"study_design_scores_gemma":[0.0000032253718,0.0000096934655,0.000024199497,0.000006435201,0.0000017547953,0.000008482848,0.000012503131,0.9900594,0.00011800739,0.0094104875,0.00034315346,0.0000025995653],"about_ca_topic_score_codex":0.0073718247,"about_ca_topic_score_gemma":0.005651475,"teacher_disagreement_score":0.0073718247,"about_ca_system_score_codex":0.001493298,"about_ca_system_score_gemma":0.0018981689,"threshold_uncertainty_score":0.015073597},"labels":[],"label_agreement":null},{"id":"W2767124918","doi":"10.1287/ijoc.2017.0759","title":"Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Markov chain; Computer science; Stochastic matrix; Generator matrix; Class (philosophy); Subroutine; Queueing theory; Continuous-time Markov chain; Markov model; Generator (circuit theory); Matrix (chemical analysis); Examples of Markov chains; Markov process; Construct (python library); Algorithm; Variable-order Markov model; Theoretical computer science; Mathematics; Programming language; Machine learning; Artificial intelligence; Statistics","score_opus":0.015731626044080564,"score_gpt":0.2686128935138592,"score_spread":0.2528812674697786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767124918","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.012773331,0.0024838082,0.97329843,0.0010521966,0.00017937069,0.00007143588,0.0001778496,0.00030024158,0.009663312],"genre_scores_gemma":[0.40413514,0.007846603,0.56555843,0.0006284899,0.0010898309,0.00048441917,0.0010278104,0.00037510737,0.018854098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988808,0.0003363297,0.000072247,0.00021504785,0.0004003196,0.00009526214],"domain_scores_gemma":[0.99707854,0.0018186967,0.00020966984,0.00040733337,0.00034711164,0.0001387039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400735,0.0007127699,0.0009071274,0.0015687131,0.0009707277,0.0013566848,0.0010819992,0.000956683,0.006535589],"category_scores_gemma":[0.005363507,0.00037881357,0.0020770847,0.0017264911,0.0014303419,0.0020549793,0.0018331208,0.0022589066,0.001228157],"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.000031202817,0.000091970316,0.00079261255,0.00018503332,0.000037837235,0.00015706898,0.00023223608,0.124917276,0.00138118,0.81533283,0.0031208296,0.05371998],"study_design_scores_gemma":[0.000011061754,0.000021275411,0.00021835338,0.0000397474,0.000008310478,0.00011173659,0.000039461407,0.54682875,0.0005138712,0.4448748,0.007308463,0.000024191042],"about_ca_topic_score_codex":0.003116291,"about_ca_topic_score_gemma":0.0021770399,"teacher_disagreement_score":0.006535589,"about_ca_system_score_codex":0.0014571901,"about_ca_system_score_gemma":0.001287539,"threshold_uncertainty_score":0.021863699},"labels":[],"label_agreement":null},{"id":"W2788137402","doi":"10.1287/ijoc.2021.1066","title":"Network Models for Multiobjective Discrete Optimization","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Shortest path problem; Set (abstract data type); Path (computing); Network planning and design; Optimization problem; Identification (biology); Mathematics; Theoretical computer science","score_opus":0.029121039473464873,"score_gpt":0.2954834439798765,"score_spread":0.26636240450641163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788137402","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.0011466315,0.00023672417,0.994998,0.00019962082,0.00003387583,0.000024641877,0.00007053014,0.00007730229,0.0032127195],"genre_scores_gemma":[0.22436392,0.0020613272,0.75979465,0.00029047343,0.00016650304,0.00073360687,0.0005680093,0.00020813497,0.011813305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914277,0.00040804647,0.000035430396,0.00011730592,0.00023978678,0.000056711917],"domain_scores_gemma":[0.9990171,0.00062362145,0.00010542438,0.00010668906,0.00010188733,0.000045247034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011846292,0.0015031885,0.0008683409,0.0009520766,0.00052580936,0.0017682777,0.0017876559,0.0011553542,0.0054571964],"category_scores_gemma":[0.0027887684,0.0005488728,0.0014270187,0.0011922386,0.0010680112,0.002044342,0.0018744477,0.0031885263,0.0009061205],"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.000013151238,0.000022753227,0.00014812876,0.000073891424,0.000024514091,0.000032343236,0.000026812051,0.8493627,0.00045157853,0.13712077,0.0010484383,0.01167496],"study_design_scores_gemma":[0.000004631393,0.000008362635,0.00002431734,0.000012144886,0.000004437128,0.000012549336,0.0000074110594,0.9377868,0.00014248627,0.058905747,0.0030863727,0.0000047833796],"about_ca_topic_score_codex":0.0036647043,"about_ca_topic_score_gemma":0.0050843093,"teacher_disagreement_score":0.0054571964,"about_ca_system_score_codex":0.001961511,"about_ca_system_score_gemma":0.0013715161,"threshold_uncertainty_score":0.018256128},"labels":[],"label_agreement":null},{"id":"W2885484731","doi":"10.1287/ijoc.2020.0974","title":"Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Orientation (vector space); Vehicle routing problem; Computer science; Window (computing); Routing (electronic design automation); Artificial intelligence; Mathematics; Geometry; Computer network","score_opus":0.03841780626790474,"score_gpt":0.2893322890560845,"score_spread":0.25091448278817974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885484731","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.23963705,0.00058039976,0.7457736,0.00069400563,0.000121141056,0.00020435371,0.00028207456,0.00063325756,0.012074154],"genre_scores_gemma":[0.712853,0.0005379287,0.28255895,0.00018139563,0.00007938264,0.00016983337,0.0005164268,0.0002095155,0.0028934986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936134,0.00022589267,0.00002638414,0.00012139934,0.000118031,0.00014704332],"domain_scores_gemma":[0.99863416,0.00083258236,0.00021583436,0.0001444945,0.000085513864,0.00008743522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011667891,0.0007444449,0.0008918164,0.0004395347,0.0005627692,0.0010675762,0.00088815857,0.00078379834,0.0028224515],"category_scores_gemma":[0.0033402261,0.0003992009,0.00069949013,0.000982886,0.000566191,0.0018265567,0.0011120162,0.0013420065,0.00042941942],"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.0002505205,0.00022262236,0.0029182853,0.00016227724,0.000046203735,0.000233278,0.00016137765,0.8167467,0.006070686,0.03710617,0.0039414763,0.13214028],"study_design_scores_gemma":[0.000082016064,0.0001198251,0.00060787034,0.000019312947,0.000032040578,0.000115585324,0.0001178711,0.9645128,0.0036819798,0.027854756,0.002839157,0.000016741098],"about_ca_topic_score_codex":0.0038132113,"about_ca_topic_score_gemma":0.0029770955,"teacher_disagreement_score":0.0038132113,"about_ca_system_score_codex":0.000629419,"about_ca_system_score_gemma":0.0015997674,"threshold_uncertainty_score":0.009442091},"labels":[],"label_agreement":null},{"id":"W2887644249","doi":"10.1287/ijoc.2020.1042","title":"The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Dice; Integer (computer science); Randomized response; Randomization; Outcome (game theory); Mathematical optimization; Integer programming; Value (mathematics); Process (computing); Randomized controlled trial; Computer science; Mathematics; Mathematical economics; Statistics; Medicine","score_opus":0.051763821103933606,"score_gpt":0.3192376499714898,"score_spread":0.26747382886755616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887644249","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.009650469,0.00051628565,0.9856005,0.0007547673,0.000056957906,0.00006433074,0.000052992982,0.00024175584,0.0030620827],"genre_scores_gemma":[0.5553295,0.001043996,0.43961176,0.00065825856,0.00018750878,0.00040138524,0.0002161991,0.00026035003,0.002291091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315554,0.004479472,0.00021835473,0.0008042974,0.0009812493,0.00036108884],"domain_scores_gemma":[0.9644015,0.030762844,0.0021282956,0.0012787938,0.0010860644,0.00034259455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00767355,0.0018724663,0.0017681338,0.0010238361,0.000841604,0.0023879441,0.0022700334,0.0023897316,0.0043000574],"category_scores_gemma":[0.032876194,0.0009360246,0.0013156546,0.0011720234,0.0034125014,0.00360204,0.0024019228,0.003946565,0.0007247688],"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.0001960673,0.00014871711,0.00051199604,0.0002525227,0.000088501394,0.000087362445,0.000055237746,0.850605,0.0014962589,0.12511279,0.0013954017,0.020050107],"study_design_scores_gemma":[0.000028090524,0.00006362059,0.00006436979,0.000034488956,0.000012947737,0.000026035641,0.000013171038,0.94803464,0.00090694014,0.050238743,0.00056276395,0.0000140974025],"about_ca_topic_score_codex":0.00088341575,"about_ca_topic_score_gemma":0.0007659923,"teacher_disagreement_score":0.00767355,"about_ca_system_score_codex":0.0019285933,"about_ca_system_score_gemma":0.002057263,"threshold_uncertainty_score":0.04058206},"labels":[],"label_agreement":null},{"id":"W2891737621","doi":"10.1287/ijoc.2017.0796","title":"Lateness Minimization in Pairwise Connectivity Restoration Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Pairwise comparison; Integer programming; Linear programming; Schedule; Mathematical optimization; Path (computing); Computer science; Integer (computer science); Minification; Mathematics; Path length; Algorithm; Combinatorics; Statistics","score_opus":0.034357522915671214,"score_gpt":0.2512574020572413,"score_spread":0.21689987914157008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891737621","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.1404727,0.0024002846,0.8377143,0.0022561138,0.0003044778,0.00063457683,0.0014895587,0.00065544987,0.014072536],"genre_scores_gemma":[0.69492555,0.0018292536,0.28523022,0.00056002627,0.00045334324,0.0011003173,0.002120877,0.00083495304,0.012945525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974734,0.0012032037,0.000097659016,0.0004708516,0.00034104034,0.000413883],"domain_scores_gemma":[0.99134165,0.0064509697,0.0009607994,0.00028608346,0.00043230655,0.0005282817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003642848,0.0030379319,0.0024100053,0.0015985728,0.0011773322,0.002287383,0.0040002246,0.0027587255,0.0072765565],"category_scores_gemma":[0.014292343,0.0012549644,0.0016037539,0.0026425486,0.0014686994,0.0037653367,0.0016853046,0.00300206,0.00066918466],"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.00022131,0.00026703207,0.00090216316,0.00048273592,0.00009020264,0.00021356391,0.00012783485,0.94954973,0.0011792944,0.022177398,0.0039953403,0.020793345],"study_design_scores_gemma":[0.00008845563,0.000256616,0.0005130573,0.00005756818,0.000054145534,0.00015897147,0.00011483234,0.94223076,0.0008868755,0.05348237,0.002130284,0.000026119073],"about_ca_topic_score_codex":0.0036031732,"about_ca_topic_score_gemma":0.0036940428,"teacher_disagreement_score":0.0072765565,"about_ca_system_score_codex":0.0030728518,"about_ca_system_score_gemma":0.001988869,"threshold_uncertainty_score":0.024342537},"labels":[],"label_agreement":null},{"id":"W2893895554","doi":"10.1287/ijoc.2017.0795","title":"Risk Averse Shortest Paths: A Computational Study","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Shortest path problem; Measure (data warehouse); Mathematical optimization; Risk measure; Variance (accounting); Mathematics; Path (computing); Regular polygon; Implementation; Arc length; Computer science; Arc (geometry); Discrete mathematics; Data mining","score_opus":0.062020384140820846,"score_gpt":0.3816068146451262,"score_spread":0.31958643050430535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893895554","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.47432297,0.0016704736,0.4915741,0.004145873,0.00016666156,0.0001703272,0.00084886566,0.00028397058,0.026816722],"genre_scores_gemma":[0.7930165,0.0008032328,0.20149603,0.00016249417,0.000090028814,0.00020426809,0.0006420753,0.000105291096,0.003480113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00052768167,0.000038963295,0.00015265676,0.00019535751,0.0000892842],"domain_scores_gemma":[0.96716815,0.029707199,0.0008659106,0.0012545942,0.00066724943,0.00033703452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026959544,0.0006241183,0.0012406146,0.0010409238,0.00087143003,0.0014766381,0.002126547,0.0016821688,0.0060601206],"category_scores_gemma":[0.023495357,0.0004456498,0.00079015736,0.002258119,0.0012576764,0.003344202,0.0013604785,0.002353159,0.00027558504],"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.00008475286,0.000103349375,0.0014370708,0.0001019994,0.00002979154,0.00008759745,0.0000720546,0.93059576,0.00013810222,0.055988718,0.001386161,0.009974583],"study_design_scores_gemma":[0.000013661486,0.000017117376,0.00011638871,0.000009270689,0.0000053722006,0.00002403446,0.000030393994,0.9813887,0.000080757076,0.017810164,0.0005002175,0.0000039038255],"about_ca_topic_score_codex":0.0063870978,"about_ca_topic_score_gemma":0.007895035,"teacher_disagreement_score":0.0063870978,"about_ca_system_score_codex":0.0015045138,"about_ca_system_score_gemma":0.0014021765,"threshold_uncertainty_score":0.020273149},"labels":[],"label_agreement":null},{"id":"W2894550935","doi":"10.1287/ijoc.2017.0797","title":"Structure Detection in Mixed-Integer Programs","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Integer programming; Block matrix; Block (permutation group theory); Data structure; Granularity; Hypergraph; Computer science; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.011098491207575589,"score_gpt":0.2458892900069362,"score_spread":0.23479079879936063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894550935","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.033228457,0.0010005634,0.95802194,0.00076196704,0.00007400682,0.00029333276,0.00035291514,0.00075789844,0.0055088773],"genre_scores_gemma":[0.2651659,0.00047239632,0.72996163,0.0003451764,0.00009303233,0.00069556,0.00059441203,0.00030304838,0.0023688541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974464,0.001538943,0.000096667136,0.0003090099,0.0003879678,0.00022095023],"domain_scores_gemma":[0.9848392,0.013178797,0.0009990061,0.00026061723,0.0005094331,0.00021306814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005355061,0.0021270036,0.0019930473,0.0020379238,0.0007858269,0.0022624054,0.0018473178,0.0016590883,0.004072081],"category_scores_gemma":[0.014755874,0.0014236837,0.0013686676,0.0020860666,0.0014845068,0.0019169443,0.001602475,0.0025312894,0.0005077179],"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.00011468153,0.00010396144,0.001219121,0.0002791433,0.00006544996,0.00009015322,0.00007240437,0.9409475,0.0004371142,0.022194175,0.0014166621,0.033059746],"study_design_scores_gemma":[0.000015561764,0.000017223743,0.000053156637,0.000017881614,0.000005768362,0.000009655914,0.00001311387,0.98901105,0.00015691457,0.010351548,0.0003449624,0.0000030972315],"about_ca_topic_score_codex":0.0045709386,"about_ca_topic_score_gemma":0.00650717,"teacher_disagreement_score":0.005355061,"about_ca_system_score_codex":0.0015822306,"about_ca_system_score_gemma":0.002242471,"threshold_uncertainty_score":0.02832061},"labels":[],"label_agreement":null},{"id":"W2894610790","doi":"10.1287/ijoc.2017.0800","title":"The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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":"Vehicle routing problem; Mathematical optimization; Lagrangian relaxation; Routing (electronic design automation); Limit (mathematics); Exploit; Integer programming; Branch and cut; Generalization; Computer science; Integer (computer science); Relaxation (psychology); Mathematics","score_opus":0.02495445842993473,"score_gpt":0.24189110339968825,"score_spread":0.2169366449697535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894610790","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.005463231,0.001930859,0.98265326,0.0006979616,0.00010664706,0.00011483087,0.0001893864,0.0000685593,0.008775222],"genre_scores_gemma":[0.22610076,0.008784633,0.749985,0.00038720047,0.00048097983,0.00068275566,0.00081461144,0.00017766934,0.012586515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.00024201398,0.000029778805,0.00014213138,0.00020999428,0.00009457757],"domain_scores_gemma":[0.99952257,0.00025885442,0.00006959827,0.000027965369,0.000087286295,0.000033702192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012567557,0.0013953847,0.0009799607,0.0007807286,0.00053700584,0.0023924443,0.0020038253,0.0014542277,0.0032640237],"category_scores_gemma":[0.0017701295,0.0007418861,0.0011013593,0.001723942,0.0007385338,0.0017312552,0.0015184741,0.0025378112,0.00048289757],"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.00002717227,0.000107510656,0.00021705286,0.00024223373,0.000036734644,0.00013887804,0.00009002998,0.85212106,0.0006936847,0.10255932,0.004649251,0.03911703],"study_design_scores_gemma":[0.0000130289145,0.00002936156,0.000077874734,0.000039107385,0.000011135807,0.000060189388,0.000055675642,0.9530183,0.000258106,0.039667998,0.006758723,0.000010558848],"about_ca_topic_score_codex":0.0063791564,"about_ca_topic_score_gemma":0.004727173,"teacher_disagreement_score":0.0063791564,"about_ca_system_score_codex":0.0014198432,"about_ca_system_score_gemma":0.0020207008,"threshold_uncertainty_score":0.012684047},"labels":[],"label_agreement":null},{"id":"W2898866180","doi":"10.1287/ijoc.2018.0806","title":"The Meet-in-the-Middle Principle for Cutting and Packing Problems","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Bin packing problem; Dimension (graph theory); Packing problems; Set (abstract data type); Bin; Mathematical optimization; Limit (mathematics); Computation; Mathematics; Integer programming; Integer (computer science); Combinatorial optimization; Branch and cut; Computer science; Linear programming; Branch and bound; Algorithm; Combinatorics","score_opus":0.03233966605804524,"score_gpt":0.26292647075294984,"score_spread":0.2305868046949046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898866180","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.0021538553,0.0005509977,0.9867575,0.0003791776,0.00010502534,0.00012029094,0.00013895326,0.00016143656,0.009632789],"genre_scores_gemma":[0.0481864,0.001408239,0.9440781,0.0004050232,0.0002701484,0.00057877245,0.0004583089,0.0002682294,0.004346817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957343,0.0012546157,0.00028366418,0.00079773937,0.0016398245,0.00028987395],"domain_scores_gemma":[0.9978871,0.0011752414,0.00021779875,0.00040944817,0.00020402565,0.00010640092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031514526,0.0022169857,0.0019940548,0.0015408252,0.0017646066,0.0039066416,0.0031332567,0.0029032489,0.010117691],"category_scores_gemma":[0.009247986,0.0014167102,0.0028124216,0.004485128,0.0030181576,0.0068766493,0.0035057417,0.007074368,0.0041767047],"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.00020773648,0.00015478025,0.0005440778,0.0005546818,0.00007001915,0.0002369439,0.0002708427,0.081839025,0.0036637066,0.70471084,0.0157844,0.191963],"study_design_scores_gemma":[0.00006898839,0.00021931848,0.0002435017,0.0001423415,0.00003689859,0.0005859666,0.000105035935,0.24886917,0.002571947,0.6973548,0.049748953,0.000053102205],"about_ca_topic_score_codex":0.0013508861,"about_ca_topic_score_gemma":0.0012192153,"teacher_disagreement_score":0.010117691,"about_ca_system_score_codex":0.0013364925,"about_ca_system_score_gemma":0.00236403,"threshold_uncertainty_score":0.033847034},"labels":[],"label_agreement":null},{"id":"W2901773049","doi":"10.1287/ijoc.2018.0810","title":"A Joint Vehicle Routing and Speed Optimization Problem","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Solver; Computer science; Vehicle routing problem; Benchmark (surveying); Fuel efficiency; Optimization problem; Routing (electronic design automation); Convex function; Regular polygon; Algorithm; Mathematics; Engineering","score_opus":0.02059373518829806,"score_gpt":0.25878763751141537,"score_spread":0.23819390232311732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901773049","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.04216323,0.0004607975,0.93547463,0.001166752,0.00017388185,0.00031340105,0.0010182257,0.00045571887,0.01877337],"genre_scores_gemma":[0.56677645,0.00061536575,0.40808603,0.000360321,0.00022053513,0.00072525506,0.0017167378,0.0004635517,0.021035785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819535,0.000586168,0.000069503265,0.0005360156,0.00030608833,0.0003069062],"domain_scores_gemma":[0.99887985,0.00064410554,0.00010026906,0.00008291529,0.0001653203,0.0001276096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018633486,0.0020476175,0.0019662394,0.0010605282,0.00088079553,0.0025392093,0.0023264517,0.0036740464,0.00952294],"category_scores_gemma":[0.0035490843,0.0010508538,0.0014337247,0.0018843577,0.0009601525,0.0035005582,0.0017782104,0.002122035,0.0011157708],"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.00008606846,0.00012158417,0.0005396132,0.00014230513,0.000048008496,0.00014124619,0.00005313904,0.92612624,0.0010268267,0.034451064,0.0050584446,0.03220548],"study_design_scores_gemma":[0.000031944575,0.00007097285,0.00024332681,0.000014606085,0.000026077027,0.00010356105,0.000058603466,0.96799266,0.0007155962,0.026512975,0.0042128596,0.000016741009],"about_ca_topic_score_codex":0.003953758,"about_ca_topic_score_gemma":0.0028049243,"teacher_disagreement_score":0.00952294,"about_ca_system_score_codex":0.0018724129,"about_ca_system_score_gemma":0.0023085647,"threshold_uncertainty_score":0.03185743},"labels":[],"label_agreement":null},{"id":"W2903903106","doi":"10.1287/ijoc.2018.0819","title":"Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Network planning and design; Stochastic optimization; Path (computing); Stochastic programming; Quality (philosophy); Stochastic process; Mathematics","score_opus":0.04904796322602469,"score_gpt":0.3218126665640246,"score_spread":0.2727647033379999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903903106","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.076939605,0.0004076247,0.91687816,0.0007801345,0.000057345467,0.00008220934,0.00016349544,0.00009790077,0.004593502],"genre_scores_gemma":[0.76324093,0.0005560042,0.23433603,0.00013028484,0.000050363873,0.000182878,0.0001877351,0.000084227955,0.0012314253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984384,0.00086334354,0.000056656158,0.00019403873,0.00027663415,0.00017090756],"domain_scores_gemma":[0.99147296,0.0067176325,0.00068898685,0.00036192316,0.0004985873,0.00025992285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037645856,0.00093422655,0.0009604114,0.0009907684,0.00074117,0.0014868107,0.00096707116,0.0012425813,0.0028060647],"category_scores_gemma":[0.016299052,0.0007514521,0.00095994445,0.0009792915,0.0010248892,0.0017047817,0.0009652081,0.0012185263,0.00015518836],"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.00002169094,0.000012805285,0.00030544048,0.00003130479,0.0000149064435,0.00001517601,0.000017624321,0.9760148,0.00020319245,0.018628005,0.00018312948,0.004551827],"study_design_scores_gemma":[0.000009720624,0.000027222904,0.000092236645,0.000012218419,0.000007977595,0.000008052548,0.000018771527,0.97560513,0.00018284116,0.02371823,0.00031292983,0.000004775839],"about_ca_topic_score_codex":0.0065036565,"about_ca_topic_score_gemma":0.007413494,"teacher_disagreement_score":0.0065036565,"about_ca_system_score_codex":0.0021136587,"about_ca_system_score_gemma":0.002722532,"threshold_uncertainty_score":0.019909263},"labels":[],"label_agreement":null},{"id":"W2905815131","doi":"10.1287/ijoc.2022.1168","title":"Dynamic Relaxations for Online Bipartite Matching","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Matching (statistics); Bipartite graph; Heuristic; Set (abstract data type); Variety (cybernetics); Revenue; Mathematical optimization; Online algorithm; Theoretical computer science; Operations research; Mathematics; Algorithm; Economics; Artificial intelligence","score_opus":0.02570428253769788,"score_gpt":0.30766459370802673,"score_spread":0.2819603111703288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905815131","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.017831735,0.0008281389,0.953716,0.0013304556,0.00017147527,0.00020601379,0.0006322458,0.0002526841,0.025031313],"genre_scores_gemma":[0.61305165,0.0021138552,0.36087793,0.0011342043,0.0005308649,0.0010732841,0.0015530809,0.00054414483,0.019121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968129,0.0014821895,0.00012491128,0.00057421805,0.0005710356,0.0004347364],"domain_scores_gemma":[0.9887438,0.008720591,0.00076699746,0.0007387864,0.0005360953,0.00049382146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042637014,0.0016228271,0.0016501687,0.001229318,0.000934151,0.0023889758,0.002528278,0.002049714,0.014393669],"category_scores_gemma":[0.021869298,0.0010830346,0.0018370269,0.0017196833,0.0019634117,0.003923446,0.002352258,0.0046920436,0.0015276143],"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.00017402376,0.00025368246,0.0007006492,0.00032619637,0.000069683454,0.00010868236,0.0001975132,0.6258556,0.001010996,0.3312829,0.008663485,0.031356614],"study_design_scores_gemma":[0.000046008856,0.00005692448,0.000175705,0.000054265063,0.000014623042,0.00005432332,0.000060319904,0.7590653,0.00029691856,0.23614658,0.00400894,0.000020149548],"about_ca_topic_score_codex":0.0027872268,"about_ca_topic_score_gemma":0.0021965548,"teacher_disagreement_score":0.014393669,"about_ca_system_score_codex":0.0030610322,"about_ca_system_score_gemma":0.0018700548,"threshold_uncertainty_score":0.048151553},"labels":[],"label_agreement":null},{"id":"W2914375891","doi":"10.1287/ijoc.2021.1091","title":"Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Computer science; Intersection (aeronautics); Context (archaeology); Probabilistic logic; Imperfect; Stochastic programming; Mathematical optimization; Sample (material); Stage (stratigraphy); Machine learning; Artificial intelligence; Mathematics; Engineering","score_opus":0.018075070996204885,"score_gpt":0.2579876072887805,"score_spread":0.2399125362925756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914375891","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.17118959,0.00016936225,0.8262147,0.0006022909,0.000024332372,0.00004203872,0.00024742636,0.0003501246,0.0011602128],"genre_scores_gemma":[0.9285493,0.0001486402,0.07003972,0.00005549312,0.00003888046,0.00008947552,0.00041664916,0.000042802127,0.0006190502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.00020266451,0.00003277609,0.00013190297,0.00011771108,0.00007060635],"domain_scores_gemma":[0.9938682,0.004828851,0.0006540764,0.00024633374,0.00027560198,0.00012691208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015578076,0.00080840715,0.0007843665,0.0006468361,0.0002995047,0.0009977163,0.00081495545,0.00093069684,0.0009831856],"category_scores_gemma":[0.009527551,0.0005989667,0.0004793114,0.00064548006,0.00087704195,0.0016126896,0.0008009303,0.0016474185,0.00012326452],"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.000015649855,0.000012746962,0.00063720223,0.0000126273,0.0000066752464,0.000010222905,0.000011416064,0.9929415,0.00011745074,0.002213273,0.000114093215,0.0039072013],"study_design_scores_gemma":[0.0000012470227,0.0000049768532,0.00009757285,0.0000015206217,8.6030656e-7,0.0000016589107,0.000003683562,0.9965192,0.0001029498,0.0032381592,0.000027086426,0.0000011013452],"about_ca_topic_score_codex":0.006155602,"about_ca_topic_score_gemma":0.0064498046,"teacher_disagreement_score":0.006155602,"about_ca_system_score_codex":0.0010588953,"about_ca_system_score_gemma":0.0015222309,"threshold_uncertainty_score":0.012239575},"labels":[],"label_agreement":null},{"id":"W2937321088","doi":"10.1287/ijoc.2019.0915","title":"A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Belgian Federal Science Policy Office","keywords":"Mathematics; Sorting; Column generation; Mathematical optimization; Branch and cut; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Position (finance); Variable (mathematics); Exponential function; Integer programming; Algorithm; Computer science","score_opus":0.020375786052066303,"score_gpt":0.265880337222943,"score_spread":0.24550455117087672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937321088","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.0024551179,0.00005711723,0.9946833,0.00013648659,0.000032889722,0.00015208343,0.00012737037,0.0003015862,0.0020540673],"genre_scores_gemma":[0.051704228,0.00013611298,0.94473904,0.000097768956,0.00004688774,0.0004593748,0.00048270143,0.00020125847,0.002132665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910164,0.00028903174,0.000039349175,0.00014937652,0.0002922584,0.00012842841],"domain_scores_gemma":[0.99880743,0.0007426042,0.0000872038,0.00010459467,0.00018042253,0.00007786185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013113748,0.001113794,0.0013952192,0.0013063648,0.0010455078,0.0013150452,0.0014904736,0.001490236,0.011622165],"category_scores_gemma":[0.0035384006,0.0007109596,0.0011648302,0.0023530459,0.0006575728,0.0012974198,0.0014435353,0.0033401723,0.0015693584],"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.00012620368,0.00030163347,0.00039451238,0.00020580417,0.000066481145,0.0002033679,0.000085088686,0.6646436,0.00490155,0.06387657,0.013277058,0.2519182],"study_design_scores_gemma":[0.000051618325,0.0000686713,0.000109969216,0.000015300195,0.0000147770415,0.00006703149,0.000023442484,0.9525108,0.0015490165,0.04178469,0.0037901443,0.000014507294],"about_ca_topic_score_codex":0.003737557,"about_ca_topic_score_gemma":0.004476558,"teacher_disagreement_score":0.011622165,"about_ca_system_score_codex":0.0013420946,"about_ca_system_score_gemma":0.002666276,"threshold_uncertainty_score":0.03887999},"labels":[],"label_agreement":null},{"id":"W2938267440","doi":"10.1287/ijoc.2018.0838","title":"Solving Large Batches of Linear Programs","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical proof; Parametric statistics; Linear programming; Geometric programming; Basis (linear algebra); Computer science; Set (abstract data type); Space (punctuation); Mathematics; Sensitivity (control systems); Mathematical optimization; Algorithm; Geometry","score_opus":0.011727803759225532,"score_gpt":0.23535209128610612,"score_spread":0.2236242875268806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938267440","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.14447007,0.0006368883,0.8314453,0.002267826,0.00034191937,0.0005439929,0.0011361317,0.0053815763,0.013776297],"genre_scores_gemma":[0.4480601,0.00025614144,0.5410348,0.000680633,0.00020001616,0.000752124,0.0017789917,0.00072706037,0.006510093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981725,0.00048517514,0.00010490247,0.0005684581,0.00042233185,0.0002465774],"domain_scores_gemma":[0.99148715,0.0064728367,0.0004781593,0.0007640235,0.0005210198,0.00027679992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029995835,0.0014045507,0.0018978411,0.00045193272,0.00093723735,0.0018212707,0.0030652522,0.0018667687,0.008562835],"category_scores_gemma":[0.008360917,0.0012232729,0.0016356052,0.0009218503,0.0010772953,0.0021547023,0.0014892132,0.003749157,0.001072575],"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.00035038745,0.00029070865,0.0016783539,0.00024812142,0.00007518417,0.00019647965,0.0000804802,0.92812026,0.0028061273,0.015087112,0.00737769,0.043689113],"study_design_scores_gemma":[0.00004730492,0.00004047065,0.00019707168,0.000006980238,0.000009830176,0.000021759608,0.000030686842,0.9883454,0.00093497307,0.009232355,0.0011257753,0.0000073821407],"about_ca_topic_score_codex":0.007561402,"about_ca_topic_score_gemma":0.010687393,"teacher_disagreement_score":0.008562835,"about_ca_system_score_codex":0.0017035502,"about_ca_system_score_gemma":0.003120514,"threshold_uncertainty_score":0.028645515},"labels":[],"label_agreement":null},{"id":"W2944641123","doi":"10.1287/ijoc.2018.0862","title":"Permutations in the Factorization of Simplex Bases","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factorization; Simplex; Simplex algorithm; Basis (linear algebra); Mathematics; Linear programming; Column (typography); Reduction (mathematics); Revised simplex method; Computation; Row; Row and column spaces; Computer science; Algorithm; Combinatorics; Mathematical optimization; Programming language","score_opus":0.06589557754533049,"score_gpt":0.395125038779866,"score_spread":0.3292294612345355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944641123","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.018996054,0.0002087422,0.9726802,0.00015518027,0.0001632089,0.00013821604,0.0002476035,0.0010020533,0.006408846],"genre_scores_gemma":[0.14016476,0.00030080543,0.8513212,0.00013243615,0.00006929156,0.00031943317,0.0007261288,0.00066437194,0.00630154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976286,0.0009224729,0.00018656772,0.0003914099,0.0006506648,0.00022025376],"domain_scores_gemma":[0.99710935,0.0010789132,0.00015765165,0.0010079544,0.0005113153,0.00013483709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002148065,0.0012434302,0.0010789991,0.0008943356,0.0011449291,0.0019415377,0.0007760296,0.0009350486,0.010986415],"category_scores_gemma":[0.010352605,0.00073970476,0.0011126476,0.0011837031,0.001301473,0.0023064679,0.0021994424,0.0019369915,0.004769721],"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.00086752005,0.00020995538,0.001777041,0.00042962006,0.00010562667,0.00034236556,0.0007680068,0.19421937,0.021722332,0.2851778,0.018179143,0.47620127],"study_design_scores_gemma":[0.00020638725,0.00031285008,0.00055184227,0.000109839144,0.00004248923,0.00044393397,0.0002463069,0.5816404,0.02815196,0.33640435,0.05178281,0.00010682893],"about_ca_topic_score_codex":0.0027505844,"about_ca_topic_score_gemma":0.003158297,"teacher_disagreement_score":0.010986415,"about_ca_system_score_codex":0.0004618759,"about_ca_system_score_gemma":0.0015959182,"threshold_uncertainty_score":0.036753237},"labels":[],"label_agreement":null},{"id":"W2945903420","doi":"10.1287/ijoc.2020.0978","title":"Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Fundação para a Ciência e a Tecnologia; Center for Research and Development in Mathematics and Applications","keywords":"Class (philosophy); Duality (order theory); Mathematics; Strong duality; Lagrangian; Mathematical optimization; Mathematical economics; Computer science; Applied mathematics; Optimization problem; Combinatorics; Artificial intelligence","score_opus":0.22490339469076664,"score_gpt":0.37738426249737783,"score_spread":0.1524808678066112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945903420","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.008148994,0.00023771318,0.98584706,0.0003366327,0.000026764777,0.000024118608,0.000046574147,0.00005045567,0.005281689],"genre_scores_gemma":[0.65504295,0.0010874445,0.33652246,0.00027378945,0.0002017341,0.00022281767,0.00016892687,0.00014155431,0.0063384483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.00055981346,0.00003079652,0.00014702459,0.00022296974,0.00011206033],"domain_scores_gemma":[0.9980343,0.0013684998,0.00025621898,0.00014808238,0.00012503738,0.000067829984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268809,0.0010365617,0.0010381384,0.00073571305,0.0004682089,0.0017622137,0.0012299516,0.0012076147,0.0033985965],"category_scores_gemma":[0.0045916704,0.00048564834,0.0012787636,0.000835265,0.0016312762,0.0020022315,0.0016082128,0.0027266378,0.0004470437],"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.000041403662,0.00005282832,0.000187488,0.00010448294,0.000035344245,0.00015163068,0.00007165102,0.77050966,0.0011926313,0.2164289,0.0010195082,0.0102044195],"study_design_scores_gemma":[0.0000072743346,0.000018069844,0.00003986176,0.000011184652,0.0000059734643,0.000029466368,0.000014489553,0.953926,0.00038167278,0.04465415,0.0009071387,0.0000047895664],"about_ca_topic_score_codex":0.0012655798,"about_ca_topic_score_gemma":0.0008021952,"teacher_disagreement_score":0.0033985965,"about_ca_system_score_codex":0.0014206561,"about_ca_system_score_gemma":0.0011085512,"threshold_uncertainty_score":0.011998713},"labels":[],"label_agreement":null},{"id":"W2951567270","doi":"10.1287/ijoc.2018.0863","title":"Group Maintenance: A Restless Bandits Approach","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Lagrangian relaxation; Markov decision process; Heuristics; Computer science; Time horizon; Curse of dimensionality; Linear programming relaxation; Linear programming; Scheduling (production processes); Dynamic programming; Benchmark (surveying); Stochastic programming; Mathematics; Markov process","score_opus":0.006555777813665351,"score_gpt":0.19829966750556455,"score_spread":0.1917438896918992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951567270","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.037041247,0.00029845515,0.9540567,0.00045245865,0.000055865617,0.00008874501,0.00010349629,0.00030967494,0.0075933603],"genre_scores_gemma":[0.8360869,0.00028078526,0.15622152,0.00026711816,0.0000823199,0.00025313188,0.00018401639,0.00017486907,0.0064494475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992822,0.00030010397,0.000022887005,0.00012312965,0.00013023589,0.00014158843],"domain_scores_gemma":[0.9984478,0.0009994436,0.00022200317,0.00010610109,0.00013454865,0.00009016077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014493046,0.0010224973,0.0014371626,0.00071233907,0.00059072673,0.0013582697,0.0017892366,0.0013155438,0.00460087],"category_scores_gemma":[0.0040922863,0.0006375712,0.0006568212,0.00072423683,0.0012295458,0.0017185318,0.0010164159,0.0014643541,0.00041407172],"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.000065426924,0.000040100625,0.00017611995,0.000031302705,0.000016579887,0.000032083404,0.000035508554,0.9764608,0.00028859594,0.014761669,0.0005278459,0.0075640557],"study_design_scores_gemma":[0.000008767838,0.000015926018,0.000026350579,0.0000038379612,0.000003829139,0.0000036821523,0.0000080874315,0.99350893,0.00009294929,0.0060986364,0.00022665231,0.0000022697743],"about_ca_topic_score_codex":0.0070297825,"about_ca_topic_score_gemma":0.0048234,"teacher_disagreement_score":0.0070297825,"about_ca_system_score_codex":0.0017222851,"about_ca_system_score_gemma":0.001401262,"threshold_uncertainty_score":0.015391469},"labels":[],"label_agreement":null},{"id":"W2958544563","doi":"10.1287/ijoc.2018.0854","title":"An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Computer science; Branch and bound; Branch and cut; Integer programming","score_opus":0.009286559904105242,"score_gpt":0.2374896438092046,"score_spread":0.22820308390509936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958544563","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.012216843,0.00033101885,0.9820364,0.00018054245,0.000101566475,0.0001812726,0.00012154501,0.0007234154,0.0041073705],"genre_scores_gemma":[0.08627637,0.00024026819,0.9093622,0.000104284125,0.00009078543,0.00024791545,0.00048366745,0.00027980367,0.0029146813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987747,0.00028357384,0.000061715364,0.00018366385,0.00052067504,0.00017566657],"domain_scores_gemma":[0.9992424,0.0003501412,0.000060456317,0.00009117686,0.00020408387,0.000051770538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014636724,0.0009982488,0.0016389381,0.0011366415,0.0006622466,0.0012129968,0.0024881684,0.0012893842,0.005788805],"category_scores_gemma":[0.0033840085,0.0007007682,0.001009684,0.0021830217,0.00046272352,0.0016033646,0.0011432873,0.0024065706,0.0010418186],"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.00020524209,0.00024713163,0.000379683,0.00021582787,0.00007879511,0.00013162855,0.00005298738,0.68126494,0.0035673552,0.029818324,0.008886809,0.27515128],"study_design_scores_gemma":[0.00004857889,0.000050422124,0.0000782883,0.000004416408,0.00001016503,0.000030471703,0.00000493943,0.9896505,0.00058793556,0.00767721,0.0018501537,0.00000706084],"about_ca_topic_score_codex":0.004314221,"about_ca_topic_score_gemma":0.0039358805,"teacher_disagreement_score":0.005788805,"about_ca_system_score_codex":0.00092807086,"about_ca_system_score_gemma":0.0025362896,"threshold_uncertainty_score":0.01936549},"labels":[],"label_agreement":null},{"id":"W2963435180","doi":"10.1287/ijoc.2021.1085","title":"A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Military Defense Systems Analysis","field":"Engineering","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":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Interdiction; Binary number; Scale (ratio); Mathematics; Computer science; Physics; Arithmetic; Engineering","score_opus":0.014064198989707725,"score_gpt":0.23733825571136644,"score_spread":0.2232740567216587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963435180","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.0049304473,0.000077128294,0.9921962,0.0000959253,0.000016947071,0.000044566077,0.000022698201,0.00012481188,0.0024912364],"genre_scores_gemma":[0.26991227,0.0002876186,0.72520816,0.0001464156,0.000044604134,0.0003525856,0.00018245347,0.00010429847,0.0037617378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999246,0.00018752394,0.000026285488,0.000091238864,0.00030919095,0.00013964639],"domain_scores_gemma":[0.99849176,0.00095816114,0.00010272997,0.00017415645,0.00018930141,0.00008387175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013739484,0.0010229558,0.0009056527,0.0006758135,0.000551086,0.0009857223,0.0024781607,0.0012293414,0.0037628387],"category_scores_gemma":[0.004321281,0.0004808861,0.00091161556,0.00086055824,0.0012215246,0.001401348,0.0019446829,0.0025072885,0.0007083444],"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.00007951596,0.00008778779,0.00040665586,0.00009074039,0.00003398701,0.000080485035,0.000109413835,0.9016917,0.0016186541,0.051232625,0.0013498287,0.043218765],"study_design_scores_gemma":[0.0000126178,0.000015938627,0.000034094748,0.000006264591,0.000004039705,0.000014170322,0.000009921106,0.98748034,0.00027441542,0.011521012,0.00062427775,0.0000028913728],"about_ca_topic_score_codex":0.007308038,"about_ca_topic_score_gemma":0.007783872,"teacher_disagreement_score":0.007308038,"about_ca_system_score_codex":0.0015158686,"about_ca_system_score_gemma":0.0019082143,"threshold_uncertainty_score":0.014531016},"labels":[],"label_agreement":null},{"id":"W2963443214","doi":"10.1287/ijoc.2018.0869","title":"A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bounded function; Network planning and design; Backup; Mathematical optimization; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Benchmark (surveying); Graph; Hop (telecommunications); Algorithm; Discrete mathematics","score_opus":0.023120167328931438,"score_gpt":0.27374386999094885,"score_spread":0.2506237026620174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963443214","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.0059179985,0.00013891958,0.98870647,0.00045546223,0.000056906396,0.00014173954,0.000274287,0.000077124576,0.0042311316],"genre_scores_gemma":[0.11227688,0.00037357683,0.88163775,0.00028989665,0.000089001776,0.0007404529,0.0005513889,0.00011857734,0.0039224965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.0005661434,0.00006078088,0.00029281748,0.00030991613,0.000114532464],"domain_scores_gemma":[0.99826247,0.001162085,0.0001758488,0.0001461436,0.00018388609,0.00006957373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018356539,0.0015418563,0.00066196616,0.00072833634,0.0005582322,0.0015156181,0.0016136543,0.0014149507,0.0052363495],"category_scores_gemma":[0.0056483964,0.0006870804,0.0011052092,0.0012869794,0.001217139,0.002158149,0.001439082,0.0024451378,0.00051332836],"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.00004424504,0.0000993265,0.0003248443,0.0002720255,0.00002352913,0.00014619931,0.00009841932,0.863596,0.0016102744,0.10017489,0.005459114,0.028151104],"study_design_scores_gemma":[0.000053245447,0.000088333276,0.00013646949,0.000054592452,0.000015465665,0.000143618,0.000076440614,0.9217994,0.0006795052,0.066498786,0.010436283,0.00001779819],"about_ca_topic_score_codex":0.0027144975,"about_ca_topic_score_gemma":0.006582771,"teacher_disagreement_score":0.0052363495,"about_ca_system_score_codex":0.0013325302,"about_ca_system_score_gemma":0.0022739214,"threshold_uncertainty_score":0.017517388},"labels":[],"label_agreement":null},{"id":"W2966130377","doi":"10.1287/ijoc.2020.1039","title":"Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Mathematics; Vertex (graph theory); Discretization; Integer programming; Constraint programming; Combinatorics; Mathematical optimization; Discrete mathematics; Graph","score_opus":0.04288099152760674,"score_gpt":0.27726845819022056,"score_spread":0.2343874666626138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966130377","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.005780597,0.0005949672,0.9873338,0.000489342,0.00005289989,0.000047901674,0.00014266078,0.00009682423,0.0054610125],"genre_scores_gemma":[0.18441024,0.001651667,0.80792814,0.00041414125,0.00021061965,0.00043440887,0.0004438759,0.00016876702,0.004338071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889404,0.0005219847,0.000048497765,0.00017323352,0.00024349574,0.00011877394],"domain_scores_gemma":[0.998109,0.0013536745,0.00018596424,0.00012734585,0.00013338121,0.0000905893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922748,0.0016158951,0.0010338535,0.000957646,0.00047011557,0.002246559,0.0016783159,0.0012495671,0.0044962065],"category_scores_gemma":[0.0035898858,0.0006322492,0.0013301945,0.0022814688,0.0013352896,0.0020899028,0.0017630896,0.0038594108,0.00057852885],"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.00004402645,0.00009154074,0.00028997744,0.00017652987,0.000045303554,0.00006295633,0.000063310414,0.84479177,0.0005682055,0.11933938,0.0022464637,0.032280535],"study_design_scores_gemma":[0.000013649138,0.00002178459,0.00005112127,0.000021375079,0.000008193815,0.000019970446,0.000023197295,0.95044094,0.0002748026,0.047165193,0.0019529865,0.0000068423437],"about_ca_topic_score_codex":0.0034368085,"about_ca_topic_score_gemma":0.003459307,"teacher_disagreement_score":0.0044962065,"about_ca_system_score_codex":0.001695202,"about_ca_system_score_gemma":0.0015816122,"threshold_uncertainty_score":0.015041351},"labels":[],"label_agreement":null},{"id":"W2974438822","doi":"10.1287/ijoc.2018.0881","title":"An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Mathematical optimization; Lagrangian relaxation; Lagrangian; Mathematics; Travelling salesman problem; Branch and bound; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.01822810706720267,"score_gpt":0.25650438329130326,"score_spread":0.23827627622410058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974438822","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.0046034306,0.00015258024,0.992268,0.00020091786,0.000038898514,0.0000426973,0.000107564294,0.00015720775,0.0024288397],"genre_scores_gemma":[0.1678857,0.00046666918,0.82692677,0.00013951932,0.00006871086,0.00017747357,0.00040184226,0.0001365688,0.003796815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994785,0.00018098543,0.000023554452,0.000080864374,0.00017245539,0.00006365333],"domain_scores_gemma":[0.9994854,0.00027083996,0.0000516575,0.000059337268,0.0000935424,0.000039240713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664561,0.00062254164,0.0007921213,0.00078846986,0.00042499683,0.00090376753,0.001320445,0.0006190189,0.0031888566],"category_scores_gemma":[0.0015445447,0.00049708126,0.0011417582,0.0009427952,0.00045007546,0.0007943609,0.0011111711,0.001464124,0.0005679219],"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.00003153027,0.00006101866,0.00038863334,0.00012529032,0.000030047086,0.00008277709,0.000063838364,0.8754787,0.002205467,0.058260158,0.0026065109,0.060666066],"study_design_scores_gemma":[0.000009434189,0.00001611114,0.00003732198,0.000007764944,0.000007668129,0.000019119227,0.000009136346,0.9872858,0.00042321612,0.009426632,0.0027538778,0.0000038545677],"about_ca_topic_score_codex":0.0047707055,"about_ca_topic_score_gemma":0.006739912,"teacher_disagreement_score":0.0047707055,"about_ca_system_score_codex":0.0010663687,"about_ca_system_score_gemma":0.0020116197,"threshold_uncertainty_score":0.010667741},"labels":[],"label_agreement":null},{"id":"W2990476648","doi":"10.1287/ijoc.2020.1023","title":"JANOS: An Integrated Predictive and Prescriptive Modeling Framework","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Novelty; Flexibility (engineering); Set (abstract data type); Predictive analytics; Machine learning; Artificial intelligence; Artificial neural network; Plan (archaeology); Data mining","score_opus":0.03252656625127179,"score_gpt":0.29681140848117743,"score_spread":0.26428484222990567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990476648","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.0013198706,0.00008452844,0.9920792,0.0003339916,0.000028580322,0.000063806205,0.00034006167,0.0029756255,0.0027743685],"genre_scores_gemma":[0.080899335,0.00045215318,0.9126298,0.00026905813,0.00007504394,0.0004692775,0.0011363423,0.0012125197,0.002856504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977042,0.0007755391,0.00022431264,0.0003065452,0.0008423147,0.00014711695],"domain_scores_gemma":[0.99624074,0.002237811,0.00034678954,0.0005078198,0.0005039896,0.00016281655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048859413,0.0013754567,0.001048696,0.0014929923,0.00074872223,0.0039855093,0.0032772631,0.0011463189,0.0060895626],"category_scores_gemma":[0.008489525,0.0012186047,0.002107022,0.001341919,0.0015205098,0.0032539293,0.0030172893,0.0035210538,0.0015232401],"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.00008281384,0.00007346555,0.0010335853,0.00023763101,0.00008446982,0.00011665543,0.00017906494,0.6614565,0.0009873306,0.2779183,0.005986085,0.051844094],"study_design_scores_gemma":[0.000018025994,0.000014936863,0.000059816273,0.00004907184,0.000013926779,0.000030557105,0.000023298067,0.9167549,0.00083131617,0.06733573,0.014852079,0.000016443419],"about_ca_topic_score_codex":0.006836797,"about_ca_topic_score_gemma":0.009992538,"teacher_disagreement_score":0.006836797,"about_ca_system_score_codex":0.0015771758,"about_ca_system_score_gemma":0.005290272,"threshold_uncertainty_score":0.025839627},"labels":[],"label_agreement":null},{"id":"W2991221527","doi":"10.1287/ijoc.2020.1026","title":"Team Orienteering with Time-Varying Profit","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Orienteering; Computer science; Business; Operations management; Marketing; Operations research; Economics; Engineering; Geography; Cartography","score_opus":0.014568721982292943,"score_gpt":0.21947290419839557,"score_spread":0.20490418221610263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991221527","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.277578,0.00094385556,0.7050886,0.00073316303,0.00009615558,0.00019138602,0.00026363455,0.000213676,0.014891436],"genre_scores_gemma":[0.9535729,0.00031952185,0.042741936,0.000063158,0.000030236739,0.00009448544,0.00010969151,0.00005525291,0.003012713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00034800993,0.000030255598,0.00017981505,0.00015632751,0.00024432],"domain_scores_gemma":[0.99830616,0.0010169988,0.0002601453,0.00007754347,0.00015193313,0.00018710902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012145108,0.0010966338,0.0010509263,0.0005628467,0.00050994894,0.0016210992,0.0014137088,0.0012183993,0.0027423513],"category_scores_gemma":[0.0035990942,0.000418851,0.00082082365,0.0009831052,0.00091783545,0.0016891605,0.0011726052,0.0011213239,0.00026075813],"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.00009021851,0.00006248348,0.0008137682,0.000060396054,0.000041369458,0.00019398548,0.000053268122,0.9732805,0.00095220923,0.014375161,0.00073750794,0.0093391035],"study_design_scores_gemma":[0.00001165298,0.000060034108,0.00028099865,0.0000057957295,0.0000130723065,0.00004068923,0.000053364845,0.99190253,0.0003649739,0.0067778635,0.00048133894,0.000007652998],"about_ca_topic_score_codex":0.0057456903,"about_ca_topic_score_gemma":0.002819376,"teacher_disagreement_score":0.0057456903,"about_ca_system_score_codex":0.0019134842,"about_ca_system_score_gemma":0.0010667122,"threshold_uncertainty_score":0.013883412},"labels":[],"label_agreement":null},{"id":"W2998840417","doi":"10.1287/ijoc.2022.1174","title":"Integral Column Generation for Set Partitioning Problems with Side Constraints","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Heuristics; Column (typography); Heuristic; Integer (computer science); Set (abstract data type); Computer science; Algorithm; Integer programming; Vehicle routing problem; Mathematics; Routing (electronic design automation)","score_opus":0.03675847513803565,"score_gpt":0.27204631779692334,"score_spread":0.2352878426588877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998840417","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.007820217,0.0002100735,0.9893519,0.00006884436,0.000028879143,0.00005249138,0.00004440426,0.0002951527,0.0021280502],"genre_scores_gemma":[0.17694683,0.0003335396,0.8202117,0.00011687166,0.00005023607,0.00016656784,0.00032910152,0.00022041668,0.0016247261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927074,0.00029045358,0.000028488552,0.00009757147,0.00022172026,0.00009106483],"domain_scores_gemma":[0.9987097,0.0007329889,0.000098092096,0.00021648007,0.00018199433,0.000060675276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010387265,0.000690005,0.00074984477,0.000713663,0.0004576901,0.0009664319,0.0010343337,0.0005641722,0.0036118082],"category_scores_gemma":[0.0024904844,0.00042597292,0.00076546404,0.0011778488,0.00071353687,0.0009200133,0.0011756797,0.0016104041,0.00069114193],"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.00011940236,0.000112644426,0.000740511,0.00030074714,0.00005590072,0.00011877,0.00014053038,0.7031719,0.00830256,0.06630212,0.0050766016,0.21555829],"study_design_scores_gemma":[0.000019732259,0.00003146519,0.00008331998,0.000015103574,0.000009268234,0.00005119687,0.000015789541,0.9794144,0.0029778378,0.014512816,0.0028622064,0.0000068354275],"about_ca_topic_score_codex":0.0016884466,"about_ca_topic_score_gemma":0.0022888875,"teacher_disagreement_score":0.0036118082,"about_ca_system_score_codex":0.00074098003,"about_ca_system_score_gemma":0.0012606189,"threshold_uncertainty_score":0.012082696},"labels":[],"label_agreement":null},{"id":"W3007849172","doi":"10.1287/ijoc.2019.0904","title":"Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Compressor station; Mathematical optimization; Computer science; Natural gas; Benchmark (surveying); Gas compressor; Energy consumption; Pipeline (software); Heuristic; Dynamic programming; Markov decision process; Curse of dimensionality; Upper and lower bounds; Mathematics; Engineering; Markov process; Artificial intelligence","score_opus":0.008294573894365017,"score_gpt":0.2002901184201685,"score_spread":0.19199554452580347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007849172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5972387,0.00086562557,0.3910414,0.0009782609,0.00005686816,0.000089335816,0.0005455489,0.0002573356,0.008926956],"genre_scores_gemma":[0.98247033,0.00023322308,0.015175248,0.000050094317,0.000006886645,0.00004354358,0.00017502569,0.000022549517,0.0018230513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978656,0.00007514652,0.0000058198984,0.000052342486,0.000028181663,0.000052042145],"domain_scores_gemma":[0.99930215,0.00047773178,0.00009131868,0.000020162663,0.000070938,0.000037733244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265308,0.0005915054,0.0005171179,0.00034104948,0.00039771575,0.00063623005,0.0008543073,0.00090670824,0.001584682],"category_scores_gemma":[0.0017996612,0.00040365118,0.00047124785,0.0005635459,0.0006675177,0.0012228738,0.0006172445,0.0006336322,0.00009757266],"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.000024461893,0.000008776433,0.00031660617,0.000016414622,0.0000056786093,0.000044328863,0.0000113700335,0.99498284,0.00032041335,0.0021400682,0.0001504191,0.0019785932],"study_design_scores_gemma":[0.0000037516193,0.000013442293,0.00013455871,0.0000024323388,0.000002706257,0.0000074875234,0.000021263291,0.99795306,0.00017512597,0.001551522,0.00013236799,0.000002155504],"about_ca_topic_score_codex":0.018125162,"about_ca_topic_score_gemma":0.014441464,"teacher_disagreement_score":0.018125162,"about_ca_system_score_codex":0.0018962829,"about_ca_system_score_gemma":0.00078968384,"threshold_uncertainty_score":0.036039352},"labels":[],"label_agreement":null},{"id":"W3012455495","doi":"10.1287/ijoc.2020.1035","title":"frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Solver; Computer science; Python (programming language); Electric vehicle; Software; Routing (electronic design automation); Distributed computing; Mathematical optimization; Embedded system; Operating system; Programming language","score_opus":0.013751886402628628,"score_gpt":0.24080736290571525,"score_spread":0.22705547650308663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012455495","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011139013,0.00046310056,0.8879856,0.00100093,0.00046319098,0.00026947862,0.005515494,0.0585068,0.034656357],"genre_scores_gemma":[0.11542702,0.00070965406,0.82877266,0.0008067435,0.0001410388,0.001043922,0.009831692,0.022793023,0.020474166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951375,0.00009010892,0.000032636377,0.00008042469,0.00017905573,0.00010401169],"domain_scores_gemma":[0.9990183,0.00055282994,0.00007611749,0.0000938275,0.00019182748,0.00006708408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008152952,0.0014698061,0.0009367119,0.00069637067,0.00081969734,0.0013792916,0.0028272,0.001928015,0.041070912],"category_scores_gemma":[0.00451012,0.0006921382,0.0016675901,0.0008554889,0.0007349209,0.0019134004,0.0023544533,0.0026832356,0.009033298],"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.00020770202,0.00023837943,0.0031475092,0.0013419717,0.00016951651,0.00051999936,0.0002546224,0.5450652,0.0041585094,0.076719224,0.20441596,0.16376148],"study_design_scores_gemma":[0.00013853017,0.000028366687,0.0003460565,0.00007397977,0.000016313044,0.00013077902,0.00006127128,0.9145692,0.0021591634,0.025457507,0.056988258,0.000030597173],"about_ca_topic_score_codex":0.01169242,"about_ca_topic_score_gemma":0.017944641,"teacher_disagreement_score":0.041070912,"about_ca_system_score_codex":0.00092330994,"about_ca_system_score_gemma":0.0043033436,"threshold_uncertainty_score":0.13739586},"labels":[],"label_agreement":null},{"id":"W3034518788","doi":"10.1287/ijoc.2019.0928","title":"Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Concordia University","funders":"","keywords":"Mathematical optimization; Benders' decomposition; Robust optimization; Linear programming; Heuristic; Integer programming; Mathematics; Relaxation (psychology); Facility location problem; Computer science; Convergence (economics); Algorithm","score_opus":0.09638433598586557,"score_gpt":0.3186392904963311,"score_spread":0.22225495451046554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034518788","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.010462998,0.00015082107,0.986809,0.00019022072,0.000012398543,0.000046416102,0.000065507964,0.000058401456,0.0022042065],"genre_scores_gemma":[0.7408272,0.0007067838,0.24672492,0.00020267355,0.000097335585,0.00043986648,0.0003693264,0.000108294895,0.010523649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771404,0.0010083191,0.00007761079,0.0005430807,0.00037042215,0.00028650495],"domain_scores_gemma":[0.9943019,0.0039393282,0.00093398296,0.00039151873,0.00026354427,0.00016974626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041072387,0.0016157128,0.0018804299,0.0008209993,0.00048660292,0.002024497,0.0023508742,0.0023343929,0.0052721533],"category_scores_gemma":[0.008562778,0.0014394624,0.0021640356,0.0011401817,0.0015527066,0.003351153,0.0022615865,0.0036513605,0.0004347828],"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.000029156465,0.000027518572,0.00018469837,0.00004212263,0.000027584101,0.000074043295,0.000019230069,0.9574464,0.00037653264,0.03802711,0.00020650703,0.0035391424],"study_design_scores_gemma":[0.000008168412,0.000015913964,0.000056492434,0.0000047652375,0.0000057875395,0.000014192454,0.0000055768896,0.9813756,0.00016610097,0.018073665,0.00026720724,0.000006424442],"about_ca_topic_score_codex":0.0023451308,"about_ca_topic_score_gemma":0.0021007555,"teacher_disagreement_score":0.0052721533,"about_ca_system_score_codex":0.0016176262,"about_ca_system_score_gemma":0.0014001488,"threshold_uncertainty_score":0.021721423},"labels":[],"label_agreement":null},{"id":"W3034726805","doi":"10.1287/ijoc.2021.1119","title":"Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Bayerische Forschungsallianz","keywords":"Vehicle routing problem; Mathematical optimization; Scheduling (production processes); Computer science; Branch and price; Branch and cut; Synchronization (alternating current); Mathematics; Routing (electronic design automation); Linear programming; Computer network","score_opus":0.014642493236050096,"score_gpt":0.24660680146249273,"score_spread":0.23196430822644262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034726805","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.08518552,0.00044817556,0.89813495,0.0009381137,0.0000774177,0.00023468795,0.0006772165,0.0003628275,0.013941109],"genre_scores_gemma":[0.4547311,0.00048572815,0.5366458,0.00020287187,0.000052019586,0.00035054891,0.0010673162,0.00018823742,0.0062764063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994777,0.00019838652,0.000018685765,0.00011160381,0.00009286341,0.000100788144],"domain_scores_gemma":[0.9983455,0.0012867928,0.00012262021,0.000056653153,0.00009780482,0.00009065001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010770295,0.0008803743,0.0010379297,0.0005118355,0.00052683876,0.0011890631,0.0010917162,0.0013463905,0.007709117],"category_scores_gemma":[0.0030410949,0.0006403389,0.00073442346,0.0011183966,0.0006020336,0.0011013877,0.000658624,0.0015597645,0.00046941347],"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.00006197135,0.000051969266,0.00037612554,0.00007110988,0.000016445973,0.00006344604,0.000027587903,0.97614837,0.00050866976,0.008887507,0.0014670233,0.012319739],"study_design_scores_gemma":[0.00002347869,0.000025456797,0.00011167383,0.000005330526,0.0000061133787,0.000020327,0.000018329758,0.9918611,0.00022742951,0.0069685113,0.0007284198,0.000003799788],"about_ca_topic_score_codex":0.014046084,"about_ca_topic_score_gemma":0.011901276,"teacher_disagreement_score":0.014046084,"about_ca_system_score_codex":0.0020873703,"about_ca_system_score_gemma":0.00294695,"threshold_uncertainty_score":0.02792865},"labels":[],"label_agreement":null},{"id":"W3049338889","doi":"10.1287/ijoc.2021.1094","title":"Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Column (typography); Row; Separation (statistics); Row and column spaces; Mathematics; Computer science; Statistics; Geometry","score_opus":0.020134538018794283,"score_gpt":0.3011796249486511,"score_spread":0.2810450869298568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049338889","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.0066758,0.00010807769,0.99182606,0.000047446392,0.00003460675,0.000041232834,0.000045427285,0.000285112,0.0009362341],"genre_scores_gemma":[0.24506614,0.00019386146,0.75073016,0.0001383308,0.00006886879,0.00020156517,0.00038497412,0.00018741234,0.003028645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.00009294587,0.00001569512,0.00007330303,0.00010793885,0.000045900968],"domain_scores_gemma":[0.99912745,0.0003892231,0.00010358926,0.00014880268,0.00018816521,0.00004271806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051475834,0.00074702676,0.0006589376,0.00066719204,0.00043301727,0.0008206806,0.0008509345,0.0006177265,0.0041749696],"category_scores_gemma":[0.0020033123,0.00034513095,0.0006299651,0.0008506188,0.0005937588,0.00077683316,0.001247833,0.00091553567,0.0008333228],"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.00018186109,0.000108660424,0.00087511714,0.00018984685,0.000059917744,0.00016312997,0.00014234042,0.69658375,0.02146653,0.028168153,0.0054570353,0.24660368],"study_design_scores_gemma":[0.000018009072,0.00004369139,0.00009584428,0.00001144485,0.0000091055235,0.000033889897,0.000016546286,0.98755175,0.004562812,0.0057016006,0.0019467681,0.000008610567],"about_ca_topic_score_codex":0.0022468432,"about_ca_topic_score_gemma":0.0026430315,"teacher_disagreement_score":0.0041749696,"about_ca_system_score_codex":0.00044622878,"about_ca_system_score_gemma":0.0010390655,"threshold_uncertainty_score":0.01396668},"labels":[],"label_agreement":null},{"id":"W3081613282","doi":"10.1287/ijoc.2023.0094","title":"A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Chain (unit); Side chain; Chemistry; Physics","score_opus":0.00921269992859671,"score_gpt":0.29168514547139196,"score_spread":0.28247244554279527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081613282","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.008927731,0.00044273597,0.9780741,0.000728185,0.00016211753,0.00021399352,0.00023729294,0.0003101008,0.010903739],"genre_scores_gemma":[0.120478414,0.0005440572,0.8680776,0.0005817521,0.0002635552,0.0006315735,0.0009714568,0.0005721836,0.007879351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987324,0.00047505152,0.00004941754,0.0002290044,0.00034583267,0.00016825141],"domain_scores_gemma":[0.99810284,0.00119183,0.00013054362,0.00015073128,0.00028559286,0.0001385349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025493465,0.0016812747,0.001102421,0.00096132193,0.0010407175,0.0010996148,0.002210809,0.0016724596,0.0098387245],"category_scores_gemma":[0.005411118,0.00066913426,0.0018361947,0.0010826957,0.0011432671,0.0019134863,0.002087692,0.004196314,0.001731416],"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.00031933704,0.0003283774,0.0010041475,0.0004440373,0.0000903003,0.00030038875,0.0002975501,0.632701,0.0056805746,0.124641754,0.024898859,0.20929375],"study_design_scores_gemma":[0.00006543856,0.00009832939,0.00016575996,0.000050336046,0.000019127414,0.000055501663,0.000055200886,0.9226179,0.00094764936,0.06978065,0.006128693,0.000015459642],"about_ca_topic_score_codex":0.0036326319,"about_ca_topic_score_gemma":0.004626812,"teacher_disagreement_score":0.0098387245,"about_ca_system_score_codex":0.0013383051,"about_ca_system_score_gemma":0.0023810791,"threshold_uncertainty_score":0.032913804},"labels":[],"label_agreement":null},{"id":"W3082775988","doi":"10.1287/ijoc.2020.0967","title":"A Learning-Based Matheuristic for Stochastic Multicommodity Network Design","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Mathematical optimization; Heuristic; Network planning and design; Computer science; Quality (philosophy); Stochastic programming; Mathematics","score_opus":0.05454592099144406,"score_gpt":0.30608663531899005,"score_spread":0.251540714327546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082775988","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.0025484774,0.000059140068,0.9951296,0.000088889545,0.000012481093,0.000031851414,0.000017094319,0.00009418569,0.0020183143],"genre_scores_gemma":[0.29024234,0.00025786765,0.70567566,0.00020805818,0.00006295147,0.00034243247,0.000095947325,0.00009060224,0.003024173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.0001557044,0.000019788327,0.00007095142,0.00018689554,0.000036375],"domain_scores_gemma":[0.99903464,0.00061929965,0.00008706988,0.000054577842,0.00016078279,0.000043609714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766126,0.0010085645,0.00080853957,0.0008516565,0.00047253768,0.0007611332,0.0015084608,0.0011623125,0.0030749692],"category_scores_gemma":[0.0030449356,0.0004844737,0.0008411402,0.0005633987,0.0008848015,0.00075259723,0.0012584212,0.0014734567,0.00041185593],"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.000013977284,0.000027394315,0.00015456673,0.00005064084,0.000015093976,0.000026502732,0.000023755809,0.9601755,0.00068469404,0.01663226,0.00046117126,0.021734444],"study_design_scores_gemma":[0.0000036339368,0.000013683894,0.000013609088,0.0000039646043,0.0000019859192,0.000007827393,0.0000016841616,0.9958319,0.00013953313,0.0036316072,0.0003483511,0.0000022620138],"about_ca_topic_score_codex":0.0025986726,"about_ca_topic_score_gemma":0.0031007992,"teacher_disagreement_score":0.0030749692,"about_ca_system_score_codex":0.0012307814,"about_ca_system_score_gemma":0.0014067502,"threshold_uncertainty_score":0.010286808},"labels":[],"label_agreement":null},{"id":"W3093181652","doi":"10.1287/ijoc.2020.0986","title":"Robust Models for the Kidney Exchange Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Chronic Kidney Disease and Diabetes","field":"Medicine","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Integer programming; Mathematics","score_opus":0.07145540654521489,"score_gpt":0.27831782670687316,"score_spread":0.2068624201616583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093181652","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.03847234,0.0013330434,0.94640017,0.003616226,0.0001573884,0.00011868545,0.0013354981,0.0005228698,0.0080439355],"genre_scores_gemma":[0.89859873,0.0012334615,0.06749476,0.00058783207,0.00029838187,0.00041250786,0.0018381275,0.00034314147,0.02919317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979773,0.00084041024,0.00008618859,0.00047589626,0.00023393815,0.0003863497],"domain_scores_gemma":[0.9871809,0.009038764,0.001849555,0.00042098603,0.00093923445,0.000570604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004876371,0.0017666944,0.003132667,0.0012646472,0.0005783119,0.0033876882,0.0036362268,0.0044961064,0.007791418],"category_scores_gemma":[0.021437095,0.0016863509,0.0014965492,0.0012046867,0.0023391272,0.0030869625,0.0037320713,0.0044556456,0.0008681022],"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.000044719232,0.000021382268,0.00030392664,0.000034968918,0.000034144956,0.00003196293,0.000030527353,0.9639635,0.000083371575,0.03147835,0.0011659847,0.002807172],"study_design_scores_gemma":[0.00001735462,0.000012366987,0.00010145848,0.000009648104,0.000009786097,0.0000065963172,0.000012758681,0.97906405,0.000028829945,0.020400347,0.0003276035,0.000009240987],"about_ca_topic_score_codex":0.024160668,"about_ca_topic_score_gemma":0.015992314,"teacher_disagreement_score":0.024160668,"about_ca_system_score_codex":0.0029089153,"about_ca_system_score_gemma":0.003104988,"threshold_uncertainty_score":0.048040092},"labels":[],"label_agreement":null},{"id":"W3093212826","doi":"10.1287/ijoc.2020.0983","title":"The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Knapsack problem; Heuristics; Mathematical optimization; Integer programming; Generalization; Cutting stock problem; Continuous knapsack problem; Pairwise comparison; Quadratic programming; Set (abstract data type); Change-making problem; Mathematics; Constraint (computer-aided design); Constraint programming; Computer science; Optimization problem; Stochastic programming; Artificial intelligence","score_opus":0.013182966660332715,"score_gpt":0.20806319213028104,"score_spread":0.19488022546994832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093212826","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.04347951,0.0012353944,0.93183845,0.0010546969,0.00019315154,0.0002559655,0.0003948134,0.00017674585,0.021371376],"genre_scores_gemma":[0.5024332,0.0020412067,0.473775,0.000434999,0.00033540564,0.00036692072,0.0011480491,0.00016077611,0.019304419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979565,0.0007308408,0.00013300065,0.00037178036,0.00052730495,0.00028058127],"domain_scores_gemma":[0.9975696,0.0013256678,0.00031652363,0.00029578267,0.0003394237,0.00015295357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019511275,0.0010350508,0.00096634164,0.00059160515,0.0011745235,0.0024916516,0.0016344688,0.0015179508,0.0066124573],"category_scores_gemma":[0.0044889324,0.00052727637,0.0010088446,0.002070534,0.0013697135,0.00354094,0.0020670542,0.002011237,0.0009323584],"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.0003272606,0.0003662203,0.0026979158,0.00083993236,0.0001384389,0.0005744008,0.00033866288,0.6200697,0.0047859848,0.22851792,0.010836433,0.13050717],"study_design_scores_gemma":[0.00009055289,0.00025912048,0.0020087908,0.00011629505,0.00006313211,0.0007954717,0.0003967187,0.7523024,0.005498096,0.21093932,0.02745523,0.00007493164],"about_ca_topic_score_codex":0.005075007,"about_ca_topic_score_gemma":0.0033544463,"teacher_disagreement_score":0.0066124573,"about_ca_system_score_codex":0.0017216352,"about_ca_system_score_gemma":0.0021509882,"threshold_uncertainty_score":0.022120833},"labels":[],"label_agreement":null},{"id":"W3106631555","doi":"10.1287/ijoc.2020.0959","title":"Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Robust optimization; Linearization; Mathematical optimization; Bilinear interpolation; Newsvendor model; Scheme (mathematics); Conic section; Optimization problem; Computer science; Linear programming; Mathematics; Nonlinear system","score_opus":0.07741789821834659,"score_gpt":0.3308340246991044,"score_spread":0.2534161264807578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106631555","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.0027733056,0.00018951597,0.9938498,0.00016629363,0.000022026934,0.000019197214,0.000026688835,0.000054896474,0.002898226],"genre_scores_gemma":[0.7148408,0.001211361,0.26638085,0.00025516193,0.00016021746,0.00031708388,0.00019464138,0.00014173634,0.016498078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.0003762571,0.000034414188,0.00011651478,0.00015465952,0.00004561753],"domain_scores_gemma":[0.9985618,0.0008810204,0.00022186767,0.000109589615,0.00017551276,0.000050236882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019088828,0.0010142811,0.00077721226,0.00048770272,0.00029611713,0.0013070662,0.0010751438,0.0011323241,0.0051666843],"category_scores_gemma":[0.0033303134,0.00047082355,0.001182741,0.0006297001,0.0011077173,0.0018231396,0.001616717,0.0022680762,0.00051404146],"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.000035393583,0.000044137334,0.00020940657,0.00017938348,0.00003417298,0.00009605415,0.00011044036,0.6883569,0.0020592127,0.29005602,0.0011110229,0.017707951],"study_design_scores_gemma":[0.0000051826282,0.000031803324,0.000039948052,0.000009069152,0.0000054314305,0.0000151968825,0.000013816519,0.96119934,0.00044621332,0.036966987,0.001258177,0.0000087954395],"about_ca_topic_score_codex":0.0016945798,"about_ca_topic_score_gemma":0.0011277732,"teacher_disagreement_score":0.0051666843,"about_ca_system_score_codex":0.0008217319,"about_ca_system_score_gemma":0.0008408449,"threshold_uncertainty_score":0.017284274},"labels":[],"label_agreement":null},{"id":"W3110999205","doi":"10.1287/ijoc.2020.1003","title":"The Rank-One Quadratic Assignment Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Simon Fraser University","funders":"","keywords":"Quadratic assignment problem; Heuristics; Mathematical optimization; Metaheuristic; Integer programming; Quadratic equation; Pairwise comparison; Computer science; Quadratic programming; Rank (graph theory); Generalized assignment problem; Benchmark (surveying); Mathematics; Combinatorial optimization; Optimization problem; Artificial intelligence; Combinatorics","score_opus":0.026991940439963214,"score_gpt":0.2570781168276537,"score_spread":0.23008617638769047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110999205","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.058604445,0.0010137449,0.9110089,0.0016396601,0.00018957088,0.0001772798,0.0006096735,0.0004127768,0.02634396],"genre_scores_gemma":[0.707286,0.0014810227,0.27155387,0.0004331928,0.00031810068,0.00023970703,0.0011156851,0.0002395439,0.01733279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977245,0.00092981325,0.00007985829,0.000526597,0.0004203774,0.00031894917],"domain_scores_gemma":[0.9963199,0.002161104,0.0005383953,0.00033865616,0.00044133802,0.0002005727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018623574,0.0010219358,0.0009476389,0.0007010634,0.00093710615,0.0018485677,0.0016407679,0.0011949035,0.009035223],"category_scores_gemma":[0.0058687762,0.0003776309,0.00062614225,0.0016355873,0.001118891,0.0025700182,0.0012013424,0.0018334935,0.0013697643],"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.00035402595,0.00047037555,0.0023873886,0.00094771327,0.0001222783,0.00052183965,0.00030972747,0.5736713,0.0042408556,0.25175795,0.019495804,0.14572078],"study_design_scores_gemma":[0.00004606931,0.00025227046,0.00086055393,0.00004689961,0.000040766445,0.0004808941,0.00022277675,0.81821465,0.0020239302,0.16077231,0.01699788,0.00004102291],"about_ca_topic_score_codex":0.0030613758,"about_ca_topic_score_gemma":0.0023583802,"teacher_disagreement_score":0.009035223,"about_ca_system_score_codex":0.0011747921,"about_ca_system_score_gemma":0.0016958129,"threshold_uncertainty_score":0.030225873},"labels":[],"label_agreement":null},{"id":"W3116486881","doi":"10.1287/ijoc.2022.1179","title":"Stochastic RWA and Lightpath Rerouting in WDM Networks","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; HEC Montréal","funders":"","keywords":"Wavelength-division multiplexing; Computer science; Computer network","score_opus":0.0070559723773938885,"score_gpt":0.20975349558748388,"score_spread":0.20269752321009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116486881","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.07714306,0.0005610306,0.91737807,0.00051391183,0.00004622153,0.000050879382,0.00014186936,0.00014426518,0.004020657],"genre_scores_gemma":[0.9290719,0.0005258933,0.06662632,0.00012528678,0.000038248556,0.0000832666,0.0001197968,0.000049028913,0.003360262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998877,0.00051082944,0.000032372453,0.00015354464,0.00018637891,0.00023986271],"domain_scores_gemma":[0.99811745,0.0012836818,0.00030996333,0.00008081673,0.000109279776,0.000098945304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017387863,0.000748131,0.0007708072,0.000429453,0.00038237192,0.0012241808,0.0010201236,0.0011208305,0.0020077263],"category_scores_gemma":[0.0033236013,0.0006414592,0.0010155549,0.0006303939,0.0011178374,0.0013625569,0.0007426278,0.0013577628,0.00013928395],"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.000017323755,0.000016153694,0.00018077902,0.000016039085,0.000011141078,0.000020622421,0.000014897638,0.9813146,0.00034167932,0.016211769,0.00016360676,0.0016914239],"study_design_scores_gemma":[0.000004534462,0.000015062625,0.000095664516,0.0000038198423,0.0000037510824,0.000007336038,0.000010338065,0.9904901,0.00013302517,0.009016699,0.00021590304,0.0000038128069],"about_ca_topic_score_codex":0.010637823,"about_ca_topic_score_gemma":0.00801814,"teacher_disagreement_score":0.010637823,"about_ca_system_score_codex":0.002015485,"about_ca_system_score_gemma":0.0018300837,"threshold_uncertainty_score":0.021151781},"labels":[],"label_agreement":null},{"id":"W3122681984","doi":"10.1287/ijoc.2020.1014","title":"Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Compute Canada; Università Degli Studi di Modena e Reggio Emila","keywords":"Bin packing problem; Set packing; Set (abstract data type); Packing problems; Generalization; Bin; Heuristics; Heuristic; Mathematics; Mathematical optimization; Benchmark (surveying); Bounding overwatch; Decomposition; Benders' decomposition; Algorithm; Container (type theory); Computer science; Preprocessor; Branch and cut; Combinatorial optimization; Integer programming; Artificial intelligence","score_opus":0.015485442451062556,"score_gpt":0.26493965401868874,"score_spread":0.24945421156762618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122681984","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.0071071107,0.0011321903,0.9723173,0.0006615956,0.00027332522,0.00027954555,0.0006573066,0.0007023808,0.016869264],"genre_scores_gemma":[0.12459424,0.002601152,0.8541479,0.00081558357,0.0004832694,0.0008159414,0.0038142882,0.0005312177,0.012196412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867475,0.0003722144,0.00007368316,0.00028658943,0.0004457364,0.00014703047],"domain_scores_gemma":[0.99882036,0.00054608803,0.0001421246,0.0001950391,0.00020786471,0.00008843437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452896,0.0024159004,0.0012173778,0.0015906247,0.00065844576,0.002098203,0.0017683905,0.0016559069,0.013793912],"category_scores_gemma":[0.00383666,0.0008116574,0.0021671557,0.0028487663,0.000899863,0.0027814645,0.001858036,0.0049388264,0.0036870872],"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.0002767177,0.0005380775,0.0010237013,0.0010282089,0.00016337099,0.00030811853,0.00022731794,0.49171656,0.006749075,0.2150641,0.041990507,0.24091423],"study_design_scores_gemma":[0.000080448306,0.00013994431,0.0004609853,0.00018482412,0.00006807806,0.00033302786,0.00008588196,0.7848467,0.0025278323,0.17897415,0.032243267,0.000054902895],"about_ca_topic_score_codex":0.0021551545,"about_ca_topic_score_gemma":0.0021782315,"teacher_disagreement_score":0.013793912,"about_ca_system_score_codex":0.0015031806,"about_ca_system_score_gemma":0.0017126781,"threshold_uncertainty_score":0.04614526},"labels":[],"label_agreement":null},{"id":"W3122987013","doi":"10.1287/ijoc.2021.1138","title":"Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cutting-plane method; Mathematical optimization; Set (abstract data type); Optimization problem; Integer (computer science); Inverse; Discrete optimization; Integer programming; Computer science; Inverse problem; Mathematics","score_opus":0.07202007146734461,"score_gpt":0.38885166001823096,"score_spread":0.31683158855088633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122987013","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.00084315444,0.00059060316,0.99655664,0.00021152523,0.000030069026,0.000021257385,0.000021631033,0.00004456196,0.0016806117],"genre_scores_gemma":[0.24156468,0.0048306864,0.74702644,0.0004057375,0.0004054849,0.0005158413,0.00027788724,0.00030613487,0.004667141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788195,0.0010585501,0.00008705571,0.00027137192,0.0006090457,0.000091936716],"domain_scores_gemma":[0.99210864,0.006080439,0.0006271,0.00047890958,0.0005451177,0.00015985842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039083674,0.0016623029,0.0018035999,0.0010215519,0.00049091026,0.0026143678,0.0019470712,0.0018972316,0.0032997176],"category_scores_gemma":[0.015737021,0.0012668383,0.0012380884,0.0012703072,0.0025570116,0.0030251069,0.00338897,0.004463932,0.0009715641],"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.00005278315,0.00004299092,0.00036184952,0.00026383623,0.000043875898,0.0000698418,0.000118418735,0.808186,0.00089407654,0.15535103,0.002185489,0.03242976],"study_design_scores_gemma":[0.000007762077,0.00001913026,0.000031487154,0.000036046906,0.000005460496,0.000020574058,0.000012262763,0.9595456,0.0002752978,0.038551062,0.001487618,0.000007633937],"about_ca_topic_score_codex":0.002511184,"about_ca_topic_score_gemma":0.0018398165,"teacher_disagreement_score":0.0039083674,"about_ca_system_score_codex":0.0011869994,"about_ca_system_score_gemma":0.0014827056,"threshold_uncertainty_score":0.02066964},"labels":[],"label_agreement":null},{"id":"W3123413788","doi":"10.1287/ijoc.2022.1215","title":"Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Stochastic programming; Heuristics; Context (archaeology); Heuristic; Dynamic programming; Dual (grammatical number); Linear programming; Mathematics","score_opus":0.020792747269201703,"score_gpt":0.23932818181087928,"score_spread":0.21853543454167756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123413788","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.011842394,0.00047511523,0.9822996,0.00029330744,0.00006909079,0.000109841225,0.00017379117,0.00012672246,0.004610127],"genre_scores_gemma":[0.6735662,0.0008988156,0.31524378,0.00031213713,0.00012758655,0.00051061297,0.0005635259,0.00018250708,0.0085948175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882156,0.00056160806,0.000038725535,0.00019723734,0.00021607816,0.00016476389],"domain_scores_gemma":[0.998453,0.0011133634,0.00014482278,0.000047103247,0.00014408371,0.00009749015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024919808,0.0012968378,0.0018500349,0.00096409285,0.00046565404,0.0017024113,0.001414713,0.0010128756,0.004214147],"category_scores_gemma":[0.0024088132,0.0010585291,0.0014214457,0.0014282975,0.0010490833,0.0011857881,0.001176997,0.0018593248,0.0003494276],"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.000032298663,0.000025810537,0.00011488577,0.000060613685,0.000026130778,0.000032201908,0.000014316886,0.9856878,0.00032465474,0.007976909,0.0004340232,0.0052704765],"study_design_scores_gemma":[0.000005319279,0.000013917845,0.00004242758,0.000004750139,0.000004843919,0.000005568021,0.000004742946,0.995037,0.00009637167,0.0044654678,0.00031618768,0.0000034706884],"about_ca_topic_score_codex":0.0063725165,"about_ca_topic_score_gemma":0.0061009815,"teacher_disagreement_score":0.0063725165,"about_ca_system_score_codex":0.002486881,"about_ca_system_score_gemma":0.0027065175,"threshold_uncertainty_score":0.018043697},"labels":[],"label_agreement":null},{"id":"W3131605590","doi":"10.1287/ijoc.2020.1036","title":"Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University Health Network; Women's College Hospital; University of Toronto","funders":"","keywords":"Computer science; Binary decision diagram; Mathematical optimization; Scheduling (production processes); Solver; Stochastic programming; Binary number; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.1088117189710017,"score_gpt":0.4104055442844985,"score_spread":0.30159382531349677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131605590","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.0026815746,0.00010296322,0.99574465,0.00012385008,0.000020854586,0.00003528105,0.00007063404,0.000095220785,0.0011249713],"genre_scores_gemma":[0.2568253,0.0005492888,0.7380822,0.00022799226,0.00008753129,0.00026803688,0.0006060358,0.00015301205,0.003200594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795204,0.00088325737,0.00010252582,0.0003105264,0.0005371697,0.00021448145],"domain_scores_gemma":[0.99717367,0.0019392096,0.0002880699,0.00015727166,0.00030157037,0.00014024832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026655076,0.0012078988,0.0011321439,0.001261643,0.00045543507,0.0014689888,0.0014501219,0.0010267718,0.005932869],"category_scores_gemma":[0.0051015024,0.00076743355,0.001897871,0.0015983027,0.0007802099,0.0015866961,0.0012992647,0.0025228206,0.0005669854],"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.00004725684,0.000055441335,0.00027665208,0.00007198094,0.00003261821,0.000024627696,0.000033094548,0.94501936,0.000647295,0.029045459,0.0007525679,0.023993596],"study_design_scores_gemma":[0.000011787147,0.000020472047,0.000053796826,0.000007979425,0.000006840666,0.000008720332,0.0000075418893,0.9826397,0.00022678553,0.016381659,0.00063042407,0.000004380223],"about_ca_topic_score_codex":0.0066618435,"about_ca_topic_score_gemma":0.0069958214,"teacher_disagreement_score":0.0066618435,"about_ca_system_score_codex":0.002805743,"about_ca_system_score_gemma":0.0030516826,"threshold_uncertainty_score":0.020357132},"labels":[],"label_agreement":null},{"id":"W3134425920","doi":"10.1287/ijoc.2020.1027","title":"Multirow Intersection Cuts Based on the Infinity Norm","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Mathematics; Integer programming; Linear programming relaxation; Linear programming; Norm (philosophy); Cutting-plane method; Mathematical optimization; Relaxation (psychology); Row; Algorithm; Computer science","score_opus":0.02295085128851744,"score_gpt":0.2621619497504528,"score_spread":0.2392110984619354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134425920","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.008938587,0.00014294256,0.98604393,0.000070771835,0.000027498472,0.00008793395,0.00011116137,0.00028739288,0.004289803],"genre_scores_gemma":[0.13487825,0.00022542439,0.8609465,0.00010775262,0.000037791735,0.00044214708,0.0007217282,0.00040199235,0.0022384766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967077,0.0011428185,0.00018914256,0.00047227368,0.0012013826,0.00028665413],"domain_scores_gemma":[0.9941759,0.0036216632,0.00047311786,0.000710083,0.0008517429,0.00016745075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033909709,0.0013185348,0.0012787976,0.0018482149,0.000782505,0.0024551582,0.0020435872,0.0011878896,0.008276],"category_scores_gemma":[0.009493457,0.00062623265,0.0015369605,0.0021079206,0.0015522172,0.0036824953,0.0028281894,0.0036680049,0.0014224084],"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.0004309052,0.00019838386,0.001238533,0.00038541775,0.00007587419,0.00018435845,0.00027518478,0.5220007,0.00916067,0.21031053,0.006143952,0.24959552],"study_design_scores_gemma":[0.00003534765,0.00018800361,0.00021322057,0.00010131063,0.000021725156,0.00011982591,0.00011111389,0.90139705,0.009075608,0.08197341,0.0067290612,0.000034354933],"about_ca_topic_score_codex":0.0009866849,"about_ca_topic_score_gemma":0.0013338501,"teacher_disagreement_score":0.008276,"about_ca_system_score_codex":0.0010331647,"about_ca_system_score_gemma":0.0010424799,"threshold_uncertainty_score":0.02768594},"labels":[],"label_agreement":null},{"id":"W3138932436","doi":"10.1287/ijoc.2020.1015","title":"Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Windsor; University of Regina","funders":"","keywords":"Benders' decomposition; Integer programming; Preprocessor; Mathematical optimization; Task (project management); Integer (computer science); Computer science; Set (abstract data type); Decomposition; Algorithm; Sequence (biology); Upper and lower bounds; Mathematics; Artificial intelligence","score_opus":0.01599873091923164,"score_gpt":0.2623558772787281,"score_spread":0.24635714635949646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138932436","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.10079757,0.0004615729,0.87805647,0.0006648127,0.00012013023,0.00022638147,0.0005379816,0.0010931491,0.01804193],"genre_scores_gemma":[0.5135498,0.00050902675,0.4760531,0.00032667417,0.00011222114,0.00036549085,0.0010065067,0.00033222607,0.007744939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936825,0.00017601287,0.00002544339,0.00012880127,0.0001351223,0.00016637013],"domain_scores_gemma":[0.9992092,0.0005000512,0.00011374991,0.000051392606,0.00008390497,0.00004172885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009824389,0.0016176169,0.0007849973,0.0006812286,0.00050979265,0.0013359879,0.0009476719,0.0009327382,0.0064286725],"category_scores_gemma":[0.0021227207,0.0006954508,0.0012518973,0.001047398,0.00051405473,0.001425205,0.00077892357,0.0012653545,0.0005992902],"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.00016415003,0.00012319525,0.00066730514,0.00018030776,0.00003672545,0.00013038817,0.000052045983,0.9404148,0.0047838264,0.010887217,0.0020771136,0.04048296],"study_design_scores_gemma":[0.000046750087,0.00008569922,0.00016304753,0.000013635497,0.000015185015,0.000043573957,0.0000324693,0.989273,0.0016726298,0.0075613433,0.0010840025,0.000008711252],"about_ca_topic_score_codex":0.004214185,"about_ca_topic_score_gemma":0.004980868,"teacher_disagreement_score":0.0064286725,"about_ca_system_score_codex":0.0009735094,"about_ca_system_score_gemma":0.0020392751,"threshold_uncertainty_score":0.021506011},"labels":[],"label_agreement":null},{"id":"W3157330532","doi":"10.1287/ijoc.2022.1252","title":"A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Sunnybrook Health Science Centre; Health Sciences Centre; Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Isocenter; Radiosurgery; Computer science; Duration (music); Set (abstract data type); Radiation treatment planning; Linear programming; Quality (philosophy); Collimator; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics; Medicine; Radiation therapy; Surgery","score_opus":0.023378400914879357,"score_gpt":0.2938959674724149,"score_spread":0.27051756655753556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157330532","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.010490801,0.00032171354,0.98659825,0.00018257479,0.00003269823,0.00007739917,0.00005131693,0.00012790793,0.0021173917],"genre_scores_gemma":[0.31702507,0.00041190165,0.6781902,0.00020536323,0.000055880104,0.0004660765,0.00017054492,0.00018205056,0.003292989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999355,0.00030086606,0.000029941668,0.00010514932,0.00015294336,0.000056085246],"domain_scores_gemma":[0.9986419,0.0009794991,0.00013038015,0.000048883932,0.00014637326,0.00005295609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017502934,0.0013054693,0.0009977939,0.0010853156,0.0005308593,0.0008902607,0.001176863,0.0015099347,0.0029589774],"category_scores_gemma":[0.0028893629,0.0007829626,0.001242121,0.0010715333,0.0008488666,0.0008619185,0.0012301363,0.0013310297,0.0002794421],"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.0000125711895,0.000013605355,0.00009828279,0.000033550103,0.00001187647,0.000015676882,0.000016273449,0.9883088,0.00039040972,0.0015270736,0.00020078545,0.009371098],"study_design_scores_gemma":[0.000006338475,0.000021290203,0.000043346736,0.000006933962,0.0000043109703,0.000007333005,0.000005894725,0.9980124,0.00019487241,0.001365963,0.00032779065,0.0000033873873],"about_ca_topic_score_codex":0.006169515,"about_ca_topic_score_gemma":0.0056886766,"teacher_disagreement_score":0.006169515,"about_ca_system_score_codex":0.0012388758,"about_ca_system_score_gemma":0.0016841849,"threshold_uncertainty_score":0.012267232},"labels":[],"label_agreement":null},{"id":"W3165972090","doi":"10.1287/ijoc.2022.1198","title":"A Catalog of Formulations for the Network Pricing Problem","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Robustness (evolution); Enumeration; Shortest path problem; Curse of dimensionality; Preprocessor; Bilevel optimization; Set (abstract data type); Path (computing); Optimization problem; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.025776670609482494,"score_gpt":0.2993647196029922,"score_spread":0.27358804899350975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165972090","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037772777,0.007428544,0.9577659,0.0019585448,0.000264761,0.00026845018,0.0010387049,0.00038492092,0.027112791],"genre_scores_gemma":[0.06302327,0.020661645,0.89228415,0.0011439046,0.0007386343,0.0015182482,0.0030289926,0.00067364273,0.016927615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875104,0.00044604644,0.0001255992,0.00017985316,0.00041044998,0.000086984335],"domain_scores_gemma":[0.9984598,0.00076377316,0.00011981356,0.00029791673,0.0003104214,0.000048206854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002349869,0.0021727062,0.0013835094,0.0014239474,0.00093064766,0.0031425445,0.0027889607,0.0023144137,0.010695302],"category_scores_gemma":[0.0054160133,0.001012547,0.0024187497,0.0043819556,0.00086817745,0.0036667525,0.0015640283,0.0041505974,0.0036798532],"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.000058168065,0.00028921964,0.0005606597,0.0010454353,0.00007894216,0.00015098602,0.00017225888,0.10833045,0.0010569256,0.6729557,0.04121053,0.1740907],"study_design_scores_gemma":[0.00007278777,0.000078845005,0.00027251916,0.0004747509,0.00005420871,0.00046792979,0.00013516418,0.39016637,0.0010495058,0.49838552,0.10876817,0.0000742197],"about_ca_topic_score_codex":0.0017685151,"about_ca_topic_score_gemma":0.0025537931,"teacher_disagreement_score":0.010695302,"about_ca_system_score_codex":0.0013646348,"about_ca_system_score_gemma":0.0020514727,"threshold_uncertainty_score":0.035779357},"labels":[],"label_agreement":null},{"id":"W3185325703","doi":"10.1287/ijoc.2020.1044","title":"State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Stochastic programming; State variable; Computer science; Scheduling (production processes); Integer programming; Integer (computer science); Stochastic optimization; Class (philosophy); Variable (mathematics); Optimization problem; Mathematics; Artificial intelligence","score_opus":0.08023899513477249,"score_gpt":0.3623664528531287,"score_spread":0.2821274577183562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185325703","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.005952429,0.00011997536,0.99168336,0.00020567386,0.000018159682,0.00003461042,0.000090020105,0.00005826014,0.0018376154],"genre_scores_gemma":[0.705753,0.00090542855,0.282223,0.00022621102,0.0001310132,0.0007048691,0.00058421906,0.00009181816,0.009380543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986124,0.00069740304,0.000058685284,0.00026877347,0.00022683755,0.00013590233],"domain_scores_gemma":[0.9978929,0.0015181825,0.00026783088,0.0001087307,0.00014990964,0.00006256969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026964429,0.0014182572,0.001101841,0.00060092343,0.00045129904,0.0018115996,0.0017152611,0.0017778219,0.003742516],"category_scores_gemma":[0.0037618543,0.00089852215,0.0015571757,0.0009879299,0.0009754694,0.0019012565,0.0013369279,0.0026214335,0.0004349992],"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.000018105433,0.000025347612,0.000282254,0.000029362216,0.000018287592,0.00003023133,0.000019362242,0.96544045,0.00023482372,0.029921925,0.00024602344,0.003733783],"study_design_scores_gemma":[0.000002913024,0.0000066374228,0.000035804554,0.0000023503749,0.000002528768,0.000003904456,0.00000249547,0.9938298,0.000052276027,0.0058756857,0.0001831396,0.000002525512],"about_ca_topic_score_codex":0.00571034,"about_ca_topic_score_gemma":0.0049712495,"teacher_disagreement_score":0.00571034,"about_ca_system_score_codex":0.0015512916,"about_ca_system_score_gemma":0.0016496896,"threshold_uncertainty_score":0.014260292},"labels":[],"label_agreement":null},{"id":"W3196658986","doi":"10.1287/ijoc.2021.1154","title":"On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors","year":2022,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Overfitting; Computer science; Discrete choice; Choice set; Irrational number; Econometrics; Maximization; Flexibility (engineering); Mathematical optimization; Machine learning; Artificial intelligence; Economics; Mathematics; Statistics","score_opus":0.03681535117577491,"score_gpt":0.2852005994444975,"score_spread":0.24838524826872257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196658986","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.017253464,0.00015426,0.9818033,0.00013922651,0.000011030464,0.000050971183,0.00011216586,0.00015321461,0.00032240993],"genre_scores_gemma":[0.4982992,0.0007402234,0.49672028,0.00029224195,0.000097788674,0.00043530887,0.0012124882,0.00011350275,0.0020890443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731594,0.0019353422,0.00008975323,0.00032965123,0.00022004954,0.000109171626],"domain_scores_gemma":[0.976995,0.0202721,0.00084486284,0.0011477276,0.00056607387,0.00017432036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057859956,0.00088682637,0.0011336927,0.0011836507,0.00033154656,0.0009599997,0.0013572728,0.0008095649,0.00249952],"category_scores_gemma":[0.020051925,0.00064418366,0.0013236356,0.0013127289,0.00094032235,0.0015332745,0.0010562158,0.0018970466,0.0005500386],"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.00014017864,0.00012502121,0.007955294,0.00015652306,0.00013748975,0.00011217842,0.00013668573,0.86253834,0.0012196826,0.04952465,0.0014591608,0.07649485],"study_design_scores_gemma":[0.0000050176295,0.000016500255,0.00035285496,0.000007950063,0.0000057712646,0.00001332602,0.000005734184,0.9898268,0.00016838529,0.009364942,0.00022627751,0.0000064856895],"about_ca_topic_score_codex":0.006746159,"about_ca_topic_score_gemma":0.0070251715,"teacher_disagreement_score":0.006746159,"about_ca_system_score_codex":0.0008086243,"about_ca_system_score_gemma":0.0011463473,"threshold_uncertainty_score":0.030599654},"labels":[],"label_agreement":null},{"id":"W3197865201","doi":"10.1287/ijoc.2022.0262","title":"An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bounding overwatch; Cardinality (data modeling); Mathematical optimization; Computer science; Product (mathematics); Upper and lower bounds; Multinomial logistic regression; Heuristic; Mathematics; Artificial intelligence","score_opus":0.030847859106923944,"score_gpt":0.28125345267261825,"score_spread":0.2504055935656943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197865201","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.003094749,0.00024710863,0.992778,0.00021412878,0.000044730165,0.00006443466,0.00008537574,0.000269065,0.0032024805],"genre_scores_gemma":[0.10648192,0.0005537566,0.8873323,0.0002291516,0.00013196305,0.00038440066,0.00030442615,0.0002919879,0.0042900746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852365,0.0005077211,0.00005746048,0.00022389094,0.0005191446,0.0001681298],"domain_scores_gemma":[0.99613696,0.0028487165,0.00019436324,0.00036165165,0.00034692406,0.00011141168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020852596,0.0015131033,0.0014735325,0.0013347245,0.0007026932,0.0014695654,0.0020711136,0.0015999053,0.008367228],"category_scores_gemma":[0.010347716,0.0008337366,0.0013805651,0.0022006764,0.001008344,0.0026105002,0.001720651,0.0024913906,0.0013012611],"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.000072608535,0.0001079887,0.00040884255,0.00018466594,0.00005456258,0.000101810605,0.000076689896,0.8508235,0.0013572883,0.050951302,0.0045303004,0.0913304],"study_design_scores_gemma":[0.000015407191,0.000016807335,0.000042976124,0.000012602477,0.000007682904,0.000028816508,0.00000956523,0.97555506,0.00022742068,0.02269809,0.0013802809,0.000005248306],"about_ca_topic_score_codex":0.00611498,"about_ca_topic_score_gemma":0.0072924565,"teacher_disagreement_score":0.008367228,"about_ca_system_score_codex":0.0015341158,"about_ca_system_score_gemma":0.002769019,"threshold_uncertainty_score":0.027991235},"labels":[],"label_agreement":null},{"id":"W3211347572","doi":"10.1287/ijoc.2022.1167","title":"Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Robust optimization; Process (computing); Integer programming; Radiation treatment planning; Artificial intelligence; Radiation therapy; Algorithm; Mathematics; Medicine; Surgery","score_opus":0.026500806712214494,"score_gpt":0.29253478923802756,"score_spread":0.26603398252581306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211347572","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.0024006404,0.00030822583,0.9940838,0.00015165022,0.000015869686,0.000037281334,0.00005567313,0.00014461942,0.0028022267],"genre_scores_gemma":[0.4616465,0.0011302764,0.5292576,0.00017802426,0.00007960416,0.0006116326,0.00034994583,0.00026864125,0.006477821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992489,0.00034386458,0.000024894958,0.00010782591,0.00020825616,0.00006627352],"domain_scores_gemma":[0.9986934,0.00095864903,0.00014594369,0.000050652736,0.000117222306,0.00003408775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015078649,0.0011509362,0.0010930174,0.0006268292,0.0003543823,0.0012855736,0.00098979,0.0010927035,0.0034640045],"category_scores_gemma":[0.002944079,0.00079586374,0.0013424149,0.0007996636,0.00094286114,0.00091439625,0.0013609508,0.0017732319,0.0005088552],"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.000010794066,0.000009343489,0.00006649312,0.00003825975,0.000010604305,0.000012986375,0.000012655916,0.98624057,0.00033315766,0.007416472,0.00030240926,0.005546248],"study_design_scores_gemma":[0.000003228255,0.00000928083,0.000022070568,0.000004989668,0.0000026443429,0.000004248292,0.000003592655,0.99601424,0.00012864204,0.0033342447,0.00046997317,0.0000028426964],"about_ca_topic_score_codex":0.009014079,"about_ca_topic_score_gemma":0.005632265,"teacher_disagreement_score":0.009014079,"about_ca_system_score_codex":0.0019147788,"about_ca_system_score_gemma":0.0022576367,"threshold_uncertainty_score":0.017923176},"labels":[],"label_agreement":null},{"id":"W4200572948","doi":"10.1287/ijoc.2021.1113","title":"Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Benders' decomposition; Benchmark (surveying); Computer science; Scheduling (production processes); Integer programming; Range (aeronautics); Set (abstract data type); Algorithm; Mathematics; Routing (electronic design automation); Engineering","score_opus":0.020941322861145688,"score_gpt":0.2660338223751495,"score_spread":0.2450924995140038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200572948","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.0059993993,0.00030789626,0.9877901,0.00026704127,0.000049487917,0.00010938614,0.000114578856,0.00013481748,0.005227305],"genre_scores_gemma":[0.119055,0.0008809161,0.87383044,0.00029333401,0.00014923954,0.0004917855,0.00056016195,0.00017386446,0.0045652473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908674,0.0003193082,0.00004317585,0.00016530424,0.00026967414,0.00011572112],"domain_scores_gemma":[0.99934083,0.00033982878,0.00010414148,0.000055762535,0.000118009666,0.00004139235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015519644,0.0018479712,0.0008553055,0.0010901681,0.00052370253,0.0017127858,0.0015934531,0.0012209738,0.004685779],"category_scores_gemma":[0.0025945862,0.00090134755,0.0016008797,0.0015354223,0.0008390341,0.0019665454,0.0012026803,0.0030111263,0.00085715874],"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.00006330298,0.00015050644,0.00038260446,0.00022099946,0.00004166082,0.0001124366,0.00009963914,0.85149854,0.0031413024,0.08552384,0.0030929814,0.05567225],"study_design_scores_gemma":[0.00002466228,0.00004527945,0.00006649392,0.000027171542,0.000013479345,0.000033739863,0.000028232009,0.96756876,0.0008598772,0.028759839,0.0025619576,0.000010538329],"about_ca_topic_score_codex":0.0023998967,"about_ca_topic_score_gemma":0.0030318177,"teacher_disagreement_score":0.004685779,"about_ca_system_score_codex":0.0014665793,"about_ca_system_score_gemma":0.0020634031,"threshold_uncertainty_score":0.015675545},"labels":[],"label_agreement":null},{"id":"W4205930499","doi":"10.1287/ijoc.2021.1110","title":"Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Computer science; Column generation; Algorithm; Mathematical optimization; Branch and cut; Routing (electronic design automation); Integer programming; Mathematics","score_opus":0.013169023414246587,"score_gpt":0.253346230159968,"score_spread":0.2401772067457214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205930499","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.03610787,0.00095548754,0.95687705,0.0007101268,0.000115726245,0.00023155351,0.00013207216,0.0007306573,0.0041395132],"genre_scores_gemma":[0.27901024,0.0006381664,0.71468973,0.00035710496,0.00017763337,0.00052901765,0.0005684919,0.0002604327,0.0037691407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986588,0.0005086055,0.00009390041,0.0002330465,0.00025057953,0.00025505628],"domain_scores_gemma":[0.9927925,0.0056434404,0.00046180622,0.00034442774,0.0005145504,0.00024324098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030056858,0.002107691,0.0029038785,0.0011710173,0.00074700394,0.0020786468,0.002869548,0.0026084126,0.005779065],"category_scores_gemma":[0.008484128,0.0010108631,0.0014448102,0.0024751483,0.0009977387,0.003679047,0.0015848276,0.003858014,0.0008627829],"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.0001861283,0.00031704092,0.00073257607,0.00014644962,0.00006223539,0.000049308837,0.00005678834,0.87145793,0.00045872194,0.013834455,0.0026538803,0.11004444],"study_design_scores_gemma":[0.00002039462,0.000029695482,0.000037712387,0.0000044290446,0.0000054471475,0.0000068807003,0.000006046476,0.99523085,0.00009634568,0.0044213794,0.00013789869,0.0000028823367],"about_ca_topic_score_codex":0.006683962,"about_ca_topic_score_gemma":0.006973748,"teacher_disagreement_score":0.006683962,"about_ca_system_score_codex":0.002336576,"about_ca_system_score_gemma":0.003890191,"threshold_uncertainty_score":0.019332886},"labels":[],"label_agreement":null},{"id":"W4210362242","doi":"10.1287/ijoc.2021.1137","title":"Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","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":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Bipartite graph; Computer science; Theoretical computer science; Scalability; Feature (linguistics); Graph; Algorithm","score_opus":0.07169727211548858,"score_gpt":0.38226519267080344,"score_spread":0.31056792055531485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210362242","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.0063323565,0.000083983905,0.99249953,0.00008878373,0.000018764147,0.00003325928,0.00006663897,0.00026273256,0.0006139272],"genre_scores_gemma":[0.1568821,0.00017908387,0.84013426,0.000118556345,0.00003229847,0.00030413948,0.00054816285,0.0002618639,0.0015395938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995227,0.00015863388,0.000030487201,0.000088156,0.00015204313,0.000048025806],"domain_scores_gemma":[0.9970835,0.0019576177,0.00018574165,0.00028013618,0.00040032557,0.00009260589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009786768,0.00076839764,0.0009484039,0.001065051,0.0005385962,0.0010343539,0.0013951136,0.0009245507,0.0023024005],"category_scores_gemma":[0.0063206353,0.00046989138,0.0011660991,0.0012330073,0.00086394366,0.0010089119,0.001506736,0.0015689767,0.0006740206],"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.00008965075,0.0000594617,0.0014910022,0.00019166007,0.000076034965,0.00010838404,0.0002809239,0.8574923,0.0042047603,0.04461925,0.0031977089,0.08818886],"study_design_scores_gemma":[0.000004910946,0.0000048082134,0.00006918504,0.00000295593,0.0000018546932,0.0000064816822,0.000019257172,0.9917515,0.00021710772,0.00748272,0.00043588397,0.0000033565295],"about_ca_topic_score_codex":0.008329648,"about_ca_topic_score_gemma":0.012023103,"teacher_disagreement_score":0.008329648,"about_ca_system_score_codex":0.00087682804,"about_ca_system_score_gemma":0.0011580064,"threshold_uncertainty_score":0.016562343},"labels":[],"label_agreement":null},{"id":"W4210372782","doi":"10.1287/ijoc.2021.1141","title":"Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Queueing theory; Computer science; Upper and lower bounds; Range (aeronautics); Markov process; Markov decision process; Mathematical optimization; Process (computing); Algorithm; Birth–death process; Queueing system; Mathematics; Statistics; Population","score_opus":0.02012476685137463,"score_gpt":0.2515923239873354,"score_spread":0.23146755713596076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210372782","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.017514024,0.00018538603,0.98049533,0.0002793813,0.00003084635,0.000079166704,0.00004174124,0.00034746327,0.0010267914],"genre_scores_gemma":[0.2431665,0.0002732769,0.7538237,0.00022026118,0.000054342545,0.00025447138,0.00019502208,0.00017692476,0.001835544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790704,0.00083325175,0.00015797938,0.0003866223,0.0003787759,0.00033634866],"domain_scores_gemma":[0.98384136,0.012229864,0.0011064003,0.0008610271,0.0014920365,0.00046921556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068169525,0.0011748704,0.0015932287,0.001192036,0.0010556822,0.002802691,0.0043913918,0.0019230072,0.004078028],"category_scores_gemma":[0.01588488,0.00087244104,0.0010864509,0.0010905296,0.0014551654,0.00403575,0.0026728876,0.0029730715,0.00072541],"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.00012080236,0.000091682916,0.0013727103,0.00011405826,0.0000467875,0.000045391786,0.00021944019,0.9293279,0.0007285023,0.03603409,0.0007559817,0.031142723],"study_design_scores_gemma":[0.000017281374,0.000010181192,0.00004651012,0.0000063424313,0.000004302946,0.0000070163615,0.0000109160455,0.98962677,0.00019780049,0.009865288,0.00020285301,0.0000047539143],"about_ca_topic_score_codex":0.009446975,"about_ca_topic_score_gemma":0.006587681,"teacher_disagreement_score":0.009446975,"about_ca_system_score_codex":0.0039050276,"about_ca_system_score_gemma":0.0043759355,"threshold_uncertainty_score":0.03605193},"labels":[],"label_agreement":null},{"id":"W4213130510","doi":"10.1287/ijoc.2021.1079","title":"Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Production planning; Computer science; Lagrangian relaxation; Set (abstract data type); Decomposition; Cutting stock problem; Decomposition method (queueing theory); Benders' decomposition; Process (computing); Production (economics); Optimization problem; Mathematics","score_opus":0.024886558111781133,"score_gpt":0.27810083034158867,"score_spread":0.2532142722298075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213130510","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.0017569803,0.000089566296,0.9966112,0.000057774658,0.000010770873,0.00004897271,0.00005021982,0.00011063875,0.001263765],"genre_scores_gemma":[0.07959265,0.00038250003,0.9171943,0.00012402418,0.000041650164,0.00030256397,0.00041032996,0.000118341326,0.0018336171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987759,0.00041531405,0.00007415125,0.0002121613,0.00037043993,0.00015208698],"domain_scores_gemma":[0.9991893,0.00050876744,0.00008851784,0.00006622464,0.00011041351,0.000036778416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017462133,0.0017632818,0.0010974951,0.0012574417,0.00052404363,0.0015841344,0.0015484012,0.0013056857,0.00609892],"category_scores_gemma":[0.0025834772,0.0008952002,0.002070485,0.0015384891,0.00092035916,0.0016004186,0.0013375392,0.00265299,0.00092231063],"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.000052967105,0.00008090256,0.00034137443,0.00021285671,0.00003906197,0.00007367133,0.000070247814,0.8981253,0.0025450566,0.03558543,0.001225745,0.061647367],"study_design_scores_gemma":[0.000018264056,0.00003528408,0.000058692254,0.000023095134,0.000011265365,0.000027371172,0.000015104543,0.97829354,0.00092620787,0.018931702,0.0016508426,0.000008457872],"about_ca_topic_score_codex":0.0039033138,"about_ca_topic_score_gemma":0.0043051746,"teacher_disagreement_score":0.00609892,"about_ca_system_score_codex":0.0017146815,"about_ca_system_score_gemma":0.0023273318,"threshold_uncertainty_score":0.020402968},"labels":[],"label_agreement":null},{"id":"W4220679245","doi":"10.1287/ijoc.2022.1161","title":"A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Quadratic assignment problem; Bounding overwatch; Mathematical optimization; Relaxation (psychology); Mathematics; Optimization problem; Convergence (economics); Lagrangian relaxation; Quadratic equation; Dual (grammatical number); Multiplier (economics); Exploit; Computer science; Artificial intelligence","score_opus":0.03811457354944635,"score_gpt":0.3168046937288804,"score_spread":0.27869012017943406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220679245","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.004517035,0.000230172,0.9863615,0.00027039024,0.00009820362,0.000083440085,0.00006126232,0.000062814484,0.008315189],"genre_scores_gemma":[0.16735159,0.0005990305,0.8211531,0.00053127174,0.0002244127,0.0005176122,0.00031774913,0.0002952368,0.009009893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984713,0.00064740825,0.00006726048,0.00022412531,0.0004560424,0.00013391074],"domain_scores_gemma":[0.9977155,0.0011487997,0.00016134937,0.00032790285,0.00050066545,0.00014575044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035891198,0.0013544526,0.00073906605,0.000999166,0.0007634465,0.0011964833,0.0019118732,0.0012336035,0.008286566],"category_scores_gemma":[0.007276033,0.0005159427,0.0012349525,0.0007992088,0.0014859538,0.002213138,0.0026394501,0.0040537524,0.0013820562],"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.00023250027,0.00021065996,0.0009821776,0.0005733309,0.00008425518,0.0002550654,0.0003744509,0.43190733,0.015860217,0.3790485,0.012179153,0.1582924],"study_design_scores_gemma":[0.000021564805,0.00005824931,0.000162664,0.0000712984,0.000014519378,0.00006881987,0.00003582624,0.9378321,0.0019379796,0.053011987,0.0067701093,0.000014923294],"about_ca_topic_score_codex":0.002369918,"about_ca_topic_score_gemma":0.0030603977,"teacher_disagreement_score":0.008286566,"about_ca_system_score_codex":0.0013233521,"about_ca_system_score_gemma":0.0018923834,"threshold_uncertainty_score":0.027721345},"labels":[],"label_agreement":null},{"id":"W4221014517","doi":"10.1287/ijoc.2022.1170","title":"Decision Diagrams for Discrete Optimization: A Survey of Recent Advances","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Influence diagram; Integer programming; Discrete optimization; Constraint programming; Mathematical optimization; Key (lock); Point (geometry); Constraint (computer-aided design); Optimization problem; Theoretical computer science; Algorithm; Mathematics; Stochastic programming; Artificial intelligence; Decision tree","score_opus":0.03050931444026505,"score_gpt":0.3021435660097054,"score_spread":0.2716342515694403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221014517","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017121717,0.49415556,0.48246244,0.0034695345,0.0009069909,0.00009295356,0.0003587562,0.0004834688,0.016358042],"genre_scores_gemma":[0.056768034,0.6249936,0.30888817,0.0012172664,0.0029181177,0.00023585276,0.0010038565,0.00039194155,0.0035830783],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943203,0.0022676832,0.00057327154,0.00075081416,0.001942402,0.0001456398],"domain_scores_gemma":[0.98506135,0.012161406,0.0005360629,0.00069770374,0.0012729641,0.00027055608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006138889,0.0018327973,0.0024985871,0.004805749,0.00064454135,0.004621029,0.0023347805,0.0015518189,0.0078629125],"category_scores_gemma":[0.014133678,0.0011353553,0.0016642364,0.010343921,0.0019948692,0.005920895,0.0021896223,0.0036852856,0.0023601041],"study_design_candidate":"not_applicable","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.00008546146,0.00012004646,0.00079702126,0.00536881,0.00010884927,0.00009005816,0.00023428047,0.021442035,0.0006211821,0.35422164,0.014141244,0.6027693],"study_design_scores_gemma":[0.000043341108,0.000131225,0.0006567241,0.002908819,0.0000981263,0.0005111744,0.00024087165,0.061427765,0.00093277206,0.3878085,0.5451197,0.00012090316],"about_ca_topic_score_codex":0.0027961738,"about_ca_topic_score_gemma":0.0020927496,"teacher_disagreement_score":0.0078629125,"about_ca_system_score_codex":0.0025071786,"about_ca_system_score_gemma":0.002538078,"threshold_uncertainty_score":0.032465935},"labels":[],"label_agreement":null},{"id":"W4226224449","doi":"10.1287/ijoc.2021.1135","title":"Monte Carlo and Quasi–Monte Carlo Density Estimation via Conditioning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Mathematics; Monte Carlo method; Kernel density estimation; Mean squared error; Statistics; Probability density function; Random variable; Rate of convergence; Density estimation; Applied mathematics; Computer science","score_opus":0.030555301535717734,"score_gpt":0.2990503213297093,"score_spread":0.2684950197939916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226224449","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.001040243,0.00016363493,0.9968227,0.00013541654,0.000048263908,0.000039193772,0.0000322676,0.00018837157,0.0015298335],"genre_scores_gemma":[0.15821782,0.0012843172,0.82997715,0.00057894783,0.00039760934,0.0007026114,0.00040999768,0.00055039994,0.007881162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954918,0.0026878582,0.00015444375,0.00050019694,0.0009944256,0.00017131273],"domain_scores_gemma":[0.9828757,0.011850453,0.0009486344,0.0025472597,0.0015630705,0.00021502643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00643852,0.00076162367,0.0010357181,0.001359419,0.00060861174,0.0020784272,0.0018722704,0.0016009888,0.011149633],"category_scores_gemma":[0.038284928,0.00091551215,0.001290397,0.0015244873,0.0027809567,0.003952121,0.0020253526,0.0027454698,0.002128825],"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.000053294785,0.000053672225,0.0010113037,0.00017780707,0.00006697681,0.00005426058,0.00010472765,0.32961357,0.000813657,0.6172749,0.0032137285,0.047562208],"study_design_scores_gemma":[0.000012611042,0.000019919828,0.00033988612,0.000050595063,0.0000134948405,0.000047490565,0.000009887435,0.85871965,0.0007823239,0.13501196,0.0049652113,0.000026958929],"about_ca_topic_score_codex":0.005000804,"about_ca_topic_score_gemma":0.0037314228,"teacher_disagreement_score":0.011149633,"about_ca_system_score_codex":0.0018880717,"about_ca_system_score_gemma":0.0021389022,"threshold_uncertainty_score":0.037299275},"labels":[],"label_agreement":null},{"id":"W4229001783","doi":"10.1287/ijoc.2022.1194","title":"Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Computer science; Reinforcement learning; Heuristic; Scalability; Mathematical optimization; Relaxation (psychology); Metric (unit); Set (abstract data type); Artificial intelligence; Linear programming relaxation; Analytics; Linear programming; Bounding overwatch; Variable (mathematics); Machine learning; Algorithm; Mathematics; Data mining","score_opus":0.02586203490071252,"score_gpt":0.284661090906438,"score_spread":0.25879905600572545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229001783","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.026249992,0.0002433398,0.9691722,0.0002811475,0.000042757532,0.00009893471,0.00012378236,0.00077749783,0.0030103698],"genre_scores_gemma":[0.57189345,0.00031415495,0.42394716,0.00023701992,0.000042750195,0.00033852115,0.00047282776,0.0004187496,0.0023353973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965995,0.0015274546,0.00015906153,0.0005395298,0.00081089785,0.0003635181],"domain_scores_gemma":[0.9842605,0.0118967295,0.001148114,0.0010918644,0.0010706806,0.000532151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044017257,0.0016664673,0.0015671543,0.001464172,0.00076956715,0.0022769016,0.0016666378,0.0013424328,0.005550067],"category_scores_gemma":[0.028452583,0.0010891285,0.0014517654,0.0009599783,0.0016255968,0.0031441017,0.002465932,0.0037580137,0.0007665554],"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.00009073579,0.00007660565,0.0009150318,0.00009546483,0.000023607308,0.000037228874,0.00009100773,0.929338,0.0008102424,0.024408856,0.00074615696,0.043367155],"study_design_scores_gemma":[0.000015130403,0.000025327061,0.000049845814,0.000019329855,0.0000055874325,0.0000056909557,0.000010239774,0.9793117,0.0004608382,0.019579634,0.0005117361,0.0000049155765],"about_ca_topic_score_codex":0.0056883204,"about_ca_topic_score_gemma":0.009092007,"teacher_disagreement_score":0.0056883204,"about_ca_system_score_codex":0.0028551517,"about_ca_system_score_gemma":0.0036631327,"threshold_uncertainty_score":0.023278832},"labels":[],"label_agreement":null},{"id":"W4242798004","doi":"10.1287/ijoc.1090.0331","title":"From the Editor","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Knowledge Management and Sharing","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Download; Computer science; Volume (thermodynamics); Library science; World Wide Web; Physics","score_opus":0.02375864557562907,"score_gpt":0.3106250366140468,"score_spread":0.2868663910384177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242798004","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002382435,0.009454529,0.00028370944,0.14494689,0.83197165,0.000038970295,0.00013752964,0.000106218526,0.012822327],"genre_scores_gemma":[0.0033502786,0.007990389,0.00029975348,0.1889055,0.6177263,0.0000839655,0.0001727943,0.000116799114,0.18135422],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983261,0.00031117356,0.00018007454,0.0003562859,0.0006165263,0.00020984572],"domain_scores_gemma":[0.99224746,0.0021760433,0.0006439704,0.0004796984,0.0027225183,0.0017303193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018711283,0.0013754232,0.0013004334,0.0013097335,0.0016061233,0.004498758,0.0021896595,0.0095967855,0.10295055],"category_scores_gemma":[0.015540839,0.00063811836,0.00094787544,0.0005562874,0.001090281,0.0028550646,0.002131083,0.0091229305,0.06771606],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000048719292,0.000013157138,0.00006825167,0.00012190194,0.000010897284,0.00031939603,0.000014176932,0.000014747807,0.00012031938,0.00037819377,0.98850644,0.010383799],"study_design_scores_gemma":[0.00001975461,0.000025076197,0.00014517398,0.00010632841,0.000012233371,0.00046507537,0.000030144716,0.00003373261,0.0001494929,0.00031079925,0.99869365,0.00000867021],"about_ca_topic_score_codex":0.00048349774,"about_ca_topic_score_gemma":0.0011755314,"teacher_disagreement_score":0.8970494,"about_ca_system_score_codex":0.0010683689,"about_ca_system_score_gemma":0.0014888005,"threshold_uncertainty_score":0.34440386},"labels":[],"label_agreement":null},{"id":"W4292737938","doi":"10.1287/ijoc.2022.1223","title":"A Branch-and-Price Algorithm for the Multiple Knapsack Problem","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; Université de Montréal","funders":"","keywords":"Knapsack problem; Lagrangian relaxation; Mathematical optimization; Cutting stock problem; Combinatorial optimization; Mathematics; Change-making problem; Relaxation (psychology); Branch and bound; Continuous knapsack problem; Algorithm; Decomposition; Integer programming; Computer science; Optimization problem","score_opus":0.013633431592749714,"score_gpt":0.2242847312225913,"score_spread":0.21065129962984158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292737938","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.00428665,0.00045812962,0.9857619,0.0004004556,0.00012268002,0.00023432802,0.0001177936,0.0008630963,0.007755032],"genre_scores_gemma":[0.050605852,0.0005446072,0.94173986,0.00017982922,0.00012634433,0.00048741602,0.0005003536,0.00036907394,0.0054467237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986105,0.00034095615,0.000080261256,0.00027103783,0.00043897747,0.00025816503],"domain_scores_gemma":[0.9986526,0.0007656393,0.00012050459,0.00014406812,0.00020841988,0.00010873463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015966889,0.0020413974,0.0020551893,0.0014902693,0.0015986686,0.002282791,0.0022161724,0.0023547322,0.013816556],"category_scores_gemma":[0.0040631467,0.0011209191,0.0013620926,0.0029587974,0.00092578615,0.0026312873,0.0025536036,0.0041981256,0.004044219],"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.00029857206,0.0004642534,0.0005463524,0.00039561413,0.00011701643,0.00028629508,0.00024084197,0.48933288,0.0035087743,0.06999886,0.02802102,0.40678954],"study_design_scores_gemma":[0.0001187511,0.00010262849,0.00010105859,0.000034454286,0.000029439017,0.000108080596,0.00005182886,0.95447785,0.0008505142,0.03639132,0.0077157724,0.000018269171],"about_ca_topic_score_codex":0.0052763913,"about_ca_topic_score_gemma":0.0061944043,"teacher_disagreement_score":0.013816556,"about_ca_system_score_codex":0.0015545667,"about_ca_system_score_gemma":0.0034248647,"threshold_uncertainty_score":0.046221018},"labels":[],"label_agreement":null},{"id":"W4310251946","doi":"10.1287/ijoc.2022.1248","title":"Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Integer programming; Branch and bound; Cutting-plane method; Branch and cut; Tree (set theory); Computer science; Simple (philosophy); Operations research; Linear programming; Search tree; Upper and lower bounds; Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Programming language; Epistemology","score_opus":0.05094025746411535,"score_gpt":0.2295837514378738,"score_spread":0.17864349397375845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310251946","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.0055679935,0.009296783,0.94485885,0.016327564,0.0009053367,0.00016866914,0.0001737957,0.00032184483,0.022379212],"genre_scores_gemma":[0.09955859,0.024111865,0.8593238,0.0038987985,0.0019217454,0.00063189515,0.0008827905,0.0010280849,0.00864238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929322,0.0032873128,0.00029889765,0.0006077094,0.0025099234,0.00036396467],"domain_scores_gemma":[0.9800417,0.016531996,0.0005701442,0.0012542665,0.0012990779,0.00030290615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008900562,0.0013330698,0.001346792,0.0012704167,0.0014210525,0.0066532125,0.003114326,0.0036033753,0.011080015],"category_scores_gemma":[0.034933336,0.0013108379,0.0014816215,0.0029720992,0.0030094506,0.010701338,0.0038621542,0.012828108,0.0040576723],"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.0001513723,0.00012624204,0.0005154741,0.0008076536,0.000042220505,0.00024621663,0.00042011033,0.068205595,0.0010403037,0.5817242,0.027197134,0.31952348],"study_design_scores_gemma":[0.000040129955,0.00009628053,0.00015990851,0.00045609768,0.00001548804,0.00024212265,0.00029776967,0.09036665,0.001172938,0.8574009,0.049717184,0.0000344942],"about_ca_topic_score_codex":0.0012345038,"about_ca_topic_score_gemma":0.0013524888,"teacher_disagreement_score":0.011080015,"about_ca_system_score_codex":0.0011833665,"about_ca_system_score_gemma":0.0025379092,"threshold_uncertainty_score":0.047071278},"labels":[],"label_agreement":null},{"id":"W4311705215","doi":"10.1287/ijoc.2022.1257","title":"The Value of Randomized Strategies in Distributionally Robust Risk-Averse Network Interdiction Problems","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"CVAR; Mathematical optimization; Interdiction; Lagrangian relaxation; Robust optimization; Computer science; Optimization problem; Convex optimization; Relaxation (psychology); Flow network; Mathematics; Expected shortfall; Regular polygon; Risk management","score_opus":0.0047798520069059465,"score_gpt":0.20795647855401864,"score_spread":0.2031766265471127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311705215","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.051206816,0.00075563265,0.9411354,0.00092326873,0.00007114475,0.00010661978,0.00009295517,0.00016501803,0.0055430317],"genre_scores_gemma":[0.8737316,0.00071231544,0.121813424,0.00025706636,0.00006825047,0.00024301169,0.00011979668,0.000121843106,0.0029327946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647576,0.0023330322,0.0001143267,0.0004732911,0.00033714224,0.0002665156],"domain_scores_gemma":[0.9783036,0.018646978,0.0013775681,0.00056125125,0.00067233224,0.00043824327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054668393,0.0013774912,0.0020711648,0.000736749,0.00075978605,0.0016715594,0.0019518927,0.0018486301,0.003035029],"category_scores_gemma":[0.019863648,0.0007784167,0.000987114,0.00092754484,0.0024914343,0.0031443648,0.002111171,0.0025095732,0.00027597995],"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.00008199397,0.0000348725,0.0001866004,0.000046495225,0.000033974065,0.00004232312,0.000019493948,0.9667612,0.0002742694,0.02688798,0.0003342238,0.005296741],"study_design_scores_gemma":[0.000015982618,0.00004839228,0.000041911353,0.000008140337,0.000007279907,0.000009522801,0.000010175237,0.97691375,0.00019518017,0.022598207,0.00014485372,0.000006539934],"about_ca_topic_score_codex":0.0027487865,"about_ca_topic_score_gemma":0.0019450216,"teacher_disagreement_score":0.0054668393,"about_ca_system_score_codex":0.001994164,"about_ca_system_score_gemma":0.0017396674,"threshold_uncertainty_score":0.02891171},"labels":[],"label_agreement":null},{"id":"W4313890670","doi":"10.1287/ijoc.2022.1266","title":"Now You See It, Now You Don’t: Obfuscation of Online Third-Party Information Sharing","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Privacy, Security, and Data Protection","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Obfuscation; Computer science; Social media; Incentive; Internet privacy; Information sharing; Information sensitivity; Key (lock); World Wide Web; Data science; Computer security","score_opus":0.0392056685509132,"score_gpt":0.32309764964409693,"score_spread":0.2838919810931837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313890670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.570668,0.00431665,0.21760942,0.029290957,0.00040771972,0.0005949182,0.0018233954,0.0016277782,0.17366126],"genre_scores_gemma":[0.95763785,0.0011333944,0.031218683,0.0015028331,0.00013187362,0.0001476337,0.00030388127,0.00020106138,0.0077227973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9849503,0.00957683,0.00053360325,0.0009626418,0.0030260147,0.0009505297],"domain_scores_gemma":[0.8740603,0.080989495,0.016830623,0.02219661,0.004299143,0.0016238922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013568486,0.00048193973,0.00069748913,0.0021968097,0.0022582372,0.0055179624,0.0013341531,0.0019089862,0.011978242],"category_scores_gemma":[0.08068316,0.00057663565,0.0010404007,0.0028111623,0.004166939,0.009560497,0.004651148,0.0032994933,0.0022413735],"study_design_candidate":"simulation_or_modeling","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.0014975161,0.00088168524,0.087387666,0.0013008548,0.00045321768,0.0013682119,0.017580258,0.01401526,0.006611101,0.396865,0.036536075,0.43550315],"study_design_scores_gemma":[0.00019962025,0.0006154923,0.06368666,0.0025980673,0.0006897198,0.003853675,0.016519299,0.14521267,0.03410481,0.5605531,0.17146133,0.00050567416],"about_ca_topic_score_codex":0.0029931548,"about_ca_topic_score_gemma":0.0030409317,"teacher_disagreement_score":0.013568486,"about_ca_system_score_codex":0.002368579,"about_ca_system_score_gemma":0.0024500706,"threshold_uncertainty_score":0.07175791},"labels":[],"label_agreement":null},{"id":"W4319215029","doi":"10.1287/ijoc.2023.0019","title":"A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Mathematics","score_opus":0.04881488983816907,"score_gpt":0.3535815859209205,"score_spread":0.3047666960827514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319215029","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.012670834,0.00048509424,0.9770741,0.00037939122,0.0001545968,0.00017471597,0.000090355854,0.00095270626,0.008018258],"genre_scores_gemma":[0.14301942,0.00043977785,0.8496738,0.00027631797,0.00014249292,0.0004543235,0.00039967545,0.00036227892,0.0052318657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930704,0.00020581948,0.000035438963,0.00014070769,0.00016484555,0.00014621786],"domain_scores_gemma":[0.998884,0.00074106146,0.00007027556,0.000118836426,0.00010438753,0.000081351376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061587,0.0011136598,0.0009733485,0.00079613377,0.0007743277,0.0010449264,0.0016847918,0.0013144942,0.009541933],"category_scores_gemma":[0.0034070413,0.00057056174,0.0011291262,0.001353218,0.0005712964,0.0015919876,0.0012066994,0.0022191552,0.0017131225],"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.00018535764,0.00038215762,0.000995762,0.00025683572,0.00008124285,0.00014476778,0.00010875517,0.6141652,0.0029705344,0.04172077,0.013051743,0.32593694],"study_design_scores_gemma":[0.00007141016,0.000070898306,0.00012698541,0.000011139003,0.000015135917,0.000059964674,0.0000177477,0.97641796,0.00048364545,0.019488102,0.00322959,0.0000073888227],"about_ca_topic_score_codex":0.0035472617,"about_ca_topic_score_gemma":0.004699465,"teacher_disagreement_score":0.009541933,"about_ca_system_score_codex":0.00092278316,"about_ca_system_score_gemma":0.0020585104,"threshold_uncertainty_score":0.03192091},"labels":[],"label_agreement":null},{"id":"W4353070770","doi":"10.1287/ijoc.2023.1287","title":"Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Windsor","funders":"","keywords":"Integer programming; Computer science; Mathematical optimization; Constraint programming; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Schedule; Mathematics; Stochastic programming","score_opus":0.03150559591981477,"score_gpt":0.26215820929267636,"score_spread":0.23065261337286158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353070770","genre_codex":"review","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.015837342,0.5627115,0.33037427,0.031716418,0.003088949,0.0001409945,0.0004909247,0.00067432405,0.054965314],"genre_scores_gemma":[0.19244033,0.3899448,0.38411158,0.005759952,0.011744184,0.00037150297,0.0013080983,0.00072152854,0.013597939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612373,0.0017739601,0.00016874966,0.0005004128,0.0011755705,0.00025757423],"domain_scores_gemma":[0.97326005,0.022775538,0.0005857826,0.0010434224,0.0017743456,0.0005608369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010226671,0.0025448485,0.0018330887,0.002909001,0.0009217361,0.007909136,0.0020714004,0.0028318334,0.007450467],"category_scores_gemma":[0.018990204,0.0011801246,0.002234334,0.006066894,0.0030611197,0.0127264215,0.0019379071,0.007851006,0.0016146924],"study_design_candidate":"simulation_or_modeling","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.00044776523,0.000761541,0.0031094467,0.0030613078,0.00027121167,0.00032908565,0.00035513655,0.12591809,0.0010914581,0.37437576,0.03100426,0.4592749],"study_design_scores_gemma":[0.00008527828,0.00040694006,0.0015957186,0.0020567742,0.00011562517,0.0003268611,0.0005771841,0.45235193,0.0015587948,0.4381811,0.10260036,0.00014342996],"about_ca_topic_score_codex":0.004597524,"about_ca_topic_score_gemma":0.0027188149,"teacher_disagreement_score":0.010226671,"about_ca_system_score_codex":0.0028638248,"about_ca_system_score_gemma":0.002047891,"threshold_uncertainty_score":0.05408442},"labels":[],"label_agreement":null},{"id":"W4361003883","doi":"10.1287/ijoc.2023.1280","title":"Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Ciena (Canada); HEC Montréal","funders":"","keywords":"Computer science; Constraint programming; Column generation; Upgrade; Purchasing; Mathematical optimization; Integer programming; Node (physics); Decomposition; Process (computing); Stochastic programming; Engineering; Mathematics; Algorithm; Operations management","score_opus":0.028400209408477067,"score_gpt":0.2788438215552102,"score_spread":0.25044361214673316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361003883","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.0055072294,0.00022300675,0.9876972,0.00034975997,0.000047953414,0.00011717855,0.00017780616,0.0001354503,0.0057445182],"genre_scores_gemma":[0.12672363,0.00055658276,0.8634573,0.00032940073,0.000101397796,0.00043742007,0.00061434926,0.00018881774,0.0075911735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999252,0.0002822537,0.00003289192,0.00013867511,0.0001832071,0.0001109405],"domain_scores_gemma":[0.9993617,0.0004106567,0.000058193033,0.00003421136,0.0000940445,0.000041299172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014256142,0.0014865452,0.0010058609,0.001174692,0.00075732253,0.0017363077,0.0015640223,0.0014370423,0.007594728],"category_scores_gemma":[0.0019455502,0.0008263423,0.0018606766,0.0012375042,0.0006676236,0.0015369861,0.0012892527,0.0021216322,0.00089236256],"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.000040174018,0.000066480796,0.00035557552,0.000111691166,0.00003291901,0.000077976125,0.000058642247,0.9377523,0.0012312926,0.02672974,0.002497692,0.031045401],"study_design_scores_gemma":[0.000012073262,0.00002145756,0.000060466336,0.00001704959,0.0000098778355,0.000024024774,0.000028256933,0.9830132,0.0003191314,0.014684461,0.0018037484,0.000006275484],"about_ca_topic_score_codex":0.0061303736,"about_ca_topic_score_gemma":0.0076910565,"teacher_disagreement_score":0.007594728,"about_ca_system_score_codex":0.0015658867,"about_ca_system_score_gemma":0.0020344655,"threshold_uncertainty_score":0.025406897},"labels":[],"label_agreement":null},{"id":"W4361221305","doi":"10.1287/ijoc.2023.1288","title":"Decomposition Strategies for Vehicle Routing Heuristics","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Merge (version control); Decomposition; Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Local search (optimization); Decomposition method (queueing theory); Heuristic; Mathematics; Algorithm; Discrete mathematics; Information retrieval","score_opus":0.026847903887107456,"score_gpt":0.3186934770919792,"score_spread":0.29184557320487176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361221305","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.013698385,0.0021752683,0.9677652,0.00036435676,0.000105619074,0.00022730867,0.00011202965,0.00025687978,0.0152950445],"genre_scores_gemma":[0.2612577,0.0026996862,0.72733426,0.00037372689,0.00010510042,0.0006299041,0.00043736582,0.00031407952,0.0068481946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987361,0.00062129565,0.000062890074,0.00013211116,0.00028676618,0.00016079651],"domain_scores_gemma":[0.9982072,0.0011274879,0.000180794,0.00017347006,0.00022671804,0.00008435233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017591086,0.0013663566,0.00081037846,0.0015837952,0.0006014489,0.001579782,0.0009922505,0.0010185029,0.005849528],"category_scores_gemma":[0.006143182,0.00058928516,0.0011789231,0.001651912,0.0009540766,0.0014566047,0.0014174451,0.0017676969,0.0011718236],"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.00010258131,0.000091698545,0.000753263,0.0004331593,0.00009569968,0.000081529375,0.00022714848,0.623009,0.003322619,0.17440456,0.008585936,0.18889274],"study_design_scores_gemma":[0.000059116555,0.00010351084,0.00025421457,0.00016117585,0.00004438677,0.0001113776,0.00011596689,0.868461,0.0012252046,0.11489753,0.014547229,0.000019279361],"about_ca_topic_score_codex":0.0021833791,"about_ca_topic_score_gemma":0.0025386962,"teacher_disagreement_score":0.005849528,"about_ca_system_score_codex":0.0017508443,"about_ca_system_score_gemma":0.001445914,"threshold_uncertainty_score":0.019568682},"labels":[],"label_agreement":null},{"id":"W4365510574","doi":"10.1287/ijoc.2023.1297","title":"Black-Box Attack-Based Security Evaluation Framework for Credit Card Fraud Detection Models","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Black box; Construct (python library); Machine learning; Key (lock); Artificial intelligence; Big data; Joint (building); Computer security; Data mining; Engineering","score_opus":0.07981210267639172,"score_gpt":0.35616892560789665,"score_spread":0.27635682293150493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365510574","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.03953557,0.000387905,0.95691013,0.000721097,0.000040178154,0.00015744161,0.00006653731,0.00027955047,0.0019015849],"genre_scores_gemma":[0.8843566,0.00033629267,0.112925254,0.00020547808,0.00008383657,0.0002406763,0.00018466778,0.000051386425,0.0016157934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944015,0.0033746748,0.00023903088,0.00064156036,0.0010355804,0.00030770717],"domain_scores_gemma":[0.98414004,0.009851606,0.0018444328,0.0013135838,0.002306414,0.00054388953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010723163,0.0017298295,0.0015669112,0.0018692866,0.00072287634,0.0021001496,0.0019472972,0.0022148686,0.0020871777],"category_scores_gemma":[0.023309179,0.00049882894,0.0011344013,0.00067668234,0.0031400286,0.004960894,0.0033691993,0.0033147158,0.00032086062],"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.00020730922,0.00013598018,0.003316622,0.00011236177,0.00012035348,0.00012663752,0.00013672425,0.8860983,0.0021168026,0.063417085,0.0014154509,0.04279628],"study_design_scores_gemma":[0.000004513671,0.000035163484,0.00012182735,0.0000068625427,0.0000061038295,0.000021017011,0.0000066859952,0.98965454,0.0003903261,0.009619583,0.00012686272,0.0000064947167],"about_ca_topic_score_codex":0.001406063,"about_ca_topic_score_gemma":0.000733777,"teacher_disagreement_score":0.010723163,"about_ca_system_score_codex":0.002458938,"about_ca_system_score_gemma":0.0018992373,"threshold_uncertainty_score":0.056710184},"labels":[],"label_agreement":null},{"id":"W4366410391","doi":"10.1287/ijoc.2023.1289","title":"A Prediction-Based Approach for Online Dynamic Appointment Scheduling: A Case Study in Radiotherapy Treatment","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Interpretability; Exploit; Dynamic priority scheduling; Operations research; Mathematical optimization; Operations management; Machine learning","score_opus":0.1463259236610837,"score_gpt":0.45936063993745785,"score_spread":0.31303471627637414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366410391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7380325,0.0014739591,0.2372801,0.0065508126,0.00022915074,0.0004786392,0.00079495704,0.00076639256,0.014393524],"genre_scores_gemma":[0.9362913,0.00039066898,0.059953798,0.00015164033,0.00005942365,0.00010429792,0.0002067643,0.000060381437,0.0027817516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989767,0.00060198666,0.000042764972,0.00011171554,0.00013889455,0.00012800947],"domain_scores_gemma":[0.9941533,0.004850462,0.00021441538,0.00021636824,0.0002778181,0.00028770123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021667692,0.0005390669,0.0005538168,0.0005293258,0.0010815586,0.00091823126,0.0013298165,0.0021328654,0.0040921313],"category_scores_gemma":[0.005976952,0.00033888573,0.0006969954,0.0011350693,0.0005872885,0.0008797671,0.00073791965,0.0015018772,0.00030424586],"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.0005363006,0.0009654659,0.012428765,0.00024652763,0.000068610476,0.0039893626,0.00074047677,0.8827069,0.0022014678,0.011995981,0.00614845,0.07797175],"study_design_scores_gemma":[0.000059999904,0.00015263353,0.0020270506,0.000012007492,0.000017853714,0.00032786326,0.00032435177,0.9890239,0.0009822451,0.004253432,0.0027965393,0.000022057708],"about_ca_topic_score_codex":0.013611524,"about_ca_topic_score_gemma":0.015596073,"teacher_disagreement_score":0.013611524,"about_ca_system_score_codex":0.0017245018,"about_ca_system_score_gemma":0.0012618394,"threshold_uncertainty_score":0.027064621},"labels":[],"label_agreement":null},{"id":"W4376277151","doi":"10.1287/ijoc.2022.0090","title":"Learning for Spatial Branching: An Algorithm Selection Approach","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Branching (polymer chemistry); Algorithm; Christian ministry; Artificial intelligence; Machine learning; Context (archaeology)","score_opus":0.021761022975442072,"score_gpt":0.2951156799378986,"score_spread":0.27335465696245653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376277151","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.007425815,0.00034121145,0.98783815,0.00041233914,0.00004459019,0.00012476192,0.00003896264,0.00084233534,0.002931788],"genre_scores_gemma":[0.24757548,0.0004766758,0.74511874,0.0006309056,0.00026329962,0.00057943515,0.00040451845,0.00048556752,0.0044654193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611604,0.0018100862,0.00019131946,0.00064137945,0.00090061757,0.00034060306],"domain_scores_gemma":[0.9884968,0.008035735,0.00068572746,0.0010358016,0.0012988048,0.00044720696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005609752,0.0015104961,0.0019479564,0.0022910459,0.00087325444,0.0018980895,0.003571936,0.0019989412,0.007820109],"category_scores_gemma":[0.016088754,0.0007792959,0.0017651897,0.0021444336,0.001497943,0.0032034758,0.0029714748,0.0033431323,0.0022165056],"study_design_candidate":"simulation_or_modeling","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.0003942661,0.00043846885,0.003716667,0.0002916078,0.00015404451,0.00023628051,0.00026044107,0.33709985,0.0030225758,0.081266694,0.009467347,0.5636518],"study_design_scores_gemma":[0.000054098342,0.00009162191,0.00009977783,0.000023945833,0.000024533267,0.000049654172,0.000022596643,0.9669261,0.000716853,0.030552821,0.0014304494,0.0000075493836],"about_ca_topic_score_codex":0.0012950012,"about_ca_topic_score_gemma":0.0018568848,"teacher_disagreement_score":0.007820109,"about_ca_system_score_codex":0.0013975059,"about_ca_system_score_gemma":0.0028689299,"threshold_uncertainty_score":0.029667556},"labels":[],"label_agreement":null},{"id":"W4378219327","doi":"10.1287/ijoc.2022.0185","title":"Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Heuristic; Greedy algorithm; Bilevel optimization; Operations research; Electric vehicle; Charging station; Greedy randomized adaptive search procedure; Frame (networking); Optimization problem; Algorithm; Artificial intelligence; Engineering; Mathematics; Power (physics)","score_opus":0.015850565749374133,"score_gpt":0.25709505922939313,"score_spread":0.241244493480019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378219327","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.019729124,0.0003688039,0.97190213,0.00047472943,0.00005578428,0.000109471526,0.0002985725,0.00011728519,0.0069440356],"genre_scores_gemma":[0.6877187,0.0010243923,0.29515544,0.00017955882,0.00008098677,0.00060353643,0.0004888617,0.00014711962,0.014601377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.0005820584,0.00003772312,0.00017501412,0.00021764457,0.00016314884],"domain_scores_gemma":[0.9973979,0.002014919,0.00022444551,0.00007543903,0.00016053682,0.00012674571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018553761,0.0012091092,0.0016397935,0.0008023989,0.00041351808,0.0022737535,0.0014509908,0.0018246371,0.005507952],"category_scores_gemma":[0.0045658015,0.0012251909,0.0015625927,0.0014314286,0.0010334512,0.0013948638,0.0013698504,0.0017923855,0.0005037788],"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.000011940329,0.000010293551,0.00011827896,0.000026180755,0.000008408605,0.000019966143,0.000013126486,0.99242014,0.00009458924,0.005314608,0.00017739847,0.0017851051],"study_design_scores_gemma":[0.0000073015435,0.000010972106,0.00003662901,0.0000061612245,0.000003621054,0.0000055503638,0.000007782088,0.9949244,0.000067762,0.0045090946,0.00041725306,0.0000034063792],"about_ca_topic_score_codex":0.008155492,"about_ca_topic_score_gemma":0.007396489,"teacher_disagreement_score":0.008155492,"about_ca_system_score_codex":0.0021378289,"about_ca_system_score_gemma":0.0020854175,"threshold_uncertainty_score":0.018425941},"labels":[],"label_agreement":null},{"id":"W4384161751","doi":"10.1287/ijoc.2021.0138","title":"Overload-Checking and Edge-Finding for Robust Cumulative Scheduling","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Schedule; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04248921437303536,"score_gpt":0.2846047074638869,"score_spread":0.24211549309085154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384161751","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.0082208,0.00007156193,0.9888176,0.00007193614,0.000026000824,0.000053905227,0.00007193093,0.001694905,0.0009714812],"genre_scores_gemma":[0.20593226,0.00015891432,0.79121256,0.00011585501,0.000062471736,0.00014767224,0.0004335625,0.0006011164,0.0013355728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686795,0.000725307,0.00026877417,0.00078335166,0.0009898609,0.00036462324],"domain_scores_gemma":[0.99068505,0.004263879,0.0010886289,0.00289153,0.00080255617,0.0002682894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034891344,0.0014406869,0.0009271857,0.0015537522,0.0009491818,0.0018639332,0.0027577851,0.0009878549,0.00429326],"category_scores_gemma":[0.013092874,0.0006575102,0.0018788555,0.0019936487,0.0014804016,0.0034026674,0.002111804,0.0022744364,0.0007610578],"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.00038700874,0.0002174819,0.0016397306,0.00039368888,0.00011096173,0.00014427971,0.0002120094,0.5603482,0.013240751,0.112948865,0.004313674,0.30604324],"study_design_scores_gemma":[0.000026350692,0.0000636268,0.00020494354,0.000024881494,0.000029875453,0.000050512743,0.000024347804,0.94051653,0.00770259,0.048001148,0.003328701,0.000026572388],"about_ca_topic_score_codex":0.0054903547,"about_ca_topic_score_gemma":0.004493544,"teacher_disagreement_score":0.0054903547,"about_ca_system_score_codex":0.0019152536,"about_ca_system_score_gemma":0.004041827,"threshold_uncertainty_score":0.018452525},"labels":[],"label_agreement":null},{"id":"W4386139117","doi":"10.1287/ijoc.2022.0257","title":"A Numerically Exact Algorithm for the Bin-Packing Problem","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bin packing problem; Algorithm; Computation; Enumeration; Set (abstract data type); Branch and cut; Bin; Exact solutions in general relativity; Integer (computer science); Mathematical optimization; Branch and bound; Set packing; Mathematics; Integer programming; Point (geometry); Key (lock); Computer science; Discrete mathematics","score_opus":0.019442804090740434,"score_gpt":0.25731050925298976,"score_spread":0.23786770516224934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386139117","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.0024745234,0.0001319372,0.99138194,0.00019133891,0.0000759203,0.00010496343,0.00008803147,0.0008623182,0.004689007],"genre_scores_gemma":[0.03616528,0.0001694062,0.9605789,0.000108213055,0.000043362295,0.00026217432,0.00026520126,0.00023798845,0.0021694675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903774,0.00018238497,0.000051768522,0.00020615077,0.0003956055,0.00012626644],"domain_scores_gemma":[0.9986619,0.0006541365,0.00010159238,0.0002790152,0.00024357314,0.00005987991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009107144,0.0012667056,0.0012703182,0.0010290801,0.0008943131,0.002223572,0.0021234713,0.0017335552,0.016458424],"category_scores_gemma":[0.0053812056,0.0006277637,0.0009536585,0.0016913562,0.000913387,0.002275994,0.0020607547,0.0028530986,0.0046174484],"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.00016687256,0.00022886563,0.00069799874,0.00037795887,0.00005409353,0.00014013983,0.00016347518,0.4184795,0.0055306787,0.10727114,0.015764851,0.45112443],"study_design_scores_gemma":[0.000057142228,0.000045881323,0.00010140043,0.00003228736,0.000011747606,0.00009763737,0.000030024179,0.93828577,0.0013505503,0.052692056,0.0072801015,0.000015378713],"about_ca_topic_score_codex":0.0029787633,"about_ca_topic_score_gemma":0.003527489,"teacher_disagreement_score":0.016458424,"about_ca_system_score_codex":0.0013575921,"about_ca_system_score_gemma":0.0028958528,"threshold_uncertainty_score":0.055058897},"labels":[],"label_agreement":null},{"id":"W4386326396","doi":"10.1287/ijoc.2022.0175","title":"Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Operations research; Integer (computer science); Knapsack problem; Integer programming; Mathematical optimization; Container (type theory); Mathematics; Algorithm; Engineering","score_opus":0.02120533820114971,"score_gpt":0.2735105454951502,"score_spread":0.25230520729400047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386326396","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.019998647,0.00024040545,0.97587013,0.00031532787,0.000043180164,0.00009138304,0.00009473179,0.0009630453,0.0023831385],"genre_scores_gemma":[0.44451097,0.00015887362,0.55173904,0.0004178431,0.000087826156,0.0003549853,0.0004660279,0.00022089813,0.0020436482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840933,0.00061412406,0.00007257661,0.0003970941,0.0003210872,0.00018575181],"domain_scores_gemma":[0.9905094,0.0066166646,0.0011447545,0.0008562383,0.00061395083,0.0002589158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002585461,0.0013184362,0.0016967996,0.0011183114,0.00057909184,0.0015835847,0.0026554756,0.0017581542,0.0037845334],"category_scores_gemma":[0.01182792,0.0009137958,0.0012163683,0.0011803692,0.0016045145,0.0023786123,0.0016357306,0.002929221,0.0008062468],"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.00012839113,0.00013989353,0.0010251009,0.00010906083,0.000038195187,0.00004087753,0.00006218295,0.917222,0.0006165952,0.013400148,0.0018734375,0.06534414],"study_design_scores_gemma":[0.000015024207,0.00002844936,0.000043980817,0.000008934044,0.000002985577,0.0000055986625,0.000007263146,0.9931433,0.00015127817,0.0063549886,0.00023534648,0.0000028405154],"about_ca_topic_score_codex":0.0049043535,"about_ca_topic_score_gemma":0.0067956876,"teacher_disagreement_score":0.0049043535,"about_ca_system_score_codex":0.0016783391,"about_ca_system_score_gemma":0.0028683436,"threshold_uncertainty_score":0.013673365},"labels":[],"label_agreement":null},{"id":"W4390050685","doi":"10.1287/ijoc.2022.0263","title":"Supervised ML for Solving the <i>GI</i>/<i>GI</i>/1 Queue","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Queue; Queueing theory; Computer science; Range (aeronautics); Stationary distribution; Artificial neural network; Distribution (mathematics); Service (business); Sample (material); Operations research; Artificial intelligence; Algorithm; Mathematics; Machine learning; Engineering; Computer network","score_opus":0.024105996355344658,"score_gpt":0.2610686845859325,"score_spread":0.23696268823058786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390050685","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.08152233,0.00060787064,0.90938497,0.0015095547,0.00013218744,0.0001295898,0.0005760472,0.0033775712,0.0027597942],"genre_scores_gemma":[0.6348358,0.00022783151,0.35640827,0.0007607639,0.00034491115,0.00032429633,0.0016561262,0.0003155577,0.0051265587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.0002117013,0.000042586355,0.00025284372,0.00011336094,0.00009967024],"domain_scores_gemma":[0.9947307,0.0036438827,0.00045921537,0.00041093022,0.00057161174,0.00018364612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018568999,0.0009977225,0.0010965546,0.0006727005,0.00062437507,0.001007472,0.0027771113,0.0017160805,0.0020041277],"category_scores_gemma":[0.0070689176,0.0006412055,0.0008856855,0.00070623256,0.0008735708,0.001466066,0.0011882546,0.003199819,0.00048753354],"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.00015795919,0.00023295415,0.0032641832,0.00016600841,0.00008521966,0.00008066958,0.00008300203,0.8711274,0.0010500143,0.007660647,0.006237504,0.109854296],"study_design_scores_gemma":[0.000005345804,0.000007945559,0.00007591137,0.0000024175433,0.000001708545,0.0000030729036,0.0000037820148,0.99737394,0.00015937637,0.002282418,0.00008244857,0.0000015664308],"about_ca_topic_score_codex":0.012247284,"about_ca_topic_score_gemma":0.015921304,"teacher_disagreement_score":0.012247284,"about_ca_system_score_codex":0.0020206326,"about_ca_system_score_gemma":0.0029345066,"threshold_uncertainty_score":0.024352014},"labels":[],"label_agreement":null},{"id":"W4390539045","doi":"10.1287/ijoc.2022.0010","title":"A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Solver; Mathematical optimization; Computer science; Ambiguity; Newsvendor model; Column generation; Linear programming; Event (particle physics); Operations research; Mathematics","score_opus":0.2094707748557991,"score_gpt":0.398550081017716,"score_spread":0.1890793061619169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390539045","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.0047405735,0.0001539497,0.9934501,0.00015505434,0.000040381583,0.00007851359,0.00007899148,0.00017224194,0.001130156],"genre_scores_gemma":[0.3367112,0.00053926796,0.6554166,0.0004865932,0.00020939551,0.0005787813,0.0008278306,0.0003065947,0.004923776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830556,0.0008637681,0.000088789086,0.0002816458,0.0002846857,0.00017560282],"domain_scores_gemma":[0.9943973,0.0037878568,0.00048838934,0.0004424863,0.00060569943,0.0002782575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033595946,0.0015660602,0.0016651835,0.0007169197,0.0005775157,0.0015091196,0.0016930599,0.0015570305,0.00633542],"category_scores_gemma":[0.008521216,0.0008091192,0.0012193107,0.0009915592,0.0011933515,0.0018839702,0.0018792454,0.002878426,0.0012221128],"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.00017842864,0.00011648636,0.0005637161,0.00014613534,0.000060517912,0.00015018521,0.00009930386,0.88760775,0.0018491596,0.042044938,0.0039210306,0.06326235],"study_design_scores_gemma":[0.000021673934,0.000037604234,0.000042200256,0.0000100398665,0.0000072708403,0.000022495602,0.000011564646,0.98543835,0.0004009665,0.013467378,0.00053313933,0.0000071745258],"about_ca_topic_score_codex":0.0016959123,"about_ca_topic_score_gemma":0.0017687179,"teacher_disagreement_score":0.00633542,"about_ca_system_score_codex":0.0008869374,"about_ca_system_score_gemma":0.0014310946,"threshold_uncertainty_score":0.02119404},"labels":[],"label_agreement":null},{"id":"W4392704563","doi":"10.1287/ijoc.2021.0186","title":"A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; University of Alberta; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bounding overwatch; Dual (grammatical number); Mathematical optimization; Binary number; Quadratic equation; Mathematics; Quadratic programming; Computer science; Arithmetic; Artificial intelligence","score_opus":0.029879238130132633,"score_gpt":0.33712413251070306,"score_spread":0.3072448943805704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392704563","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.0018534551,0.00025950558,0.99229807,0.00018943258,0.000058972684,0.00003332631,0.00005405856,0.00012497349,0.005128275],"genre_scores_gemma":[0.18730819,0.00076839386,0.8026375,0.00037301853,0.00024304977,0.0003097964,0.00038853448,0.000499843,0.0074716746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984902,0.0005621627,0.00004602163,0.00019380818,0.0005430076,0.00016467688],"domain_scores_gemma":[0.9985116,0.00078415923,0.000113238784,0.00018690157,0.00029739,0.00010681757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022045476,0.0012727894,0.0009954429,0.00089761126,0.00057914865,0.0015823187,0.0017388859,0.00097178906,0.00848798],"category_scores_gemma":[0.005233087,0.0006008848,0.0010826982,0.0014287736,0.0012125307,0.0018091429,0.0024478692,0.0031539763,0.0014524914],"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.000086526685,0.00008635876,0.0004099018,0.00023218797,0.000037761765,0.0001326514,0.00012415955,0.5255317,0.0030555439,0.3628847,0.01143956,0.09597896],"study_design_scores_gemma":[0.000017141228,0.000026132839,0.000060530656,0.00003015589,0.000008945214,0.00003924257,0.0000145404965,0.9239019,0.0007899634,0.06917072,0.0059321634,0.00000855795],"about_ca_topic_score_codex":0.0023897986,"about_ca_topic_score_gemma":0.0023757662,"teacher_disagreement_score":0.00848798,"about_ca_system_score_codex":0.0014069236,"about_ca_system_score_gemma":0.0018478095,"threshold_uncertainty_score":0.028395116},"labels":[],"label_agreement":null},{"id":"W4393307376","doi":"10.1287/ijoc.2023.0128","title":"Computing Bipath Multicommodity Flows with Constraint Programming–Based Branch-and-Price-and-Cut","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Branch and cut; Mathematical optimization; Branch and price; Constraint programming; Branch and bound; Constraint (computer-aided design); Computer science; Integer programming; Mathematics; Operations research; Stochastic programming","score_opus":0.012279779361066251,"score_gpt":0.23844038332845285,"score_spread":0.2261606039673866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393307376","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.013579139,0.00026720672,0.9789834,0.00035737766,0.000064437605,0.0001573088,0.00038474464,0.0010823286,0.0051241],"genre_scores_gemma":[0.101484954,0.0002857159,0.8941969,0.00016388817,0.000051835315,0.00033352964,0.00094005774,0.00035612303,0.0021868974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00027282207,0.00004542691,0.00022249385,0.00027938376,0.00016640262],"domain_scores_gemma":[0.9979195,0.0013022678,0.00015916758,0.0001772217,0.00030554188,0.00013634413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014779535,0.0018470013,0.0015319866,0.0014086592,0.0010787977,0.0028599426,0.0024564865,0.0019536354,0.0075522396],"category_scores_gemma":[0.005484893,0.0010310109,0.0015245846,0.002622153,0.00096558116,0.0022148222,0.0017287823,0.0023656907,0.0013381438],"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.00005729538,0.000087221,0.000460077,0.00014011149,0.00004823632,0.00008335968,0.000049918475,0.92878705,0.0009250304,0.014574835,0.00409732,0.050689533],"study_design_scores_gemma":[0.000012614814,0.000011698839,0.000030327154,0.000006813734,0.000005142619,0.000010136771,0.0000113871165,0.9915275,0.0002621953,0.0073942333,0.00072382885,0.0000041923668],"about_ca_topic_score_codex":0.01530828,"about_ca_topic_score_gemma":0.017272659,"teacher_disagreement_score":0.01530828,"about_ca_system_score_codex":0.0017865449,"about_ca_system_score_gemma":0.003680007,"threshold_uncertainty_score":0.030438364},"labels":[],"label_agreement":null},{"id":"W4399432475","doi":"10.1287/ijoc.2023.0059","title":"Ranking Decomposition for the Discrete Ordered Median Problem","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Heuristics; Integer (computer science); Rank (graph theory); Ranking (information retrieval); Discrete mathematics; Computer science; Mathematical optimization; Artificial intelligence","score_opus":0.022655695787495385,"score_gpt":0.28345657969675664,"score_spread":0.26080088390926126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399432475","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.010202722,0.0008762657,0.9686692,0.0009773377,0.00016106537,0.00022818244,0.0008073504,0.00059250515,0.01748545],"genre_scores_gemma":[0.2216853,0.0015791416,0.7546673,0.0006126271,0.00041460208,0.00087759545,0.0027474193,0.0005277279,0.016888298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980969,0.0007112938,0.0000877338,0.00037543062,0.0004602281,0.0002685302],"domain_scores_gemma":[0.9976059,0.0014755521,0.0002289255,0.00019386863,0.00028687937,0.0002089067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024521728,0.0018497751,0.0021430198,0.0013530523,0.00075953815,0.0029991216,0.0019066591,0.0016295027,0.01780318],"category_scores_gemma":[0.0059700664,0.0006078714,0.0014909045,0.0024264222,0.0008858433,0.0028615026,0.0018556231,0.002977193,0.0029231426],"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.00032166898,0.00033506085,0.0007365046,0.00081997825,0.0001021228,0.00016841959,0.00014040909,0.5988955,0.0013708022,0.19122942,0.03311827,0.1727619],"study_design_scores_gemma":[0.000072443276,0.00010518443,0.0001912095,0.000060966362,0.000027849763,0.000080670936,0.00007571896,0.85157984,0.0005053875,0.13838516,0.008895987,0.000019652192],"about_ca_topic_score_codex":0.0024845162,"about_ca_topic_score_gemma":0.0034590566,"teacher_disagreement_score":0.01780318,"about_ca_system_score_codex":0.0022943332,"about_ca_system_score_gemma":0.0027362693,"threshold_uncertainty_score":0.059557617},"labels":[],"label_agreement":null},{"id":"W4399574839","doi":"10.1287/ijoc.2022.0392","title":"Efficient Nested Simulation Experiment Design via the Likelihood Ratio Method","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Estimator; Computer science; Mean squared error; Software; Statistics; Mathematics; Programming language","score_opus":0.11110105900908705,"score_gpt":0.42762380229875063,"score_spread":0.31652274328966357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399574839","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.0024303966,0.00009126538,0.9957165,0.000094457006,0.000026592383,0.0005834969,0.00007244322,0.00030623574,0.0006786405],"genre_scores_gemma":[0.08670274,0.00014037151,0.9075402,0.00015041008,0.000043895227,0.0042021153,0.00018846589,0.00015418883,0.0008776894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.92371696,0.06683546,0.0012369949,0.0036812627,0.0037482905,0.00078091054],"domain_scores_gemma":[0.90024936,0.08394778,0.00525617,0.0058984463,0.0035066756,0.0011415539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.055718757,0.0021547906,0.0032987094,0.0019128178,0.0007566311,0.0024220576,0.0038784367,0.002092664,0.010299834],"category_scores_gemma":[0.1263262,0.0015312146,0.002360259,0.0017240882,0.0026441517,0.003137834,0.003955734,0.0037983728,0.001863981],"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.0029832425,0.0008896431,0.0052690264,0.00140294,0.0011333947,0.0004528465,0.0008739757,0.43516013,0.006589283,0.29103532,0.0031930888,0.25101718],"study_design_scores_gemma":[0.0007889139,0.0012487544,0.001155439,0.00014699456,0.00020650233,0.00009576537,0.00007184818,0.8384698,0.0034001316,0.14901853,0.005288381,0.00010902123],"about_ca_topic_score_codex":0.0011821638,"about_ca_topic_score_gemma":0.001136373,"teacher_disagreement_score":0.055718757,"about_ca_system_score_codex":0.0020100083,"about_ca_system_score_gemma":0.0038982932,"threshold_uncertainty_score":0.2946725},"labels":[],"label_agreement":null},{"id":"W4400652020","doi":"10.1287/ijoc.2023.0280","title":"A Model-Free Approach for Solving Choice-Based Competitive Facility Location Problems Using Simulation and Submodularity","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Facility location problem; Mathematical optimization; Operations research; Mathematics","score_opus":0.05482827226882548,"score_gpt":0.2874064715621021,"score_spread":0.2325781992932766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400652020","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.0064494736,0.000104947634,0.99164116,0.00018880522,0.000014109962,0.00006388956,0.000060395698,0.00013540521,0.0013417779],"genre_scores_gemma":[0.39639667,0.00033280722,0.5985777,0.00027815014,0.00007753575,0.0008397388,0.0004563243,0.00015615088,0.0028849554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808204,0.0010800831,0.000056534533,0.00029422448,0.00032122905,0.0001659025],"domain_scores_gemma":[0.9913051,0.007294765,0.0004964461,0.00034071397,0.00034447273,0.00021846606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031599998,0.0017936988,0.002425273,0.00151217,0.0007611256,0.0015780855,0.0026245473,0.0018574531,0.0042743064],"category_scores_gemma":[0.010744241,0.0013682839,0.0025753728,0.0016600428,0.0018649857,0.0018402936,0.0022046473,0.0029723647,0.0004279422],"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.000020834783,0.00003361738,0.0002054312,0.000035806268,0.00002430855,0.0000154392,0.000021785494,0.9817467,0.00012988946,0.012642993,0.000209243,0.004913981],"study_design_scores_gemma":[0.0000066515754,0.0000110385545,0.000014927204,0.000003822656,0.0000029475066,0.000003840678,0.0000037708423,0.99184567,0.0000512495,0.007896612,0.00015738679,0.0000021374333],"about_ca_topic_score_codex":0.0074100564,"about_ca_topic_score_gemma":0.007712868,"teacher_disagreement_score":0.0074100564,"about_ca_system_score_codex":0.0023174249,"about_ca_system_score_gemma":0.0031529749,"threshold_uncertainty_score":0.016814172},"labels":[],"label_agreement":null},{"id":"W4401084216","doi":"10.1287/ijoc.2023.0106","title":"AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Iterated local search; Mathematical optimization; Scale (ratio); Heuristic; Computer science; Local search (optimization); Routing (electronic design automation); Iterated function; Mathematics; Geography","score_opus":0.02699017078605199,"score_gpt":0.2916248504667616,"score_spread":0.26463467968070964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401084216","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.053137343,0.0014412833,0.92972034,0.00048232396,0.00017724866,0.00039084454,0.00026188183,0.002087465,0.012301355],"genre_scores_gemma":[0.48451284,0.00063720037,0.5060305,0.0004644012,0.000099009914,0.0008396058,0.00085420976,0.00041944892,0.006142925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994074,0.00022939971,0.000027615195,0.00009507188,0.00014095541,0.00009951369],"domain_scores_gemma":[0.9991091,0.0005499524,0.00008962242,0.000054383014,0.000116556286,0.00008043285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235718,0.0013342096,0.0012903658,0.0011857711,0.00048704632,0.0009232246,0.0022784478,0.0013651092,0.003173657],"category_scores_gemma":[0.0017826164,0.0005684315,0.0013252124,0.0012210017,0.0006253264,0.0009833304,0.001273975,0.0012337168,0.0005495918],"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.00008003585,0.00011065991,0.0003915587,0.00016885388,0.00007653661,0.000116236995,0.00006838534,0.9355017,0.001308245,0.004839508,0.0032362367,0.054102175],"study_design_scores_gemma":[0.000048344653,0.000067555746,0.00007223261,0.000013729667,0.000018738223,0.000026551108,0.000024183637,0.9958477,0.00034661024,0.0021368298,0.0013882729,0.000009254445],"about_ca_topic_score_codex":0.004852561,"about_ca_topic_score_gemma":0.0053120162,"teacher_disagreement_score":0.004852561,"about_ca_system_score_codex":0.00086554134,"about_ca_system_score_gemma":0.0017460337,"threshold_uncertainty_score":0.010616899},"labels":[],"label_agreement":null},{"id":"W4402125184","doi":"10.1287/ijoc.2023.0404","title":"The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Multigraph; Vehicle routing problem; Scheduling (production processes); Computer science; Parallel computing; Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science","score_opus":0.010682196198372724,"score_gpt":0.25409578791987375,"score_spread":0.24341359172150104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402125184","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.17187728,0.00081232254,0.7940673,0.0028129623,0.00021248151,0.0004717067,0.0039556245,0.0007372295,0.025053095],"genre_scores_gemma":[0.56275827,0.0011631139,0.41122898,0.00048696646,0.00017369054,0.00041335597,0.0038337049,0.00037761062,0.019564372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992217,0.0002757371,0.00003197513,0.00024102893,0.00009863048,0.00013095133],"domain_scores_gemma":[0.99863094,0.0009878114,0.00013149607,0.00007372984,0.00007396436,0.000101994716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077046826,0.0011205161,0.00091341144,0.0007417536,0.0009110521,0.0013820832,0.0012166081,0.0016746847,0.009378132],"category_scores_gemma":[0.0022907625,0.0005688418,0.0010660025,0.001912462,0.00066148624,0.0022629953,0.0010693916,0.0012024111,0.0009472932],"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.00021262812,0.00018115278,0.0011633378,0.00037282574,0.00008262736,0.00046740397,0.00018945853,0.90465003,0.0026259962,0.04046879,0.009551987,0.040033653],"study_design_scores_gemma":[0.00005201863,0.00008218711,0.0008918638,0.000031266398,0.00003997786,0.00019517975,0.0001770374,0.94473284,0.0011122546,0.042809475,0.009856436,0.000019373003],"about_ca_topic_score_codex":0.0072148885,"about_ca_topic_score_gemma":0.009311055,"teacher_disagreement_score":0.009378132,"about_ca_system_score_codex":0.0017400675,"about_ca_system_score_gemma":0.0013872854,"threshold_uncertainty_score":0.031372964},"labels":[],"label_agreement":null},{"id":"W4402173713","doi":"10.1287/ijoc.2024.ed.v36.n4.2","title":"Introduction to the Special Section on Software Tools for Vehicle Routing","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Section (typography); Vehicle routing problem; Software; Computer science; Special section; Routing (electronic design automation); Operations research; Software engineering; Programming language; Engineering; Operating system; Computer network","score_opus":0.019897295886963894,"score_gpt":0.2580089082659331,"score_spread":0.2381116123789692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402173713","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001671623,0.16954964,0.50864273,0.018548384,0.17506905,0.0003196521,0.001712069,0.0065586516,0.117928155],"genre_scores_gemma":[0.015075567,0.20445327,0.16086893,0.017059624,0.2661599,0.0005527023,0.0057770326,0.007937226,0.3221157],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817026,0.0003101068,0.0002579897,0.00045262155,0.0006662407,0.00014284306],"domain_scores_gemma":[0.99333465,0.0035595598,0.00023472088,0.00075695233,0.0016401254,0.00047394712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018482343,0.0025221414,0.0020576906,0.0053906306,0.00086238666,0.004076606,0.0019166487,0.0029646028,0.06515691],"category_scores_gemma":[0.0062837233,0.0011274978,0.0018924004,0.005933274,0.0014720333,0.0065204203,0.0024271752,0.006057875,0.042062312],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004106301,0.00012672046,0.0003104092,0.0009305382,0.000038572183,0.00017395074,0.000107627304,0.0019249818,0.0026180611,0.02952958,0.5912815,0.37291697],"study_design_scores_gemma":[0.0000062407694,0.00006114086,0.00035909162,0.00043584884,0.000016934364,0.00045250083,0.000025112913,0.0017287735,0.00056355767,0.01808825,0.9782301,0.00003252913],"about_ca_topic_score_codex":0.0009852396,"about_ca_topic_score_gemma":0.0016851521,"teacher_disagreement_score":0.06515691,"about_ca_system_score_codex":0.0009919986,"about_ca_system_score_gemma":0.0010186398,"threshold_uncertainty_score":0.21797156},"labels":[],"label_agreement":null},{"id":"W4402574380","doi":"10.1287/ijoc.2022.0197","title":"Forecasting Urban Traffic States with Sparse Data Using Hankel Temporal Matrix Factorization","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Matrix decomposition; Hankel matrix; Sparse matrix; Factorization; Matrix (chemical analysis); Computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics","score_opus":0.046783713349534704,"score_gpt":0.2727161973059038,"score_spread":0.22593248395636908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402574380","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.059673045,0.00043173923,0.9375162,0.0005513688,0.00011469916,0.000036337216,0.00045741608,0.00033950259,0.0008797624],"genre_scores_gemma":[0.7755902,0.0008965491,0.21826477,0.00018619673,0.00026441063,0.00012016193,0.0020058998,0.00007982563,0.002591978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958235,0.00012018378,0.000023068596,0.0001353889,0.00008434762,0.000054629592],"domain_scores_gemma":[0.99823004,0.0011933282,0.000188544,0.00010371854,0.00023244892,0.000052058047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011706259,0.00069758086,0.0007230586,0.0006961553,0.00043764093,0.00084854674,0.00070659583,0.00088758545,0.0010068412],"category_scores_gemma":[0.0048494763,0.00042903607,0.0008631331,0.0011005722,0.0005122933,0.0013574357,0.00053421274,0.0016437577,0.00029081112],"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.00008362763,0.00005970035,0.004269736,0.00007764281,0.00006278012,0.00012693113,0.000116968564,0.9024816,0.0024582504,0.008425698,0.0030925074,0.07874459],"study_design_scores_gemma":[0.0000014701532,0.000004075748,0.00024698698,0.0000020237928,0.0000027091312,0.000004907802,0.000005866368,0.99738985,0.00009969208,0.002064826,0.00017451994,0.0000030748347],"about_ca_topic_score_codex":0.019752944,"about_ca_topic_score_gemma":0.019204956,"teacher_disagreement_score":0.019752944,"about_ca_system_score_codex":0.00063929835,"about_ca_system_score_gemma":0.0009932687,"threshold_uncertainty_score":0.039275944},"labels":[],"label_agreement":null},{"id":"W4403099496","doi":"10.1287/ijoc.2024.0603","title":"Domain-Independent Dynamic Programming and Constraint Programming Approaches for Assembly Line Balancing Problems with Setups","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Computer science; Dynamic programming; Domain (mathematical analysis); Assembly line; Constraint logic programming; Mathematical optimization; Constraint satisfaction; Reactive programming; Constraint (computer-aided design); Concurrent constraint logic programming; Inductive programming; Line (geometry); Algorithm; Programming paradigm; Programming language; Stochastic programming; Mathematics; Artificial intelligence; Engineering","score_opus":0.013244746460027991,"score_gpt":0.23323814109117272,"score_spread":0.21999339463114473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403099496","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.0033541138,0.00051051105,0.9906771,0.0003726292,0.000078785044,0.00006237536,0.00015030333,0.00015657881,0.0046375426],"genre_scores_gemma":[0.19838949,0.0022595895,0.78900313,0.0003817948,0.00025462697,0.00056131574,0.0006986993,0.00027814985,0.008173166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988462,0.00038707457,0.000045429268,0.00025812897,0.00028682838,0.00017621375],"domain_scores_gemma":[0.9985024,0.0009993972,0.00014403643,0.00009812534,0.0001724775,0.00008367403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106105,0.0021125225,0.0011417635,0.0009988329,0.00064193225,0.0019527226,0.002767651,0.0014400779,0.006169854],"category_scores_gemma":[0.0029031688,0.00125963,0.0021260667,0.0021035941,0.0011336391,0.002170115,0.0013407002,0.003772545,0.00074671215],"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.000022837414,0.00004294669,0.00011812903,0.00012243303,0.000032948567,0.000047659578,0.000031528678,0.939635,0.00037335994,0.034522325,0.0017998738,0.02325089],"study_design_scores_gemma":[0.000011951955,0.000018539375,0.000040155493,0.000015762444,0.000010215106,0.000015970103,0.0000121174535,0.97727305,0.00020193637,0.019757563,0.0026347179,0.000007949283],"about_ca_topic_score_codex":0.0101305265,"about_ca_topic_score_gemma":0.010220172,"teacher_disagreement_score":0.0101305265,"about_ca_system_score_codex":0.0019321386,"about_ca_system_score_gemma":0.0030808933,"threshold_uncertainty_score":0.020640194},"labels":[],"label_agreement":null},{"id":"W4403344678","doi":"10.1287/ijoc.2024.0938","title":"A Column Generation Algorithm with Dynamic Constraint Aggregation for Minimum Sum-of-Squares Clustering","year":2025,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column (typography); Column generation; Cluster analysis; Constraint (computer-aided design); Explained sum of squares; Mathematical optimization; Algorithm; Computer science; Least-squares function approximation; Mathematics; Combinatorics; Artificial intelligence; Statistics","score_opus":0.030440264737981348,"score_gpt":0.32754724705520116,"score_spread":0.2971069823172198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403344678","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.004605762,0.00017412567,0.9914205,0.00014107974,0.00006845574,0.000083424355,0.00011914825,0.0010412623,0.0023463517],"genre_scores_gemma":[0.092677094,0.00014302233,0.90277004,0.00019773481,0.000074421754,0.00025694133,0.0006703038,0.00040419344,0.0028061029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.00017047903,0.00003172525,0.00013896404,0.00023386408,0.0000820627],"domain_scores_gemma":[0.9988681,0.00050855713,0.00008234333,0.00014795587,0.00031849663,0.0000744499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007311755,0.0014185997,0.0010548267,0.00093552034,0.0008620269,0.001161712,0.0014957642,0.0011250848,0.006464105],"category_scores_gemma":[0.002677581,0.00053062686,0.0008900915,0.0015945361,0.000568983,0.0009292786,0.0014925906,0.0016678046,0.0019681493],"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.00012495248,0.00010668219,0.00061643636,0.00015916718,0.00006264648,0.00015730156,0.00014702514,0.73762274,0.006682961,0.0130909495,0.016017279,0.2252118],"study_design_scores_gemma":[0.000020026024,0.000023660668,0.000056854118,0.0000061160263,0.000005727367,0.000032438988,0.000015305786,0.9941016,0.000971538,0.0029681514,0.0017905527,0.000007955097],"about_ca_topic_score_codex":0.0071677957,"about_ca_topic_score_gemma":0.010229808,"teacher_disagreement_score":0.0071677957,"about_ca_system_score_codex":0.0007394105,"about_ca_system_score_gemma":0.0019160139,"threshold_uncertainty_score":0.021624565},"labels":[],"label_agreement":null},{"id":"W4403866820","doi":"10.1287/ijoc.2024.0570","title":"Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Computer science; Mathematical optimization; Mathematics; Algorithm; Statistical physics; Physics","score_opus":0.023030249055143663,"score_gpt":0.3802033143685409,"score_spread":0.3571730653133972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403866820","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.0020888865,0.00009997027,0.9936965,0.000102167025,0.00005195632,0.000041292988,0.00004663992,0.00047379706,0.0033987393],"genre_scores_gemma":[0.059012104,0.0001424736,0.9371018,0.00010087775,0.000043268185,0.00024167441,0.00013975722,0.00060961244,0.002608491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988734,0.00044652374,0.000056477686,0.00008596794,0.00044075254,0.000096945485],"domain_scores_gemma":[0.9966672,0.0021661427,0.0001573721,0.00031801042,0.0005742746,0.00011705188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019354378,0.0011397825,0.0012547654,0.0008697034,0.00074218103,0.0013163057,0.0021899212,0.0014830275,0.012326251],"category_scores_gemma":[0.0069550793,0.0005521623,0.0012392334,0.0008365832,0.0011696935,0.0013328114,0.0023301346,0.0033679937,0.0031486168],"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.00014427192,0.0001507531,0.00057818514,0.0003633695,0.000056519042,0.00014762298,0.00024952917,0.72972345,0.0050248685,0.13064219,0.0071669305,0.12575237],"study_design_scores_gemma":[0.00001969914,0.0000120030445,0.000022917946,0.000012892944,0.0000023796224,0.000012647661,0.000012207993,0.98497516,0.0007534742,0.0119508635,0.002219416,0.000006339895],"about_ca_topic_score_codex":0.0023394802,"about_ca_topic_score_gemma":0.0029009199,"teacher_disagreement_score":0.012326251,"about_ca_system_score_codex":0.00086049136,"about_ca_system_score_gemma":0.002007562,"threshold_uncertainty_score":0.041235387},"labels":[],"label_agreement":null},{"id":"W4404299638","doi":"10.1287/ijoc.2023.0061","title":"An Iterative Exact Algorithm over a Time-Expanded Network for the Transportation of Biomedical Samples","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Flow network; Computer science; Mathematical optimization; Mathematics","score_opus":0.01660145908052911,"score_gpt":0.30073011913337855,"score_spread":0.2841286600528494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404299638","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.0061524743,0.00016357204,0.9903093,0.00018795973,0.000041543324,0.00010549298,0.00004474025,0.00026602854,0.0027288657],"genre_scores_gemma":[0.12552424,0.00019714017,0.869604,0.00012811992,0.00003962571,0.00038981007,0.0002111422,0.000121691286,0.0037842137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884844,0.00040784557,0.000057134534,0.00023970289,0.00026591306,0.00018093153],"domain_scores_gemma":[0.99714345,0.0020488715,0.00021079507,0.0001769326,0.00031245436,0.00010742492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023746882,0.0013630119,0.0013234271,0.0009858974,0.0009320599,0.0012313307,0.0018906181,0.0013346195,0.0059401514],"category_scores_gemma":[0.005943159,0.0007002612,0.0011371515,0.0013989779,0.0011393955,0.0018552205,0.001912713,0.001673405,0.0008795387],"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.0001057883,0.00006505045,0.0006009042,0.00012631774,0.000041892803,0.0000855848,0.00011505452,0.9175591,0.00088693755,0.019785818,0.0017274761,0.058900177],"study_design_scores_gemma":[0.000025471598,0.000027911972,0.000037630904,0.0000079208,0.000007779215,0.000018608638,0.000023187022,0.99064386,0.00021575789,0.008099583,0.0008881551,0.0000040709456],"about_ca_topic_score_codex":0.010228249,"about_ca_topic_score_gemma":0.012103943,"teacher_disagreement_score":0.010228249,"about_ca_system_score_codex":0.0018686845,"about_ca_system_score_gemma":0.003754395,"threshold_uncertainty_score":0.020337403},"labels":[],"label_agreement":null},{"id":"W4406217581","doi":"10.1287/ijoc.2023.0286","title":"An Exact Algorithm for Multicommodity Network Design Under Stochastic Interdictions","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Interdiction; Mathematical optimization; Network planning and design; Robustness (evolution); Computer science; Flow network; Pareto principle; Operations research; Mathematics; Engineering","score_opus":0.014237873928387223,"score_gpt":0.28252055007234145,"score_spread":0.26828267614395424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406217581","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.0035022667,0.00014297884,0.99334633,0.00009210917,0.000028060142,0.00007784552,0.00007067086,0.00044689325,0.002292772],"genre_scores_gemma":[0.11646451,0.00023947969,0.8803039,0.000090073794,0.000039079412,0.00032181063,0.0003397189,0.0001983254,0.0020030988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989931,0.00030451512,0.000043644683,0.00020943992,0.0002701611,0.00017911306],"domain_scores_gemma":[0.9986602,0.0008439307,0.00011244621,0.00014677238,0.00018148166,0.000055191547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014499582,0.0018622164,0.0014540525,0.0010780031,0.0010171996,0.0012939051,0.0019027104,0.0015786985,0.008975829],"category_scores_gemma":[0.0036058414,0.0008610754,0.0012493761,0.0017114956,0.00073537166,0.0018850206,0.0016806977,0.002114711,0.0011856316],"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.00007166922,0.00007342726,0.00023923164,0.00013703322,0.000026461026,0.000053428532,0.000060562616,0.8974697,0.0007608057,0.021020463,0.0024456389,0.0776416],"study_design_scores_gemma":[0.00003025466,0.000023084347,0.000030491688,0.0000078617795,0.000006134648,0.000018044908,0.00001095774,0.9870466,0.00022697337,0.011580301,0.0010153248,0.0000040558148],"about_ca_topic_score_codex":0.00718781,"about_ca_topic_score_gemma":0.008698805,"teacher_disagreement_score":0.008975829,"about_ca_system_score_codex":0.0018623617,"about_ca_system_score_gemma":0.003249784,"threshold_uncertainty_score":0.030027151},"labels":[],"label_agreement":null},{"id":"W4408326406","doi":"10.1287/ijoc.2023.0245","title":"Platelet Inventory Management with Approximate Dynamic Programming","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Inventory management; Computer science; Dynamic programming; Integer programming; Mathematical optimization; Operations management; Mathematics; Algorithm; Engineering","score_opus":0.00982212929617287,"score_gpt":0.2288282615316448,"score_spread":0.2190061322354719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408326406","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.07521602,0.0013238435,0.91398066,0.0010901636,0.0001141526,0.00012264727,0.0002869607,0.00046591583,0.0073995613],"genre_scores_gemma":[0.9267057,0.0005302587,0.06910992,0.0002158439,0.00005463549,0.00017760086,0.00027560428,0.000064135944,0.002866148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.0002956094,0.00003721739,0.00013333972,0.00018935064,0.00015391162],"domain_scores_gemma":[0.9969156,0.0023095196,0.00029441307,0.000080937265,0.0002715265,0.0001280624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015279832,0.001398705,0.0017956867,0.0007318792,0.0006219317,0.002311148,0.0015482965,0.0019136554,0.0021175304],"category_scores_gemma":[0.005551749,0.0009452267,0.00083036156,0.0010097235,0.001114107,0.0013008615,0.0012828881,0.0019221918,0.00022957782],"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.000015579959,0.000008782535,0.00011821265,0.000011868998,0.000006986479,0.000014399353,0.0000056753647,0.9966493,0.000053754113,0.0014009506,0.000097228134,0.0016172153],"study_design_scores_gemma":[0.0000039582696,0.0000062962513,0.000017361379,0.0000016151694,0.0000018041092,0.0000023045197,0.0000022861257,0.9987118,0.000028139239,0.0011527347,0.00007039222,0.0000012487276],"about_ca_topic_score_codex":0.02287622,"about_ca_topic_score_gemma":0.010008291,"teacher_disagreement_score":0.02287622,"about_ca_system_score_codex":0.0019411903,"about_ca_system_score_gemma":0.002558447,"threshold_uncertainty_score":0.045486152},"labels":[],"label_agreement":null},{"id":"W4409728692","doi":"10.1287/ijoc.2023.0367","title":"Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Benders' decomposition; Flow (mathematics); Decomposition; Computer science; Mathematical optimization; Operations research; Industrial engineering; Mathematics; Engineering; Chemistry","score_opus":0.013507336622891448,"score_gpt":0.3022088723143746,"score_spread":0.28870153569148316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409728692","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.010040712,0.00044217485,0.9864271,0.00021006257,0.000059906666,0.00007490454,0.00012741194,0.00035575827,0.0022619034],"genre_scores_gemma":[0.3231638,0.0011071191,0.6686329,0.00026924504,0.0001540494,0.0004783434,0.0011325007,0.00037245182,0.0046895077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992606,0.0002915101,0.00003747698,0.00015699987,0.00014624678,0.00010704623],"domain_scores_gemma":[0.9990013,0.00058556465,0.00010671027,0.00006503973,0.00018364842,0.000057685455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015036844,0.0019148755,0.0018421648,0.0014247017,0.00066639675,0.0014238274,0.0011940115,0.0016119343,0.0042417706],"category_scores_gemma":[0.0031886112,0.0009839198,0.0016838136,0.001736864,0.0008432098,0.0016646492,0.0010650525,0.0026069654,0.0007360935],"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.000051250994,0.000047697522,0.0003740832,0.00009350529,0.000024847779,0.00004324418,0.00003122116,0.9638346,0.0006125502,0.0077622333,0.0013609015,0.025763854],"study_design_scores_gemma":[0.000008728506,0.000016575914,0.000055554217,0.000008666529,0.0000056510576,0.0000083202885,0.000010756415,0.99384683,0.00021395227,0.0053346497,0.0004862435,0.0000041609237],"about_ca_topic_score_codex":0.006318279,"about_ca_topic_score_gemma":0.005308382,"teacher_disagreement_score":0.006318279,"about_ca_system_score_codex":0.0011942522,"about_ca_system_score_gemma":0.00208043,"threshold_uncertainty_score":0.014190137},"labels":[],"label_agreement":null},{"id":"W4409889158","doi":"10.1287/ijoc.2024.0686","title":"Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Dynamic programming; Mathematical optimization; Combinatorial algorithms; Integer programming; Combinatorial optimization; Mathematics; Algorithm","score_opus":0.02275743366881434,"score_gpt":0.3168890661005752,"score_spread":0.2941316324317609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409889158","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.009365283,0.00041388551,0.98337114,0.0004197417,0.0000541783,0.00006243387,0.00007337094,0.00011381592,0.0061260965],"genre_scores_gemma":[0.42538175,0.0015717756,0.5621686,0.00025791427,0.00018769802,0.0005428367,0.00035538443,0.00022461801,0.009309485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851686,0.000774349,0.000061610066,0.00021396442,0.00027493914,0.00015819492],"domain_scores_gemma":[0.997148,0.0022876705,0.00019424701,0.00011135833,0.00016186819,0.00009685891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019855723,0.0015673707,0.001568678,0.0008465282,0.00054550247,0.0030662417,0.0016294235,0.0022137614,0.00537516],"category_scores_gemma":[0.0049452046,0.0010711944,0.001555479,0.001490524,0.0013295511,0.0026228514,0.0021187367,0.003673842,0.0005113814],"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.000012166115,0.000043606648,0.00013363564,0.000058274232,0.000023115428,0.000040815223,0.000029311484,0.9453793,0.00019665585,0.047861606,0.00043543527,0.0057860264],"study_design_scores_gemma":[0.000006568035,0.000009323618,0.00001600368,0.0000070536266,0.0000037135421,0.0000068572435,0.000009635704,0.9778626,0.00006110734,0.021437781,0.0005762655,0.000003029847],"about_ca_topic_score_codex":0.004974647,"about_ca_topic_score_gemma":0.0050333375,"teacher_disagreement_score":0.00537516,"about_ca_system_score_codex":0.001791373,"about_ca_system_score_gemma":0.0020650711,"threshold_uncertainty_score":0.017981648},"labels":[],"label_agreement":null},{"id":"W4410395635","doi":"10.1287/ijoc.2024.0847","title":"Solving Two-Stage Programs with Endogenous Uncertainty via Random Variable Transformation","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Transformation (genetics); Stage (stratigraphy); Variable (mathematics); Mathematical optimization; Computer science; Mathematics; Random variable; Statistics","score_opus":0.013117761027357658,"score_gpt":0.22978674724366924,"score_spread":0.2166689862163116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410395635","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.0043555233,0.0000835688,0.99408084,0.00013382724,0.000012687213,0.000036742596,0.000033023352,0.00008961725,0.0011741406],"genre_scores_gemma":[0.42620635,0.000461968,0.5664039,0.00021798602,0.000074432486,0.0006349786,0.00026711312,0.00021087326,0.0055223648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981775,0.00085202575,0.000063759544,0.00035310147,0.00035424353,0.0001992886],"domain_scores_gemma":[0.9944998,0.0045318957,0.0003703248,0.0001662322,0.00032843364,0.00010333687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905501,0.0012328529,0.0013737248,0.00071848225,0.00044679575,0.001333664,0.0013497048,0.0013146682,0.0036468685],"category_scores_gemma":[0.006169363,0.0007008901,0.0019980548,0.00096664473,0.0013524462,0.0015170671,0.0016671212,0.002825406,0.0003414065],"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.00002683742,0.000036293095,0.00023244211,0.00006594004,0.000025676673,0.000051927007,0.000038025297,0.95956486,0.0005188006,0.027055819,0.00043620155,0.011947182],"study_design_scores_gemma":[0.000006230994,0.000013990581,0.000026839341,0.0000043252353,0.000004482332,0.000006535116,0.000005279393,0.99054235,0.000248281,0.008863068,0.00027504985,0.0000034401435],"about_ca_topic_score_codex":0.004279716,"about_ca_topic_score_gemma":0.0032884628,"teacher_disagreement_score":0.004279716,"about_ca_system_score_codex":0.0014894253,"about_ca_system_score_gemma":0.0022266803,"threshold_uncertainty_score":0.015365958},"labels":[],"label_agreement":null},{"id":"W4410552381","doi":"10.1287/ijoc.2024.0645","title":"Mitigating Age-Related Bias in Large Language Models: Strategies for Responsible Artificial Intelligence Development","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.2140609830821581,"score_gpt":0.44362255166613107,"score_spread":0.22956156858397297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410552381","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.06077316,0.0016069695,0.92522186,0.0069705453,0.00014936444,0.00012531412,0.000064266336,0.0011387408,0.003949797],"genre_scores_gemma":[0.78423625,0.0006548655,0.21039371,0.0014533974,0.0002097058,0.00022424183,0.00010238849,0.00019221217,0.0025332537],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930633,0.0044496236,0.00034195554,0.0009757627,0.00086702,0.00030228065],"domain_scores_gemma":[0.971046,0.018518137,0.0030879572,0.0038286955,0.002527132,0.0009920832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018537384,0.0011426972,0.000922453,0.0010499837,0.001158078,0.0021564583,0.0023543774,0.0014749448,0.0017597652],"category_scores_gemma":[0.05568802,0.00050424534,0.0008227007,0.00063108315,0.0026017558,0.0074882214,0.005273439,0.0030315567,0.0006271366],"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.00041513745,0.00040702644,0.04507123,0.00050641934,0.0002777541,0.00063516793,0.0077673104,0.19946724,0.01326252,0.15507756,0.0098629845,0.56724966],"study_design_scores_gemma":[0.000048400674,0.00015443261,0.0021895433,0.00012577344,0.00008531369,0.00023194822,0.0007936322,0.7355273,0.009033525,0.2387129,0.013018478,0.000078777],"about_ca_topic_score_codex":0.0021619,"about_ca_topic_score_gemma":0.0028452775,"teacher_disagreement_score":0.018537384,"about_ca_system_score_codex":0.0015630607,"about_ca_system_score_gemma":0.003504784,"threshold_uncertainty_score":0.09803623},"labels":[],"label_agreement":null},{"id":"W4411146462","doi":"10.1287/ijoc.2024.0637","title":"Learning-Based Online Optimization for Autonomous Mobility-on-Demand Fleet Control","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Control (management); Operations research; Fleet management; Mathematical optimization; Artificial intelligence; Engineering; Telecommunications; Mathematics","score_opus":0.008515457155003322,"score_gpt":0.2545853614221791,"score_spread":0.24606990426717576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411146462","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.021635847,0.00033131853,0.97092617,0.00041456346,0.00006956241,0.0000923449,0.00016413348,0.0012293218,0.0051367567],"genre_scores_gemma":[0.8796185,0.00020595167,0.11467715,0.00027900387,0.000060086903,0.00027737863,0.00039247514,0.00025742658,0.0042319703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995895,0.00009541606,0.000021393143,0.00009638761,0.00009777859,0.000099474506],"domain_scores_gemma":[0.9982502,0.0012155422,0.00015603936,0.00009186492,0.00019462648,0.00009169948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316641,0.0012524239,0.0012665608,0.000500551,0.00039784712,0.0009885634,0.0013610667,0.0012953356,0.004969334],"category_scores_gemma":[0.0038670832,0.0006358375,0.0006798471,0.0005686561,0.0008865154,0.0010185539,0.0013203494,0.001895339,0.0006139501],"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.000020460478,0.000021678174,0.00014606367,0.000027336799,0.000008711382,0.000012622151,0.00000826443,0.98993707,0.00019394429,0.0016672924,0.00047735893,0.007479287],"study_design_scores_gemma":[0.0000031905072,0.0000054183456,0.00001626503,0.0000013733381,0.0000010226729,0.0000011301491,0.000001242684,0.9991479,0.000043947137,0.0006914319,0.00008634855,7.9758803e-7],"about_ca_topic_score_codex":0.009837443,"about_ca_topic_score_gemma":0.007966241,"teacher_disagreement_score":0.009837443,"about_ca_system_score_codex":0.0012882284,"about_ca_system_score_gemma":0.0019139324,"threshold_uncertainty_score":0.019560397},"labels":[],"label_agreement":null},{"id":"W4413983102","doi":"10.1287/ijoc.2024.0904","title":"A Logic-Based Benders Decomposition for the Car Resequencing Problem with a Painted Body Storage","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Benders' decomposition; Computer science; Decomposition; Parallel computing; Mathematical optimization; Algorithm; Mathematics","score_opus":0.009369307637859793,"score_gpt":0.25944689757704853,"score_spread":0.2500775899391887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413983102","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.015102442,0.00027236255,0.97434855,0.00044124102,0.00005161821,0.00037335992,0.00033791992,0.00021211799,0.008860505],"genre_scores_gemma":[0.15114403,0.0007520266,0.83528453,0.0002922246,0.00009948227,0.00075169536,0.0010489901,0.00020686444,0.010420125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985512,0.00049490115,0.000066525194,0.00030717434,0.00032441074,0.00025577046],"domain_scores_gemma":[0.99853945,0.0009933917,0.00014749251,0.00007357839,0.00014540346,0.00010065504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020298113,0.00220239,0.0014499596,0.0012183987,0.00095701765,0.0024346737,0.0019122026,0.0018917873,0.011813699],"category_scores_gemma":[0.0033285017,0.0014208826,0.002991725,0.0014395982,0.0011621204,0.0025454406,0.001659255,0.0034438006,0.0013237314],"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.0001456002,0.00016883736,0.00038774067,0.00036532243,0.00004599805,0.0002137906,0.00015775059,0.9116663,0.0042071133,0.04667225,0.0029412513,0.033028092],"study_design_scores_gemma":[0.000060803206,0.0001387921,0.00017146626,0.00005254191,0.000042005155,0.00007944972,0.00008873549,0.9562469,0.0013551014,0.03808255,0.0036556073,0.000026026853],"about_ca_topic_score_codex":0.0076568546,"about_ca_topic_score_gemma":0.008388481,"teacher_disagreement_score":0.011813699,"about_ca_system_score_codex":0.0029850632,"about_ca_system_score_gemma":0.0035213565,"threshold_uncertainty_score":0.03952074},"labels":[],"label_agreement":null},{"id":"W4414427227","doi":"10.1287/ijoc.2024.0775","title":"Learning in Reformulation-Linearization Technique-Based Spatial Branching: Limitations of Strong Branching Imitation","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Branching (polymer chemistry); Software; Context (archaeology); Set (abstract data type); Integer programming; Linear programming; Software development; Decision support system","score_opus":0.027242604392444504,"score_gpt":0.28613642727963967,"score_spread":0.25889382288719515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414427227","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.018481769,0.0021950586,0.9696056,0.0010414075,0.00009283681,0.000089643145,0.000039310555,0.0004975259,0.007956866],"genre_scores_gemma":[0.643506,0.0029175924,0.34321895,0.0008814929,0.00025475046,0.0003379472,0.00021678221,0.00036334255,0.008303124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978257,0.0009719656,0.00013606308,0.00036116692,0.0005257712,0.0001792653],"domain_scores_gemma":[0.98615175,0.010637576,0.000807531,0.001147037,0.0009073948,0.00034877055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386066,0.0010688921,0.0016966786,0.00053796254,0.00060307217,0.0017596093,0.0021526783,0.0016724947,0.004703028],"category_scores_gemma":[0.020083323,0.00071064767,0.0012519171,0.00066938804,0.002324676,0.0035330565,0.0026868046,0.0040893843,0.0011588924],"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.00024560196,0.00015976245,0.0014482357,0.00053322245,0.00009856354,0.00015789075,0.00037091828,0.6490271,0.0032629587,0.12062171,0.0030473508,0.22102658],"study_design_scores_gemma":[0.000021953621,0.000117647694,0.00011351789,0.00005420748,0.000015901245,0.000042706484,0.000025334482,0.964806,0.0010358475,0.031891387,0.0018629808,0.000012471798],"about_ca_topic_score_codex":0.002820689,"about_ca_topic_score_gemma":0.0027438032,"teacher_disagreement_score":0.004703028,"about_ca_system_score_codex":0.0011905278,"about_ca_system_score_gemma":0.0016546258,"threshold_uncertainty_score":0.023196042},"labels":[],"label_agreement":null},{"id":"W4415260229","doi":"10.1287/ijoc.2024.0838","title":"Gamifying the Vehicle Routing Problem with Stochastic Requests","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Software; Reinforcement learning; Pascal (unit); Field (mathematics); Routing (electronic design automation); Stochastic programming; Optimization problem","score_opus":0.008995944244134841,"score_gpt":0.23758226565679505,"score_spread":0.22858632141266022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415260229","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.29501823,0.0008755618,0.63559437,0.0061503057,0.00041895325,0.00034425643,0.00075400044,0.000707331,0.06013703],"genre_scores_gemma":[0.8458728,0.00053320365,0.13080795,0.00065788015,0.00008785397,0.00039070236,0.00042858545,0.00020032929,0.021020731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00033572153,0.00002640717,0.000092956965,0.00008116299,0.00011299044],"domain_scores_gemma":[0.99620014,0.0031294373,0.00018028033,0.000099160854,0.00014632846,0.0002446552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550122,0.0011547667,0.0007615911,0.00039196762,0.0005548732,0.0013510558,0.0011344737,0.0018995209,0.008438642],"category_scores_gemma":[0.0072764605,0.000476642,0.00079493603,0.0003062866,0.0011811812,0.00202303,0.0018478542,0.0020500654,0.0004778065],"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.00022721596,0.0001329845,0.0017544191,0.00012748699,0.00004508469,0.00017893637,0.0001449194,0.91238946,0.00066235894,0.06344297,0.004315749,0.016578386],"study_design_scores_gemma":[0.000031688465,0.000039946117,0.0001705183,0.000018544737,0.000008929749,0.00002055903,0.000054937653,0.97294724,0.00018710775,0.02503362,0.001477786,0.000009021932],"about_ca_topic_score_codex":0.009681685,"about_ca_topic_score_gemma":0.013255464,"teacher_disagreement_score":0.009681685,"about_ca_system_score_codex":0.0013715468,"about_ca_system_score_gemma":0.0016768472,"threshold_uncertainty_score":0.028230071},"labels":[],"label_agreement":null},{"id":"W4415588099","doi":"10.1287/ijoc.2025.1140","title":"Exact Methods and a Two-Stage Iterative Heuristic for the Carrier-Vehicle Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Travelling salesman problem; Heuristics; Heuristic; 2-opt; Benchmark (surveying); Set (abstract data type); Traveling purchaser problem; Software; Bottleneck traveling salesman problem","score_opus":0.02174006309521651,"score_gpt":0.34764696089454084,"score_spread":0.3259068977993243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415588099","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.006605584,0.00024107433,0.9883591,0.00011007512,0.000046390825,0.00016738477,0.000087047774,0.00033409407,0.004049204],"genre_scores_gemma":[0.11163218,0.0003300356,0.88478047,0.00010728307,0.00004208961,0.00049875444,0.00031700116,0.00015615133,0.0021360898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988349,0.00040100428,0.000065533044,0.0001743679,0.00034955874,0.00017468646],"domain_scores_gemma":[0.99802065,0.0013044676,0.00017652912,0.00016998251,0.00026662627,0.00006168788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016845529,0.0015172441,0.0010131289,0.001251197,0.00058355095,0.0011979601,0.002060143,0.0012929689,0.0063612885],"category_scores_gemma":[0.0040990124,0.0008008983,0.0013514046,0.0014531956,0.000684459,0.0013151041,0.0009811103,0.0016118883,0.0009546167],"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.00006676292,0.00011121164,0.00041587662,0.00019269087,0.00004249975,0.00007566543,0.00008816883,0.89231473,0.0013008222,0.01976831,0.0022494658,0.083373696],"study_design_scores_gemma":[0.00003139215,0.000035506142,0.000059238875,0.0000129587115,0.000013206388,0.00001884164,0.000018642544,0.9929488,0.0003902063,0.005065864,0.0013983288,0.0000070207057],"about_ca_topic_score_codex":0.008215177,"about_ca_topic_score_gemma":0.009041868,"teacher_disagreement_score":0.008215177,"about_ca_system_score_codex":0.0013360764,"about_ca_system_score_gemma":0.0031262673,"threshold_uncertainty_score":0.021280587},"labels":[],"label_agreement":null},{"id":"W4416147370","doi":"10.1287/ijoc.2024.0990","title":"The Sensitivity of the U.S. Presidential Election to Coordinated Voter Relocation","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Presidential election; Polling; Relocation; Politics; Turnout; Primary election; Work (physics); Presidential system; Outcome (game theory)","score_opus":0.004414540694026372,"score_gpt":0.2672048318157416,"score_spread":0.26279029112171526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416147370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97322726,0.00048215807,0.008121561,0.0024158147,0.00014955162,0.000068192116,0.00093088223,0.00017727356,0.014427423],"genre_scores_gemma":[0.9988514,0.000071972965,0.00041256228,0.00012615816,0.000016465421,0.000010650449,0.0002244528,0.000017162902,0.00026907458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970843,0.0014360552,0.00010347488,0.00076717243,0.0002873447,0.00032167212],"domain_scores_gemma":[0.9721548,0.020962965,0.002988955,0.002165837,0.0010753452,0.0006521225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055256714,0.00026170033,0.0006422385,0.000885967,0.0006765018,0.0021866614,0.0005783384,0.00096268527,0.003746314],"category_scores_gemma":[0.049832884,0.00033764335,0.00064677105,0.001109771,0.0007015771,0.0010374443,0.0011610741,0.0016925426,0.0004523967],"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.0011539811,0.00019158839,0.29077706,0.0002563306,0.0007222583,0.00038024364,0.000997773,0.5973474,0.0024426426,0.02202452,0.020260654,0.063445516],"study_design_scores_gemma":[0.00023062121,0.0004908966,0.3052468,0.00012215573,0.00030017568,0.00018197799,0.0023978332,0.640563,0.0029472876,0.035547245,0.011788613,0.00018338411],"about_ca_topic_score_codex":0.023714187,"about_ca_topic_score_gemma":0.018916504,"teacher_disagreement_score":0.023714187,"about_ca_system_score_codex":0.001760447,"about_ca_system_score_gemma":0.0008732175,"threshold_uncertainty_score":0.04715228},"labels":[],"label_agreement":null}]}