{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":175,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":175,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"ea44e4221b41","filters":{"venue":"Les Cahiers du GERAD"}},"results":[{"id":"W2763534418","doi":"","title":"TestU01: A C Library for Empirical Testing of Random Number Generators","year":2006,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Random number generation; Generator (circuit theory); Random testing; Statistical hypothesis testing; Class (philosophy); Pseudorandom number generator; Software; Point (geometry); Random seed; Function (biology); Algorithm; Test case; Programming language; Mathematics; Artificial intelligence; Statistics; Machine learning; Power (physics)","authors":[{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"Richard Simard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02783251239958681,"gpt":0.2516446497586241,"spread":0.2238121373590373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006486413,0.003099282,0.001408155,0.004796321,0.0007779541,0.002963678,0.005424812,0.001852584,0.04046169],"category_scores_gemma":[0.05563008,0.0015127,0.001676782,0.002730402,0.001541344,0.002912118,0.002399559,0.003098526,0.02284907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001413357,"about_ca_system_score_gemma":0.004121558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00345209,"about_ca_topic_score_gemma":0.002947735,"domain_scores_codex":[0.991805,0.002770327,0.001028762,0.0008758929,0.003032306,0.0004877801],"domain_scores_gemma":[0.9668697,0.02372308,0.002027198,0.003313623,0.00363145,0.0004349629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001172678,0.0003505238,0.007063142,0.003665626,0.0005709244,0.001269256,0.0003768965,0.09084658,0.01033439,0.05267297,0.3256477,0.5060294],"study_design_scores_gemma":[0.000829693,0.0005241417,0.00433681,0.001269812,0.0001910242,0.002193131,0.0001101263,0.5563021,0.04805021,0.08563577,0.3001384,0.0004188251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.002867775,0.0007110747,0.8319346,0.0002485467,0.0002142515,0.0005616315,0.006259048,0.1490038,0.008199248],"genre_scores_gemma":[0.07214488,0.001457036,0.8303279,0.001535313,0.0003504941,0.006514322,0.02327507,0.05331267,0.01108223],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.04046169,"threshold_uncertainty_score":0.1353579,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"not_applicable","genre":"software","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2615971611","doi":"","title":"From non-cooperative CO2 abatement strategies to the optimal world cooperation: Results from the integrated MARKAL model","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Damages; Externality; Work (physics); Payment; Order (exchange); Economics; Operations research; sort; Distribution (mathematics); Climate change; Welfare economics; Climate policy; Environmental economics; Business; Computer science; Microeconomics; Engineering; Political science; Finance; Mathematics; Ecology","authors":[{"name":"Maryse Labriet","is_ca":false},{"name":"Richard Loulou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04946418448940374,"gpt":0.2439324537192583,"spread":0.1944682692298546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818523,0.0007304936,0.0009586521,0.0004943961,0.0007370776,0.00267831,0.001583613,0.001220647,0.004849509],"category_scores_gemma":[0.005696493,0.0004267237,0.001114995,0.0006056747,0.002409508,0.003185735,0.002667974,0.001318898,0.0004407947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001970049,"about_ca_system_score_gemma":0.001411433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006141785,"about_ca_topic_score_gemma":0.003109666,"domain_scores_codex":[0.9992555,0.0003005015,0.00002286296,0.0001208351,0.0001131096,0.0001871157],"domain_scores_gemma":[0.998218,0.0007679971,0.0004102646,0.0001860846,0.0001706272,0.0002469489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007091469,0.00005356348,0.0004802121,0.00004199213,0.00004779781,0.0001152444,0.0002503485,0.5379601,0.0005769094,0.4560749,0.000695509,0.003632444],"study_design_scores_gemma":[0.00002986306,0.00002629917,0.0002330323,0.00001068418,0.00002067104,0.00002056575,0.0001297236,0.7072037,0.0001501027,0.2913048,0.0008592418,0.00001140253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.412807,0.000392413,0.5129845,0.001808692,0.00003986821,0.00008678404,0.0002189814,0.000139549,0.07152228],"genre_scores_gemma":[0.9861218,0.000216786,0.00915157,0.00008688868,0.00001367032,0.00005004757,0.00005985512,0.00002981107,0.004269424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006141785,"threshold_uncertainty_score":0.01622325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2737156094","doi":"","title":"Distance Spectra of Graphs: A Survey","year":2013,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Distance matrix; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Matrix (chemical analysis); Graph; Characteristic polynomial; Connectivity; Adjacency matrix; Spectrum of a matrix; Discrete mathematics; Polynomial; Matrix differential equation; Mathematical analysis; Physics","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01841714372619972,"gpt":0.2425618766600535,"spread":0.2241447329338538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654456,0.000833382,0.001052314,0.005594629,0.0008767633,0.002648034,0.001274218,0.001285533,0.003765736],"category_scores_gemma":[0.003681102,0.0006682663,0.0006715466,0.006561927,0.002044749,0.004856412,0.001847864,0.001967154,0.001138912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529616,"about_ca_system_score_gemma":0.0006275893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00107014,"about_ca_topic_score_gemma":0.0004185616,"domain_scores_codex":[0.9988236,0.0002463289,0.00007123912,0.0003781896,0.0003834264,0.000097321],"domain_scores_gemma":[0.9972367,0.001827122,0.0001790463,0.000202999,0.0004039863,0.0001501837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007305443,0.000147904,0.002309148,0.002515376,0.00008854384,0.0002837174,0.0005857827,0.0106143,0.002101938,0.7113343,0.01106129,0.2588847],"study_design_scores_gemma":[0.00001973202,0.0001025052,0.002250258,0.000603057,0.00003654176,0.001702048,0.0004127475,0.01990431,0.001313237,0.8258314,0.1477676,0.0000565205],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.07001761,0.6895352,0.1456977,0.005455012,0.001203771,0.00005959676,0.0005660575,0.0002784506,0.08718662],"genre_scores_gemma":[0.5078903,0.4287066,0.04787652,0.001488903,0.004882903,0.00009250749,0.0007646272,0.0002109381,0.008086684],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.005594629,"threshold_uncertainty_score":0.01259762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2740520909","doi":"","title":"Symmetry in Scheduling Problems","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Scheduling (production processes); Symmetry breaking; Computer science; Fair-share scheduling; Symmetry operation; Symmetry group; Mathematical optimization; Mathematics; Symmetry (geometry); Physics; Geometry; Quantum mechanics; Schedule","authors":[{"name":"Miguel F. Anjos","is_ca":false},{"name":"James Ostrowski","is_ca":false},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005442328154904626,"gpt":0.1913245976086306,"spread":0.185882269453726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004961518,0.001362731,0.001564652,0.0007872573,0.001486421,0.00257831,0.001352894,0.001542313,0.006724938],"category_scores_gemma":[0.01371028,0.000563389,0.00174212,0.001866415,0.00232038,0.00338712,0.002004535,0.003567296,0.001492792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00131738,"about_ca_system_score_gemma":0.002112554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158931,"about_ca_topic_score_gemma":0.0009378966,"domain_scores_codex":[0.9957049,0.002271385,0.0002710489,0.0005777635,0.0008313163,0.0003434478],"domain_scores_gemma":[0.9940464,0.004249135,0.0004512071,0.0006732231,0.0003621967,0.0002176907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001304693,0.00009498597,0.0006882232,0.0002921182,0.00006581614,0.0001907789,0.0001906868,0.1333097,0.0009786802,0.8067471,0.007817806,0.04949359],"study_design_scores_gemma":[0.00006538157,0.00005486768,0.000119726,0.00002942003,0.00001359436,0.00009881421,0.0000524975,0.1408539,0.0004544151,0.8496989,0.008545389,0.00001303147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02186114,0.00166407,0.9528912,0.001612248,0.000361647,0.0002333533,0.0004592527,0.0001912514,0.02072587],"genre_scores_gemma":[0.5214877,0.004833604,0.4563423,0.0006804222,0.001578718,0.0006619705,0.001566224,0.0002857755,0.01256324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006724938,"threshold_uncertainty_score":0.02623934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2595487535","doi":"","title":"Free-Weighting Matrices Delay-Dependent Stabilization for Systems with Time-Varying Delays","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Control theory (sociology); Weighting; Stability (learning theory); Mathematics; Controller (irrigation); Differentiable function; State (computer science); Linear matrix inequality; Full state feedback; Control (management); Computer science; Mathematical optimization; Algorithm; Mathematical analysis","authors":[{"name":"El‐Kébir Boukas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006288282370067524,"gpt":0.1885780964475731,"spread":0.1822898140775056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003972419,0.0008093686,0.0003756238,0.0003221243,0.0002625748,0.0005895413,0.000483713,0.0004604595,0.001256665],"category_scores_gemma":[0.001219781,0.0001965543,0.0003473981,0.0003830383,0.0004104606,0.0008361907,0.0004606928,0.00043786,0.0001677455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004549426,"about_ca_system_score_gemma":0.0003550322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001628813,"about_ca_topic_score_gemma":0.001651881,"domain_scores_codex":[0.9997248,0.00005278201,0.00001887114,0.00006833777,0.000106727,0.00002847721],"domain_scores_gemma":[0.9996202,0.0001419644,0.00008057275,0.00003289858,0.0001137214,0.00001071793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002571003,0.00005426434,0.0004649306,0.0004372122,0.0001155703,0.0003294626,0.0002381826,0.6737059,0.1156971,0.1313056,0.0009196347,0.07647486],"study_design_scores_gemma":[0.00002248705,0.0001146082,0.0002379183,0.00001177996,0.00002216683,0.00004358949,0.00001691192,0.9701635,0.008775,0.01811728,0.002460774,0.0000138493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03597835,0.0006261913,0.9608334,0.00007215042,0.00007167815,0.00002495297,0.00002747546,0.0001234841,0.00224223],"genre_scores_gemma":[0.9496601,0.00086368,0.04360524,0.00005207411,0.00005649163,0.000102372,0.0001046153,0.00003347586,0.005521991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001628813,"threshold_uncertainty_score":0.004203975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2610662316","doi":"","title":"Comparison of ILP Formulations for the RWA Problem","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Routing and wavelength assignment; Integer programming; Linear programming; Mathematical optimization; Routing (electronic design automation); Upper and lower bounds; Node (physics); Linear programming relaxation; Blocking (statistics); Relaxation (psychology); Constraint (computer-aided design); Path (computing); Mathematics; Computer science; Integer (computer science); Column generation; Wavelength-division multiplexing; Wavelength; Computer network","authors":[{"name":"Brigitte Jaumard","is_ca":true},{"name":"Christophe Meyer","is_ca":true},{"name":"Babacar Thiongane","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01512946261043924,"gpt":0.2576109519753498,"spread":0.2424814893649106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01062072,0.002837152,0.00205605,0.002355816,0.0009623208,0.004180268,0.002919537,0.002525163,0.006370319],"category_scores_gemma":[0.02407288,0.001156678,0.002484968,0.003862764,0.001117652,0.004646823,0.002056465,0.005385594,0.001522844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002870034,"about_ca_system_score_gemma":0.002763405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219677,"about_ca_topic_score_gemma":0.001536895,"domain_scores_codex":[0.9896763,0.005803186,0.0006601248,0.0006267981,0.002564696,0.0006688566],"domain_scores_gemma":[0.9778202,0.01748825,0.001129554,0.001275388,0.002006325,0.0002803349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005839461,0.0005188551,0.0006703648,0.001482772,0.0001963441,0.0001265349,0.0002929262,0.649823,0.001825663,0.1038992,0.009797325,0.2307831],"study_design_scores_gemma":[0.0001843518,0.0004097149,0.0005380426,0.000539579,0.0001075137,0.0001932477,0.0003853431,0.9093396,0.002801593,0.06105336,0.02438744,0.00006026024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02002234,0.01692383,0.9225975,0.002503859,0.0006698722,0.0004619027,0.0005594184,0.0009192424,0.03534206],"genre_scores_gemma":[0.1372123,0.01732503,0.8367016,0.001131945,0.0004933918,0.001166129,0.001170899,0.0009747868,0.003823982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062072,"threshold_uncertainty_score":0.05616838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626220413","doi":"","title":"Random Number Generators Based on Linear Recurrences in F 2 w","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Random number generation; Mathematics; Finite field; Computation; Integer (computer science); Pseudorandom number generator; Field (mathematics); Implementation; Discrete mathematics; Algorithm; Arithmetic; Computer science; Pure mathematics; Programming language","authors":[{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"François Panneton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007120415479881766,"gpt":0.2163641202678856,"spread":0.2092437047880038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648878,0.000555156,0.0005701198,0.0008551262,0.0003968214,0.000978902,0.0009432569,0.000487321,0.005017332],"category_scores_gemma":[0.005662372,0.0003175884,0.0005198712,0.0006238522,0.001096546,0.003543128,0.0009455983,0.0007349201,0.001786582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005374188,"about_ca_system_score_gemma":0.0003922393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001521518,"about_ca_topic_score_gemma":0.0002722265,"domain_scores_codex":[0.9986733,0.0005774265,0.0001002113,0.0001781139,0.0002865379,0.0001843795],"domain_scores_gemma":[0.9977354,0.001333753,0.0002972263,0.0004271267,0.000148619,0.00005786918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005774242,0.0001160789,0.001357044,0.0001814994,0.00003783128,0.0004593568,0.0004615447,0.04338798,0.02935065,0.7651371,0.002186424,0.1567471],"study_design_scores_gemma":[0.0004532587,0.001056865,0.0007530436,0.0002026025,0.0000756649,0.001498263,0.0001501136,0.3535773,0.1048279,0.4940317,0.04317001,0.0002032735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09213138,0.0004543585,0.8940157,0.0003026126,0.0001072248,0.0002380987,0.0001040015,0.001555418,0.01109124],"genre_scores_gemma":[0.6756056,0.000379783,0.3152743,0.0001564797,0.0001339007,0.0003656035,0.0002246833,0.0002625427,0.007597033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005017332,"threshold_uncertainty_score":0.01678467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2298578325","doi":"","title":"Time Consistency in Cooperative Differential Games: A Tutorial","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Consistency (knowledge bases); Rationality; Sign (mathematics); Outcome (game theory); Perspective (graphical); Time consistency; Mathematical economics; Stability (learning theory); Work (physics); Positive economics; Sequential game; Economics; Computer science; Epistemology; Game theory; Political science; Mathematics; Actuarial science; Law; Engineering; Artificial intelligence","authors":[{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009973262620927178,"gpt":0.2066823363532441,"spread":0.1967090737323169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001499009,0.001824615,0.001588733,0.001546923,0.0005602809,0.002102673,0.001024169,0.002026111,0.009579195],"category_scores_gemma":[0.002605117,0.0007412413,0.00147821,0.002530973,0.001792151,0.004746042,0.001226295,0.00357324,0.003039223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924684,"about_ca_system_score_gemma":0.0008785462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003120188,"about_ca_topic_score_gemma":0.001910477,"domain_scores_codex":[0.9995164,0.0002101384,0.00003658762,0.00007557857,0.0001085555,0.00005284524],"domain_scores_gemma":[0.9985313,0.001262176,0.00004240084,0.00003842528,0.00008444888,0.00004122753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002460961,0.0001396841,0.0003447238,0.0008571939,0.00004929469,0.0003199395,0.0005559415,0.008627022,0.0006905969,0.8709936,0.03709155,0.08030596],"study_design_scores_gemma":[0.00002463371,0.0001015723,0.0007806147,0.0005578938,0.00004599831,0.0005002189,0.0001915989,0.02117172,0.0002744259,0.7194575,0.2568325,0.00006145394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007466678,0.3231782,0.4210598,0.008836539,0.003692707,0.0002338942,0.000579901,0.0005266992,0.2344256],"genre_scores_gemma":[0.208508,0.4171157,0.2576905,0.007117442,0.01503963,0.001673487,0.001426359,0.0005552857,0.09087362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009579195,"threshold_uncertainty_score":0.03204554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612945519","doi":"","title":"Snow Water Equivalent Estimation Using Blackbox Optimization","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cryospheric studies and observations","field":"Earth and Planetary Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Kriging; Interpolation (computer graphics); Computer science; Set (abstract data type); Snow; Mathematical optimization; Algorithm; Data mining; Machine learning; Mathematics; Artificial intelligence; Meteorology","authors":[{"name":"Charles Audet","is_ca":false},{"name":"Sébastien Le Digabel","is_ca":false},{"name":"Vincent Garnier","is_ca":false},{"name":"Stéphane Alarie","is_ca":false},{"name":"Louis‐Alexandre Leclaire","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04037595506049975,"gpt":0.2090440136102995,"spread":0.1686680585497998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008326775,0.0006029837,0.0009941818,0.0004124191,0.0003557341,0.0008309298,0.000790248,0.0009504998,0.002454955],"category_scores_gemma":[0.0024241,0.0004294255,0.0005370106,0.0003072681,0.0006081568,0.0006244013,0.0008225651,0.0004843818,0.0002562321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005784188,"about_ca_system_score_gemma":0.001050532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0116706,"about_ca_topic_score_gemma":0.006806329,"domain_scores_codex":[0.9997749,0.0001098111,0.000008809305,0.00003742132,0.00004058929,0.0000284989],"domain_scores_gemma":[0.9989901,0.0006872551,0.00009978054,0.0000628152,0.0001166976,0.0000433356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002081702,0.000006428715,0.0001846149,0.000005893967,0.000006006685,0.000009570047,0.000006259644,0.9974483,0.000262654,0.0004002189,0.00004487934,0.001604425],"study_design_scores_gemma":[0.000004025173,0.000004352283,0.00002056856,8.856513e-7,6.367194e-7,6.640165e-7,0.00000181234,0.9996325,0.0001061365,0.0001902485,0.00003743323,6.373974e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1786195,0.0001025393,0.8137671,0.0002085931,0.00003092498,0.0001122011,0.0002890725,0.00070843,0.006161501],"genre_scores_gemma":[0.8535132,0.0000623376,0.1432765,0.00007614141,0.000009038313,0.0001894281,0.0002639675,0.00011551,0.002493765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0116706,"threshold_uncertainty_score":0.02320534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125688599","doi":"","title":"Estimating Merton's Model by Maximum Likelihood with Survivorship Consideration","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Econometrics; Maximum likelihood; Estimator; Portfolio; Asset (computer security); Volatility (finance); Principle of maximum entropy; Economics; Context (archaeology); Statistics; Quasi-maximum likelihood; Maximum likelihood sequence estimation; Actuarial science; Likelihood function; Mathematics; Computer science; Financial economics; Geography","authors":[{"name":"Geneviève Gauthier","is_ca":true},{"name":"Sophia Zaanoun","is_ca":false},{"name":"Jin‐Chuan Duan","is_ca":true},{"name":"Jean‐Guy Simonato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0136680524459141,"gpt":0.1902529074875091,"spread":0.176584855041595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007885674,0.0006908463,0.001568294,0.00170609,0.0006816744,0.001886673,0.002299527,0.001966326,0.003150076],"category_scores_gemma":[0.02910868,0.000832691,0.001328541,0.001901719,0.001210229,0.003429513,0.001725891,0.002202339,0.0006612584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136054,"about_ca_system_score_gemma":0.001061194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004899616,"about_ca_topic_score_gemma":0.003655928,"domain_scores_codex":[0.9973949,0.001475704,0.0001400825,0.0004210999,0.0004188801,0.000149322],"domain_scores_gemma":[0.9845957,0.01288375,0.001051103,0.0007551723,0.0005851999,0.0001290065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008053848,0.00006307206,0.01367464,0.0001011776,0.0001145371,0.0003938352,0.0003897039,0.7742181,0.0005004901,0.1366557,0.001512377,0.07229588],"study_design_scores_gemma":[0.00001248632,0.00002518876,0.001519929,0.00002059679,0.00001403271,0.0001238247,0.00004604239,0.9130483,0.0002805662,0.08392297,0.0009571619,0.00002895136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04658337,0.0003605315,0.9504982,0.0004792958,0.00001456255,0.0000641774,0.0001314282,0.0001729556,0.001695457],"genre_scores_gemma":[0.668887,0.0008527315,0.3218479,0.0001701285,0.00009423303,0.0003985417,0.0006335216,0.0001251851,0.006990711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007885674,"threshold_uncertainty_score":0.04170394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2341460036","doi":"","title":"Dynamic Games in the Economics and Management of Pollution","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Economics; Computer science; Mathematical economics; Natural resource economics; Environmental economics","authors":[{"name":"Steffen Jørgensen","is_ca":false},{"name":"Guiomar Martín‐Herrán","is_ca":false},{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02477159939371,"gpt":0.2164943592572278,"spread":0.1917227598635177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598109,0.0009716779,0.001104237,0.0009548817,0.0008405597,0.003135184,0.001350902,0.002151395,0.002900057],"category_scores_gemma":[0.003439653,0.000530071,0.0008598935,0.001653939,0.003357263,0.003753963,0.001302882,0.002444475,0.0002544301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003258893,"about_ca_system_score_gemma":0.002304508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009092819,"about_ca_topic_score_gemma":0.00738919,"domain_scores_codex":[0.9982101,0.001129596,0.00006911036,0.0001217746,0.0003178849,0.0001515949],"domain_scores_gemma":[0.9980205,0.001557187,0.0001527359,0.00006304017,0.000112149,0.00009433328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001025828,0.0000269753,0.0001427487,0.00006680987,0.00002279838,0.00003799986,0.00006691527,0.06833684,0.0001145938,0.9246663,0.001376853,0.005130875],"study_design_scores_gemma":[0.00001650876,0.0000194049,0.0001356525,0.0000453021,0.000008669449,0.00001767696,0.00008801653,0.06992913,0.00007492347,0.9210308,0.008619878,0.00001415201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03253794,0.03735252,0.7851199,0.02315228,0.00103418,0.0001432769,0.0002729046,0.00009557645,0.1202915],"genre_scores_gemma":[0.8697002,0.04545695,0.0604157,0.001770524,0.001247219,0.0002471409,0.0001287421,0.00004521046,0.02098828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009092819,"threshold_uncertainty_score":0.0236451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3124869028","doi":"","title":"Optimal Hedging in Discrete and Continuous Time","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Martingale (probability theory); Discrete time and continuous time; Measure (data warehouse); Geometric Brownian motion; Mathematics; Markov process; Mathematical optimization; Brownian motion; Lévy process; Absolute continuity; Applied mathematics; Economics; Computer science; Diffusion process; Mathematical analysis","authors":[{"name":"Bruno Rémillard","is_ca":true},{"name":"Sylvain Rubenthaler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006613941624739147,"gpt":0.1876960247841938,"spread":0.1810820831594546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002140549,0.0006915728,0.001107264,0.0005835537,0.0003147673,0.001917212,0.0007663786,0.001530137,0.002451524],"category_scores_gemma":[0.00626377,0.0006215362,0.0006463779,0.0005813069,0.001733059,0.002517045,0.0009031813,0.001308696,0.0001523859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105756,"about_ca_system_score_gemma":0.0009559946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001494662,"about_ca_topic_score_gemma":0.0009654817,"domain_scores_codex":[0.9992706,0.0002886272,0.00004270137,0.0001767807,0.0001514669,0.00006979812],"domain_scores_gemma":[0.9982833,0.001259415,0.0001555592,0.00009875988,0.000110432,0.00009263919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001050147,0.0001089575,0.0007547474,0.000139965,0.00006733325,0.000139626,0.0001157414,0.7683968,0.002254147,0.205281,0.0006606231,0.02197607],"study_design_scores_gemma":[0.00002816188,0.00005194628,0.0002183935,0.00001597429,0.00001246299,0.00002568535,0.00002680757,0.910789,0.0005558134,0.08772285,0.0005375651,0.00001531145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1033644,0.001456817,0.8887601,0.0007772567,0.0001163623,0.00004050344,0.00005384754,0.00009346844,0.005337249],"genre_scores_gemma":[0.9118055,0.0008083847,0.08276651,0.0001277831,0.00006848104,0.00005889742,0.00007956701,0.00004300205,0.004241832],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002451524,"threshold_uncertainty_score":0.01132047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2747220382","doi":"","title":"Variable Neighborhood Search for the Maximum Clique","year":2001,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristic; Mathematics; Clique; Variable neighborhood search; Greedy algorithm; Clique problem; Vertex (graph theory); Mathematical optimization; Simplicity; Variable (mathematics); Combinatorics; Algorithm; Metaheuristic; Graph; Chordal graph","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dragan Urošević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01852289698079633,"gpt":0.2606074575649365,"spread":0.2420845605841402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751267,0.0003433766,0.0007308554,0.0006811169,0.0006017869,0.0005632403,0.0007916741,0.0006409104,0.003878164],"category_scores_gemma":[0.003170919,0.0002768003,0.000460829,0.001034698,0.0006814889,0.001067547,0.0009049368,0.000796826,0.0003986075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006358997,"about_ca_system_score_gemma":0.000835415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002486403,"about_ca_topic_score_gemma":0.003280127,"domain_scores_codex":[0.9995134,0.0002489163,0.000009254813,0.00008085593,0.00009779195,0.00004969561],"domain_scores_gemma":[0.9992905,0.0005064323,0.0000403033,0.00005556247,0.00007347618,0.00003374823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001287704,0.00008040743,0.0005719579,0.0001422916,0.00005234926,0.00006502135,0.00008190376,0.7417647,0.001832149,0.1376725,0.007754992,0.109853],"study_design_scores_gemma":[0.0000270713,0.00003287122,0.0001259452,0.00001172781,0.000006446121,0.00002861621,0.00001358734,0.9463064,0.0004112888,0.05035837,0.002671276,0.000006278838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0218722,0.0007151221,0.9691187,0.0003105642,0.00004993678,0.00007111351,0.00009963007,0.0002387425,0.00752406],"genre_scores_gemma":[0.4953447,0.0006589579,0.4961888,0.0002139663,0.0001138923,0.0003692402,0.000527454,0.0001999577,0.006382972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003878164,"threshold_uncertainty_score":0.01297379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2299216252","doi":"","title":"A Fast and Accurate Algorithm for Stochastic Integer Programming, Applied to Stochastic Shift Scheduling","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Stochastic programming; Computer science; Scheduling (production processes); Heuristic; Integer programming; Dynamic programming; Column generation; Algorithm; Mathematics","authors":[{"name":"François Soumis","is_ca":true},{"name":"Rémi Pacqueau","is_ca":true},{"name":"Lê Nguyên Hoang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03724072600934392,"gpt":0.3240968000928531,"spread":0.2868560740835092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138536,0.001438922,0.0008902305,0.0008416721,0.0006604515,0.001171002,0.001085975,0.001213671,0.008426899],"category_scores_gemma":[0.004116989,0.0007629188,0.001115675,0.001384442,0.0005144015,0.001069223,0.001305997,0.002640589,0.003818689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000840919,"about_ca_system_score_gemma":0.002477121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003382709,"about_ca_topic_score_gemma":0.004646375,"domain_scores_codex":[0.9992174,0.0002347275,0.00005615877,0.0001263006,0.0002724843,0.00009289848],"domain_scores_gemma":[0.9988199,0.0006669204,0.00009124581,0.0001597111,0.0002243794,0.00003786796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000099889,0.0001100144,0.0005217578,0.0002274841,0.00006945176,0.0001164326,0.00009823931,0.5701098,0.006029204,0.04489892,0.01453273,0.3631861],"study_design_scores_gemma":[0.00004067234,0.00002469263,0.00007727984,0.0000163999,0.000006947442,0.00003900127,0.0000101591,0.9758464,0.00135401,0.01602187,0.006553249,0.00000927438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008541248,0.00005890185,0.9958994,0.00009118539,0.00004345395,0.00005309057,0.00007220819,0.001325672,0.001601994],"genre_scores_gemma":[0.02720631,0.000120022,0.9701629,0.00009658856,0.00004046949,0.0002889752,0.0002414784,0.0003906601,0.001452618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008426899,"threshold_uncertainty_score":0.02819079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2603607199","doi":"","title":"On a Conjecture About the Szeged Index","year":2009,"lang":"hu","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01203309259887551,"gpt":0.2524866901072873,"spread":0.2404535975084118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002842283,0.0004610461,0.001379669,0.002333928,0.002449508,0.004225939,0.001696227,0.002300755,0.008715075],"category_scores_gemma":[0.01424927,0.0004452127,0.001112661,0.002690851,0.007442104,0.009774498,0.003127055,0.004095129,0.001440033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001917227,"about_ca_system_score_gemma":0.0007580799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001336508,"about_ca_topic_score_gemma":0.0007119224,"domain_scores_codex":[0.9978569,0.0003923973,0.0001194512,0.0006238497,0.0005894408,0.0004179247],"domain_scores_gemma":[0.9889292,0.006970678,0.0009408871,0.001625574,0.0008846136,0.0006490409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000156757,0.00003364461,0.001526771,0.00004770371,0.00001420524,0.00007656254,0.0004269868,0.001332105,0.0005767398,0.9806247,0.00655234,0.008631431],"study_design_scores_gemma":[0.00003358439,0.00002673177,0.0008870382,0.00002263518,0.00001309759,0.0001069764,0.0001678573,0.003569094,0.0006399481,0.9890698,0.005441315,0.00002180943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6379879,0.004966643,0.1182558,0.0400799,0.002084854,0.000076466,0.001240391,0.0006654255,0.1946426],"genre_scores_gemma":[0.9816404,0.001144194,0.007942101,0.001705041,0.001115519,0.00005140757,0.0005222207,0.00008698144,0.005792092],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008715075,"threshold_uncertainty_score":0.02915478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2614002522","doi":"","title":"Benders Decomposition for Production Routing under Demand Uncertainty","year":2012,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Production (economics); Generalization; Routing (electronic design automation); Pareto principle; Upper and lower bounds; Product (mathematics); Time horizon; Branch and bound; Decomposition; Branch and cut; Computer science; Mathematics; Operations research; Linear programming; Economics","authors":[{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Raf Jans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01087848835570577,"gpt":0.2320001241922547,"spread":0.2211216358365489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137014,0.001951971,0.001244414,0.001176303,0.0005640249,0.001458558,0.0008508498,0.001423254,0.008068828],"category_scores_gemma":[0.002625377,0.00115504,0.001645708,0.001348933,0.0007855956,0.001632032,0.001018782,0.002469988,0.001137046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001996391,"about_ca_system_score_gemma":0.001765107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004747116,"about_ca_topic_score_gemma":0.004068462,"domain_scores_codex":[0.999067,0.0004062631,0.00004128625,0.0001280118,0.0002354874,0.0001219999],"domain_scores_gemma":[0.9992386,0.0004521824,0.000104966,0.00005197812,0.0001047738,0.0000474867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003236571,0.00002613238,0.000135063,0.00006074505,0.00002665201,0.00004545926,0.00003792935,0.9069003,0.0008267257,0.07756744,0.001322625,0.0130185],"study_design_scores_gemma":[0.00001121148,0.00001463238,0.00006323472,0.00001303539,0.000007815132,0.00001023511,0.00001094817,0.9251826,0.0002051413,0.0728291,0.001645423,0.000006672904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005237754,0.0003264211,0.9875088,0.0002568545,0.00003784773,0.00006445998,0.0002273076,0.000118947,0.006221547],"genre_scores_gemma":[0.2633058,0.002162861,0.7082476,0.0003029374,0.0002237573,0.0007974156,0.001426398,0.0003223997,0.02321071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008068828,"threshold_uncertainty_score":0.02699292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2339305992","doi":"","title":"A Proximal Trust-Region Algorithm for Column Generation Stabilization","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Trust region; Convergence (economics); Column (typography); Mathematical optimization; Generalization; Context (archaeology); Scheduling (production processes); Algorithm; Cutting-plane method; Dimension (graph theory); Point (geometry); Computer science; Mathematics; Combinatorics; Connection (principal bundle); Geometry; Computer network","authors":[{"name":"Hatem Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01847488940365453,"gpt":0.2346610234084591,"spread":0.2161861340048046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162991,0.000761739,0.0009912197,0.000609039,0.0004139748,0.000721053,0.001236058,0.0009095667,0.00296059],"category_scores_gemma":[0.003009645,0.0004801285,0.0007045862,0.0006558785,0.000982788,0.0008963374,0.001277473,0.001650191,0.00102295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005849149,"about_ca_system_score_gemma":0.0009946664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002129971,"about_ca_topic_score_gemma":0.001121752,"domain_scores_codex":[0.9993795,0.0002054545,0.00002454336,0.0001096968,0.000220759,0.00005999934],"domain_scores_gemma":[0.9988753,0.0006243684,0.00009796803,0.0001135398,0.0002329955,0.00005568194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001484653,0.00005278309,0.0002172299,0.0001120551,0.00003954964,0.00007868221,0.00009619938,0.828328,0.006838337,0.03741759,0.002148855,0.1245223],"study_design_scores_gemma":[0.000009777663,0.00003477933,0.00002162754,0.000004044228,0.000004230312,0.00001861367,0.00000322697,0.9942316,0.001345581,0.00338322,0.000937098,0.000006148267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001138342,0.00003351935,0.9983413,0.00001695306,0.00001293179,0.00001350882,0.000005397877,0.0001082022,0.0003298731],"genre_scores_gemma":[0.2206017,0.0002337641,0.7741612,0.00008457708,0.00007382743,0.0002239996,0.0001360709,0.0002021567,0.004282749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00296059,"threshold_uncertainty_score":0.009904146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2615542916","doi":"","title":"Multi-Criteria Decision Analysis as an Innovative Approach to Managing Zoonoses: Results from a Study on Lyme Disease in Canada","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vector-borne infectious diseases","field":"Immunology and Microbiology","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Public Health Agency of Canada; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Psychological intervention; Multiple-criteria decision analysis; Disease surveillance; Lyme disease; Decision analysis; Risk analysis (engineering); Public health; Environmental resource management; Environmental health; Business; Management science; Medicine; Operations research; Engineering; Economics","authors":[{"name":"Cécile Aenishaenslin","is_ca":true},{"name":"Valérie Hongoh","is_ca":true},{"name":"Hassane Cissé","is_ca":true},{"name":"Anne Gatewood Hoen","is_ca":false},{"name":"Karim Samoura","is_ca":true},{"name":"Pascal Michel","is_ca":true},{"name":"Jean‐Philippe Waaub","is_ca":true},{"name":"Denise Bélanger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01299273276368908,"gpt":0.2503155618157183,"spread":0.2373228290520292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003724698,0.0007638223,0.0007016613,0.001029418,0.002659734,0.002166537,0.001149379,0.0007908224,0.002226736],"category_scores_gemma":[0.01044855,0.0002346471,0.0009107001,0.002338176,0.001175066,0.0005853075,0.000838261,0.00113694,0.0001547845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.04040332,"about_ca_system_score_gemma":0.04374163,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.972368,"about_ca_topic_score_gemma":0.9825842,"domain_scores_codex":[0.9977053,0.001102956,0.00008611195,0.0001464939,0.0006407532,0.0003184913],"domain_scores_gemma":[0.991322,0.005550332,0.0003443226,0.0001351403,0.001921846,0.0007263699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00481437,0.007322625,0.2170362,0.003133189,0.001060112,0.001501989,0.01081763,0.4357971,0.00306589,0.01088078,0.01475935,0.2898107],"study_design_scores_gemma":[0.001331588,0.004161954,0.2598359,0.0007797126,0.0005573516,0.0001535117,0.03758559,0.6662612,0.00201297,0.00466951,0.02227149,0.0003792949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9852155,0.001229593,0.002058283,0.001035695,0.00002176688,0.0006957019,0.000572143,0.0000239432,0.009147293],"genre_scores_gemma":[0.9885499,0.001224098,0.006894847,0.0001594247,0.000007146989,0.0001634516,0.0003478515,0.000009403692,0.002643806],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04040332,"threshold_uncertainty_score":0.293148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2625411102","doi":"","title":"Dual-optimal Inequalities for Stabilized Column Generation","year":2003,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Convergence (economics); Binary number; Degeneracy (biology)","authors":[{"name":"Hatem Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"José Valério de Carvalho","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02676783419656683,"gpt":0.2297629505321584,"spread":0.2029951163355916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002378881,0.001570328,0.0009691779,0.001428121,0.0006781359,0.001711234,0.001211631,0.001310248,0.007241246],"category_scores_gemma":[0.007931448,0.0006230462,0.001091838,0.001817698,0.001363748,0.001572554,0.001695525,0.003787384,0.001342132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001160374,"about_ca_system_score_gemma":0.001099583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001205156,"about_ca_topic_score_gemma":0.001174324,"domain_scores_codex":[0.9984764,0.0005967581,0.00007046697,0.0001820735,0.0005147772,0.000159466],"domain_scores_gemma":[0.9971903,0.001822841,0.0003076587,0.0002424976,0.0003537875,0.00008301315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002514432,0.0001640925,0.0003774224,0.0003707378,0.0000458418,0.00019418,0.0001420409,0.631429,0.008879194,0.2468228,0.008186663,0.1031367],"study_design_scores_gemma":[0.00003897303,0.00004226715,0.00006747113,0.000041149,0.00001147059,0.0000421149,0.00001165026,0.9445287,0.003281091,0.04864128,0.003281426,0.0000124176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004092523,0.0004308482,0.990728,0.0001783453,0.00007736235,0.00007740162,0.00009334743,0.0001925203,0.004129616],"genre_scores_gemma":[0.2641071,0.001319164,0.7259511,0.0005146278,0.0002614826,0.0007031633,0.0007468837,0.0002776836,0.006118911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007241246,"threshold_uncertainty_score":0.0242244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W11261568","doi":"10.1093/ps/80.3.358","title":"SyGMA: Reducing Symmetry in Graph Mining","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Limiting; Data mining; Task (project management); Graph; Efficient algorithm; Theoretical computer science; Symmetry (geometry); Algorithm; Mathematics; Engineering","authors":[{"name":"Christian Desrosiers","is_ca":true},{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Pierre Hansen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009793538500813591,"gpt":0.235508042000786,"spread":0.2257145034999724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004534991,0.002464208,0.002676118,0.004250359,0.001277665,0.002274342,0.004317385,0.002248898,0.01250169],"category_scores_gemma":[0.02003251,0.001309947,0.004100825,0.003661956,0.001740149,0.005955906,0.004847335,0.002959346,0.005567712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000962417,"about_ca_system_score_gemma":0.003320387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002501942,"about_ca_topic_score_gemma":0.005691234,"domain_scores_codex":[0.9955764,0.001495769,0.0003798045,0.001134394,0.001037318,0.0003764663],"domain_scores_gemma":[0.9897537,0.00508165,0.0007208199,0.003332513,0.0007364471,0.0003748579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001584238,0.0007276628,0.005732595,0.00120183,0.0004108888,0.0004472486,0.0005853897,0.04020261,0.009692667,0.02709682,0.07758872,0.8347292],"study_design_scores_gemma":[0.0006450356,0.0004356892,0.001648752,0.0001427478,0.0001200905,0.0004614141,0.0003734921,0.8091128,0.007125881,0.1503129,0.02956898,0.0000523249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03552407,0.001207013,0.9054959,0.001410751,0.0003373742,0.0006427392,0.004685547,0.04644389,0.004252706],"genre_scores_gemma":[0.07951525,0.0003313566,0.9066329,0.0004601289,0.0001359808,0.0005588325,0.007789745,0.001601321,0.002974555],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01250169,"threshold_uncertainty_score":0.04182231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612233487","doi":"","title":"Credit Migration and Derivatives Pricing Using Copulas","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"HEC Montréal","funders":"","keywords":"Copula (linguistics); Credit risk; Univariate; Credit derivative; Econometrics; Portfolio; Markov chain; Credit spread (options); Actuarial science; Economics; Multivariate statistics; Financial economics; Mathematics; Statistics","authors":[{"name":"Bruno Rémillard","is_ca":false},{"name":"Debbie J. Dupuis","is_ca":false},{"name":"Tony Berrada","is_ca":true},{"name":"Nicolas Papageorgiou","is_ca":true},{"name":"Éric Jacquier","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02357263630233594,"gpt":0.2172848257134393,"spread":0.1937121894111033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002330607,0.001170279,0.001015539,0.0009404679,0.0005098491,0.002266923,0.001257683,0.001322159,0.004395764],"category_scores_gemma":[0.008528382,0.0006364292,0.001372614,0.001452882,0.001718674,0.002565306,0.00111062,0.002360544,0.0006680103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001716333,"about_ca_system_score_gemma":0.001157028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01502004,"about_ca_topic_score_gemma":0.007515441,"domain_scores_codex":[0.9990735,0.0004867235,0.00003524371,0.0001327066,0.0001704867,0.0001014077],"domain_scores_gemma":[0.9979541,0.001188757,0.0003346062,0.000164694,0.0002138267,0.0001439331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002672812,0.00004381867,0.003145328,0.00008789056,0.00008345032,0.0003167089,0.0001878925,0.5159715,0.0007106909,0.4582806,0.004394685,0.01675082],"study_design_scores_gemma":[0.000007297985,0.0000114088,0.0008121507,0.00001890658,0.00001238598,0.00007167475,0.00003079096,0.8602481,0.00008064328,0.1373071,0.001383594,0.00001596835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04837727,0.00359476,0.9329045,0.001564525,0.000170957,0.00006539684,0.0002715475,0.0002431414,0.01280791],"genre_scores_gemma":[0.9291679,0.005137477,0.04575863,0.0002313604,0.0004389124,0.0001255734,0.000332842,0.0001503608,0.01865689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01502004,"threshold_uncertainty_score":0.02986521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2238815626","doi":"","title":"Luck Versus Skill in the Cross-Section of Ethical Mutual Funds","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Luck; Political science; Welfare economics; Economics; Philosophy","authors":[{"name":"Mohamed Ayadi","is_ca":false},{"name":"Hatem Ben‐Ameur","is_ca":false},{"name":"Lawrence Kryzanowski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05251479817020271,"gpt":0.2422400672287563,"spread":0.1897252690585536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006104571,0.0001740282,0.0002500232,0.001532685,0.0003778026,0.001281978,0.0003683005,0.0004046238,0.002311681],"category_scores_gemma":[0.02172904,0.0001429835,0.0003330888,0.0009580919,0.0008868019,0.0006310489,0.001078124,0.00038171,0.0002972166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001542989,"about_ca_system_score_gemma":0.0007885664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04655152,"about_ca_topic_score_gemma":0.0331794,"domain_scores_codex":[0.9982066,0.0005850163,0.00009985587,0.0002387572,0.0004080992,0.0004616696],"domain_scores_gemma":[0.9830843,0.008857775,0.00379484,0.001409891,0.001396545,0.001456615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002006797,0.00001891762,0.9883563,0.000005455455,0.00008551485,0.0001045329,0.0005387656,0.002835336,0.0002787019,0.001789855,0.0001600562,0.005625796],"study_design_scores_gemma":[0.000007722254,0.0001138838,0.9873173,0.000007752722,0.0000351724,0.00008880148,0.0006086979,0.009410548,0.0005187133,0.001301978,0.0005748908,0.00001459428],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9991385,0.00003666899,0.0002131763,0.00003193389,0.000001212375,0.000002772931,0.00003633031,0.000003349687,0.000536099],"genre_scores_gemma":[0.9991524,0.00002015393,0.00006580706,0.000007175813,0.000003324877,0.000002430431,0.00007391242,0.00000157271,0.0006731814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04655152,"threshold_uncertainty_score":0.09256113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2735767489","doi":"","title":"Operational Car Assignment at VIA Rail Canada","year":2000,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Transport and Economic Policies","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Transport engineering; Computer science; Engineering","authors":[{"name":"Jean‐François Cordeau","is_ca":false},{"name":"Guy Desaulniers","is_ca":false},{"name":"Jacques Desrosiers","is_ca":false},{"name":"François Soumis","is_ca":false},{"name":"Norbert Lingaya","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005411153842116133,"gpt":0.1513943057377581,"spread":0.145983151895642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003583038,0.0003131835,0.0002052921,0.001333794,0.006551065,0.001846992,0.0006670122,0.001127582,0.07450509],"category_scores_gemma":[0.001030826,0.000290721,0.0001705994,0.001183842,0.0005894745,0.0005642588,0.0007201841,0.000989196,0.007585841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01846876,"about_ca_system_score_gemma":0.02544549,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9264335,"about_ca_topic_score_gemma":0.9727392,"domain_scores_codex":[0.9991812,0.00004582688,0.00001054723,0.0001087256,0.0001835636,0.0004700166],"domain_scores_gemma":[0.9988117,0.00004434207,0.00002793189,0.00003998716,0.0006491663,0.0004268255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001790132,0.001214773,0.2046512,0.0001249555,0.0000494384,0.002387848,0.00878112,0.02581562,0.01664359,0.0201194,0.395177,0.3232449],"study_design_scores_gemma":[0.00007244785,0.0005712917,0.3239863,0.00005015048,0.00002513302,0.0002345123,0.01499698,0.01134221,0.004932414,0.001104398,0.6425758,0.0001082614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7432073,0.0001594093,0.002212973,0.003947455,0.0003613596,0.0003722655,0.004634313,0.00114923,0.2439557],"genre_scores_gemma":[0.4514256,0.00008632671,0.0007173484,0.0002405098,0.00003292219,0.00002186285,0.001141917,0.0001390336,0.5461944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07450509,"threshold_uncertainty_score":0.2492443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2602073264","doi":"","title":"On the Coordination of Dynamic Marketing Channels and Two-Part Tariffs","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Channel coordination; Channel (broadcasting); Marketing channel; Business; Microeconomics; Marketing; Industrial organization; Economics; Vertical integration; Computer science; Telecommunications; Supply chain","authors":[{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007713042120090302,"gpt":0.1793977276923881,"spread":0.1716846855722978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804897,0.000682222,0.001620235,0.000977275,0.001309747,0.003642948,0.001265263,0.001882671,0.01244938],"category_scores_gemma":[0.008843349,0.0007220787,0.001000493,0.00119915,0.003555253,0.004440525,0.002143381,0.0013673,0.0007900602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003265909,"about_ca_system_score_gemma":0.00208526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005282744,"about_ca_topic_score_gemma":0.003080645,"domain_scores_codex":[0.997501,0.001008207,0.00007498745,0.0004381095,0.0002894093,0.000688221],"domain_scores_gemma":[0.9905641,0.006117888,0.00159001,0.0005406087,0.0005117381,0.0006756026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002533277,0.0000885819,0.000786208,0.00007852833,0.00005133391,0.0003184282,0.0002012149,0.2004624,0.001643487,0.7861647,0.002479096,0.007472624],"study_design_scores_gemma":[0.0001612482,0.0001130772,0.001105855,0.0000296715,0.00004969794,0.0001388868,0.0002535039,0.4330431,0.0005055927,0.5608009,0.003749008,0.0000494486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2751309,0.001487616,0.5696758,0.004345539,0.0002162228,0.0002455297,0.0003144349,0.0002145878,0.1483694],"genre_scores_gemma":[0.9676082,0.0008097296,0.0190867,0.0002081917,0.0001283301,0.0001068009,0.00006893553,0.0000687279,0.01191425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01244938,"threshold_uncertainty_score":0.04164732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2622363162","doi":"","title":"Solving the maximally diverse grouping problem by skewed general variable neighborhood search","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Disjoint sets; Variable neighborhood search; Partition (number theory); Mathematics; Heuristic; Variable (mathematics); Set (abstract data type); Local search (optimization); Mathematical optimization; Computer science; Metaheuristic; Combinatorics","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dragan Urošević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01683419893696322,"gpt":0.2255101421717027,"spread":0.2086759432347395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001209787,0.0006971921,0.001176263,0.0006490954,0.000592791,0.0006199069,0.001453411,0.001019331,0.001993967],"category_scores_gemma":[0.001981806,0.0003339639,0.0006385116,0.001133014,0.0004936304,0.001384256,0.001350835,0.0007424863,0.0003209154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000479641,"about_ca_system_score_gemma":0.0006954183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547204,"about_ca_topic_score_gemma":0.002309749,"domain_scores_codex":[0.9992669,0.0003534993,0.0000249107,0.0001564285,0.0001185583,0.00007978376],"domain_scores_gemma":[0.9994944,0.0002853361,0.00006187362,0.00007242152,0.00005227751,0.00003364123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000133278,0.00009051836,0.001038673,0.00008026269,0.00006550337,0.0001021219,0.00009348805,0.9020341,0.002213445,0.02036432,0.002063359,0.07172083],"study_design_scores_gemma":[0.00003019045,0.00005472255,0.0001687286,0.00000718109,0.000009766738,0.00004094412,0.00003088506,0.9851198,0.0004962441,0.01304339,0.0009925364,0.000005714442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05094838,0.0003167465,0.9454787,0.00009408948,0.00002151292,0.00006205817,0.00006340394,0.0001696752,0.002845371],"genre_scores_gemma":[0.4698993,0.0002935346,0.5257916,0.0001245758,0.00005072392,0.0003000539,0.0004934182,0.0001378522,0.002908947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001993967,"threshold_uncertainty_score":0.006670415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2595320992","doi":"","title":"Nordhaus-Gaddum Relations for Proximity and Remoteness in Graphs","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02090497517781242,"gpt":0.2545152877863284,"spread":0.233610312608516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594421,0.0007845347,0.001033991,0.00393093,0.001698434,0.002044342,0.001444589,0.001385607,0.004377949],"category_scores_gemma":[0.008955788,0.0004739112,0.0008813638,0.002971398,0.003157612,0.006550724,0.002243498,0.003249041,0.0005848344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001635122,"about_ca_system_score_gemma":0.0004374952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087263,"about_ca_topic_score_gemma":0.001316513,"domain_scores_codex":[0.9982708,0.000524561,0.0001432217,0.000386159,0.0004830137,0.000192175],"domain_scores_gemma":[0.9948623,0.003516375,0.0003822125,0.0003415101,0.0005599826,0.0003376266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003584916,0.00001227146,0.0003356832,0.00007537255,0.00001207292,0.0001074941,0.00029118,0.003361877,0.0007858027,0.9856589,0.001239402,0.008084104],"study_design_scores_gemma":[0.0000124785,0.00004629167,0.0009436582,0.00006441523,0.00002386851,0.0003494211,0.0002046095,0.01812705,0.0007394249,0.9716788,0.007780026,0.00002986473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850525,0.01274956,0.6887802,0.003648405,0.0005738403,0.0001593991,0.001265586,0.000260153,0.1075104],"genre_scores_gemma":[0.8368234,0.004981557,0.146728,0.0006993877,0.0008233495,0.0002454082,0.000458177,0.00006303692,0.00917762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004377949,"threshold_uncertainty_score":0.01464576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2278035089","doi":"","title":"A Hybrid Heuristic for a Real-Life Car Sequencing Problem with Painting and Assembly Line Constraints","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Assembly line; Metaheuristic; Mathematical optimization; Computer science; Heuristic; Diversification (marketing strategy); Set (abstract data type); Operations research; Artificial intelligence; Engineering; Mathematics; Programming language","authors":[{"name":"Celso C. Ribeiro","is_ca":false},{"name":"Daniel Aloise","is_ca":false},{"name":"Thiago F. Noronha","is_ca":false},{"name":"Caroline Rocha","is_ca":true},{"name":"Sebastián Urrutia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005583379255297389,"gpt":0.1848208819761725,"spread":0.1792375027208751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008446738,0.0008326434,0.0006640399,0.0009598374,0.0003863836,0.0007392038,0.001418659,0.001268841,0.003655426],"category_scores_gemma":[0.00125742,0.0004346539,0.0006404342,0.001018023,0.0006225933,0.0007550868,0.0006569301,0.0006191971,0.0003377474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067913,"about_ca_system_score_gemma":0.001076769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003769444,"about_ca_topic_score_gemma":0.004620421,"domain_scores_codex":[0.999663,0.0001172327,0.00001166766,0.00005531634,0.00008195046,0.00007079212],"domain_scores_gemma":[0.999536,0.0002864801,0.00004733899,0.00003417451,0.0000524734,0.0000435667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009077581,0.0000785602,0.0002323787,0.0000821229,0.0000349778,0.00008879848,0.00006582601,0.9521312,0.001865856,0.007729115,0.0009644998,0.03663583],"study_design_scores_gemma":[0.00005205772,0.00008446128,0.000122219,0.0000167017,0.0000169855,0.00004404463,0.00003091055,0.9941179,0.000660949,0.003175261,0.001667416,0.00001109807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06309391,0.0006093241,0.9245896,0.0002294478,0.00009052667,0.00016523,0.000100305,0.0004710279,0.01065067],"genre_scores_gemma":[0.494957,0.0003432997,0.4979589,0.0001721779,0.00005601574,0.0004292855,0.0002214173,0.0001168482,0.005745089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003769444,"threshold_uncertainty_score":0.01222867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2286603664","doi":"","title":"Two Laplacians for the Distance Matrix of a Graph","year":2011,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Laplacian matrix; Distance matrix; Mathematics; Combinatorics; Laplace operator; Connectivity; Eigenvalues and eigenvectors; Discrete mathematics; Distance matrices in phylogeny; Graph; Line graph; Physics; Mathematical analysis; Graph power","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02990814175960145,"gpt":0.2775805357248767,"spread":0.2476723939652752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159049,0.0004666523,0.0003096956,0.001434353,0.0005894863,0.001515765,0.0006124802,0.001004235,0.00955725],"category_scores_gemma":[0.003100249,0.0001318037,0.0004876881,0.0007046561,0.001681794,0.002228553,0.001066741,0.00132679,0.001281879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005869164,"about_ca_system_score_gemma":0.0003732618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004389696,"about_ca_topic_score_gemma":0.0003520692,"domain_scores_codex":[0.9992385,0.0001956613,0.00003856207,0.0001721454,0.0002879378,0.00006727366],"domain_scores_gemma":[0.9987645,0.0004193643,0.000154075,0.0001358025,0.0003783104,0.0001480349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001805903,0.00001654117,0.0001584962,0.00003832412,0.000005791178,0.0001017551,0.0001848107,0.002290943,0.004449769,0.9798007,0.002163832,0.01077099],"study_design_scores_gemma":[0.00001164837,0.00004517111,0.0005912886,0.00002487456,0.000006769953,0.0005583174,0.0001675885,0.03654387,0.001355001,0.9454967,0.01516392,0.00003483213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1115723,0.001787833,0.8026971,0.003420339,0.001346703,0.0001091394,0.000554226,0.0003375483,0.07817487],"genre_scores_gemma":[0.7906772,0.001667551,0.167683,0.001308385,0.0009648609,0.0002638784,0.0004607074,0.0002382577,0.03673619],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00955725,"threshold_uncertainty_score":0.03197217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2610727005","doi":"","title":"A Differential Game of Joint Implementation of Environmental Projects","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Differential game; Kyoto Protocol; Joint (building); Constraint (computer-aided design); Computer science; Joint Implementation; Game theory; Differential (mechanical device); Microeconomics; Economics; Environmental economics; Operations research; Business; Mathematical optimization; Engineering; Mathematics; Climate change","authors":[{"name":"Michèle Breton","is_ca":true},{"name":"Georges Zaccour","is_ca":true},{"name":"Mehdi Zahaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04427547191506248,"gpt":0.2242310602243066,"spread":0.1799555883092441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684358,0.0009141132,0.001113465,0.0005521899,0.0007007248,0.002100579,0.002263183,0.003214164,0.006068496],"category_scores_gemma":[0.004944467,0.0005856826,0.0009043611,0.0006267172,0.002242303,0.003784066,0.001708264,0.002049405,0.0003933192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003159245,"about_ca_system_score_gemma":0.001817936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006335451,"about_ca_topic_score_gemma":0.003702142,"domain_scores_codex":[0.9973493,0.001489341,0.00007729365,0.0003566889,0.0003219098,0.0004054779],"domain_scores_gemma":[0.9979419,0.001340988,0.0002103006,0.00009279387,0.000109182,0.0003047522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000215935,0.0001196799,0.0007846523,0.0001000946,0.0000754948,0.0006373201,0.0002674117,0.2688759,0.001721734,0.7193653,0.001376143,0.006460391],"study_design_scores_gemma":[0.000189312,0.0001736085,0.0005304279,0.00002635521,0.00004775718,0.0001661729,0.0001415664,0.7295671,0.0005420029,0.2643032,0.004261415,0.00005117913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2018463,0.0005381159,0.7063557,0.004140994,0.0001666363,0.0003767838,0.0007550081,0.0001611988,0.08565936],"genre_scores_gemma":[0.9663424,0.0003206411,0.01789323,0.0001906742,0.0000426699,0.0002508615,0.0001025627,0.00001280297,0.0148442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006335451,"threshold_uncertainty_score":0.02292198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2601917914","doi":"","title":"Distance Laplacian eigenvalues and chromatic number in graphs","year":2016,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Chromatic scale; Spectral radius; Eigenvalues and eigenvectors; Combinatorics; Laplace operator; Resistance distance; Laplacian matrix; Graph; Discrete mathematics; Mathematical analysis; Line graph; Physics; Graph power","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01332818571939276,"gpt":0.2576371197784077,"spread":0.2443089340590149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006024623,0.0005317605,0.0004694551,0.002508338,0.0009257023,0.001591104,0.001191928,0.0007997212,0.003888235],"category_scores_gemma":[0.0067899,0.0003465007,0.0002643109,0.001426358,0.00303446,0.002247872,0.001172744,0.001143992,0.0003588765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152819,"about_ca_system_score_gemma":0.0003490201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331709,"about_ca_topic_score_gemma":0.001322179,"domain_scores_codex":[0.9995446,0.0001131183,0.00001326951,0.0001297826,0.0001209926,0.00007830907],"domain_scores_gemma":[0.9952419,0.003133781,0.0005897189,0.0002958756,0.0003765984,0.0003620878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001480897,0.00006109131,0.004508969,0.000152939,0.00003465787,0.0001846127,0.0004422795,0.06131048,0.01219522,0.9065935,0.001852972,0.01251519],"study_design_scores_gemma":[0.00001840294,0.00003779176,0.004252252,0.00003317584,0.00001349084,0.0002657921,0.000242994,0.1737366,0.002877511,0.816735,0.001742491,0.00004459557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7810718,0.001662653,0.1875122,0.001462463,0.00008088128,0.00002857288,0.0002130249,0.0002937662,0.02767453],"genre_scores_gemma":[0.9891454,0.0004418071,0.007265817,0.00008115378,0.00009231716,0.00002478073,0.00007520414,0.00005824331,0.00281525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003888235,"threshold_uncertainty_score":0.01300746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2619681116","doi":"","title":"Simulation of weathered profiles coupled with multivariate block-support simulation of the Puma Nickel Laterite Deposit, Brazil","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Soil Geostatistics and Mapping","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Laterite; Block (permutation group theory); Geology; Mining engineering; Kriging; Mineral exploration; Stochastic simulation; Statistics; Geochemistry; Mathematics; Nickel","authors":[{"name":"Mario De Freitas Silva","is_ca":true},{"name":"Roussos Dimitrakopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01231344842772065,"gpt":0.233875781256392,"spread":0.2215623328286713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392509,0.000459751,0.0004556094,0.0004318879,0.0003724417,0.000840762,0.0009442709,0.001045376,0.001423005],"category_scores_gemma":[0.002307573,0.0003105531,0.0007222373,0.0005132515,0.0005956,0.0004372908,0.0006279399,0.0006205087,0.0001150124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139129,"about_ca_system_score_gemma":0.000970404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1087001,"about_ca_topic_score_gemma":0.05783422,"domain_scores_codex":[0.9998652,0.00003197538,0.000009857299,0.00003092175,0.00002575041,0.00003633053],"domain_scores_gemma":[0.9991473,0.0004887971,0.0000816452,0.00005173698,0.0001526158,0.00007800401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004397842,0.00003309825,0.007454916,0.000013624,0.00001417904,0.00007594111,0.00003631278,0.9900122,0.0005715849,0.0005829068,0.0001380038,0.001023251],"study_design_scores_gemma":[0.0000140192,0.000009445534,0.001623033,0.00000234406,0.000004045886,0.000006070156,0.00002307724,0.9978725,0.0001754963,0.000159917,0.0001060549,0.000003984263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895226,0.00007259578,0.005689355,0.0002061931,0.00001525582,0.00003166162,0.0008225642,0.0001318025,0.003508063],"genre_scores_gemma":[0.9962488,0.00003390183,0.002643605,0.00001628016,0.000002444708,0.00001980059,0.000465359,0.00001757187,0.0005522908],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1087001,"threshold_uncertainty_score":0.2161348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W341116111","doi":"","title":"Numerical Pricing of Contingent Claims on Multiple Assets and/or Factors - A Low-Discrepancy Markov Chain Approach","year":2004,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; HEC Montréal","funders":"","keywords":"Markov chain; Additive Markov chain; Variable-order Markov model; Markov chain mixing time; Absorbing Markov chain; Mathematical optimization; Markov process; Markov model; Examples of Markov chains; Mathematics; Stochastic matrix; Continuous-time Markov chain; Markov kernel; Balance equation; Markov renewal process; Markov property; Sequence (biology); Valuation (finance); Computer science; Statistics; Economics; Finance","authors":[{"name":"Geneviève Gauthier","is_ca":true},{"name":"Jin‐Chuan Duan","is_ca":true},{"name":"Jean‐Guy Simonato","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02607974988381655,"gpt":0.2612981458547615,"spread":0.2352183959709449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003056546,0.0004981494,0.0009809382,0.0008294762,0.0005330365,0.001201398,0.001088137,0.001064511,0.003256035],"category_scores_gemma":[0.008869,0.0004575147,0.0007302605,0.0005561535,0.001781648,0.001668959,0.001513619,0.001788976,0.0003893882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104715,"about_ca_system_score_gemma":0.001368091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002682463,"about_ca_topic_score_gemma":0.001800188,"domain_scores_codex":[0.9993755,0.0003405676,0.00003026789,0.00006182662,0.0001408089,0.00005108799],"domain_scores_gemma":[0.9957911,0.002916799,0.0002805172,0.0003905692,0.0003938151,0.0002271927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005158318,0.00003998238,0.000829222,0.00004377494,0.0000171469,0.00008758067,0.00007324132,0.6823133,0.001342756,0.3057991,0.0003447929,0.009057543],"study_design_scores_gemma":[0.000004009091,0.00000450771,0.00001987704,0.000002511204,0.000001021166,0.000004606542,0.000001673557,0.983508,0.0001277026,0.01620385,0.0001196635,0.000002481167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02568177,0.0001840008,0.9711897,0.0003606967,0.00003176811,0.00002807539,0.00002306958,0.00008629885,0.0024147],"genre_scores_gemma":[0.678645,0.0004522299,0.3148636,0.0001477749,0.00009814009,0.0001866543,0.00009969622,0.00009262185,0.005414309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003256035,"threshold_uncertainty_score":0.01616472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2586633569","doi":"","title":"Network Descriptors Based on Betweenness Centrality and Transmission and their Extremal Values","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Betweenness centrality; Centrality; Network theory; Transmission (telecommunications); Mathematics; Computer science; Theoretical computer science; Combinatorics; Telecommunications","authors":[{"name":"Damir Vukičević","is_ca":false},{"name":"Gilles Caporossi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04610375701447492,"gpt":0.2211923478564155,"spread":0.1750885908419406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158926,0.0004968577,0.0007309271,0.0045686,0.0005894967,0.001680994,0.0008276946,0.0006661437,0.001779446],"category_scores_gemma":[0.007198278,0.0001956005,0.0003731964,0.004073181,0.001373196,0.003139667,0.0007439559,0.001146153,0.0003046078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009933193,"about_ca_system_score_gemma":0.0004195093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005767167,"about_ca_topic_score_gemma":0.0005629417,"domain_scores_codex":[0.9991052,0.0002138152,0.00005154697,0.000201252,0.0003410188,0.00008724626],"domain_scores_gemma":[0.9961612,0.002109364,0.0006978053,0.0002785754,0.0005909987,0.0001620388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001891703,0.00007829737,0.004148155,0.0002691167,0.0000853842,0.0002376536,0.0003367583,0.07062365,0.009431582,0.7813984,0.004636507,0.1285654],"study_design_scores_gemma":[0.00003463525,0.0001736933,0.005631051,0.0001012549,0.00007354721,0.0008690822,0.0003070965,0.3084843,0.004572658,0.6675306,0.01209695,0.0001250722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2081792,0.003893251,0.763577,0.0008491141,0.0003064969,0.0001572718,0.001326908,0.0003834765,0.02132722],"genre_scores_gemma":[0.9021474,0.001961194,0.09075432,0.0001169771,0.0003379213,0.0002420597,0.0009807392,0.000117375,0.003342097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0045686,"threshold_uncertainty_score":0.007207096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W198966646","doi":"","title":"Locating a Circle on the Plane Using the Minimax Criterion","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Minimax; Mathematics; Plane (geometry); Computer science; Mathematical economics; Geometry","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Henrik Juel","is_ca":false},{"name":"Anita Schöbel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009920766014609523,"gpt":0.2133343668019037,"spread":0.2034136007872942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291846,0.0007952232,0.001680373,0.002304193,0.0006778716,0.001275478,0.0008415771,0.001528183,0.001810292],"category_scores_gemma":[0.00649321,0.0006078407,0.0004449562,0.001038469,0.001015282,0.001758025,0.001443027,0.0008464718,0.0008318072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004509874,"about_ca_system_score_gemma":0.0007404566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001109659,"about_ca_topic_score_gemma":0.000806502,"domain_scores_codex":[0.9989498,0.000342523,0.0000435647,0.0002279464,0.0003655377,0.00007061854],"domain_scores_gemma":[0.9983638,0.0009936143,0.0001484774,0.0001263929,0.0003069998,0.00006059488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001700734,0.0001609239,0.004107296,0.0003940341,0.0001795118,0.0004444237,0.0006120554,0.187733,0.09263199,0.05716167,0.006220094,0.6486543],"study_design_scores_gemma":[0.00007099654,0.0002010434,0.002149999,0.00004686051,0.00003149857,0.0003734915,0.00009585918,0.9517873,0.0230129,0.01933479,0.002855112,0.0000401666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03988181,0.0003159289,0.9575343,0.0001768965,0.00002196587,0.00003699517,0.00002689524,0.000322296,0.001682917],"genre_scores_gemma":[0.3838101,0.0003514088,0.6125556,0.00006650875,0.00006015468,0.0001429097,0.0001184751,0.0001965508,0.00269822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002304193,"threshold_uncertainty_score":0.006832004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000089047","doi":"","title":"Improving the linear relaxation of maximum \\(k\\)-cut with semidefinite-based constraints","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Cutting-plane method; Mathematics; Maximum cut; Linear programming; Combinatorics; Relaxation (psychology); Semidefinite embedding; Vertex (graph theory); Linear programming relaxation; Graph; Interior point method; Feasible region; Set (abstract data type); Facet (psychology); Mathematical optimization; Integer programming; Computer science; Quadratically constrained quadratic program","authors":[{"name":"Vilmar Jefté Rodrigues de Sousa","is_ca":true},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Sébastien Le Digabel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01272035651545259,"gpt":0.2098328919479584,"spread":0.1971125354325058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003174808,0.001630798,0.001408514,0.0008473384,0.0004488024,0.001794329,0.001710937,0.001447662,0.004648154],"category_scores_gemma":[0.01209713,0.0009211822,0.00111412,0.00124547,0.001185913,0.002886873,0.001824772,0.002908343,0.0007762142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009739881,"about_ca_system_score_gemma":0.001397881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950228,"about_ca_topic_score_gemma":0.002930469,"domain_scores_codex":[0.9983441,0.0008151653,0.00006274219,0.0002433276,0.000312504,0.0002221629],"domain_scores_gemma":[0.9915162,0.006620141,0.0005932451,0.0004867621,0.0005683912,0.0002151975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001956829,0.0002257304,0.0004533353,0.0002618611,0.00005420885,0.0001129369,0.00008644731,0.9335016,0.002720571,0.02593203,0.003624449,0.03283111],"study_design_scores_gemma":[0.0000240713,0.00005676002,0.00007686458,0.00001902263,0.000006894984,0.00003563983,0.00002011359,0.9858708,0.0008294266,0.01244809,0.0006053929,0.000006930591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06906226,0.0007040336,0.9167733,0.0006528433,0.00009255967,0.0001063311,0.0002482874,0.0005584363,0.01180202],"genre_scores_gemma":[0.4822018,0.0006003758,0.5106891,0.0005120133,0.0001168757,0.0002263415,0.0008288387,0.0004355353,0.004389104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004648154,"threshold_uncertainty_score":0.01679021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2173782975","doi":"","title":"A simple model-based approach to variable selection in classification and clustering","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Feature selection; Artificial intelligence; Simple (philosophy); Machine learning; Selection (genetic algorithm); Model selection; Variable (mathematics); Mathematics","authors":[{"name":"Vahid Partovi Nia","is_ca":true},{"name":"A. C. Davison","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01206636584626691,"gpt":0.2309271310636507,"spread":0.2188607652173838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01127678,0.00135793,0.002140369,0.002212913,0.001385081,0.002166773,0.004415122,0.002621607,0.004337276],"category_scores_gemma":[0.02135957,0.001004999,0.003268338,0.00255885,0.002158087,0.002171759,0.002606939,0.004132841,0.00224495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633951,"about_ca_system_score_gemma":0.002756419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003558336,"about_ca_topic_score_gemma":0.004813513,"domain_scores_codex":[0.9927762,0.004041379,0.0003083931,0.001304655,0.001330658,0.0002387492],"domain_scores_gemma":[0.9944103,0.003206111,0.0002812552,0.001259419,0.0007134438,0.0001293962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002231471,0.0002342779,0.003033977,0.0003217214,0.0007647171,0.0001686813,0.0003441101,0.2791277,0.006689017,0.3437518,0.01097641,0.3543646],"study_design_scores_gemma":[0.00004680303,0.000111696,0.0006827131,0.00002604983,0.00005465002,0.0001375868,0.00002445578,0.7702481,0.001612396,0.2209152,0.006074458,0.00006597742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006667412,0.00006480631,0.9986795,0.0001238449,0.00003441975,0.00004161193,0.00003995683,0.0001837797,0.0001653007],"genre_scores_gemma":[0.06376439,0.0002537248,0.9313344,0.0003463601,0.000242927,0.0006589405,0.0003747672,0.0001681511,0.002856262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01127678,"threshold_uncertainty_score":0.05963802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596078115","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 23. On the Randic Index and the Chromatic Number","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Simple graph; Connectivity; Chromatic scale; Bound graph; Degree (music); Discrete mathematics; Graph power; Physics; Line graph","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Damir Vukičević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007890478338472364,"gpt":0.1988967571668018,"spread":0.1910062788283295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945324,0.000279897,0.0007782506,0.001657503,0.001290353,0.001300407,0.0009813177,0.0008279171,0.003960321],"category_scores_gemma":[0.005255891,0.0003719756,0.0003933023,0.001150027,0.001348076,0.001917656,0.001086015,0.0007683221,0.0002900096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578109,"about_ca_system_score_gemma":0.0005500928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166462,"about_ca_topic_score_gemma":0.00452534,"domain_scores_codex":[0.999563,0.0001789241,0.000013464,0.000115186,0.00005329207,0.00007608843],"domain_scores_gemma":[0.9975809,0.001678475,0.0002405008,0.0001982252,0.0001194161,0.0001825261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001145266,0.0002105644,0.01530764,0.0003330584,0.0001464673,0.0002340531,0.000585274,0.1805121,0.004778849,0.6638618,0.01701237,0.1158725],"study_design_scores_gemma":[0.0001826581,0.0001431723,0.003107075,0.00006900632,0.00006103491,0.0002395907,0.0002852382,0.4774437,0.002396194,0.5088121,0.00722167,0.0000385905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7654784,0.003262358,0.1874397,0.002983609,0.0001251059,0.000103737,0.0006878065,0.0004006587,0.03951862],"genre_scores_gemma":[0.932758,0.0004661762,0.05992303,0.0002321859,0.00009297799,0.0000633079,0.0004779937,0.00008471759,0.005901646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003960321,"threshold_uncertainty_score":0.01324856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2597535316","doi":"","title":"Robust optimization of sums of piecewise linear functions with application to inventory problems","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Newsvendor model; Linear programming; Robust optimization; Mathematics; Piecewise linear function; Computation; Column generation; Set (abstract data type); Optimization problem; Computer science; Algorithm","authors":[{"name":"Amir Ardestani Jaafari","is_ca":true},{"name":"Erick Delage","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06477491058583826,"gpt":0.2860988380650012,"spread":0.221323927479163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238171,0.001611879,0.001652135,0.0007649857,0.0003795938,0.001382371,0.000954007,0.001234288,0.001983423],"category_scores_gemma":[0.006473526,0.0008102603,0.00132645,0.001235489,0.001529348,0.00176189,0.001607347,0.00234138,0.0002203026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001526477,"about_ca_system_score_gemma":0.0008100813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003082401,"about_ca_topic_score_gemma":0.001325028,"domain_scores_codex":[0.9987441,0.000644418,0.00006171742,0.0001836696,0.0002718575,0.00009423168],"domain_scores_gemma":[0.9970329,0.002243785,0.0003008952,0.0001563534,0.0001807983,0.00008525056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001950468,0.00001043467,0.00009550235,0.00004726983,0.00001841398,0.00002280648,0.00002369846,0.9740075,0.0005361768,0.01925251,0.0001827633,0.005783295],"study_design_scores_gemma":[0.000002841577,0.00001589956,0.00002625803,0.000006699505,0.000004171831,0.000008083357,0.000006612587,0.9911843,0.0002482396,0.008198606,0.000294061,0.000004186014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01110043,0.0008761758,0.9854432,0.0002359959,0.00002523241,0.00002050511,0.0000410735,0.0001478256,0.002109554],"genre_scores_gemma":[0.6867703,0.002270485,0.305461,0.0001348195,0.0001077322,0.0001716804,0.000155294,0.0002552766,0.004673406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003238171,"threshold_uncertainty_score":0.01712531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2310089532","doi":"","title":"Open Problems on Graph Eigenvalues Studied with AutoGraphiX","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Adjacency matrix; Graph energy; Mathematics; Combinatorics; Spectral graph theory; Eigenvalues and eigenvectors; Mathematical proof; Graph theory; Discrete mathematics; Line graph; Strength of a graph; Graph; Voltage graph","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05481196267456429,"gpt":0.3016105306605067,"spread":0.2467985679859425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002632634,0.0009261046,0.001323289,0.002965879,0.001641091,0.002281864,0.00156952,0.001790892,0.006610745],"category_scores_gemma":[0.01648147,0.0006950725,0.001216251,0.002074228,0.004958484,0.006029323,0.002675574,0.003611486,0.0007399268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001460378,"about_ca_system_score_gemma":0.0007368434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112272,"about_ca_topic_score_gemma":0.0004994257,"domain_scores_codex":[0.9983333,0.0007005823,0.00004639143,0.0003382397,0.0004230977,0.0001584214],"domain_scores_gemma":[0.9848053,0.0125733,0.000836166,0.0007757606,0.000624063,0.0003853958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005920144,0.0000641885,0.0008720595,0.0001476089,0.00002719102,0.0001075441,0.0004268072,0.02231537,0.0009394314,0.9598014,0.002348367,0.01289076],"study_design_scores_gemma":[0.00001978914,0.00002626159,0.0003389705,0.00003460459,0.000009054357,0.00008263406,0.000140237,0.08832089,0.0006584748,0.9079751,0.002377009,0.00001689015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.358432,0.005937365,0.5671486,0.006721253,0.0003547771,0.00009525235,0.0003013374,0.0005663642,0.06044314],"genre_scores_gemma":[0.8966864,0.003617313,0.08544143,0.0006652022,0.001012543,0.0002165351,0.0003332972,0.0003674375,0.01165984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006610745,"threshold_uncertainty_score":0.02211517,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013962532","doi":"","title":"Computational study of a branching algorithm for the maximum \\(k\\)-cut problem","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branch and bound; Maximum cut; Branching (polymer chemistry); Cutting-plane method; Algorithm; Mathematics; Mathematical optimization; Relaxation (psychology); Metaheuristic; Graph; Node (physics); Linear programming relaxation; Linear programming; Combinatorics; Integer programming","authors":[{"name":"Vilmar Jefté Rodrigues de Sousa","is_ca":true},{"name":"Miguel F. Anjos","is_ca":false},{"name":"Sébastien Le Digabel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01582555029809753,"gpt":0.2431856831745436,"spread":0.2273601328764461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443166,0.0007077449,0.0008829945,0.0007485877,0.0005598883,0.001025663,0.001242247,0.001167361,0.004383085],"category_scores_gemma":[0.007377818,0.0003574731,0.0005529899,0.000908375,0.0007383227,0.0009623423,0.0008682126,0.00143749,0.0002786219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013423,"about_ca_system_score_gemma":0.001445937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003234144,"about_ca_topic_score_gemma":0.002622081,"domain_scores_codex":[0.9994116,0.0003344668,0.00001698773,0.00006959014,0.00009414405,0.00007325879],"domain_scores_gemma":[0.9928664,0.006270451,0.0002348383,0.0001575788,0.0002716333,0.0001991271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003460065,0.0001852403,0.001199453,0.0001546021,0.00003486164,0.00005851056,0.00007727882,0.9374374,0.0014313,0.02354426,0.001373588,0.03415751],"study_design_scores_gemma":[0.00002456888,0.00003094471,0.00006617733,0.000005782544,0.000003949886,0.000007725274,0.000009185879,0.9965577,0.0001476007,0.003033084,0.0001118457,0.000001439086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3231077,0.0007460418,0.6558977,0.0008630886,0.00008501644,0.0002648993,0.0001754513,0.0006553361,0.01820478],"genre_scores_gemma":[0.6140191,0.0001883437,0.3833448,0.00011889,0.00003338086,0.0002392169,0.0002421945,0.0001115022,0.001702563],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004383085,"threshold_uncertainty_score":0.01466286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123748904","doi":"","title":"Pricing Installment Options with an Application to ASX Installment Warrants","year":2002,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Warrant; Valuation of options; Flexibility (engineering); Call option; Exotic option; Put option; Computer science; Moneyness; Range (aeronautics); Economics; Actuarial science; Business; Microeconomics; Finance; Econometrics; Engineering","authors":[{"name":"Hatem Ben‐Ameur","is_ca":false},{"name":"Michèle Breton","is_ca":false},{"name":"Pascal François","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01808682485548611,"gpt":0.1993926492471483,"spread":0.1813058243916622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557856,0.0006994868,0.0007555777,0.0006794491,0.0005329062,0.001306416,0.0009097162,0.001341759,0.005243787],"category_scores_gemma":[0.005147635,0.0004890372,0.0006976633,0.0009913028,0.0009607519,0.00134207,0.00109188,0.001626682,0.00033147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008020763,"about_ca_system_score_gemma":0.0008315449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983423,"about_ca_topic_score_gemma":0.003511607,"domain_scores_codex":[0.9995043,0.0002341873,0.00002248729,0.00005081827,0.0001559094,0.00003214671],"domain_scores_gemma":[0.9986863,0.0009286185,0.0001080113,0.00007914713,0.0001420445,0.00005597683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000682355,0.00006050331,0.0008878967,0.00006475526,0.00002484259,0.0002959507,0.0001420571,0.7632118,0.002488997,0.2048403,0.001119528,0.02679517],"study_design_scores_gemma":[0.00001139204,0.00001779977,0.0001392928,0.000006124871,0.000004612518,0.00005988613,0.00001301103,0.9677858,0.0003342048,0.03018039,0.0014404,0.000007005255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04460884,0.0004502743,0.9473443,0.0005895604,0.00005890075,0.00007497633,0.00004486602,0.0001315464,0.006696791],"genre_scores_gemma":[0.6621161,0.0009205594,0.3235671,0.0001063496,0.0001504237,0.0002150885,0.00009669573,0.0001161329,0.01271154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005243787,"threshold_uncertainty_score":0.01754218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2741500941","doi":"","title":"Modeling Daily Arrivals to a Telephone Call Center","year":2003,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Center (category theory); Goodness of fit; Call management; Variance (accounting); Statistics; Mathematics; Telecommunications; Call control","authors":[{"name":"Athanassios N. Avramidis","is_ca":true},{"name":"Alexandre Deslauriers","is_ca":false},{"name":"Pierre L’Ecuyer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01035860234003744,"gpt":0.2144726329398225,"spread":0.2041140305997851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280344,0.0008278409,0.0007794786,0.0009771911,0.0006158063,0.001928278,0.002277791,0.002329354,0.002244641],"category_scores_gemma":[0.01136951,0.000758921,0.0006930009,0.001600463,0.00074412,0.002017925,0.0008892844,0.001983495,0.0004898132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002050664,"about_ca_system_score_gemma":0.001372545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02364952,"about_ca_topic_score_gemma":0.01613031,"domain_scores_codex":[0.9986498,0.0005481202,0.0000624176,0.0002448154,0.0002573031,0.0002376342],"domain_scores_gemma":[0.9944928,0.003272188,0.001027361,0.0003203029,0.0006195375,0.0002678146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004497871,0.00006577946,0.004159287,0.00001832856,0.00002701265,0.00006734444,0.000161169,0.9768983,0.0005263117,0.01408238,0.0005160433,0.00343305],"study_design_scores_gemma":[0.000006185771,0.00001432192,0.0005033918,0.000001995323,0.000004125024,0.00001088934,0.00002243277,0.9969364,0.00006299446,0.002237864,0.0001918768,0.000007560355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5824428,0.0003412137,0.4101493,0.001081311,0.00009553221,0.0001352937,0.0008299737,0.0005229551,0.00440161],"genre_scores_gemma":[0.9738631,0.0003039651,0.02207798,0.00008601821,0.00008383964,0.0001267768,0.0004955887,0.000052213,0.002910638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02364952,"threshold_uncertainty_score":0.04702371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2299253197","doi":"","title":"Minimising the peak load in a shared storage system based on the duration-of-stay of unit loads","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Duration (music); Heuristics; Integer programming; Computer science; Unit load; Peak load; Unit (ring theory); Mathematical optimization; Reliability engineering; Engineering; Mathematics; Algorithm; Operating system; Automotive engineering","authors":[{"name":"Lu Chen","is_ca":true},{"name":"Diane Riopel","is_ca":true},{"name":"André Langevin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01446311116477577,"gpt":0.1899938005450281,"spread":0.1755306893802523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008763716,0.0007409927,0.001106135,0.0004665585,0.0004498334,0.001098457,0.001043654,0.0005691886,0.001330529],"category_scores_gemma":[0.001699177,0.0004231129,0.0005003785,0.0008074955,0.0004961367,0.001527047,0.000995717,0.0004836869,0.0001026697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009526028,"about_ca_system_score_gemma":0.001325743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003832651,"about_ca_topic_score_gemma":0.003599529,"domain_scores_codex":[0.9995492,0.00012915,0.00002264238,0.00007707213,0.0001001698,0.0001216809],"domain_scores_gemma":[0.9990237,0.0005266698,0.0001641629,0.00007709805,0.0001069726,0.0001015202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000261008,0.00005583045,0.0007214394,0.00007261892,0.00004999839,0.00006752367,0.00005762215,0.9607765,0.009258665,0.002612927,0.0003065286,0.02575924],"study_design_scores_gemma":[0.00001848147,0.0001379663,0.000503693,0.000004422556,0.00002453111,0.00004329291,0.00004883575,0.9941483,0.002968206,0.001864658,0.0002273649,0.00001038542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4229338,0.0004310555,0.5736921,0.000160501,0.0000286186,0.00007799651,0.0001054248,0.000339113,0.002231309],"genre_scores_gemma":[0.9660589,0.00006582773,0.03298214,0.00001323334,0.00001199324,0.00004039063,0.00004582946,0.00004541998,0.0007362937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003832651,"threshold_uncertainty_score":0.007620633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2742471139","doi":"","title":"A Survey of Models and Algorithms for Winter Road Maintenance. Part IV: Vehicle Routing and Fleet Sizing for Plowing and Snow Disposal","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sizing; Routing (electronic design automation); Vehicle routing problem; Snow; Snow removal; Transport engineering; Operations research; Fleet management; Highway maintenance; Plough; Computer science; Engineering; Geography; Meteorology","authors":[{"name":"Nathalie Perrier","is_ca":true},{"name":"André Langevin","is_ca":true},{"name":"James F. Campbell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02842779412637151,"gpt":0.2618977110682328,"spread":0.2334699169418613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006951304,0.001790794,0.001363709,0.001030524,0.0004402013,0.001607536,0.002068877,0.001498913,0.006778186],"category_scores_gemma":[0.001788383,0.001002053,0.001546115,0.002833592,0.0004865871,0.002084228,0.000628843,0.001689433,0.003673631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136665,"about_ca_system_score_gemma":0.001452774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004617065,"about_ca_topic_score_gemma":0.005196623,"domain_scores_codex":[0.9994666,0.0001443631,0.00004786199,0.0001241224,0.0001770447,0.00003996049],"domain_scores_gemma":[0.9995432,0.0002453953,0.00005461422,0.00006294648,0.0000785519,0.0000153756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004921288,0.0001372981,0.0007043232,0.0009464422,0.000100937,0.00007456075,0.00009065042,0.5024253,0.001444766,0.1102545,0.05139785,0.3323742],"study_design_scores_gemma":[0.00002590106,0.00007159106,0.0006198518,0.0002814339,0.00006109939,0.0002357186,0.00005902943,0.6959296,0.0008990219,0.1414328,0.1603469,0.00003705413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001887153,0.02556858,0.958384,0.0007962598,0.0003123373,0.00006051926,0.0005905349,0.0007083578,0.01169223],"genre_scores_gemma":[0.08634505,0.1006391,0.7781432,0.000673637,0.001034865,0.0006282105,0.003027836,0.000869462,0.02863866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006778186,"threshold_uncertainty_score":0.02267528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2736770525","doi":"","title":"Merging the Local and Global Approaches to Probabilistic Satisfiability","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Probabilistic logic; Satisfiability; Consistency (knowledge bases); Mathematics; Logical consequence; Set (abstract data type); Mathematical optimization; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Sylvain Perron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02820314155902571,"gpt":0.210460745074942,"spread":0.1822576035159163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007041012,0.001512467,0.002059434,0.002830849,0.00111072,0.004962379,0.004382896,0.002138202,0.006958215],"category_scores_gemma":[0.01788215,0.001443599,0.002261981,0.003061869,0.004982272,0.01059688,0.008487454,0.006854076,0.001453363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948729,"about_ca_system_score_gemma":0.002755238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001762646,"about_ca_topic_score_gemma":0.006039628,"domain_scores_codex":[0.9899698,0.005087793,0.0005021699,0.001368202,0.00257161,0.0005004557],"domain_scores_gemma":[0.9861267,0.006932394,0.0005640962,0.004648207,0.001401808,0.0003266847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000147835,0.000196953,0.001073955,0.0006627125,0.0002629074,0.0002306999,0.001399487,0.06718393,0.005448027,0.5891054,0.004884583,0.3294035],"study_design_scores_gemma":[0.00005687257,0.0001673899,0.0004979395,0.0001522002,0.0002166837,0.000207257,0.0004274394,0.2701688,0.008409276,0.7036322,0.01597959,0.00008424088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003931571,0.0005938121,0.9880592,0.000775085,0.00002879812,0.00006898546,0.00004948814,0.0005213927,0.005971712],"genre_scores_gemma":[0.1511272,0.001183459,0.8414007,0.0008719698,0.0001566647,0.0003722832,0.0002984287,0.0005204155,0.004068864],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007041012,"threshold_uncertainty_score":0.03723687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620856806","doi":"","title":"Comparison of mixed integer linear models for fuel-optimal air conflict resolution with recovery","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Discretization; Benchmark (surveying); Mathematical optimization; Air traffic management; Computer science; Time horizon; Air traffic control; Position (finance); Acceleration; Integer (computer science); Trajectory; Fuel efficiency; Separation (statistics); Heading (navigation); Bounded function; Control theory (sociology); Mathematics; Engineering; Artificial intelligence","authors":[{"name":"Jérémy Omer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01390312242902276,"gpt":0.2187940067648556,"spread":0.2048908843358329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004365821,0.001815569,0.001809351,0.001249806,0.0004946827,0.002023041,0.001627067,0.001799432,0.004296431],"category_scores_gemma":[0.007092099,0.0007752118,0.001570308,0.00112904,0.0006306581,0.001617116,0.00122837,0.002085057,0.000413551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002217918,"about_ca_system_score_gemma":0.001807784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01263214,"about_ca_topic_score_gemma":0.009572822,"domain_scores_codex":[0.9980647,0.001345602,0.00006656536,0.0001465682,0.0001965796,0.000180089],"domain_scores_gemma":[0.9916151,0.007193535,0.000425824,0.0001654219,0.0004151034,0.000185014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006947451,0.00005247003,0.0001270566,0.00003109126,0.00001878788,0.000006088484,0.000008179079,0.9948986,0.00003405149,0.00164315,0.000121637,0.002989391],"study_design_scores_gemma":[0.000008174895,0.00003291923,0.00003007426,0.000004993959,0.000004668223,0.000001177062,0.000006916077,0.9992198,0.00002749558,0.0005860286,0.00007577414,0.000002005841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2001244,0.004840721,0.7634468,0.002190089,0.0003465088,0.0004123609,0.0007945569,0.0007373778,0.02710724],"genre_scores_gemma":[0.871659,0.001834907,0.1201983,0.0003408236,0.0001116469,0.0004988282,0.0005042454,0.0001566353,0.004695588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01263214,"threshold_uncertainty_score":0.02511722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621333565","doi":"","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Clique; Variable neighborhood search; Heuristic; Mathematical optimization; Mathematics; Local search (optimization); Computer science; Metaheuristic; Combinatorics","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Stefana Janićijević","is_ca":false},{"name":"Nenad Mladenović","is_ca":false},{"name":"Dragan Urošević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01734099212668329,"gpt":0.2219894169001398,"spread":0.2046484247734565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230521,0.000691108,0.000934094,0.0004738565,0.0006842831,0.0009586708,0.001138806,0.001387421,0.003970731],"category_scores_gemma":[0.002804748,0.0003478866,0.0007330062,0.001232148,0.0007338459,0.001667123,0.001248118,0.001101639,0.0004700275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005890468,"about_ca_system_score_gemma":0.001071945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177959,"about_ca_topic_score_gemma":0.003290844,"domain_scores_codex":[0.9989185,0.0005891025,0.00002382368,0.00020738,0.0001577187,0.00010357],"domain_scores_gemma":[0.9991205,0.0005496467,0.00007549283,0.0001222651,0.00007371634,0.00005828195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000973385,0.0001363001,0.001043803,0.0002851048,0.00009919312,0.0003250858,0.0002121493,0.7814481,0.00544597,0.1136255,0.007124545,0.09015691],"study_design_scores_gemma":[0.0000465822,0.00008811645,0.0005127707,0.000031266,0.0000250902,0.0002151763,0.0001716072,0.8677824,0.0017525,0.1217669,0.007589187,0.00001850516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05689776,0.0003718746,0.9330272,0.00045829,0.00004335438,0.0001204562,0.0001805051,0.0001754599,0.008725101],"genre_scores_gemma":[0.3768652,0.0004894388,0.6162723,0.0002583901,0.00007996639,0.0002718068,0.0008952025,0.0001829273,0.004684736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003970731,"threshold_uncertainty_score":0.01328343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618469925","doi":"","title":"Electrification of the Canadian Road Transportation Sector: A 2050 Outlook with TIMES-Canada","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Electrification; Road transport; Transport engineering; Business; Economic growth; Geography; Regional science; Environmental planning; Engineering; Electricity; Economics","authors":[{"name":"Jean‐Philippe Waaub","is_ca":false},{"name":"Olivier Bahn","is_ca":false},{"name":"Kathleen Vaillancourt","is_ca":false},{"name":"Mathilde Marcy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.001638469327502132,"gpt":0.1255540185432749,"spread":0.1239155492157728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709926,0.0009868094,0.0003057369,0.001761128,0.002637907,0.002821656,0.0010039,0.001192007,0.00873288],"category_scores_gemma":[0.00113291,0.0001923382,0.0009286631,0.006205949,0.0007278086,0.001643869,0.001149924,0.001245979,0.0007319005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.08027104,"about_ca_system_score_gemma":0.1236966,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9964702,"about_ca_topic_score_gemma":0.9980471,"domain_scores_codex":[0.9991546,0.00002377023,0.00001687965,0.00004788795,0.0004154206,0.0003414341],"domain_scores_gemma":[0.9985922,0.0000201453,0.00006025317,0.00000957766,0.001048363,0.0002694047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001017752,0.0002437613,0.1397682,0.001691538,0.0003752186,0.001439698,0.002182389,0.02490939,0.00275002,0.09793734,0.5008596,0.2268251],"study_design_scores_gemma":[0.00006924444,0.0001186656,0.3220206,0.0007392903,0.0002386971,0.000367776,0.006722769,0.009479648,0.001482572,0.005056099,0.6535258,0.0001787895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4502726,0.06328371,0.003290125,0.1081234,0.002496605,0.0001906542,0.1349806,0.0007083413,0.236654],"genre_scores_gemma":[0.8464532,0.03916173,0.003647768,0.00363612,0.0001953192,0.00006349309,0.02110027,0.000101488,0.08564045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08027104,"threshold_uncertainty_score":0.5824099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043532179","doi":"","title":"Integration of operational policies into the design phase of a material handling network","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Track (disk drive); Computer science; Phase (matter); Material handling; Loop (graph theory); Pickup; Simulation; Operations research; Engineering; Industrial engineering; Mathematics","authors":[{"name":"Ardavan Asef-Vaziri","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0137395795122284,"gpt":0.2402191491837475,"spread":0.2264795696715191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004266601,0.0007791867,0.0005372142,0.0004344721,0.0003251297,0.001383379,0.0007674423,0.0006590877,0.001390232],"category_scores_gemma":[0.01134823,0.0004493401,0.000444819,0.0004381234,0.0008343167,0.001612051,0.0006349607,0.0008474204,0.0001472948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107831,"about_ca_system_score_gemma":0.002354454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003038979,"about_ca_topic_score_gemma":0.002153445,"domain_scores_codex":[0.9972667,0.001425806,0.00008919026,0.0002547841,0.0005321248,0.0004315443],"domain_scores_gemma":[0.992229,0.004784012,0.001456553,0.0006300089,0.0005972392,0.0003031675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006855109,0.0002468292,0.002125591,0.00005751046,0.00003525378,0.0000294515,0.00005915636,0.9639012,0.002170624,0.005736782,0.00007819558,0.02487394],"study_design_scores_gemma":[0.0001103842,0.001712128,0.0019001,0.00002321104,0.00006714369,0.00002234488,0.00008571846,0.9853217,0.005382857,0.004187908,0.001164331,0.00002208464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7649227,0.0002862132,0.2221714,0.0002162834,0.00004408822,0.0003319418,0.00005862136,0.0002249309,0.01174386],"genre_scores_gemma":[0.9694098,0.00007417998,0.02985835,0.0000203019,0.000006171778,0.00005965664,0.00002430006,0.00001675085,0.000530492],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004266601,"threshold_uncertainty_score":0.02256423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605694204","doi":"","title":"CAPEX/OPEX Effective Optical Wide Area Network Design","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; Concordia University; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Dimensioning; Computer science; Operating expense; Network planning and design; Provisioning; Heuristic; Computer network; Engineering","authors":[{"name":"Abdallah Jarray","is_ca":true},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Alain Houle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005213141375044285,"gpt":0.1857001130769533,"spread":0.180486971701909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529665,0.0008183632,0.000398824,0.0005030154,0.0004335645,0.001179314,0.0007991917,0.0003959413,0.008838829],"category_scores_gemma":[0.001762896,0.0002332141,0.0002017969,0.0004884404,0.0003473201,0.0008971252,0.0005204657,0.0006032228,0.0007576821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008132361,"about_ca_system_score_gemma":0.001032329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074872,"about_ca_topic_score_gemma":0.001885289,"domain_scores_codex":[0.9995396,0.0001381029,0.00001774821,0.00005051844,0.0001813125,0.00007262662],"domain_scores_gemma":[0.9996839,0.0001098996,0.00004295274,0.00005142722,0.00009733128,0.0000145751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001910735,0.00007712487,0.0004680057,0.0002303127,0.00002706483,0.0001862857,0.00006449078,0.6432053,0.01711023,0.1178074,0.0109508,0.2096819],"study_design_scores_gemma":[0.00005221838,0.0001174907,0.0001670286,0.00002825189,0.00001639733,0.0001404686,0.00003449719,0.9462402,0.01066926,0.02217411,0.02034981,0.00001016851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0417844,0.0007584533,0.8814306,0.0006486322,0.0002547681,0.000317558,0.0002331963,0.0008545312,0.07371798],"genre_scores_gemma":[0.6618315,0.0006282621,0.3109394,0.0002823325,0.00006989812,0.0003684418,0.0001874546,0.000196388,0.02549635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008838829,"threshold_uncertainty_score":0.02956885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}