{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004513189,0.0003659741,0.0004946909,0.0001431463,0.0003322782,0.000284877,0.0005827863,0.0003191674,0.0001049018],"category_scores_gemma":[0.0004512051,0.0003849378,0.0003007587,0.00105589,0.0005681688,0.001187477,0.000139456,0.000381482,0.0000596258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001483643,"about_ca_system_score_gemma":0.000386992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003047673,"about_ca_topic_score_gemma":0.000009505398,"domain_scores_codex":[0.9973283,0.0002621088,0.0007268754,0.0006532075,0.000394959,0.0006345843],"domain_scores_gemma":[0.9970148,0.001776405,0.000343481,0.0004659898,0.0002218517,0.00017751],"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.0006306807,0.001672415,0.1344601,0.001179229,0.0002099526,0.0004214975,0.0038681,0.004730489,0.03585068,0.3212012,0.3250365,0.1707392],"study_design_scores_gemma":[0.01638233,0.001022089,0.017182,0.000692917,0.0003509812,0.0006551635,0.0001460275,0.4109122,0.1264473,0.1838747,0.2399582,0.002376029],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4001522,0.002374178,0.5845366,0.007019624,0.0014483,0.0006747246,0.00009367876,0.0003328927,0.00336778],"genre_scores_gemma":[0.2691324,0.00003339693,0.7208663,0.001633384,0.002298068,0.00008489422,0.00005784059,0.00009703751,0.005796705],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4061817,"threshold_uncertainty_score":0.9998602,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004878467,0.0002910366,0.0003824251,0.00009667839,0.0005865284,0.0005881534,0.0005495994,0.0001312765,0.000643831],"category_scores_gemma":[0.00008579954,0.0002174828,0.0001109256,0.0002293498,0.0001644801,0.0004230787,0.000102377,0.0004031952,0.001154928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003667909,"about_ca_system_score_gemma":0.00005794776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005254394,"about_ca_topic_score_gemma":0.01142795,"domain_scores_codex":[0.9981814,0.00003720507,0.0007884945,0.0005606482,0.00004549092,0.0003867804],"domain_scores_gemma":[0.9987541,0.0002769393,0.0002369875,0.0005692313,0.00005602458,0.0001067161],"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.0006370493,0.0001559373,0.0004595392,0.000004589655,0.00038747,0.00000570041,0.08338457,0.5298023,0.0001223836,0.2447379,0.1379277,0.002374926],"study_design_scores_gemma":[0.002069017,0.0001036404,0.001922858,0.00002926221,0.00003091014,0.000001815579,0.01003603,0.7193782,0.0004891094,0.007929495,0.2572546,0.0007551066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9063747,0.0004492979,0.01864189,0.05061338,0.0005244893,0.0005750339,0.00859456,0.00005628665,0.01417038],"genre_scores_gemma":[0.9807588,0.0003975764,0.006696779,0.006589796,0.00149625,0.000118256,0.0007878244,0.00003930165,0.00311544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2368084,"threshold_uncertainty_score":0.9996228,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005463462,0.0002291688,0.0003622222,0.00008770645,0.0002105666,0.00004747595,0.0003245908,0.0002320493,0.001130459],"category_scores_gemma":[0.0002478213,0.0002338088,0.0002001768,0.0005379608,0.001013823,0.0001565446,0.00002617614,0.0003477842,0.0002717095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005074544,"about_ca_system_score_gemma":0.0000310152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008544795,"about_ca_topic_score_gemma":0.0002812542,"domain_scores_codex":[0.9984177,0.0003082062,0.0004609755,0.0002752462,0.0001800947,0.0003577485],"domain_scores_gemma":[0.9979358,0.0008983915,0.0002539399,0.0006109063,0.0001645924,0.00013636],"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.00001206831,0.0003208047,0.005024771,0.0002357804,0.00009414204,0.000002485545,0.001966054,0.000001623003,0.000752404,0.9783469,0.01059469,0.002648254],"study_design_scores_gemma":[0.0002686131,0.00004432209,0.02565469,0.00007835951,0.00006271886,0.00001009924,0.0004578139,0.00007589439,0.001462424,0.9633328,0.008308444,0.0002437835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9649296,0.00284455,0.0211127,0.002155756,0.0003718075,0.0006265604,0.0002371965,0.00006558729,0.007656168],"genre_scores_gemma":[0.9706048,0.0004696879,0.01541854,0.0001259622,0.00008270227,0.00009043016,0.00003163967,0.0000427068,0.01313349],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02062992,"threshold_uncertainty_score":0.9997826,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615038,0.0001204809,0.0001213654,0.0001596572,0.00006235209,0.00004662149,0.0001234564,0.0001910677,0.00006226798],"category_scores_gemma":[0.00006965392,0.0001272168,0.00003619574,0.0003010496,0.0000503216,0.00009380723,0.000009226047,0.000636646,0.0000480678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892633,"about_ca_system_score_gemma":0.00001079805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001599916,"about_ca_topic_score_gemma":0.00003371259,"domain_scores_codex":[0.9993475,0.00001059108,0.0001759851,0.0001417365,0.0001012501,0.0002229253],"domain_scores_gemma":[0.9996822,0.00004120048,0.00001727134,0.0001623597,0.00002309674,0.00007387082],"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.000008980071,0.00009595523,0.02272726,0.0001946274,0.00006847625,0.00005059782,0.004473487,0.8635496,0.01498877,0.0463793,0.0002748855,0.04718808],"study_design_scores_gemma":[0.0008290099,0.00001455373,0.002582068,0.00003887659,0.000009705447,0.00002804544,0.0003334312,0.9864854,0.003849159,0.002349102,0.00301044,0.000470223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9464723,0.0002308533,0.04715313,0.0001722151,0.0011009,0.0001038889,0.000002182603,0.0004708332,0.004293659],"genre_scores_gemma":[0.7652483,0.00004600123,0.2342729,0.00007317668,0.0001858371,0.000014595,0.00000816698,0.00003432757,0.0001166964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1871198,"threshold_uncertainty_score":0.5187753,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249068,0.0002543325,0.0003331155,0.00014797,0.0002747638,0.0001273598,0.0002506837,0.0002081774,0.00001300917],"category_scores_gemma":[0.00007609797,0.0002268728,0.00008446953,0.0002333616,0.00005700856,0.0002463892,0.0000154992,0.0001868219,0.000009813639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003713932,"about_ca_system_score_gemma":0.00002351465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001313845,"about_ca_topic_score_gemma":0.0001226354,"domain_scores_codex":[0.9983745,0.00004027469,0.0004845728,0.0002932771,0.0003224678,0.0004849106],"domain_scores_gemma":[0.9987613,0.0005107436,0.0001105173,0.000354518,0.0001436752,0.0001192401],"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.00174683,0.0002741729,0.02927012,0.005481679,0.001676135,0.0002444053,0.01889219,0.8264584,0.03252291,0.05170032,0.002903871,0.028829],"study_design_scores_gemma":[0.007639344,0.0006128066,0.0008161755,0.000531801,0.0003973171,0.0002951215,0.006789566,0.9535497,0.005234137,0.001794276,0.02016929,0.002170489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4427291,0.002275224,0.5508527,0.00004045986,0.0004815163,0.0008155901,0.00004363505,0.0004849495,0.002276795],"genre_scores_gemma":[0.9951568,0.00002339199,0.0039702,0.00002894351,0.0004502368,0.0001001037,0.00002929291,0.00007132599,0.000169752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5524276,"threshold_uncertainty_score":0.9251606,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003946825,0.00008581935,0.0001331796,0.00003168525,0.0001163806,0.000008557166,0.0001523722,0.00009996885,0.000002836051],"category_scores_gemma":[0.00004415873,0.00006455849,0.00005327141,0.0001410718,0.0001496259,0.00006162064,0.000014518,0.0001675653,0.000002799447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007206572,"about_ca_system_score_gemma":0.000004982453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000024933,"about_ca_topic_score_gemma":0.00001463479,"domain_scores_codex":[0.9995106,0.000002081741,0.000173759,0.0000747478,0.00006553468,0.0001732332],"domain_scores_gemma":[0.9995646,0.0001872746,0.00002753013,0.0001757335,0.00002698483,0.00001784002],"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.000004294666,0.00001367791,0.0002625338,0.00003299084,0.0000272176,2.033896e-7,0.0003799523,0.6045924,0.0005169889,0.3758748,0.0002731176,0.01802182],"study_design_scores_gemma":[0.001465756,0.0002097867,0.002268268,0.00007145215,0.00009280787,0.000005600832,0.001325847,0.2220801,0.01766693,0.7102755,0.0440404,0.0004975154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.091106,0.0007149846,0.9057652,0.0006350267,0.00009471746,0.000370013,0.000007654988,0.0004535992,0.0008527906],"genre_scores_gemma":[0.7278838,0.00004056749,0.2719387,0.00001316019,0.00003038348,0.00005280626,0.000003554219,0.00001508122,0.00002206112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6367778,"threshold_uncertainty_score":0.2632619,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003898107,0.0001477485,0.0001706028,0.0001831036,0.0001665133,0.00007720415,0.000357891,0.0001121496,0.00004303475],"category_scores_gemma":[0.00009758284,0.0001222803,0.0001047297,0.0007983956,0.0001261164,0.0001218176,0.00001427114,0.0002714344,0.00004365652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003132897,"about_ca_system_score_gemma":0.00006147976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002830631,"about_ca_topic_score_gemma":0.0000215356,"domain_scores_codex":[0.9987077,0.0002465836,0.0001933148,0.0003466921,0.0002331382,0.0002725317],"domain_scores_gemma":[0.9992782,0.0002151824,0.00004924201,0.000340791,0.00002890353,0.00008771859],"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.0001156152,0.0006514465,0.1165084,0.0000484035,0.00004637336,0.0003401529,0.003545752,0.005910099,0.0002367356,0.8146292,0.003157339,0.05481054],"study_design_scores_gemma":[0.03804754,0.001286124,0.05194763,0.0004974327,0.00007926921,0.0002194184,0.0008431164,0.3446031,0.0546387,0.2023451,0.3001349,0.005357562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7220837,0.0004098275,0.2620774,0.001409422,0.00129158,0.000301317,0.000003222845,0.0001798075,0.01224367],"genre_scores_gemma":[0.911923,0.00005205762,0.08710085,0.000780835,0.00005988307,0.00001982508,0.000001772948,0.00000812722,0.00005363789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.612284,"threshold_uncertainty_score":0.4986444,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003041058,0.000173473,0.0002037016,0.000296566,0.0002075714,0.0001716325,0.000122856,0.0001732874,0.0005121559],"category_scores_gemma":[0.000125395,0.000160464,0.00004524758,0.0007320505,0.0002074536,0.0007594901,0.00003223848,0.0002171651,0.000187339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006462997,"about_ca_system_score_gemma":0.00002831432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002281022,"about_ca_topic_score_gemma":0.0001472442,"domain_scores_codex":[0.9989543,0.0000100563,0.0003376775,0.0002369805,0.0001718865,0.0002891122],"domain_scores_gemma":[0.9994953,0.00004363243,0.000129511,0.0001252235,0.0001970768,0.000009206274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0005275313,0.0002991144,0.01089623,0.0001193461,0.00005290696,0.0001249098,0.0005646355,0.00005208532,0.01107003,0.959838,0.006666485,0.009788772],"study_design_scores_gemma":[0.01865413,0.0001786581,0.4865197,0.0004620186,0.0002919867,0.00004527156,0.004899262,0.01217723,0.003285691,0.04826334,0.4211907,0.00403199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617628,0.00002914822,0.001812924,0.0006215434,0.001164953,0.0002026372,0.000001748806,0.0001022151,0.03430207],"genre_scores_gemma":[0.9956564,0.000003576181,0.0001153105,0.0008783902,0.002573086,0.000008773216,0.00007565419,0.00001848977,0.000670275],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9115746,"threshold_uncertainty_score":0.6543534,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001068263,0.0001004374,0.00009852085,0.00002611837,0.0003945396,0.00003410274,0.00008754303,0.00006095821,0.003538724],"category_scores_gemma":[0.00002658082,0.00007374033,0.00004269409,0.0001119981,0.0000958413,0.0002032884,0.000008356276,0.00007363751,0.00008676104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001343624,"about_ca_system_score_gemma":0.00001016912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369116,"about_ca_topic_score_gemma":0.0001672292,"domain_scores_codex":[0.9993117,0.00002698561,0.0001577863,0.000158472,0.0001281908,0.0002168412],"domain_scores_gemma":[0.9997146,0.00003111226,0.00004328486,0.000114322,0.00004040749,0.00005630059],"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.00005264378,0.00004445158,0.1668669,0.00002854672,0.0000726924,0.00002305349,0.01266738,0.7822838,0.00005291764,0.001548085,0.0006900131,0.03566954],"study_design_scores_gemma":[0.0002630585,0.00007035715,0.1342412,0.00001307822,0.00004823314,0.00001367491,0.0008622551,0.8606088,0.0003343458,0.001655998,0.001639499,0.0002494987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7966171,0.0001577482,0.1996709,0.000187229,0.0004875306,0.0001344856,0.00001219878,0.00006318526,0.002669665],"genre_scores_gemma":[0.8511656,0.00008685897,0.1479919,0.000264208,0.0001114811,0.000001313833,0.0001304864,0.000005329561,0.0002428929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07832499,"threshold_uncertainty_score":0.9973722,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380095,0.0001795103,0.0002854947,0.0001268223,0.0004151331,0.0001148103,0.0001136342,0.0001623222,0.00003304883],"category_scores_gemma":[0.0001087295,0.0001961787,0.00007127605,0.0002042987,0.0001456727,0.0002781765,0.00001501847,0.0002174363,0.00007762033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000193733,"about_ca_system_score_gemma":0.0000580816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009633378,"about_ca_topic_score_gemma":0.0004590204,"domain_scores_codex":[0.9988657,0.000008477766,0.0003921355,0.0003642782,0.00005786769,0.0003115576],"domain_scores_gemma":[0.9993473,0.00004260663,0.0002241195,0.0002408655,0.00004352965,0.0001016311],"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.00002897855,0.0001101822,0.02235454,0.0000209398,0.00003963715,0.000008880722,0.002403079,0.03429358,0.00008090443,0.9359917,0.001218621,0.00344898],"study_design_scores_gemma":[0.001487518,0.000113412,0.008845083,0.00002646844,0.00001704985,0.00001891606,0.0001265575,0.07662477,0.0002815865,0.9087503,0.003128588,0.0005797638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5152534,0.0003327917,0.4795287,0.001276649,0.000170079,0.0001321445,0.00009095023,0.00006363277,0.00315159],"genre_scores_gemma":[0.930074,0.00003493934,0.06920471,0.0001361817,0.000154002,0.00002993024,0.00007787818,0.00003397978,0.0002543347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4148206,"threshold_uncertainty_score":0.7999936,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000323938,0.00009487126,0.0002084123,0.0001534019,0.00006143068,0.0000331829,0.0001456664,0.00007484545,0.00001837085],"category_scores_gemma":[0.000006446936,0.00009817437,0.00005137116,0.00008699467,0.00008178651,0.000109227,0.00001646737,0.00008641227,0.00001913739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001078919,"about_ca_system_score_gemma":0.000002269734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001002011,"about_ca_topic_score_gemma":0.00008824462,"domain_scores_codex":[0.9992648,0.000008333405,0.0003490263,0.0001919753,0.000008831093,0.0001770081],"domain_scores_gemma":[0.9996017,0.00002074019,0.0001595476,0.0001911201,0.000002938063,0.00002395998],"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.00001327694,0.00004035156,0.002882981,0.00003062331,0.0000173365,0.000002209697,0.002159073,0.00009676765,0.000002355203,0.9886883,0.00008461129,0.005982035],"study_design_scores_gemma":[0.001261918,0.0001388189,0.4181186,0.00002967879,0.00001441623,0.00002054604,0.002610853,0.007439001,0.00001972344,0.5448164,0.02514761,0.0003824183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9789782,0.001430047,0.0001701449,0.006146102,0.00008809263,0.0001528139,0.00007092968,0.000008344921,0.01295529],"genre_scores_gemma":[0.981276,0.01665154,0.0008279367,0.001068265,0.00002424298,0.000008213096,0.00001119219,0.000006926451,0.000125649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4438719,"threshold_uncertainty_score":0.4003434,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001253851,0.00009558892,0.0002310609,0.0001073912,0.0001076294,0.00004595393,0.00009847519,0.00008267922,0.00001348504],"category_scores_gemma":[0.00005730558,0.0001124623,0.00003352816,0.000158555,0.00007153107,0.00009746801,0.00001449338,0.0001311878,0.00005699835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004451732,"about_ca_system_score_gemma":0.000005571615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007312731,"about_ca_topic_score_gemma":0.000003137438,"domain_scores_codex":[0.9992705,0.00000159208,0.0002589985,0.0002546497,0.0000162408,0.0001980418],"domain_scores_gemma":[0.9996984,0.00002683967,0.00009378273,0.0001206776,0.000009538317,0.0000507667],"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.000008615309,0.00002255306,0.001789355,0.000004271842,0.000003642154,0.00000429422,0.0004695486,0.00002064437,0.00003605003,0.9917017,0.00005934729,0.005879994],"study_design_scores_gemma":[0.001180682,0.0001637125,0.1228975,0.00002626098,0.000007512861,0.00002812151,0.0001593254,0.008718305,0.00004949309,0.8475549,0.01863727,0.000576933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6392173,0.002215428,0.3479033,0.002611803,0.00005922909,0.0001977077,0.00004546589,0.00007346142,0.007676365],"genre_scores_gemma":[0.990478,0.00007481567,0.008563332,0.0003881657,0.00008510951,0.00001738363,0.000007312408,0.00001232668,0.0003735489],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3512607,"threshold_uncertainty_score":0.4586079,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001658173,0.0003182217,0.000308507,0.0001033316,0.0006257251,0.0001974523,0.0004435557,0.0005098442,0.0006375088],"category_scores_gemma":[0.0003342977,0.0002995676,0.0001716519,0.0006809369,0.0002366765,0.0002048108,0.00005740068,0.0008303928,0.00007880435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004178076,"about_ca_system_score_gemma":0.0001173159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002893749,"about_ca_topic_score_gemma":0.00001053545,"domain_scores_codex":[0.9978212,0.0003031814,0.000412729,0.0003633261,0.0002442055,0.000855353],"domain_scores_gemma":[0.9973318,0.001688848,0.00006519681,0.000560289,0.0001780099,0.0001758878],"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.0000399879,0.00005267054,0.001532962,0.00019133,0.0002014476,0.00001700085,0.001837829,0.4709587,0.0003669506,0.4233444,0.00315132,0.09830549],"study_design_scores_gemma":[0.0009718875,0.00007773652,0.0005069968,0.00006431316,0.0001387003,0.0001099388,0.0005259622,0.7232456,0.0008713951,0.02216105,0.2508945,0.0004318669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00314008,0.005291737,0.964152,0.01241037,0.002382684,0.0007013263,0.0000481239,0.0002796446,0.01159399],"genre_scores_gemma":[0.0291322,0.002477469,0.944663,0.0009333138,0.002039955,0.0001389898,0.00003065486,0.0002233869,0.02036104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4011833,"threshold_uncertainty_score":0.9999456,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506424,0.0002529991,0.0003677015,0.0003564812,0.0004312434,0.0004062717,0.0003276884,0.0001711819,0.00003157763],"category_scores_gemma":[0.0009768124,0.0002000886,0.00009052997,0.000607136,0.0001701041,0.000380727,0.00008463499,0.0002098311,0.00008590926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005645545,"about_ca_system_score_gemma":0.00004617042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001464883,"about_ca_topic_score_gemma":0.000008781456,"domain_scores_codex":[0.9977601,0.00005352306,0.0005376814,0.0004935549,0.0005622293,0.0005929438],"domain_scores_gemma":[0.9981254,0.0007228166,0.0002342548,0.0003287889,0.0001740389,0.0004146557],"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.00007822635,0.00007267191,0.0002657312,0.000005283184,0.0000311068,0.000001118559,0.01016145,0.02895586,0.00003645496,0.01507695,0.0004544822,0.9448607],"study_design_scores_gemma":[0.004869398,0.0007984138,0.00648888,0.0001165411,0.0003517243,0.0001134123,0.01835057,0.8666481,0.0002918582,0.05412113,0.04504105,0.002808863],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05559293,0.0002127869,0.9421377,0.0003490683,0.0005090673,0.0009561956,0.00002348109,0.00007740051,0.0001413444],"genre_scores_gemma":[0.750664,0.000007127209,0.2480202,0.0002767975,0.0004136619,0.000231286,0.0000175381,0.00003100134,0.0003383932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9420518,"threshold_uncertainty_score":0.8159375,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004621418,0.0003586015,0.0003374337,0.00009735578,0.001052089,0.0001441015,0.0005506077,0.0004234215,0.0003688002],"category_scores_gemma":[0.0002444736,0.0002506762,0.0002721814,0.0004018841,0.0004878443,0.00005577665,0.00002226548,0.001112254,0.0002756822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007876287,"about_ca_system_score_gemma":0.00004758846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008349434,"about_ca_topic_score_gemma":0.00001144061,"domain_scores_codex":[0.9982696,0.0002520017,0.0003754834,0.0003760666,0.0002956305,0.0004311884],"domain_scores_gemma":[0.9976986,0.0009393019,0.0002265703,0.000947849,0.00005798376,0.0001297061],"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.00006749498,0.0002586745,0.00004046123,0.00002911409,0.00007803302,0.00001252775,0.006631142,0.00002029721,0.0002616164,0.9739748,0.01286351,0.005762385],"study_design_scores_gemma":[0.0006514103,0.0001616192,0.001997238,0.00007478608,0.0001206669,0.00002923179,0.0007562816,0.0001291296,0.0004868199,0.965421,0.02986466,0.0003071216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9439978,0.0007892313,0.00457791,0.02009071,0.0003054248,0.001067193,0.00007652478,0.0002110047,0.02888423],"genre_scores_gemma":[0.9894935,0.000102424,0.0005447339,0.005357001,0.0003195648,0.00004203298,0.00001293462,0.00003497794,0.004092832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04549573,"threshold_uncertainty_score":0.9999946,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006091974,0.0002372186,0.0002138516,0.00007656457,0.0003901139,0.00005663222,0.00007712587,0.0003438533,0.00004400441],"category_scores_gemma":[0.0001744381,0.000267434,0.0001367809,0.0001811511,0.0002155217,0.0006755384,0.00001290519,0.0002796705,0.00001944538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009380128,"about_ca_system_score_gemma":0.00002633785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001264686,"about_ca_topic_score_gemma":0.00003852976,"domain_scores_codex":[0.9985745,0.00008059132,0.0003183395,0.0002732877,0.0001285908,0.0006246984],"domain_scores_gemma":[0.9993291,0.0001231334,0.00008633237,0.0002087775,0.0001157551,0.0001369321],"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.00004844576,0.00009477655,0.000814908,0.0003964394,0.00009824311,3.884745e-7,0.004711266,0.845929,0.001371552,0.1312046,0.003058678,0.01227169],"study_design_scores_gemma":[0.002934562,0.0003003597,0.008611569,0.0007118764,0.0008514735,0.000171646,0.01267144,0.8247299,0.01483863,0.07258361,0.05943794,0.002156978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2118967,0.002650359,0.7725711,0.006185234,0.00518445,0.0006597147,0.00001633217,0.0001638115,0.0006722269],"genre_scores_gemma":[0.9352711,0.0006930254,0.06054997,0.0001565117,0.001632506,0.00007562333,0.0001308917,0.00005901044,0.001431375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7233744,"threshold_uncertainty_score":0.9999778,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003316539,0.0001524386,0.0001507383,0.00009049365,0.0002047359,0.00007016809,0.00006729625,0.0001808437,0.00002259441],"category_scores_gemma":[0.0001919605,0.0001773704,0.00006005443,0.0002475059,0.00004441286,0.0001667042,0.000003899844,0.0001205439,0.000003405816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002085963,"about_ca_system_score_gemma":0.00002810339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002809545,"about_ca_topic_score_gemma":0.000003600508,"domain_scores_codex":[0.9990728,0.0001075817,0.0002466485,0.0002100866,0.0001237179,0.0002391868],"domain_scores_gemma":[0.9995388,0.00006655727,0.00004839615,0.0001685907,0.0001122102,0.00006542129],"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.00001855994,0.0001171212,0.002716078,0.0002173577,0.0001248332,0.000008297966,0.003632715,0.5748179,0.0127452,0.05759586,0.005690187,0.3423159],"study_design_scores_gemma":[0.0006639537,0.00004120619,0.000092241,0.000005588952,0.00002177117,0.00001457075,0.0000858452,0.9780185,0.01055881,0.0005556207,0.009717971,0.0002239724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06531078,0.0001072157,0.9326203,0.00004958945,0.000453949,0.0005461529,0.000008346579,0.0003621546,0.0005414734],"genre_scores_gemma":[0.1044779,0.00004436803,0.8943198,0.00008267119,0.0002811906,0.000174783,0.00008202216,0.0000791573,0.0004580546],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4032005,"threshold_uncertainty_score":0.7232953,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001839255,0.0003213325,0.0004805744,0.0006460503,0.0002392165,0.00007241256,0.0003711707,0.000119832,0.0001844454],"category_scores_gemma":[0.0006799178,0.0002973334,0.00007904254,0.001403572,0.00009455046,0.0001904842,0.00009860389,0.000337332,0.0001650555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008015318,"about_ca_system_score_gemma":0.0003346421,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9048865,"about_ca_topic_score_gemma":0.5497349,"domain_scores_codex":[0.9975343,0.000515848,0.0005171302,0.0008906843,0.0001044815,0.0004375377],"domain_scores_gemma":[0.9983929,0.0004374766,0.0001374304,0.000731881,0.0001490279,0.0001512653],"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.004562545,0.00641408,0.9263442,0.00001504593,0.003991023,0.0004057017,0.02846144,0.003094254,0.006466241,0.0004186349,0.00419003,0.01563684],"study_design_scores_gemma":[0.003062482,0.0002215972,0.9874746,0.00001939471,0.0002193694,0.00000176137,0.007495198,0.0004904915,0.0001723786,0.0002097472,0.0002457406,0.0003872752],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9971091,0.0001248234,0.0006505006,0.0001847478,0.0002877773,0.0009408115,0.0003804046,0.0000723737,0.0002494782],"genre_scores_gemma":[0.9972386,0.00000466075,0.0006259257,0.001013845,0.00003117177,0.0002060314,0.0007038179,0.00002812581,0.0001478345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3551517,"threshold_uncertainty_score":0.9999479,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004752005,0.00027399,0.0002948699,0.0001059261,0.0003362317,0.0002028453,0.00007004305,0.0003745957,0.0009130521],"category_scores_gemma":[0.0002549055,0.0003431723,0.0001429655,0.0002141732,0.000159879,0.0002540293,0.00000757177,0.0002472809,0.00004857681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003026206,"about_ca_system_score_gemma":0.00008404185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007388198,"about_ca_topic_score_gemma":0.00007873716,"domain_scores_codex":[0.9985009,0.000153978,0.0004472678,0.0002803639,0.0001643684,0.0004530736],"domain_scores_gemma":[0.9992054,0.0001927691,0.00008593026,0.0002273963,0.0001586337,0.0001299404],"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.00002187569,0.00007503551,0.0002037638,0.0004847338,0.0001304912,0.000004919069,0.00895215,0.3523126,0.003240654,0.6101735,0.02157943,0.002820903],"study_design_scores_gemma":[0.002681992,0.0001900238,0.00003737159,0.00006454135,0.0001220173,0.00003363841,0.001259772,0.2003199,0.01030532,0.004175973,0.7799838,0.0008255836],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2145748,0.006748877,0.7599296,0.002499524,0.006487297,0.001122879,0.0002692035,0.0004032991,0.007964549],"genre_scores_gemma":[0.3164055,0.001826564,0.6051508,0.0006979612,0.0016784,0.0003549545,0.0005577128,0.0002528139,0.07307532],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7584044,"threshold_uncertainty_score":0.999902,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389986,0.0001100729,0.0001236517,0.0002654335,0.0001941235,0.0001107416,0.0006175892,0.00008559439,0.000003477432],"category_scores_gemma":[0.0000553369,0.0001134262,0.00004179907,0.0009443067,0.00008085862,0.0002951153,0.00009834217,0.0002191672,0.00001724688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007335426,"about_ca_system_score_gemma":0.00002607909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001527297,"about_ca_topic_score_gemma":0.00002625581,"domain_scores_codex":[0.9988691,0.00002096003,0.0002390458,0.0003711527,0.0001630932,0.0003366903],"domain_scores_gemma":[0.9991906,0.0001589342,0.00006632416,0.0004657653,0.00002559026,0.0000928212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000002611067,0.00008846034,0.003892673,0.00001320062,0.00001361586,0.00007344688,0.005084045,0.00002503756,0.0008884053,0.3589674,0.002497032,0.6284541],"study_design_scores_gemma":[0.00570851,0.0005582537,0.4817489,0.0007656087,0.00008064529,0.000635204,0.01289527,0.1728069,0.01978039,0.1083324,0.191575,0.005112987],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4404761,0.0001758851,0.5545973,0.000602423,0.0002345855,0.00007651024,0.000003303737,0.0001367823,0.003697163],"genre_scores_gemma":[0.5086544,0.00002544038,0.4906404,0.0003343618,0.0001223599,0.00001147253,0.000008026244,0.00001059996,0.0001930362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6233411,"threshold_uncertainty_score":0.4625387,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001400882,0.0001036443,0.0001882108,0.000152394,0.0003074852,0.00006675725,0.00005912426,0.0001032159,0.00004694723],"category_scores_gemma":[0.00010122,0.0001238882,0.00004646974,0.0001645973,0.0001135519,0.0002842079,0.00001737001,0.0001112794,0.0000260259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001244861,"about_ca_system_score_gemma":0.00001090675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00039427,"about_ca_topic_score_gemma":0.0001948509,"domain_scores_codex":[0.9992715,0.000007388643,0.0003004585,0.0002272894,0.00002685521,0.0001665538],"domain_scores_gemma":[0.99961,0.00003691747,0.0001589127,0.0001210849,0.0000203298,0.0000527303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001115481,0.00004004134,0.3671006,0.0000137797,0.00002293503,0.000002013511,0.004439229,0.0006063607,0.0004099648,0.6142213,0.0004920157,0.01264059],"study_design_scores_gemma":[0.0005495608,0.0000437063,0.7600388,0.00001744204,0.00001202293,0.00001500262,0.0002448184,0.03501417,0.0003628768,0.0299397,0.173378,0.0003839288],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9497315,0.001413009,0.0459778,0.0009321126,0.0001886274,0.0001008301,0.00002662422,0.00003393282,0.001595581],"genre_scores_gemma":[0.981464,0.0002794944,0.01724693,0.00006091942,0.0005796906,0.000005558052,0.0000136482,0.00001508793,0.0003346299],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5842816,"threshold_uncertainty_score":0.5052015,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006113859,0.0001081502,0.0002109936,0.0001245048,0.0001123042,0.00004005122,0.000218898,0.0003060456,0.0002449617],"category_scores_gemma":[0.0001681703,0.0000960957,0.00009195619,0.0002115198,0.0003542794,0.0001549913,0.00001911238,0.0004498445,0.00004591171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006231996,"about_ca_system_score_gemma":0.00001477306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005646432,"about_ca_topic_score_gemma":0.00008996612,"domain_scores_codex":[0.9991108,0.00003188739,0.0003996163,0.0002140623,0.0000422798,0.0002013403],"domain_scores_gemma":[0.9994785,0.00009674278,0.0001669483,0.0002123798,0.00001893246,0.00002647613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001588267,0.00006991436,0.05551558,0.00001501444,0.00001388839,0.000004430733,0.005455682,0.000003528979,0.00000650258,0.9378141,0.0007220322,0.0002204558],"study_design_scores_gemma":[0.001150311,0.0003585852,0.8150558,0.000007184938,0.000004776087,0.000003218084,0.0007808566,0.0001076675,0.00009243014,0.1563353,0.02589514,0.0002087618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8607041,0.0003675973,0.0001677751,0.0002536981,0.0008657498,0.00009936679,0.0000272575,0.00001235432,0.1375021],"genre_scores_gemma":[0.9984993,0.000181465,0.0003618754,0.0004967023,0.0001520244,0.00001607432,0.000008171827,0.0000102948,0.0002740932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7814788,"threshold_uncertainty_score":0.3918669,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006349685,0.0001343501,0.0001343097,0.00004125545,0.0003744858,0.00008608545,0.0001352967,0.00005361541,0.005262246],"category_scores_gemma":[0.00000260906,0.0001313098,0.00004770709,0.00006763636,0.00006385038,0.000322683,0.00001388018,0.00008282816,0.0003320239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002729544,"about_ca_system_score_gemma":0.00005249849,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.4118105,"about_ca_topic_score_gemma":0.4179279,"domain_scores_codex":[0.9992545,0.000002856958,0.0001806504,0.0001764555,0.0001334683,0.0002521118],"domain_scores_gemma":[0.9997861,0.00001080447,0.000041927,0.0001241164,0.00001701201,0.00001999826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002158976,0.0001553094,0.1721061,0.0001778472,0.0003131541,0.0002347327,0.00130022,0.007889261,0.001725873,0.1945896,0.5718701,0.04942202],"study_design_scores_gemma":[0.0003386884,0.000002051929,0.03690544,0.000003835627,0.00001853729,0.000004436364,0.00005318105,0.0006417807,0.00007124523,0.0004974981,0.9612595,0.0002037788],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9397107,0.00005831789,0.00004882059,0.003175752,0.0003112804,0.0000900044,0.00001123151,0.00005003788,0.05654389],"genre_scores_gemma":[0.9794183,0.00001309797,0.00006199174,0.007179781,0.001015708,0.00001403343,0.0001115068,0.00001695127,0.01216865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3893895,"threshold_uncertainty_score":0.9956471,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435649,0.00007549561,0.0001691539,0.0001362847,0.0001401568,0.00003358948,0.00007702997,0.00004286617,0.0005040814],"category_scores_gemma":[0.00007490083,0.00006941509,0.00006995973,0.0001699106,0.00007760319,0.00004341469,0.00001156425,0.00009146219,0.00003252433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003839068,"about_ca_system_score_gemma":0.000002793244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002000412,"about_ca_topic_score_gemma":0.00003716074,"domain_scores_codex":[0.9993849,0.00003363813,0.0002773173,0.0001690105,0.00003024944,0.000104889],"domain_scores_gemma":[0.9995052,0.000139083,0.0001776334,0.0001398402,0.0000189878,0.0000192344],"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.00001016425,0.00002885165,0.005020405,0.00001048387,0.00002697295,7.243964e-7,0.0001100396,0.0001147511,0.00005000862,0.9924394,0.00141847,0.000769707],"study_design_scores_gemma":[0.001719395,0.0001095644,0.1138181,0.00007009492,0.00005499132,0.000009226093,0.0006665553,0.1027113,0.0004297795,0.7251691,0.0544825,0.0007594557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9570398,0.0004794557,0.003457133,0.002485311,0.0001759484,0.00007452881,0.00002736246,0.0000153798,0.0362451],"genre_scores_gemma":[0.996533,0.00006987448,0.0001559744,0.0002293797,0.00005520126,0.000009154229,0.00001777063,0.000007929802,0.002921702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2672704,"threshold_uncertainty_score":0.5519338,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153041,0.000227443,0.0002088037,0.00008701654,0.0003393248,0.000185995,0.0003799966,0.0001790617,0.00005156064],"category_scores_gemma":[0.0001329904,0.0001987923,0.00005952451,0.0004542306,0.000105516,0.0002530867,0.00009441801,0.0005321419,0.00003046797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003016159,"about_ca_system_score_gemma":0.00006067901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000126665,"about_ca_topic_score_gemma":0.00000347431,"domain_scores_codex":[0.9983577,0.0002259787,0.0002767285,0.0002623512,0.0003457129,0.0005315689],"domain_scores_gemma":[0.9991733,0.000142159,0.00004543428,0.0003314596,0.0001188996,0.0001887355],"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.00002995245,0.00005577296,0.003981587,0.0001177894,0.0002180015,0.00002555996,0.01012943,0.8715085,0.01305583,0.06772505,0.01815518,0.01499731],"study_design_scores_gemma":[0.001118209,0.0000495033,0.0003161912,0.00003751613,0.00004809388,0.00003507212,0.0009661216,0.9834276,0.001366453,0.00336899,0.008747912,0.0005183317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07946615,0.0004716558,0.9005148,0.0004419081,0.0004794912,0.0003521857,0.00001613982,0.0007093012,0.01754833],"genre_scores_gemma":[0.3461444,0.0001123427,0.6514556,0.0003863128,0.0004436796,0.00004162499,0.00004463536,0.0001346379,0.00123674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2666783,"threshold_uncertainty_score":0.8106517,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500083,0.0001167033,0.000151797,0.0002686992,0.0004553467,0.00003623897,0.0004067215,0.0001022862,0.000002379898],"category_scores_gemma":[0.0001855469,0.0001143871,0.00005272604,0.0006461176,0.000380606,0.0005633482,0.00009134827,0.0002646802,0.000004325664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006137671,"about_ca_system_score_gemma":0.00005227848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002289741,"about_ca_topic_score_gemma":0.00004086279,"domain_scores_codex":[0.9988366,0.00009153866,0.0001765336,0.0003870034,0.0001789164,0.0003294484],"domain_scores_gemma":[0.9990829,0.0003069404,0.00004725326,0.0003833968,0.00008150403,0.00009796633],"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.00003840387,0.00005566429,0.01875285,0.00002123497,0.00001085618,0.0000457178,0.002463284,0.00007207039,0.0003544161,0.9620056,0.000314131,0.01586583],"study_design_scores_gemma":[0.00112552,0.0001126516,0.06482249,0.00001459202,0.000003369527,0.0001108124,0.00007272026,0.009118578,0.0006097126,0.9192576,0.004451035,0.0003009425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.523149,0.0001860161,0.4742838,0.001357147,0.00008431454,0.0003943415,0.000003985508,0.00008648916,0.0004549601],"genre_scores_gemma":[0.8485307,0.0001027356,0.1502506,0.0001975905,0.00002680949,0.00006763514,0.000003944837,0.00001441626,0.0008056136],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3253817,"threshold_uncertainty_score":0.4664569,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002454161,0.0002327766,0.0002719111,0.00009792561,0.0001787534,0.00007765195,0.0000704348,0.00009393896,0.000001932718],"category_scores_gemma":[0.0001063173,0.0002279949,0.00003755161,0.0001173454,0.0001171182,0.0001271195,0.00001134121,0.0001831724,0.000001316727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002059068,"about_ca_system_score_gemma":0.00006836568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001577801,"about_ca_topic_score_gemma":0.0000632858,"domain_scores_codex":[0.9989108,0.00002623436,0.0003047568,0.0002646785,0.0001314315,0.0003620785],"domain_scores_gemma":[0.9994026,0.000176938,0.00008571467,0.0001463662,0.00009563983,0.00009267144],"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.0001001551,0.00005639182,0.009507069,0.002000922,0.0002754145,0.0002244513,0.002478828,0.9030504,0.03286049,0.04012786,0.001929865,0.007388097],"study_design_scores_gemma":[0.001961839,0.0001718694,0.001715543,0.0002862648,0.0001362901,0.0002652115,0.0006547821,0.9878565,0.004698767,0.00117868,0.0002850714,0.0007891473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5479739,0.00007816665,0.4504179,0.00006052644,0.00004356564,0.0003216651,0.00001785366,0.0003359117,0.0007505438],"genre_scores_gemma":[0.8944383,0.00002791255,0.1049786,0.00004803668,0.0002335048,0.00005789835,0.00007045541,0.00007519621,0.00007005201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3464645,"threshold_uncertainty_score":0.9297363,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045983,0.0001882107,0.0002553528,0.000053553,0.0004269469,0.00001878656,0.0003988847,0.0001461091,0.0002321829],"category_scores_gemma":[0.000111622,0.0001498559,0.0003070437,0.000292743,0.001027468,0.00007316712,0.00002346651,0.0002211017,0.00002478003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002840535,"about_ca_system_score_gemma":0.00002719052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009918779,"about_ca_topic_score_gemma":0.0001617368,"domain_scores_codex":[0.9989299,0.00008569337,0.0003599322,0.0002068574,0.000116183,0.0003014294],"domain_scores_gemma":[0.9980209,0.0009887102,0.0002473766,0.0005788128,0.00009733468,0.00006681283],"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.00007782281,0.0002408138,0.0001990154,0.000275136,0.0001485523,0.000001846812,0.0100996,0.000003350668,0.0002017359,0.9828296,0.002916557,0.003005926],"study_design_scores_gemma":[0.0005057967,0.00005579523,0.0001382766,0.00005722608,0.0003059428,0.00001201671,0.002190615,0.0001429262,0.001776647,0.9208453,0.07380312,0.0001663862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2020443,0.01247467,0.759464,0.006658462,0.001161197,0.002358495,0.001322343,0.0001261279,0.01439042],"genre_scores_gemma":[0.8879237,0.0008374506,0.08687358,0.0002547982,0.0002593143,0.0004463726,0.00001653424,0.00007256667,0.02331565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6858794,"threshold_uncertainty_score":0.6110945,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008623667,0.0001049779,0.0003010788,0.000161695,0.00003957522,0.000010689,0.0000885237,0.00007860559,0.0006971327],"category_scores_gemma":[0.000008654655,0.0001276151,0.0001206085,0.00005286652,0.0001221348,0.0001009782,0.00003254283,0.00007461967,0.00004243859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001918461,"about_ca_system_score_gemma":0.00001005137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007347445,"about_ca_topic_score_gemma":0.00007162119,"domain_scores_codex":[0.9990699,0.000005161548,0.0005333588,0.0001887107,0.00002257269,0.0001802418],"domain_scores_gemma":[0.9993922,0.00001066518,0.0003966599,0.0001569764,0.000003758919,0.00003977164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00006975443,0.0004718413,0.1021392,0.0002437574,0.000213412,0.00000387997,0.03143039,0.00008380991,0.013563,0.8478586,0.00009771671,0.003824623],"study_design_scores_gemma":[0.008989255,0.0007631775,0.6033775,0.00005233275,0.00005876567,0.00002679367,0.009992728,0.0002734711,0.1327759,0.2398828,0.0027821,0.001025165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9969324,0.0001475173,0.0008727391,0.0002504213,0.0001488178,0.0001797514,0.000649035,0.000009312464,0.0008099673],"genre_scores_gemma":[0.9988284,0.0003597005,0.0005413961,0.00007230053,0.00007783036,0.00001430876,0.00005283889,0.00001565516,0.00003763706],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6079758,"threshold_uncertainty_score":0.7633114,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002029714,0.0001117537,0.0001530101,0.0000495649,0.0001293323,0.00001821208,0.0001043859,0.00007746203,0.00007851276],"category_scores_gemma":[0.00009612567,0.00007931041,0.00004166503,0.000156982,0.0002802011,0.00008911139,0.00001516541,0.00008317603,0.00003717788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044737,"about_ca_system_score_gemma":0.000006974759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007500147,"about_ca_topic_score_gemma":0.00006410532,"domain_scores_codex":[0.9993167,0.00006251756,0.0001823093,0.0001784166,0.00008478815,0.0001752937],"domain_scores_gemma":[0.9992808,0.000352473,0.00005994337,0.0002359024,0.00001381344,0.00005712013],"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.000006976562,0.00004150565,0.01300635,0.00003758496,0.00001084331,0.000004116049,0.001134245,2.634336e-8,0.0009387111,0.9823798,0.0004052499,0.0020346],"study_design_scores_gemma":[0.0003285198,0.000007774117,0.007163937,0.0000598602,0.00001162599,0.00001127138,0.00018542,0.000005007735,0.0007153758,0.9896291,0.001754052,0.0001280806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9927421,0.00007030613,0.003101671,0.0006857227,0.00003015511,0.0001675925,0.00001145328,0.00006754639,0.003123443],"genre_scores_gemma":[0.9940622,0.0000819659,0.004915232,0.00008100545,0.00002102698,0.00005748224,0.000001323415,0.00001624233,0.0007634687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00724928,"threshold_uncertainty_score":0.3234185,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871752,0.0001231572,0.0001630101,0.00002468476,0.0001025658,0.00001522726,0.0001456647,0.0000796433,0.00005063677],"category_scores_gemma":[0.0001100737,0.00008663221,0.00003941432,0.0001711541,0.0002619286,0.000105434,0.00006349612,0.00008518218,0.000009580174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008741717,"about_ca_system_score_gemma":0.00002057503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009791052,"about_ca_topic_score_gemma":0.0001090612,"domain_scores_codex":[0.999003,0.00005700934,0.0002615891,0.0001869952,0.0003365624,0.0001548314],"domain_scores_gemma":[0.9992779,0.0001273458,0.0002523292,0.0002333898,0.00004683853,0.00006213781],"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.0001015411,0.00005735142,0.08015718,0.00002055105,0.00002683324,0.00000284952,0.003104411,0.9052833,0.009788418,0.0001606095,0.00003071044,0.00126619],"study_design_scores_gemma":[0.0009540247,0.0001167323,0.1759616,0.00002838839,0.00004125876,0.000002677459,0.0001922171,0.8190452,0.00265605,0.0005729824,0.0002870579,0.0001418263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9792457,0.000009570227,0.01955214,0.00006334636,0.00007493944,0.0003188497,0.00001986955,0.00001937764,0.0006961909],"genre_scores_gemma":[0.9957857,0.000001636858,0.003726408,0.00005434293,0.0000181674,0.00000713367,0.00001474864,0.00001604766,0.0003758187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09580438,"threshold_uncertainty_score":0.3532759,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005101979,0.0004319166,0.0007531153,0.0001510294,0.000228774,0.00008437646,0.0001787632,0.0004283167,0.0002369691],"category_scores_gemma":[0.002029588,0.0003248371,0.0002213642,0.0002936817,0.0003546804,0.0001818051,0.00004145211,0.000569947,0.00001892499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003113334,"about_ca_system_score_gemma":0.00007668394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001335379,"about_ca_topic_score_gemma":0.00001615048,"domain_scores_codex":[0.9974781,0.0001982095,0.0009245971,0.0004570898,0.0004955858,0.0004464029],"domain_scores_gemma":[0.9977742,0.001025505,0.0004824096,0.0003728053,0.0001176964,0.0002273192],"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.000169629,0.002219081,0.000767109,0.002842578,0.0001360685,0.00001121567,0.01919861,0.00004510953,0.0004514019,0.9685538,0.0003378225,0.005267625],"study_design_scores_gemma":[0.01408226,0.0032708,0.006906992,0.00679882,0.0007664883,0.0002440521,0.0263391,0.2718735,0.05820403,0.6035697,0.004612509,0.003331746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7690435,0.000232387,0.2238763,0.001365376,0.0002441723,0.0009814134,0.00003809371,0.00009417405,0.004124604],"genre_scores_gemma":[0.7956072,0.00007897491,0.2011616,0.0001817123,0.0001277556,0.00005435813,0.0000441498,0.00006201397,0.002682247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.364984,"threshold_uncertainty_score":0.9999204,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003554396,0.0001567205,0.0001578766,0.00004439994,0.0005041272,0.0000898295,0.0003484065,0.00007773339,0.00001730642],"category_scores_gemma":[0.00001344493,0.0001222238,0.00003590411,0.0001867347,0.0001788343,0.0001918843,0.00007434611,0.0002035076,0.00000103094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002765483,"about_ca_system_score_gemma":0.00001773106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001037447,"about_ca_topic_score_gemma":0.000005788032,"domain_scores_codex":[0.9989521,0.0002802084,0.0001515313,0.0002944743,0.00008868367,0.0002329988],"domain_scores_gemma":[0.9992483,0.0001567114,0.00004697179,0.0003707579,0.00003687938,0.0001404183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00008107193,0.0001365652,0.03510118,0.00002765525,0.00003081029,0.000009104506,0.02080352,0.00008129527,0.0004633024,0.1843465,0.0009694853,0.7579495],"study_design_scores_gemma":[0.00254877,0.0006090142,0.4711181,0.0004095216,0.00004084552,0.00002555249,0.0004446753,0.4440632,0.004747045,0.04805777,0.02650258,0.001432878],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3901567,0.001518714,0.6055079,0.001117759,0.0001632792,0.0001611491,0.000001362195,0.0001369769,0.001236181],"genre_scores_gemma":[0.9730637,0.0004978119,0.02560941,0.0007025839,0.00006105833,0.000006112445,0.00000255096,0.000008044058,0.00004873725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7565166,"threshold_uncertainty_score":0.4984144,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061563,0.00009808089,0.00007631625,0.00005830985,0.0006801203,0.0002312262,0.0004908591,0.00005783185,0.000007090474],"category_scores_gemma":[0.00003542172,0.00006264499,0.00005324731,0.0002620394,0.0001184936,0.0001582986,0.0000560119,0.000230345,0.0000128529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007459744,"about_ca_system_score_gemma":0.00001935067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004034179,"about_ca_topic_score_gemma":0.00001603288,"domain_scores_codex":[0.9991713,0.0001060271,0.0001430869,0.0002011488,0.0001810562,0.0001973671],"domain_scores_gemma":[0.9992906,0.0001602716,0.00007263035,0.0004220631,0.00003699645,0.00001737129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005242948,0.0002308692,0.0004902249,0.00006939351,0.00005141134,0.000213892,0.01214411,0.000301834,0.1575908,0.1857122,0.01715676,0.6259861],"study_design_scores_gemma":[0.0003063273,0.0002231355,0.003588828,0.00006723972,0.00001777832,0.0002965719,0.0007058274,0.03054301,0.913129,0.03417225,0.01644725,0.0005027305],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3604653,0.0001083634,0.6328241,0.003240584,0.000235086,0.0001849195,0.000001213228,0.0003177379,0.002622663],"genre_scores_gemma":[0.9862422,0.00000394116,0.01131238,0.002037071,0.0002159218,0.00001404372,8.064535e-7,0.000009135437,0.000164534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7555382,"threshold_uncertainty_score":0.5231004,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003701952,0.0001311802,0.000138763,0.00009674082,0.0003774553,0.00006742954,0.0006253893,0.00007838758,0.00002171945],"category_scores_gemma":[0.00009301888,0.00009019976,0.0000644742,0.0004642198,0.001414043,0.0001717954,0.00006954426,0.0002337562,0.00001240911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354553,"about_ca_system_score_gemma":0.0001089786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008796185,"about_ca_topic_score_gemma":0.00003492484,"domain_scores_codex":[0.9989356,0.00008198124,0.0002099977,0.0002756556,0.0002760833,0.000220657],"domain_scores_gemma":[0.9987828,0.000253433,0.0002017861,0.0005368447,0.0001726081,0.00005250263],"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.000106092,0.0001748093,0.004271853,0.00009144549,0.00009959014,0.00004089317,0.007066824,0.0002445437,0.003893875,0.6290427,0.0005410861,0.3544263],"study_design_scores_gemma":[0.004660724,0.002553783,0.01288501,0.0003318908,0.0001105221,0.0002545748,0.001169985,0.7379526,0.09923492,0.1291838,0.01012744,0.001534738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1787528,0.00003264063,0.8186197,0.0008645655,0.0002330847,0.000142622,0.000006770284,0.0001025446,0.00124528],"genre_scores_gemma":[0.8121702,0.000002975268,0.1870922,0.0005485347,0.000122193,0.000007252628,0.000003441885,0.000008578148,0.00004467053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.737708,"threshold_uncertainty_score":0.5210102,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001801169,0.00008798565,0.00007709979,0.00007644569,0.00008606658,0.0000270803,0.00007109781,0.0001373794,0.00000170034],"category_scores_gemma":[0.00004467216,0.00009094263,0.00001727904,0.0001409094,0.0000278306,0.000004126283,0.00001847665,0.00007468939,0.000001088649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004388808,"about_ca_system_score_gemma":0.0000339318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001946834,"about_ca_topic_score_gemma":0.00002009916,"domain_scores_codex":[0.9993165,0.00005725631,0.0001209807,0.0003054618,0.00006678735,0.0001330701],"domain_scores_gemma":[0.9997178,0.000005860166,0.00003971871,0.0001386554,0.00003315985,0.00006481195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007670954,0.00005099762,0.002638945,0.00002708396,0.00000426205,2.976914e-8,0.0001272137,0.04249856,0.9442716,0.00487886,0.001227107,0.004198608],"study_design_scores_gemma":[0.0007839436,0.0001013197,0.01062903,0.00000973583,0.000007768601,0.000002860994,0.0001390861,0.9222586,0.03073185,0.00112675,0.03396969,0.0002393464],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3031605,0.00002280076,0.6943326,0.0001339314,0.00002582074,0.0001186585,0.000001368425,0.00001225406,0.002191996],"genre_scores_gemma":[0.9709097,0.000009214615,0.02800449,0.0005782087,0.00009520838,0.00008750625,0.00005477703,0.00001354083,0.0002473567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9135398,"threshold_uncertainty_score":0.3708533,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001054662,0.0001625013,0.0001893649,0.00006813039,0.0008018165,0.0002814137,0.0004910689,0.00009554599,0.00001758515],"category_scores_gemma":[0.00004849126,0.00008550107,0.00009431776,0.000428318,0.000425967,0.0001145941,0.00007371226,0.0002520546,0.00001812873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001858317,"about_ca_system_score_gemma":0.00003872527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001802645,"about_ca_topic_score_gemma":0.000004793521,"domain_scores_codex":[0.9986216,0.0001823732,0.0002223358,0.0003247022,0.0003065586,0.0003424337],"domain_scores_gemma":[0.9983202,0.0009885913,0.00007104103,0.00049816,0.00006627362,0.00005572835],"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.0000392028,0.00003689872,0.0008891808,0.00001567191,0.00002392111,0.000002918793,0.0005549638,0.0001291253,0.00008023553,0.9946613,0.002708036,0.0008585959],"study_design_scores_gemma":[0.002841009,0.00004987023,0.0008423735,0.00002830559,0.00001918227,0.00004145794,0.00006222919,0.05879502,0.0002209873,0.9361386,0.0007976917,0.0001632175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5941492,0.0009740605,0.3689033,0.01557444,0.0005925648,0.001541298,0.000009388862,0.0002880872,0.01796762],"genre_scores_gemma":[0.9905546,0.00001464363,0.007418836,0.00120537,0.00002908997,0.00008225437,0.000003256382,0.00001349108,0.0006784054],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3964054,"threshold_uncertainty_score":0.6167005,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026051,0.0001207363,0.0002594033,0.0003781233,0.00008949607,0.00003216077,0.0002776934,0.0001128695,0.00003227277],"category_scores_gemma":[0.0004305309,0.00009151493,0.00005474659,0.001396714,0.0001705463,0.0002861455,0.00003064862,0.00009330358,0.00002854937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005892882,"about_ca_system_score_gemma":0.0001292666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001523469,"about_ca_topic_score_gemma":0.0000688263,"domain_scores_codex":[0.998053,0.00009996485,0.0005986034,0.0003092503,0.0007995801,0.0001395756],"domain_scores_gemma":[0.9977855,0.00009295595,0.0004621102,0.0004697022,0.001015464,0.000174275],"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.00008018249,0.00005903103,0.01762431,0.000005106177,0.00001247516,3.503719e-7,0.001847862,0.970185,0.0001014423,0.001597265,0.00297077,0.005516234],"study_design_scores_gemma":[0.002077579,0.0009832454,0.004044031,0.00005789155,0.0001142798,0.00001702249,0.004220612,0.9338268,0.002100884,0.004343866,0.0476707,0.0005430905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1279265,0.00007546911,0.8688188,0.0003366606,0.0001266934,0.0004145748,0.00001506514,0.00003297286,0.002253274],"genre_scores_gemma":[0.8685967,0.0000922531,0.1286773,0.0001083272,0.0001176161,0.00007283067,0.00009050078,0.00002733453,0.002217119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7406702,"threshold_uncertainty_score":0.373187,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458069,0.0002117725,0.0002509661,0.000129664,0.0005510862,0.0000743376,0.0004662936,0.00009786461,0.00006023355],"category_scores_gemma":[0.00004242817,0.0001550334,0.00008790114,0.000457044,0.0002987794,0.0001892365,0.00006985899,0.0002436906,0.00004272332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002648959,"about_ca_system_score_gemma":0.00001276935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002007219,"about_ca_topic_score_gemma":0.00002136594,"domain_scores_codex":[0.9988759,0.0001056224,0.000203345,0.0002486002,0.0001942276,0.0003723727],"domain_scores_gemma":[0.9989339,0.0002479702,0.0001293226,0.0005035661,0.00004615905,0.0001391266],"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.00003644446,0.0004089262,0.004464209,0.00003408372,0.0001355316,0.000001197801,0.00348291,0.000002896535,0.0001546782,0.9878852,0.002635915,0.0007580479],"study_design_scores_gemma":[0.0006752419,0.0001689465,0.004437484,0.00005156773,0.0001089859,0.00001251168,0.001009206,0.000003430229,0.0008495376,0.9757013,0.01665032,0.0003314858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.969685,0.0001892939,0.002432997,0.000699481,0.00008915319,0.001188471,0.00001692769,0.0002269378,0.02547177],"genre_scores_gemma":[0.9821451,0.00004852639,0.01592436,0.0003081831,0.00009567548,0.0004320054,0.00001021709,0.00004380039,0.0009921661],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0244796,"threshold_uncertainty_score":0.632208,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513771,0.0001130349,0.0001648105,0.00003533461,0.0001568811,0.00003081178,0.0001645437,0.00005263474,0.000009714307],"category_scores_gemma":[0.00005777948,0.00009675556,0.00005526419,0.0002181482,0.00003968191,0.00006141475,0.00001961014,0.0001795183,0.000001726128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000318223,"about_ca_system_score_gemma":0.00001256692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009396252,"about_ca_topic_score_gemma":0.00000174,"domain_scores_codex":[0.999244,0.0000608175,0.0002509298,0.0001406928,0.0001611912,0.0001423879],"domain_scores_gemma":[0.9993457,0.0003910875,0.0000529247,0.0001011651,0.00006176643,0.00004734848],"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.00000604248,0.00002756257,0.0002601877,0.0000460827,0.00009324931,0.000001109115,0.009175225,0.9089975,0.00005546166,0.0004441707,0.0002255956,0.0806678],"study_design_scores_gemma":[0.0008054757,0.00008435357,0.0004177965,0.000006002293,0.00003293262,0.000002629608,0.001147933,0.9958019,0.0000997962,0.0009232142,0.0005709587,0.0001069531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06130364,0.00007916002,0.9372042,0.0004037868,0.00009201125,0.0005802868,0.00001525226,0.0001889962,0.0001326062],"genre_scores_gemma":[0.4206885,0.000004342808,0.5789525,0.0001431953,0.0001176358,0.00004178159,0.00000727821,0.00003354248,0.00001121272],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3593849,"threshold_uncertainty_score":0.3945577,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001277342,0.0001630397,0.0002250684,0.0001812443,0.0003691853,0.00006952206,0.0002318928,0.00009141672,0.00008136203],"category_scores_gemma":[0.00002663728,0.0001754507,0.00004219914,0.0004672147,0.00006641963,0.0001945194,0.00002933127,0.0001413334,0.0003965881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00022967,"about_ca_system_score_gemma":0.00001006241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002085596,"about_ca_topic_score_gemma":0.0000711308,"domain_scores_codex":[0.9988219,0.000003056753,0.000366139,0.0004697028,0.00006154802,0.0002776459],"domain_scores_gemma":[0.9992321,0.00002059556,0.0001688447,0.0003790991,0.00003508805,0.0001643098],"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.0000140966,0.0002344642,0.0006503164,0.00001447172,0.00002001243,0.000001447161,0.001968421,0.0004416369,0.00007050457,0.9765661,0.00007734114,0.01994117],"study_design_scores_gemma":[0.003001332,0.001436722,0.04128976,0.00007255348,0.00005771741,0.00005445225,0.001521433,0.04029355,0.0003990828,0.4255823,0.4840279,0.002263271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1775107,0.0003061699,0.8123922,0.00119282,0.00005880151,0.0005120446,0.00005332173,0.00007907672,0.007894924],"genre_scores_gemma":[0.9687444,0.0001214994,0.02945372,0.0007343949,0.0001244286,0.0005150388,0.00003047454,0.00003001231,0.0002460199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7912338,"threshold_uncertainty_score":0.7154673,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008872031,0.0005172462,0.0005823406,0.000483547,0.0006447472,0.0004301025,0.0004440153,0.0002961279,0.0009436859],"category_scores_gemma":[0.0009633601,0.0005746884,0.0003377379,0.001168856,0.0002010364,0.001281349,0.000134993,0.0005511817,0.001809878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002995659,"about_ca_system_score_gemma":0.00003205564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000455403,"about_ca_topic_score_gemma":0.0001726388,"domain_scores_codex":[0.9971386,0.000128901,0.0006188172,0.0007713727,0.0003901994,0.000952101],"domain_scores_gemma":[0.9986375,0.00009542973,0.0002007942,0.0006550308,0.0003035797,0.0001076639],"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.0002560591,0.0005771013,0.00416563,0.00073849,0.0006937319,0.0003903204,0.002231506,0.3535461,0.001598084,0.5972362,0.0165835,0.02198331],"study_design_scores_gemma":[0.001656892,0.00002869406,0.00004920244,0.0004279203,0.000588679,0.00003195933,0.001475553,0.09845614,0.0002771319,0.08021737,0.8152956,0.001494863],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.56659,0.00577984,0.3945316,0.01001103,0.002736801,0.0005796162,0.00002284949,0.0003201909,0.01942807],"genre_scores_gemma":[0.9421643,0.0001941353,0.01764322,0.01112507,0.001782145,0.00004011692,0.00003968986,0.0001583625,0.02685294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7987121,"threshold_uncertainty_score":0.9999696,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001434883,0.0001074204,0.0001354031,0.00006756781,0.0001168023,0.000009269083,0.0001338151,0.00006832056,0.0000100742],"category_scores_gemma":[0.0001256654,0.00007298886,0.00003840974,0.0001668281,0.0001140106,0.00004330769,0.000006959473,0.0001815006,0.000001642249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001352564,"about_ca_system_score_gemma":0.00002584075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003967735,"about_ca_topic_score_gemma":0.00001691585,"domain_scores_codex":[0.9993333,0.00005384995,0.0002369865,0.0000920066,0.0001660179,0.0001177977],"domain_scores_gemma":[0.9993008,0.0003093081,0.00007788768,0.0002467294,0.00004644968,0.00001883485],"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.00002070057,0.00001214576,0.0001349561,0.00008201059,0.00001033072,0.00000868806,0.001970053,0.9941173,0.0002578562,0.003159225,0.0001103513,0.0001163423],"study_design_scores_gemma":[0.0006540072,0.00005180086,0.004663687,0.0001872807,0.00002103987,0.000009592824,0.001505195,0.9802957,0.01152413,0.0001969921,0.0006681855,0.0002224427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6912883,0.0001758883,0.3045044,0.000186091,0.0002002829,0.0002992401,0.0000298268,0.0001297517,0.003186272],"genre_scores_gemma":[0.9966412,0.00002029567,0.003178179,0.00002682725,0.00002840834,0.00001142238,0.00001229645,0.00001798568,0.00006342034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3053529,"threshold_uncertainty_score":0.29764,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001098612,0.0001908594,0.0003307067,0.0000707002,0.000166823,0.00006808688,0.00006884916,0.000134614,0.000001384107],"category_scores_gemma":[0.00037065,0.0001968663,0.00004636559,0.00009421584,0.000106313,0.0002819443,0.00003591276,0.0001358996,9.148084e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005363629,"about_ca_system_score_gemma":0.00001058783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003843971,"about_ca_topic_score_gemma":0.00004350786,"domain_scores_codex":[0.9988846,0.00007046996,0.0003434236,0.0002756556,0.00008766766,0.0003381415],"domain_scores_gemma":[0.9989904,0.0006343207,0.00006976358,0.000124706,0.00008656333,0.0000942282],"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.0002470138,0.00005569819,0.0227427,0.0007460041,0.0003576051,0.000003465583,0.0135042,0.3103988,0.004734884,0.003625062,0.0005067592,0.6430778],"study_design_scores_gemma":[0.001179082,0.00004274502,0.006467127,0.0001027609,0.00003052221,0.000006961907,0.0002230925,0.990333,0.0008559457,0.0003124844,0.0002194816,0.0002267941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4657649,0.0005273886,0.5330605,0.0001217673,0.0000796981,0.0002692143,0.00006133976,0.00007864791,0.00003657473],"genre_scores_gemma":[0.7495052,0.0001116562,0.2500668,0.0000538331,0.0001035803,0.00003143211,0.00001544986,0.00005305976,0.00005898571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6799342,"threshold_uncertainty_score":0.8027974,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004094251,0.0001593815,0.0001584829,0.00002263653,0.0003886855,0.0001779454,0.0005617373,0.0000823689,0.000002524642],"category_scores_gemma":[0.0001797794,0.0001062165,0.00005362501,0.000351728,0.0004421561,0.0001549734,0.0002168451,0.000164971,0.0000211958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002731626,"about_ca_system_score_gemma":0.00008453312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001538672,"about_ca_topic_score_gemma":0.0001613555,"domain_scores_codex":[0.9987907,0.00009238091,0.00015726,0.000457031,0.0001865055,0.0003161189],"domain_scores_gemma":[0.9992104,0.000106505,0.00004003999,0.0004586229,0.0000314361,0.000153021],"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.000004707028,0.00003558288,0.003162357,0.0000182625,0.00001015894,0.000006989645,0.00444133,0.0007903178,0.000006696732,0.9488727,0.00007188055,0.042579],"study_design_scores_gemma":[0.000821392,0.0002122503,0.0859929,0.00003099662,0.00002810424,0.0001602708,0.0007210305,0.01401671,0.000217412,0.8927609,0.004477838,0.0005601977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3037465,0.0003073936,0.6860078,0.004486554,0.0001877539,0.0002818883,0.000001911452,0.0001288946,0.004851262],"genre_scores_gemma":[0.9672194,0.000004715689,0.03227317,0.0003530961,0.00007199348,0.00002887953,6.928384e-7,0.0000050015,0.00004305154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6634729,"threshold_uncertainty_score":0.4331383,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001426648,0.0001371277,0.0002242529,0.00009801108,0.00005876952,0.00001198019,0.00009420821,0.0001143243,0.000008534188],"category_scores_gemma":[0.0000173132,0.0001283876,0.00005857771,0.0001044859,0.00006558366,0.0001611469,0.000009547256,0.0001175488,0.000002804452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005057436,"about_ca_system_score_gemma":0.000005582167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007289258,"about_ca_topic_score_gemma":0.00001691789,"domain_scores_codex":[0.999319,0.00002060815,0.0002282349,0.000144464,0.0001135415,0.0001741713],"domain_scores_gemma":[0.9996135,0.00006840342,0.00006453193,0.0001538857,0.00006215063,0.00003750348],"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.0001144421,0.00002195638,0.0001106974,0.000189937,0.00005477767,1.823875e-7,0.0006749617,0.9841581,0.00003024134,0.009237326,0.003016673,0.002390677],"study_design_scores_gemma":[0.0006183512,0.0001771512,0.00009788868,0.00002810048,0.0000423028,4.490747e-7,0.0001573223,0.9849679,0.000425515,0.0001922275,0.01313492,0.0001578958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0781267,0.0001381454,0.9181161,0.00007279134,0.0001659382,0.0002509541,0.00000685033,0.0001989948,0.002923515],"genre_scores_gemma":[0.9256102,0.0000588198,0.07370694,0.00003061466,0.000108282,0.00002693281,0.00009552434,0.00003430043,0.0003284146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8474835,"threshold_uncertainty_score":0.5235496,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285442,0.0001359523,0.0001116478,0.00008855231,0.0005399326,0.0003921115,0.0003771948,0.00008618608,0.00002982168],"category_scores_gemma":[0.00008349418,0.0001109775,0.00006197778,0.0003367107,0.000139756,0.0007111618,0.0001273086,0.0002655244,0.00007159221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000157765,"about_ca_system_score_gemma":0.0001529101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001621506,"about_ca_topic_score_gemma":0.0000994974,"domain_scores_codex":[0.9988438,0.0001270941,0.00022813,0.0002593531,0.0002703912,0.0002712356],"domain_scores_gemma":[0.9992476,0.00007586223,0.0001314431,0.000272427,0.0001410814,0.0001315955],"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.00001093794,0.00002816482,0.003818538,0.00001576297,0.00002808105,0.00002813473,0.01717796,0.004371476,0.0001347244,0.9290339,0.001330974,0.04402137],"study_design_scores_gemma":[0.004862404,0.0006893729,0.01476975,0.0004111085,0.0001127025,0.001325958,0.01404493,0.3767669,0.00143167,0.5034299,0.07975237,0.002402892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354145,0.0000477681,0.9529203,0.006320215,0.0002759416,0.0003391496,0.000001060732,0.0003396533,0.01621451],"genre_scores_gemma":[0.771934,0.00003782782,0.2259413,0.001507715,0.0001153555,0.00005221066,0.000006128055,0.00001371832,0.0003916923],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7483926,"threshold_uncertainty_score":0.452553,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002650941,0.0001053328,0.0000982713,0.00004435986,0.0001142139,0.00001853061,0.0001263302,0.00009078941,0.0001342161],"category_scores_gemma":[0.000003561139,0.00007547378,0.00002806267,0.0002392679,0.00003479652,0.00007614314,3.996766e-7,0.000220945,0.00000219462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003382104,"about_ca_system_score_gemma":0.0002242895,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.8847063,"about_ca_topic_score_gemma":0.9667693,"domain_scores_codex":[0.9994078,0.0000122816,0.0001339823,0.00009212751,0.0001479941,0.000205841],"domain_scores_gemma":[0.9996619,0.000008749078,0.00003657282,0.0001563065,0.00005596569,0.00008050556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"observational","study_design_scores_codex":[0.0000700314,0.0000583398,0.1504915,0.0006113102,0.001126629,0.00004085257,0.01073493,0.1094427,0.1852276,0.03796935,0.2705283,0.2336984],"study_design_scores_gemma":[0.0005684018,0.00007816155,0.926743,0.00002769603,0.00006524473,0.00002024016,0.0001763996,0.01930224,0.03518443,0.000902594,0.0164523,0.0004792445],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9955974,0.0001731105,0.0003610457,0.0004028367,0.00007677384,0.0002559796,0.00002018515,0.00003775491,0.003074884],"genre_scores_gemma":[0.9990488,0.00001189885,0.0004409515,0.000135743,0.00003985301,0.0000166034,0.00003549146,0.00002001335,0.0002506751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7762516,"threshold_uncertainty_score":0.3077732,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001001815,0.00007394624,0.0001003671,0.00003257873,0.00008566046,0.00001697078,0.00006533489,0.00005115052,0.000008457132],"category_scores_gemma":[0.00004113782,0.00005591866,0.00002263337,0.00006870665,0.00006409716,0.00006310782,0.00000364493,0.00006921656,3.270953e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002952897,"about_ca_system_score_gemma":0.000008040144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001938973,"about_ca_topic_score_gemma":0.000002989232,"domain_scores_codex":[0.9995983,0.00002300745,0.0001713437,0.00005424847,0.00006962417,0.00008342609],"domain_scores_gemma":[0.9997689,0.00005645975,0.00004094441,0.00008229463,0.00003731711,0.00001414602],"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.00003408904,0.00001147339,0.00000185634,0.000007559897,0.000009430051,2.719801e-7,0.001930999,0.9515463,0.01921559,0.02131904,0.0001454867,0.005777983],"study_design_scores_gemma":[0.0008873833,0.0002707899,0.0003275263,0.00006081348,0.00004298482,0.00000473441,0.0003354889,0.4987817,0.4512585,0.04721734,0.0005733129,0.0002393469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1370155,0.00008277415,0.8624191,0.00008039569,0.000141872,0.00008286446,0.000003834947,0.00004271818,0.0001309308],"genre_scores_gemma":[0.8789417,0.00007261261,0.1207359,0.00003589106,0.0001604272,0.000003873009,0.00002642216,0.000006718728,0.0000164997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7419261,"threshold_uncertainty_score":0.2280297,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002243854,0.0003031274,0.0003124385,0.00006298492,0.0001726319,0.00004726514,0.0003280369,0.0004930044,0.00004849283],"category_scores_gemma":[0.0005265402,0.0002855019,0.00008672236,0.0003211177,0.0004818476,0.0001438527,0.00005964529,0.001404138,0.0000938165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001287894,"about_ca_system_score_gemma":0.00001039752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002004161,"about_ca_topic_score_gemma":0.00001353263,"domain_scores_codex":[0.9985027,0.00002934315,0.0002179208,0.0003027151,0.0001610829,0.000786248],"domain_scores_gemma":[0.9982694,0.00106162,0.00002642156,0.0004315363,0.00003834574,0.0001726285],"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.0000969661,0.00006014811,0.002665305,0.00006224649,0.0002415139,0.000291433,0.0003048853,0.6330997,0.01381393,0.1884423,0.01587451,0.1450471],"study_design_scores_gemma":[0.003364639,0.000839902,0.02295745,0.0002283344,0.0003244614,0.0003357363,0.0004219752,0.3985781,0.04440562,0.4017299,0.1220426,0.004771247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2044281,0.0003279762,0.7868561,0.0002399743,0.0009209069,0.0004691642,0.000002147501,0.002138047,0.004617617],"genre_scores_gemma":[0.6152027,0.00007008029,0.3841228,0.0001076048,0.000265017,0.00009986875,0.000003626577,0.00006236296,0.00006589328],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4107746,"threshold_uncertainty_score":0.9999597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}