{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198515,0.000060964783,0.05136708,0.0010354447,0.0015614764,0.0003118315,5.787086e-7,0.00026730116,0.025543865],"genre_scores_gemma":[0.9888639,0.000006863581,0.0033085088,0.00390772,0.0037742392,6.404339e-7,0.0000077228415,0.000057430858,0.00007300581],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736995,0.000017782404,0.0008574339,0.00028560698,0.0008095936,0.00065961154],"domain_scores_gemma":[0.9985964,0.00017568252,0.0007607606,0.00016791331,0.00024679728,0.000052486237],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009044903,0.0003570491,0.0003390296,0.00082159525,0.0014965627,0.0010456971,0.00042734164,0.0000991534,0.00019803528],"category_scores_gemma":[0.00047400402,0.00030083742,0.00017538642,0.0007385629,0.00013938203,0.001762558,0.00021927762,0.0007187788,0.00034645828],"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.00023444247,0.0005492798,0.38091308,0.00087434694,0.0005336164,0.0010615998,0.0015366469,0.26247504,0.00045960495,0.2596559,0.0023944525,0.08931202],"study_design_scores_gemma":[0.0050744307,0.00020944694,0.082391575,0.004106337,0.0002191091,0.0016297585,0.0020897829,0.88058835,0.000058086356,0.010397757,0.0109410025,0.0022943518],"about_ca_topic_score_codex":0.000033480203,"about_ca_topic_score_gemma":0.0000025621446,"teacher_disagreement_score":0.61811334,"about_ca_system_score_codex":0.00012824434,"about_ca_system_score_gemma":0.000047720998,"threshold_uncertainty_score":0.9999913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12812088,0.000011375429,0.86552256,0.0024180107,0.00060775055,0.0004059008,0.0000055480336,0.00011288099,0.002795097],"genre_scores_gemma":[0.9584376,0.0000017557014,0.036060214,0.0037578023,0.0012412316,0.000011308377,0.000082217826,0.000024571562,0.00038325536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802047,0.00025072982,0.00078890554,0.00014470915,0.00039102256,0.000404183],"domain_scores_gemma":[0.9971204,0.00065219146,0.00047420766,0.0001860907,0.001237341,0.00032977216],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012932849,0.00016170931,0.00020950293,0.00036746773,0.0018604031,0.00014535367,0.00009928496,0.00013440302,0.00005356846],"category_scores_gemma":[0.0015079969,0.00011130318,0.00004355003,0.00049895706,0.000027950673,0.00033647474,0.000020254318,0.0007197959,0.00011705998],"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.00011667124,0.000028484077,0.004483423,0.00002242888,0.000011121164,0.000003871724,0.0012291268,0.98788184,0.0000024423543,0.0023256314,0.00020626638,0.0036887147],"study_design_scores_gemma":[0.0018661837,0.00030310385,0.0005352448,0.00022315206,0.000009342816,0.000007042818,0.000548405,0.9922865,0.000002345616,0.00016932614,0.0039051846,0.00014414638],"about_ca_topic_score_codex":0.00009438377,"about_ca_topic_score_gemma":0.000025444586,"teacher_disagreement_score":0.8303167,"about_ca_system_score_codex":0.0005207074,"about_ca_system_score_gemma":0.0021727025,"threshold_uncertainty_score":0.99943906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840048,0.000018051816,0.013025041,0.00009006203,0.00031797015,0.00006988285,1.7400838e-7,0.00005109328,0.0024229158],"genre_scores_gemma":[0.99801975,0.000002842529,0.001136086,0.00035868533,0.00045563825,4.8294913e-7,0.0000010086688,0.000014145144,0.000011343203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988744,0.000003934656,0.0004363791,0.00012364479,0.0003475056,0.00021412151],"domain_scores_gemma":[0.9987723,0.000052687355,0.0006605039,0.00009830957,0.0003954628,0.000020685588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568381,0.00013792366,0.00020678957,0.00035511956,0.0003897901,0.0001909265,0.00016656084,0.00004571235,0.000010451424],"category_scores_gemma":[0.00021048497,0.000105635096,0.000055984976,0.00036515892,0.00005342752,0.00050882413,0.00006927272,0.00043447333,0.000014396432],"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.0000794843,0.00004397523,0.01962938,0.00017763564,0.00002858242,0.0000036234994,0.00016816611,0.9020013,0.0004823883,0.003687797,0.000017344413,0.073680274],"study_design_scores_gemma":[0.00054563564,0.00003796376,0.0076013543,0.00028326345,0.00003253849,0.000043473417,0.00017864749,0.98597455,0.0005136908,0.0031909405,0.0013968269,0.00020108644],"about_ca_topic_score_codex":0.000007190652,"about_ca_topic_score_gemma":0.0000016139335,"teacher_disagreement_score":0.08397324,"about_ca_system_score_codex":0.000015199493,"about_ca_system_score_gemma":0.000017321836,"threshold_uncertainty_score":0.43076742},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18350753,0.0003314028,0.040461693,0.097929835,0.0073551103,0.0013337253,0.0000011972073,0.00051291997,0.6685666],"genre_scores_gemma":[0.98521495,0.000051914587,0.0005477677,0.009025344,0.003577498,0.000003476706,0.000006430311,0.00001800802,0.0015545951],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983566,0.00001292517,0.0006020001,0.00015110831,0.00046273254,0.00041463572],"domain_scores_gemma":[0.9991744,0.0000955117,0.00030178044,0.00021237433,0.00018354483,0.000032346936],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014157487,0.0001887718,0.00014071095,0.00018742008,0.0011549675,0.0006283203,0.00039997956,0.000056638622,0.00011707301],"category_scores_gemma":[0.00016269334,0.00011574432,0.00011638471,0.0003645447,0.000047888603,0.0010275586,0.00012670869,0.00058454764,0.00084569945],"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.000073445175,0.000051017847,0.0008667511,0.000018367999,0.00006410919,0.0000059333524,0.00024085445,0.3577048,4.264591e-7,0.08223743,0.0380209,0.52071595],"study_design_scores_gemma":[0.00039759287,0.0000345623,0.0022275678,0.00012162261,0.000012407862,0.0000044524404,0.00026690564,0.38891637,0.0000015836712,0.0016013142,0.60624033,0.00017530368],"about_ca_topic_score_codex":0.000030557556,"about_ca_topic_score_gemma":0.0001055474,"teacher_disagreement_score":0.80170745,"about_ca_system_score_codex":0.000110147346,"about_ca_system_score_gemma":0.000018483935,"threshold_uncertainty_score":0.9999322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.158215,0.000007948149,0.83786356,0.000061856575,0.001305177,0.0003729316,0.0000033516865,0.0001657362,0.0020044646],"genre_scores_gemma":[0.37498924,0.0000011359949,0.62346166,0.00017010227,0.0012709443,0.0000012272651,0.0000039853744,0.000050445335,0.000051228722],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972621,0.00003333053,0.0012806525,0.00022473597,0.0005320966,0.00066703587],"domain_scores_gemma":[0.9951577,0.0026781433,0.0009959472,0.000385882,0.0004737946,0.00030853355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025731348,0.00027021355,0.00041134065,0.0002787734,0.0007761778,0.00024072255,0.00046785304,0.000121571116,0.000010611471],"category_scores_gemma":[0.0011354913,0.00023573321,0.00019572335,0.00029761193,0.000052054736,0.00045258555,0.0000814205,0.0005571993,0.000013665447],"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.00008703256,0.00054608326,0.00030691433,0.00012189313,0.00014269055,0.00008683848,0.0054183337,0.0025209072,0.0002773872,0.25300086,0.0011072921,0.7363838],"study_design_scores_gemma":[0.0030756474,0.0010511832,0.00040025933,0.0004653612,0.00006194558,0.00076787756,0.003496725,0.29146153,0.0029300598,0.6934211,0.0021985304,0.00066974247],"about_ca_topic_score_codex":0.0000013348294,"about_ca_topic_score_gemma":0.0000014928828,"teacher_disagreement_score":0.735714,"about_ca_system_score_codex":0.00020116157,"about_ca_system_score_gemma":0.00007598393,"threshold_uncertainty_score":0.96129215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06766264,0.00006352147,0.8786501,0.0031716095,0.0017669012,0.0012358008,0.0000041679004,0.0001843865,0.04726084],"genre_scores_gemma":[0.9928337,0.000006342434,0.0014467567,0.0034467187,0.0020039107,0.000005053464,0.00003797212,0.000017298427,0.00020229371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827826,0.000005399268,0.0006116596,0.0001560528,0.00045586584,0.0004927617],"domain_scores_gemma":[0.9989657,0.00016495738,0.00019640861,0.00018542075,0.00046014707,0.000027410719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003386607,0.00015968885,0.00013639344,0.00023955037,0.0009946184,0.0005786099,0.00032210528,0.000050155882,0.00013809776],"category_scores_gemma":[0.00013489506,0.00010676476,0.000078388955,0.0005547874,0.00002557634,0.000820038,0.00013372111,0.0002998669,0.00014127529],"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.0003141554,0.00019767988,0.005824327,0.00045198415,0.00016777664,0.000005757565,0.0005474887,0.35025263,0.000059381146,0.34713694,0.017417809,0.27762407],"study_design_scores_gemma":[0.0013732053,0.00008290065,0.014611588,0.00011895581,0.000055349945,0.000019774658,0.0015386965,0.5925269,0.000078904915,0.0038218992,0.38541213,0.0003596785],"about_ca_topic_score_codex":0.00017144911,"about_ca_topic_score_gemma":0.0000411225,"teacher_disagreement_score":0.925171,"about_ca_system_score_codex":0.00008633536,"about_ca_system_score_gemma":0.00005449392,"threshold_uncertainty_score":0.7649901},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73757654,0.00007143123,0.007860523,0.012370349,0.0037669996,0.00050572737,9.297731e-7,0.0003242249,0.23752327],"genre_scores_gemma":[0.9785656,0.000024594772,0.00017775092,0.017285582,0.0029120145,0.0000022203203,0.000017520384,0.000016613047,0.0009981068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981649,0.000012305651,0.0005767777,0.00019016319,0.0006337531,0.00042208974],"domain_scores_gemma":[0.9992565,0.00003686228,0.0001709709,0.00023199613,0.00026403862,0.0000396658],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011284571,0.00020681521,0.00017816192,0.00022615097,0.00056644,0.00042264853,0.0003043662,0.00006417352,0.0016637173],"category_scores_gemma":[0.00009825695,0.00016498796,0.000099125784,0.00064414844,0.000032494685,0.0006868296,0.000050073773,0.0003631465,0.0023750542],"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.00006362723,0.00003972094,0.00032666043,0.000027944236,0.000025032306,0.0000045775573,0.00006370984,0.7778185,3.4459555e-7,0.009840634,0.022678772,0.18911046],"study_design_scores_gemma":[0.0008579383,0.00006844393,0.00898831,0.00035108582,0.000025348168,0.000009516189,0.00035122407,0.44825324,0.0000015646095,0.0042780954,0.5364279,0.00038729096],"about_ca_topic_score_codex":0.00019373046,"about_ca_topic_score_gemma":0.00012424825,"teacher_disagreement_score":0.5137492,"about_ca_system_score_codex":0.00016188652,"about_ca_system_score_gemma":0.000047317437,"threshold_uncertainty_score":0.9992489},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41471675,0.000086125125,0.58454514,0.000047820227,0.0001327946,0.00021165868,0.0000021172104,0.0000243317,0.00023329922],"genre_scores_gemma":[0.9357587,5.528081e-7,0.06357275,0.00027187678,0.00032686745,0.0000031277837,0.000035582667,0.000022690785,0.00000787016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846387,0.000028002833,0.00080402766,0.00017260836,0.0002612513,0.00027026815],"domain_scores_gemma":[0.9971085,0.0007633237,0.0013462942,0.000112716836,0.0006398239,0.000029325092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040141335,0.00019993086,0.00041181984,0.00040620865,0.00044696638,0.0002266433,0.00016158671,0.00005036488,0.000003850105],"category_scores_gemma":[0.00019822651,0.00014983534,0.000057886376,0.0005700402,0.000051090396,0.0011284457,0.00010177996,0.00020764585,0.0000017196862],"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.003203476,0.00039571204,0.0754667,0.0008946997,0.00050917227,0.000009743857,0.004011576,0.78356516,0.0023815231,0.02075147,0.00008754689,0.10872323],"study_design_scores_gemma":[0.0015651888,0.00013857687,0.012841319,0.0005234529,0.00007173205,0.000026912969,0.007163289,0.97470355,0.0015290609,0.0008297129,0.00028030932,0.00032688575],"about_ca_topic_score_codex":0.000071744376,"about_ca_topic_score_gemma":0.000047796955,"teacher_disagreement_score":0.5210419,"about_ca_system_score_codex":0.000074820025,"about_ca_system_score_gemma":0.000018222843,"threshold_uncertainty_score":0.6110108},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7509943,0.0000047029034,0.24582106,0.0003035191,0.0010025204,0.00012530613,0.0000027242775,0.000018733643,0.0017271084],"genre_scores_gemma":[0.98420966,0.0000020534044,0.013896199,0.0007755498,0.0010984066,2.7257258e-7,8.740095e-7,0.000009586165,0.0000074235136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813443,0.00015847564,0.00063926284,0.00016064632,0.00064790907,0.00025929333],"domain_scores_gemma":[0.99683386,0.0015189074,0.00088493427,0.00033388086,0.00033559583,0.000092832845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093952444,0.00017642163,0.00029598334,0.00014218275,0.00022277879,0.00013115612,0.00076999236,0.00007372559,0.000049510065],"category_scores_gemma":[0.00082221924,0.00010836442,0.00016869917,0.00037721056,0.00007694901,0.00034438143,0.00012801243,0.0005835887,0.000021309499],"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.001312936,0.00026864785,0.0031214065,0.00010291176,0.00028168646,0.000035419253,0.009793804,0.26156557,0.0191611,0.39604607,0.007671444,0.300639],"study_design_scores_gemma":[0.00852855,0.0011942222,0.0039299186,0.0008281883,0.00003737102,0.00037518694,0.00023556591,0.8026754,0.13007304,0.047192413,0.0043154596,0.0006146575],"about_ca_topic_score_codex":0.000007939936,"about_ca_topic_score_gemma":0.0000035260607,"teacher_disagreement_score":0.54110986,"about_ca_system_score_codex":0.000082594415,"about_ca_system_score_gemma":0.000095249496,"threshold_uncertainty_score":0.44189727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43273044,0.00003412174,0.5656422,0.00005800257,0.0007861825,0.00010473992,8.2175956e-7,0.00015256848,0.00049096986],"genre_scores_gemma":[0.69973576,0.0000063649177,0.2998414,0.00006763838,0.0003154722,0.0000016455991,0.0000018609878,0.000024550378,0.000005272317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988297,0.000007858608,0.00041812012,0.000116969844,0.00021078213,0.00041653504],"domain_scores_gemma":[0.9992033,0.00024136927,0.00007246103,0.00009316115,0.00016601606,0.00022369342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870304,0.00016832074,0.0001927549,0.00018072018,0.00039920022,0.0004015408,0.00013964652,0.0001156562,0.000009469171],"category_scores_gemma":[0.00008665665,0.00014872721,0.00006961469,0.00014164741,0.00008788185,0.00018945984,0.000036263067,0.0010498364,0.0000060074613],"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.000008709229,0.000007707475,0.0006645634,0.000035244,0.0000312057,0.0000061699975,0.00059636537,0.58891046,0.0001745848,0.0014427439,0.0000053393705,0.40811688],"study_design_scores_gemma":[0.000874997,0.00009316657,0.00015267258,0.0001380126,0.000007708453,0.00039428583,0.0011128095,0.99568,0.0008120388,0.00006469776,0.00046763703,0.00020200858],"about_ca_topic_score_codex":0.0000011427028,"about_ca_topic_score_gemma":9.090926e-7,"teacher_disagreement_score":0.40791488,"about_ca_system_score_codex":0.000037268703,"about_ca_system_score_gemma":0.000050676223,"threshold_uncertainty_score":0.606492},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4302436,0.000010610633,0.5691348,0.00004655707,0.000086597625,0.00013309196,0.000013907846,0.000022716418,0.000308176],"genre_scores_gemma":[0.5938234,0.0000030878782,0.4060253,0.000047395322,0.00007461364,0.000002241718,0.000002784429,0.000009639087,0.000011593878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986344,0.000047635363,0.00055077206,0.00015289836,0.00027923824,0.00033504542],"domain_scores_gemma":[0.9968283,0.0023074835,0.0004572529,0.00010542992,0.00015440784,0.00014707982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009000363,0.00017213577,0.00025385307,0.00007767313,0.0009502654,0.000114197115,0.00010735128,0.00005656306,0.000010419861],"category_scores_gemma":[0.0012009013,0.00011704842,0.000059158912,0.000115277086,0.00006698158,0.0001305212,0.000054591423,0.00045783859,0.0000025338577],"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.00096668134,0.00035107756,0.01943502,0.0005574051,0.0002861671,0.0003005149,0.01138483,0.10581623,0.00032824083,0.6723686,0.0001889873,0.18801624],"study_design_scores_gemma":[0.0016625474,0.00052183255,0.03278377,0.0012324711,0.000058184938,0.0019226925,0.00038647733,0.87552327,0.00023169111,0.085160054,0.000080014564,0.00043698022],"about_ca_topic_score_codex":0.000011604984,"about_ca_topic_score_gemma":8.454553e-7,"teacher_disagreement_score":0.7697071,"about_ca_system_score_codex":0.000057874193,"about_ca_system_score_gemma":0.00005995271,"threshold_uncertainty_score":0.7308769},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41183043,0.000052336698,0.5836529,0.0004454466,0.00039734197,0.00007274021,0.000002234574,0.000043553307,0.0035030216],"genre_scores_gemma":[0.97099894,0.00001256232,0.027579606,0.00085702474,0.00019193148,7.066817e-7,0.000011769933,0.0000061184032,0.00034132382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852455,0.000037427486,0.00055321207,0.00015438255,0.0004991893,0.00023127148],"domain_scores_gemma":[0.99916774,0.00010334309,0.00030058654,0.00016285102,0.00015208601,0.00011338586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372082,0.00013131766,0.00016020211,0.00020233143,0.00023445225,0.00018661939,0.00040342018,0.00005110373,0.000089038556],"category_scores_gemma":[0.00003530289,0.000108126595,0.00009765036,0.00042277976,0.00002179306,0.0007472432,0.00005287847,0.00024766897,0.00005165115],"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.000024078226,0.0000960109,0.00008917716,0.000010403615,0.000025149206,0.000005504486,0.00083587307,0.112747826,0.0005887126,0.013947827,0.0027511315,0.8688783],"study_design_scores_gemma":[0.00073706935,0.0003118131,0.0017124141,0.000085427055,0.0000040873574,0.00037945766,0.000029020171,0.9822832,0.004430651,0.0035566362,0.006243644,0.00022658419],"about_ca_topic_score_codex":0.0000023467112,"about_ca_topic_score_gemma":2.0256506e-7,"teacher_disagreement_score":0.8695354,"about_ca_system_score_codex":0.0000580283,"about_ca_system_score_gemma":0.00008910423,"threshold_uncertainty_score":0.44092745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11205155,0.00011379935,0.87469405,0.00032698113,0.00015874083,0.00036659022,0.0000036071497,0.00022675372,0.012057957],"genre_scores_gemma":[0.8709671,0.000013268905,0.12855987,0.00012472473,0.00025040406,0.000004244282,0.000004096568,0.00003510058,0.00004121979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894243,0.000024649715,0.0004073178,0.000097223,0.00021528463,0.0003130837],"domain_scores_gemma":[0.99901307,0.00053099456,0.00015955966,0.000100369674,0.0001280634,0.000067961984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011057296,0.00015032366,0.00013953705,0.00007030197,0.0005817477,0.000332141,0.00012550557,0.000053540854,0.0000013187476],"category_scores_gemma":[0.00006630085,0.00009794606,0.000037505444,0.00014716969,0.000080444814,0.00016984991,0.000019771414,0.00029268945,0.0000011531428],"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.00002062001,0.0000068817544,0.00049216003,0.000015233681,0.000017924142,0.0000026961075,0.00013190298,0.838854,0.000084195046,0.0017852613,0.00053559267,0.15805353],"study_design_scores_gemma":[0.00092543254,0.00017461293,0.0016529381,0.00018323668,0.000017107359,0.00038609188,0.00019023159,0.98245233,0.00041244872,0.0007665737,0.012617556,0.00022145922],"about_ca_topic_score_codex":0.0000010611344,"about_ca_topic_score_gemma":0.0000016885675,"teacher_disagreement_score":0.75891554,"about_ca_system_score_codex":0.00006365768,"about_ca_system_score_gemma":0.000026844138,"threshold_uncertainty_score":0.4474392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9533607,0.000007638646,0.04626188,0.000012845844,0.000057261557,0.00019363675,0.0000019141014,0.000002471692,0.000101644015],"genre_scores_gemma":[0.9943925,0.000002783297,0.0054714233,0.000050324914,0.00005117068,0.0000037702453,0.0000075623175,0.0000048823217,0.00001554384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992685,0.000015977796,0.00042540656,0.00006181716,0.00009081007,0.00013752736],"domain_scores_gemma":[0.9993241,0.000030172108,0.00034484666,0.00006434647,0.00020753757,0.000029024643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037939564,0.000069115245,0.000115741124,0.00009474979,0.0000495002,0.000023218954,0.000072671144,0.00005453304,0.000001214189],"category_scores_gemma":[0.0002052554,0.00005749463,0.000077186385,0.00008753131,0.000023224602,0.0000071621675,0.000022565704,0.00009335865,6.1197426e-7],"study_design_candidate":"bench_or_experimental","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.00045677533,0.00015693736,0.009528775,0.00014852658,0.00008036502,3.6882963e-7,0.000594553,0.43721142,0.32085183,0.0005865001,0.000112081034,0.23027186],"study_design_scores_gemma":[0.0019626697,0.003753467,0.005226331,0.0008232954,0.000016696697,0.000058210855,0.00039908593,0.31778452,0.6602531,0.000060645372,0.009360606,0.00030136108],"about_ca_topic_score_codex":0.00000906559,"about_ca_topic_score_gemma":0.0000051566612,"teacher_disagreement_score":0.33940127,"about_ca_system_score_codex":0.000013000568,"about_ca_system_score_gemma":0.000046166064,"threshold_uncertainty_score":0.2344563},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50648105,0.000007739201,0.48883018,0.00039619146,0.00022005918,0.00014852863,0.000014585895,0.0000061478963,0.0038955156],"genre_scores_gemma":[0.99850774,6.2466205e-7,0.0006665243,0.00006603197,0.00063877844,0.0000014938178,0.000011506866,0.0000058915357,0.000101397454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.000034631546,0.0003166925,0.0000862574,0.00035211982,0.00028709628],"domain_scores_gemma":[0.9982283,0.0009608754,0.00035420872,0.00018694322,0.00020589911,0.000063761865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015916215,0.000096333606,0.00013795104,0.000017429458,0.0008285599,0.0003496265,0.00032938554,0.0000136144945,0.0000361768],"category_scores_gemma":[0.0000978053,0.000040033963,0.00011392413,0.00014543736,0.00012730532,0.00014202825,0.000064916894,0.00020746869,0.000007650439],"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.00034759782,0.00011333379,0.087340206,0.000040763414,0.000356105,8.26285e-7,0.0019678003,0.112420425,0.00018976515,0.18920985,0.008173062,0.5998403],"study_design_scores_gemma":[0.0077218586,0.0013871894,0.075027056,0.0014861801,0.00017627243,0.00018074679,0.0128231,0.5891514,0.026194036,0.07480008,0.20989037,0.0011617342],"about_ca_topic_score_codex":0.000033057753,"about_ca_topic_score_gemma":6.805129e-7,"teacher_disagreement_score":0.5986785,"about_ca_system_score_codex":0.000015311834,"about_ca_system_score_gemma":0.000074055315,"threshold_uncertainty_score":0.6372697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053284755,0.00020052448,0.9869441,0.0015451192,0.0019531357,0.00032285048,0.000002121888,0.00012667394,0.0035770298],"genre_scores_gemma":[0.8245104,0.00009156752,0.17093922,0.0017798145,0.0022680121,0.000009815321,0.0000021086967,0.00002786841,0.0003712128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981299,0.000031951036,0.000590672,0.00021118688,0.00048214302,0.00055415626],"domain_scores_gemma":[0.99820286,0.0005657402,0.00038906236,0.00042649344,0.00026463208,0.00015121906],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012763261,0.00020342116,0.00022004356,0.00016920861,0.00134324,0.0010399347,0.0015923786,0.000058150294,0.0000058379205],"category_scores_gemma":[0.000083177445,0.00012709097,0.00021628874,0.0005340611,0.000054069373,0.00045342697,0.00026990712,0.0005200314,0.00003258222],"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.000029446683,0.00008942838,0.0007334592,0.000032878983,0.00009850973,0.0000749122,0.0011652695,0.023644174,0.000014231357,0.11363075,0.005762297,0.85472465],"study_design_scores_gemma":[0.0008650203,0.00036480877,0.0006813024,0.00015135108,0.0000134356005,0.0021403555,0.00018727517,0.8733663,0.000059058402,0.023153692,0.09872011,0.00029728067],"about_ca_topic_score_codex":0.0000066401103,"about_ca_topic_score_gemma":0.000004280385,"teacher_disagreement_score":0.85442734,"about_ca_system_score_codex":0.00007282432,"about_ca_system_score_gemma":0.00009814614,"threshold_uncertainty_score":0.9999971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035581857,0.000047869537,0.9581032,0.00014334595,0.00032183094,0.00019411548,2.9662476e-7,0.00017120583,0.0054362887],"genre_scores_gemma":[0.9410164,0.000031807598,0.058457136,0.00007461505,0.00020013147,0.0000055219266,0.000001741391,0.0000265152,0.00018615874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902785,0.000011398877,0.0003589052,0.00007444036,0.0002256663,0.00030175067],"domain_scores_gemma":[0.9994308,0.0001300634,0.00013336609,0.0001374019,0.00007670394,0.00009167742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022265948,0.00015998099,0.00012820521,0.00005479816,0.0003684157,0.00038017082,0.00018180977,0.00004012822,0.000017988188],"category_scores_gemma":[0.00003190775,0.000086155604,0.000038696056,0.00007153134,0.00002661968,0.0002733879,0.000028993072,0.00047402177,0.0000441818],"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.0000068688832,0.0000053171198,0.000025739742,0.000013888054,0.000029118755,0.000004193486,0.00022573935,0.9506029,0.000005870112,0.00024411367,0.0006996903,0.048136555],"study_design_scores_gemma":[0.00032617032,0.00019584657,0.00020446454,0.0002109866,0.0000077392,0.00011990861,0.0002510407,0.9946387,0.00024861653,0.000879075,0.0027352953,0.00018216841],"about_ca_topic_score_codex":0.0000031455133,"about_ca_topic_score_gemma":0.0000032818382,"teacher_disagreement_score":0.9054345,"about_ca_system_score_codex":0.00015055783,"about_ca_system_score_gemma":0.000018114455,"threshold_uncertainty_score":0.3665996},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931238,0.00006033637,0.067012146,0.00021146484,0.000034097236,0.000086756896,0.0000016712637,0.000078566874,0.0012769502],"genre_scores_gemma":[0.99639845,0.00002596999,0.0023541867,0.00068258756,0.00041972435,8.5255533e-7,0.000016578275,0.0000335661,0.0000680818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979169,0.000023903762,0.0008338445,0.00028077004,0.000510178,0.00043443596],"domain_scores_gemma":[0.99835795,0.00016964965,0.00074098946,0.00029100318,0.00038867272,0.00005172963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658765,0.00031345978,0.0007028384,0.0011853834,0.00046176373,0.00042775352,0.00033911242,0.00007483816,0.00011948217],"category_scores_gemma":[0.00022769318,0.00022487545,0.00027337915,0.0017956715,0.00008033428,0.0019439375,0.00019369026,0.0003978472,0.00002372075],"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.00017845348,0.00003194532,0.018474376,0.000030294754,0.0009285411,0.00003446369,0.00024008744,0.9676337,0.000030665367,0.0006177376,0.000013195191,0.011786517],"study_design_scores_gemma":[0.00062914006,0.000035733476,0.0010808547,0.00026633995,0.00095788646,0.0000270409,0.00061360875,0.9944679,0.000011257433,0.0011885549,0.00040256398,0.00031908564],"about_ca_topic_score_codex":0.00014090775,"about_ca_topic_score_gemma":0.000023646417,"teacher_disagreement_score":0.06516044,"about_ca_system_score_codex":0.000053474312,"about_ca_system_score_gemma":0.000015605267,"threshold_uncertainty_score":0.9170155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18132466,0.000014997671,0.8171858,0.00006834786,0.000197434,0.00015134366,0.0000023327445,0.00009634475,0.0009587046],"genre_scores_gemma":[0.63290113,0.0000017832509,0.36677736,0.00024183499,0.00006182791,8.425804e-7,0.0000018830202,0.000012890225,4.607386e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000032628224,0.00039982522,0.00009901601,0.00017745594,0.0002602356],"domain_scores_gemma":[0.99939823,0.00012685142,0.00014803636,0.00010606041,0.00010536144,0.000115483504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008031879,0.00015219285,0.00014003714,0.00014217469,0.00036395586,0.00014026032,0.00012991684,0.00005811494,0.000007567314],"category_scores_gemma":[0.000053307405,0.00011104183,0.000037551497,0.00023317954,0.0000412168,0.00018917445,0.000020488724,0.0003391715,0.0000029397759],"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.000018919762,0.000008982096,0.0005076252,0.00002800906,0.000021633798,0.0000035297019,0.0019389672,0.983667,0.00033762466,0.0016457357,0.000015496154,0.011806445],"study_design_scores_gemma":[0.00033996385,0.000076224234,0.0015876456,0.0002628824,0.000014056078,0.00017145848,0.00026890705,0.9949323,0.0015348452,0.0005774635,0.00005936419,0.00017491145],"about_ca_topic_score_codex":0.0000082075785,"about_ca_topic_score_gemma":0.000003682422,"teacher_disagreement_score":0.45157647,"about_ca_system_score_codex":0.0001484256,"about_ca_system_score_gemma":0.00003465278,"threshold_uncertainty_score":0.45281544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32259148,0.000055361706,0.67411476,0.00007084375,0.0013115458,0.00011478397,3.8688916e-7,0.00016644331,0.0015743993],"genre_scores_gemma":[0.8799097,0.000031311793,0.119119756,0.00023071805,0.00066586543,0.0000016084712,0.0000063659095,0.000021740076,0.000012916476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985003,0.000035910343,0.00062507764,0.00008038716,0.00023034037,0.00052801747],"domain_scores_gemma":[0.9992433,0.00015946479,0.00017258599,0.00016543824,0.000096296644,0.00016291808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793476,0.00016180343,0.00020022696,0.00006693199,0.000253446,0.00011333753,0.000115485906,0.000076835895,0.000031694726],"category_scores_gemma":[0.00023822396,0.0001326769,0.00008487287,0.00021381363,0.000022381935,0.0007346514,0.000027879814,0.00042234396,0.00004800025],"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.0000098257005,0.000013019742,0.0014252117,0.000039943963,0.000013082437,7.1985977e-7,0.00037987056,0.93291914,0.000013508725,0.0004012594,0.0006191907,0.06416525],"study_design_scores_gemma":[0.0002954149,0.000035960176,0.0027144726,0.00012440352,0.000009728999,0.000057627665,0.000029803085,0.992989,0.00008638971,0.0017448729,0.0017457557,0.00016655748],"about_ca_topic_score_codex":0.000003114105,"about_ca_topic_score_gemma":2.3955164e-7,"teacher_disagreement_score":0.5573183,"about_ca_system_score_codex":0.0002374884,"about_ca_system_score_gemma":0.000017051481,"threshold_uncertainty_score":0.54104066},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11319316,0.00001243003,0.8779364,0.00005257423,0.000980597,0.00009654349,0.0000010070974,0.0003363547,0.007390883],"genre_scores_gemma":[0.8107804,0.0000031909342,0.18808402,0.00016678286,0.00089641206,0.000001236178,0.0000025265697,0.0000426745,0.0000227789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985714,0.000034127508,0.00061091024,0.00011119052,0.00021823533,0.00045411213],"domain_scores_gemma":[0.9986095,0.00078041194,0.00021083378,0.00014196312,0.00011922034,0.00013809538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019203046,0.00018109234,0.00022525318,0.00015992622,0.00043696162,0.0002537524,0.00022379987,0.00007668334,0.000007979014],"category_scores_gemma":[0.001025416,0.00016188594,0.00012644917,0.00022290512,0.0000131112465,0.00021413516,0.000036314308,0.0004723713,0.000014519219],"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.000004545232,0.0000040816344,0.0007231378,0.000023416245,0.000018447176,8.093079e-7,0.00022243123,0.76984775,0.00012346273,0.0013183507,0.00015441867,0.22755916],"study_design_scores_gemma":[0.0005505147,0.00007320651,0.0005426023,0.0001385395,0.000008469851,0.00008043882,0.00007425296,0.9918287,0.0007855752,0.00033907648,0.005365251,0.0002133773],"about_ca_topic_score_codex":6.15337e-7,"about_ca_topic_score_gemma":1.4800221e-7,"teacher_disagreement_score":0.6975872,"about_ca_system_score_codex":0.00012766809,"about_ca_system_score_gemma":0.000017013675,"threshold_uncertainty_score":0.6601517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07247016,0.000003822595,0.9258223,0.00008789045,0.0005707641,0.0006559177,0.00000802819,0.00016248795,0.00021858349],"genre_scores_gemma":[0.030081233,0.0000034184734,0.9677952,0.00017966572,0.0016674342,0.000013620944,0.000024654613,0.00007096705,0.00016380586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978646,0.000030500178,0.00073286734,0.00022875382,0.00046140555,0.0006818913],"domain_scores_gemma":[0.99765337,0.00032468518,0.00047124736,0.00032357502,0.00084712176,0.00037999667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013312607,0.00024512774,0.00029663526,0.0002037717,0.00061309483,0.0003845265,0.00047017104,0.00015324877,0.000050890205],"category_scores_gemma":[0.00057833013,0.00018960035,0.00014559245,0.00025295958,0.00006784635,0.0005708247,0.000083899344,0.0011207467,0.000012292783],"study_design_candidate":"design_other","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.00003746594,0.00017449552,0.000024822171,0.000021891174,0.000034398607,0.000008760821,0.00024229805,0.0044656205,0.0008930521,0.001675323,0.00007058669,0.9923513],"study_design_scores_gemma":[0.0013772788,0.0006987337,0.000013181567,0.000029465764,0.000008925023,0.00018000306,0.00010046896,0.98285574,0.0035680498,0.0052553806,0.005649528,0.00026324586],"about_ca_topic_score_codex":0.0000015764434,"about_ca_topic_score_gemma":0.0000043694286,"teacher_disagreement_score":0.992088,"about_ca_system_score_codex":0.000079475285,"about_ca_system_score_gemma":0.00020040419,"threshold_uncertainty_score":0.7731678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033364467,0.0016749938,0.9579205,0.0010082707,0.0015336183,0.000569491,0.000006711206,0.0002881844,0.0036337606],"genre_scores_gemma":[0.6602071,0.00052080484,0.33552605,0.0027354036,0.0007043511,0.0000036534993,0.0000064280684,0.000068737834,0.00022747635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.000044719312,0.00083960046,0.000104711246,0.00032589474,0.00036342719],"domain_scores_gemma":[0.9989054,0.00023990026,0.0003374961,0.00021044328,0.00021584278,0.000090885624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458662,0.00017720091,0.00028555808,0.00009737837,0.0002998027,0.000051581115,0.00033078814,0.00005304221,0.0000073744686],"category_scores_gemma":[0.0004229566,0.00013250181,0.00022043653,0.0003901091,0.000023774031,0.00021759799,0.000035382294,0.0004660174,0.000010307626],"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.000006374539,0.000013407765,0.00023655809,0.0000947403,0.00002099045,0.0000013525863,0.00011002744,0.683602,0.00018968663,0.0001476405,0.003336271,0.31224096],"study_design_scores_gemma":[0.00048342027,0.00011239111,0.003781611,0.0017897591,0.000018999228,0.00012658934,0.000013941665,0.98446053,0.001265919,0.00062231085,0.0071176817,0.00020686604],"about_ca_topic_score_codex":2.68875e-7,"about_ca_topic_score_gemma":6.798577e-8,"teacher_disagreement_score":0.6268426,"about_ca_system_score_codex":0.0001413607,"about_ca_system_score_gemma":0.00005078336,"threshold_uncertainty_score":0.54032665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117845766,0.00013594127,0.8790553,0.000048997263,0.00019443853,0.00022579348,9.4446557e-7,0.0001192041,0.0023735876],"genre_scores_gemma":[0.66174436,0.000023906394,0.33772793,0.00012073301,0.00032776874,0.0000010492855,9.52772e-7,0.00003735954,0.000015945247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.000019636687,0.0004697736,0.000119876466,0.00026122798,0.0005124528],"domain_scores_gemma":[0.99836534,0.0010846679,0.00011487367,0.00012136551,0.00017305806,0.00014071225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031454894,0.00018028899,0.00018599184,0.0001387273,0.00061596953,0.0003053269,0.00019160713,0.00007731019,0.0000054603],"category_scores_gemma":[0.000058986854,0.00011913141,0.000044358865,0.00030156094,0.000031703108,0.0002531056,0.00003941976,0.0006296749,0.000002148698],"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.000040828723,0.0000061689425,0.0021588174,0.000055281398,0.0000740258,0.000005285873,0.00091510854,0.8868762,0.00024001296,0.0015756001,0.000020747086,0.108031884],"study_design_scores_gemma":[0.00091071316,0.0001595014,0.0014633049,0.00031888098,0.000026755559,0.0003587965,0.0005191457,0.9940493,0.0011794083,0.00016454297,0.0006352821,0.00021434431],"about_ca_topic_score_codex":0.0000037771224,"about_ca_topic_score_gemma":0.0000014263056,"teacher_disagreement_score":0.5438986,"about_ca_system_score_codex":0.00011040676,"about_ca_system_score_gemma":0.00005689162,"threshold_uncertainty_score":0.48580378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003816835,0.000042180218,0.99680275,0.00021298426,0.0003380296,0.0016808123,0.000004748383,0.00017164015,0.0003651967],"genre_scores_gemma":[0.060492404,0.000028008135,0.9382533,0.00078645756,0.00025185442,0.00011029608,0.000005418818,0.00003566276,0.000036585803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979615,0.000055251232,0.0006918731,0.0004640875,0.00034891057,0.0004783631],"domain_scores_gemma":[0.997919,0.0001924039,0.00061526353,0.00033294014,0.0007318134,0.00020854163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616303,0.00029643922,0.0002588412,0.00025170762,0.00094903726,0.00031408836,0.0007150038,0.00009159956,0.00000197072],"category_scores_gemma":[0.000118086995,0.00021626198,0.00009838046,0.0006741162,0.00004949949,0.0009702294,0.00021068176,0.0003759138,0.000012960638],"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.000009338959,0.00004108917,0.000016590835,0.0000067061637,0.000021054,7.515159e-7,0.004278943,0.553655,0.000026377798,0.00052862254,0.0000076413635,0.4414079],"study_design_scores_gemma":[0.0011432301,0.00028959734,0.00038540593,0.00008480637,0.000011305166,0.00015412457,0.00016299321,0.99560183,0.0006167229,0.00078329706,0.00046440467,0.00030230742],"about_ca_topic_score_codex":0.000013395229,"about_ca_topic_score_gemma":0.0000057175744,"teacher_disagreement_score":0.4419468,"about_ca_system_score_codex":0.00020352729,"about_ca_system_score_gemma":0.00009582853,"threshold_uncertainty_score":0.8818908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27821663,0.000073626245,0.6991756,0.00009275914,0.00086852186,0.00012719567,0.0000048993998,0.0006145217,0.020826282],"genre_scores_gemma":[0.88163775,0.0000042150778,0.11738871,0.0001567097,0.00071174046,0.0000014421379,0.000008432275,0.000042544252,0.00004843314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986339,0.000028558306,0.0005225122,0.000108790686,0.00030841219,0.00039781115],"domain_scores_gemma":[0.9992888,0.0002201528,0.00017642701,0.000116024734,0.00010385369,0.000094770294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056362577,0.00019637818,0.0001947976,0.00024266992,0.0003482088,0.0003002036,0.00017642905,0.00007357117,0.000037014805],"category_scores_gemma":[0.00020306827,0.00016876552,0.00010251574,0.00030336858,0.000027708445,0.0002664852,0.000021464646,0.0004834718,0.000028478362],"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.0000080978425,0.000012515781,0.0012066357,0.00002749244,0.000016072825,0.000015989277,0.00010496597,0.978745,0.00010481399,0.00089062983,0.00091162056,0.01795616],"study_design_scores_gemma":[0.0006258485,0.000061457715,0.004620547,0.00039356947,0.00001048166,0.00013025757,0.00007056853,0.9858475,0.003086517,0.00058927,0.0042468696,0.0003171438],"about_ca_topic_score_codex":0.0000032345968,"about_ca_topic_score_gemma":0.0000022721636,"teacher_disagreement_score":0.60342115,"about_ca_system_score_codex":0.00019659012,"about_ca_system_score_gemma":0.00008230718,"threshold_uncertainty_score":0.68820584},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102999255,0.000018026289,0.8902702,0.0055311006,0.00047199868,0.0003187289,0.0000045943225,0.00012237254,0.00026377657],"genre_scores_gemma":[0.9777406,0.0000016562717,0.00592981,0.010860001,0.0053675263,0.000005880871,0.000036007114,0.00003201516,0.000026520875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856645,0.000014233126,0.00048751646,0.00017460111,0.00032829744,0.00042888155],"domain_scores_gemma":[0.9984713,0.00037627426,0.00051515177,0.0002783914,0.00032506685,0.000033776327],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020584972,0.0002023747,0.00020114334,0.0001202503,0.0021163719,0.0010426576,0.0006847481,0.000043716256,0.000012625462],"category_scores_gemma":[0.00033371165,0.00011065688,0.00018717688,0.0005431868,0.0000507118,0.0010567008,0.00014748474,0.00039718175,0.00014210823],"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.000033337215,0.000025132707,0.000018947929,0.000006666994,0.00005141324,0.0000047869253,0.0001112743,0.6920263,0.000035925597,0.023492055,0.00038251647,0.2838116],"study_design_scores_gemma":[0.00056394783,0.00005795777,0.00030120034,0.00013310589,0.00007097677,0.000042948508,0.00036798534,0.9407821,0.00007212644,0.016518388,0.040862244,0.00022698705],"about_ca_topic_score_codex":0.000035205303,"about_ca_topic_score_gemma":0.0000057168604,"teacher_disagreement_score":0.88434035,"about_ca_system_score_codex":0.00014516794,"about_ca_system_score_gemma":0.000024059555,"threshold_uncertainty_score":0.99999434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7184145,0.0000023191762,0.27953798,0.000037622307,0.0002600349,0.00015247926,0.000004781186,0.000018014907,0.0015722801],"genre_scores_gemma":[0.9933538,1.5464555e-7,0.0058630453,0.00003035967,0.00067088054,6.036949e-7,0.000007901834,0.000014844445,0.000058416445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998407,0.0001617038,0.00070486695,0.00016170557,0.0003085407,0.00025618012],"domain_scores_gemma":[0.9986371,0.00017356177,0.0006769988,0.0001344774,0.00029041828,0.00008745672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013332634,0.00016078226,0.00028902458,0.00027190335,0.00020782917,0.00004955769,0.000083918545,0.000037609396,0.0000052702385],"category_scores_gemma":[0.000021253147,0.00013859404,0.00016367066,0.00041120837,0.000042085845,0.00012526664,0.000030527124,0.0003879114,0.0000027251776],"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.00033046125,0.00024454293,0.00202878,0.000022166609,0.000029193148,0.000001356102,0.0004188796,0.91034865,0.0069072917,0.0002635064,0.00013084081,0.07927434],"study_design_scores_gemma":[0.00082826044,0.00025387213,0.0047762743,0.00023779692,0.0000133643625,0.00007534963,0.00037341594,0.9668212,0.0261324,0.00011418473,0.0001649799,0.00020891606],"about_ca_topic_score_codex":0.000114760514,"about_ca_topic_score_gemma":3.7705797e-7,"teacher_disagreement_score":0.2749393,"about_ca_system_score_codex":0.000052706364,"about_ca_system_score_gemma":0.00014718954,"threshold_uncertainty_score":0.56517005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23322138,0.00021750439,0.7651798,0.00001607116,0.00040608717,0.00021581307,0.000005273593,0.00031124425,0.0004268072],"genre_scores_gemma":[0.7333082,0.000026648231,0.26621723,0.000044783723,0.0003466041,0.0000011472727,0.000012360106,0.000037867263,0.000005191365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998198,0.000013365397,0.0006382153,0.00018341273,0.00023634569,0.00073068315],"domain_scores_gemma":[0.99905527,0.00025848887,0.00028315786,0.000105326115,0.00014360684,0.0001541738],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00046607875,0.00027866702,0.0002879809,0.00018498818,0.001366114,0.00026481046,0.00015186601,0.00010864777,0.0000010032986],"category_scores_gemma":[0.00014811926,0.00026366883,0.00008461056,0.00015497293,0.00007127782,0.00035161222,0.00008961726,0.0004449047,0.000001560792],"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.000011164712,0.000017745784,0.0003285571,0.00009324781,0.000040223124,0.000017070914,0.00085710397,0.9744692,0.00013756623,0.00020527885,0.000021893939,0.023800947],"study_design_scores_gemma":[0.0006295797,0.00015280108,0.00011858581,0.00042980385,0.000022951335,0.0019819015,0.00022756631,0.9946323,0.00021652313,0.0001339594,0.0011096216,0.00034438565],"about_ca_topic_score_codex":0.0000050120884,"about_ca_topic_score_gemma":8.687358e-7,"teacher_disagreement_score":0.5000868,"about_ca_system_score_codex":0.00018064158,"about_ca_system_score_gemma":0.000037959016,"threshold_uncertainty_score":0.9999815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66774625,0.00008103337,0.33029053,0.000765219,0.00029966174,0.00016630601,3.2207367e-7,0.00008256775,0.0005681355],"genre_scores_gemma":[0.9946068,0.000006252598,0.003933758,0.00082123815,0.000534833,0.0000034214536,0.0000015004352,0.00000934552,0.00008283135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885726,0.000029215613,0.0003566794,0.00019667111,0.00023523168,0.0003249196],"domain_scores_gemma":[0.9989543,0.00039890484,0.0002864001,0.00018939201,0.00008884542,0.0000821744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065171026,0.00015831532,0.00017186026,0.00026291184,0.0006362906,0.00084094953,0.00032922736,0.000044665147,2.6902694e-7],"category_scores_gemma":[0.00007233207,0.00012292239,0.00010019001,0.00016317224,0.000014020518,0.0006075872,0.000097923585,0.00029589597,0.0000054808934],"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.00006934339,0.00007638864,0.01186204,0.00010366581,0.00007692547,0.000020602394,0.00092378235,0.054160584,0.0035693815,0.09399565,0.0009046493,0.834237],"study_design_scores_gemma":[0.0032412712,0.0014415847,0.038261876,0.0013011296,0.000039919465,0.00052249717,0.00008298066,0.9271944,0.006761795,0.015263437,0.005011622,0.00087745296],"about_ca_topic_score_codex":0.00007022682,"about_ca_topic_score_gemma":0.0000024306746,"teacher_disagreement_score":0.8730338,"about_ca_system_score_codex":0.00009885125,"about_ca_system_score_gemma":0.00003091468,"threshold_uncertainty_score":0.8109296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678395,0.000115546485,0.32047635,0.00014844436,0.00024945935,0.00036777792,8.100854e-7,0.000120189085,0.00012641631],"genre_scores_gemma":[0.89616895,0.0000438473,0.10339541,0.00005942924,0.00026231885,0.000008232647,0.0000015814131,0.000027708162,0.000032544463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905026,0.000025939347,0.00040570114,0.00013569334,0.0001209321,0.0002614694],"domain_scores_gemma":[0.99933636,0.0001822939,0.00014115186,0.00007133682,0.00014360812,0.00012526916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084803894,0.00014786712,0.00016483788,0.00014601195,0.0004954819,0.000253033,0.000050010094,0.00006844722,0.000002869488],"category_scores_gemma":[0.00034177405,0.00013080273,0.000029811274,0.00011415232,0.000036257068,0.0006793909,0.000041128733,0.00032760823,0.0000017386062],"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.000005174528,0.000011485189,0.012324706,0.00013444698,0.00005097962,3.3668343e-7,0.0033545133,0.49133986,0.0010916425,0.00026851802,0.00007746506,0.49134088],"study_design_scores_gemma":[0.000499277,0.00006207439,0.0135707455,0.00019748099,0.000010118767,0.00011668673,0.00016038728,0.9839265,0.00044060993,0.0006668238,0.00018042335,0.00016891574],"about_ca_topic_score_codex":0.000006508903,"about_ca_topic_score_gemma":0.0000014969936,"teacher_disagreement_score":0.4925866,"about_ca_system_score_codex":0.000055952023,"about_ca_system_score_gemma":0.000011728391,"threshold_uncertainty_score":0.53339803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055472,0.000046739005,0.19364871,0.000072142764,0.000025659807,0.00010263837,0.000012682048,0.00001584726,0.0005284288],"genre_scores_gemma":[0.84812164,0.00002852779,0.1517666,0.000035196572,0.000021559797,8.663665e-8,0.0000020204975,0.000004459869,0.000019910702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840385,0.0000496634,0.0008610954,0.000086298416,0.00042554198,0.000173532],"domain_scores_gemma":[0.99804515,0.0006291374,0.0006293602,0.00016005819,0.00044511826,0.00009118055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054477,0.00010082923,0.0004366934,0.0004704914,0.000091241556,0.00002620005,0.00012444916,0.000050310347,0.000040061444],"category_scores_gemma":[0.0010987674,0.00007736307,0.00012668283,0.0005533246,0.00009652112,0.00014536425,0.000043335,0.0002723799,4.798433e-7],"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.0004078174,0.0006822082,0.028213058,0.00047120944,0.0017272355,0.00004035826,0.012450294,0.6246954,0.00033025967,0.082202666,0.000090679794,0.2486888],"study_design_scores_gemma":[0.0014672709,0.00056187896,0.012600483,0.00024862663,0.00019047073,0.00008389054,0.0022433067,0.9443959,0.001115453,0.03682974,0.000030295536,0.0002326808],"about_ca_topic_score_codex":0.0000022958625,"about_ca_topic_score_gemma":8.602673e-7,"teacher_disagreement_score":0.31970048,"about_ca_system_score_codex":0.000056635294,"about_ca_system_score_gemma":0.00006527655,"threshold_uncertainty_score":0.31547743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2061107,0.00009919414,0.77631146,0.00007603561,0.0010901211,0.00012193652,5.159506e-7,0.00015966498,0.016030397],"genre_scores_gemma":[0.9927152,0.000020551415,0.0055533564,0.00023027835,0.0014467939,6.064038e-7,0.0000012482034,0.000017925824,0.000014035691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.00002414435,0.0005663949,0.0001095147,0.00032870096,0.00055066065],"domain_scores_gemma":[0.99923885,0.00023024411,0.00015250334,0.00016425728,0.00011396815,0.00010015095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018333414,0.0001857204,0.00019858818,0.00016441345,0.0007009645,0.00022869883,0.0002531888,0.00009031891,0.000039297156],"category_scores_gemma":[0.00004899492,0.00011635339,0.00018695081,0.00046570363,0.000046224,0.00034020818,0.00004558031,0.0010326008,0.000026818054],"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.000013293125,0.0000036269766,0.000964475,0.000008511368,0.00006963105,0.000008387148,0.00066484365,0.7534615,0.000040855688,0.00010579323,0.0003777658,0.24428135],"study_design_scores_gemma":[0.0003228339,0.00013478067,0.011035372,0.00022809197,0.00003903079,0.00043723383,0.00085142447,0.9770041,0.0008278425,0.004037084,0.0047878274,0.00029439534],"about_ca_topic_score_codex":0.0000065618938,"about_ca_topic_score_gemma":0.000021327942,"teacher_disagreement_score":0.7866045,"about_ca_system_score_codex":0.000256515,"about_ca_system_score_gemma":0.000025052625,"threshold_uncertainty_score":0.5391323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44397777,0.000020502526,0.5549315,0.00023243397,0.00009636467,0.0001857406,0.0000010496207,0.000074941934,0.00047967437],"genre_scores_gemma":[0.98526275,0.00001239409,0.014460803,0.00009334909,0.00014552359,8.16019e-7,0.0000020476296,0.0000036351112,0.000018658631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.00004170832,0.00017661774,0.000076946715,0.0001652798,0.00014647224],"domain_scores_gemma":[0.9994001,0.00016038242,0.0001766592,0.00001929656,0.0001556952,0.00008787946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081891945,0.00006824125,0.00009704735,0.000083132814,0.00088709744,0.00018140137,0.00003293942,0.00005030614,7.351959e-7],"category_scores_gemma":[0.00007188929,0.00005284489,0.000015405363,0.00011656425,0.000029673552,0.0002211507,8.414177e-7,0.00012641455,4.4091445e-7],"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.00088694785,0.00006659742,0.022793317,0.00013179952,0.0000738168,0.00001672779,0.050803345,0.697893,0.000055095818,0.06940759,0.00022489739,0.15764682],"study_design_scores_gemma":[0.006013921,0.0045923605,0.31906104,0.0023874147,0.00023542231,0.000698236,0.014768997,0.6449179,0.00016266164,0.0023015628,0.003866575,0.0009938789],"about_ca_topic_score_codex":0.000036990838,"about_ca_topic_score_gemma":0.000057607507,"teacher_disagreement_score":0.541285,"about_ca_system_score_codex":0.000060612216,"about_ca_system_score_gemma":0.000051352235,"threshold_uncertainty_score":0.6822926},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028586686,0.000051981893,0.95888454,0.00021468787,0.00032756355,0.00014056842,1.88262e-7,0.0001666209,0.01162715],"genre_scores_gemma":[0.9870892,0.0000915828,0.012436995,0.0002526775,0.00007927442,8.1465396e-7,4.5411528e-7,0.000015985415,0.000033018936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929816,0.00001736179,0.00031962333,0.000045339984,0.000120265315,0.00019924132],"domain_scores_gemma":[0.9994386,0.0002517453,0.000119707234,0.00010593045,0.00004827231,0.00003578483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000454965,0.000099639576,0.000115725954,0.00011964583,0.00012235816,0.000049478447,0.00018624686,0.00007817954,0.00004158889],"category_scores_gemma":[0.00003564706,0.000061521496,0.000045922705,0.00023382081,0.00002378377,0.000052874,0.000017636541,0.0004894759,0.000017693292],"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.000009466765,0.000007975306,0.000168112,0.000004270423,0.000019579238,0.0000038573435,0.00013097886,0.95857704,0.000012470338,0.004063943,0.0006947546,0.03630753],"study_design_scores_gemma":[0.00024506813,0.0001202075,0.00008385845,0.00016044838,0.0000027452134,0.00010454414,0.000025968822,0.99487627,0.00018437687,0.00074477284,0.003368233,0.00008348482],"about_ca_topic_score_codex":6.031358e-7,"about_ca_topic_score_gemma":2.965861e-7,"teacher_disagreement_score":0.95850253,"about_ca_system_score_codex":0.000031902844,"about_ca_system_score_gemma":0.0000093603085,"threshold_uncertainty_score":0.25087738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062122283,0.000021494228,0.9937358,0.00113682,0.00018482248,0.0004001628,0.000013448188,0.000060287686,0.00382595],"genre_scores_gemma":[0.008302797,0.000015545716,0.9885465,0.0006696544,0.0012000749,0.000014173665,0.00001897011,0.000040344636,0.0011919494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997246,0.0001604141,0.0010490074,0.00018324725,0.0008003998,0.00056089956],"domain_scores_gemma":[0.9931087,0.0052133617,0.00066863315,0.0002575757,0.0005916517,0.00016008528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00469586,0.00021523834,0.00030008375,0.00020252539,0.0010630491,0.00048433428,0.00045316073,0.00008475519,0.000044006905],"category_scores_gemma":[0.0032641054,0.0001365229,0.00017043322,0.0002651767,0.000044467914,0.00038593687,0.000097267395,0.0006318947,0.000019457832],"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.00025485703,0.0003751522,0.0001382583,0.0001335074,0.00041943672,0.0000055420032,0.005175033,0.5091495,0.000009613942,0.26374558,0.0077599953,0.21283352],"study_design_scores_gemma":[0.0012695675,0.000101272046,0.000012131204,0.000058654416,0.000014818087,0.00021155327,0.0008889678,0.96140385,0.000040308252,0.01663681,0.019184325,0.00017774188],"about_ca_topic_score_codex":0.0000013130517,"about_ca_topic_score_gemma":0.0000027213766,"teacher_disagreement_score":0.45225435,"about_ca_system_score_codex":0.00026086066,"about_ca_system_score_gemma":0.00017506648,"threshold_uncertainty_score":0.8176221},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6652342,0.000058669542,0.33085462,0.00032631747,0.00012705679,0.00013142478,0.0000010297432,0.00009664516,0.0031699971],"genre_scores_gemma":[0.95451075,0.0000037797292,0.04280933,0.0020580601,0.000363419,0.0000014929036,0.000020547015,0.000025314877,0.0002072971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987571,0.00003033724,0.0005090923,0.00023086365,0.00018148818,0.0002911226],"domain_scores_gemma":[0.9985611,0.00047392678,0.00046786637,0.0001357846,0.00032695453,0.00003436479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097474386,0.000248357,0.0004344235,0.00064272096,0.00034747913,0.0006593197,0.00026143936,0.0000491632,0.00045136],"category_scores_gemma":[0.00014107222,0.00016633164,0.0002084417,0.00085148495,0.00007570905,0.0010343709,0.00007678669,0.0002830664,0.000024566132],"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.0011896621,0.000059405003,0.0055258046,0.000036693466,0.0020473963,0.000011280949,0.0006474695,0.5171314,0.000012902322,0.008066725,0.00027869098,0.46499255],"study_design_scores_gemma":[0.00085344125,0.00017193648,0.0013594087,0.00014232601,0.000426487,0.000043854263,0.00034603296,0.95861727,0.00004191031,0.020989666,0.0166539,0.0003537451],"about_ca_topic_score_codex":0.000009835445,"about_ca_topic_score_gemma":0.0000048175234,"teacher_disagreement_score":0.46463883,"about_ca_system_score_codex":0.000045577028,"about_ca_system_score_gemma":0.000016481521,"threshold_uncertainty_score":0.6782807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122612074,0.000020754558,0.87437385,0.000063046115,0.0023590457,0.00013552229,0.000001843001,0.000048598453,0.0003852338],"genre_scores_gemma":[0.6765639,0.0000059135527,0.32162687,0.00043777976,0.0012993823,0.0000012176935,0.0000035166145,0.000013420193,0.000047974932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891096,0.000017924465,0.0004613409,0.00012771362,0.00024682592,0.00023523795],"domain_scores_gemma":[0.99871695,0.00016085652,0.00040499843,0.00020912378,0.00039145772,0.000116622046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095669,0.00011961334,0.00017547027,0.00017126289,0.00027952212,0.0001928451,0.0006119389,0.00006952066,0.000015115507],"category_scores_gemma":[0.00012150139,0.000092804665,0.00008990444,0.0003626435,0.000029795186,0.00047550103,0.00007760516,0.00033021555,0.000009751821],"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.000027982176,0.00011059574,0.00007630102,0.000023556651,0.000029238528,0.0000063583097,0.00037412567,0.0021835773,0.0042681713,0.11796106,0.00030278097,0.87463623],"study_design_scores_gemma":[0.002609705,0.0012365797,0.00006385252,0.0000667321,0.000010921416,0.00036101922,0.0000414538,0.8768154,0.059802733,0.017390192,0.041256502,0.00034491485],"about_ca_topic_score_codex":4.9568143e-7,"about_ca_topic_score_gemma":1.788649e-7,"teacher_disagreement_score":0.8746318,"about_ca_system_score_codex":0.000015669597,"about_ca_system_score_gemma":0.00010590877,"threshold_uncertainty_score":0.37844643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10404655,0.00004836214,0.8935875,0.000045315126,0.0009234214,0.00026093633,0.0000026984596,0.00036618533,0.000718989],"genre_scores_gemma":[0.8540584,0.000004849853,0.14504194,0.00021198994,0.0005557106,0.0000041638755,0.0000068236236,0.00007461778,0.000041529132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980346,0.000036829268,0.00083140587,0.0001539062,0.00036594638,0.00057732477],"domain_scores_gemma":[0.9986108,0.00045636715,0.00029639716,0.00018432453,0.00023343106,0.00021866208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010687632,0.00027370965,0.00032289792,0.00028384585,0.0006409473,0.00013793856,0.00027323165,0.00012025338,0.0000092419195],"category_scores_gemma":[0.0006286688,0.00025389032,0.00016836451,0.00030198618,0.000048425474,0.00018429673,0.000031663396,0.0006531325,0.000016213293],"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.000015630725,0.000020605732,0.0011330555,0.00005710228,0.000032086347,0.000010221727,0.00054902607,0.9801502,0.000048496546,0.0001166744,0.0002878813,0.017578969],"study_design_scores_gemma":[0.0012974476,0.00015444035,0.00043263772,0.0003207565,0.00001555694,0.00017225239,0.000034908066,0.99620503,0.00017818116,0.00009483297,0.0007861877,0.00030777798],"about_ca_topic_score_codex":0.0000016344634,"about_ca_topic_score_gemma":8.8185345e-7,"teacher_disagreement_score":0.7500118,"about_ca_system_score_codex":0.00028323795,"about_ca_system_score_gemma":0.00013279637,"threshold_uncertainty_score":0.99999136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893547,0.000044180095,0.0045110295,0.00022269104,0.0002374719,0.0000707481,1.7578853e-7,0.000041813306,0.0055171475],"genre_scores_gemma":[0.99835336,0.000007982591,0.00044377017,0.0007494158,0.00041124507,3.4056958e-7,0.0000013730804,0.000011371162,0.000021135018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.000010934876,0.0006097448,0.000107618194,0.00029813126,0.00023141823],"domain_scores_gemma":[0.9989748,0.00007149398,0.00069609843,0.000095180505,0.00014844559,0.000013983407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802365,0.00012966394,0.0002545951,0.00061367854,0.00015171831,0.00013865021,0.00019349292,0.000040949017,0.000041372063],"category_scores_gemma":[0.0001988644,0.000111584945,0.000093225346,0.00063337194,0.00003090014,0.001084491,0.000083787556,0.00029983916,0.000069023],"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.00007568266,0.00030081515,0.057914566,0.00017658627,0.00009534985,0.000055855937,0.00088275765,0.66176474,0.00019714527,0.014883449,0.0003735263,0.2632795],"study_design_scores_gemma":[0.0013081476,0.000040602088,0.01788556,0.00060111686,0.00003254266,0.000021626094,0.00038463288,0.9564372,0.00009917477,0.020726586,0.0021496643,0.00031317145],"about_ca_topic_score_codex":0.000027081005,"about_ca_topic_score_gemma":0.0000053455224,"teacher_disagreement_score":0.29467243,"about_ca_system_score_codex":0.00007448737,"about_ca_system_score_gemma":0.000004407404,"threshold_uncertainty_score":0.4550302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063979745,0.000019520694,0.93432844,0.00021894954,0.00043890838,0.0005103789,0.0000019669076,0.00019784921,0.00030422967],"genre_scores_gemma":[0.7023861,0.0000047873696,0.2966083,0.0004273254,0.00049729494,0.00001619218,0.000010524772,0.000038387312,0.000011091648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986491,0.00006396265,0.0005492037,0.00014383637,0.0002577887,0.00033607165],"domain_scores_gemma":[0.99855655,0.00055541017,0.0002101955,0.0001952953,0.00035635778,0.00012619236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014569184,0.00019631104,0.0001673776,0.00015560945,0.00068998395,0.0006165563,0.00018941962,0.00008825001,0.000017955985],"category_scores_gemma":[0.00020037148,0.00014319738,0.000054591175,0.00027263537,0.000025756228,0.00045703107,0.000011944746,0.00042682272,0.0000120086615],"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.0000024551143,0.000009389262,0.00009708145,0.000011719733,0.00001726221,3.343767e-7,0.0003654738,0.7539937,0.0002999023,0.00007131263,0.00017393402,0.24495743],"study_design_scores_gemma":[0.00054450403,0.0001689665,0.00078549003,0.0001013458,0.000012424548,0.000025504372,0.00016145925,0.9968854,0.000858458,0.0000681519,0.00019642428,0.00019184356],"about_ca_topic_score_codex":0.0000148928375,"about_ca_topic_score_gemma":0.0000015105167,"teacher_disagreement_score":0.63840634,"about_ca_system_score_codex":0.00014125824,"about_ca_system_score_gemma":0.000048854658,"threshold_uncertainty_score":0.5945467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030174015,0.000024325187,0.96624744,0.0012738633,0.00025223952,0.0009893476,0.000004031336,0.00007405778,0.00096066936],"genre_scores_gemma":[0.015423387,0.000012757,0.98415446,0.00013197876,0.00016122343,0.000012350142,0.0000030461265,0.000035313693,0.00006550954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997787,0.00006335428,0.0008518789,0.00016876527,0.00047416004,0.00065485295],"domain_scores_gemma":[0.99684423,0.0019905407,0.00047342633,0.00018805783,0.00035473052,0.0001489931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364642,0.00019013317,0.00028256772,0.00021173507,0.00067150523,0.00034656076,0.0003242248,0.00008803368,0.0000048976553],"category_scores_gemma":[0.0026402858,0.00012500634,0.00012708466,0.00037855044,0.00010958086,0.00012605962,0.000088057255,0.00075657194,0.000008759758],"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.00029646303,0.00031510094,0.00023904003,0.00013603276,0.00010509482,0.00010366318,0.0019661363,0.20799416,0.000038985338,0.091599636,0.00008476693,0.6971209],"study_design_scores_gemma":[0.005985667,0.0004943135,0.000046716264,0.00074341433,0.000011557814,0.001266915,0.002476512,0.7734799,0.0012234094,0.21157269,0.0023158216,0.00038307885],"about_ca_topic_score_codex":0.0000032890878,"about_ca_topic_score_gemma":0.000008071106,"teacher_disagreement_score":0.6967378,"about_ca_system_score_codex":0.00035649285,"about_ca_system_score_gemma":0.00028738516,"threshold_uncertainty_score":0.5164743},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24368696,0.000025266803,0.74641174,0.000006841169,0.0007053306,0.00020431109,0.0000019192803,0.00039807332,0.00855958],"genre_scores_gemma":[0.7322289,0.000003936932,0.2672054,0.00012146156,0.0003611852,0.0000029369196,0.0000031400534,0.000052590924,0.000020504021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849004,0.000041664298,0.0006647791,0.00013381432,0.00020419426,0.00046553856],"domain_scores_gemma":[0.9991186,0.00012122547,0.00022456242,0.00017317348,0.00014865518,0.00021374655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014930516,0.00020366347,0.00022731091,0.0002027205,0.00030666945,0.00014415578,0.00028406494,0.000060638413,0.000019689072],"category_scores_gemma":[0.00019663188,0.00018691523,0.00010724302,0.00012742275,0.000021273712,0.0004166116,0.000037226084,0.00046281432,0.000015371863],"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.000041916453,0.000051919542,0.0017487889,0.00010905741,0.00008120827,0.000019251114,0.004257629,0.8336111,0.00012185925,0.0021179907,0.0005009239,0.15733838],"study_design_scores_gemma":[0.00059981504,0.0002644311,0.00044049247,0.00017970515,0.000015364238,0.00025231863,0.00014191086,0.9945787,0.0009561811,0.0015560283,0.00073344976,0.00028155863],"about_ca_topic_score_codex":0.0000029804885,"about_ca_topic_score_gemma":4.5858653e-7,"teacher_disagreement_score":0.4885419,"about_ca_system_score_codex":0.00013600118,"about_ca_system_score_gemma":0.00004382889,"threshold_uncertainty_score":0.7622182},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9042482,0.00002399681,0.09182819,0.00031459474,0.0002918679,0.0000788593,0.0000014669947,0.00011602665,0.003096796],"genre_scores_gemma":[0.99647886,0.000007507578,0.00041715082,0.0018256342,0.0012019789,2.3725751e-7,0.00003346752,0.000023372495,0.000011789634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.000017764576,0.0008358021,0.00018881298,0.0005271322,0.00046789856],"domain_scores_gemma":[0.9978937,0.00030487182,0.001228422,0.0001806602,0.00035773334,0.00003460234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230382,0.00023400152,0.00036381182,0.00021971078,0.00049430266,0.00017801643,0.00030637134,0.000099218196,0.000021610755],"category_scores_gemma":[0.000580457,0.00019629083,0.00023493134,0.00081359554,0.00008006037,0.0017017185,0.00019736041,0.00051827723,0.00018700323],"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.0024030602,0.0007425865,0.011191031,0.00053784123,0.0006360206,0.00036664677,0.0009874426,0.3781505,0.047715206,0.10218827,0.016256427,0.43882498],"study_design_scores_gemma":[0.0035571505,0.00029711015,0.0027154183,0.0019892792,0.00038743264,0.00022895425,0.00162315,0.79305273,0.097298555,0.034215838,0.062885426,0.0017489594],"about_ca_topic_score_codex":0.000019356545,"about_ca_topic_score_gemma":0.0000016459268,"teacher_disagreement_score":0.437076,"about_ca_system_score_codex":0.00014872788,"about_ca_system_score_gemma":0.000018808756,"threshold_uncertainty_score":0.80045074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25666466,0.00020905088,0.74114263,0.00017177631,0.00051526923,0.0002482886,0.000040223436,0.00009534251,0.0009127566],"genre_scores_gemma":[0.99385625,0.000012971884,0.0057704654,0.00012689889,0.00017423471,0.000004531167,0.0000066740226,0.00001425697,0.000033709992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891,0.000007772757,0.0006978023,0.00005247888,0.00016567117,0.00016628657],"domain_scores_gemma":[0.99924344,0.00020582354,0.00013868598,0.00008610188,0.0002653384,0.000060582508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004249498,0.00011241822,0.00026511337,0.00017227269,0.000091726324,0.000040921204,0.00009677783,0.00005390346,0.000010822674],"category_scores_gemma":[0.000037248905,0.00008988555,0.00016868343,0.00015342822,0.000016687414,0.0001349459,0.0000020677983,0.0002053061,0.0000044518406],"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.000025052108,0.00001704665,0.000031294938,0.00007569448,0.000497528,0.0000013251495,0.0007080757,0.98455364,0.00031524964,0.0077057215,0.000369867,0.0056994986],"study_design_scores_gemma":[0.0017255786,0.00023371045,0.0020716577,0.00015501169,0.000640899,0.00011513602,0.00046767868,0.8880565,0.003321821,0.00018747582,0.10269332,0.00033122205],"about_ca_topic_score_codex":0.0000010414311,"about_ca_topic_score_gemma":0.0000038041828,"teacher_disagreement_score":0.7371916,"about_ca_system_score_codex":0.000046165518,"about_ca_system_score_gemma":0.000036773,"threshold_uncertainty_score":0.36654264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49215144,0.000023805707,0.50611013,0.00015064294,0.0010663422,0.00017686718,0.0000013838879,0.00010929511,0.00021009365],"genre_scores_gemma":[0.9377359,0.000015616777,0.059765734,0.0012778806,0.0011502919,0.000005222747,0.0000033383765,0.000028796847,0.000017223741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725825,0.00006330534,0.0008799199,0.00034635467,0.00077264715,0.0006795499],"domain_scores_gemma":[0.99789,0.0004465309,0.0005337084,0.00036608157,0.00044542868,0.00031823295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012890766,0.00031483846,0.00037872288,0.00027922646,0.0010112085,0.0002765378,0.0007511676,0.000105389045,0.000008132575],"category_scores_gemma":[0.00023298878,0.00025471285,0.00035379268,0.0005350081,0.000071016155,0.000448106,0.0001719786,0.000594821,0.00026596733],"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.0003515084,0.0002722425,0.0007282181,0.00004776455,0.00010158645,0.00025660297,0.0019688387,0.8186201,0.0170944,0.002766673,0.0053541823,0.15243791],"study_design_scores_gemma":[0.0040792935,0.00025183056,0.00055583013,0.00012451486,0.000009593992,0.001642296,0.000017783936,0.93964,0.051057182,0.00030528684,0.0019207052,0.00039568852],"about_ca_topic_score_codex":0.0000033078702,"about_ca_topic_score_gemma":5.592491e-7,"teacher_disagreement_score":0.44634438,"about_ca_system_score_codex":0.00027177393,"about_ca_system_score_gemma":0.00029397666,"threshold_uncertainty_score":0.9999905},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03277739,0.00008670631,0.96017957,0.00030898923,0.0008319357,0.00035440436,0.000002815363,0.00019883744,0.0052593416],"genre_scores_gemma":[0.90467983,0.00005216349,0.09407566,0.000532773,0.0005141559,0.000005883625,0.0000023436924,0.000047383157,0.00008979822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992295,0.0000049391415,0.00026176186,0.000076105236,0.0001598299,0.000267873],"domain_scores_gemma":[0.99933696,0.00025474167,0.00011381583,0.0001028005,0.00009748437,0.00009422675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048238356,0.00014204762,0.00012885303,0.00008501181,0.00035794353,0.00034107032,0.00014372553,0.00006029195,0.000012452828],"category_scores_gemma":[0.000025808331,0.00008236067,0.000040453902,0.00014236421,0.00003239046,0.00015917874,0.000020416193,0.00060764106,0.0000052939326],"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.000010660698,0.000008357406,0.00036503948,0.000049972045,0.000068616864,0.0000029651962,0.0016918811,0.40175146,0.00018601211,0.0013021149,0.00023215135,0.5943308],"study_design_scores_gemma":[0.0009396694,0.000110761,0.0005018059,0.00015371697,0.00001365413,0.00041528352,0.00005474735,0.9385872,0.000341705,0.00015907527,0.05852293,0.0001994429],"about_ca_topic_score_codex":0.0000021127964,"about_ca_topic_score_gemma":0.0000034755035,"teacher_disagreement_score":0.87190247,"about_ca_system_score_codex":0.000016628584,"about_ca_system_score_gemma":0.000022020204,"threshold_uncertainty_score":0.33585706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024372334,0.00015271392,0.97320247,0.00065830816,0.00015776162,0.0005584947,0.0000010662937,0.00008158553,0.0008152532],"genre_scores_gemma":[0.5862747,0.0000016299379,0.41310278,0.00041157668,0.000177036,0.0000031806007,3.9515393e-7,0.00000610425,0.00002260572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722457,0.0000828118,0.001028242,0.00030971295,0.0007325514,0.000622094],"domain_scores_gemma":[0.9961501,0.0022608624,0.0006578389,0.00018495308,0.00048517683,0.00026112207],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010784554,0.00020036747,0.00039466057,0.00042696286,0.0011896761,0.0017416615,0.00039070527,0.00009186714,0.000004010488],"category_scores_gemma":[0.0031390341,0.00013490251,0.00018472035,0.0004408229,0.0000850566,0.00045639573,0.000032334796,0.00049814914,0.0000060667553],"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.00009947037,0.000076243596,0.00045597085,0.0000062735194,0.00004511992,0.000007576872,0.0011262174,0.16124053,0.00017966755,0.005791992,0.00016369284,0.8308072],"study_design_scores_gemma":[0.0020072637,0.00067140907,0.0005224711,0.00016545248,0.00003055352,0.0007198384,0.00096118724,0.974057,0.00009490721,0.018913522,0.0015902526,0.00026610243],"about_ca_topic_score_codex":0.0000022627692,"about_ca_topic_score_gemma":1.6910438e-7,"teacher_disagreement_score":0.83054113,"about_ca_system_score_codex":0.00005988466,"about_ca_system_score_gemma":0.0001938131,"threshold_uncertainty_score":0.99929464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059733357,0.00006882583,0.937962,0.000028777504,0.00024196971,0.00032427174,0.000002108374,0.00017037078,0.0014683185],"genre_scores_gemma":[0.50771207,0.000020667632,0.49191678,0.00007762592,0.00019913449,0.000005533726,0.0000011666814,0.000041756437,0.00002523882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998905,0.000015169083,0.00041862833,0.00011185088,0.00018809678,0.0003612405],"domain_scores_gemma":[0.99914724,0.00032911403,0.00015543228,0.00013385243,0.00012672784,0.00010762819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096417224,0.00018762582,0.0001927376,0.00008425561,0.00043362254,0.00016777714,0.00019690653,0.000065626446,0.0000072165653],"category_scores_gemma":[0.00002795349,0.0001167311,0.000063037085,0.00015753243,0.000036520625,0.00023464407,0.00003064136,0.0004614228,0.0000031949976],"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.00004991664,0.000010704981,0.0010724971,0.000032716278,0.000095811505,0.0000034623133,0.0031044057,0.59243816,0.000023294044,0.0001569635,0.000028848975,0.4029832],"study_design_scores_gemma":[0.0018471689,0.00014598049,0.0012332391,0.00015929264,0.000024460925,0.00023236175,0.00024573528,0.99401724,0.0010373384,0.00011998955,0.0007370047,0.00020016341],"about_ca_topic_score_codex":0.0000075446414,"about_ca_topic_score_gemma":0.000004564747,"teacher_disagreement_score":0.44797873,"about_ca_system_score_codex":0.000052194802,"about_ca_system_score_gemma":0.00003085662,"threshold_uncertainty_score":0.4760156},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4843866,0.00009221746,0.49628952,0.0025911562,0.014605965,0.00031656228,0.0000044096673,0.00011823963,0.0015953186],"genre_scores_gemma":[0.92669815,0.0000031147918,0.004054418,0.0003923664,0.068816006,0.0000016436918,0.0000057621005,0.000010184621,0.000018387653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977273,0.00016779188,0.0005854106,0.00027753648,0.0006958881,0.0005461246],"domain_scores_gemma":[0.99816954,0.0012131045,0.00007886915,0.0002834519,0.00014957445,0.00010545996],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018055773,0.00018395946,0.0002144373,0.00027594014,0.00058216596,0.0014312449,0.0008617061,0.000097841155,0.0000019421634],"category_scores_gemma":[0.00007051438,0.0001223914,0.00006207447,0.0006291324,0.00004463785,0.00033539993,0.00028864507,0.0013035088,0.000048069145],"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.00002327224,0.000105178115,0.001510318,0.0000054323114,0.000019921657,0.00007667685,0.0013756537,0.8903855,0.000012010652,0.023235625,0.06433858,0.018911818],"study_design_scores_gemma":[0.00062182354,0.00021047918,0.010000323,0.00024751908,0.0000012074217,0.00011110389,0.000020243306,0.9486037,0.000013258525,0.00039849215,0.039597858,0.00017398389],"about_ca_topic_score_codex":0.00018307222,"about_ca_topic_score_gemma":0.000022734182,"teacher_disagreement_score":0.49223512,"about_ca_system_score_codex":0.00016287969,"about_ca_system_score_gemma":0.00009085851,"threshold_uncertainty_score":0.99960536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0588155,0.000108822096,0.9396354,0.000045657598,0.00033958018,0.00043357586,0.000003925754,0.00017481949,0.0004427303],"genre_scores_gemma":[0.39220092,0.000036639212,0.60752255,0.000052522035,0.00013365249,0.000006810636,0.0000014962934,0.00003368752,0.000011729855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987023,0.000031659118,0.00047874058,0.00011845731,0.00021094753,0.00045791097],"domain_scores_gemma":[0.9991105,0.00039048283,0.00010510702,0.00012650513,0.0001344765,0.00013291456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018279253,0.000179404,0.000190743,0.00012888708,0.000430494,0.00024339255,0.00021191634,0.00004893755,0.000009111903],"category_scores_gemma":[0.000088722096,0.00012507667,0.00008188407,0.00012867663,0.00008034277,0.00018809583,0.00006174322,0.0005602496,0.0000034355357],"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.00000603247,0.000008340708,0.00010975471,0.000030046096,0.000056530105,0.000009440409,0.0011143604,0.13085544,0.00002113496,0.0001328344,0.000012875392,0.86764324],"study_design_scores_gemma":[0.0005311032,0.00011317028,0.00042930784,0.00012650114,0.000017177708,0.0006141662,0.00030559528,0.99648947,0.0004041837,0.00018819234,0.00060776854,0.00017338434],"about_ca_topic_score_codex":0.0000063670805,"about_ca_topic_score_gemma":6.612322e-7,"teacher_disagreement_score":0.86746985,"about_ca_system_score_codex":0.00008936616,"about_ca_system_score_gemma":0.000047607184,"threshold_uncertainty_score":0.51004785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38863227,0.00010355181,0.6046931,0.000019740615,0.00024899672,0.000050527015,7.9658247e-7,0.00038634066,0.0058646863],"genre_scores_gemma":[0.9913801,0.000062043626,0.007946875,0.0002997747,0.0002674339,7.588507e-7,0.0000047811077,0.000029091321,0.000009150888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989081,0.000013299059,0.00042873138,0.000085046195,0.00023916604,0.0003256373],"domain_scores_gemma":[0.9995917,0.00006920268,0.000093476636,0.00008618681,0.000040490515,0.00011890939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024331624,0.00017177645,0.0001740428,0.0001426107,0.00048824862,0.00012400364,0.00016595516,0.000085316104,0.000018548368],"category_scores_gemma":[0.000012478785,0.00015323194,0.00008698393,0.00012747303,0.000027087706,0.00046833328,0.00002208854,0.00066204753,0.000021515107],"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.000017570927,0.000037301645,0.0010276828,0.000044127217,0.0000866449,0.00013783513,0.0018935151,0.32034844,0.012102207,0.00027240775,0.019634776,0.6443975],"study_design_scores_gemma":[0.00095313083,0.00031677846,0.0010528435,0.0004296831,0.000011057285,0.0034665482,0.00027074874,0.93060577,0.05684577,0.0005042321,0.004814328,0.0007291266],"about_ca_topic_score_codex":0.0000032055343,"about_ca_topic_score_gemma":3.1149037e-7,"teacher_disagreement_score":0.64366835,"about_ca_system_score_codex":0.00015133386,"about_ca_system_score_gemma":0.000017253904,"threshold_uncertainty_score":0.6248617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4595493,0.00005639907,0.53955704,0.00011920461,0.00022908411,0.00028938628,4.4690353e-7,0.000120317905,0.00007881664],"genre_scores_gemma":[0.7094458,0.000017967672,0.2901905,0.000021213504,0.00027968807,0.000003122408,0.0000030012468,0.00002510113,0.000013667967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989302,0.000014217353,0.0004564137,0.00011955821,0.00018736803,0.00029225595],"domain_scores_gemma":[0.9993022,0.000163967,0.000112960224,0.00009093476,0.00025237244,0.000077532015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024878718,0.0001423739,0.00012697803,0.00012018946,0.00047894663,0.0001793918,0.000083661485,0.000040392115,4.0792415e-7],"category_scores_gemma":[0.00020655981,0.00008769022,0.000031318494,0.00029630825,0.000031924385,0.0002505459,0.000003482715,0.00039651492,3.6697315e-7],"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.00009556921,0.0000065374447,0.0024207165,0.000043102424,0.00004321878,0.0000017780353,0.0009219963,0.7891772,0.0006939444,0.000121793615,0.00002022241,0.20645393],"study_design_scores_gemma":[0.00082584366,0.00045758643,0.013888325,0.00092037587,0.000058491125,0.00046622564,0.0014741273,0.96061444,0.01670401,0.00015423803,0.003937664,0.0004986976],"about_ca_topic_score_codex":0.0000011192726,"about_ca_topic_score_gemma":0.000017277143,"teacher_disagreement_score":0.24989645,"about_ca_system_score_codex":0.00007646821,"about_ca_system_score_gemma":0.000038758946,"threshold_uncertainty_score":0.36837187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7786696,0.00011519294,0.21651973,0.00026404535,0.0015132331,0.00034507216,0.0000011015401,0.0001972343,0.0023747806],"genre_scores_gemma":[0.9945964,0.000011416565,0.0016501585,0.001003876,0.0025961993,0.0000059143754,0.000006109947,0.000040198014,0.0000896789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796635,0.000015262132,0.0007524065,0.00025872185,0.00039741315,0.0006098745],"domain_scores_gemma":[0.9980219,0.00026648806,0.0010482015,0.00022176346,0.00039099925,0.00005063256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127004,0.0002952328,0.00041509606,0.00053317286,0.0009648527,0.0008824963,0.00041926853,0.00007586915,0.000015680509],"category_scores_gemma":[0.0004446144,0.00024078997,0.00027604177,0.00058878656,0.00004714714,0.0018591608,0.00014196117,0.0004456999,0.00008691556],"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.0007672358,0.0002640642,0.027998954,0.00044175316,0.0006292431,0.00030184063,0.00070679147,0.7157664,0.00022826837,0.091152966,0.0015292538,0.16021328],"study_design_scores_gemma":[0.0016275834,0.00008574518,0.0014011741,0.0007997508,0.00016353496,0.00022073074,0.00080321153,0.93101037,0.00006447577,0.009880629,0.05331065,0.0006321594],"about_ca_topic_score_codex":0.00006101308,"about_ca_topic_score_gemma":0.0000070624665,"teacher_disagreement_score":0.21592684,"about_ca_system_score_codex":0.00023028112,"about_ca_system_score_gemma":0.000029338538,"threshold_uncertainty_score":0.98191303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13671775,0.00009346209,0.86099845,0.0013395885,0.00022805684,0.0003144755,0.0000022337967,0.00006224112,0.00024373211],"genre_scores_gemma":[0.9170832,0.000020954089,0.081887275,0.00074665813,0.00022136436,0.0000065268578,0.000001794007,0.000014954411,0.000017280732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983235,0.00009548725,0.00046437106,0.00026367602,0.0003542933,0.000498646],"domain_scores_gemma":[0.9960949,0.002883906,0.00032862634,0.00024191389,0.0002677812,0.00018289743],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002413242,0.00019058175,0.0002244395,0.0001978414,0.0013059286,0.00069101446,0.0006375012,0.00003990277,0.0000016782736],"category_scores_gemma":[0.00033430054,0.00012609115,0.0000781806,0.00023400654,0.00013694543,0.0006650307,0.000296965,0.00048376512,0.0000026188834],"study_design_candidate":"design_other","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.000072324576,0.00002290767,0.00039402954,0.000054551325,0.00008511452,0.000008692115,0.0019831934,0.006948365,0.00034824028,0.056024197,0.0002722084,0.93378615],"study_design_scores_gemma":[0.0016855743,0.00047677197,0.0009454217,0.00016179842,0.000009257009,0.0011111184,0.00018540614,0.91205955,0.0011145053,0.08037053,0.0016308244,0.00024926447],"about_ca_topic_score_codex":0.0000022353095,"about_ca_topic_score_gemma":0.0000012811631,"teacher_disagreement_score":0.9335369,"about_ca_system_score_codex":0.000044134365,"about_ca_system_score_gemma":0.000044469107,"threshold_uncertainty_score":0.9999942},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011056587,0.00004227262,0.9974267,0.00003038062,0.00033221787,0.0001795503,0.0000018167252,0.00028334174,0.00059805805],"genre_scores_gemma":[0.25141826,0.0000025973236,0.74809307,0.00003755124,0.00037390797,0.0000018329283,0.000004269812,0.000017862036,0.000050659488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898386,0.0000063233424,0.00042216387,0.00008810713,0.0001588221,0.00034075158],"domain_scores_gemma":[0.9992086,0.00042070213,0.00010659958,0.00011415324,0.00004948534,0.00010044216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028307317,0.0001636235,0.00018034286,0.00009318825,0.00020033466,0.0001949794,0.00012900091,0.00009406383,0.000014835794],"category_scores_gemma":[0.00020058197,0.0001369056,0.00008363773,0.000085965556,0.000012311623,0.00013905052,0.000014729096,0.00036541861,0.00002455867],"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.000010604726,0.000007423763,0.0000088449715,0.000033745462,0.000012421444,0.000002714529,0.000095865085,0.88236934,0.0000029875018,0.007659909,0.0003663703,0.10942977],"study_design_scores_gemma":[0.0004876747,0.00012545357,0.00005636537,0.00022005524,0.000016802149,0.000068423586,0.000056684967,0.7933587,0.00081914256,0.19774273,0.0067404187,0.000307574],"about_ca_topic_score_codex":0.0000012586789,"about_ca_topic_score_gemma":1.65419e-7,"teacher_disagreement_score":0.2503126,"about_ca_system_score_codex":0.00009133287,"about_ca_system_score_gemma":0.000020513906,"threshold_uncertainty_score":0.5582848},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031438703,0.000021017391,0.994144,0.00006979647,0.0001586152,0.0002714217,9.416795e-7,0.00024315598,0.0019471584],"genre_scores_gemma":[0.088581465,0.0000055097603,0.9105452,0.00048788358,0.00027387275,0.0000043231253,0.0000035541866,0.000038594695,0.000059597518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877554,0.000034957367,0.00044377602,0.00008000048,0.0001936996,0.00047205194],"domain_scores_gemma":[0.99896103,0.00063997513,0.000050708866,0.000093879244,0.00008952881,0.00016488135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011523695,0.00014908993,0.00020594786,0.00009013067,0.0002619022,0.00020205087,0.00014124496,0.00006839224,0.00021501885],"category_scores_gemma":[0.000069638874,0.00012104607,0.00010561631,0.0002570475,0.000014848946,0.00013010402,0.0000067012365,0.0003402145,0.000039906314],"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.000020577298,0.000008673918,0.0000022565425,0.000028331726,0.000021056267,0.0000025772292,0.00013087316,0.7085003,0.000007874386,0.00029633337,0.000754249,0.2902269],"study_design_scores_gemma":[0.00063823414,0.00012053383,0.000004724255,0.000111204274,0.000009078032,0.00002819057,0.000030377121,0.9839568,0.0002513707,0.00096213084,0.013730781,0.00015653309],"about_ca_topic_score_codex":0.0000011247296,"about_ca_topic_score_gemma":2.639025e-7,"teacher_disagreement_score":0.29007035,"about_ca_system_score_codex":0.00006972288,"about_ca_system_score_gemma":0.00003356343,"threshold_uncertainty_score":0.49361154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17514025,0.00002126093,0.8238321,0.0003089624,0.000077679404,0.00039060274,0.0000055635483,0.00002422125,0.00019935015],"genre_scores_gemma":[0.8666235,0.00001945184,0.13157715,0.00087124715,0.0005289587,0.0000146236325,0.000009156331,0.000024182438,0.00033171073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759406,0.00011264839,0.0005974696,0.00024996488,0.0011022983,0.00034357788],"domain_scores_gemma":[0.9971859,0.001057763,0.00031786395,0.000255717,0.00083507085,0.00034769299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019347301,0.00014111663,0.0002037752,0.0005253954,0.0005376314,0.0008018073,0.00043309986,0.000045083056,0.00014607223],"category_scores_gemma":[0.0010921923,0.00008278431,0.000041242096,0.00079934485,0.00009577018,0.0007432903,0.00013686846,0.0003407106,0.000109861336],"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.0000843619,0.000056900146,0.0007925859,0.0000021333808,0.000019010457,0.0000066786383,0.00031177045,0.77696097,0.000024462066,0.00047346242,0.00024729437,0.22102039],"study_design_scores_gemma":[0.003133921,0.001166328,0.023855165,0.00020584544,0.00001823433,0.00069691095,0.0029645602,0.9349091,0.00043547704,0.023226395,0.008778932,0.0006091564],"about_ca_topic_score_codex":0.0000053917206,"about_ca_topic_score_gemma":0.0000028279057,"teacher_disagreement_score":0.69225496,"about_ca_system_score_codex":0.00007728678,"about_ca_system_score_gemma":0.000066904046,"threshold_uncertainty_score":0.77318466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45999792,0.00052990706,0.21751101,0.029525423,0.0051128203,0.003993688,0.000009946578,0.00091806875,0.2824012],"genre_scores_gemma":[0.9890897,0.000002386742,0.0038453764,0.004857351,0.0017985553,0.000014437148,0.000015524965,0.000033757144,0.00034288684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987287,0.000007273197,0.00037730386,0.00013695481,0.0003704903,0.00037931456],"domain_scores_gemma":[0.9989781,0.00009811923,0.0003774719,0.00015480169,0.00035173938,0.000039768118],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009519294,0.00019352262,0.0001699402,0.0002260473,0.0009299892,0.0011913874,0.00033402463,0.000032913063,0.00005535469],"category_scores_gemma":[0.00006643638,0.000111061774,0.0000970893,0.0003114237,0.000056362034,0.0010132868,0.00010646963,0.00026508703,0.00010312657],"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.0012581748,0.0005284793,0.010534106,0.0005493289,0.0012724135,0.00015653722,0.007060291,0.41064402,0.000089525405,0.15990119,0.24623755,0.16176838],"study_design_scores_gemma":[0.0034381633,0.00031182804,0.0008492858,0.0004913477,0.00014953956,0.00016255784,0.009173033,0.32371715,0.000033207114,0.004388433,0.6567307,0.0005547628],"about_ca_topic_score_codex":0.00003344573,"about_ca_topic_score_gemma":0.000011898757,"teacher_disagreement_score":0.5290918,"about_ca_system_score_codex":0.0000971078,"about_ca_system_score_gemma":0.00004928104,"threshold_uncertainty_score":0.99984545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6708685,0.00008266129,0.32745132,0.0001207754,0.00028092758,0.00014597594,6.3242044e-7,0.00013762433,0.00091157196],"genre_scores_gemma":[0.74511606,0.000018507482,0.25441232,0.00019047683,0.00023311378,9.053419e-7,0.0000014222524,0.0000235082,0.0000036968408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984056,0.000035582278,0.00072903844,0.00014423112,0.00019683107,0.0004887187],"domain_scores_gemma":[0.9990184,0.00045407194,0.00019758649,0.00009996239,0.00010106321,0.0001289735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019430835,0.00020497084,0.0002745479,0.00029210653,0.00026600648,0.00024903065,0.00014834211,0.00010056272,0.0000015338089],"category_scores_gemma":[0.0007896409,0.00019879639,0.00006543333,0.00028410665,0.000012859774,0.00034903546,0.000027775257,0.00061416026,0.0000015919421],"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.000010681246,0.000008307702,0.0007764203,0.00002334896,0.000007753692,0.000006574739,0.00070421904,0.62083167,0.0010141624,0.00046069722,0.0000075138078,0.37614864],"study_design_scores_gemma":[0.00094527507,0.00011954637,0.004827637,0.00067674334,0.0000057647976,0.00012894775,0.0003549078,0.9910816,0.0013113713,0.00026558823,0.000040210634,0.00024243012],"about_ca_topic_score_codex":0.0000011169986,"about_ca_topic_score_gemma":3.8019417e-7,"teacher_disagreement_score":0.3759062,"about_ca_system_score_codex":0.00022926374,"about_ca_system_score_gemma":0.00002896919,"threshold_uncertainty_score":0.8106682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61080533,0.000031462456,0.38230482,0.000010236239,0.0003723026,0.00006548934,7.420501e-7,0.0002974368,0.006112194],"genre_scores_gemma":[0.9940418,0.000003424694,0.005157769,0.0001374191,0.00062358077,5.805793e-7,0.0000013235054,0.000022433314,0.0000116667725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912506,0.0000073410865,0.00033880415,0.00006370286,0.0001824236,0.00028267156],"domain_scores_gemma":[0.9996985,0.000024297395,0.000057231016,0.00008181278,0.000045978293,0.00009215374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023025517,0.000123693,0.00012544081,0.00021390848,0.00015496349,0.00013346908,0.000107446074,0.00005565902,0.000017695467],"category_scores_gemma":[0.000012465012,0.00010986496,0.000062697465,0.0002015686,0.0000067888286,0.00019921722,0.00001467292,0.00025057333,0.000043565306],"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.000003082614,0.000016894848,0.0018806976,0.000022196713,0.000021272986,0.000042663272,0.0002160158,0.8577013,0.019268015,0.0009003583,0.0030838274,0.11684366],"study_design_scores_gemma":[0.000943777,0.0005404412,0.020788021,0.0011460506,0.00004020826,0.0014594726,0.00013563469,0.7500122,0.18768886,0.0065201432,0.02913863,0.0015865235],"about_ca_topic_score_codex":0.000009165602,"about_ca_topic_score_gemma":0.0000012441559,"teacher_disagreement_score":0.3832365,"about_ca_system_score_codex":0.00016197127,"about_ca_system_score_gemma":0.000013132505,"threshold_uncertainty_score":0.4480163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12925021,0.000036529796,0.8649339,0.0006458669,0.0009523933,0.00022165707,8.108786e-7,0.00012818666,0.0038304161],"genre_scores_gemma":[0.99328923,3.9808077e-7,0.0023151054,0.0018535816,0.0024801423,0.000001603683,0.0000035185071,0.000021626123,0.00003479393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998559,0.0000062487543,0.0005850576,0.00012942767,0.00032389048,0.00039637033],"domain_scores_gemma":[0.9979805,0.0008477186,0.00067740935,0.0001756459,0.00029536852,0.000023380713],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002754396,0.00016258388,0.00019058364,0.00030460957,0.0015449044,0.0004992456,0.0003575536,0.00003720644,0.000007287115],"category_scores_gemma":[0.00027402054,0.00009846545,0.00022320694,0.0004967107,0.000049944618,0.0002685353,0.000103285456,0.00029761196,0.000072346025],"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.00006227167,0.00001354626,0.0001924792,0.000045761433,0.000062852814,0.000009008451,0.00008981866,0.89202684,0.000009037958,0.08117512,0.00021230582,0.02610094],"study_design_scores_gemma":[0.0004765696,0.000015682941,0.0006629894,0.00018448284,0.00008074835,0.00004012804,0.0015688553,0.9784997,0.000013443163,0.0014606311,0.01683291,0.00016382009],"about_ca_topic_score_codex":0.000008128949,"about_ca_topic_score_gemma":0.0000034882041,"teacher_disagreement_score":0.864039,"about_ca_system_score_codex":0.00011627951,"about_ca_system_score_gemma":0.000011618648,"threshold_uncertainty_score":0.99975497},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032484423,0.00008991202,0.9576182,0.000023182798,0.0003827553,0.00020711719,0.0000025677864,0.00066814985,0.008523691],"genre_scores_gemma":[0.91298324,0.0000046254613,0.086022854,0.00007781859,0.00085116463,0.0000042134243,0.000004591978,0.00002878332,0.000022728605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986924,0.0000064403625,0.00054097566,0.00009942266,0.00019655396,0.00046422207],"domain_scores_gemma":[0.9995256,0.00006382273,0.000120894925,0.000100281344,0.00010987606,0.00007952499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045907963,0.00019431816,0.00020612315,0.00008922534,0.00021585508,0.0002083182,0.00019662379,0.00010287163,0.0000021982937],"category_scores_gemma":[0.000026755424,0.00016140101,0.00015619816,0.00016461544,0.000015444339,0.00035520774,0.000029203042,0.00035186298,0.000006170698],"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.000011965362,0.000019381092,0.00030425284,0.00003789409,0.000029267585,0.000012026491,0.000103189945,0.64604217,0.00008406703,0.010628153,0.000978207,0.34174946],"study_design_scores_gemma":[0.00035504394,0.00011892326,0.00006145889,0.00020611919,0.0000090813255,0.0001717715,0.0000469673,0.9832591,0.0010461013,0.008325826,0.006156056,0.00024357461],"about_ca_topic_score_codex":0.000006867514,"about_ca_topic_score_gemma":0.0000015533737,"teacher_disagreement_score":0.88049877,"about_ca_system_score_codex":0.00020616066,"about_ca_system_score_gemma":0.000023648454,"threshold_uncertainty_score":0.6581742},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22789426,0.000010528686,0.77046704,0.00036780446,0.0001522673,0.00041416503,0.0000043194827,0.00004786729,0.00064174965],"genre_scores_gemma":[0.81406224,0.000010398049,0.18548965,0.00032277105,0.00007946582,0.000003361469,0.0000048804836,0.000011453146,0.00001577461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982386,0.00007036859,0.00067943643,0.00018663182,0.0004746458,0.00035026594],"domain_scores_gemma":[0.9979003,0.001047634,0.00039895685,0.0001068238,0.00038681502,0.00015945916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014415126,0.00017780777,0.00031175945,0.0003224159,0.00038606854,0.00016449855,0.00013799481,0.00010065622,0.000012276892],"category_scores_gemma":[0.0005678706,0.00015531277,0.00008514396,0.00026281842,0.00007605212,0.0003926905,0.00004019085,0.0006786549,0.0000015430936],"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.00032295185,0.0004112037,0.003211818,0.0001072352,0.00007177668,0.000032734646,0.00082628743,0.11775224,0.000118039796,0.060168758,0.00015214653,0.8168248],"study_design_scores_gemma":[0.0025671073,0.0004574717,0.027004493,0.00008305001,0.0000062139434,0.00011090871,0.00014311839,0.70418847,0.00017100574,0.2649834,0.000109634944,0.00017516756],"about_ca_topic_score_codex":0.0000022546737,"about_ca_topic_score_gemma":0.000008769184,"teacher_disagreement_score":0.8166496,"about_ca_system_score_codex":0.00027601485,"about_ca_system_score_gemma":0.0001154926,"threshold_uncertainty_score":0.63334703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13577393,0.00002015727,0.8620862,0.0004685125,0.0012816918,0.00018874543,0.0000012463933,0.00009492688,0.00008461816],"genre_scores_gemma":[0.68593043,0.0000017156638,0.31308794,0.00055415765,0.00038813933,0.0000029471503,0.0000033589179,0.0000071131744,0.00002421942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987996,0.000048125075,0.00033633524,0.0001478514,0.00028648836,0.0003815695],"domain_scores_gemma":[0.99895376,0.00017687427,0.0003572403,0.00014828292,0.00016436032,0.00019946504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089122,0.00014834384,0.00016042654,0.00017695993,0.00067184377,0.00050048734,0.00022130474,0.00007444795,0.000018796505],"category_scores_gemma":[0.00017755889,0.00013333795,0.00014417672,0.0002034871,0.00002866737,0.0011978626,0.000038990926,0.00027403224,0.000013845748],"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.000072643044,0.00023989752,0.013406244,0.000032421318,0.000059725957,0.0000036536057,0.0020293333,0.27084816,0.0015783311,0.033313327,0.00017305619,0.6782432],"study_design_scores_gemma":[0.0014191509,0.00008274593,0.0066323616,0.000033046206,0.0000057774496,0.000040543946,0.000023678014,0.98839396,0.00091611437,0.00003701447,0.0022284815,0.00018714168],"about_ca_topic_score_codex":0.000005235817,"about_ca_topic_score_gemma":0.000004603712,"teacher_disagreement_score":0.7175458,"about_ca_system_score_codex":0.0001606296,"about_ca_system_score_gemma":0.00014895626,"threshold_uncertainty_score":0.54373634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030387526,0.000026128815,0.9154805,0.000049740214,0.0004989668,0.00042202143,0.00000110386,0.00025917092,0.052874837],"genre_scores_gemma":[0.42249113,0.0000022151894,0.577063,0.00019522356,0.00020822157,0.0000040982013,0.000002273778,0.000021656258,0.000012161319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885225,0.000020659698,0.00041961262,0.00012412066,0.0002160681,0.00036727087],"domain_scores_gemma":[0.99933803,0.000027152822,0.00009561041,0.00019738107,0.00010625429,0.00023559642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089148,0.00016955035,0.00015992233,0.000112124166,0.00032436926,0.00066487293,0.00074048416,0.0000592286,0.000026369702],"category_scores_gemma":[0.000026036463,0.000110381705,0.000052639556,0.0002643105,0.00002797467,0.00036602718,0.00008633157,0.0005291282,0.000036224494],"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.0000116482015,0.000041333304,0.0000517261,0.000006647801,0.000027166454,0.0000043427963,0.003954827,0.7766873,0.0000026382563,0.0007648505,0.00007162135,0.21837589],"study_design_scores_gemma":[0.00038327952,0.00019745681,0.00012808375,0.00007942989,0.000007832269,0.00036816293,0.0022322899,0.9931008,0.00018095813,0.00002912668,0.0030600177,0.00023252808],"about_ca_topic_score_codex":0.000003651773,"about_ca_topic_score_gemma":4.6474713e-7,"teacher_disagreement_score":0.3921036,"about_ca_system_score_codex":0.000056407487,"about_ca_system_score_gemma":0.000042664786,"threshold_uncertainty_score":0.6411385},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013734189,0.00025425927,0.98137605,0.00008263452,0.00045944488,0.0003035139,2.0277706e-7,0.00007128444,0.0037184458],"genre_scores_gemma":[0.9211815,0.000042072796,0.0773303,0.0008204144,0.00055040733,0.000019970825,7.652231e-7,0.00002148371,0.000033097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978395,0.00006143128,0.00076234917,0.00031866992,0.00029815387,0.00071988534],"domain_scores_gemma":[0.9982137,0.0006461459,0.00051106187,0.0003538911,0.00011699032,0.00015818138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751068,0.00025601665,0.00030720216,0.00015839656,0.00053538533,0.0004564047,0.0012090945,0.00012262909,0.000002074225],"category_scores_gemma":[0.000037640842,0.0001677746,0.00012394422,0.00048898405,0.0000681211,0.0006112967,0.00040492034,0.000739062,0.0000011056676],"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.000051516756,0.00006176465,0.0015491445,0.00002021021,0.000042519445,0.000015840931,0.0021444603,0.14823249,0.0000042859365,0.038582038,0.00021728995,0.80907845],"study_design_scores_gemma":[0.00077266403,0.0001892741,0.0012570157,0.00017577595,0.0000063557795,0.0004391599,0.00007987073,0.99472463,0.000025959172,0.0016564948,0.00044176285,0.00023105186],"about_ca_topic_score_codex":0.000038337213,"about_ca_topic_score_gemma":0.00001103322,"teacher_disagreement_score":0.9074473,"about_ca_system_score_codex":0.00007154429,"about_ca_system_score_gemma":0.00007473869,"threshold_uncertainty_score":0.684165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876051,0.00008048912,0.010525303,0.00023614979,0.0003970815,0.00036997054,0.0000017408427,0.000039068535,0.0007450819],"genre_scores_gemma":[0.9918815,0.0000019501165,0.007279347,0.00034802334,0.00031777663,0.0000038199755,0.0000032737732,0.000028592489,0.00013571716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980197,0.000041525742,0.0009861594,0.00015529775,0.00038641677,0.0004109191],"domain_scores_gemma":[0.9964808,0.0013433816,0.0014236569,0.00021985134,0.000511572,0.000020697136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025427227,0.00020173859,0.0003386025,0.0003034766,0.0005773729,0.00030673924,0.0002804458,0.00004592328,0.000014524702],"category_scores_gemma":[0.0020573658,0.0001341122,0.00026821753,0.00039167795,0.00013540017,0.0013275342,0.00011359772,0.00024787357,0.0000025206725],"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.00014725905,0.000042381238,0.003926879,0.00023353053,0.0001323807,0.0000019140007,0.00019910355,0.90449685,0.0007669253,0.07609946,0.00014436238,0.013808961],"study_design_scores_gemma":[0.0023837031,0.00021475207,0.0006232845,0.0020699252,0.00022133984,0.000058308848,0.0013761708,0.75638694,0.0034453191,0.19699878,0.035430223,0.000791265],"about_ca_topic_score_codex":0.000028222545,"about_ca_topic_score_gemma":0.000010526951,"teacher_disagreement_score":0.14810991,"about_ca_system_score_codex":0.00006389152,"about_ca_system_score_gemma":0.000049418522,"threshold_uncertainty_score":0.54689366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03402629,0.0000051035163,0.96435386,0.000100062505,0.00022175572,0.0003287062,0.00020942994,0.00013960594,0.0006151916],"genre_scores_gemma":[0.5340342,0.0000016575513,0.46532938,0.00018997648,0.00025085759,0.000020161375,0.00013129416,0.000017673441,0.000024783001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830455,0.000047111273,0.0008520525,0.00016831649,0.00025236356,0.00037560158],"domain_scores_gemma":[0.99814826,0.00047363527,0.00048232742,0.00022602371,0.00039358955,0.0002761558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229993,0.00018241715,0.0002705397,0.00009217703,0.00088222814,0.00014906819,0.00025195323,0.000083432584,0.00028707276],"category_scores_gemma":[0.00056786067,0.00015094089,0.00016028094,0.00018336612,0.000053275402,0.0002498237,0.00003050861,0.00025207468,0.000049184877],"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.000049857652,0.00051690923,0.00008173641,0.000026666426,0.000081927574,0.000005660996,0.0004948673,0.00012188558,0.00034520717,0.6554498,0.0020634013,0.34076208],"study_design_scores_gemma":[0.0020646937,0.000362024,0.0019084833,0.000115920106,0.00009023878,0.00022423064,0.00021203536,0.69102514,0.0037354329,0.2976028,0.0021932742,0.00046574677],"about_ca_topic_score_codex":0.000005132593,"about_ca_topic_score_gemma":6.8054186e-7,"teacher_disagreement_score":0.69090325,"about_ca_system_score_codex":0.000103099774,"about_ca_system_score_gemma":0.000058068723,"threshold_uncertainty_score":0.6785475},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00152395,0.000008566746,0.9803592,0.005581033,0.009094932,0.00019328734,0.0000015391735,0.0002664285,0.002971058],"genre_scores_gemma":[0.33060572,0.000023470431,0.57888275,0.021193555,0.06917256,0.0000029764585,0.000013418628,0.00003080451,0.000074760326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979759,0.000059939302,0.00058287766,0.00026741155,0.0007475827,0.000366307],"domain_scores_gemma":[0.99825925,0.0004530797,0.00048013538,0.00046288365,0.0002226382,0.00012200285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057955214,0.00023199008,0.00020110732,0.0001704531,0.00062602124,0.0008671911,0.0012470344,0.000104131985,0.000031269712],"category_scores_gemma":[0.00024631323,0.00014907356,0.00010716091,0.00042910528,0.0000377791,0.00078570825,0.00014755834,0.0005924095,0.000052034575],"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.000026002961,0.000053609478,0.00001577713,6.108765e-7,0.000013037956,0.000007724803,0.0010316052,0.83684856,0.0000021648193,0.031203594,0.058323886,0.07247342],"study_design_scores_gemma":[0.00086529966,0.0008460982,0.0006725906,0.00020037434,0.000007971793,0.00007626035,0.00004580662,0.97234076,0.00021098828,0.0166911,0.007717038,0.00032570717],"about_ca_topic_score_codex":0.00000533641,"about_ca_topic_score_gemma":2.5369383e-7,"teacher_disagreement_score":0.40147647,"about_ca_system_score_codex":0.00018014623,"about_ca_system_score_gemma":0.000075260876,"threshold_uncertainty_score":0.8362344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4344585,0.00009487849,0.5537718,0.00015458741,0.000514162,0.00015409474,8.2231196e-7,0.00021805211,0.010633109],"genre_scores_gemma":[0.94080144,0.0000096013255,0.058544327,0.00010586466,0.0003993872,5.796459e-7,0.0000031139625,0.000018727946,0.000116965566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991681,0.000007974989,0.00036535092,0.00005400668,0.00018146505,0.00022313389],"domain_scores_gemma":[0.9994595,0.00020747603,0.00008418704,0.00007373998,0.000087199944,0.000087915934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080998306,0.00011066145,0.00013381797,0.00012281869,0.0003232655,0.00015113749,0.00008616981,0.000053216405,0.000018455527],"category_scores_gemma":[0.00003597736,0.00006823987,0.000053615062,0.00020777316,0.00003860084,0.00017905248,0.000023228307,0.00034570307,0.000022713755],"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.00003046993,0.0000056347226,0.00008783096,0.00000718235,0.000044473407,0.0000048571505,0.0009563248,0.94076604,0.000012634807,0.0009148653,0.00006650739,0.057103198],"study_design_scores_gemma":[0.001243057,0.000018813382,0.00094882445,0.000051445622,0.00000841316,0.0002711848,0.00010018361,0.9966177,0.00009443199,0.00033252596,0.00020409413,0.000109377776],"about_ca_topic_score_codex":9.201767e-7,"about_ca_topic_score_gemma":2.3395104e-7,"teacher_disagreement_score":0.50634295,"about_ca_system_score_codex":0.000041337717,"about_ca_system_score_gemma":0.000013016811,"threshold_uncertainty_score":0.27827412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027250908,0.000013996974,0.9690419,0.00015284079,0.00021778341,0.00016657061,0.0000041191547,0.000048371356,0.0031035363],"genre_scores_gemma":[0.57134604,3.9622248e-7,0.42635664,0.00020319739,0.0016829246,0.000006094155,0.000012163726,0.000025107855,0.00036746022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983121,0.000061710794,0.0006461508,0.00022117353,0.00023148012,0.00052737846],"domain_scores_gemma":[0.9987145,0.00039368545,0.00043426378,0.00018862948,0.00015092711,0.00011796402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094159326,0.00023518514,0.00037111665,0.0001621854,0.00042085897,0.00038271354,0.00026577534,0.00004164534,0.000084239386],"category_scores_gemma":[0.000011984988,0.00018556115,0.0002971595,0.00022580588,0.000018290624,0.00014591696,0.000056996207,0.00037128694,0.000018756557],"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.00008724945,0.00020419888,0.0029046205,0.000038484075,0.0005174739,0.000009760041,0.0002774454,0.50321865,0.004937106,0.0429271,0.004406014,0.44047192],"study_design_scores_gemma":[0.0018092722,0.0008436077,0.0014280851,0.00030959136,0.00014086204,0.00007318984,0.00008389091,0.94029313,0.0045825425,0.04364502,0.0062315064,0.0005592989],"about_ca_topic_score_codex":0.00014585443,"about_ca_topic_score_gemma":4.3896276e-7,"teacher_disagreement_score":0.5440951,"about_ca_system_score_codex":0.000060992323,"about_ca_system_score_gemma":0.00008484077,"threshold_uncertainty_score":0.7566964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8406498,0.00014585737,0.007502313,0.00032326108,0.002064052,0.00043130756,2.0164596e-7,0.000050861036,0.14883237],"genre_scores_gemma":[0.99527216,0.00002152142,0.0018530055,0.0021132638,0.0006183852,0.0000021009794,0.0000013960881,0.000019988507,0.00009819486],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99835855,0.000022127746,0.00069920067,0.00014294244,0.00036809462,0.000409107],"domain_scores_gemma":[0.9989253,0.00005474513,0.0007163068,0.00022603947,0.00006374992,0.0000138530095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021643792,0.00017151106,0.00021556113,0.00036345504,0.000320437,0.0003316933,0.00049770053,0.000038073194,0.000057618225],"category_scores_gemma":[0.00004301986,0.00011815812,0.000111258545,0.0006330517,0.000043397904,0.0010351635,0.00032028955,0.0003784383,0.00003836916],"study_design_candidate":"observational","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.0001197906,0.00035919595,0.094789594,0.0008082095,0.0003234344,0.00035783002,0.0023844854,0.10248722,0.000023447068,0.2583976,0.006390017,0.53355914],"study_design_scores_gemma":[0.0020805872,0.000081430924,0.56631684,0.0035828005,0.00012455837,0.00004448524,0.006134467,0.34379953,0.000019537107,0.035103682,0.042015735,0.0006963576],"about_ca_topic_score_codex":0.000071258284,"about_ca_topic_score_gemma":0.000010494144,"teacher_disagreement_score":0.5328628,"about_ca_system_score_codex":0.00009899584,"about_ca_system_score_gemma":0.000012445388,"threshold_uncertainty_score":0.48183483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024723345,0.00017744182,0.9720003,0.00022714082,0.0006333775,0.00034617443,0.0000014683385,0.00017844561,0.0017122843],"genre_scores_gemma":[0.7295361,0.000014062401,0.26938608,0.00021321334,0.00065945374,0.000012493571,0.000002988814,0.000045784287,0.00012981023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855083,0.000043332653,0.0006571367,0.00009239393,0.00028972697,0.0003665878],"domain_scores_gemma":[0.9988254,0.0006645376,0.00018932608,0.0001566624,0.00009872171,0.00006538806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012891544,0.00017969031,0.00020245464,0.000107161344,0.00041873427,0.00028374328,0.00023409852,0.000053812437,0.000020048978],"category_scores_gemma":[0.00012121406,0.00011734877,0.00012177089,0.00019656247,0.000021352664,0.00010789144,0.000025517116,0.000320468,0.000012095157],"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.000007714146,0.000010871633,0.00008173106,0.00003272508,0.00003830988,0.000002533853,0.00014794483,0.9730141,0.00013222305,0.0014783244,0.0012758654,0.023777625],"study_design_scores_gemma":[0.00075710524,0.00006915939,0.0003464642,0.00008653425,0.000030337924,0.000084555286,0.00004433519,0.9919852,0.00042689292,0.0014249411,0.004572825,0.00017165444],"about_ca_topic_score_codex":0.0000046377013,"about_ca_topic_score_gemma":0.0000011271555,"teacher_disagreement_score":0.70481277,"about_ca_system_score_codex":0.00016505238,"about_ca_system_score_gemma":0.000033517015,"threshold_uncertainty_score":0.4785344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065441936,0.000056549146,0.9292251,0.0012236533,0.00074860314,0.00014985361,0.0000017706404,0.00008125414,0.0030712981],"genre_scores_gemma":[0.8637197,0.000011059036,0.13552949,0.0005788559,0.00013709265,0.0000010223849,0.0000018636752,0.000006162996,0.0000147614755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878824,0.000031481377,0.00041081855,0.00016366865,0.00025992625,0.00034588441],"domain_scores_gemma":[0.99885017,0.00023822012,0.00029291687,0.0001229739,0.00026729555,0.00022845523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014037933,0.0001271025,0.00015432751,0.0001799073,0.0008623604,0.0005324797,0.00019966139,0.000055227865,0.000006050014],"category_scores_gemma":[0.00028153288,0.00010822083,0.00006823246,0.00014611187,0.000108449574,0.0007701955,0.00013653612,0.00023877696,0.00000898658],"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.000024779929,0.00003544652,0.0054944893,0.000021126289,0.000040537878,0.000014555688,0.002768937,0.013573774,0.00014108121,0.18617178,0.00083763537,0.79087585],"study_design_scores_gemma":[0.0044154967,0.0005451841,0.00868653,0.00046710152,0.000021923022,0.003167461,0.0032381027,0.9580966,0.000047163347,0.00867769,0.011953164,0.0006835844],"about_ca_topic_score_codex":0.0000019716658,"about_ca_topic_score_gemma":0.0000019281135,"teacher_disagreement_score":0.9445228,"about_ca_system_score_codex":0.00011182371,"about_ca_system_score_gemma":0.00020572382,"threshold_uncertainty_score":0.6632666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021798193,0.000009572546,0.97553945,0.00037834834,0.00063383084,0.000085950924,2.849352e-7,0.000109937304,0.0014444301],"genre_scores_gemma":[0.29645252,0.000016360764,0.7031692,0.00019527292,0.0001326934,8.0726034e-7,2.4564412e-7,0.000008005213,0.000024881325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985235,0.000047008416,0.00042417116,0.00018592068,0.0005206966,0.00029871904],"domain_scores_gemma":[0.99860215,0.00028173183,0.00040470014,0.00037553208,0.00019179759,0.00014406869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010476044,0.00014430817,0.0001386345,0.00018239398,0.00031087673,0.0003893247,0.00075632957,0.00005320992,0.000010406328],"category_scores_gemma":[0.00029474442,0.000070420916,0.000055272438,0.0003634028,0.000040270792,0.0017742788,0.00013989687,0.00020463811,0.000049134764],"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.000039112383,0.000013155048,0.00056341814,0.0000021585518,0.000009497769,0.000010444318,0.00017873259,0.09941865,0.00003825373,0.028481584,0.000056041878,0.87118894],"study_design_scores_gemma":[0.0013723073,0.0008635569,0.005277615,0.00072963175,0.000005459642,0.00073557725,0.000025978494,0.9810538,0.0021084005,0.004781275,0.002657929,0.000388458],"about_ca_topic_score_codex":6.757679e-7,"about_ca_topic_score_gemma":3.225663e-7,"teacher_disagreement_score":0.8816352,"about_ca_system_score_codex":0.00012661036,"about_ca_system_score_gemma":0.00007632594,"threshold_uncertainty_score":0.3754267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4681973,0.00007702053,0.5304961,0.000051268562,0.000348521,0.00027032182,0.0000061384335,0.00020734887,0.00034595822],"genre_scores_gemma":[0.8476591,0.0000041394887,0.15196204,0.00007957431,0.0002209518,0.0000020090868,0.0000063492457,0.000053739168,0.000012104647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852425,0.000046369372,0.00052957947,0.00015244498,0.00030859606,0.00043875078],"domain_scores_gemma":[0.998784,0.00028373956,0.00022733158,0.00013107418,0.00028805845,0.00028581664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009465346,0.00025163637,0.00029723733,0.00015918206,0.0002678133,0.00033958087,0.00014318692,0.000095452866,0.0000029808252],"category_scores_gemma":[0.00035130052,0.00019188321,0.00003784194,0.00027363875,0.00004806526,0.00033755534,0.000027356136,0.00053144817,0.0000023047307],"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.000026572086,0.0000070939077,0.0013149343,0.00006470183,0.000058243742,0.00000949767,0.0016945439,0.95417523,0.00017415115,0.00011631202,0.00008745556,0.042271234],"study_design_scores_gemma":[0.0016575198,0.000335886,0.0006363564,0.00034894675,0.000022462078,0.00044091302,0.00043739125,0.99496305,0.00038576842,0.0002829168,0.000198787,0.00029000986],"about_ca_topic_score_codex":0.0000059835165,"about_ca_topic_score_gemma":0.000003162899,"teacher_disagreement_score":0.37946182,"about_ca_system_score_codex":0.00023891451,"about_ca_system_score_gemma":0.00006970061,"threshold_uncertainty_score":0.782477},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4871342,0.000028144226,0.5119555,0.000098067074,0.000084439045,0.00013450423,0.000002179088,0.000059876405,0.00050309865],"genre_scores_gemma":[0.59633535,0.0000023714629,0.4030825,0.00021908942,0.0003066318,0.0000016892419,0.0000038893677,0.000021509892,0.000026985772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979959,0.00008449161,0.00057254464,0.00022333772,0.00066490733,0.00045878894],"domain_scores_gemma":[0.9982335,0.00031797757,0.0002728044,0.00026953293,0.00030911536,0.0005970884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095313875,0.00021595361,0.00037093277,0.0003394193,0.00027780648,0.0003370001,0.0002696254,0.0001238423,0.0001211655],"category_scores_gemma":[0.0009530613,0.00016164703,0.00012188848,0.00048489988,0.0001983754,0.00043337108,0.00019974452,0.0007279279,0.000003447963],"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.0013719257,0.0011718236,0.0018542495,0.000043451546,0.0014148483,0.000267218,0.022022158,0.10070611,0.00040662798,0.7646234,0.00031091756,0.10580728],"study_design_scores_gemma":[0.0009720045,0.0006056772,0.00017871444,0.000024966443,0.000051329644,0.00016324827,0.0018817332,0.94379723,0.0005980944,0.05143171,0.000055280565,0.00024003799],"about_ca_topic_score_codex":0.0000018143305,"about_ca_topic_score_gemma":3.6348376e-7,"teacher_disagreement_score":0.8430911,"about_ca_system_score_codex":0.00018677735,"about_ca_system_score_gemma":0.00011018872,"threshold_uncertainty_score":0.6591775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004815283,0.00022113959,0.99326134,0.0005682622,0.00032846606,0.0001809594,0.0000019407262,0.00017671646,0.0004458844],"genre_scores_gemma":[0.12014943,0.000055209723,0.8792222,0.00017398823,0.0003181353,0.000006269019,0.0000022867728,0.000031882304,0.000040568993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991189,0.00002174331,0.0003487597,0.00008930316,0.00014505505,0.00027623284],"domain_scores_gemma":[0.9989094,0.0006297139,0.00013016272,0.00011989494,0.00012070975,0.000090102956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726877,0.00015701824,0.00014933788,0.0000960383,0.0003813052,0.00015326923,0.00018606446,0.000052478852,0.000014079026],"category_scores_gemma":[0.000054823046,0.00007153482,0.000078789024,0.00013619025,0.000022859771,0.00022076548,0.000018223609,0.00025928795,0.000009819558],"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.00003097714,0.000005128304,0.00006311683,0.00001010644,0.000060972663,9.697924e-7,0.00011390089,0.75529605,0.00008721799,0.00030393357,0.000025385554,0.24400225],"study_design_scores_gemma":[0.0011002123,0.0001262181,0.000096135314,0.00024489535,0.000020009958,0.00020068337,0.00005259316,0.99481726,0.0007621802,0.00045729347,0.001957644,0.00016486306],"about_ca_topic_score_codex":7.7295806e-7,"about_ca_topic_score_gemma":5.1351014e-7,"teacher_disagreement_score":0.24383739,"about_ca_system_score_codex":0.00007730929,"about_ca_system_score_gemma":0.0000252601,"threshold_uncertainty_score":0.29327297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005521196,0.000010981888,0.9919884,0.0054028737,0.0002323994,0.00037819392,0.000005838507,0.00007354375,0.0013556518],"genre_scores_gemma":[0.51065165,0.000011357773,0.48258048,0.005800942,0.0005694406,0.000012805369,0.0000034479026,0.00003002758,0.00033986717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811566,0.00006314988,0.00045245897,0.00021817948,0.0004649135,0.0006856466],"domain_scores_gemma":[0.9981426,0.00036344584,0.00020155465,0.00037509095,0.00038181298,0.0005354749],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018178433,0.00017842237,0.00015679582,0.0002891267,0.0012713136,0.0011010305,0.0012753707,0.0000811968,0.000047312737],"category_scores_gemma":[0.00007141686,0.00008953969,0.000118367374,0.0003031796,0.000051879393,0.00096514216,0.000048862537,0.00032840832,0.0000391636],"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.000004038415,0.000019871573,0.000077819706,0.0000033027188,0.000013979892,0.000007159108,0.00058935967,0.09859261,0.0000062476583,0.0026935914,0.000985259,0.89700675],"study_design_scores_gemma":[0.0009106914,0.0003186751,0.0003097921,0.000085516716,0.0000028285522,0.000067384484,0.000036903286,0.9625893,0.00006176507,0.00075525034,0.034685634,0.00017622174],"about_ca_topic_score_codex":0.0005837413,"about_ca_topic_score_gemma":0.00077349105,"teacher_disagreement_score":0.89683056,"about_ca_system_score_codex":0.00025504176,"about_ca_system_score_gemma":0.00090820267,"threshold_uncertainty_score":0.9999359},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28677487,0.000022116787,0.70699835,0.002483433,0.001616583,0.00006978562,0.000005515201,0.00006598254,0.0019633302],"genre_scores_gemma":[0.9758645,0.0000057220295,0.021992132,0.0013992244,0.00054125465,7.3251175e-7,8.551735e-7,0.000020198426,0.00017533035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995099,0.00020230224,0.0014881705,0.00040499514,0.002231762,0.0005737896],"domain_scores_gemma":[0.9933233,0.0046418617,0.0005732381,0.00030305507,0.0008125217,0.00034602152],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004655336,0.00023512,0.00033680646,0.00063747755,0.00082857534,0.0013933935,0.00076689885,0.00013863051,0.0008124538],"category_scores_gemma":[0.006905651,0.0001316638,0.00021352353,0.0005861689,0.00009753476,0.001472223,0.00017150085,0.00046672733,0.0008044774],"study_design_candidate":"design_other","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.00020124136,0.000107341926,0.0060030944,0.000003535343,0.000027734828,0.000041374013,0.00032404994,0.009868764,0.012300766,0.0020086945,0.05146517,0.91764826],"study_design_scores_gemma":[0.009032399,0.001809037,0.03772997,0.0023268578,0.000063946376,0.0071966215,0.0018461784,0.6956912,0.017885378,0.074871525,0.14895847,0.0025883727],"about_ca_topic_score_codex":0.0000033150884,"about_ca_topic_score_gemma":0.0000019964468,"teacher_disagreement_score":0.91505986,"about_ca_system_score_codex":0.00029260552,"about_ca_system_score_gemma":0.0000844827,"threshold_uncertainty_score":0.99997354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14204714,0.000010766996,0.8566124,0.00024066273,0.00010928696,0.000035186513,2.424705e-7,0.000028689059,0.0009156462],"genre_scores_gemma":[0.9115195,0.000019056179,0.08832409,0.00009726555,0.000028871013,1.2821847e-7,6.474521e-8,0.0000035278188,0.000007447775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926645,0.000017011473,0.00030184965,0.0001042541,0.0001600803,0.00015033716],"domain_scores_gemma":[0.9993978,0.000110602814,0.00018275926,0.00010394733,0.00013138325,0.00007347635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040886248,0.000086140164,0.00013713332,0.00016311574,0.00013795997,0.00011495139,0.00015022115,0.000027302825,0.000010376177],"category_scores_gemma":[0.000053629,0.000047817866,0.000027390917,0.00013936209,0.00003884896,0.0006021897,0.000055252516,0.00010455074,0.0000023683735],"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.00001519915,0.0000114458735,0.0020592452,0.000013810733,0.000051880175,0.000007901034,0.00044912598,0.13016728,0.00040569346,0.049575012,0.0000037329685,0.81723964],"study_design_scores_gemma":[0.000615292,0.000100070625,0.0009000421,0.0004711937,0.0000064673704,0.00059681037,0.00005676261,0.9956196,0.00027429918,0.0012244581,0.000024274083,0.000110754525],"about_ca_topic_score_codex":0.0000027892527,"about_ca_topic_score_gemma":0.0000013223577,"teacher_disagreement_score":0.8654523,"about_ca_system_score_codex":0.000023292952,"about_ca_system_score_gemma":0.00007632333,"threshold_uncertainty_score":0.1949956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10777419,0.00002770053,0.88837224,0.00033755152,0.00044985852,0.00040922724,0.0000013750321,0.00006189896,0.002565925],"genre_scores_gemma":[0.91847247,0.0000049860714,0.08091568,0.000058778194,0.0003211358,0.0000019450436,4.6454892e-7,0.000028802751,0.00019570945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885154,0.000025063933,0.0004369984,0.00008477769,0.00029767002,0.0003039525],"domain_scores_gemma":[0.9986168,0.0002460417,0.00059766683,0.00035496603,0.00012410195,0.000060436876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012226696,0.00014514547,0.0001722421,0.000040590407,0.0011888223,0.00028149408,0.00060881575,0.00005133264,0.000011717557],"category_scores_gemma":[0.00019696224,0.000077208395,0.00009588207,0.00008983841,0.00003954955,0.0003265115,0.00009270969,0.00035269427,0.0000053158906],"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.000027500406,0.0000058588134,0.0016147146,0.00001940331,0.00007522967,3.523362e-7,0.0004688259,0.84385717,0.0016898323,0.00010196999,0.00023549215,0.15190363],"study_design_scores_gemma":[0.0009969738,0.00009793731,0.007202032,0.000413047,0.000028613262,0.000029115488,0.000039182632,0.98058665,0.009654912,0.00009305438,0.0007259966,0.00013248053],"about_ca_topic_score_codex":0.000010088864,"about_ca_topic_score_gemma":0.0000018388217,"teacher_disagreement_score":0.81069833,"about_ca_system_score_codex":0.00009194652,"about_ca_system_score_gemma":0.000075192795,"threshold_uncertainty_score":0.9143581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5115796,0.00008067006,0.48564863,0.0014723148,0.00064826495,0.00008292182,0.0000044138615,0.000039828235,0.00044336464],"genre_scores_gemma":[0.96682847,0.00001276938,0.03107443,0.00049135846,0.00063541695,0.0000017580933,2.6990423e-7,0.000013382164,0.0009421428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974956,0.00007677125,0.000747911,0.00029876968,0.00086695555,0.00051400706],"domain_scores_gemma":[0.9907363,0.0075797704,0.00058799423,0.00024887212,0.0005632632,0.0002837663],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006466838,0.00017632249,0.00034110344,0.0003704564,0.0009833942,0.00058190717,0.00043929496,0.00008989891,0.000084368745],"category_scores_gemma":[0.016126942,0.00009346228,0.0002626052,0.00036063572,0.00010078806,0.00066835555,0.00009992692,0.00031113048,0.00012860916],"study_design_candidate":"design_other","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.00028970034,0.00008439391,0.011131685,0.000007986353,0.000106714,0.0000072003468,0.001115529,0.007569947,0.0027139282,0.01202979,0.00073989364,0.96420324],"study_design_scores_gemma":[0.023246184,0.0014799923,0.06777325,0.0019221336,0.00015568858,0.0015954005,0.0024425127,0.5044488,0.0067198207,0.14817536,0.23967089,0.0023699838],"about_ca_topic_score_codex":0.000004270763,"about_ca_topic_score_gemma":0.0000016223693,"teacher_disagreement_score":0.96183324,"about_ca_system_score_codex":0.00008357281,"about_ca_system_score_gemma":0.00014515477,"threshold_uncertainty_score":0.9921606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3821188,0.0001537494,0.6154543,0.0012796831,0.00017198251,0.0004784601,0.0000038554176,0.00005008614,0.00028906256],"genre_scores_gemma":[0.75723565,0.00002085004,0.2410256,0.001272636,0.00036766997,0.000018855639,0.0000063261573,0.000021759168,0.000030636937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980462,0.00012916586,0.00084301684,0.00024796615,0.00018322622,0.00055037695],"domain_scores_gemma":[0.997712,0.0011632346,0.00039227027,0.00010550932,0.00032466935,0.00030231525],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023465753,0.00019754341,0.00030971153,0.0001827012,0.002832652,0.0002012078,0.00008289104,0.00019016072,0.000008659724],"category_scores_gemma":[0.00097234093,0.000126819,0.000044178432,0.000116833115,0.00006870684,0.00031936768,0.00006247429,0.0006502245,0.0000019205413],"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.00020736225,0.00007009386,0.13088107,0.0008906828,0.00010391701,0.000009279217,0.010262027,0.11057311,0.000540374,0.008660434,0.00007257799,0.7377291],"study_design_scores_gemma":[0.0041062566,0.00042578473,0.0032023485,0.0027172621,0.000021709588,0.000113940616,0.0033718671,0.98406816,0.0000469795,0.00014333361,0.0014113156,0.00037103565],"about_ca_topic_score_codex":0.000010464544,"about_ca_topic_score_gemma":0.0000020350108,"teacher_disagreement_score":0.87349504,"about_ca_system_score_codex":0.000094360075,"about_ca_system_score_gemma":0.0003642316,"threshold_uncertainty_score":0.99846554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3271734,0.00014314573,0.6323997,0.00042940528,0.0016093606,0.00030862162,0.000003220365,0.0005733756,0.03735981],"genre_scores_gemma":[0.96504974,0.0000389246,0.034234222,0.00006103821,0.00050874543,0.000002030641,9.5269803e-7,0.000038657236,0.000065684515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998049,0.00007802614,0.00067487283,0.00012083552,0.00038859138,0.0006886301],"domain_scores_gemma":[0.9988243,0.00053616735,0.0001978539,0.00016816266,0.00008489738,0.00018859869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119071,0.00019757444,0.00018129428,0.00007944575,0.00055606687,0.00027178437,0.00027528396,0.00008261313,0.000010458235],"category_scores_gemma":[0.0001443483,0.00009617421,0.00011293241,0.0001887314,0.000041191302,0.00022101574,0.00005505514,0.00049112405,0.000020872596],"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.000020804368,0.000012564988,0.0011338755,0.000007985395,0.000040162406,0.000017354558,0.00059136323,0.5972926,0.000031359974,0.0012708316,0.00041754666,0.39916354],"study_design_scores_gemma":[0.001405772,0.00015138728,0.00104843,0.00037402398,0.000011462731,0.0012919817,0.00027770846,0.9580064,0.000551162,0.0002492654,0.036182098,0.0004502977],"about_ca_topic_score_codex":8.450114e-7,"about_ca_topic_score_gemma":1.6083183e-7,"teacher_disagreement_score":0.63787633,"about_ca_system_score_codex":0.00020617769,"about_ca_system_score_gemma":0.000036333207,"threshold_uncertainty_score":0.4276873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20790212,0.000015379179,0.7891076,0.00069044455,0.00068538735,0.00029616308,0.0000035159364,0.000046691162,0.0012526625],"genre_scores_gemma":[0.9864484,0.000013786137,0.011997844,0.00021786286,0.00036394346,0.0000043393834,0.0000023797536,0.000020237048,0.0009311784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748594,0.000041040323,0.0008658684,0.00024448347,0.00093203934,0.0004306113],"domain_scores_gemma":[0.9966232,0.001166412,0.000931439,0.0002575463,0.00080289925,0.00021845946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219285,0.00019317362,0.00031191032,0.00034269772,0.00035576307,0.00055656774,0.00046936361,0.00007626394,0.000044839544],"category_scores_gemma":[0.0011676324,0.000085241554,0.00014496225,0.0003570323,0.00008133838,0.0006293288,0.00004108002,0.00019981807,0.000058003916],"study_design_candidate":"design_other","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.00026271096,0.000039173417,0.0027016916,8.534573e-7,0.00003289424,0.000007350828,0.000505271,0.029990725,0.0000054920574,0.00049207394,0.0013070159,0.96465474],"study_design_scores_gemma":[0.028824355,0.018227102,0.0090235295,0.004089216,0.00025734043,0.0034437736,0.015583166,0.67065376,0.0007470935,0.07322449,0.17237829,0.003547909],"about_ca_topic_score_codex":0.0000024669532,"about_ca_topic_score_gemma":0.000008106676,"teacher_disagreement_score":0.96110684,"about_ca_system_score_codex":0.00006894516,"about_ca_system_score_gemma":0.0001571095,"threshold_uncertainty_score":0.53669953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30316064,0.000019861045,0.69520223,0.0006980651,0.00014611873,0.0003409581,0.0000084694775,0.000076138684,0.00034755413],"genre_scores_gemma":[0.99232984,0.0000010747094,0.006332451,0.00080606365,0.00041937464,0.000014866066,0.000010001929,0.000023607934,0.000062737876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980932,0.000022977743,0.0008036632,0.00021009638,0.0005826504,0.0002874493],"domain_scores_gemma":[0.99553823,0.0018308039,0.0013909964,0.0002330035,0.000985196,0.000021762238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015264031,0.00021267039,0.00042829913,0.0006597129,0.00071927236,0.00021025547,0.00034960583,0.000036816746,0.00002351463],"category_scores_gemma":[0.00029049726,0.000094342664,0.00024010094,0.0012834517,0.00013110369,0.0005296896,0.00007424099,0.00013172223,0.000007937146],"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.00048583956,0.000038230635,0.006003364,0.00011721158,0.00085276604,0.0000020023201,0.00019721671,0.938208,0.000016133861,0.04452901,0.0000522917,0.009497928],"study_design_scores_gemma":[0.0010277067,0.00006427083,0.0022897182,0.0004915121,0.0009475726,0.000019504647,0.0016298004,0.9901637,0.000022953744,0.0017390146,0.0013853642,0.00021891012],"about_ca_topic_score_codex":0.000018389423,"about_ca_topic_score_gemma":0.000020593303,"teacher_disagreement_score":0.68916917,"about_ca_system_score_codex":0.00012339001,"about_ca_system_score_gemma":0.000077411496,"threshold_uncertainty_score":0.5532134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32134715,0.0002364529,0.6731524,0.0033064557,0.0013919768,0.00019948604,0.0000019156923,0.00010145142,0.00026272246],"genre_scores_gemma":[0.97689396,0.000032257853,0.021899823,0.0006591048,0.0004113299,0.0000019273107,6.975549e-7,0.000017707307,0.000083195235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757516,0.00016821857,0.00052627036,0.00037385503,0.00071830384,0.00063817244],"domain_scores_gemma":[0.9979648,0.00049849704,0.00062445033,0.0004549608,0.00019804183,0.00025926146],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017292335,0.00032754012,0.00032040887,0.00016773665,0.001524697,0.002057969,0.0009487445,0.00007288619,0.0000024009341],"category_scores_gemma":[0.00026764965,0.00018339307,0.00013186697,0.00049184996,0.00010129561,0.00036028159,0.00031986082,0.00088910206,0.000009085193],"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.000027739497,0.00022112136,0.0028537156,0.00006104801,0.00012923923,0.00039046956,0.0032318372,0.08114889,0.000107817184,0.107356116,0.001708659,0.80276334],"study_design_scores_gemma":[0.00073092576,0.0004014275,0.0033547175,0.0002605051,0.000009375947,0.0011079973,0.0006116417,0.9562917,0.00043505503,0.0045017726,0.03188875,0.00040616852],"about_ca_topic_score_codex":0.0000039708157,"about_ca_topic_score_gemma":6.206573e-7,"teacher_disagreement_score":0.87514275,"about_ca_system_score_codex":0.00007638006,"about_ca_system_score_gemma":0.00011106204,"threshold_uncertainty_score":0.9997752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014600843,0.00024342108,0.98111564,0.00041171125,0.00071582117,0.0005132708,0.0000010764401,0.00017375073,0.002224487],"genre_scores_gemma":[0.824193,0.000044878823,0.1749645,0.00013897273,0.00052581186,0.000010494141,0.0000013648837,0.000038591403,0.00008235177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918777,0.000011301664,0.00030905099,0.000089587076,0.0001430951,0.000259225],"domain_scores_gemma":[0.9991026,0.00024892244,0.0003240575,0.00012167088,0.0001327975,0.00006993434],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008620859,0.00013906411,0.00014781917,0.000071188566,0.0015914094,0.0009012691,0.00020113718,0.00006243234,0.0000066711614],"category_scores_gemma":[0.00014612993,0.0000920075,0.00005854672,0.000055339475,0.000025875626,0.00026856913,0.000040864776,0.00037357473,0.0000024651172],"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.000018782815,0.000006039082,0.0009783232,0.00007035894,0.00008516631,0.0000019566294,0.00085525546,0.7555943,0.000090970825,0.0006920485,0.00023973238,0.24136707],"study_design_scores_gemma":[0.0005755965,0.000094509065,0.0007611046,0.00021949639,0.000018195966,0.00024771743,0.000057679747,0.9923177,0.00025810744,0.00025288056,0.005063645,0.000133361],"about_ca_topic_score_codex":0.0000042062716,"about_ca_topic_score_gemma":0.00000176249,"teacher_disagreement_score":0.8095922,"about_ca_system_score_codex":0.000048533042,"about_ca_system_score_gemma":0.00002454939,"threshold_uncertainty_score":0.99970835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75912976,0.00007129512,0.23749186,0.000105811996,0.0017410204,0.00019647779,6.397558e-7,0.00017669846,0.0010864491],"genre_scores_gemma":[0.9565751,0.000022480546,0.042743824,0.00008332123,0.00047186244,0.0000013509069,0.0000037614616,0.00002259817,0.00007567899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992903,0.000011054831,0.00028722157,0.00008567942,0.0001276258,0.00019812369],"domain_scores_gemma":[0.9995466,0.00008266139,0.00009858283,0.00007436384,0.00011606258,0.000081760285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054360763,0.00010033005,0.000120738936,0.00014244312,0.00022316692,0.00017696829,0.0000667936,0.000052212017,0.0000056652325],"category_scores_gemma":[0.000163173,0.00009386732,0.000039232833,0.00009366311,0.00000962491,0.00019948154,0.000012719793,0.00022293319,0.000013207558],"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.000018887815,0.000012289169,0.0014463299,0.00007543994,0.00003901626,0.0000018160758,0.00088896387,0.9751489,0.00017107379,0.0014213759,0.0001742383,0.020601662],"study_design_scores_gemma":[0.00040418038,0.000065495304,0.0004896718,0.00026806397,0.0000090840795,0.00011547184,0.0002393399,0.99716586,0.00036393947,0.00022004213,0.00051068293,0.00014818409],"about_ca_topic_score_codex":7.538705e-7,"about_ca_topic_score_gemma":3.9901172e-7,"teacher_disagreement_score":0.19744538,"about_ca_system_score_codex":0.00008684422,"about_ca_system_score_gemma":0.000026642034,"threshold_uncertainty_score":0.3827798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6390577,0.000022620658,0.3546147,0.0013494034,0.0009947363,0.00039050315,0.000014434017,0.00008946082,0.0034664352],"genre_scores_gemma":[0.99568385,0.0000086693435,0.0020814196,0.0012667335,0.00045215565,0.0000068778654,0.000060339793,0.000013865447,0.00042606224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998597,0.0000064335272,0.0004610832,0.00019576783,0.00035618964,0.00038350673],"domain_scores_gemma":[0.99858177,0.00001644749,0.00040361588,0.0004119047,0.0005551929,0.000031058014],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009136366,0.0002044805,0.00022201292,0.00018425728,0.0018820511,0.0010009877,0.0004308946,0.000054133285,0.000049488124],"category_scores_gemma":[0.00020718019,0.00015840495,0.00010442443,0.00010729427,0.0000715084,0.0011723407,0.00010681104,0.00020043214,0.00009498216],"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.0012433009,0.00072242576,0.028823912,0.0029166194,0.00060136674,0.000034322893,0.0032524941,0.7149497,0.00013706596,0.075786486,0.009695667,0.16183661],"study_design_scores_gemma":[0.001981087,0.00005608974,0.022433314,0.00014417958,0.00005704651,0.000006273307,0.0011839737,0.8811661,0.000015533498,0.001504919,0.09107008,0.0003813919],"about_ca_topic_score_codex":0.00017954667,"about_ca_topic_score_gemma":0.00046073218,"teacher_disagreement_score":0.35662615,"about_ca_system_score_codex":0.000082514045,"about_ca_system_score_gemma":0.000030072344,"threshold_uncertainty_score":0.99941736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1105344,0.000051640785,0.87599975,0.0007254536,0.0019599372,0.00033732827,0.0000034380828,0.000275298,0.010112743],"genre_scores_gemma":[0.8895681,0.000015377149,0.109321475,0.00028458846,0.0006243599,0.0000044221388,0.0000012891159,0.000057589867,0.0001228124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982957,0.00003140693,0.0006623538,0.00013821438,0.00031226306,0.0005600509],"domain_scores_gemma":[0.99811494,0.00061935047,0.0004580663,0.0004257888,0.00024281647,0.00013905922],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020116952,0.00023047878,0.00025430392,0.00008311463,0.002456815,0.0012693391,0.0007362517,0.00009950254,0.000020143525],"category_scores_gemma":[0.0007701501,0.00016032875,0.00017091804,0.00011856181,0.00007851945,0.0004823856,0.00009000045,0.0007143318,0.000025150886],"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.000028763496,0.000012307173,0.00089450664,0.00002209891,0.00009408012,0.000006404795,0.00061462034,0.8511844,0.00029053772,0.0005604748,0.0005980768,0.1456937],"study_design_scores_gemma":[0.00080028916,0.00010848795,0.0030835634,0.00016563862,0.000020416413,0.0000827245,0.00010386526,0.98671985,0.00038023913,0.0003194856,0.007963393,0.00025203524],"about_ca_topic_score_codex":0.0000067908286,"about_ca_topic_score_gemma":0.0000012764334,"teacher_disagreement_score":0.77903366,"about_ca_system_score_codex":0.00015674919,"about_ca_system_score_gemma":0.000054821623,"threshold_uncertainty_score":0.9997674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9423859,0.00014513465,0.04088711,0.0024423252,0.00123171,0.00032224893,0.000002886644,0.000051999818,0.012530669],"genre_scores_gemma":[0.94408315,0.00003844062,0.053379532,0.0013354197,0.0009708025,0.0000038166495,0.000003846086,0.000018910687,0.00016606375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982935,0.00014784855,0.00073796936,0.00016170985,0.0002308646,0.00042806144],"domain_scores_gemma":[0.9978316,0.00035238848,0.0007751689,0.00023069674,0.0005850002,0.00022517217],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019706448,0.00015304134,0.00024894986,0.00012682442,0.013763952,0.0006133218,0.00020870613,0.00015351843,0.000033057124],"category_scores_gemma":[0.0017235958,0.000118044336,0.000029947798,0.00008424162,0.000037479233,0.00075147796,0.00014415098,0.001332759,0.000032843887],"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.00009848942,0.000043370386,0.39739907,0.00017245521,0.000094808674,0.00009073256,0.04273795,0.442216,0.00022421921,0.012261687,0.0005928484,0.104068354],"study_design_scores_gemma":[0.0025535803,0.00037258933,0.087736264,0.003980499,0.000016640992,0.000089829875,0.018774003,0.87998194,0.000064633685,0.00032837258,0.0056005823,0.00050106295],"about_ca_topic_score_codex":0.000029297025,"about_ca_topic_score_gemma":0.000008451023,"teacher_disagreement_score":0.43776593,"about_ca_system_score_codex":0.00012363859,"about_ca_system_score_gemma":0.0005154825,"threshold_uncertainty_score":0.98752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14134467,0.00048224913,0.85525614,0.00007349039,0.00092287763,0.00025875965,0.00003680792,0.00021151346,0.0014134758],"genre_scores_gemma":[0.79357666,0.0000627117,0.20592888,0.00009161993,0.00025302405,0.0000023948676,0.00002823882,0.000048299065,0.0000081909075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976773,0.00007285577,0.0011445022,0.00025696677,0.00049930695,0.0003490375],"domain_scores_gemma":[0.99870294,0.00014839406,0.00056197896,0.00024288674,0.000113578215,0.00023019126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010641395,0.0003609133,0.00081127125,0.0005987556,0.00012719895,0.00021215205,0.00030188583,0.00022525236,0.000045732435],"category_scores_gemma":[0.00007135612,0.00032396225,0.00030366718,0.00058634614,0.00002957265,0.00011375227,0.0004835072,0.0012401704,0.0000024606918],"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.000010089674,0.000036848967,0.0013005793,0.00010900645,0.0012967485,0.000011125964,0.0015303468,0.98537505,0.00026370393,0.00009070675,0.000057461213,0.009918339],"study_design_scores_gemma":[0.0004998558,0.00010676976,0.0008970803,0.00022853917,0.00028908573,0.000017152592,0.0002178312,0.99448675,0.0026331332,0.00007095143,0.00023775439,0.0003150994],"about_ca_topic_score_codex":0.0000036376694,"about_ca_topic_score_gemma":2.6238476e-7,"teacher_disagreement_score":0.652232,"about_ca_system_score_codex":0.00020937862,"about_ca_system_score_gemma":0.000066922206,"threshold_uncertainty_score":0.99992126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48153302,0.0000628618,0.47871882,0.0020489746,0.003639116,0.00090085785,0.0000024737615,0.00021727997,0.032876614],"genre_scores_gemma":[0.9948022,0.0000071197483,0.0018286016,0.0010824394,0.0017037106,0.000008307003,0.00001622031,0.000019440864,0.0005319709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982609,0.000008136474,0.0006273749,0.0002602752,0.00033307628,0.0005102128],"domain_scores_gemma":[0.9986628,0.00006118264,0.0005626675,0.00046512173,0.00020591432,0.00004229519],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019689922,0.00024624096,0.000258448,0.00017928952,0.0030835727,0.0014598452,0.0006704156,0.00008142275,0.00010700784],"category_scores_gemma":[0.00054143445,0.00020316827,0.00021213616,0.00009044383,0.00006581048,0.0015430866,0.0003994148,0.00030779425,0.00017794114],"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.00024088327,0.00012282925,0.021549547,0.00026588413,0.00012666018,0.000008421444,0.00018172404,0.56382585,0.000012149723,0.006929544,0.0055346875,0.40120184],"study_design_scores_gemma":[0.00100549,0.000025571473,0.028622286,0.00009656746,0.000028823028,0.000004765639,0.00016388451,0.90062916,0.000018112956,0.00047771947,0.06861397,0.0003136328],"about_ca_topic_score_codex":0.00011454007,"about_ca_topic_score_gemma":0.00006087029,"teacher_disagreement_score":0.5132692,"about_ca_system_score_codex":0.000121266225,"about_ca_system_score_gemma":0.000017873297,"threshold_uncertainty_score":0.99957675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35681716,0.000011572703,0.63582194,0.0016200787,0.0010058322,0.00062081503,0.0000071676113,0.00009409065,0.004001351],"genre_scores_gemma":[0.9951483,0.00000382337,0.0037226307,0.00053987675,0.00040387726,0.000008343501,0.0000468209,0.0000071720833,0.000119173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.0000038490807,0.00046009454,0.00016023805,0.00022940511,0.00022396843],"domain_scores_gemma":[0.9988158,0.000032730466,0.00038046783,0.0002388741,0.0005082283,0.000023897821],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091983035,0.00014310473,0.00013966586,0.0002015045,0.0019020364,0.0010546691,0.00022444666,0.000049409635,0.000026433889],"category_scores_gemma":[0.0006751855,0.00012188664,0.00006137079,0.000083352716,0.00004847723,0.0022230244,0.00009688106,0.00014422815,0.0000657424],"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.00007892879,0.00010139373,0.00524499,0.00039829448,0.00006496574,9.00817e-7,0.00042078467,0.039402153,0.00003040381,0.047336355,0.001280848,0.90564],"study_design_scores_gemma":[0.0009101253,0.000019281924,0.06504488,0.00006356048,0.000018635577,0.000002437937,0.00018024202,0.9127195,0.00001488273,0.0058408813,0.015010007,0.00017558281],"about_ca_topic_score_codex":0.00011220026,"about_ca_topic_score_gemma":0.000028357304,"teacher_disagreement_score":0.9054644,"about_ca_system_score_codex":0.000053513028,"about_ca_system_score_gemma":0.00001744448,"threshold_uncertainty_score":0.99998236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.797966,0.000013753189,0.1986308,0.00020181738,0.0009376497,0.00009603468,8.6873956e-7,0.000032013162,0.0021210606],"genre_scores_gemma":[0.9905587,0.0000033272054,0.008531166,0.0006602367,0.0001703438,2.7789895e-7,7.6305844e-7,0.000007152042,0.00006807249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981476,0.000079236896,0.00061823794,0.00017896519,0.0006695401,0.00030640702],"domain_scores_gemma":[0.9984425,0.00021935145,0.0006063176,0.00045932495,0.00017475907,0.00009779985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010000356,0.0001586108,0.00034215068,0.00029947597,0.0001890345,0.00026032454,0.0010035682,0.000050717066,0.00010174593],"category_scores_gemma":[0.00006853101,0.000097354365,0.0004893084,0.0016077183,0.000033951073,0.00055625284,0.00019651379,0.00045023227,0.00010012671],"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.000120610915,0.00012285239,0.102549985,0.000024913576,0.0011646764,0.000027476528,0.002106099,0.8075584,0.0070961593,0.01652407,0.00076044543,0.06194432],"study_design_scores_gemma":[0.0019228905,0.00011249887,0.043457855,0.00009932704,0.0001201316,0.00014202885,0.00004406601,0.93981326,0.0125064105,0.0008098253,0.00070756243,0.0002641442],"about_ca_topic_score_codex":0.000014762103,"about_ca_topic_score_gemma":0.0000026207588,"teacher_disagreement_score":0.19259265,"about_ca_system_score_codex":0.00013187152,"about_ca_system_score_gemma":0.00012543684,"threshold_uncertainty_score":0.39699957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48793057,0.000019610432,0.506969,0.0016168472,0.00028982706,0.0011887834,0.0000036198708,0.00013199954,0.0018497367],"genre_scores_gemma":[0.9964903,0.0000011980125,0.0018062186,0.0011434035,0.00015589675,0.00008167774,0.0001712884,0.000022488448,0.00012751433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981704,0.000022914981,0.00070769736,0.00025678697,0.0005672315,0.00027499258],"domain_scores_gemma":[0.9984673,0.000019504818,0.0005651882,0.00023945172,0.0006654643,0.0000430438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011709381,0.00018778845,0.00019872472,0.00037217434,0.000587582,0.00025518422,0.00029948918,0.000034082826,0.00011892138],"category_scores_gemma":[0.00004954233,0.000163023,0.000042990636,0.000968657,0.000032287015,0.0012093739,0.00012530922,0.00029081263,0.000038037662],"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.00047316795,0.00044889998,0.004518242,0.0004784866,0.00010186059,0.0000019402282,0.0013619337,0.71284014,0.0009093847,0.0379284,0.0024379438,0.23849963],"study_design_scores_gemma":[0.00190064,0.00070758956,0.0070923236,0.00021376762,0.000077527126,0.000027163818,0.0055779647,0.6818835,0.00037910635,0.0006969219,0.30071387,0.0007296423],"about_ca_topic_score_codex":0.00025913125,"about_ca_topic_score_gemma":0.00012628037,"teacher_disagreement_score":0.50855976,"about_ca_system_score_codex":0.00015254285,"about_ca_system_score_gemma":0.000050942344,"threshold_uncertainty_score":0.6647885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8844021,0.00015483153,0.10771583,0.003976403,0.00060185086,0.0005981966,0.0000046331306,0.00007890372,0.0024672293],"genre_scores_gemma":[0.98949194,0.000018851799,0.008069608,0.00047661675,0.0017765325,0.000006840086,0.000006281959,0.000016698017,0.0001366535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991756,0.000004388044,0.00034048868,0.00013277346,0.00016725903,0.0001795073],"domain_scores_gemma":[0.99833614,0.00009544307,0.001096311,0.0002221048,0.00023106097,0.000018961931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074631575,0.00011764807,0.0001983332,0.00024101014,0.0010893752,0.0002246195,0.0001944537,0.000044243774,0.0000036428885],"category_scores_gemma":[0.00026852044,0.0000983196,0.00010142692,0.00007824228,0.000090633046,0.0014032683,0.0001511068,0.0001781278,0.0000044694993],"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.00068585813,0.00019385717,0.0030345859,0.00047629257,0.0003296512,0.000008687677,0.0002054134,0.033554338,0.0059841364,0.5470383,0.0018416947,0.40664718],"study_design_scores_gemma":[0.004477884,0.00012681846,0.0077383826,0.001275203,0.00030397627,0.00014854885,0.001084873,0.7425322,0.0010910865,0.11530066,0.12503633,0.0008840306],"about_ca_topic_score_codex":0.000010889037,"about_ca_topic_score_gemma":0.0000015865182,"teacher_disagreement_score":0.7089779,"about_ca_system_score_codex":0.000031595802,"about_ca_system_score_gemma":0.0000139672375,"threshold_uncertainty_score":0.83787036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013127956,0.00021236353,0.9926483,0.00026362445,0.004468768,0.0008977384,0.000011105837,0.00027890346,0.0010879122],"genre_scores_gemma":[0.03772902,0.000100152734,0.95963246,0.0009477239,0.0013412954,0.0000329743,0.00007181598,0.00006642688,0.00007812307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964607,0.000119112956,0.0011525872,0.00080850744,0.00067734707,0.0007817824],"domain_scores_gemma":[0.995031,0.00050982705,0.0016906367,0.0007312292,0.00176723,0.00027007115],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009416698,0.0005874805,0.0006993177,0.00034593718,0.00090287434,0.001866539,0.0013995804,0.00036555226,0.0000066590615],"category_scores_gemma":[0.00036404686,0.0005400197,0.00044245596,0.000535867,0.000051355582,0.0019095322,0.001678829,0.0016724565,0.0000034397663],"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.000028234614,0.000040588922,0.000007919503,0.000032294934,0.000104422244,0.000022211962,0.0012520314,0.9633854,6.221597e-7,0.00267179,0.00009626898,0.0323582],"study_design_scores_gemma":[0.0010832099,0.00014003247,0.000027277412,0.000675057,0.000021159669,0.0001371528,0.00013087875,0.98610026,0.00003886746,0.010919281,0.000102033984,0.0006248212],"about_ca_topic_score_codex":0.0000048191046,"about_ca_topic_score_gemma":0.0000013429443,"teacher_disagreement_score":0.037597742,"about_ca_system_score_codex":0.0006709432,"about_ca_system_score_gemma":0.000611641,"threshold_uncertainty_score":0.99970514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6292662,0.000059402355,0.35958627,0.0011845905,0.0003430974,0.0003380666,0.0000014083495,0.00031197025,0.008908983],"genre_scores_gemma":[0.9624518,0.0000043515765,0.035791747,0.0012933555,0.00041556294,0.0000016502481,0.0000033355343,0.000032843647,0.000005357971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998167,0.00014300161,0.00068930915,0.00013646756,0.00048051486,0.00038371317],"domain_scores_gemma":[0.99915177,0.00033581574,0.00022462572,0.00011518822,0.000058160695,0.00011445295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017789304,0.00018507015,0.00020701323,0.00012755323,0.00028500817,0.00039621265,0.0003108072,0.00007490633,0.000022159582],"category_scores_gemma":[0.00024176134,0.00013943667,0.00007150686,0.00064691156,0.000017380855,0.00040093705,0.000049754308,0.0008765535,0.000052984065],"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.000010304262,0.00001163596,0.0026056357,0.000025910764,0.000017136688,0.000020147403,0.0046576066,0.9121389,0.00095403596,0.00016190138,0.00015479025,0.079242],"study_design_scores_gemma":[0.0007017332,0.00008469751,0.0034662485,0.0002550153,0.000008719074,0.00006246907,0.00073160906,0.99302346,0.0010126869,0.000077147306,0.0003819049,0.00019432568],"about_ca_topic_score_codex":0.000001632976,"about_ca_topic_score_gemma":1.6140912e-7,"teacher_disagreement_score":0.33318558,"about_ca_system_score_codex":0.00018799958,"about_ca_system_score_gemma":0.000035560373,"threshold_uncertainty_score":0.5686062},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017364053,0.00034549233,0.9756995,0.001497833,0.00093644235,0.00020097406,0.000005827354,0.000013068122,0.0039368533],"genre_scores_gemma":[0.98429984,0.0009714343,0.014034019,0.00014832547,0.00017824746,0.000003935919,0.000025061556,0.000010009677,0.00032913304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995884,0.00044344176,0.001975451,0.00016978027,0.0012228034,0.00030449848],"domain_scores_gemma":[0.9937569,0.0032933992,0.0011771648,0.00025086128,0.0014346765,0.000086982545],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01100114,0.0001290886,0.00044879623,0.00025433837,0.00063714525,0.0005469491,0.0004222618,0.00007770119,0.00004912494],"category_scores_gemma":[0.0088215,0.00007143986,0.000295506,0.001151414,0.00013138099,0.00043696558,0.000121411846,0.00038520005,0.000014405893],"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.0004467857,0.000038251103,0.00082777464,0.0000010514545,0.000022909197,0.00000540272,0.0001976595,0.96377784,0.0000025669378,0.01978158,0.0005048738,0.014393309],"study_design_scores_gemma":[0.008837906,0.000026211292,0.001252246,0.00010447443,0.000011307596,0.000110411755,0.00033790324,0.97822094,0.0000375835,0.009122648,0.0018435937,0.00009479886],"about_ca_topic_score_codex":0.000009049724,"about_ca_topic_score_gemma":0.000012689968,"teacher_disagreement_score":0.96693575,"about_ca_system_score_codex":0.000094069386,"about_ca_system_score_gemma":0.0003854561,"threshold_uncertainty_score":0.99952763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96917284,0.000008607458,0.016357457,0.0010989575,0.001385103,0.00022716376,2.1846463e-7,0.0000873118,0.011662348],"genre_scores_gemma":[0.99713635,0.0000046741634,0.00018127612,0.0015077044,0.0010634096,0.0000023053085,0.000008833549,0.000009685045,0.000085774234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988262,0.000014038858,0.0004940811,0.00014763042,0.00028204938,0.00023599368],"domain_scores_gemma":[0.9993131,0.00001967436,0.00021232515,0.00012984022,0.00030955844,0.000015489393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558298,0.00012745758,0.00013178503,0.00043650952,0.00032586016,0.00034178278,0.00016254539,0.000048690694,0.00012831319],"category_scores_gemma":[0.00023100802,0.000109568435,0.000044018907,0.00060422113,0.00003353235,0.0015067594,0.000078551464,0.00018248244,0.00035081207],"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.00027806745,0.00046960468,0.15850866,0.00038796125,0.000054499353,0.000020879714,0.0017058888,0.4907936,0.0001247836,0.03523708,0.008085605,0.3043334],"study_design_scores_gemma":[0.0011824901,0.00007669367,0.14027426,0.00025863052,0.000010844856,0.0000053596145,0.00034449855,0.78916544,0.000034979403,0.0023517616,0.06596771,0.00032736067],"about_ca_topic_score_codex":0.0002145636,"about_ca_topic_score_gemma":0.00046873617,"teacher_disagreement_score":0.30400604,"about_ca_system_score_codex":0.0000987441,"about_ca_system_score_gemma":0.00002402031,"threshold_uncertainty_score":0.4509096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8335867,0.000007752144,0.15694864,0.00007100275,0.0010726671,0.00016258925,0.0000042165516,0.00004215604,0.008104298],"genre_scores_gemma":[0.9916256,0.000012787957,0.0067544375,0.00041470432,0.0010052499,5.299928e-7,0.0000022222616,0.000011247747,0.00017321113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622357,0.00016418644,0.0012046294,0.0002611737,0.0018367907,0.00030966193],"domain_scores_gemma":[0.9964309,0.00092627417,0.001022829,0.00029024135,0.001114991,0.00021477258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0050499886,0.00017448326,0.0002643659,0.0005262489,0.0010904439,0.00092512596,0.0005940347,0.000058059963,0.00027569625],"category_scores_gemma":[0.0017527763,0.00011354597,0.00013542209,0.00085046544,0.00009037745,0.00064502825,0.00012644342,0.00044823973,0.0011316943],"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.000060062823,0.00015468328,0.25434434,1.7835713e-7,0.00003346779,0.000041307463,0.0038370397,0.40436798,4.266183e-7,0.00021250303,0.004391072,0.33255693],"study_design_scores_gemma":[0.0012482194,0.0015450355,0.27014598,0.000028384178,0.000020273985,0.00026417495,0.0034943246,0.6970125,0.0000061602614,0.009608698,0.016360907,0.0002653499],"about_ca_topic_score_codex":0.000014637347,"about_ca_topic_score_gemma":0.000010896799,"teacher_disagreement_score":0.33229157,"about_ca_system_score_codex":0.000062083156,"about_ca_system_score_gemma":0.00014445247,"threshold_uncertainty_score":0.99964607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24006894,0.0000033868384,0.7568563,0.00015807354,0.0014354372,0.00007296936,1.2283864e-7,0.00008301719,0.0013216984],"genre_scores_gemma":[0.9820973,0.0000017516105,0.017224936,0.0003417259,0.0003132664,3.419988e-7,5.4743185e-7,0.0000049851315,0.000015101572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899024,0.000028860022,0.00035133472,0.00014038075,0.00024683867,0.0002423528],"domain_scores_gemma":[0.9993745,0.000034083227,0.00020397679,0.00014318495,0.00015950757,0.00008472759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032002648,0.000109906425,0.00010525043,0.00028577846,0.00023667849,0.00040977137,0.00027462764,0.00006720944,0.00002581634],"category_scores_gemma":[0.00005533742,0.000086451895,0.000048686397,0.00048153728,0.00003788111,0.0006573809,0.00006679004,0.00040671442,0.000033978406],"study_design_candidate":"design_other","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.000007720863,0.000010911081,0.0021477353,0.000002038629,0.0000052023643,0.000007756474,0.00054660725,0.0043075224,0.00010467099,0.0016312859,0.000020726353,0.99120784],"study_design_scores_gemma":[0.00076315424,0.0004602401,0.034025077,0.00014280484,0.000002065034,0.0008996089,0.00012702633,0.95475245,0.0031426281,0.0021088107,0.003319706,0.00025645588],"about_ca_topic_score_codex":0.000005880728,"about_ca_topic_score_gemma":0.000079611025,"teacher_disagreement_score":0.99095136,"about_ca_system_score_codex":0.00011819163,"about_ca_system_score_gemma":0.000057257614,"threshold_uncertainty_score":0.39514348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33247018,0.00006586409,0.6628857,0.00013170956,0.00020379995,0.0001532563,2.910865e-7,0.00020950173,0.00387968],"genre_scores_gemma":[0.84112155,0.000009121259,0.15833569,0.000044372566,0.0004433515,9.2133524e-7,0.0000011221798,0.000028726143,0.000015172756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871093,0.000046381625,0.000465384,0.00011428586,0.00026391514,0.00039913226],"domain_scores_gemma":[0.9991769,0.000246641,0.00023104074,0.00011888968,0.00013878857,0.000087737964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017282107,0.00016723962,0.00013713734,0.00008656252,0.0014235408,0.00042206465,0.00013418238,0.00006504234,0.0000020842551],"category_scores_gemma":[0.00012759706,0.00010752072,0.000031617863,0.00024968715,0.0000610578,0.00046803607,0.000050940118,0.00042654926,0.0000054664056],"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.0000291721,0.0000059410922,0.0035769723,0.000023565975,0.00004703731,0.00000142265,0.002213722,0.638467,0.0002831048,0.0020617577,0.00003916234,0.3532511],"study_design_scores_gemma":[0.00041983873,0.00014668475,0.0024007757,0.00015515312,0.000008673291,0.000109981476,0.0003103251,0.99437475,0.0011033465,0.00023881982,0.00056642375,0.00016525177],"about_ca_topic_score_codex":0.000002605373,"about_ca_topic_score_gemma":0.00000344601,"teacher_disagreement_score":0.5086514,"about_ca_system_score_codex":0.00011769069,"about_ca_system_score_gemma":0.000025661562,"threshold_uncertainty_score":0.9998765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7310985,0.0008578488,0.2167047,0.0013712024,0.00350364,0.0013938824,0.0000033504432,0.000404064,0.044662848],"genre_scores_gemma":[0.9952453,0.000048493945,0.0038860487,0.00026888802,0.0004909181,0.0000037987224,7.9694e-7,0.000021088581,0.00003469146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999013,0.00001748725,0.00039258876,0.00007434163,0.0001654008,0.0003372002],"domain_scores_gemma":[0.9992937,0.00034903723,0.00012224136,0.00011087442,0.000075607975,0.00004855326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014608285,0.00011914045,0.00010627861,0.00007532809,0.0007575316,0.0004768411,0.00020703027,0.000044123062,0.0000025373704],"category_scores_gemma":[0.00011515346,0.00006846209,0.000042100746,0.00016507502,0.000043147316,0.00014708562,0.000030643918,0.00026991227,0.000004896804],"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.000026008034,0.000020201582,0.0045291726,0.00016053105,0.00006652983,0.0000048532593,0.015729856,0.78074694,0.00006241006,0.016442273,0.0009833792,0.18122786],"study_design_scores_gemma":[0.0006359853,0.00016232455,0.00056620024,0.00040150867,0.0000059448334,0.00015425961,0.0005312279,0.89002484,0.00013989628,0.0013754952,0.10581854,0.00018377036],"about_ca_topic_score_codex":0.000001076442,"about_ca_topic_score_gemma":0.000009700359,"teacher_disagreement_score":0.2641468,"about_ca_system_score_codex":0.000040084895,"about_ca_system_score_gemma":0.000016054986,"threshold_uncertainty_score":0.58263975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28955418,0.000028646866,0.70021623,0.00008971904,0.0004544612,0.00011749568,5.4558075e-7,0.00033730737,0.00920143],"genre_scores_gemma":[0.70955384,0.000015037441,0.28965122,0.0001726927,0.0005463061,2.6597368e-7,0.0000011220146,0.000035687164,0.000023874865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986427,0.00004021081,0.00058143114,0.0001289493,0.00023992942,0.00036678673],"domain_scores_gemma":[0.9992615,0.0000856478,0.00018968862,0.00012350958,0.0001847602,0.0001548659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363561,0.00018212471,0.00020507918,0.00020135117,0.0004016013,0.0003247327,0.0001210333,0.00008637012,0.00004394962],"category_scores_gemma":[0.00016560113,0.00016257034,0.000048747537,0.00030452007,0.000049168062,0.00036802384,0.00006639698,0.00042532306,0.0000202731],"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.000006676734,0.0000060306234,0.0006867987,0.000016442506,0.00002252043,0.0000041612934,0.00081567286,0.9499421,0.00038651307,0.00018595286,0.000094972536,0.04783213],"study_design_scores_gemma":[0.00052951404,0.0001222767,0.0008638046,0.00019679399,0.000008036265,0.00019960687,0.000101132915,0.99597555,0.001394372,0.00009068886,0.00031555392,0.0002026873],"about_ca_topic_score_codex":0.0000021710011,"about_ca_topic_score_gemma":3.542132e-7,"teacher_disagreement_score":0.41999963,"about_ca_system_score_codex":0.000113004986,"about_ca_system_score_gemma":0.000024938014,"threshold_uncertainty_score":0.66294265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088437356,0.000030123234,0.9102914,0.00013597596,0.000588732,0.00023550233,0.0000043995897,0.000037710204,0.00023881548],"genre_scores_gemma":[0.96904737,0.0000028647246,0.02994224,0.00021518116,0.0007532774,0.000003033272,0.000011908529,0.0000086193,0.000015509859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881816,0.0000632517,0.00045080294,0.00008188982,0.00028477793,0.00030111877],"domain_scores_gemma":[0.9983963,0.0006820136,0.00046208387,0.0000659406,0.000322179,0.00007150242],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015819003,0.00008710614,0.0001259489,0.00007082021,0.0020197663,0.00010027819,0.000203978,0.00006500034,0.000008591737],"category_scores_gemma":[0.00010234069,0.00006440735,0.00007175138,0.00025263673,0.00012959339,0.00020308456,0.0000023774098,0.00015131081,0.0000029479172],"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.0000772488,0.000009597107,0.0005273893,0.000010957873,0.000020929621,7.071328e-7,0.020337695,0.9666178,0.000003389893,0.010171626,0.000056324847,0.002166301],"study_design_scores_gemma":[0.0008903667,0.00050660863,0.016032254,0.0008528352,0.000104132465,0.000006759164,0.0066591566,0.9684996,0.00002099247,0.0049143555,0.0012992395,0.00021371472],"about_ca_topic_score_codex":0.000033301018,"about_ca_topic_score_gemma":0.00005013842,"teacher_disagreement_score":0.88061,"about_ca_system_score_codex":0.00003502253,"about_ca_system_score_gemma":0.00019021428,"threshold_uncertainty_score":0.99927944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032026682,0.00002507542,0.9633417,0.0028262103,0.00077149656,0.00017891075,0.000007346055,0.00011717694,0.0007053881],"genre_scores_gemma":[0.5121785,0.000017793434,0.4839013,0.0031621563,0.00011649112,0.000010098242,0.000023385766,0.000018000972,0.0005723234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998688,0.00004378407,0.00042045355,0.00013961356,0.0004009388,0.0003072321],"domain_scores_gemma":[0.999072,0.00019422796,0.00030608397,0.00018652888,0.00012705469,0.000114072005],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008178562,0.00009367611,0.00011421635,0.00027333637,0.001469765,0.00036813164,0.00069628056,0.000018736575,0.00003015923],"category_scores_gemma":[0.00007943745,0.00008202166,0.00009806188,0.00041672456,0.000011468421,0.00048603097,0.0003407237,0.00052384735,0.000011235648],"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.000008020955,0.000067043526,0.00003814736,0.0000060339216,0.0000149227335,0.000006602542,0.0011651064,0.8729939,0.000029559174,0.034418944,0.00048717324,0.09076456],"study_design_scores_gemma":[0.00048046315,0.00023777004,0.0001561248,0.000021880967,0.0000016459811,0.00016661089,0.00013633595,0.9616818,0.000005793968,0.0089653125,0.02803161,0.000114656614],"about_ca_topic_score_codex":0.0000021167202,"about_ca_topic_score_gemma":0.0000017284151,"teacher_disagreement_score":0.48015177,"about_ca_system_score_codex":0.00016470888,"about_ca_system_score_gemma":0.00013484887,"threshold_uncertainty_score":0.9998302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55741274,0.00009743579,0.43196276,0.00015773844,0.006385856,0.00027774394,0.000009039678,0.00028227066,0.0034143985],"genre_scores_gemma":[0.9876343,0.000018679499,0.009451368,0.0005115473,0.0022607837,0.0000109451685,0.000066041306,0.00003838607,0.000007940111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976024,0.000023996441,0.000971786,0.00016902304,0.00055754895,0.0006752438],"domain_scores_gemma":[0.9988268,0.000113768416,0.00022508152,0.00021917142,0.00036601583,0.00024918557],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00063782925,0.00038225693,0.00036353932,0.00041307128,0.00060381315,0.0014007653,0.0003008083,0.00030195198,0.000023922426],"category_scores_gemma":[0.00021674714,0.00034270043,0.0001801227,0.00020564735,0.000017863722,0.0009916113,0.00042732983,0.0026812938,0.000033401837],"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.0000072311395,0.0000054326874,0.00094075856,0.0001157079,0.000114961564,0.00001286429,0.0027058995,0.9852656,0.00011544383,0.0002580426,0.00042154515,0.010036503],"study_design_scores_gemma":[0.0006080993,0.00014752599,0.010648981,0.004522955,0.000050938215,0.0008895669,0.002135112,0.9746685,0.0007031121,0.00042607324,0.004293026,0.0009061226],"about_ca_topic_score_codex":0.000010925709,"about_ca_topic_score_gemma":0.0000019489305,"teacher_disagreement_score":0.43022156,"about_ca_system_score_codex":0.0006919719,"about_ca_system_score_gemma":0.0002736252,"threshold_uncertainty_score":0.9999025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019518927,0.00017677805,0.97279537,0.005304377,0.00031468685,0.00044174955,0.0000035650976,0.0002699293,0.0011745981],"genre_scores_gemma":[0.86502874,0.000059080456,0.13255554,0.0014949453,0.00078149704,0.0000068799523,0.0000023072225,0.000053399064,0.000017600181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889904,0.00001861949,0.00043787854,0.00011189024,0.00021059245,0.00032198185],"domain_scores_gemma":[0.99907506,0.0004047522,0.00014849842,0.000090600806,0.000092920935,0.0001881828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061073375,0.00017172504,0.00019554485,0.000056561446,0.00035739032,0.0002466297,0.00024094703,0.00006817021,0.000010672192],"category_scores_gemma":[0.0004222537,0.000111245936,0.0000784237,0.00025872598,0.000026052448,0.00020118378,0.00005067623,0.0005101309,0.000006405714],"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.000025066054,0.0000029184775,0.00035708482,0.00014064029,0.00007367248,0.0000021649425,0.0029004756,0.87966996,0.0001251964,0.00030127948,0.0008257892,0.11557572],"study_design_scores_gemma":[0.0006683656,0.00009357396,0.00038521047,0.00011339729,0.000017156857,0.00008651939,0.0001551047,0.99086565,0.0003001929,0.00035573472,0.0067867716,0.00017231653],"about_ca_topic_score_codex":6.42003e-7,"about_ca_topic_score_gemma":7.81586e-7,"teacher_disagreement_score":0.8455098,"about_ca_system_score_codex":0.000039723684,"about_ca_system_score_gemma":0.00004527784,"threshold_uncertainty_score":0.45364776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.708581,0.00007213927,0.26884168,0.000031292155,0.0007821047,0.00023024953,5.899639e-7,0.00029038414,0.02117055],"genre_scores_gemma":[0.97068894,0.000008282343,0.029086312,0.00004634177,0.00009697684,3.6217997e-7,0.0000015113366,0.0000191487,0.00005214275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908906,0.000005202595,0.00040936575,0.000050404804,0.00019248387,0.00025347486],"domain_scores_gemma":[0.9995891,0.00006377427,0.000107384774,0.00009319884,0.00006763528,0.00007895061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003705341,0.000101308004,0.00018196607,0.000087426015,0.000064549014,0.00006517939,0.00012242516,0.00005020224,0.00006534136],"category_scores_gemma":[0.000045634173,0.00007856871,0.000084427826,0.00013873333,0.000009799612,0.00017710525,0.000032969972,0.00028641638,0.000081800936],"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.000012828608,0.0001239351,0.002930645,0.00054634333,0.000112311194,0.000008264006,0.0025535875,0.6255936,0.00030373567,0.006654452,0.00013738748,0.36102292],"study_design_scores_gemma":[0.0004598883,0.00011625361,0.000087438675,0.0003734488,0.000005468504,0.00003510199,0.00035341474,0.99321544,0.000649374,0.0002100073,0.0043556155,0.00013856965],"about_ca_topic_score_codex":2.7245756e-7,"about_ca_topic_score_gemma":1.4714755e-7,"teacher_disagreement_score":0.3676218,"about_ca_system_score_codex":0.000027789438,"about_ca_system_score_gemma":0.000010261958,"threshold_uncertainty_score":0.3203939},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41612157,0.0000061816895,0.57904863,0.00018488917,0.00014022377,0.00027275112,0.0000028777006,0.000016990394,0.0042058816],"genre_scores_gemma":[0.9799442,0.0000057083403,0.01977664,0.00012603412,0.000059505026,7.332803e-7,0.0000034707173,0.00000956818,0.00007408496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.00005435171,0.00044309898,0.000059444385,0.00044949807,0.00016184579],"domain_scores_gemma":[0.99822456,0.0011248504,0.00028406412,0.00013482565,0.00020174128,0.000029958215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064375205,0.00007328437,0.00012968629,0.00020871256,0.000096551135,0.000058606332,0.0002124633,0.00003109384,0.000118107324],"category_scores_gemma":[0.0008392952,0.000045910052,0.000047575722,0.00037865207,0.000018601928,0.00025635483,0.000030384865,0.0003170339,0.000018077912],"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.000051830448,0.00025970157,0.016584761,0.00013069442,0.00004129915,0.00001712059,0.011835742,0.80821496,0.00017315293,0.09839755,0.00044736647,0.06384584],"study_design_scores_gemma":[0.0027845004,0.000578886,0.018763147,0.00052076054,0.000013689368,0.00022702057,0.0094362,0.8762354,0.00084702676,0.08640886,0.0037804323,0.00040406582],"about_ca_topic_score_codex":0.0000018300526,"about_ca_topic_score_gemma":0.0000012369304,"teacher_disagreement_score":0.5638227,"about_ca_system_score_codex":0.000061316474,"about_ca_system_score_gemma":0.000064507876,"threshold_uncertainty_score":0.18721576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36030507,0.000106772655,0.63315415,0.0031277002,0.0005625804,0.0010498738,0.000024600602,0.000064755535,0.0016044965],"genre_scores_gemma":[0.92564,0.000002835352,0.07221614,0.0015027543,0.0004660745,0.000011511943,0.0000027746182,0.000032396325,0.00012554626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955438,0.00023308395,0.0020129145,0.00042155507,0.0012952351,0.00049343804],"domain_scores_gemma":[0.9934526,0.0025987325,0.0017919139,0.0005081043,0.0013138113,0.0003348439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078687845,0.00028077778,0.00054677617,0.00031857414,0.0010494475,0.0010264581,0.0010378257,0.00009374424,0.00012713765],"category_scores_gemma":[0.002538206,0.00014336377,0.00030192433,0.0012219894,0.00015145914,0.00078639307,0.0002669864,0.0006384623,0.000048662383],"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.00048755595,0.00010727793,0.0034890557,0.000073498624,0.00010246216,0.00020030848,0.0050445055,0.8624093,0.00006739979,0.00087059545,0.009234485,0.11791358],"study_design_scores_gemma":[0.0029815831,0.0012358162,0.0006530916,0.0005110783,0.00005298287,0.004555794,0.008086607,0.9480546,0.000092315946,0.0032171889,0.03013602,0.00042290604],"about_ca_topic_score_codex":0.00002954892,"about_ca_topic_score_gemma":0.000078836114,"teacher_disagreement_score":0.5653349,"about_ca_system_score_codex":0.0000860527,"about_ca_system_score_gemma":0.0002414529,"threshold_uncertainty_score":0.98981595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49637866,0.00006556706,0.43041876,0.00005599293,0.0020016558,0.00025876678,0.0000014318675,0.00025040074,0.07056877],"genre_scores_gemma":[0.9919296,0.0000723525,0.00738139,0.00017499903,0.00024281479,0.0000012612172,0.0000053860963,0.00002459346,0.00016762807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.000011729111,0.0003715437,0.00010977145,0.00022826462,0.00034779662],"domain_scores_gemma":[0.99951476,0.00005055016,0.0000956416,0.00016958937,0.00007465989,0.00009479704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049188134,0.00014812114,0.00019157947,0.000115794435,0.00010259343,0.00014397386,0.00019391123,0.00008422252,0.000031245734],"category_scores_gemma":[0.000042289696,0.00011147131,0.00008691264,0.00018274646,0.000018370014,0.00034907853,0.00003051199,0.0005217577,0.0001197901],"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.000021120904,0.000017433074,0.00069749006,0.000056752997,0.00002001214,0.0000048700767,0.00027410002,0.97463477,0.00006217934,0.0025231494,0.0013279386,0.020360162],"study_design_scores_gemma":[0.00084875245,0.00011973285,0.0022499866,0.00028574115,0.0000046879263,0.00021326382,0.00020785735,0.9855813,0.000087787594,0.00054330507,0.009609625,0.00024800157],"about_ca_topic_score_codex":0.0000013062261,"about_ca_topic_score_gemma":2.3766592e-7,"teacher_disagreement_score":0.49555093,"about_ca_system_score_codex":0.00014531922,"about_ca_system_score_gemma":0.000016310592,"threshold_uncertainty_score":0.4545668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10527727,0.00025955835,0.8923922,0.000048800524,0.0010168019,0.00030072176,0.0000051406623,0.00027317894,0.00042630176],"genre_scores_gemma":[0.39379856,0.00007012624,0.60519713,0.00026012055,0.00052665436,0.0000045742295,0.000017184948,0.00006266584,0.00006298772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987137,0.000011417859,0.00050545455,0.00016952264,0.00018795815,0.00041198684],"domain_scores_gemma":[0.99921256,0.00011326519,0.00015731635,0.00016653416,0.00013659199,0.00021370308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005804647,0.00023110108,0.00026798388,0.00017654784,0.00022291484,0.00031913756,0.00021259423,0.000111308414,0.00002004923],"category_scores_gemma":[0.000033505767,0.00019506029,0.000088582536,0.0001623485,0.000014301018,0.00044938654,0.00002658342,0.0005191795,0.000022306132],"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.000008912103,0.000014030806,0.00018814277,0.000040613882,0.00004051198,9.1486964e-7,0.00028149603,0.7877537,0.00015103482,0.00005974307,0.000006070395,0.21145482],"study_design_scores_gemma":[0.0015502382,0.00024125895,0.00015613863,0.00012283014,0.000009590704,0.00011248096,0.000081937935,0.9965247,0.00017352252,0.00019762991,0.0005439014,0.00028576003],"about_ca_topic_score_codex":0.0000029113596,"about_ca_topic_score_gemma":6.101049e-7,"teacher_disagreement_score":0.2885213,"about_ca_system_score_codex":0.000064703214,"about_ca_system_score_gemma":0.000030192492,"threshold_uncertainty_score":0.7954328},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2275471,0.00090692774,0.77010953,0.00003732177,0.000374422,0.00022250008,0.000006509515,0.000059419825,0.0007362886],"genre_scores_gemma":[0.985628,0.00002462946,0.013927235,0.000020012214,0.00031952266,0.0000102395725,0.000025051628,0.00001854615,0.000026772606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.000035546847,0.00059495546,0.0001082077,0.0002586065,0.00023685927],"domain_scores_gemma":[0.99915737,0.000117557785,0.00025496256,0.0001877557,0.0002336884,0.000048693317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079093484,0.00013607753,0.0002443814,0.00015341569,0.00022525692,0.00006564619,0.00012335335,0.00006800036,0.000012124818],"category_scores_gemma":[0.00007233137,0.000093602284,0.00023410885,0.00029248017,0.000020485526,0.00025350795,0.000040985473,0.00027960583,0.0000027666797],"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.00003711126,0.00007031764,0.0003248254,0.0002922649,0.0003454837,0.000007565426,0.0034599332,0.95225334,0.0010302684,0.00015601334,0.00093022286,0.041092683],"study_design_scores_gemma":[0.0003967646,0.00007331162,0.0007597399,0.00019236833,0.00005548084,0.00025063485,0.0025644158,0.9937182,0.0011607982,0.000045364603,0.00067992904,0.00010296348],"about_ca_topic_score_codex":0.000002720392,"about_ca_topic_score_gemma":0.0000019794788,"teacher_disagreement_score":0.7580809,"about_ca_system_score_codex":0.00011617405,"about_ca_system_score_gemma":0.000031283922,"threshold_uncertainty_score":0.38169903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0358852,0.000048654387,0.96168894,0.00007062108,0.00063838385,0.0007280933,7.221537e-7,0.0001900475,0.0007493175],"genre_scores_gemma":[0.6465995,0.0000024414792,0.35301292,0.000111387264,0.0002234929,0.0000035964013,0.0000015237188,0.000021308093,0.000023887307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878067,0.000048565555,0.00044299473,0.00010637732,0.00023657485,0.00038480217],"domain_scores_gemma":[0.9981703,0.001227446,0.0001921756,0.00016337058,0.00018386082,0.00006281504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847587,0.00017083692,0.00019039646,0.000048423488,0.00035951118,0.00021103288,0.00019295896,0.0000632074,0.00001869922],"category_scores_gemma":[0.000096031275,0.00010106125,0.00007444265,0.00025779696,0.000024329884,0.00029874942,0.000020893473,0.00055491936,0.000008550767],"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.00006301103,0.0000038242133,0.0016150369,0.000028221186,0.00005174749,4.6341006e-7,0.00019243016,0.90071404,0.000022997818,0.00081241195,0.000103350896,0.09639249],"study_design_scores_gemma":[0.00085699715,0.00015412907,0.0022143354,0.00016088744,0.000013290833,0.00010944552,0.000048772417,0.9950852,0.00019788818,0.0005286441,0.00046564033,0.000164818],"about_ca_topic_score_codex":6.44624e-7,"about_ca_topic_score_gemma":4.5781346e-7,"teacher_disagreement_score":0.61071426,"about_ca_system_score_codex":0.00012799891,"about_ca_system_score_gemma":0.000057229146,"threshold_uncertainty_score":0.4121158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17574032,0.00055456016,0.82070434,0.00015117423,0.00095562765,0.00078316184,0.000011742486,0.00044080525,0.0006582501],"genre_scores_gemma":[0.5923528,0.00005197005,0.40703908,0.00006906995,0.00028919283,0.000027760492,0.000068640344,0.00008332745,0.000018142917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967818,0.00010226145,0.0012388682,0.0005213729,0.0005547063,0.0008009867],"domain_scores_gemma":[0.9982389,0.00016568531,0.0005036538,0.00039890088,0.00022390699,0.00046890817],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017566821,0.0006292715,0.0007299701,0.00048775098,0.00035753404,0.002219252,0.0004310396,0.00026663695,0.000016504518],"category_scores_gemma":[0.00019756482,0.00058568316,0.00021799166,0.00043226933,0.00010526675,0.00031015603,0.00058830954,0.0024019978,0.000004548306],"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.00000904647,0.000041685365,0.0009838981,0.0005298572,0.00012937178,0.000035305387,0.0010469144,0.68774,0.000012305441,0.00019249842,0.000043270626,0.3092358],"study_design_scores_gemma":[0.00059699535,0.00020946722,0.0005242768,0.0047643604,0.00007386162,0.0011486473,0.0009129473,0.98340285,0.0006338204,0.00025468346,0.006281905,0.0011961686],"about_ca_topic_score_codex":0.000006640321,"about_ca_topic_score_gemma":0.0000029017526,"teacher_disagreement_score":0.4166125,"about_ca_system_score_codex":0.0004414934,"about_ca_system_score_gemma":0.00013051918,"threshold_uncertainty_score":0.9998995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61303043,0.000022303335,0.38325697,0.00012883509,0.00045674614,0.00018465263,0.0000016062079,0.00017529048,0.0027431506],"genre_scores_gemma":[0.8786737,0.0000026994128,0.12028499,0.0007568021,0.00023541189,0.0000010505889,0.00000298975,0.0000308432,0.0000115189305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878544,0.00007979908,0.00038179144,0.00013460703,0.0002861913,0.00033214854],"domain_scores_gemma":[0.99909776,0.0002209581,0.00009762499,0.0002965556,0.000086970664,0.0002001075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548791,0.00018368069,0.00020468261,0.00016622062,0.00026144675,0.00029051007,0.00035747126,0.00007925044,0.000012809826],"category_scores_gemma":[0.0000662715,0.00012770799,0.0000726477,0.00024302973,0.000017371267,0.00024014355,0.000046631885,0.00062270026,0.00005782732],"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.000011240865,0.000018725512,0.0018472208,0.000020569003,0.000016722159,0.000001081776,0.00073068944,0.93145555,0.00011072158,0.00011116499,0.000083422194,0.06559287],"study_design_scores_gemma":[0.0005143905,0.000085214946,0.012274133,0.00006090239,0.000007684111,0.000042355354,0.00019285218,0.9848351,0.00021203476,0.000009798559,0.001574325,0.0001912461],"about_ca_topic_score_codex":0.0000074192667,"about_ca_topic_score_gemma":9.571382e-7,"teacher_disagreement_score":0.26564324,"about_ca_system_score_codex":0.00009205374,"about_ca_system_score_gemma":0.000029119861,"threshold_uncertainty_score":0.52077806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13078602,0.00027512212,0.86630285,0.00034583273,0.0013384215,0.00014411654,0.0000063706925,0.00019963537,0.0006016336],"genre_scores_gemma":[0.80337715,0.000121466495,0.19553295,0.00041548483,0.000451122,0.0000028551665,0.000064538704,0.000019054523,0.000015376678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974297,0.00023479089,0.0007427155,0.0006427632,0.00057174463,0.00037826694],"domain_scores_gemma":[0.99744654,0.00021202628,0.00072089036,0.00077358953,0.0005508829,0.00029605502],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011857767,0.0003761933,0.00042174567,0.00033083433,0.00051627576,0.0031235914,0.0012476571,0.00038292585,0.0000059962963],"category_scores_gemma":[0.0007443996,0.0003063711,0.00011498904,0.0002704846,0.000041678846,0.0012740195,0.0014890142,0.0045585334,0.0000051976976],"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.0000354722,0.000075292555,0.0006815176,0.000051505554,0.00010880885,0.000051811556,0.00937991,0.6724401,0.000010070716,0.006191931,0.000049508562,0.31092405],"study_design_scores_gemma":[0.00018379198,0.00022770796,0.0014062761,0.0015214855,0.000015970605,0.00018721851,0.00087769766,0.9901366,0.00001490437,0.004696924,0.00040360473,0.00032776655],"about_ca_topic_score_codex":0.00006413158,"about_ca_topic_score_gemma":0.0000029994965,"teacher_disagreement_score":0.67259115,"about_ca_system_score_codex":0.00017699414,"about_ca_system_score_gemma":0.0004333396,"threshold_uncertainty_score":0.99993885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86021805,0.000026173346,0.009863366,0.0008327994,0.00071194395,0.000097273594,2.2867094e-7,0.00014617135,0.12810399],"genre_scores_gemma":[0.9939723,0.0000018353559,0.0014915428,0.0024036914,0.0018006467,8.960204e-7,0.000014639175,0.000023632556,0.00029078705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882114,0.0000034906257,0.00038682987,0.00014742748,0.0003333199,0.0003078088],"domain_scores_gemma":[0.99883306,0.000024377106,0.0003908851,0.00012327416,0.0006137182,0.000014690776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037588712,0.00016602625,0.00017291418,0.00022116011,0.0005365394,0.00092369685,0.00014472268,0.000052747415,0.00016018444],"category_scores_gemma":[0.00008886894,0.0001228187,0.000048494712,0.0008943674,0.000021717045,0.0020261086,0.00009349638,0.00042568825,0.00026376435],"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.0007912245,0.00038970623,0.17189044,0.0010231448,0.00050450524,0.001385229,0.000620572,0.17439486,0.0077996617,0.19600216,0.011275802,0.4339227],"study_design_scores_gemma":[0.009431678,0.0003206421,0.09054026,0.006254849,0.00020782872,0.003539804,0.0017199168,0.48227796,0.007822196,0.0056904186,0.38894305,0.0032513996],"about_ca_topic_score_codex":0.000006788984,"about_ca_topic_score_gemma":9.67497e-7,"teacher_disagreement_score":0.4306713,"about_ca_system_score_codex":0.00004580753,"about_ca_system_score_gemma":0.0000782343,"threshold_uncertainty_score":0.890723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2528459,0.0000156222,0.7449801,0.00007541998,0.00053686765,0.00024011196,0.000010897741,0.00017318173,0.0011218932],"genre_scores_gemma":[0.8721281,0.0000020498105,0.12724873,0.00022045626,0.0002872271,0.000019159212,0.00003251367,0.000033217628,0.00002851299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882835,0.000047792073,0.00044343513,0.000106618194,0.00027340488,0.0003003974],"domain_scores_gemma":[0.9993814,0.00013859353,0.0001834515,0.000089962916,0.00012066648,0.000085876374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360449,0.00013776065,0.00016270831,0.0001431829,0.00078205566,0.00021806474,0.00013205236,0.000032360833,0.00006098656],"category_scores_gemma":[0.00008315203,0.00012535795,0.000059198283,0.00022266562,0.000030178222,0.00021334869,0.00003353338,0.00052470167,0.0000027889814],"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.000011662913,0.0000077796885,0.0004893958,0.00001635833,0.000036290105,0.000004812199,0.00072133366,0.9658912,0.0003430651,0.000398703,0.0005142187,0.031565223],"study_design_scores_gemma":[0.00079485413,0.00027945935,0.00012345395,0.000066377004,0.000010500261,0.00044789014,0.0004247509,0.9944115,0.0005569762,0.000103760554,0.0025935841,0.00018684253],"about_ca_topic_score_codex":0.0000013623101,"about_ca_topic_score_gemma":0.0000020869845,"teacher_disagreement_score":0.61928225,"about_ca_system_score_codex":0.00025069126,"about_ca_system_score_gemma":0.00006906122,"threshold_uncertainty_score":0.6015019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33853826,0.00057446817,0.65408564,0.0010818805,0.001837529,0.00013675676,5.726967e-7,0.000310527,0.003434403],"genre_scores_gemma":[0.99660474,0.00018086034,0.0014891479,0.0010551913,0.0006106113,6.6349793e-7,0.0000042336706,0.000035991707,0.000018552919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851143,0.000016845985,0.0006158033,0.00012623583,0.00028384797,0.00044582918],"domain_scores_gemma":[0.9995511,0.00004938866,0.00006764022,0.00008717686,0.000028608698,0.00021607195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027929552,0.000217427,0.00023342363,0.00016004856,0.00008744044,0.00010446908,0.000245482,0.000051884675,0.000023505378],"category_scores_gemma":[0.000016240792,0.00018159796,0.00010968504,0.0003737178,0.000012185694,0.00025057368,0.00002692524,0.0009534324,0.000020754333],"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.00003590343,0.0000071387817,0.00014386125,0.000023040862,0.000019013572,0.00008769317,0.00068931,0.83459234,0.000061224666,0.000020455462,0.0015555238,0.16276452],"study_design_scores_gemma":[0.00096158416,0.000059690447,0.001421381,0.00018053621,0.0000062557924,0.000036701975,0.00005372068,0.97409016,0.0001674205,0.000021049584,0.022786267,0.00021523447],"about_ca_topic_score_codex":0.0000024965157,"about_ca_topic_score_gemma":0.0000022472884,"teacher_disagreement_score":0.6580665,"about_ca_system_score_codex":0.00010691456,"about_ca_system_score_gemma":0.000012124037,"threshold_uncertainty_score":0.740535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7590468,0.0007022573,0.23171024,0.000983945,0.0012085061,0.00054615183,0.0000083602345,0.00030354905,0.005490197],"genre_scores_gemma":[0.98746294,0.0000430731,0.01003757,0.001257003,0.0009175295,0.0000042906026,0.000007700518,0.00005525665,0.00021465565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.000015648851,0.00040830582,0.00013228782,0.00021251779,0.00046352806],"domain_scores_gemma":[0.99922335,0.00016740548,0.00012534273,0.00021545964,0.00014140987,0.00012704138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004943502,0.0001815218,0.00020789116,0.000054195094,0.0006565355,0.000835198,0.0005496972,0.0000803443,0.000047149333],"category_scores_gemma":[0.000036915346,0.00012143785,0.00009350066,0.00024069838,0.000013148671,0.0005712297,0.00012236624,0.00068333873,0.000009171489],"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.00002316094,0.000017238783,0.00053848734,0.000034570658,0.00011931932,0.000015931177,0.0010674142,0.5040613,0.0027477653,0.0010827044,0.003219689,0.48707244],"study_design_scores_gemma":[0.0010101917,0.00016997007,0.0020164638,0.00014063428,0.000020306965,0.00033888733,0.0003188722,0.8811516,0.004869273,0.000747003,0.10894668,0.00027010945],"about_ca_topic_score_codex":0.0000060624793,"about_ca_topic_score_gemma":0.000004823142,"teacher_disagreement_score":0.4868023,"about_ca_system_score_codex":0.000113312395,"about_ca_system_score_gemma":0.00007700346,"threshold_uncertainty_score":0.8053833},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30609936,0.000014984377,0.6923727,0.00039966253,0.00017126215,0.000108286134,0.00000413945,0.00001908094,0.0008105402],"genre_scores_gemma":[0.9501916,0.000023801376,0.04865378,0.00069899845,0.00038940832,1.652977e-7,0.0000042339016,0.000014775903,0.000023208497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705464,0.00009090036,0.0010026097,0.000198871,0.0014098403,0.00024315863],"domain_scores_gemma":[0.9973942,0.000328065,0.0013415762,0.00022232711,0.0005630788,0.0001507722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097626826,0.00016681378,0.00027166854,0.00017410467,0.0005104707,0.00057434896,0.00063112244,0.00005445139,0.000120090815],"category_scores_gemma":[0.00041571015,0.00008373549,0.00010294997,0.00078821485,0.00006162784,0.0010819512,0.0001078669,0.00045584358,0.0000053285817],"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.000094783354,0.000007185432,0.00075483206,0.00000200035,0.000016472144,0.000010396905,0.00314192,0.97951275,0.000058079153,0.0008025064,0.00011402617,0.015485069],"study_design_scores_gemma":[0.0006949394,0.00016260144,0.00007699741,0.000050153958,0.000010741745,0.000064853986,0.0019561865,0.99574727,0.00044031464,0.0005051135,0.00017114118,0.00011970983],"about_ca_topic_score_codex":0.000008862361,"about_ca_topic_score_gemma":0.0000026054752,"teacher_disagreement_score":0.64409226,"about_ca_system_score_codex":0.000025486679,"about_ca_system_score_gemma":0.0001195916,"threshold_uncertainty_score":0.553846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31435615,0.00013359671,0.68429667,0.00035196258,0.00009825822,0.00018288271,0.0000020132352,0.0001356764,0.00044279126],"genre_scores_gemma":[0.7312649,0.000032360273,0.26826984,0.00021760652,0.00013933134,0.0000051334623,0.000006063401,0.000035393885,0.000029346207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989711,0.000030890613,0.00037514622,0.00015849985,0.00019974365,0.00026462454],"domain_scores_gemma":[0.9988964,0.0002090418,0.00016394859,0.000129801,0.00047731103,0.00012349291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754095,0.00017692345,0.00019747038,0.00010683353,0.00038178536,0.00035075354,0.00009082908,0.00007367351,0.000007763935],"category_scores_gemma":[0.000084650484,0.00015385733,0.000029212073,0.0003333341,0.000022145166,0.00039134469,0.000034280398,0.000344828,0.000005197141],"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.000012775417,0.000021430946,0.0007666238,0.00018377975,0.00007927128,0.0000016814965,0.0013959561,0.9660047,0.0005631605,0.00030158303,0.000010027705,0.030658979],"study_design_scores_gemma":[0.0010214378,0.00014511611,0.0014554142,0.0004702115,0.000024974945,0.00030690688,0.00024080055,0.99179804,0.00359668,0.00045175807,0.00021475364,0.00027388288],"about_ca_topic_score_codex":0.000005632558,"about_ca_topic_score_gemma":0.0000028783625,"teacher_disagreement_score":0.41690877,"about_ca_system_score_codex":0.00011199421,"about_ca_system_score_gemma":0.00009350498,"threshold_uncertainty_score":0.62741196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29114124,0.000062306,0.70648766,0.00095824734,0.00029554294,0.0001133176,4.6370707e-7,0.00008126967,0.0008599257],"genre_scores_gemma":[0.9652259,0.000024017274,0.033568036,0.0010045082,0.00008340542,0.000001819358,0.000007166814,0.0000075078333,0.000077638884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983645,0.00015943291,0.0006679743,0.00015706076,0.00046490165,0.00018611035],"domain_scores_gemma":[0.9981976,0.0001625447,0.0006348401,0.00036708097,0.0005789573,0.000058984526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377466,0.0001225418,0.00018280881,0.00012274811,0.00034596922,0.00047376764,0.00047472588,0.00007109325,0.000015343452],"category_scores_gemma":[0.00014955045,0.0000878046,0.00010932827,0.0005518356,0.000033524335,0.000719987,0.0001335578,0.00038118722,0.000012248088],"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.000053595242,0.0003000041,0.000401342,0.000034461522,0.00016596093,0.00006397896,0.0123874135,0.17362602,0.107930265,0.047665227,0.003157439,0.65421426],"study_design_scores_gemma":[0.00039299854,0.00015187965,0.00063750404,0.000052834734,0.0000051368033,0.00027218412,0.00006263384,0.94372565,0.050766855,0.0019621202,0.0018426639,0.00012756645],"about_ca_topic_score_codex":0.000005002486,"about_ca_topic_score_gemma":0.000021577136,"teacher_disagreement_score":0.7700996,"about_ca_system_score_codex":0.00010060449,"about_ca_system_score_gemma":0.00026049183,"threshold_uncertainty_score":0.4568552},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15185438,0.0009223814,0.8434537,0.0006906495,0.00035966947,0.00072301395,0.0000052428886,0.00003929462,0.001951641],"genre_scores_gemma":[0.83596396,0.00001460357,0.16148126,0.0006737418,0.0013132229,0.000023629584,0.00001998801,0.000037134025,0.0004724474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886084,0.000034406155,0.0003934668,0.0002081619,0.00017728734,0.00032585015],"domain_scores_gemma":[0.9993619,0.00012131961,0.00017715503,0.00016753213,0.00010374988,0.000068358444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013393546,0.00017352254,0.00013668032,0.0000694221,0.00044864384,0.00039200528,0.00022998113,0.00011126246,0.000004955389],"category_scores_gemma":[0.00011333211,0.000108449916,0.00019819589,0.0001126374,0.000021806849,0.00001513546,0.0001143191,0.0004236049,0.000004721649],"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.00024401056,0.00001939914,0.000087095366,0.00029105085,0.00037732828,0.000029767023,0.0006735002,0.038859457,0.19742808,0.019477155,0.00040916912,0.742104],"study_design_scores_gemma":[0.0016369777,0.0021488895,0.00023634982,0.001950398,0.00010934024,0.0028900325,0.0008536817,0.76151794,0.07320027,0.025584778,0.12890705,0.0009642522],"about_ca_topic_score_codex":0.00000559015,"about_ca_topic_score_gemma":0.000002758016,"teacher_disagreement_score":0.7411397,"about_ca_system_score_codex":0.000038169877,"about_ca_system_score_gemma":0.0001078073,"threshold_uncertainty_score":0.4422459},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008165923,0.000010710248,0.98996747,0.0010553509,0.00028685998,0.00020332876,0.0000013845342,0.00011976889,0.00018919347],"genre_scores_gemma":[0.9549967,0.0000015040852,0.04322376,0.0010114429,0.0007267782,0.0000018174651,0.000007673741,0.00001076305,0.000019582994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898916,0.000084061125,0.0002947742,0.00009062592,0.00026252127,0.0002788435],"domain_scores_gemma":[0.9984333,0.00091713056,0.00027684285,0.00003229244,0.00015031885,0.00019012908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517378,0.00008816117,0.0001327558,0.00004023297,0.0012233597,0.00017944115,0.00014449157,0.000056712917,0.000018701267],"category_scores_gemma":[0.0009919237,0.00007843355,0.000074421434,0.00018284103,0.00003921955,0.000117369775,0.0000040130467,0.00031547042,0.000014168404],"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.00010204446,0.000010480887,0.00037991055,0.00000703646,0.000008335662,0.000002963842,0.005596723,0.98721844,5.429627e-7,0.0005488922,0.00051388436,0.005610733],"study_design_scores_gemma":[0.0006341059,0.00027880282,0.0007124528,0.00008254414,0.000014558475,0.0000011769647,0.0004898083,0.99367684,0.0000017884597,0.0002567345,0.0037369172,0.0001142634],"about_ca_topic_score_codex":0.000006273054,"about_ca_topic_score_gemma":0.0000023172229,"teacher_disagreement_score":0.94683075,"about_ca_system_score_codex":0.000045667664,"about_ca_system_score_gemma":0.00018770019,"threshold_uncertainty_score":0.9409218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07810978,0.0050032395,0.67965436,0.17139733,0.0018865354,0.004145744,0.000094951436,0.0005554353,0.05915266],"genre_scores_gemma":[0.91044885,0.000119255135,0.006116854,0.079514585,0.0035244336,0.0000109636585,0.000021339334,0.00004127104,0.00020245553],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890316,0.000008030509,0.0003517999,0.000118758886,0.0002833375,0.00033490566],"domain_scores_gemma":[0.9986866,0.00018747705,0.00017286696,0.00012303625,0.0001389661,0.0006910144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032052258,0.00013923775,0.0002182845,0.00004724068,0.0003125661,0.00010910362,0.00015983338,0.000048225087,0.00008080856],"category_scores_gemma":[0.00033998492,0.00007771647,0.00021302237,0.00013586016,0.000027858081,0.00018001611,0.000060229904,0.0003594776,0.000028812503],"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.0011822842,0.00023723548,0.001713214,0.0014704661,0.0007565312,0.00009071162,0.006581899,0.1614915,0.00020253123,0.0044725933,0.47670725,0.3450938],"study_design_scores_gemma":[0.003998545,0.0007666231,0.00020405487,0.0005678665,0.0001489457,0.000104057,0.0002735585,0.8647021,0.0002078993,0.001127992,0.12772152,0.0001768481],"about_ca_topic_score_codex":0.0000019401261,"about_ca_topic_score_gemma":1.16414185e-7,"teacher_disagreement_score":0.83233905,"about_ca_system_score_codex":0.00007287847,"about_ca_system_score_gemma":0.00040684242,"threshold_uncertainty_score":0.31691855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3916474,0.00093457056,0.49803504,0.0069835447,0.0012015183,0.0012104166,0.000008958508,0.0011628589,0.0988157],"genre_scores_gemma":[0.99278307,0.000074465635,0.006254985,0.00075637293,0.000096758355,6.0978795e-7,8.483451e-7,0.000015555743,0.000017355149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993211,0.0000102279855,0.00025825467,0.00006325604,0.00014850641,0.00019865937],"domain_scores_gemma":[0.9995439,0.000116138675,0.00009135221,0.00005454511,0.0000504475,0.00014358365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018003263,0.00011510372,0.00011411318,0.000022484954,0.0002598534,0.00031105053,0.000103029604,0.000030820316,0.00001033255],"category_scores_gemma":[0.000033452514,0.00006715208,0.000018858389,0.000106693034,0.00006975389,0.00011089591,0.000015984062,0.00035815613,0.000016236852],"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.00002232782,0.0000042441807,0.0016781862,0.00007391139,0.00005045468,0.00001562123,0.0034492572,0.9374162,0.00005148631,0.0014274358,0.00046023153,0.055350676],"study_design_scores_gemma":[0.0009857158,0.0001797851,0.0005232801,0.00023613879,0.000006487863,0.00025102217,0.00024292024,0.97888213,0.00012365682,0.000045811557,0.018333398,0.00018962714],"about_ca_topic_score_codex":3.7630593e-7,"about_ca_topic_score_gemma":6.7707083e-7,"teacher_disagreement_score":0.6011357,"about_ca_system_score_codex":0.000015951258,"about_ca_system_score_gemma":0.000019699937,"threshold_uncertainty_score":0.29994673},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023154266,0.000018951954,0.9708586,0.00045961232,0.0000764075,0.0005144049,0.0000057182633,0.000026802361,0.004885241],"genre_scores_gemma":[0.77351606,0.00012704458,0.22546743,0.00049031613,0.0001370608,0.000010979898,0.000028389908,0.000018193688,0.00020451557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997361,0.00005785622,0.0012253933,0.00023914085,0.0009050174,0.00021160931],"domain_scores_gemma":[0.99838865,0.0001580271,0.00060280255,0.00022663808,0.0004797268,0.00014415725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223958,0.00015571891,0.00028999016,0.0003993804,0.00027832718,0.00047403594,0.00043640798,0.000045396217,0.00008170918],"category_scores_gemma":[0.00012441624,0.000103266575,0.0000657258,0.0014535579,0.000045048317,0.00067175133,0.00008214714,0.00027864124,0.000017778106],"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.000041316704,0.00005110561,0.0051041646,0.0000069099992,0.000016219214,0.000005835529,0.00095014164,0.98667336,0.0000034783998,0.0013967236,0.000085049185,0.0056656827],"study_design_scores_gemma":[0.0012138465,0.00014671883,0.000550322,0.000079398545,0.000010651441,0.000013029342,0.00075265375,0.9946061,0.000027686505,0.00006177088,0.0024089387,0.0001289021],"about_ca_topic_score_codex":0.000012906277,"about_ca_topic_score_gemma":0.00002025704,"teacher_disagreement_score":0.7503618,"about_ca_system_score_codex":0.000051571034,"about_ca_system_score_gemma":0.000090736736,"threshold_uncertainty_score":0.45711395},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022829356,0.00013532017,0.9650093,0.0021882032,0.00049279083,0.00018465467,4.998079e-7,0.00033205276,0.008827828],"genre_scores_gemma":[0.89709896,0.000055065488,0.10124072,0.00093906064,0.0005960298,0.0000016829981,7.8654625e-7,0.00003927538,0.00002841121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986035,0.000054660242,0.00057333044,0.00008111856,0.00036387698,0.00032348555],"domain_scores_gemma":[0.99916375,0.00031827576,0.00015640522,0.0001138225,0.000066061395,0.00018169955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009870635,0.00014604091,0.00016940263,0.000041852916,0.00045094304,0.00036102315,0.00027883254,0.000048202815,0.000020693144],"category_scores_gemma":[0.00019716924,0.00009943757,0.00007592883,0.0002410902,0.000020963476,0.00016342262,0.000047819234,0.0006276103,0.00006828595],"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.000008653327,0.0000047003377,0.0001142381,0.000020135347,0.000043824133,0.000004447133,0.00080714916,0.8912302,0.00018716986,0.00043615012,0.00058935373,0.10655394],"study_design_scores_gemma":[0.00046461393,0.000103343395,0.00021389611,0.00009791209,0.0000094961515,0.00004066889,0.00015487541,0.9897017,0.00071740884,0.00020575005,0.008129757,0.00016060383],"about_ca_topic_score_codex":3.2825298e-7,"about_ca_topic_score_gemma":1.2982953e-7,"teacher_disagreement_score":0.8742696,"about_ca_system_score_codex":0.00010329466,"about_ca_system_score_gemma":0.000032595977,"threshold_uncertainty_score":0.40549466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73488826,0.00067651656,0.26185805,0.000100553836,0.00070639746,0.00011274811,6.079328e-7,0.00041182313,0.001245059],"genre_scores_gemma":[0.99158317,0.00003370627,0.008075636,0.00011539912,0.00015708325,0.000002630968,7.614535e-7,0.00002530471,0.0000062958675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998806,0.000012883948,0.00042616396,0.000108914566,0.00019880672,0.0004472352],"domain_scores_gemma":[0.9994835,0.00022590217,0.000091327725,0.00011245434,0.000016259379,0.00007054756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043522267,0.00015393569,0.00020288143,0.00020805688,0.00031629702,0.000073450836,0.00021239687,0.00005491232,0.000011274792],"category_scores_gemma":[0.00009635361,0.0001410456,0.000035707617,0.00036589123,0.000030528066,0.00015913836,0.00025989872,0.0015949056,0.0000024965407],"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.0000084312605,0.0000052809905,0.00049249746,0.0000046722535,0.000007604497,0.00004596407,0.00014561712,0.89418864,0.000006327732,0.0007524858,0.00005501268,0.104287446],"study_design_scores_gemma":[0.00033778252,0.0001214883,0.001278799,0.000100211284,0.0000026836349,0.00031076258,0.00040464976,0.9953412,0.000003878558,0.0014001532,0.00051313674,0.00018527165],"about_ca_topic_score_codex":7.7930775e-7,"about_ca_topic_score_gemma":0.0000010181357,"teacher_disagreement_score":0.25669494,"about_ca_system_score_codex":0.00022087325,"about_ca_system_score_gemma":0.000009181214,"threshold_uncertainty_score":0.692916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15459651,0.00079372077,0.80070835,0.0024116682,0.02046491,0.0009905453,0.000017278831,0.00079199416,0.019225],"genre_scores_gemma":[0.985348,0.000015631973,0.013429424,0.00046458511,0.0006672536,0.0000029406779,0.000020164653,0.00003105479,0.000020949861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896395,0.000019409534,0.00039640462,0.0000920897,0.00024938732,0.00027875314],"domain_scores_gemma":[0.9991523,0.00036058022,0.00011647161,0.00010467456,0.00018516192,0.00008079458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750058,0.00014315537,0.0001428153,0.00008158478,0.00053213304,0.0003161826,0.00012667739,0.000057024234,0.000034130593],"category_scores_gemma":[0.00004119159,0.00010520862,0.000120711775,0.00019161195,0.000016767008,0.00016314755,0.000032400334,0.00039519402,0.0000120379],"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.000013784566,0.000014339101,0.00007475279,0.00002173699,0.00006661598,0.0000061405685,0.00026337412,0.97382843,0.00026431034,0.0068431776,0.00097253855,0.01763082],"study_design_scores_gemma":[0.0018939442,0.00007646441,0.000097141376,0.00024686402,0.00002234624,0.00030523073,0.00009909748,0.9827331,0.0023686169,0.0038618518,0.008069886,0.0002254969],"about_ca_topic_score_codex":0.0000011109245,"about_ca_topic_score_gemma":0.0000014135815,"teacher_disagreement_score":0.8307515,"about_ca_system_score_codex":0.00010020521,"about_ca_system_score_gemma":0.00006237593,"threshold_uncertainty_score":0.4290283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014998748,0.000060315357,0.98175263,0.00039141817,0.0005519417,0.00019063878,9.491235e-7,0.0000823397,0.001971033],"genre_scores_gemma":[0.030588798,0.00005386839,0.96769094,0.00062119536,0.00025179284,0.000005849373,0.00000539477,0.000045971472,0.0007362096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804515,0.00028144222,0.00060898,0.00018591623,0.0005563953,0.00032214168],"domain_scores_gemma":[0.99828357,0.00061288,0.00045556837,0.00020518628,0.00024227826,0.00020054427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634114,0.00018391221,0.00026881555,0.00046330495,0.0010896636,0.00019341784,0.00027913263,0.000056545516,0.00018690576],"category_scores_gemma":[0.00091489655,0.0001541027,0.000080012425,0.00055307214,0.000071506816,0.00048731043,0.0004280957,0.0010462643,0.0000037180064],"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.000089110246,0.00006742921,0.00009761368,0.000021452594,0.00004843933,0.0000913283,0.0022660028,0.92674166,0.000008555702,0.011897506,0.0013607634,0.057310123],"study_design_scores_gemma":[0.0010313363,0.00023394334,0.000023475774,0.000043122094,0.000010265586,0.0011527139,0.0017929625,0.9764733,0.00006590797,0.011824675,0.007133729,0.00021459842],"about_ca_topic_score_codex":0.0000014740721,"about_ca_topic_score_gemma":3.764018e-7,"teacher_disagreement_score":0.057095528,"about_ca_system_score_codex":0.00029189754,"about_ca_system_score_gemma":0.000106739026,"threshold_uncertainty_score":0.83809215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7544153,0.00007569512,0.23954749,0.000667248,0.0022886666,0.0012549615,0.0000029141793,0.00027208688,0.0014756586],"genre_scores_gemma":[0.99541515,6.5793483e-7,0.001962649,0.0015989823,0.0008108505,0.00003818856,0.000051067447,0.000037335052,0.00008509354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981074,0.000011449542,0.0005012801,0.00023108107,0.000627363,0.0005214241],"domain_scores_gemma":[0.99898523,0.000081935,0.00060674414,0.00014696475,0.0001470134,0.000032118784],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010901453,0.00024265969,0.00023162691,0.000491705,0.0017975818,0.00071684475,0.00028243318,0.000027941438,0.00007228693],"category_scores_gemma":[0.00006154198,0.0002006693,0.00012905092,0.00037555434,0.000043233278,0.00075561134,0.00028295876,0.0004761733,0.000023735405],"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.00062312617,0.0003112919,0.00093359314,0.00022714322,0.00015486004,0.00008374078,0.0004592114,0.8174731,0.000084466265,0.018479137,0.0006421116,0.1605282],"study_design_scores_gemma":[0.0029699593,0.00035483297,0.0012052284,0.00022867908,0.000076034026,0.00013386995,0.002970586,0.8466936,0.0000075600615,0.00039741857,0.14445524,0.00050704274],"about_ca_topic_score_codex":0.000027570744,"about_ca_topic_score_gemma":0.000004969879,"teacher_disagreement_score":0.24099989,"about_ca_system_score_codex":0.00038087968,"about_ca_system_score_gemma":0.000040010083,"threshold_uncertainty_score":0.99950194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32223663,0.00009103275,0.6750008,0.0016810533,0.00043706986,0.00044330378,0.00001956268,0.000051539726,0.000039046477],"genre_scores_gemma":[0.7327541,0.0000060144744,0.26495588,0.0016329237,0.00028317285,0.000021164422,0.00031962196,0.000022686278,0.000004447273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755,0.00025939394,0.0010545168,0.00029477238,0.00030620742,0.0005351072],"domain_scores_gemma":[0.9963169,0.002065065,0.00043354442,0.0001793326,0.00072730443,0.00027782912],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018069327,0.00022645202,0.00033586274,0.00020438811,0.0038228112,0.00024653025,0.00011200033,0.00024168362,0.000028311637],"category_scores_gemma":[0.0017339144,0.00018631545,0.0001056329,0.00033838412,0.00002561736,0.00029032654,0.00005834146,0.00093917735,0.000005885629],"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.00008951302,0.00007050234,0.0014275943,0.00010733665,0.000015767375,0.000009150535,0.00036229246,0.9613666,0.000063733496,0.00087498815,0.0000464123,0.035566136],"study_design_scores_gemma":[0.0020878396,0.00028410176,0.001886083,0.0012719919,0.00002052291,0.000020989444,0.0016220871,0.99217147,0.000059093596,0.0002885151,0.0000715175,0.00021581877],"about_ca_topic_score_codex":0.0000073853785,"about_ca_topic_score_gemma":0.000012619316,"teacher_disagreement_score":0.41051748,"about_ca_system_score_codex":0.0003035805,"about_ca_system_score_gemma":0.0010387335,"threshold_uncertainty_score":0.9974741},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38498005,0.000012978729,0.5785035,0.0005089855,0.0018538692,0.00008206605,0.0000013319058,0.0002621709,0.03379508],"genre_scores_gemma":[0.9732515,0.0000056765357,0.025086017,0.0012274525,0.00033760158,8.090647e-7,0.0000024918124,0.000027277727,0.000061167724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988965,0.000083079634,0.0003985159,0.000091510716,0.00028454064,0.00024587614],"domain_scores_gemma":[0.9988558,0.0005817467,0.00012530034,0.00020015967,0.00015152551,0.00008543577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095540774,0.00015142036,0.00014183338,0.00012853001,0.00032100728,0.00022740084,0.00016227302,0.000072692535,0.0000898633],"category_scores_gemma":[0.00062160403,0.00010848155,0.00010875813,0.0003373087,0.000017313328,0.00014456641,0.000036043068,0.000884056,0.000047750204],"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.000008972481,0.000014596168,0.0007631425,0.000011376798,0.000018823326,0.00001576982,0.00027739047,0.95311254,0.00015984784,0.0001771627,0.00038335708,0.04505703],"study_design_scores_gemma":[0.00037105143,0.000053445678,0.0025536434,0.00017084971,0.000005661688,0.00009727187,0.00014454834,0.990045,0.0034144328,0.000044007324,0.002962981,0.00013711864],"about_ca_topic_score_codex":0.0000016853013,"about_ca_topic_score_gemma":0.0000016511831,"teacher_disagreement_score":0.58827144,"about_ca_system_score_codex":0.00019477133,"about_ca_system_score_gemma":0.00005499129,"threshold_uncertainty_score":0.44237494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43382686,0.00009705348,0.56432325,0.00013834785,0.00053485826,0.00006983518,7.835462e-7,0.0001567249,0.0008522773],"genre_scores_gemma":[0.95323837,0.000012097377,0.045643102,0.0005868817,0.00044860956,4.3222198e-7,0.00001784323,0.000047152716,0.0000054995267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985951,0.000039883165,0.00046131155,0.00013897014,0.000368748,0.0003959535],"domain_scores_gemma":[0.99896413,0.0002125842,0.00021130107,0.0001973823,0.0003172699,0.00009730318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046833488,0.00022876136,0.00022974642,0.0001317362,0.00052565493,0.00031993547,0.00016603891,0.00008621111,0.000013726065],"category_scores_gemma":[0.00010156412,0.00015892668,0.00007498971,0.00048483766,0.000018901383,0.0003316524,0.0000372409,0.0006393013,0.000009289853],"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.000017450344,0.000012569807,0.0009999612,0.000027904865,0.000049638875,0.00006605639,0.0001639145,0.99265873,0.003192212,0.000060691946,0.00006313497,0.002687742],"study_design_scores_gemma":[0.00052138825,0.00009724762,0.0010175499,0.00046599223,0.000031739874,0.00063662085,0.00024351236,0.9904511,0.0061224084,0.000031437925,0.00014772452,0.0002333029],"about_ca_topic_score_codex":0.0000035358403,"about_ca_topic_score_gemma":0.000008359639,"teacher_disagreement_score":0.5194115,"about_ca_system_score_codex":0.00030914237,"about_ca_system_score_gemma":0.00018464627,"threshold_uncertainty_score":0.64808416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12895718,0.00002168744,0.8699491,0.000017603474,0.00014001691,0.00038568984,0.0000069009857,0.000033256307,0.0004885522],"genre_scores_gemma":[0.88316953,0.0000013571228,0.11635887,0.000052052,0.00028084012,0.000063278494,0.000031771993,0.000019143386,0.000023155719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.000041886746,0.00036313754,0.00012207858,0.00013226837,0.0001996688],"domain_scores_gemma":[0.99932563,0.00014816732,0.0003809315,0.00007145587,0.000037485024,0.000036355766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838485,0.0001276191,0.00017580861,0.00022240747,0.00041351357,0.00007064378,0.00007364563,0.00001593934,0.000035909787],"category_scores_gemma":[0.000008039042,0.00011040736,0.000092768445,0.00015725105,0.0000074006693,0.00027405276,0.000017274635,0.00023905288,9.171373e-8],"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.00012490177,0.000105541716,0.01625607,0.0000033333313,0.000051419895,0.0000024234428,0.0015941433,0.954834,0.00004452938,0.0001657223,0.000017037155,0.026800867],"study_design_scores_gemma":[0.0015424009,0.00050155126,0.00076577644,0.000029816058,0.000006842683,0.00003889037,0.0007619624,0.99496984,0.00041553436,0.00012446237,0.00067332265,0.00016960883],"about_ca_topic_score_codex":0.000010140363,"about_ca_topic_score_gemma":5.63865e-8,"teacher_disagreement_score":0.7542124,"about_ca_system_score_codex":0.0005815198,"about_ca_system_score_gemma":0.00006432576,"threshold_uncertainty_score":0.45022812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119204424,0.00013802615,0.86646485,0.0024069352,0.0012780956,0.0007570627,0.000014920415,0.000077587116,0.009658095],"genre_scores_gemma":[0.98975784,0.000006016389,0.009658186,0.00021212666,0.00024034888,0.0000046306245,0.000010711487,0.000004211721,0.00010590447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924046,0.000025319445,0.00027491618,0.000039555016,0.00026084456,0.00015889696],"domain_scores_gemma":[0.99904484,0.00046358706,0.00031761857,0.000040789215,0.00010389002,0.000029301213],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013805958,0.00003793454,0.000064498636,0.000037733746,0.0029228772,0.000051031642,0.00015050147,0.000014754008,0.000018061002],"category_scores_gemma":[0.00006252177,0.000027313643,0.000057467743,0.00027301014,0.000024685414,0.000122028214,0.000011189357,0.00016972875,4.072097e-7],"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.000014607236,0.000007274364,0.0038376055,0.0000028805757,0.000011346182,2.7991624e-7,0.012733701,0.9438925,5.485513e-7,0.025762308,0.00056744314,0.013169537],"study_design_scores_gemma":[0.0019237483,0.0006478007,0.042358015,0.00022071706,0.00009307771,0.000037928563,0.024087874,0.5424582,0.00001505456,0.017294243,0.3704618,0.00040155993],"about_ca_topic_score_codex":0.00006051852,"about_ca_topic_score_gemma":0.000036882844,"teacher_disagreement_score":0.87055343,"about_ca_system_score_codex":0.000054772518,"about_ca_system_score_gemma":0.0001374203,"threshold_uncertainty_score":0.9983752},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04392874,0.00006065496,0.95370185,0.000084355735,0.00058358035,0.00019031913,0.000012183378,0.000020302683,0.0014179805],"genre_scores_gemma":[0.78290206,0.00004747598,0.21592638,0.0002188272,0.00019173736,0.0000025306067,0.000018225335,0.00002155895,0.00067123567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970086,0.000060548016,0.0014442583,0.00022648589,0.000947674,0.00031242307],"domain_scores_gemma":[0.9960159,0.0006758528,0.0010137067,0.00025192814,0.0019120934,0.00013053737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030660918,0.00014741455,0.0003415069,0.0003433633,0.0003478873,0.00052333204,0.00032581785,0.00006223944,0.00006944071],"category_scores_gemma":[0.0018194333,0.000109534616,0.00014327173,0.0008301756,0.000022220374,0.0006643008,0.000083173065,0.00024738058,0.000007076324],"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.000041327734,0.000032116357,0.0001418274,0.000007056882,0.000018479259,0.0000028457828,0.0004949528,0.9770797,0.000037116308,0.0017545973,0.00009105386,0.020298915],"study_design_scores_gemma":[0.00097375625,0.00011720988,0.0000063281,0.0001217744,0.00001020288,0.000054201075,0.00033462103,0.9891188,0.00010438228,0.008341911,0.0006855923,0.00013122616],"about_ca_topic_score_codex":0.000007994762,"about_ca_topic_score_gemma":0.0000028460183,"teacher_disagreement_score":0.7389733,"about_ca_system_score_codex":0.00006211341,"about_ca_system_score_gemma":0.00040407464,"threshold_uncertainty_score":0.5046503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659915,0.000024871562,0.01011275,0.0013671764,0.002154126,0.0005644618,0.000014478981,0.0000658519,0.019704789],"genre_scores_gemma":[0.9964347,0.0000022104482,0.00043983496,0.0022819648,0.0006089468,0.000014770738,0.000057400626,0.000035307057,0.00012488008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765277,0.00002786104,0.0007952525,0.00025007446,0.0009747053,0.00029932847],"domain_scores_gemma":[0.9979118,0.00034561043,0.0011127576,0.0003428821,0.00025536126,0.000031587326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013047482,0.00032787008,0.0003387682,0.00061803334,0.00071480643,0.0006829191,0.0006971397,0.00011541598,0.00061035255],"category_scores_gemma":[0.00020544743,0.00022897501,0.00025690827,0.00039067157,0.000030266028,0.00055954285,0.001006856,0.0017808658,0.000041423486],"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.00006786409,0.000044499415,0.002170499,0.000074082585,0.00003908932,0.000008496657,0.00048018247,0.95089465,0.000010763725,0.008219912,0.0020277228,0.035962258],"study_design_scores_gemma":[0.00083139254,0.000070286114,0.042097803,0.0017659134,0.00039113354,0.00003548888,0.0009936212,0.9304294,0.000018666453,0.011158667,0.011034097,0.00117352],"about_ca_topic_score_codex":0.00041671016,"about_ca_topic_score_gemma":0.00001830251,"teacher_disagreement_score":0.039927304,"about_ca_system_score_codex":0.00013812365,"about_ca_system_score_gemma":0.00010000864,"threshold_uncertainty_score":0.933733},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05058351,0.000020377927,0.9211184,0.0032120934,0.0017775813,0.0022047393,0.000003895843,0.0007390337,0.02034037],"genre_scores_gemma":[0.9146974,0.00001386334,0.07190936,0.005882474,0.0066186166,0.0000638172,0.0002394112,0.00012063273,0.00045441175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983597,0.000013910048,0.0004714136,0.00026280383,0.00042960595,0.00046257398],"domain_scores_gemma":[0.9988839,0.00006714173,0.0005237622,0.00020602392,0.00027991433,0.000039269045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019805671,0.00022871784,0.00022186071,0.0005639251,0.00051831425,0.00090839854,0.0002859451,0.000037445127,0.00006813652],"category_scores_gemma":[0.000095979085,0.00016400416,0.00008718637,0.0006396917,0.000023481078,0.0014642958,0.000074299795,0.00020090958,0.000052298252],"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.00007340586,0.00008171443,0.0014217169,0.000122535,0.00008060695,0.000015023359,0.00012835144,0.87781125,0.000028051616,0.003455983,0.0047115176,0.112069845],"study_design_scores_gemma":[0.0013289179,0.00021749525,0.0011418279,0.00021997554,0.00004169622,0.00002117937,0.00048915716,0.94672835,0.000038951064,0.00038866233,0.049083,0.00030079507],"about_ca_topic_score_codex":0.000023260325,"about_ca_topic_score_gemma":0.000004490415,"teacher_disagreement_score":0.8641139,"about_ca_system_score_codex":0.00012719959,"about_ca_system_score_gemma":0.00003659421,"threshold_uncertainty_score":0.8759708},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018584521,0.00021934405,0.97872186,0.00013237195,0.00025788954,0.00032951465,0.000015624033,0.000077285564,0.0016616058],"genre_scores_gemma":[0.850384,0.000065133456,0.14663842,0.0008966005,0.0015393733,0.00007715204,0.0001430975,0.00006290828,0.0001933188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930644,0.000023703593,0.0002386589,0.000103661565,0.00014093993,0.00018657526],"domain_scores_gemma":[0.9993741,0.00016741,0.00029700002,0.00008235434,0.00003642748,0.00004272244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018523737,0.00013111408,0.00014843265,0.00010370132,0.000781525,0.000083604966,0.0001080417,0.000016704915,0.00016029412],"category_scores_gemma":[0.0000050237404,0.00010143928,0.000115556286,0.000103804974,0.0000066894913,0.00017735595,0.000013913615,0.00018423688,2.5970732e-7],"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.000057882335,0.000040874897,0.001793778,6.269543e-7,0.00005265964,7.289653e-7,0.00045744708,0.7356284,0.000034899174,0.0002356239,0.00021928763,0.26147774],"study_design_scores_gemma":[0.0018992617,0.0012172759,0.00015800256,0.000022871083,0.0000071138256,0.000017643277,0.00022188226,0.8168023,0.0007301102,0.00024292951,0.17845175,0.00022882216],"about_ca_topic_score_codex":0.0000037613297,"about_ca_topic_score_gemma":1.37897755e-8,"teacher_disagreement_score":0.8320834,"about_ca_system_score_codex":0.0002490881,"about_ca_system_score_gemma":0.00004560422,"threshold_uncertainty_score":0.6010937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024791306,0.0005002279,0.97367096,0.000567812,0.00017287329,0.00013465463,0.0000030406593,0.00007789073,0.000081221246],"genre_scores_gemma":[0.53413004,0.00004193461,0.46549666,0.00022227247,0.00006147112,0.0000027294195,0.00002959541,0.0000109628845,0.00000431498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000007438565,0.0002891673,0.00008453996,0.00010238652,0.00015001897],"domain_scores_gemma":[0.99924856,0.0002658465,0.000085972744,0.00006340751,0.00027321765,0.00006296171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904861,0.00011344045,0.0001043316,0.000084607884,0.00043597526,0.00025016748,0.00005154285,0.00005426881,0.000003240989],"category_scores_gemma":[0.00009660555,0.00008069417,0.000030842428,0.00022042364,0.00001845886,0.00016480479,0.000013197619,0.00025485817,6.078778e-7],"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.000010781867,0.000010213594,0.000119154145,0.000024381616,0.000031392483,6.553248e-7,0.00023499096,0.9658415,0.0001360578,0.0010251658,0.0000055364844,0.03256017],"study_design_scores_gemma":[0.00093908963,0.0000386922,0.00068369356,0.0001325842,0.000019216865,0.000098183766,0.00026616358,0.99703735,0.00023532832,0.00032578074,0.00011514038,0.00010878298],"about_ca_topic_score_codex":0.0000028464187,"about_ca_topic_score_gemma":0.000005712689,"teacher_disagreement_score":0.50933874,"about_ca_system_score_codex":0.00004941808,"about_ca_system_score_gemma":0.000049276627,"threshold_uncertainty_score":0.33532134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31825945,0.0001882226,0.6800103,0.0003209906,0.00016422936,0.00025369952,0.0000025273223,0.0001904994,0.0006100968],"genre_scores_gemma":[0.84756666,0.0000044758776,0.15184452,0.0003008062,0.00019423234,0.000002669922,0.000003512945,0.000043034288,0.00004007075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998658,0.00006568107,0.00043266732,0.00017572688,0.00026968113,0.0003982205],"domain_scores_gemma":[0.9978744,0.0014668837,0.00019798249,0.00010063053,0.00022259366,0.0001375306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014744798,0.00021087365,0.00024912652,0.00008631832,0.0007371149,0.00034513275,0.00010337115,0.000064434746,0.000020382364],"category_scores_gemma":[0.00025678883,0.0001504556,0.00005769519,0.00023589445,0.000087517554,0.00019460433,0.000054277552,0.0006895005,0.0000038658413],"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.00001924899,0.000006471595,0.0012687617,0.000030100515,0.000068314686,0.000012311388,0.00033622,0.90196866,0.00076945015,0.00005136126,0.000013302493,0.095455796],"study_design_scores_gemma":[0.001880443,0.00011509743,0.00089378475,0.00035281753,0.000028090288,0.00064203545,0.00011066434,0.9936768,0.0018315153,0.00004197777,0.00020844777,0.00021834217],"about_ca_topic_score_codex":0.0000012969184,"about_ca_topic_score_gemma":3.946128e-7,"teacher_disagreement_score":0.52930725,"about_ca_system_score_codex":0.00007194916,"about_ca_system_score_gemma":0.00010286398,"threshold_uncertainty_score":0.6135401},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12505499,0.00006226478,0.8731662,0.00013887578,0.0009916142,0.00035863405,0.0000044595754,0.00009621667,0.00012673401],"genre_scores_gemma":[0.43682098,0.0000015244896,0.56290084,0.000088722394,0.00009717385,0.000013278612,0.0000013206794,0.000018896462,0.000057260288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698293,0.00029996524,0.0009795771,0.00033740397,0.0007657872,0.0006343254],"domain_scores_gemma":[0.99501675,0.0032644991,0.0007592206,0.00045471665,0.00031030588,0.00019453009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004727277,0.0002206869,0.00035891833,0.00059287937,0.0017205885,0.00021139039,0.0013870705,0.000052988205,0.000008047709],"category_scores_gemma":[0.0013391932,0.00020796429,0.00021584699,0.00065458985,0.00004545843,0.00032060058,0.0015417456,0.0012594062,0.0000033484253],"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.00003093441,0.000045479086,0.00011117658,0.00003685425,0.000028641969,0.000007783833,0.0016283782,0.71011525,0.0009024041,0.0020929559,0.00001726054,0.2849829],"study_design_scores_gemma":[0.0011175245,0.00031052076,0.0023308655,0.00012395387,0.000004109587,0.00032832872,0.00036953037,0.9909808,0.00072842586,0.00052000105,0.002951341,0.00023462127],"about_ca_topic_score_codex":0.0000042992656,"about_ca_topic_score_gemma":2.3084692e-7,"teacher_disagreement_score":0.311766,"about_ca_system_score_codex":0.00048545923,"about_ca_system_score_gemma":0.00017929416,"threshold_uncertainty_score":0.999579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82147956,0.0005876992,0.1745941,0.00041395935,0.0005008353,0.00048805607,0.0000039979254,0.00025459763,0.0016772179],"genre_scores_gemma":[0.99520063,0.000016306161,0.0024451895,0.0008328735,0.0012108404,0.000023569733,0.0000063166376,0.000049600807,0.0002146898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833965,0.000017999433,0.0004966108,0.00024665412,0.00047665008,0.0004224052],"domain_scores_gemma":[0.9983818,0.00027590603,0.0008150335,0.00014409093,0.00035262696,0.00003055531],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012562267,0.000248838,0.00037565414,0.0004702184,0.002056412,0.0009961656,0.0002829183,0.000030872,0.0000100002235],"category_scores_gemma":[0.00023901857,0.00019754168,0.00007750635,0.0005153793,0.000035444034,0.0015978054,0.00022264688,0.00042188505,0.0000029168018],"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.00043053395,0.00005025714,0.003167416,0.00076660025,0.0001937129,0.000054087293,0.00071122765,0.93396986,0.000018635235,0.036090408,0.000071985014,0.024475278],"study_design_scores_gemma":[0.0011879599,0.0002691001,0.00005589112,0.0005879377,0.0001093165,0.00023393291,0.006766239,0.9586131,0.000018609764,0.011458915,0.020176196,0.00052281824],"about_ca_topic_score_codex":0.000076074786,"about_ca_topic_score_gemma":0.000003761601,"teacher_disagreement_score":0.17372109,"about_ca_system_score_codex":0.00012659428,"about_ca_system_score_gemma":0.00007686609,"threshold_uncertainty_score":0.9992428},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20083359,0.00011070223,0.7951526,0.00045292423,0.0012930041,0.0006398772,0.0000065479176,0.00036111407,0.0011496622],"genre_scores_gemma":[0.9954966,0.000005078301,0.0040677036,0.00020589776,0.00009981148,0.00001814655,0.000074784046,0.00002007618,0.0000119112865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921364,0.00001852794,0.00031890388,0.00010264958,0.00017074661,0.00017550927],"domain_scores_gemma":[0.999592,0.000047984304,0.00015323448,0.00004764928,0.00010742081,0.000051686216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043546088,0.00011969973,0.0001126462,0.00020291292,0.00060011866,0.00015737185,0.00006834779,0.00003385019,0.000017349557],"category_scores_gemma":[0.000034712622,0.00010885091,0.00003232152,0.00019347522,0.00001243695,0.00019393086,0.000008503144,0.00034999428,7.7338734e-7],"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.00003536878,0.000013491177,0.00021388225,0.000080248006,0.000016522297,0.0000010134935,0.0008697738,0.9853502,0.0002960381,0.00016344416,0.00027497817,0.012685034],"study_design_scores_gemma":[0.0006290772,0.00026803452,0.00011576107,0.00014350665,0.000008356847,0.0001074324,0.0005548199,0.9941609,0.001127485,0.00045127812,0.0022674254,0.00016592795],"about_ca_topic_score_codex":6.504682e-7,"about_ca_topic_score_gemma":3.0591136e-7,"teacher_disagreement_score":0.794663,"about_ca_system_score_codex":0.00012179034,"about_ca_system_score_gemma":0.000038114016,"threshold_uncertainty_score":0.46156883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03279558,0.00005103528,0.9634919,0.0010312379,0.0015351789,0.00058182015,0.000017451262,0.00018198066,0.00031377372],"genre_scores_gemma":[0.170408,0.0000039044526,0.8278151,0.0008549973,0.0006935634,0.000054031218,0.00002044099,0.000026047303,0.00012389492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973186,0.00013568014,0.00091288483,0.00037473987,0.0006344672,0.000623578],"domain_scores_gemma":[0.9960061,0.0021817752,0.0010026841,0.00036403385,0.00028977785,0.00015563077],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029741009,0.00024106444,0.00032660554,0.0005067915,0.0026800078,0.00056075037,0.0010038138,0.000060303024,0.000009524426],"category_scores_gemma":[0.0007703753,0.0002223513,0.00035556653,0.0007870843,0.00002724659,0.00062887464,0.00057723484,0.00075846515,0.0000019451586],"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.00017015437,0.0001232972,0.000051485782,0.00003921281,0.00008690379,0.000018307219,0.0024995934,0.0628065,0.000111246634,0.15151908,0.0013048598,0.7812694],"study_design_scores_gemma":[0.0017919573,0.001150819,0.00020030915,0.000059203074,0.000015462358,0.00044702858,0.0004062383,0.9193457,0.00014359015,0.034700774,0.041437842,0.0003011142],"about_ca_topic_score_codex":0.0000075703556,"about_ca_topic_score_gemma":0.0000013186431,"teacher_disagreement_score":0.8565392,"about_ca_system_score_codex":0.00026703038,"about_ca_system_score_gemma":0.00022736788,"threshold_uncertainty_score":0.99861836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032190192,0.000093400806,0.99443054,0.00025505302,0.0013982827,0.00016441812,0.000008243902,0.00003634026,0.0003947078],"genre_scores_gemma":[0.60442847,0.00032209934,0.3946271,0.0004796306,0.00008065006,0.00000648078,0.000024639623,0.000011490634,0.000019414372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986324,0.000070234884,0.0005438169,0.00014362611,0.00042941718,0.00018050813],"domain_scores_gemma":[0.9983364,0.00054836035,0.0005326038,0.00016598885,0.00033932665,0.000077363584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013255728,0.00009802973,0.00016191976,0.00018832335,0.0005859896,0.00015221156,0.0004322365,0.000020822179,0.000098573],"category_scores_gemma":[0.00035693287,0.00008275684,0.00007448408,0.0005719235,0.000019454392,0.00055113627,0.0001858329,0.00020774356,0.0000010200939],"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.000030613126,0.000011724184,0.0011239069,0.0000019853928,0.0000051238176,7.7074475e-7,0.00010466447,0.581261,5.5613555e-7,0.00072565913,0.000068543195,0.41666546],"study_design_scores_gemma":[0.0006929352,0.00034405894,0.0057526156,0.00002499208,0.0000023553255,0.00008705431,0.000056765442,0.98364645,0.00002611365,0.00049600995,0.008746431,0.0001241986],"about_ca_topic_score_codex":0.000002957999,"about_ca_topic_score_gemma":0.0000058961677,"teacher_disagreement_score":0.60120946,"about_ca_system_score_codex":0.000102201375,"about_ca_system_score_gemma":0.00012904414,"threshold_uncertainty_score":0.45070177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8152942,0.000016379989,0.18230683,0.000347222,0.00025173085,0.00021317523,0.000003584435,0.00008896423,0.0014779143],"genre_scores_gemma":[0.9625055,0.0000022516365,0.03671802,0.0004680348,0.00010573193,0.0000066202892,0.0000028863547,0.000018190613,0.00017275932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982152,0.000088122346,0.0007339593,0.00014472069,0.00057864183,0.00023938512],"domain_scores_gemma":[0.99854016,0.0004215797,0.0005885108,0.00014916815,0.00017112086,0.00012946634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235086,0.00017949831,0.00028813677,0.00018013245,0.0010996422,0.00024044582,0.00014400911,0.000050327915,0.00016388277],"category_scores_gemma":[0.00056911045,0.00014744242,0.0001002194,0.00016833164,0.000036152956,0.0004018878,0.00011657702,0.0006872118,0.000014406907],"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.0003471368,0.0011110806,0.0020066048,0.0007889453,0.00043210606,0.00015886378,0.03817416,0.09627833,0.00034156654,0.57730824,0.012267219,0.27078572],"study_design_scores_gemma":[0.00056576374,0.00027930137,0.00034437998,0.00012266394,0.000026948532,0.00075978483,0.001166078,0.9277773,0.00014475214,0.068184145,0.00042665942,0.00020220695],"about_ca_topic_score_codex":0.0000153739,"about_ca_topic_score_gemma":0.00000501309,"teacher_disagreement_score":0.831499,"about_ca_system_score_codex":0.0002161559,"about_ca_system_score_gemma":0.00004454336,"threshold_uncertainty_score":0.8457671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16407602,0.000023936678,0.8340456,0.000008440799,0.00092207344,0.0001213379,1.785438e-7,0.000072025476,0.0007304114],"genre_scores_gemma":[0.45661137,0.000002377364,0.5432018,0.00010484193,0.000055633536,0.0000016793086,6.1161643e-7,0.000010045169,0.000011653671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743676,0.00010832895,0.0009296255,0.00021941678,0.0008794617,0.00042642409],"domain_scores_gemma":[0.9978949,0.00021410671,0.0012588921,0.00035035703,0.0001858548,0.000095885065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038952052,0.0001713557,0.00025172543,0.00036060356,0.0011650122,0.00028403348,0.0010784989,0.000041177154,0.000023130617],"category_scores_gemma":[0.00047758047,0.0001556899,0.00009974792,0.00082823134,0.000026355063,0.0009765647,0.0011519849,0.0009155177,0.0000028203094],"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.000023616634,0.000020150654,0.00019509316,0.000019412933,0.000010980817,0.000004843703,0.00070162537,0.75884163,0.0016641191,0.015662244,0.000004472018,0.2228518],"study_design_scores_gemma":[0.00041753214,0.00043809845,0.00008894871,0.00009212215,0.000005024219,0.00033190002,0.00019889841,0.99359053,0.002088774,0.0010661758,0.001498712,0.00018327897],"about_ca_topic_score_codex":0.000026513013,"about_ca_topic_score_gemma":6.3628725e-8,"teacher_disagreement_score":0.29253536,"about_ca_system_score_codex":0.00036390874,"about_ca_system_score_gemma":0.00016287323,"threshold_uncertainty_score":0.89604497},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4334191,0.00013321145,0.0020461387,0.011603066,0.014937121,0.00014403473,5.38659e-7,0.00012215284,0.5375946],"genre_scores_gemma":[0.95667106,0.000015064312,0.00023366426,0.0017647701,0.040694278,8.344427e-8,4.3749444e-7,0.0000025546146,0.00061808754],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914604,0.000033099288,0.0001858385,0.000057533885,0.00034657778,0.00023091945],"domain_scores_gemma":[0.9994703,0.00020293261,0.000120495126,0.00007728152,0.000057174606,0.00007180221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009947709,0.000059672573,0.00007111561,0.0000366198,0.0012487214,0.0005074727,0.0004042535,0.00003278455,0.00009109821],"category_scores_gemma":[0.00021932021,0.000035902987,0.00006498356,0.00013796522,0.00003250519,0.0002475059,0.00003604477,0.00029845544,0.00014929382],"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.000011343421,0.000026131693,0.0033545892,6.7438765e-7,0.000023897075,0.000012879871,0.031815436,0.00029723483,0.0000072455614,0.021155842,0.15576163,0.7875331],"study_design_scores_gemma":[0.00022187424,0.00005170514,0.019426558,0.00007921973,0.0000065114564,0.000001137132,0.0049517723,0.00080743217,0.000005845123,0.009093696,0.96525663,0.000097631266],"about_ca_topic_score_codex":0.00005570394,"about_ca_topic_score_gemma":0.00003313378,"teacher_disagreement_score":0.809495,"about_ca_system_score_codex":0.000060908136,"about_ca_system_score_gemma":0.00004007234,"threshold_uncertainty_score":0.9604281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055933944,0.00037426339,0.98904413,0.000348952,0.0011348984,0.00038623097,0.000011226648,0.00018831513,0.0029185896],"genre_scores_gemma":[0.9454662,0.00009130318,0.052719586,0.0009786714,0.00041839058,0.000023279861,0.000007301979,0.000049971026,0.00024526674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.000012057773,0.0002788517,0.000066942,0.00018171818,0.00023006253],"domain_scores_gemma":[0.9994079,0.0003162511,0.00009289326,0.000081741484,0.000040868923,0.000060331327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560972,0.00010591989,0.000107261636,0.000079161204,0.0007818107,0.0001609574,0.00017281415,0.00002256734,0.00004250157],"category_scores_gemma":[0.000024898307,0.000075317446,0.00006376677,0.00016031596,0.000012643946,0.0000947074,0.00006528643,0.0004453474,0.00000475824],"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.0000040396444,0.000005445495,0.00008397119,0.000012379526,0.000028799135,8.9030686e-7,0.0006506743,0.73419994,0.000008074021,0.00014608384,0.0009907403,0.263869],"study_design_scores_gemma":[0.00060238806,0.00007563988,0.00012385927,0.000021346968,0.000005639659,0.00016514983,0.00011274909,0.87980205,0.00002659845,0.00016411461,0.11879502,0.00010541697],"about_ca_topic_score_codex":0.0000018632899,"about_ca_topic_score_gemma":4.754221e-7,"teacher_disagreement_score":0.93987286,"about_ca_system_score_codex":0.000064400054,"about_ca_system_score_gemma":0.000019088995,"threshold_uncertainty_score":0.60131353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687133,0.016439984,0.0026766164,0.0009857806,0.00047269274,0.00010864608,0.000010607948,0.0003402503,0.010252137],"genre_scores_gemma":[0.99557734,0.0033504383,0.00029687423,0.00041613288,0.00031543692,0.000002324489,0.0000027473684,0.000018152978,0.000020556938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927896,0.00002948876,0.00024629623,0.000071141694,0.00018805117,0.00018605588],"domain_scores_gemma":[0.99944806,0.00031270453,0.000080207385,0.00008364615,0.000014224589,0.00006113313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049157115,0.00012518617,0.00014489933,0.0000720345,0.00055867294,0.00015780573,0.00015238517,0.000029717055,0.00001891879],"category_scores_gemma":[0.000015138636,0.000088295346,0.000032016866,0.000029834131,0.000032165757,0.00015682785,0.00010196119,0.00053666835,9.506143e-7],"study_design_candidate":"design_other","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.000006835518,0.0000040049167,0.0002016366,0.000014937825,0.00004471024,0.000032169813,0.004799167,0.0013883761,0.00009248101,0.0011545548,0.00052613346,0.991735],"study_design_scores_gemma":[0.0034402618,0.0017526541,0.049473967,0.0013708487,0.00015916816,0.009086054,0.047645014,0.30471897,0.0026112194,0.04178596,0.535366,0.0025898998],"about_ca_topic_score_codex":0.000007406098,"about_ca_topic_score_gemma":0.0000020776754,"teacher_disagreement_score":0.9891451,"about_ca_system_score_codex":0.00003257363,"about_ca_system_score_gemma":0.000011818775,"threshold_uncertainty_score":0.4296917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.727814,0.00022318537,0.26975483,0.00006396279,0.00077828177,0.00021738818,0.0000067758583,0.00006145498,0.0010801129],"genre_scores_gemma":[0.9993145,0.00010340286,0.00039285247,0.00001554991,0.00015138261,0.0000053588265,0.00000530602,0.000008442573,0.0000032338396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983343,0.00019274715,0.00078388775,0.000070296206,0.00036274752,0.00025602928],"domain_scores_gemma":[0.998922,0.00054126617,0.00032741847,0.000108172186,0.00006573771,0.000035423105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034453527,0.000114102215,0.0003187033,0.00010899351,0.0006682068,0.00011690608,0.00023333958,0.000031685413,0.000024724572],"category_scores_gemma":[0.0001454738,0.000074569856,0.00023004034,0.00040582748,0.0000748017,0.00020299,0.0000675086,0.00094001106,0.0000012787557],"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.00059430336,0.000007902258,0.0011783313,0.000010084706,0.000101251084,0.0000021104697,0.00037451606,0.9864856,0.00000431608,0.0035218643,0.00009759253,0.0076221204],"study_design_scores_gemma":[0.0052407305,0.000054724416,0.0024539675,0.00005563136,0.000027379327,0.000040201292,0.0011941151,0.9816815,0.00001173749,0.008598548,0.0005476056,0.00009380546],"about_ca_topic_score_codex":0.000027849588,"about_ca_topic_score_gemma":0.000016601338,"teacher_disagreement_score":0.27150044,"about_ca_system_score_codex":0.00024054133,"about_ca_system_score_gemma":0.00006342915,"threshold_uncertainty_score":0.51393735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679139,0.000035305202,0.009277479,0.0056168833,0.0023452514,0.00039948628,0.000037918577,0.00030852293,0.014065242],"genre_scores_gemma":[0.99662656,0.00034392008,0.0010768004,0.00048930343,0.0011269627,0.0000020887503,0.000121197816,0.000010500949,0.00020268004],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977821,0.00005388237,0.00083265844,0.00012710436,0.0007866156,0.00041761153],"domain_scores_gemma":[0.9983262,0.00012063839,0.0007991013,0.00024553013,0.00035477328,0.00015377955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028240595,0.00014484274,0.00020805279,0.00043835363,0.0010675121,0.0003751369,0.000657767,0.00014585238,0.00004659528],"category_scores_gemma":[0.0011316814,0.00012727741,0.00011426517,0.00084425014,0.000076960816,0.0028520836,0.00031255715,0.00056718197,0.00026298373],"study_design_candidate":"design_other","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.000365755,0.0003883168,0.05733619,0.0004504005,0.00022390642,0.000021130369,0.15771104,0.03431689,0.0005090204,0.013759793,0.054346707,0.68057084],"study_design_scores_gemma":[0.0033066694,0.0007092116,0.12206346,0.0014183358,0.0000725425,0.00009964332,0.039774843,0.22527193,0.001233796,0.02040296,0.58445495,0.0011916382],"about_ca_topic_score_codex":0.00032642845,"about_ca_topic_score_gemma":0.0004502797,"teacher_disagreement_score":0.6793792,"about_ca_system_score_codex":0.00023546875,"about_ca_system_score_gemma":0.00023333094,"threshold_uncertainty_score":0.82105476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41998717,0.00052657473,0.5775335,0.0004646993,0.0004429664,0.00012286403,0.000004329245,0.00007841794,0.00083947286],"genre_scores_gemma":[0.88302255,0.000013476345,0.1161428,0.00045716405,0.0002621913,0.000001749291,9.732295e-7,0.00002111982,0.000077954006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646723,0.000042203148,0.0011084158,0.00036359008,0.0014400639,0.0005784887],"domain_scores_gemma":[0.99719703,0.0011824281,0.0004107397,0.0002684426,0.0005908237,0.0003505069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058515845,0.0002163156,0.0004173293,0.0010533731,0.0005168524,0.0009011379,0.00048815084,0.00008658995,0.000020687494],"category_scores_gemma":[0.0013883434,0.00013197707,0.00013869403,0.0023478651,0.0000678999,0.000499357,0.000119345976,0.0007863483,0.000115842704],"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.00009477432,0.00017519071,0.003227175,0.00007847109,0.00032436982,0.00010555479,0.012232958,0.22287156,0.0012582068,0.0055377944,0.0005153183,0.75357866],"study_design_scores_gemma":[0.0010666639,0.00065496657,0.005440661,0.0030464763,0.000060275182,0.0007800845,0.0024717394,0.9750239,0.00039368842,0.003808784,0.0068584243,0.0003943178],"about_ca_topic_score_codex":0.000017185748,"about_ca_topic_score_gemma":0.000002329741,"teacher_disagreement_score":0.7531843,"about_ca_system_score_codex":0.0000709731,"about_ca_system_score_gemma":0.0003440598,"threshold_uncertainty_score":0.8689693},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06957255,0.00022896443,0.92455614,0.00064967555,0.0019402652,0.0008013586,0.0000073824585,0.0016956141,0.0005480249],"genre_scores_gemma":[0.36746982,0.000075874224,0.6308202,0.00014128197,0.0011649183,0.000016244905,0.00003889008,0.000099005454,0.00017376743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785244,0.000013855537,0.0008818372,0.00023441372,0.00031034305,0.0007070861],"domain_scores_gemma":[0.9988043,0.0003089007,0.00022245126,0.00014495454,0.0001802349,0.00033920532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001299841,0.00029417966,0.00032252265,0.0003889075,0.00041500208,0.0007024606,0.00019472823,0.0001440863,0.0000029541145],"category_scores_gemma":[0.0005015377,0.00025488494,0.00013498332,0.00048939534,0.00005030842,0.0003023512,0.00006022093,0.0006408284,0.000023424724],"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.000025667869,0.000007802195,0.00009970344,0.000077089004,0.000054894714,0.000009905413,0.0010348076,0.58779484,0.0000082057495,0.00019255749,0.00021882402,0.4104757],"study_design_scores_gemma":[0.0018097713,0.00020731021,0.0000551572,0.00076989585,0.000020452853,0.00019578615,0.0013549497,0.9810142,0.00015331512,0.00013574676,0.013926123,0.00035727525],"about_ca_topic_score_codex":0.0000029783814,"about_ca_topic_score_gemma":0.0000022619304,"teacher_disagreement_score":0.41011843,"about_ca_system_score_codex":0.00009601251,"about_ca_system_score_gemma":0.00009954073,"threshold_uncertainty_score":0.99999034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08372898,0.000025141999,0.91063404,0.00019205506,0.0005180903,0.00017420991,0.0000012731275,0.00090771966,0.0038185022],"genre_scores_gemma":[0.6859511,0.0000121979365,0.31307232,0.00038719043,0.00046797836,0.0000036899191,0.00005132769,0.000041123058,0.0000130673825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844617,0.00006671253,0.0005586537,0.000134818,0.00032554485,0.00046809003],"domain_scores_gemma":[0.99927497,0.00018703073,0.00018396095,0.00013532543,0.0000974736,0.00012124662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702658,0.00019709965,0.00020168432,0.00028978658,0.00037814598,0.00024760174,0.00017975547,0.00007560564,0.000009169062],"category_scores_gemma":[0.00005385453,0.00017854167,0.00010085598,0.0006984225,0.000017111,0.00025029792,0.000028340275,0.00051923713,0.000050372433],"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.0000107408705,0.00001048901,0.00049014227,0.00003711562,0.000023077393,0.0000103834145,0.00015105153,0.975009,0.00006490582,0.0002473245,0.0027196396,0.021226099],"study_design_scores_gemma":[0.00044447478,0.00006946112,0.0007824272,0.00012789703,0.000009789051,0.00009729726,0.000052007315,0.9965129,0.00023561354,0.0008762515,0.00057803397,0.00021387175],"about_ca_topic_score_codex":0.0000014319721,"about_ca_topic_score_gemma":4.3945425e-7,"teacher_disagreement_score":0.60222214,"about_ca_system_score_codex":0.00016908212,"about_ca_system_score_gemma":0.000038109916,"threshold_uncertainty_score":0.7280718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32371154,0.000012001337,0.6727443,0.000060666895,0.00087132177,0.00010541022,0.0000033533083,0.0006979956,0.0017934187],"genre_scores_gemma":[0.9241338,0.000014975774,0.075110406,0.00011289316,0.00054471317,0.0000022139138,0.000012287204,0.000048234728,0.000020527033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987061,0.000025847552,0.0005234725,0.000099900826,0.00021720244,0.00042749767],"domain_scores_gemma":[0.9990448,0.00046642026,0.00013810935,0.00011173474,0.00013579098,0.00010314238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048045,0.00016111445,0.0001837356,0.00023760014,0.00042206442,0.0004011364,0.00017452906,0.00008007394,0.0000063924163],"category_scores_gemma":[0.00017076432,0.00015381143,0.00009874558,0.00041136114,0.000015351508,0.00032514994,0.00003436244,0.00036183026,0.000047829675],"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.000008259266,0.000004470184,0.00024876685,0.00003507109,0.000024407185,0.00000722622,0.00043576027,0.95440704,0.00050875155,0.0018360363,0.0006987797,0.04178541],"study_design_scores_gemma":[0.00046325076,0.00007588133,0.0012610292,0.00012426251,0.0000086958535,0.000051731935,0.00043612358,0.99429274,0.00066359795,0.0014757307,0.0009568757,0.00019010366],"about_ca_topic_score_codex":6.63791e-7,"about_ca_topic_score_gemma":2.6508138e-7,"teacher_disagreement_score":0.6004222,"about_ca_system_score_codex":0.000114157425,"about_ca_system_score_gemma":0.00004308874,"threshold_uncertainty_score":0.6272248},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029649975,0.000011733236,0.96659636,0.00077545625,0.0012491565,0.0005356482,0.000012875686,0.0008259783,0.0003428116],"genre_scores_gemma":[0.8576793,0.000010236645,0.14101139,0.000643609,0.0005685557,0.000028086617,0.00003044534,0.00002038363,0.000007994362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973608,0.00009322873,0.0006881371,0.00035468445,0.0010163529,0.0004867822],"domain_scores_gemma":[0.9971354,0.0006480216,0.0006548347,0.0006324962,0.0007794452,0.00014982466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003304826,0.00022059216,0.00024279837,0.00051714847,0.00060784904,0.0005978983,0.0009796965,0.000205435,0.000004718722],"category_scores_gemma":[0.00080072135,0.00019958413,0.00017762168,0.000974547,0.0000472715,0.0013643664,0.00015710367,0.00068401895,0.0000687239],"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.00006037969,0.00006143189,0.00008289452,0.00006217285,0.000048198275,0.0000073770534,0.0017932313,0.5033934,0.00028667733,0.034033373,0.0069983355,0.45317248],"study_design_scores_gemma":[0.00042631596,0.00020204394,0.0003363565,0.0001495178,0.00000940385,0.000015811072,0.000051652536,0.8894308,0.0061782436,0.10077966,0.0022031544,0.0002170109],"about_ca_topic_score_codex":0.000003428448,"about_ca_topic_score_gemma":0.0000015298253,"teacher_disagreement_score":0.82802933,"about_ca_system_score_codex":0.00039496078,"about_ca_system_score_gemma":0.00025401125,"threshold_uncertainty_score":0.81388044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74892116,0.0000256774,0.24756601,0.0005850623,0.0005002196,0.0022289723,0.000021263993,0.00011717369,0.000034481716],"genre_scores_gemma":[0.9067141,0.00004100885,0.09186347,0.0005358156,0.00038069318,0.00017564838,0.00015205212,0.00003610168,0.00010115685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976057,0.00024963924,0.0011498501,0.00023561687,0.00023922375,0.00051999185],"domain_scores_gemma":[0.99849117,0.0005575043,0.0003341443,0.00020048852,0.00024092436,0.00017576653],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019269295,0.00020240444,0.00033476375,0.0006056897,0.0015515387,0.000060030427,0.000098547105,0.00013448487,0.000012526264],"category_scores_gemma":[0.00015587774,0.0001490024,0.000097978285,0.00062590424,0.000012731213,0.00014952425,0.000017771836,0.00060445425,0.0000076164633],"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.00012615054,0.0007046462,0.01793107,0.000055340963,0.000048144684,0.00016038945,0.0076596923,0.9318826,0.0000037247441,0.0000295693,0.000026709575,0.041371956],"study_design_scores_gemma":[0.005832487,0.0018427011,0.0022245392,0.0001682883,0.000012032588,0.00011411364,0.018521551,0.9707003,4.8364814e-7,0.000010908468,0.00044897568,0.00012361316],"about_ca_topic_score_codex":0.0001746612,"about_ca_topic_score_gemma":0.00018993195,"teacher_disagreement_score":0.15779293,"about_ca_system_score_codex":0.0012554376,"about_ca_system_score_gemma":0.0009028659,"threshold_uncertainty_score":0.9997483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040897126,0.0000043494047,0.993479,0.00007286705,0.00095052714,0.0002535706,7.4094714e-7,0.0006510469,0.00049814215],"genre_scores_gemma":[0.1452649,0.0000072837056,0.85336035,0.00021557699,0.0009203367,0.000007509389,0.000016814196,0.00003322274,0.00017401848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814385,0.00007069763,0.00047607507,0.00034438726,0.00043647684,0.00052851887],"domain_scores_gemma":[0.99862444,0.00021692221,0.0004248639,0.00016795768,0.00037242452,0.00019340788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010917936,0.00021284194,0.0002234025,0.00049734046,0.0011653295,0.00059828284,0.0005623228,0.00008633602,0.000002650867],"category_scores_gemma":[0.00026066924,0.00018962797,0.00011896065,0.00096060976,0.000022864726,0.0015895219,0.00014297251,0.0006905284,0.000027518536],"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.0000061037454,0.000022077036,0.00006740605,0.0000037812808,0.000010671239,0.0000028811237,0.00070604536,0.5257746,0.000023515662,0.0003804554,0.000022656463,0.4729798],"study_design_scores_gemma":[0.0009484152,0.0005297323,0.00093743665,0.000027819991,0.0000031967372,0.00024492474,0.00016384463,0.99433637,0.00024636625,0.00079144276,0.0015199905,0.0002504719],"about_ca_topic_score_codex":0.0000056910376,"about_ca_topic_score_gemma":6.203169e-7,"teacher_disagreement_score":0.47272933,"about_ca_system_score_codex":0.00016746926,"about_ca_system_score_gemma":0.00010717522,"threshold_uncertainty_score":0.896289},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88633657,0.00012489765,0.11174597,0.000034413082,0.0004202749,0.00011896403,0.0000016873361,0.00034556517,0.00087165815],"genre_scores_gemma":[0.9951229,0.00009687696,0.0042082393,0.00012166491,0.00037330587,9.2719125e-7,0.000007713867,0.00005041084,0.000017960454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824065,0.000015432583,0.00050782645,0.00013968875,0.00043527677,0.00066114985],"domain_scores_gemma":[0.9993659,0.00010829005,0.00017337629,0.00011957928,0.000088952,0.00014385425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003981533,0.00022204804,0.00021187922,0.0004719054,0.00044857414,0.00026494285,0.00018971213,0.000075023236,0.000010484904],"category_scores_gemma":[0.000037315418,0.00019689953,0.000084973006,0.0010244572,0.000007244321,0.00083996996,0.000041628165,0.0006724332,0.000015884703],"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.0000107314545,0.0000023565663,0.000097471115,0.0000222383,0.00003028667,0.000009620861,0.00032981258,0.8706375,0.009640852,0.00009225535,0.000094792136,0.11903213],"study_design_scores_gemma":[0.000585135,0.00008703002,0.0006704426,0.00018763634,0.000009993762,0.000066276225,0.00013370893,0.9941375,0.0032287312,0.00037519945,0.00026896273,0.00024938284],"about_ca_topic_score_codex":0.0000047211324,"about_ca_topic_score_gemma":4.2841032e-7,"teacher_disagreement_score":0.12350005,"about_ca_system_score_codex":0.00039770492,"about_ca_system_score_gemma":0.000043649277,"threshold_uncertainty_score":0.80293304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42264074,0.000112575246,0.5741428,0.00007456404,0.0013801582,0.00013102731,0.0000026936034,0.0005142413,0.00100117],"genre_scores_gemma":[0.7494568,0.00008051923,0.24924794,0.00014007927,0.0009304739,0.0000028871707,0.000010115851,0.00006212115,0.000069025555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.000008177551,0.00041691435,0.00012338691,0.00020126555,0.0003941853],"domain_scores_gemma":[0.999226,0.0003390176,0.00012139785,0.00007970773,0.00010043738,0.00013347024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069148996,0.00017610667,0.00020135852,0.00035476807,0.000466778,0.00029998855,0.000114484305,0.00008762117,0.0000062276054],"category_scores_gemma":[0.00024060902,0.0001606677,0.000081289,0.00039189626,0.000018563913,0.00029568293,0.0000426311,0.0004128856,0.00002104074],"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.0000068799295,0.0000025398986,0.00030868585,0.00003167555,0.000038969833,0.0000058936203,0.0008662248,0.94580793,0.000032879387,0.00024048254,0.00007224431,0.052585617],"study_design_scores_gemma":[0.0006674006,0.00004460576,0.00054822,0.00028228076,0.000009388427,0.00005696753,0.0006261099,0.99667364,0.0002863987,0.00020529582,0.00038920133,0.00021050162],"about_ca_topic_score_codex":6.600938e-7,"about_ca_topic_score_gemma":2.195774e-7,"teacher_disagreement_score":0.32681608,"about_ca_system_score_codex":0.000086317785,"about_ca_system_score_gemma":0.000023021066,"threshold_uncertainty_score":0.65518385},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019898626,0.00006515279,0.9905321,0.0003930018,0.0013598123,0.00029137242,0.0000039926713,0.00064769335,0.004717028],"genre_scores_gemma":[0.77000153,0.00055623613,0.22379564,0.0017743694,0.0026213436,0.00003290367,0.00003200705,0.00023908338,0.00094689184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889195,0.000009571434,0.00039706347,0.00008243424,0.0002285661,0.00039038985],"domain_scores_gemma":[0.99921334,0.0003839533,0.00011417578,0.00011697661,0.00008363283,0.00008795241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007025593,0.00015011829,0.00014880444,0.00017036933,0.00044052815,0.00033309832,0.0002396484,0.000053520373,0.000022193917],"category_scores_gemma":[0.00004907167,0.00009735932,0.00011949384,0.0005030558,0.00001617611,0.00014597496,0.000035428362,0.0003877477,0.00009384331],"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.0000018811662,0.0000028499287,0.000031757263,0.0000137841225,0.00003602251,0.0000030419446,0.0003569045,0.6181685,0.0000134345155,0.00014712413,0.002335588,0.37888914],"study_design_scores_gemma":[0.00036283245,0.00006403648,0.00016864693,0.00011985857,0.0000075195308,0.0000691801,0.00009858937,0.9387215,0.00007034939,0.00027106694,0.059901778,0.00014464081],"about_ca_topic_score_codex":0.0000012959528,"about_ca_topic_score_gemma":3.197719e-7,"teacher_disagreement_score":0.7680117,"about_ca_system_score_codex":0.000060522296,"about_ca_system_score_gemma":0.000028785083,"threshold_uncertainty_score":0.3970198},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5054522,0.000060691076,0.48864463,0.00008551929,0.0007512152,0.00008009625,0.0000012186233,0.00083176413,0.0040926426],"genre_scores_gemma":[0.9555507,0.00014917663,0.043523792,0.00017664935,0.000368327,7.458683e-7,0.00000617378,0.00006263272,0.00016184124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865514,0.000052575906,0.0005146631,0.00011783024,0.0002507137,0.00040906438],"domain_scores_gemma":[0.9991486,0.00040213187,0.00011873856,0.00010134612,0.0001124866,0.00011666834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088092824,0.0001944912,0.00026629335,0.00019241514,0.0003303878,0.0002822493,0.00015150722,0.000093482086,0.000025424579],"category_scores_gemma":[0.00048974436,0.00017367819,0.00006417873,0.0004392636,0.000032318545,0.00025087572,0.00008746224,0.00091090397,0.00007530074],"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.0000074044265,0.000004146252,0.0028749425,0.00003539435,0.000037895035,0.000040691542,0.0021992633,0.9122768,0.00022664906,0.00019097973,0.0002976229,0.08180823],"study_design_scores_gemma":[0.00054499944,0.000076648656,0.0017649175,0.00016352546,0.000009020604,0.00018026288,0.00073626684,0.9929196,0.00012985738,0.00013500499,0.0031214983,0.00021838775],"about_ca_topic_score_codex":0.0000016751629,"about_ca_topic_score_gemma":1.988299e-7,"teacher_disagreement_score":0.45009843,"about_ca_system_score_codex":0.000062025145,"about_ca_system_score_gemma":0.000019228639,"threshold_uncertainty_score":0.7082391},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9071622,0.00009585111,0.06631586,0.010586204,0.003120688,0.0007182262,0.0000044251947,0.0010374207,0.010959111],"genre_scores_gemma":[0.9788183,0.000015417536,0.00083625957,0.014955921,0.0049558873,0.000009396969,0.00001873438,0.000070251604,0.00031982947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790543,0.000014124341,0.00069764233,0.00023663964,0.0004487964,0.0006973793],"domain_scores_gemma":[0.99792445,0.0007507549,0.00062655366,0.00033233306,0.00033261217,0.00003330535],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028396524,0.0002783207,0.00032571238,0.00051111233,0.0017765542,0.0010278405,0.00074619247,0.00007379857,0.00004600534],"category_scores_gemma":[0.00097550533,0.00018300989,0.00036933852,0.0012457175,0.0000654898,0.0014528311,0.00029853708,0.0005477923,0.0004178593],"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.00041642893,0.000099398545,0.003768513,0.00033689223,0.00049971044,0.000119500895,0.0011580627,0.55895233,0.0012947067,0.09392389,0.044666145,0.29476443],"study_design_scores_gemma":[0.0014505137,0.000049063812,0.00092948455,0.0003654865,0.00013395167,0.000045183002,0.0016986699,0.7264843,0.00019194245,0.04402312,0.22403395,0.0005943047],"about_ca_topic_score_codex":0.000016188915,"about_ca_topic_score_gemma":0.000008996242,"teacher_disagreement_score":0.29417014,"about_ca_system_score_codex":0.00007218559,"about_ca_system_score_gemma":0.00002977548,"threshold_uncertainty_score":0.999523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081285894,0.00025369227,0.91483116,0.00074914715,0.0020059424,0.00033305652,0.000032657226,0.0000756376,0.0004327916],"genre_scores_gemma":[0.8658884,0.00013843544,0.12799276,0.0005591864,0.002824463,0.000015579231,0.00014248693,0.00003513082,0.0024035599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724036,0.00004248147,0.0011423568,0.00028353836,0.0009657539,0.0003255053],"domain_scores_gemma":[0.9977705,0.0007461622,0.0004250163,0.00017522436,0.00071907823,0.00016403392],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031902685,0.00016695367,0.00022386744,0.00035654346,0.0006426337,0.0023678122,0.00036712358,0.00009745277,0.0000612907],"category_scores_gemma":[0.001514349,0.000114798684,0.00023062274,0.0006911007,0.000031801086,0.0009016037,0.00005776219,0.0003308434,0.00012564925],"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.000028740626,0.000046736935,0.0023343526,0.000009801818,0.0000400982,0.000014763132,0.0003869639,0.6716043,0.00018766576,0.0042403336,0.02795973,0.29314652],"study_design_scores_gemma":[0.0004617504,0.0001319259,0.0009663682,0.00009337271,0.000007573156,0.00015047328,0.000062396655,0.8776655,0.00009474928,0.0010015725,0.119219474,0.0001448371],"about_ca_topic_score_codex":0.0000039446886,"about_ca_topic_score_gemma":0.000008053255,"teacher_disagreement_score":0.7868384,"about_ca_system_score_codex":0.00014947912,"about_ca_system_score_gemma":0.000281205,"threshold_uncertainty_score":0.99866784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008146057,0.00021234683,0.993101,0.00070629065,0.0035503025,0.00047389782,0.0000027832418,0.00043745642,0.00070129766],"genre_scores_gemma":[0.07984861,0.000035930163,0.9182905,0.0007655511,0.0009299408,0.000011917514,0.000006393811,0.000041189243,0.00006997061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977257,0.000048388953,0.0007811759,0.00040715898,0.00046922063,0.00056834886],"domain_scores_gemma":[0.9976263,0.0012434691,0.00038462956,0.0002819094,0.00031714165,0.0001465553],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00094216946,0.0002836561,0.0002785173,0.0003444722,0.0009968989,0.0020315207,0.0005097084,0.00012758731,0.0000137780835],"category_scores_gemma":[0.00077513605,0.00024231683,0.00017911522,0.000992483,0.000047115074,0.0028513626,0.00021210714,0.0007741547,0.00003080098],"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.000011058229,0.000025504209,0.000014261887,0.000042323965,0.000037855803,0.00005795424,0.0024700048,0.8822748,0.000012433136,0.042834897,0.00010907181,0.07210982],"study_design_scores_gemma":[0.00041044783,0.00022382822,0.000016922508,0.0009355034,0.000010108266,0.00047430987,0.00023485385,0.9865934,0.00011671408,0.007924789,0.0027529565,0.00030615903],"about_ca_topic_score_codex":0.0000012331059,"about_ca_topic_score_gemma":1.4798395e-7,"teacher_disagreement_score":0.10431859,"about_ca_system_score_codex":0.00042133068,"about_ca_system_score_gemma":0.00023603487,"threshold_uncertainty_score":0.9990045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4464526,0.00033718138,0.55145746,0.00011381996,0.00056631916,0.00012400694,0.0000022579095,0.00053552486,0.0004108592],"genre_scores_gemma":[0.8489315,0.000018303885,0.1505808,0.0001388461,0.00028580628,9.2313564e-7,0.0000037853208,0.00003588218,0.0000041429357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000018778514,0.00043870593,0.00017598158,0.00026812544,0.00037912303],"domain_scores_gemma":[0.99922043,0.00028128747,0.00007855672,0.00010543769,0.000088518515,0.00022574008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005719377,0.0002514012,0.00025303752,0.00024492998,0.0002945756,0.0007990379,0.00011175698,0.00008574867,0.000009450685],"category_scores_gemma":[0.000056910616,0.000186352,0.00006304307,0.00026676687,0.000069478934,0.00021422704,0.000037700782,0.0008018482,0.00001005563],"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.000009136761,0.0000116312995,0.00059140107,0.000116530944,0.00006124169,0.00005112625,0.00067674334,0.64020145,0.00001289737,0.00016521935,0.000012810572,0.35808983],"study_design_scores_gemma":[0.00068387826,0.000118522454,0.0005372592,0.0008047105,0.00002083859,0.00057879504,0.00013576754,0.9956892,0.0001322623,0.000023685401,0.0010046635,0.00027037904],"about_ca_topic_score_codex":0.0000032353537,"about_ca_topic_score_gemma":0.0000016810895,"teacher_disagreement_score":0.40247893,"about_ca_system_score_codex":0.000079075966,"about_ca_system_score_gemma":0.00006582877,"threshold_uncertainty_score":0.77051413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058948234,0.00054267305,0.8573344,0.0434424,0.009284037,0.0015192574,0.0000039530128,0.00057396246,0.028351085],"genre_scores_gemma":[0.99338573,0.000023974939,0.0011373702,0.0028901403,0.0023229087,0.000011473807,0.000018910763,0.000019305344,0.00019018742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880856,0.0000049403307,0.00045416818,0.00014335911,0.00030625373,0.00028268714],"domain_scores_gemma":[0.999514,0.00011021076,0.00009987976,0.00012198182,0.00013794865,0.000015997766],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011806675,0.00014473326,0.000114543946,0.0002492895,0.0007702471,0.0013996663,0.00027595385,0.000032724503,0.000120726996],"category_scores_gemma":[0.00007125473,0.0000882476,0.00015111116,0.00036377256,0.000023464941,0.0009626717,0.00008892256,0.00025183792,0.00021211061],"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.00008695599,0.000033723496,0.0002777479,0.00064410875,0.0002150592,0.000011795124,0.0006125567,0.114778124,0.000044278553,0.10091466,0.020572783,0.7618082],"study_design_scores_gemma":[0.00030519924,0.000017692102,0.0005070635,0.00026818487,0.000041964242,0.0000086593045,0.0002764712,0.6748662,0.000007561263,0.0053810854,0.31817728,0.0001426524],"about_ca_topic_score_codex":0.000058431186,"about_ca_topic_score_gemma":0.00004754078,"teacher_disagreement_score":0.9344375,"about_ca_system_score_codex":0.000057546014,"about_ca_system_score_gemma":0.000023874798,"threshold_uncertainty_score":0.99963695},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008901413,0.00009028561,0.9889068,0.00021275476,0.0007948664,0.00023695423,9.176614e-7,0.000087759865,0.00076826505],"genre_scores_gemma":[0.5218807,9.186128e-7,0.47763157,0.0001897852,0.00026474803,0.0000022587465,2.3402873e-7,0.000013960829,0.000015811667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.0002579035,0.00062373467,0.00013719445,0.0004307258,0.00028208003],"domain_scores_gemma":[0.9914278,0.007984566,0.00018480212,0.0001643614,0.00013577018,0.00010271004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031251293,0.00016528073,0.00019840054,0.00010175747,0.00035120748,0.0004328174,0.0001827059,0.000056441582,0.00008051054],"category_scores_gemma":[0.0012934,0.00008873076,0.00010043178,0.00024304031,0.000025227686,0.000057250134,0.00005498209,0.00049329584,0.000045960485],"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.000026623824,0.00004367775,0.0000025319823,0.000031202602,0.000048727863,0.000023147355,0.0025003369,0.4566358,0.0005032976,0.069079794,0.00020740823,0.47089747],"study_design_scores_gemma":[0.00015430199,0.00018451203,0.000048998238,0.00023687335,0.000023411083,0.00009005877,0.00018280202,0.91627586,0.0014804802,0.080856785,0.00034649824,0.00011939411],"about_ca_topic_score_codex":0.0000021451033,"about_ca_topic_score_gemma":7.233635e-8,"teacher_disagreement_score":0.5129793,"about_ca_system_score_codex":0.00011379402,"about_ca_system_score_gemma":0.000086350425,"threshold_uncertainty_score":0.4173668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28146085,0.00005188739,0.7177442,0.00002787002,0.00012698493,0.00026730832,0.000027924618,0.00016732296,0.00012566386],"genre_scores_gemma":[0.9716885,0.0000014749514,0.028085753,0.000057710142,0.000080208214,0.0000056135,0.000063813946,0.000014104633,0.000002788272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904466,0.0000064216056,0.0004478982,0.00013532204,0.00017456633,0.00019111892],"domain_scores_gemma":[0.9993541,0.00016845674,0.000062838015,0.000112810936,0.00023937266,0.00006239018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000498731,0.00013944446,0.00013853218,0.00020190327,0.00024598592,0.00024254296,0.000081045575,0.00007365704,0.0000019539257],"category_scores_gemma":[0.000082894585,0.00013097268,0.000059311835,0.000272582,0.000028182447,0.00041711348,0.000008456937,0.00032629434,5.9180866e-7],"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.0000067376,0.000016907496,0.0004982379,0.0004127407,0.0000283169,3.1371752e-7,0.0005612496,0.98897135,0.00027766943,0.0021621364,0.0000059042072,0.0070584062],"study_design_scores_gemma":[0.00044431814,0.00002815458,0.0018154673,0.00018706784,0.000019422087,0.0000053882914,0.00006599803,0.99642915,0.00011079887,0.0005186208,0.00022957285,0.00014604413],"about_ca_topic_score_codex":0.000005621926,"about_ca_topic_score_gemma":0.00000839193,"teacher_disagreement_score":0.6902277,"about_ca_system_score_codex":0.00016755093,"about_ca_system_score_gemma":0.00008318815,"threshold_uncertainty_score":0.53409106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907052,0.00017355265,0.8383776,0.00015783336,0.00074916775,0.00033168032,0.00001553819,0.00057833246,0.0005457855],"genre_scores_gemma":[0.93501973,0.000010403697,0.064041816,0.0001500622,0.00060942984,0.0000067583387,0.000010326269,0.000089035944,0.00006240615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977976,0.00010696022,0.00072656915,0.00022713306,0.00039460784,0.00074714725],"domain_scores_gemma":[0.9983212,0.0008684675,0.00009325913,0.0002029659,0.00031606763,0.00019809257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029075402,0.00027977364,0.00026152295,0.00023124661,0.0010979146,0.00074443995,0.0003495522,0.00012676754,0.00002286116],"category_scores_gemma":[0.00011547219,0.00019939804,0.00013945065,0.00067821343,0.00005903715,0.0005449179,0.00008183771,0.0012179383,0.000024373812],"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.000038542657,0.00001937714,0.00004447205,0.000062171464,0.00010001276,0.000017337448,0.0075392104,0.917905,0.00018322495,0.0009437556,0.0002116984,0.072935246],"study_design_scores_gemma":[0.00053685845,0.00036604592,0.00013311591,0.00044921297,0.000030009565,0.00016335791,0.001692187,0.9943713,0.0007045195,0.00026506404,0.0010211845,0.00026717523],"about_ca_topic_score_codex":0.0000068550344,"about_ca_topic_score_gemma":0.0000039397905,"teacher_disagreement_score":0.77594924,"about_ca_system_score_codex":0.0002887279,"about_ca_system_score_gemma":0.000106740394,"threshold_uncertainty_score":0.8444383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82089233,0.001873731,0.17028148,0.00038361156,0.0011396665,0.00022461303,9.025213e-7,0.00086142664,0.0043422277],"genre_scores_gemma":[0.97849053,0.00024102507,0.020553036,0.00013825779,0.00048028733,0.0000019263107,5.4980023e-7,0.000058960002,0.000035408026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829984,0.00005824677,0.0005642548,0.00017603044,0.00035673383,0.00054490304],"domain_scores_gemma":[0.9986295,0.00092258194,0.00011315223,0.00013973122,0.00006193086,0.00013307943],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002010701,0.00023553486,0.00018573694,0.0002934167,0.00088875345,0.0011371515,0.00020304753,0.00008402823,0.0000038341773],"category_scores_gemma":[0.00022056856,0.00016191116,0.00009925112,0.00061820133,0.000022492286,0.00029980723,0.000048957445,0.0012519534,0.00002297932],"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.000009190151,0.000004750941,0.00043084694,0.000047306305,0.000065549284,0.000021692267,0.00083482475,0.7121342,0.001071873,0.0026071128,0.000046880206,0.28272578],"study_design_scores_gemma":[0.00026435105,0.00006961958,0.0006514183,0.0007210697,0.000010761749,0.00017188015,0.000109267356,0.99460447,0.0011256215,0.00022598534,0.0018336434,0.00021193874],"about_ca_topic_score_codex":0.0000017495668,"about_ca_topic_score_gemma":4.2386284e-7,"teacher_disagreement_score":0.28251383,"about_ca_system_score_codex":0.00016932184,"about_ca_system_score_gemma":0.000040632356,"threshold_uncertainty_score":0.99989974},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026221115,0.000020236923,0.9460703,0.008659444,0.017625336,0.000489267,9.851674e-7,0.00024709624,0.00066623086],"genre_scores_gemma":[0.74681693,0.000013177243,0.043902885,0.008011454,0.20051762,0.000036628117,0.0000071201075,0.000053543805,0.0006406165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982929,0.000043573684,0.00045036525,0.0003258465,0.00047168828,0.00041558582],"domain_scores_gemma":[0.99887073,0.00042865425,0.00015455805,0.00034248934,0.00010220518,0.00010136799],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017606701,0.00016876504,0.00013259942,0.00023518821,0.00073583407,0.0025180322,0.00064552604,0.000043089658,0.000019123152],"category_scores_gemma":[0.00028303405,0.00011334219,0.00014747733,0.00061243615,0.000010412769,0.0008448124,0.00021385761,0.0005098664,0.00018575824],"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.000021336855,0.000009995435,0.000007323481,0.000011239082,0.000022932618,0.000009875359,0.00042994833,0.2741542,0.000009467367,0.013575047,0.07896913,0.63277954],"study_design_scores_gemma":[0.00020498176,0.0005305495,0.00028578198,0.00018371441,0.0000078706025,0.000065672524,0.00007067656,0.43703166,0.00025739596,0.00044474364,0.56075305,0.00016392257],"about_ca_topic_score_codex":0.0000021280503,"about_ca_topic_score_gemma":0.0000028048191,"teacher_disagreement_score":0.9021674,"about_ca_system_score_codex":0.00047273643,"about_ca_system_score_gemma":0.000072996605,"threshold_uncertainty_score":0.99851745},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24742998,0.0001610896,0.74820024,0.000023677847,0.0008554211,0.00012232039,0.000012317417,0.002767208,0.00042777663],"genre_scores_gemma":[0.98625886,0.000039563547,0.013100387,0.000029799136,0.00044473185,5.184045e-7,0.00006420335,0.000044074728,0.000017866632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889064,0.000009205311,0.0003970725,0.00014997137,0.00027348197,0.00027962256],"domain_scores_gemma":[0.9995588,0.00004693305,0.000081013124,0.00018690668,0.000036469628,0.000089846304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037624492,0.00018597435,0.00014734358,0.00033141454,0.00017491741,0.0005829593,0.00026546797,0.00005164328,0.00000730513],"category_scores_gemma":[0.000013661691,0.00014206908,0.00003718073,0.00031210243,0.000017760414,0.000961549,0.0000731046,0.00043185364,0.000006613794],"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.000009844445,0.000009041397,0.00023471299,0.00011795918,0.000091395945,0.000081092716,0.0004899532,0.86526495,0.00003355534,0.00015871339,0.006094008,0.12741478],"study_design_scores_gemma":[0.00017736199,0.000077969584,0.00005547855,0.00061747484,0.000025411628,0.0002312695,0.00013533828,0.9784233,0.00004937355,0.000014185659,0.020013765,0.00017904729],"about_ca_topic_score_codex":0.0000035094408,"about_ca_topic_score_gemma":0.000003055179,"teacher_disagreement_score":0.7388289,"about_ca_system_score_codex":0.00013492798,"about_ca_system_score_gemma":0.00003682038,"threshold_uncertainty_score":0.57934093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24291873,0.00044725108,0.75455385,0.000105409694,0.00039513674,0.00074643997,0.000003467712,0.00059079163,0.00023889357],"genre_scores_gemma":[0.83940375,0.000018581915,0.16011651,0.000022065458,0.00029008515,0.000026823665,0.000020708705,0.00008816834,0.000013305182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980203,0.000015750138,0.0006646264,0.00028101727,0.00037126557,0.00064704486],"domain_scores_gemma":[0.99921864,0.0001889668,0.00016323478,0.00013438652,0.00010726003,0.00018752023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010249536,0.00036481765,0.0003505659,0.00030580495,0.0003256719,0.000968189,0.00015133513,0.00013225974,0.0000012751395],"category_scores_gemma":[0.000029499868,0.00027805398,0.00009524081,0.00031606265,0.00004878562,0.00048863393,0.00004748592,0.0007234732,0.0000028918162],"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.000018229131,0.00001962646,0.00041059524,0.00068506756,0.0001571735,0.000039667782,0.0013272015,0.627223,0.00011688886,0.00067898334,0.000010599294,0.36931297],"study_design_scores_gemma":[0.0007745617,0.0004444694,0.00024429112,0.0017735715,0.000046138164,0.0015013426,0.00095563504,0.98982334,0.00013126453,0.00013789811,0.003749993,0.00041748272],"about_ca_topic_score_codex":0.0000018833591,"about_ca_topic_score_gemma":0.000011436209,"teacher_disagreement_score":0.596485,"about_ca_system_score_codex":0.0003004353,"about_ca_system_score_gemma":0.00010934491,"threshold_uncertainty_score":0.99996716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012061733,0.00012266966,0.98448646,0.00032106118,0.0017050083,0.00094056985,0.000044325345,0.00012414622,0.00019404259],"genre_scores_gemma":[0.16079949,0.000054249704,0.8383048,0.00014064519,0.00043828232,0.000037009588,0.000042315714,0.000030148049,0.00015304965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966164,0.00008320825,0.001183803,0.00058224157,0.0008967577,0.00063755445],"domain_scores_gemma":[0.99623716,0.00051151204,0.0013058669,0.0006515065,0.0011136676,0.00018028518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012363093,0.0004373915,0.0006305508,0.000750123,0.0004958796,0.0008791163,0.0014435626,0.00026595345,0.0000021363028],"category_scores_gemma":[0.00021179208,0.00038078387,0.00023382643,0.00040523402,0.00012121309,0.000522879,0.0013345975,0.0013128187,0.0000016959553],"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.000023109353,0.0000287453,0.000009791868,0.00021709185,0.00008765915,0.00001987131,0.0005473088,0.3805687,0.00006982532,0.00018582794,0.000026307647,0.61821574],"study_design_scores_gemma":[0.0011314388,0.00061735074,0.000052274074,0.0022453656,0.000017291146,0.000253269,0.000105335224,0.99302256,0.0010257851,0.00087243976,0.00025887508,0.00039803836],"about_ca_topic_score_codex":0.000020370291,"about_ca_topic_score_gemma":0.000025074036,"teacher_disagreement_score":0.6178177,"about_ca_system_score_codex":0.00064589584,"about_ca_system_score_gemma":0.001078693,"threshold_uncertainty_score":0.9998644},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03961478,0.00013941861,0.95762295,0.00035893524,0.0018212949,0.00017195998,0.0000022753186,0.00006467208,0.00020374147],"genre_scores_gemma":[0.581443,0.0000044136173,0.41827095,0.000106060994,0.00014708753,0.0000019622064,8.289528e-7,0.000007657245,0.00001803986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868435,0.0000889238,0.0006328237,0.00015989786,0.00018797272,0.00024602268],"domain_scores_gemma":[0.99863786,0.00071181374,0.00030074912,0.0001440165,0.00012998219,0.00007557414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026112916,0.00012487666,0.00018964788,0.0002594801,0.00017688751,0.00028922048,0.0003959067,0.000033490196,0.000020738013],"category_scores_gemma":[0.00008568855,0.000089393434,0.00019471697,0.00028416063,0.000025078221,0.00033004864,0.00014495988,0.00027157864,0.000010405041],"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.000013485214,0.0000072531707,0.0000053072513,0.000040661125,0.00004759084,0.0000058338524,0.0032280937,0.0030606042,0.00077221607,0.48963472,0.000055320354,0.50312895],"study_design_scores_gemma":[0.00035563667,0.00048269826,0.000042180323,0.00025256176,0.000010067093,0.0001305869,0.00041275285,0.9421441,0.010708333,0.042405512,0.0029375846,0.00011796022],"about_ca_topic_score_codex":0.0000020810996,"about_ca_topic_score_gemma":8.519266e-8,"teacher_disagreement_score":0.9390835,"about_ca_system_score_codex":0.00009602804,"about_ca_system_score_gemma":0.00010107994,"threshold_uncertainty_score":0.36453587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046761982,0.00016572546,0.9519171,0.000044592212,0.00076432084,0.00013960128,0.000021994369,0.00014190201,0.000042749838],"genre_scores_gemma":[0.55886835,0.00003257931,0.43966502,0.00009621085,0.0012360971,0.00000342976,0.000041830812,0.000043281285,0.000013188931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894726,0.000029695653,0.00049471715,0.00008400914,0.00022708606,0.0002172247],"domain_scores_gemma":[0.99872404,0.00094539375,0.00009145119,0.000089912246,0.0000750637,0.000074107964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010246362,0.0001255904,0.00017294777,0.00010984787,0.00015902714,0.0001672245,0.0001440987,0.00006827566,0.000039746483],"category_scores_gemma":[0.000046423127,0.00008168388,0.0001083204,0.00029480763,0.000030572493,0.00025321057,0.000004180889,0.00030217902,0.0000024677088],"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.000009398356,0.000006614058,0.00006947386,0.000026956279,0.000078958445,0.0000026370885,0.0012520662,0.6999509,0.00015526856,0.00017043443,0.00042070195,0.29785663],"study_design_scores_gemma":[0.00027425887,0.0001490959,0.0019487065,0.00027296995,0.000025653198,0.000020301834,0.000059386286,0.9940684,0.00025512837,0.00024201417,0.0025822746,0.000101853315],"about_ca_topic_score_codex":0.0000023758673,"about_ca_topic_score_gemma":5.309706e-7,"teacher_disagreement_score":0.5122521,"about_ca_system_score_codex":0.000049934504,"about_ca_system_score_gemma":0.000040444767,"threshold_uncertainty_score":0.33309722},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106869005,0.000035744783,0.9877462,0.0000443547,0.0010075219,0.00015808736,0.0000029046232,0.00013037036,0.0001879133],"genre_scores_gemma":[0.9170284,0.0000037857308,0.08216471,0.00023475522,0.0005377393,0.0000037925938,0.000004514068,0.000012987736,0.000009313906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885386,0.000035171444,0.00044484955,0.00011507305,0.00014091011,0.00041011564],"domain_scores_gemma":[0.99910146,0.0004206765,0.00007682151,0.00018431518,0.00011102078,0.00010569015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007262877,0.00016998546,0.00023916822,0.00021020828,0.00064096414,0.0002095436,0.00024256557,0.00009008064,0.000016365913],"category_scores_gemma":[0.000051556028,0.0001396636,0.00015692181,0.0003083073,0.00003392905,0.00030001497,0.000025582522,0.00053185807,0.000004450035],"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.0000078386765,0.000011637891,0.000026174966,0.000007273335,0.00007188773,5.472231e-7,0.00007031107,0.75661725,0.000012024374,0.00021699203,0.00040397726,0.24255407],"study_design_scores_gemma":[0.00033387402,0.00010082293,0.0011496404,0.000110214794,0.000044711178,0.000020976227,0.00015920361,0.9934992,0.00008795407,0.0041602496,0.00019097253,0.00014218778],"about_ca_topic_score_codex":0.0000028587265,"about_ca_topic_score_gemma":0.000003081743,"teacher_disagreement_score":0.9063415,"about_ca_system_score_codex":0.00020997184,"about_ca_system_score_gemma":0.000052721138,"threshold_uncertainty_score":0.5695317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46689212,0.00019030149,0.054866295,0.0021795058,0.0034933363,0.0016291179,6.760652e-7,0.00076182967,0.46998683],"genre_scores_gemma":[0.98686343,0.000019113499,0.0028795202,0.0077254074,0.00054768036,0.000017293838,0.000016152952,0.00004146966,0.0018899505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980279,0.000008880476,0.0005778581,0.00027723706,0.0005078219,0.00060029933],"domain_scores_gemma":[0.99909806,0.00002282516,0.00044601163,0.00027618103,0.00012525517,0.00003168577],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083215773,0.00031431313,0.00027355025,0.0009898938,0.0006266543,0.0011243991,0.00051395124,0.000057083627,0.0000738067],"category_scores_gemma":[0.000020261314,0.00023479841,0.00012583045,0.00079090946,0.00006380983,0.0009909337,0.00035958638,0.00044515188,0.00013548834],"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.0002959729,0.000291082,0.008850808,0.0011701937,0.0005967955,0.00043990105,0.00016838779,0.012783542,0.0000051851343,0.13621272,0.01077995,0.82840544],"study_design_scores_gemma":[0.0034904433,0.0001010601,0.003524029,0.0017508183,0.000117985786,0.00004407129,0.001978481,0.13955449,0.00001850981,0.0040359297,0.8447086,0.0006755873],"about_ca_topic_score_codex":0.000011730541,"about_ca_topic_score_gemma":0.000006426672,"teacher_disagreement_score":0.83392864,"about_ca_system_score_codex":0.0002042277,"about_ca_system_score_gemma":0.000024906823,"threshold_uncertainty_score":0.9999125},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05442438,0.00012252734,0.94137037,0.0002494737,0.0007242428,0.00018934732,0.0000012115959,0.00018801719,0.0027304403],"genre_scores_gemma":[0.8770958,0.000029952129,0.12242198,0.00024346373,0.0000973269,0.0000032366754,0.000022610922,0.000026011867,0.000059607468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988201,0.000054453485,0.00058411836,0.000110572946,0.00014333901,0.00028739686],"domain_scores_gemma":[0.9992342,0.00034699208,0.00012863851,0.00010224639,0.0001290959,0.000058826074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612397,0.00016056975,0.00020670565,0.00045999078,0.00023682429,0.00013845686,0.00016243657,0.00009847337,0.000008902011],"category_scores_gemma":[0.00028146053,0.00016121707,0.00007357146,0.00049752893,0.000011972751,0.00022801098,0.000027464112,0.0006146209,0.0000056073172],"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.000026426686,0.00001295228,0.00172275,0.00004974056,0.000023273386,0.0000012189304,0.00027904773,0.85824084,0.00008288878,0.00025815316,0.00011862262,0.13918407],"study_design_scores_gemma":[0.0011037563,0.00007902114,0.0025148091,0.0003199773,0.000008377527,0.00001943044,0.00010063128,0.9930043,0.00043253857,0.0002907742,0.001971077,0.00015526976],"about_ca_topic_score_codex":0.000004139113,"about_ca_topic_score_gemma":0.0000038090652,"teacher_disagreement_score":0.8226714,"about_ca_system_score_codex":0.00030364608,"about_ca_system_score_gemma":0.000042151336,"threshold_uncertainty_score":0.65742415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37760767,0.00007467683,0.608067,0.00019246215,0.0026533979,0.000307544,5.949691e-7,0.00020588553,0.010890792],"genre_scores_gemma":[0.9787007,0.000016161786,0.02084855,0.0001330618,0.00018686817,9.839464e-7,0.000004258068,0.000010708788,0.000098715864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838734,0.00006166252,0.000547375,0.00014039758,0.00044467952,0.00041855135],"domain_scores_gemma":[0.99903524,0.00015002105,0.00037197894,0.00007681673,0.00026430152,0.000101644284],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013323692,0.00013065535,0.00018327913,0.00030326814,0.0019085427,0.0005439837,0.00021475065,0.000110007844,0.00000538874],"category_scores_gemma":[0.00014507903,0.000121866666,0.0000859148,0.0005859897,0.0000581663,0.0007079299,0.000018965979,0.0004418164,0.00000193175],"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.000016574577,0.000029974288,0.0017403102,0.000023718017,0.000027929567,0.00000606092,0.013884985,0.93101764,0.000018549594,0.021490943,0.000016805656,0.031726487],"study_design_scores_gemma":[0.0008643906,0.00005166354,0.0004498674,0.0010878845,0.000029065497,0.000007363441,0.004678795,0.98379207,0.000016306401,0.0070389067,0.0017565837,0.00022711307],"about_ca_topic_score_codex":0.000112827125,"about_ca_topic_score_gemma":0.000030957457,"teacher_disagreement_score":0.601093,"about_ca_system_score_codex":0.00030548463,"about_ca_system_score_gemma":0.00042090518,"threshold_uncertainty_score":0.99939084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010518415,0.000041166473,0.9269679,0.000034646204,0.00027698753,0.0003212789,4.9760456e-7,0.00032893007,0.06151017],"genre_scores_gemma":[0.9534547,0.000011656051,0.046161212,0.00016220455,0.00007377871,0.000006014647,0.000008049585,0.000021895296,0.00010051929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878395,0.000015082559,0.0005221932,0.0000809333,0.00022762631,0.0003701948],"domain_scores_gemma":[0.99947226,0.00011401612,0.00009836502,0.00010630298,0.00010766272,0.00010139127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053889136,0.00018099809,0.00024036241,0.00017174655,0.00031615084,0.00034503263,0.00014544393,0.000055277294,0.0000366153],"category_scores_gemma":[0.000032911797,0.00013041386,0.00006955555,0.00037851243,0.000023641996,0.0003693291,0.000015248652,0.0004243922,0.000010730838],"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.000042066975,0.000027163265,0.000018646677,0.00014338203,0.00006844292,0.0000068174304,0.00069303904,0.82638603,0.0000886415,0.004941614,0.000011981422,0.16757214],"study_design_scores_gemma":[0.0025937331,0.000100366095,0.0000025221807,0.0004701193,0.000024728191,0.00012152508,0.0002841651,0.9900495,0.00035618196,0.0005175332,0.0052976594,0.00018198128],"about_ca_topic_score_codex":0.000005494837,"about_ca_topic_score_gemma":0.0000023050395,"teacher_disagreement_score":0.94293624,"about_ca_system_score_codex":0.00013127041,"about_ca_system_score_gemma":0.000048140308,"threshold_uncertainty_score":0.53181225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9087614,0.00017531228,0.08605124,0.0012357745,0.0007314266,0.00040820622,9.873171e-7,0.00005012196,0.002585572],"genre_scores_gemma":[0.9860985,0.000014135401,0.012550245,0.0009207774,0.0001842133,0.0000091917655,0.00001362395,0.000012568153,0.00019671822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777097,0.000043967575,0.0013045272,0.00017694087,0.0002339577,0.00046965387],"domain_scores_gemma":[0.9986578,0.00058760593,0.0002611395,0.00013409527,0.00024815177,0.000111197674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00211328,0.0001567581,0.00027754952,0.00058450806,0.00039762157,0.00017638382,0.00012996384,0.00013557127,0.000019098155],"category_scores_gemma":[0.00075332285,0.00013202979,0.0000895791,0.0005635529,0.00003803503,0.00028144772,0.000037685797,0.00064824894,0.000018708532],"study_design_candidate":"design_other","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.0005025502,0.0002161121,0.00188498,0.00022383229,0.000057394558,0.00008554366,0.04376397,0.03885272,0.0004430005,0.072433144,0.00009457077,0.84144217],"study_design_scores_gemma":[0.00032125603,0.0006264536,0.002213215,0.0056953607,0.000037673602,0.00014837498,0.17252535,0.5354936,0.048925187,0.23233111,0.0011941515,0.0004882427],"about_ca_topic_score_codex":0.00008270201,"about_ca_topic_score_gemma":0.00021582551,"teacher_disagreement_score":0.84095395,"about_ca_system_score_codex":0.00032657615,"about_ca_system_score_gemma":0.0017087719,"threshold_uncertainty_score":0.53840184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16610056,0.000013594411,0.831759,0.00035907485,0.0005392801,0.00028462592,0.000018617951,0.00024402491,0.0006812545],"genre_scores_gemma":[0.99174494,0.0000033445858,0.006872196,0.0011285786,0.000105277286,0.000007870562,0.000070334354,0.000014989759,0.00005246789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.000011661683,0.00056684826,0.00009749046,0.0001223346,0.00020488867],"domain_scores_gemma":[0.9992407,0.0002792296,0.00010600923,0.000105173356,0.00021346065,0.00005545213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039220386,0.00014031373,0.00018307396,0.0002787513,0.00026605168,0.00009026565,0.00010575211,0.00007611531,0.000023986671],"category_scores_gemma":[0.00013682578,0.0001269129,0.00010092458,0.00025657626,0.000019282586,0.0001096333,0.0000028308511,0.00041865112,0.0000034734742],"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.00004812033,0.000063614905,0.00057293515,0.000047584963,0.000046481367,8.739787e-7,0.0000896881,0.9835152,0.000020554335,0.00085327827,0.00018213205,0.014559547],"study_design_scores_gemma":[0.0019755426,0.00019279539,0.0036991432,0.00011851771,0.000018261322,0.0000021419858,0.00006505498,0.987513,0.00015003311,0.000089808134,0.0060551935,0.00012052607],"about_ca_topic_score_codex":8.5047293e-7,"about_ca_topic_score_gemma":0.0000027554584,"teacher_disagreement_score":0.8256444,"about_ca_system_score_codex":0.00012566197,"about_ca_system_score_gemma":0.00009030229,"threshold_uncertainty_score":0.5175358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053526793,0.000056555346,0.9441208,0.00041924624,0.00025710405,0.0004085847,0.0000016787335,0.00021218712,0.0009970227],"genre_scores_gemma":[0.95765364,0.0000035669318,0.041684408,0.0004747202,0.00012562692,0.000009970937,0.000009882684,0.000024654833,0.000013529061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989946,0.000021144662,0.00038011448,0.00010329022,0.00019524788,0.00030563195],"domain_scores_gemma":[0.999015,0.00044111465,0.00014888047,0.00014369495,0.0002005969,0.0000507205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067158,0.00017028076,0.00017017577,0.00021301827,0.00045215976,0.00019480057,0.0001883057,0.000064081294,0.0000020495481],"category_scores_gemma":[0.000089981055,0.00010833965,0.00007470429,0.0003206152,0.00002036895,0.00017606896,0.00001746414,0.00041125662,0.0000014506281],"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.00006422816,0.00000845871,0.0001763478,0.00006820998,0.00007274315,0.000006419169,0.00019071795,0.99312115,0.00040282388,0.0006553635,0.00040095794,0.004832609],"study_design_scores_gemma":[0.00089481496,0.00017253966,0.00047903333,0.00061084627,0.00002567667,0.00004428506,0.0002436992,0.9957643,0.0009311107,0.0001824555,0.0005096101,0.0001416192],"about_ca_topic_score_codex":0.000006919047,"about_ca_topic_score_gemma":0.000009884807,"teacher_disagreement_score":0.9041268,"about_ca_system_score_codex":0.00040318776,"about_ca_system_score_gemma":0.0001258873,"threshold_uncertainty_score":0.44179624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30395538,0.0000042789984,0.69058627,0.00013300644,0.00020733112,0.00013259023,4.85336e-7,0.000021970185,0.0049586804],"genre_scores_gemma":[0.99564856,0.0000020097034,0.004007654,0.000060788698,0.00019630641,0.0000032228756,0.000028304597,0.000008882968,0.00004428276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887806,0.000056116416,0.0006166588,0.00010537433,0.00017507095,0.00016872317],"domain_scores_gemma":[0.99909234,0.00023340456,0.0004276198,0.00007406891,0.00013577234,0.00003679877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040987253,0.000114852664,0.00016494971,0.0004040947,0.00027759548,0.00008424581,0.000091767215,0.000047213194,0.00001365697],"category_scores_gemma":[0.000069496105,0.00010365577,0.00009077681,0.0003861751,0.000016914162,0.00030272847,0.000019434812,0.00061437243,0.0000013526724],"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.000028739181,0.000031443844,0.017718747,0.000007570261,0.000010323292,2.0850342e-7,0.00021614465,0.72607404,0.00031479757,0.0052236584,0.0000057894104,0.25036854],"study_design_scores_gemma":[0.0008402559,0.00008676538,0.010640349,0.00042258517,0.000008449888,0.0000012346429,0.00021122469,0.9830372,0.0024267875,0.0019600757,0.00025247445,0.00011263842],"about_ca_topic_score_codex":0.00004266316,"about_ca_topic_score_gemma":0.000003959314,"teacher_disagreement_score":0.6916932,"about_ca_system_score_codex":0.00006275772,"about_ca_system_score_gemma":0.00011622161,"threshold_uncertainty_score":0.42269596},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5965316,0.000034335164,0.39231026,0.0004898363,0.00033811,0.00017893256,9.499053e-7,0.00024908528,0.009866834],"genre_scores_gemma":[0.9977371,0.0000020319806,0.0016869913,0.00043734052,0.000071891845,0.0000026388207,0.000001837633,0.000011009063,0.0000491675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991618,0.000007544354,0.0003845437,0.00006511495,0.00016259147,0.00021841034],"domain_scores_gemma":[0.9995413,0.00011591845,0.00007843007,0.00011484748,0.00011302354,0.00003652674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037470364,0.00010953485,0.00010240466,0.00012518541,0.0003776539,0.00015015806,0.00014625359,0.00003348026,0.0000060933676],"category_scores_gemma":[0.000026315885,0.0000685276,0.00003596152,0.00044022617,0.000026300671,0.00017732683,0.000009010055,0.0005337693,0.000007836605],"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.000008741703,0.000008831845,0.0011215593,0.000024458295,0.000052102067,0.0000039959323,0.0009238926,0.9489223,0.00011070172,0.01238029,0.00011393196,0.036329236],"study_design_scores_gemma":[0.001960319,0.0001771665,0.06760145,0.0020815332,0.00006639444,0.00017145801,0.0019234294,0.91747653,0.0006926363,0.002031111,0.005302656,0.0005152912],"about_ca_topic_score_codex":0.0000032592375,"about_ca_topic_score_gemma":0.000010802436,"teacher_disagreement_score":0.40120545,"about_ca_system_score_codex":0.00008282289,"about_ca_system_score_gemma":0.000058629026,"threshold_uncertainty_score":0.29046467},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041286446,0.00038950908,0.9550745,0.00017343771,0.000511055,0.00034050125,0.0000056055915,0.00014531105,0.0020736484],"genre_scores_gemma":[0.51353526,0.000049487226,0.4856989,0.00031218483,0.00019788438,0.0000079490665,0.0000016258269,0.000033601922,0.00016306636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986187,0.00011853472,0.00060893025,0.00014845676,0.00014561244,0.0003597737],"domain_scores_gemma":[0.9973341,0.0020989361,0.00016283216,0.00016032375,0.00015001414,0.000093790375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022019704,0.00021644478,0.00027151598,0.00015582192,0.0006758473,0.00041521338,0.00021572247,0.000069754475,0.0000062357026],"category_scores_gemma":[0.00043650967,0.00015373951,0.000097940254,0.0003174567,0.000044967623,0.00019174989,0.000059384434,0.00062234554,8.8666775e-7],"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.000017505497,0.000004514254,0.0002392218,0.000085736865,0.000095251664,0.0000024662336,0.0016669977,0.769721,0.0003892638,0.0018315947,0.00005565105,0.22589082],"study_design_scores_gemma":[0.0008846493,0.000057375983,0.0005513107,0.00029230153,0.000036606492,0.000039163435,0.00046373604,0.99180865,0.001672263,0.0007331233,0.003285248,0.00017555703],"about_ca_topic_score_codex":0.0000033328151,"about_ca_topic_score_gemma":0.0000014535669,"teacher_disagreement_score":0.47224885,"about_ca_system_score_codex":0.00011508081,"about_ca_system_score_gemma":0.00005822881,"threshold_uncertainty_score":0.62693155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9180105,0.0000035599535,0.07635998,0.0018232961,0.0010651934,0.00011998917,0.0000012750473,0.0000065980967,0.0026096492],"genre_scores_gemma":[0.9993633,7.874301e-7,0.000041853145,0.0001806308,0.00017006313,5.495582e-7,5.063592e-7,0.000002496314,0.00023979762],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999417,0.00005156773,0.00024663287,0.000049589573,0.00011911947,0.00011610083],"domain_scores_gemma":[0.99936175,0.00013246815,0.00019411846,0.00009575867,0.0001937033,0.000022181912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054873177,0.00005582313,0.00007185007,0.00003474524,0.00065026694,0.00012747009,0.00011506459,0.00001956378,0.0000022105717],"category_scores_gemma":[0.000045750567,0.00003169087,0.00007637526,0.0002394886,0.00002599281,0.000074581,0.000063299434,0.00023703746,0.0000027044184],"study_design_candidate":"observational","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.00010294481,0.00007544738,0.095664546,0.000013101616,0.00020672698,5.919504e-7,0.0012787466,0.10124775,0.0019696085,0.1899707,0.0027404227,0.6067294],"study_design_scores_gemma":[0.0009751317,0.00015612437,0.701643,0.00067519245,0.000041942523,0.000008681697,0.00094140734,0.23516455,0.013738962,0.034264147,0.0120634865,0.00032737825],"about_ca_topic_score_codex":0.00015236405,"about_ca_topic_score_gemma":0.000012429743,"teacher_disagreement_score":0.60640204,"about_ca_system_score_codex":0.000039590035,"about_ca_system_score_gemma":0.00008628248,"threshold_uncertainty_score":0.5001393},"labels":[],"label_agreement":null}]}