{"meta":{"query_hash":"ea44e4221b41","filters":{"venue":"Les Cahiers du GERAD"},"cohort_total":175,"direct_labels_cover":2,"predictions_cover":175,"exported":175,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ea44e4221b41","api":"https://metacan.xera.ac/api/v1/cohort?venue=Les+Cahiers+du+GERAD"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Limiting; Data mining; Task (project management); Graph; Efficient algorithm; Theoretical computer science; Symmetry (geometry); Algorithm; Mathematics; Engineering","score_opus":0.009793538500813591,"score_gpt":0.235508042000786,"score_spread":0.2257145034999724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11261568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035524067,0.0012070134,0.9054959,0.0014107513,0.0003373742,0.00064273924,0.004685547,0.046443887,0.004252706],"genre_scores_gemma":[0.07951525,0.00033135663,0.9066329,0.00046012888,0.00013598076,0.0005588325,0.0077897445,0.0016013209,0.002974555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955764,0.0014957688,0.0003798045,0.0011343935,0.0010373181,0.00037646628],"domain_scores_gemma":[0.9897537,0.00508165,0.0007208199,0.0033325127,0.0007364471,0.00037485786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045349905,0.002464208,0.0026761184,0.004250359,0.0012776648,0.0022743423,0.0043173847,0.0022488977,0.012501691],"category_scores_gemma":[0.020032512,0.0013099468,0.0041008247,0.0036619562,0.0017401495,0.0059559057,0.0048473347,0.002959346,0.0055677122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015842376,0.00072766276,0.0057325955,0.0012018299,0.0004108888,0.00044724863,0.00058538973,0.040202614,0.009692667,0.027096817,0.07758872,0.8347292],"study_design_scores_gemma":[0.00064503564,0.00043568917,0.0016487521,0.00014274777,0.0001200905,0.0004614141,0.0003734921,0.8091128,0.007125881,0.15031289,0.02956898,0.0000523249],"about_ca_topic_score_codex":0.0025019418,"about_ca_topic_score_gemma":0.005691234,"teacher_disagreement_score":0.012501691,"about_ca_system_score_codex":0.000962417,"about_ca_system_score_gemma":0.003320387,"threshold_uncertainty_score":0.041822314},"labels":[],"label_agreement":null},{"id":"W113337901","doi":"","title":"Rank-Based Extensions of the BDS Test for Serial Dependence","year":2006,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Mathematics; Rank (graph theory); Statistics; Randomness; Statistic; Test statistic; Statistical hypothesis testing; Series (stratigraphy); Monte Carlo method; Asymptotic distribution; Margin (machine learning); Null hypothesis; Applied mathematics; Alternative hypothesis; Limiting; Econometrics; Computer science; Estimator; Combinatorics","score_opus":0.012902378092294161,"score_gpt":0.1870921895969689,"score_spread":0.17418981150467475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113337901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079946116,0.0006790283,0.91216415,0.0005746769,0.000099170196,0.000117902266,0.00048615003,0.00042624108,0.0055065067],"genre_scores_gemma":[0.8437202,0.00056229957,0.14990912,0.00031374843,0.00054491055,0.000286411,0.0010292705,0.00017215779,0.0034618655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.986421,0.007926855,0.0006767927,0.0013973515,0.0032438806,0.00033412696],"domain_scores_gemma":[0.8889928,0.08934661,0.0075774044,0.008862031,0.0042930823,0.0009280351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01592141,0.0008790165,0.0013231182,0.00423447,0.0006128627,0.0017492649,0.0019139525,0.0011410265,0.0049181357],"category_scores_gemma":[0.080063686,0.00042454025,0.001377982,0.0023193462,0.0033580062,0.0042712935,0.002178475,0.0022476043,0.0007805739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005249688,0.00021785691,0.033743974,0.00031803455,0.0004824419,0.00046248696,0.0003508447,0.1239577,0.0031066332,0.6324762,0.0032470848,0.20111181],"study_design_scores_gemma":[0.00014343979,0.0005841824,0.011973531,0.000066569955,0.00009852692,0.00046973914,0.00009292097,0.57012796,0.0022749193,0.40872225,0.005305198,0.00014080675],"about_ca_topic_score_codex":0.00091600773,"about_ca_topic_score_gemma":0.00074712856,"teacher_disagreement_score":0.01592141,"about_ca_system_score_codex":0.0011538058,"about_ca_system_score_gemma":0.0012739956,"threshold_uncertainty_score":0.084201515},"labels":[],"label_agreement":null},{"id":"W12565174","doi":"10.1016/s0304-3835(02)00590-6","title":"Capacity Investments in a Stochastic Dynamic Game: Good News Principle","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Economics; Microeconomics; Cournot competition; Investment (military); Volatility (finance); Lag; Mathematical economics; Information asymmetry; Econometrics; Computer science","score_opus":0.017794367312277844,"score_gpt":0.2087672364507424,"score_spread":0.19097286913846456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12565174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19793022,0.0017143638,0.60314775,0.024657568,0.0005780217,0.0004636832,0.002054183,0.00039961166,0.16905458],"genre_scores_gemma":[0.94917583,0.0010642187,0.014151911,0.0008643225,0.0003153613,0.00046588053,0.00024320107,0.000059591654,0.03365966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982729,0.000865947,0.0000601972,0.0002677393,0.00019160977,0.00034157844],"domain_scores_gemma":[0.9908598,0.0070700385,0.00071087957,0.00021657538,0.0003275453,0.00081522093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035540438,0.0012991874,0.0021244173,0.001013867,0.0010042106,0.0034291688,0.0020749054,0.004258138,0.015304565],"category_scores_gemma":[0.012362952,0.0006829724,0.0011199479,0.000715558,0.0030549718,0.003701593,0.0017828319,0.003037952,0.0008201427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022444775,0.00010092341,0.0009499182,0.00016604552,0.00013585095,0.0004873349,0.00018453223,0.27871764,0.0008599442,0.702636,0.007665356,0.007872051],"study_design_scores_gemma":[0.00014226296,0.00009160082,0.0004425779,0.00004415835,0.000034012694,0.00014815372,0.00009099907,0.5195986,0.00011981411,0.47646338,0.0027740952,0.000050342824],"about_ca_topic_score_codex":0.0040060673,"about_ca_topic_score_gemma":0.0028577636,"teacher_disagreement_score":0.015304565,"about_ca_system_score_codex":0.0031889433,"about_ca_system_score_gemma":0.0018923177,"threshold_uncertainty_score":0.0511989},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Minimax; Mathematics; Plane (geometry); Computer science; Mathematical economics; Geometry","score_opus":0.009920766014609523,"score_gpt":0.2133343668019037,"score_spread":0.20341360078729417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198966646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039881814,0.00031592886,0.95753425,0.00017689649,0.000021965872,0.00003699517,0.000026895239,0.00032229596,0.0016829168],"genre_scores_gemma":[0.38381013,0.0003514088,0.61255556,0.00006650875,0.00006015468,0.00014290967,0.000118475145,0.00019655084,0.0026982198],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989498,0.00034252304,0.000043564698,0.00022794638,0.0003655377,0.00007061854],"domain_scores_gemma":[0.9983638,0.0009936143,0.00014847737,0.00012639287,0.00030699983,0.00006059488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012918463,0.00079522317,0.001680373,0.002304193,0.0006778716,0.001275478,0.00084157713,0.0015281833,0.0018102919],"category_scores_gemma":[0.0064932103,0.00060784066,0.0004449562,0.0010384688,0.0010152817,0.0017580254,0.0014430267,0.0008464718,0.0008318072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017007338,0.0001609239,0.0041072965,0.0003940341,0.00017951177,0.00044442367,0.0006120554,0.18773302,0.09263199,0.057161666,0.0062200944,0.6486543],"study_design_scores_gemma":[0.00007099654,0.00020104341,0.0021499991,0.00004686051,0.000031498574,0.00037349146,0.00009585918,0.9517873,0.023012897,0.019334793,0.0028551123,0.000040166597],"about_ca_topic_score_codex":0.001109659,"about_ca_topic_score_gemma":0.00080650195,"teacher_disagreement_score":0.002304193,"about_ca_system_score_codex":0.00045098743,"about_ca_system_score_gemma":0.00074045657,"threshold_uncertainty_score":0.0068320036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Track (disk drive); Computer science; Phase (matter); Material handling; Loop (graph theory); Pickup; Simulation; Operations research; Engineering; Industrial engineering; Mathematics","score_opus":0.013739579512228404,"score_gpt":0.24021914918374748,"score_spread":0.22647956967151908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043532179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7649227,0.00028621324,0.22217141,0.00021628338,0.00004408822,0.00033194176,0.000058621357,0.00022493087,0.011743856],"genre_scores_gemma":[0.96940976,0.00007417998,0.029858345,0.000020301895,0.000006171778,0.000059656642,0.000024300063,0.000016750846,0.000530492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726665,0.0014258063,0.00008919026,0.00025478407,0.00053212483,0.00043154426],"domain_scores_gemma":[0.99222904,0.0047840117,0.0014565533,0.00063000893,0.00059723924,0.00030316747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004266601,0.0007791867,0.00053721416,0.00043447205,0.00032512975,0.001383379,0.0007674423,0.00065908773,0.0013902321],"category_scores_gemma":[0.01134823,0.0004493401,0.00044481904,0.00043812345,0.0008343167,0.001612051,0.00063496066,0.00084742036,0.00014729476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006855109,0.00024682924,0.0021255906,0.000057510464,0.00003525378,0.000029451505,0.000059156362,0.96390116,0.0021706242,0.005736782,0.000078195575,0.024873937],"study_design_scores_gemma":[0.000110384244,0.0017121276,0.0019001004,0.000023211036,0.000067143694,0.00002234488,0.000085718464,0.9853217,0.0053828573,0.004187908,0.0011643305,0.00002208464],"about_ca_topic_score_codex":0.0030389791,"about_ca_topic_score_gemma":0.0021534448,"teacher_disagreement_score":0.004266601,"about_ca_system_score_codex":0.0021078314,"about_ca_system_score_gemma":0.0023544545,"threshold_uncertainty_score":0.022564232},"labels":[],"label_agreement":null},{"id":"W2119043676","doi":"","title":"Using Heuristics to Speed Up Frequent Pattern Mining","year":2008,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Data mining; Computer science; Subgraph isomorphism problem; Simple (philosophy); Heuristic; Space (punctuation); Machine learning; Artificial intelligence; Theoretical computer science","score_opus":0.0880807771086874,"score_gpt":0.2864859583849585,"score_spread":0.1984051812762711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119043676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022995569,0.00088162476,0.9682095,0.00032693087,0.00018849572,0.0004708905,0.00040502925,0.004831808,0.0016901015],"genre_scores_gemma":[0.06021503,0.00042731882,0.936504,0.00020899622,0.000089221736,0.00029281172,0.0011358492,0.00028229872,0.0008445399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644524,0.0012493704,0.00037539582,0.0005054621,0.0011895053,0.00023510274],"domain_scores_gemma":[0.9761872,0.018412514,0.0009548619,0.0020074144,0.0021912397,0.00024684146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042616045,0.0017801302,0.001831701,0.0056046387,0.00083880505,0.0019822943,0.0024545908,0.0013734448,0.004273107],"category_scores_gemma":[0.036489006,0.0010779338,0.0010746501,0.005000445,0.0006192839,0.0036883892,0.0013143996,0.002014116,0.0029380373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005348856,0.0005066243,0.006893758,0.0009976638,0.00038945128,0.00060537,0.00042569157,0.05819403,0.0115549015,0.023345577,0.013879939,0.88267213],"study_design_scores_gemma":[0.00048953894,0.0005248426,0.0029106608,0.00030769777,0.00035101536,0.0017807985,0.0004531482,0.8417721,0.020897144,0.09548169,0.034887683,0.0001437619],"about_ca_topic_score_codex":0.0021609622,"about_ca_topic_score_gemma":0.0031938155,"teacher_disagreement_score":0.0056046387,"about_ca_system_score_codex":0.0005885681,"about_ca_system_score_gemma":0.0019036153,"threshold_uncertainty_score":0.022537768},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012066365846266913,"score_gpt":0.23092713106365073,"score_spread":0.21886076521738382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173782975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006667412,0.000064806314,0.99867946,0.0001238449,0.000034419754,0.00004161193,0.000039956827,0.00018377967,0.0001653007],"genre_scores_gemma":[0.063764386,0.00025372484,0.9313344,0.00034636015,0.00024292698,0.0006589405,0.0003747672,0.00016815109,0.0028562616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99277616,0.0040413793,0.00030839306,0.0013046552,0.0013306582,0.00023874924],"domain_scores_gemma":[0.99441034,0.0032061113,0.00028125517,0.0012594191,0.0007134438,0.00012939618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011276781,0.0013579302,0.0021403693,0.0022129125,0.0013850814,0.0021667732,0.004415122,0.002621607,0.0043372763],"category_scores_gemma":[0.021359567,0.0010049993,0.0032683376,0.0025588498,0.0021580872,0.0021717586,0.0026069393,0.0041328412,0.0022449498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022314713,0.00023427786,0.0030339775,0.0003217214,0.0007647171,0.00016868133,0.00034411007,0.2791277,0.006689017,0.3437518,0.010976414,0.3543646],"study_design_scores_gemma":[0.00004680303,0.000111696,0.00068271306,0.000026049835,0.00005465002,0.0001375868,0.000024455783,0.7702481,0.0016123955,0.2209152,0.006074458,0.00006597742],"about_ca_topic_score_codex":0.0035583356,"about_ca_topic_score_gemma":0.0048135133,"teacher_disagreement_score":0.011276781,"about_ca_system_score_codex":0.0016339514,"about_ca_system_score_gemma":0.002756419,"threshold_uncertainty_score":0.059638023},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Luck; Political science; Welfare economics; Economics; Philosophy","score_opus":0.052514798170202714,"score_gpt":0.24224006722875627,"score_spread":0.18972526905855355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2238815626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991385,0.000036668993,0.00021317632,0.00003193389,0.000001212375,0.0000027729313,0.000036330308,0.0000033496874,0.00053609896],"genre_scores_gemma":[0.9991524,0.000020153933,0.000065807064,0.000007175813,0.0000033248773,0.0000024304313,0.00007391242,0.0000015727102,0.00067318144],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982066,0.0005850163,0.00009985587,0.00023875722,0.00040809924,0.00046166964],"domain_scores_gemma":[0.98308426,0.008857775,0.0037948396,0.0014098914,0.0013965454,0.0014566146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006104571,0.00017402816,0.00025002318,0.0015326849,0.00037780264,0.0012819781,0.00036830053,0.00040462377,0.0023116814],"category_scores_gemma":[0.021729037,0.00014298351,0.00033308883,0.0009580919,0.00088680186,0.00063104887,0.0010781238,0.00038170998,0.00029721655],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020067967,0.00001891762,0.9883563,0.000005455455,0.000085514854,0.00010453287,0.0005387656,0.0028353357,0.00027870195,0.001789855,0.0001600562,0.005625796],"study_design_scores_gemma":[0.000007722254,0.00011388382,0.98731726,0.000007752722,0.000035172397,0.000088801484,0.0006086979,0.009410548,0.00051871326,0.0013019778,0.0005748908,0.000014594279],"about_ca_topic_score_codex":0.04655152,"about_ca_topic_score_gemma":0.033179402,"teacher_disagreement_score":0.04655152,"about_ca_system_score_codex":0.0015429887,"about_ca_system_score_gemma":0.0007885664,"threshold_uncertainty_score":0.092561126},"labels":[],"label_agreement":null},{"id":"W2243735628","doi":"","title":"Queueing model for heterogeneous opportunistic spectrum access","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Queueing theory; Markov chain; Queue; Markov process; Layered queueing network; Service (business); Markov model; Computer network; Mathematical optimization; Real-time computing; Mathematics; Statistics","score_opus":0.024444723847779244,"score_gpt":0.2482026489398164,"score_spread":0.22375792509203715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243735628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04874789,0.0005808012,0.942104,0.00063817285,0.00014436619,0.00010012893,0.00032284862,0.00034631512,0.007015394],"genre_scores_gemma":[0.9628537,0.0007174812,0.026166778,0.00020622369,0.00015164608,0.00022983154,0.00025075232,0.00005533681,0.009368157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862707,0.00031924288,0.00006513626,0.0002674677,0.00039467652,0.00032654713],"domain_scores_gemma":[0.99853647,0.00077138346,0.00022151382,0.00009587803,0.00028488273,0.000089956884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013770565,0.0009489987,0.0011272357,0.00073442515,0.0008386133,0.0014910622,0.002159955,0.001348698,0.0022760753],"category_scores_gemma":[0.0033855913,0.0004928394,0.0008249355,0.000727672,0.0010259823,0.0022603183,0.0010443381,0.0013600729,0.00049690006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007167578,0.00007271486,0.0009342923,0.000052040064,0.00004228625,0.00033341665,0.00024366149,0.81986326,0.0030384362,0.16859592,0.0013935107,0.0053587975],"study_design_scores_gemma":[0.000008384391,0.000012418714,0.000104284,0.000002965436,0.000006263231,0.000021943999,0.0000148121435,0.98994166,0.00010725144,0.009404605,0.00036833755,0.000007197037],"about_ca_topic_score_codex":0.016452026,"about_ca_topic_score_gemma":0.0067771776,"teacher_disagreement_score":0.016452026,"about_ca_system_score_codex":0.002565018,"about_ca_system_score_gemma":0.001571309,"threshold_uncertainty_score":0.03271252},"labels":[],"label_agreement":null},{"id":"W2244716988","doi":"","title":"Energy storage systems for carbon footprint reduction","year":2015,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Integrated Energy Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Software deployment; Energy storage; Electric power system; Distributed generation; Electricity generation; Electric energy; Electrical engineering; Environmental science; Environmental economics; Engineering; Power (physics); Telecommunications; Computer science; Renewable energy; Physics; Operating system; Economics","score_opus":0.01188979096525034,"score_gpt":0.19349590317402618,"score_spread":0.18160611220877584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244716988","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050380483,0.24181882,0.12598719,0.03336703,0.0071272366,0.00035282175,0.0026625616,0.0019994415,0.5363045],"genre_scores_gemma":[0.5982258,0.1776661,0.03201744,0.0037085495,0.0017941071,0.00023412392,0.0017116095,0.00033600794,0.18430622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997638,0.000028797365,0.0000124302505,0.000048227335,0.00011155466,0.0000352538],"domain_scores_gemma":[0.9998307,0.00004826839,0.000018870402,0.000023691638,0.0000691753,0.000009295847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347293,0.0004790997,0.0003664007,0.0007770027,0.000578555,0.001235439,0.00064550654,0.0009035273,0.022076754],"category_scores_gemma":[0.00052846177,0.00016242234,0.00042821091,0.0012080738,0.0004955253,0.0020027643,0.0012604209,0.0010499816,0.0041031977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025287102,0.0001079335,0.0009696245,0.0024297815,0.00010275423,0.00045548956,0.00029061214,0.011126048,0.029867146,0.40943116,0.075584605,0.46938205],"study_design_scores_gemma":[0.00002685896,0.00019864623,0.0009026093,0.00078236964,0.00005340116,0.00047823112,0.00025499676,0.00843868,0.028648917,0.096621715,0.86353487,0.00005876161],"about_ca_topic_score_codex":0.0014884652,"about_ca_topic_score_gemma":0.0029180828,"teacher_disagreement_score":0.022076754,"about_ca_system_score_codex":0.0009095966,"about_ca_system_score_gemma":0.0006551707,"threshold_uncertainty_score":0.07385409},"labels":[],"label_agreement":null},{"id":"W2255812888","doi":"","title":"Structure, imprinting and survival of venture capital firms","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Private Equity and Venture Capital","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Imprinting (psychology); Political science; Humanities; Biology; Art","score_opus":0.014311945294912809,"score_gpt":0.2050232993516412,"score_spread":0.1907113540567284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255812888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9990201,0.00018201547,0.000148646,0.00003279847,0.0000026104008,0.0000045175407,0.000107178574,0.0000021766311,0.0004998943],"genre_scores_gemma":[0.9992567,0.000068835456,0.000059939925,0.000007917659,0.0000049493938,0.000004343094,0.00010847426,9.42624e-7,0.00048776934],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995065,0.00013692962,0.000032991855,0.000107438245,0.0000962713,0.00011987649],"domain_scores_gemma":[0.9930391,0.0016310666,0.0032494015,0.00045527826,0.0004153377,0.0012098019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089628,0.00013092165,0.00018631031,0.00075863855,0.0004677666,0.0010127805,0.00029836412,0.0003121533,0.002809851],"category_scores_gemma":[0.0076377885,0.00015685847,0.00015540633,0.00046420394,0.00049563823,0.00068361376,0.0009475649,0.00045898618,0.0003442678],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011294634,0.00010723406,0.98676145,0.000010870259,0.000031437405,0.00012131516,0.0010364703,0.00028305568,0.0005623826,0.0003001465,0.00012269345,0.0105500845],"study_design_scores_gemma":[0.0000029482712,0.00017010562,0.9977324,0.000012716597,0.000010641948,0.00011996753,0.00055700005,0.00029799255,0.00023089047,0.00033847857,0.0005197225,0.000007038756],"about_ca_topic_score_codex":0.0034821234,"about_ca_topic_score_gemma":0.004458043,"teacher_disagreement_score":0.0034821234,"about_ca_system_score_codex":0.00050616363,"about_ca_system_score_gemma":0.0003884257,"threshold_uncertainty_score":0.009399891},"labels":[],"label_agreement":null},{"id":"W2272796344","doi":"","title":"Meat, dairy and climate change: Assessing the long-term mitigation potential of alternative agri-food consumption patterns in Canada","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Agriculture Sustainability and Environmental Impact","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Consumption (sociology); Climate change; Term (time); Natural resource economics; Environmental science; Business; Agricultural economics; Economics; Ecology","score_opus":0.015176180623930157,"score_gpt":0.23140066668791856,"score_spread":0.2162244860639884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272796344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995526,0.000385472,0.00014948005,0.00038273534,0.000006714729,0.00002815064,0.0022874046,0.000008563095,0.001225388],"genre_scores_gemma":[0.99644756,0.00036472626,0.0003269198,0.00009033059,0.0000027442431,0.0000144556925,0.0011057361,0.0000058925643,0.0016415829],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995301,0.000061412866,0.000021586602,0.00006899166,0.000118563155,0.00019935396],"domain_scores_gemma":[0.9986853,0.00013012024,0.0001336099,0.00003602491,0.0006963908,0.00031859084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715011,0.00043110971,0.00040846324,0.00092146604,0.0022724862,0.0017513934,0.0012521168,0.0008218098,0.0017004067],"category_scores_gemma":[0.0015858292,0.00032066554,0.0008682825,0.003039313,0.00076748873,0.0005556486,0.00085291977,0.00071375415,0.00013096472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006514068,0.0002763625,0.96084994,0.00010808998,0.00046181175,0.00025478943,0.0013440995,0.016223963,0.001192881,0.0011138949,0.0019647516,0.0155579755],"study_design_scores_gemma":[0.00004168454,0.00008731411,0.9759731,0.000038674374,0.00015116914,0.000034559744,0.004302133,0.015367599,0.00042648427,0.00018894648,0.0033437437,0.00004461534],"about_ca_topic_score_codex":0.9990429,"about_ca_topic_score_gemma":0.9994272,"teacher_disagreement_score":0.060496505,"about_ca_system_score_codex":0.060496505,"about_ca_system_score_gemma":0.047808338,"threshold_uncertainty_score":0.43893492},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0055833792552973886,"score_gpt":0.1848208819761725,"score_spread":0.1792375027208751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278035089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06309391,0.00060932414,0.9245896,0.00022944777,0.00009052667,0.00016523004,0.00010030505,0.00047102795,0.01065067],"genre_scores_gemma":[0.494957,0.0003432997,0.49795887,0.00017217787,0.00005601574,0.0004292855,0.00022141729,0.0001168482,0.005745089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999663,0.00011723265,0.000011667657,0.000055316345,0.00008195046,0.00007079212],"domain_scores_gemma":[0.99953604,0.00028648012,0.00004733899,0.000034174507,0.000052473395,0.000043566695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008446738,0.00083264336,0.0006640399,0.0009598374,0.00038638356,0.00073920377,0.0014186592,0.0012688411,0.0036554257],"category_scores_gemma":[0.0012574202,0.00043465392,0.00064043415,0.0010180227,0.0006225933,0.0007550868,0.0006569301,0.00061919715,0.00033774736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009077581,0.0000785602,0.00023237873,0.0000821229,0.000034977802,0.00008879848,0.00006582601,0.95213115,0.0018658557,0.007729115,0.0009644998,0.036635835],"study_design_scores_gemma":[0.00005205772,0.00008446128,0.00012221899,0.000016701697,0.000016985497,0.000044044635,0.000030910553,0.99411786,0.00066094904,0.0031752614,0.0016674158,0.000011098071],"about_ca_topic_score_codex":0.003769444,"about_ca_topic_score_gemma":0.004620421,"teacher_disagreement_score":0.003769444,"about_ca_system_score_codex":0.001067913,"about_ca_system_score_gemma":0.0010767689,"threshold_uncertainty_score":0.012228668},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.029908141759601454,"score_gpt":0.2775805357248767,"score_spread":0.2476723939652752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286603664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111572266,0.0017878329,0.8026971,0.0034203392,0.0013467032,0.00010913941,0.000554226,0.00033754832,0.078174874],"genre_scores_gemma":[0.7906772,0.0016675515,0.167683,0.001308385,0.0009648609,0.0002638784,0.00046070744,0.00023825768,0.03673619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992385,0.00019566133,0.000038562073,0.00017214536,0.00028793776,0.000067273664],"domain_scores_gemma":[0.9987645,0.00041936434,0.00015407504,0.00013580253,0.00037831042,0.00014803493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159049,0.0004666523,0.00030969564,0.0014343534,0.00058948627,0.0015157654,0.00061248016,0.001004235,0.00955725],"category_scores_gemma":[0.0031002495,0.00013180372,0.00048768814,0.0007046561,0.0016817942,0.002228553,0.0010667411,0.0013267897,0.0012818793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018059025,0.000016541167,0.00015849617,0.000038324117,0.0000057911775,0.00010175505,0.00018481069,0.0022909434,0.004449769,0.9798007,0.0021638316,0.010770989],"study_design_scores_gemma":[0.000011648371,0.000045171106,0.00059128855,0.000024874562,0.0000067699525,0.0005583174,0.00016758854,0.03654387,0.0013550015,0.94549674,0.015163918,0.000034832134],"about_ca_topic_score_codex":0.0004389696,"about_ca_topic_score_gemma":0.0003520692,"teacher_disagreement_score":0.00955725,"about_ca_system_score_codex":0.0005869164,"about_ca_system_score_gemma":0.00037326184,"threshold_uncertainty_score":0.03197217},"labels":[],"label_agreement":null},{"id":"W2287140866","doi":"","title":"Exploring an influence network through centrality measures","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Social Capital and Networks","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Centrality; Position (finance); Business; Social network analysis; Network analysis; Public relations; Network structure; Knowledge management; Political science; Computer science; Engineering; Law; Finance","score_opus":0.2152958033606417,"score_gpt":0.3144521686508099,"score_spread":0.09915636529016819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287140866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63241845,0.0016752353,0.34128138,0.0012688467,0.000036919464,0.0001348404,0.001798094,0.00026903627,0.021117223],"genre_scores_gemma":[0.9624961,0.0004147679,0.03517177,0.000038265185,0.000044290668,0.00006492778,0.00072028895,0.000027882566,0.0010217145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990638,0.00043580536,0.000025811663,0.00020304557,0.00019916616,0.000072445015],"domain_scores_gemma":[0.99138606,0.006667626,0.0009520177,0.00030195926,0.0004334761,0.00025894187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011621336,0.00040994285,0.00033320158,0.005725163,0.0009157752,0.00232433,0.0005495528,0.00060256396,0.0023714404],"category_scores_gemma":[0.011628976,0.0002633066,0.0003280215,0.004492324,0.0010769828,0.0033837606,0.0009890114,0.0006318935,0.00022982467],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031475173,0.00029654335,0.22777776,0.00064955605,0.00038366835,0.00082934066,0.0063998224,0.13881855,0.008525134,0.47234973,0.0059064575,0.13774867],"study_design_scores_gemma":[0.000048678725,0.00012571618,0.075098254,0.00018761065,0.0001428657,0.0006857995,0.00410098,0.63899237,0.0022799317,0.25141466,0.026855713,0.000067401685],"about_ca_topic_score_codex":0.01019384,"about_ca_topic_score_gemma":0.010876196,"teacher_disagreement_score":0.01019384,"about_ca_system_score_codex":0.0011864557,"about_ca_system_score_gemma":0.00052706804,"threshold_uncertainty_score":0.020268977},"labels":[],"label_agreement":null},{"id":"W2292262371","doi":"","title":"Pricing By Fourier Transform: An Overview","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Fourier transform; Mathematics; Mathematical analysis","score_opus":0.02107109869880028,"score_gpt":0.22680140758451167,"score_spread":0.2057303088857114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292262371","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044278833,0.68834513,0.22939129,0.00378953,0.002235536,0.00006367122,0.00014890487,0.00023859215,0.07135955],"genre_scores_gemma":[0.074596375,0.82295245,0.07186277,0.001603294,0.011230026,0.000136221,0.0002423855,0.0002463747,0.017130021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906,0.00027956147,0.000078474106,0.00013821661,0.00038557578,0.00005823542],"domain_scores_gemma":[0.99888736,0.00081317103,0.00005281007,0.00008082958,0.00013908093,0.000026848247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015238915,0.0013011904,0.0012032837,0.0028600474,0.0004579308,0.0025111146,0.00094084797,0.0027615146,0.004738543],"category_scores_gemma":[0.0029755388,0.00078065123,0.0014249132,0.0031764416,0.0017890749,0.0047105337,0.001207402,0.003468628,0.0027148165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064361564,0.00015013585,0.00078777655,0.0019351699,0.00007604156,0.00034122285,0.00022398592,0.012724561,0.0022034904,0.64427656,0.01433154,0.32288513],"study_design_scores_gemma":[0.00003182847,0.00018231498,0.0018548272,0.0012809718,0.00006310061,0.001958266,0.000116058225,0.033162553,0.0020535823,0.48906144,0.47011063,0.00012437925],"about_ca_topic_score_codex":0.0013619718,"about_ca_topic_score_gemma":0.00044671164,"teacher_disagreement_score":0.004738543,"about_ca_system_score_codex":0.0011487714,"about_ca_system_score_gemma":0.00082326296,"threshold_uncertainty_score":0.015851974},"labels":[],"label_agreement":null},{"id":"W2292410759","doi":"","title":"Scheduling Issues in Vehicle Routing","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Equal-cost multi-path routing; Static routing; Policy-based routing; Multipath routing; Link-state routing protocol; Distributed computing; Computer network; Routing (electronic design automation); Routing protocol","score_opus":0.013045123559327482,"score_gpt":0.2537664492992031,"score_spread":0.24072132573987562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292410759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00963357,0.02102034,0.8791645,0.005576894,0.003979109,0.00009186742,0.00020376916,0.00020330542,0.08012666],"genre_scores_gemma":[0.61688423,0.041066308,0.25113717,0.0017422998,0.008758858,0.00027150306,0.00057162985,0.0004473593,0.07912056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985481,0.0006776514,0.000057149722,0.00023018953,0.00037608546,0.00011087704],"domain_scores_gemma":[0.9986743,0.0009042826,0.000120308214,0.000083504914,0.00015574103,0.00006185575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736659,0.0008727151,0.0007206172,0.00059928105,0.0012398799,0.00220977,0.0010871341,0.0015100432,0.008069225],"category_scores_gemma":[0.0054175523,0.00049756904,0.0006545862,0.0019942105,0.0012596541,0.0024783977,0.0009531762,0.0020088742,0.001559091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003707039,0.000039676164,0.00024008456,0.00024770224,0.00003159672,0.00014807962,0.00014788698,0.16616817,0.0007327226,0.7312223,0.016715208,0.084269516],"study_design_scores_gemma":[0.000023604493,0.00006353302,0.0002122005,0.00008277817,0.000023107974,0.0001248374,0.00015410804,0.16547716,0.00061607163,0.72140884,0.11179276,0.00002085916],"about_ca_topic_score_codex":0.0032236853,"about_ca_topic_score_gemma":0.0019938631,"teacher_disagreement_score":0.008069225,"about_ca_system_score_codex":0.0015035243,"about_ca_system_score_gemma":0.0012348572,"threshold_uncertainty_score":0.026994228},"labels":[],"label_agreement":null},{"id":"W2294106464","doi":"","title":"Stochastic Data Envelopment Analysis: A Random Efficiency Perspective","year":2013,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"Data envelopment analysis; Ranking (information retrieval); Bayesian probability; Frequentist inference; Computer science; Econometrics; Perspective (graphical); Mathematics; Statistics; Bayesian inference; Artificial intelligence","score_opus":0.04352935928923564,"score_gpt":0.3280250220894007,"score_spread":0.2844956628001651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294106464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003996879,0.00034414986,0.99298817,0.00030792755,0.000010170377,0.000032854186,0.000059492948,0.000026760848,0.0022336266],"genre_scores_gemma":[0.5190228,0.0022278994,0.47532454,0.00023379523,0.00015613796,0.000514044,0.00034262228,0.00009433541,0.002083806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989125,0.0065529123,0.00050688145,0.0008372387,0.0025313445,0.0004465511],"domain_scores_gemma":[0.98348296,0.0129534975,0.0012588484,0.0010282479,0.0011023916,0.0001740865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012664091,0.0015976339,0.0022288084,0.004477268,0.0007028221,0.0040151873,0.0016510552,0.0013508211,0.0019467061],"category_scores_gemma":[0.031869873,0.0006789737,0.0018903923,0.0047178003,0.0023653463,0.0037960133,0.0023204244,0.002675897,0.0003140383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021678705,0.000032670276,0.0016238055,0.00013410444,0.00010652452,0.00008000474,0.00016226266,0.34876955,0.00065676594,0.6225978,0.0004648569,0.025349984],"study_design_scores_gemma":[0.000009519086,0.000041068663,0.0009667806,0.00009724684,0.0000195975,0.00004513815,0.00007952315,0.6756334,0.00080596865,0.3190612,0.0032005946,0.000040008803],"about_ca_topic_score_codex":0.0037698217,"about_ca_topic_score_gemma":0.0017648444,"teacher_disagreement_score":0.012664091,"about_ca_system_score_codex":0.0036538406,"about_ca_system_score_gemma":0.0020228599,"threshold_uncertainty_score":0.06697494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.009973262620927178,"score_gpt":0.2066823363532441,"score_spread":0.1967090737323169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298578325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074666776,0.3231782,0.42105982,0.008836539,0.0036927073,0.00023389418,0.000579901,0.00052669924,0.23442556],"genre_scores_gemma":[0.208508,0.41711566,0.25769055,0.0071174423,0.015039629,0.001673487,0.001426359,0.0005552857,0.09087362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951637,0.00021013842,0.000036587622,0.00007557857,0.00010855555,0.000052845236],"domain_scores_gemma":[0.99853134,0.0012621756,0.00004240084,0.000038425278,0.00008444888,0.00004122753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001499009,0.0018246147,0.0015887332,0.0015469232,0.0005602809,0.0021026726,0.0010241688,0.0020261114,0.009579195],"category_scores_gemma":[0.0026051174,0.00074124127,0.0014782096,0.002530973,0.0017921508,0.0047460417,0.0012262949,0.0035732395,0.0030392234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002460961,0.00013968405,0.0003447238,0.0008571939,0.00004929469,0.00031993949,0.00055594154,0.008627022,0.00069059693,0.87099355,0.037091553,0.08030596],"study_design_scores_gemma":[0.000024633708,0.00010157235,0.0007806147,0.00055789377,0.00004599831,0.0005002189,0.00019159894,0.021171717,0.00027442587,0.7194575,0.25683245,0.00006145394],"about_ca_topic_score_codex":0.003120188,"about_ca_topic_score_gemma":0.001910477,"teacher_disagreement_score":0.009579195,"about_ca_system_score_codex":0.0019246836,"about_ca_system_score_gemma":0.0008785462,"threshold_uncertainty_score":0.032045543},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Stochastic programming; Computer science; Scheduling (production processes); Heuristic; Integer programming; Dynamic programming; Column generation; Algorithm; Mathematics","score_opus":0.03724072600934392,"score_gpt":0.3240968000928531,"score_spread":0.28685607408350916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299216252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008541248,0.00005890185,0.9958994,0.000091185386,0.000043453954,0.000053090567,0.00007220819,0.0013256721,0.0016019942],"genre_scores_gemma":[0.027206305,0.000120022,0.9701629,0.00009658856,0.000040469487,0.0002889752,0.00024147844,0.00039066008,0.0014526179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.0002347275,0.000056158766,0.0001263006,0.0002724843,0.00009289848],"domain_scores_gemma":[0.9988199,0.00066692044,0.000091245805,0.00015971113,0.00022437937,0.000037867958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013853599,0.0014389224,0.0008902305,0.0008416721,0.00066045154,0.0011710023,0.0010859754,0.0012136706,0.008426899],"category_scores_gemma":[0.0041169887,0.00076291885,0.0011156752,0.0013844419,0.00051440153,0.0010692232,0.0013059966,0.002640589,0.0038186891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099889,0.00011001442,0.00052175776,0.00022748412,0.00006945176,0.00011643256,0.00009823931,0.57010984,0.0060292045,0.04489892,0.014532728,0.3631861],"study_design_scores_gemma":[0.000040672337,0.000024692628,0.00007727984,0.000016399905,0.0000069474418,0.00003900127,0.0000101590995,0.9758464,0.0013540101,0.016021874,0.0065532494,0.00000927438],"about_ca_topic_score_codex":0.0033827093,"about_ca_topic_score_gemma":0.0046463753,"teacher_disagreement_score":0.008426899,"about_ca_system_score_codex":0.000840919,"about_ca_system_score_gemma":0.002477121,"threshold_uncertainty_score":0.028190792},"labels":[],"label_agreement":null},{"id":"W2299233455","doi":"","title":"Typologie des réseaux de manutention","year":2002,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Typology; Computer science; A priori and a posteriori; Type (biology); Class (philosophy); Selection (genetic algorithm); Artificial intelligence; Geography","score_opus":0.021746768020761593,"score_gpt":0.2138440787728936,"score_spread":0.19209731075213202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299233455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23826653,0.0034258654,0.5749814,0.0031311435,0.0006123736,0.00083785644,0.004405731,0.0024899056,0.1718492],"genre_scores_gemma":[0.6910203,0.0028728328,0.23717713,0.00031816316,0.00045714367,0.0012441846,0.0058595357,0.0006723596,0.060378317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895678,0.0033455305,0.00080734,0.0020353629,0.0027959833,0.001447885],"domain_scores_gemma":[0.98838276,0.005968295,0.0014786859,0.0015515364,0.0019889735,0.00062970916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004298839,0.0018686053,0.0013849457,0.009117095,0.0051187733,0.009650071,0.00247164,0.0051046954,0.021560246],"category_scores_gemma":[0.02139491,0.0010805961,0.0028453954,0.007950132,0.004823968,0.008554977,0.0028505696,0.0033836258,0.0045474307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002529347,0.000099125304,0.010094773,0.0003808728,0.00010920695,0.0017731457,0.0022835976,0.033069324,0.0020217185,0.8681591,0.011372585,0.07038365],"study_design_scores_gemma":[0.00017451966,0.00019182303,0.008267596,0.00038797237,0.00010800144,0.0054605757,0.00871666,0.13052477,0.006079916,0.6116066,0.2282201,0.0002614327],"about_ca_topic_score_codex":0.016821934,"about_ca_topic_score_gemma":0.010216168,"teacher_disagreement_score":0.021560246,"about_ca_system_score_codex":0.005177853,"about_ca_system_score_gemma":0.0022954468,"threshold_uncertainty_score":0.07212621},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"agree"},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014463111164775767,"score_gpt":0.18999380054502807,"score_spread":0.1755306893802523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299253197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42293376,0.00043105552,0.57369214,0.00016050096,0.000028618599,0.00007799651,0.00010542478,0.00033911303,0.0022313092],"genre_scores_gemma":[0.96605885,0.00006582773,0.032982145,0.000013233343,0.000011993242,0.000040390627,0.000045829463,0.00004541998,0.00073629373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995492,0.00012914995,0.00002264238,0.00007707213,0.0001001698,0.000121680896],"domain_scores_gemma":[0.9990237,0.00052666984,0.00016416289,0.00007709805,0.000106972584,0.0001015202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008763716,0.00074099266,0.0011061354,0.0004665585,0.00044983337,0.0010984574,0.0010436539,0.0005691886,0.0013305285],"category_scores_gemma":[0.0016991768,0.00042311288,0.00050037855,0.0008074955,0.00049613666,0.0015270466,0.000995717,0.00048368695,0.00010266966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026100798,0.000055830445,0.00072143937,0.00007261892,0.000049998387,0.00006752367,0.000057622146,0.9607765,0.009258665,0.0026129275,0.00030652856,0.025759242],"study_design_scores_gemma":[0.000018481473,0.00013796627,0.000503693,0.0000044225562,0.000024531113,0.00004329291,0.000048835755,0.99414825,0.0029682058,0.001864658,0.00022736492,0.000010385424],"about_ca_topic_score_codex":0.0038326508,"about_ca_topic_score_gemma":0.0035995287,"teacher_disagreement_score":0.0038326508,"about_ca_system_score_codex":0.0009526028,"about_ca_system_score_gemma":0.0013257426,"threshold_uncertainty_score":0.0076206326},"labels":[],"label_agreement":null},{"id":"W2300219111","doi":"","title":"The Gerber-Shiu Function and the Generalized Cramér-Lundberg Model","year":2009,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; HEC Montréal","funders":"","keywords":"Renewal theory; Erlang (programming language); Exponential function; Exponential distribution; Risk process; Mathematics; Erlang distribution; Poisson process; Ruin theory; Penalty method; Applied mathematics; Poisson distribution; Generalization; Function (biology); Cox process; Mathematical economics; Compound Poisson process; Econometrics; Mathematical optimization; Risk model; Statistics; Computer science; Mathematical analysis","score_opus":0.03769734475139527,"score_gpt":0.2918581062235889,"score_spread":0.2541607614721936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300219111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36374113,0.0029903362,0.5829464,0.00586978,0.0002323882,0.00011543603,0.0003187072,0.00047138723,0.0433145],"genre_scores_gemma":[0.967109,0.0008063542,0.012778609,0.00015491837,0.00011340059,0.000060494156,0.00007273643,0.000048270642,0.018856242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989328,0.00036671708,0.00004716266,0.00018661235,0.000215536,0.00025113163],"domain_scores_gemma":[0.9972863,0.0012804406,0.00048789586,0.00024863234,0.00033542156,0.00036134626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029885408,0.0011218842,0.0020964902,0.0019769177,0.0008756675,0.0028863307,0.0027382986,0.0035385417,0.0049944064],"category_scores_gemma":[0.0065450203,0.00067863596,0.0014752257,0.0011344434,0.00437557,0.0038960013,0.0015299649,0.0027363019,0.000762554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004268003,0.000050175444,0.00054521806,0.000038032293,0.000025137044,0.00030463972,0.00017845322,0.13698481,0.00042985514,0.8564061,0.0012380528,0.0037569623],"study_design_scores_gemma":[0.00003219193,0.000034787197,0.0003494901,0.000028597848,0.000020307978,0.00018578554,0.000077895595,0.6726462,0.0001892086,0.32475546,0.0016385489,0.00004152447],"about_ca_topic_score_codex":0.007494759,"about_ca_topic_score_gemma":0.003574641,"teacher_disagreement_score":0.007494759,"about_ca_system_score_codex":0.0026249953,"about_ca_system_score_gemma":0.0016197945,"threshold_uncertainty_score":0.01904571},"labels":[],"label_agreement":null},{"id":"W2301955550","doi":"","title":"A Survey of Nordhaus-Gaddum Type Relations","year":2010,"lang":"fr","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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Graph; Mathematics; Combinatorics","score_opus":0.02563547579872708,"score_gpt":0.23818977799189342,"score_spread":0.21255430219316634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301955550","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050474007,0.38241333,0.17108946,0.010792419,0.0033574216,0.0001448495,0.0016639361,0.00058273337,0.3794819],"genre_scores_gemma":[0.38965803,0.35232174,0.1745393,0.0061291284,0.010987581,0.00037863594,0.0032097741,0.00057718623,0.062198587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875104,0.00024643057,0.00009816766,0.00034439802,0.00041766657,0.00014226948],"domain_scores_gemma":[0.9978922,0.0013275638,0.0001587845,0.0002272746,0.00027410683,0.00012014511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020439266,0.0008373556,0.0011471802,0.0048165773,0.0026030827,0.0030548295,0.0014162369,0.0014540692,0.008862308],"category_scores_gemma":[0.004003465,0.000766658,0.0009298442,0.01010802,0.0024382214,0.0080857985,0.0021331587,0.0033903923,0.0022546742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038197548,0.000044464694,0.00071661844,0.0005435678,0.000012484752,0.000059505324,0.00019417767,0.0009874811,0.00047764744,0.9121337,0.010457279,0.074334875],"study_design_scores_gemma":[0.000017019003,0.000074787546,0.001268218,0.0004107698,0.000033129,0.0007089608,0.00018907369,0.003186278,0.0009308477,0.7848373,0.20828635,0.00005731815],"about_ca_topic_score_codex":0.0016590497,"about_ca_topic_score_gemma":0.0016219328,"teacher_disagreement_score":0.008862308,"about_ca_system_score_codex":0.002915808,"about_ca_system_score_gemma":0.0014842524,"threshold_uncertainty_score":0.02964741},"labels":[],"label_agreement":null},{"id":"W2303292413","doi":"","title":"Filtering for Detecting Multiple Targets Trajectories on a One-Dimensional Torus","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Torus; Markov chain; Filter (signal processing); Computer science; Algorithm; Artificial intelligence; Mathematics; Computer vision; Machine learning","score_opus":0.020840896739951514,"score_gpt":0.2506326606169617,"score_spread":0.2297917638770102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303292413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027005212,0.000090458925,0.9723282,0.00006943854,0.0000150085325,0.00001178177,0.00002361865,0.00017362341,0.0002826282],"genre_scores_gemma":[0.2639182,0.00036897248,0.7338907,0.000040425446,0.00005063712,0.00007159123,0.00015284948,0.000053972322,0.0014526012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996327,0.000093482704,0.000017659138,0.00007920439,0.00012765429,0.00004929797],"domain_scores_gemma":[0.9988814,0.0007361289,0.00012497333,0.00007813794,0.00013754671,0.000041776788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008036933,0.00045672955,0.00073813443,0.00080044277,0.00037924876,0.0005321296,0.0005531824,0.00091830123,0.00079185516],"category_scores_gemma":[0.003210912,0.00039949312,0.00055194047,0.00093386124,0.00091656303,0.0010588337,0.0005875545,0.00061883696,0.00032003515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060439634,0.000040983992,0.0019176687,0.00017324438,0.00008041129,0.00035276913,0.00040183376,0.6806454,0.0610598,0.034076255,0.0014530766,0.21919419],"study_design_scores_gemma":[0.000010688736,0.000058244234,0.00040507162,0.0000044361313,0.000008640489,0.000112458045,0.000022029484,0.9876887,0.0057796487,0.00524693,0.00064820447,0.000014945266],"about_ca_topic_score_codex":0.003980362,"about_ca_topic_score_gemma":0.0026007192,"teacher_disagreement_score":0.003980362,"about_ca_system_score_codex":0.00060679094,"about_ca_system_score_gemma":0.0007205818,"threshold_uncertainty_score":0.007914424},"labels":[],"label_agreement":null},{"id":"W2303499397","doi":"","title":"On the Extremal Values of the Second Largest Q–Eigenvalue","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Simple (philosophy); Simple graph; Discrete mathematics; Laplace operator; Mathematical analysis; Physics","score_opus":0.016713533978247888,"score_gpt":0.24418107915876008,"score_spread":0.2274675451805122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303499397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878336,0.0007557646,0.08216694,0.001507267,0.000057665326,0.000026104728,0.00014597324,0.00016075827,0.03684341],"genre_scores_gemma":[0.99163824,0.00026100632,0.005977224,0.0000964824,0.000050652598,0.00003526153,0.000057789905,0.00004899554,0.0018344143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.00012875306,0.000008299706,0.00007247569,0.000063251086,0.000077310324],"domain_scores_gemma":[0.9968053,0.0020215502,0.00048408107,0.00013865544,0.00024129552,0.00030906318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083925395,0.0006623369,0.00052682747,0.0022614712,0.0013391777,0.0012693736,0.0007481966,0.0009398906,0.004533856],"category_scores_gemma":[0.0046576494,0.00038074184,0.0004199208,0.0009262746,0.0023740432,0.0017788368,0.00082877226,0.00093250495,0.00031735597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012172167,0.000062141364,0.0027938946,0.00014095446,0.000037687838,0.0004241055,0.00034565397,0.024531795,0.011072584,0.9506166,0.0027294224,0.007123551],"study_design_scores_gemma":[0.00003233377,0.000055548182,0.0038016762,0.00005854917,0.00002282691,0.0004485597,0.00036991868,0.09942509,0.0028315748,0.891069,0.0018397366,0.00004522138],"about_ca_topic_score_codex":0.0004474969,"about_ca_topic_score_gemma":0.000502956,"teacher_disagreement_score":0.004533856,"about_ca_system_score_codex":0.0008411999,"about_ca_system_score_gemma":0.00027472407,"threshold_uncertainty_score":0.015167236},"labels":[],"label_agreement":null},{"id":"W2303539751","doi":"","title":"A Weighted Multivariate Sign Test for Cluster Correlated Data","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Sign test; Multivariate statistics; Asymptotic distribution; Statistics; Test statistic; Weighting; Multivariate normal distribution; Sign (mathematics); Statistic; Cluster (spacecraft); Likelihood-ratio test; Statistical hypothesis testing; Applied mathematics; Estimator; Computer science; Wilcoxon signed-rank test; Mann–Whitney U test","score_opus":0.06812822591355493,"score_gpt":0.3477360641777616,"score_spread":0.27960783826420665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2303539751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02120352,0.00014495933,0.9771114,0.00029053766,0.0000467407,0.00006673914,0.000092356764,0.00018790213,0.00085580343],"genre_scores_gemma":[0.41669363,0.0003914638,0.5787307,0.0002947374,0.00023828466,0.00060797075,0.00058337534,0.00021642717,0.0022432997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890799,0.007262842,0.00033442333,0.0010769811,0.0019308617,0.00031507196],"domain_scores_gemma":[0.9468577,0.039831482,0.0052808775,0.003938165,0.0032899908,0.00080186664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01586447,0.0009162984,0.0017935017,0.0037795012,0.00074671005,0.0017429016,0.0027822834,0.0021224986,0.0040037204],"category_scores_gemma":[0.10840886,0.00041258783,0.00106857,0.00536147,0.002665514,0.0036753593,0.0030488668,0.0022298235,0.0009857034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006949651,0.00022708063,0.034920365,0.0004700497,0.00058819575,0.001419539,0.00042840373,0.18960327,0.0066507175,0.25415468,0.0054331734,0.5054095],"study_design_scores_gemma":[0.00009904746,0.0004723983,0.004383363,0.000065318636,0.000083779174,0.0007901844,0.00013506883,0.8081684,0.0033221992,0.17903629,0.0033586859,0.00008523488],"about_ca_topic_score_codex":0.00069722626,"about_ca_topic_score_gemma":0.00067776465,"teacher_disagreement_score":0.01586447,"about_ca_system_score_codex":0.00065102463,"about_ca_system_score_gemma":0.0018196711,"threshold_uncertainty_score":0.08390039},"labels":[],"label_agreement":null},{"id":"W2308869598","doi":"","title":"Exploring centrality measures and their extensions through an influence network","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Centrality; Position (finance); Set (abstract data type); Point (geometry); Business; Network analysis; Network theory; Social network analysis; Knowledge management; Computer science; Data science; Public relations; Accounting; Political science; Engineering; Finance; World Wide Web; Mathematics","score_opus":0.06781034021774605,"score_gpt":0.217121016310312,"score_spread":0.14931067609256593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308869598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28755367,0.0016557539,0.6962574,0.00081866083,0.00004414741,0.000074042866,0.00037896063,0.0002087385,0.013008618],"genre_scores_gemma":[0.9399424,0.0006138755,0.057884824,0.00004237411,0.000093386996,0.00008658724,0.0001869088,0.000041786283,0.0011079351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972908,0.0015062122,0.00006605306,0.0004906246,0.00050140824,0.00014478256],"domain_scores_gemma":[0.97154117,0.02305611,0.0025252746,0.0010528105,0.0011414257,0.0006832946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003914182,0.00063176075,0.00054009754,0.0067911413,0.0010940457,0.002921113,0.0010150917,0.00084424694,0.0018359876],"category_scores_gemma":[0.02296555,0.0003350587,0.00061490695,0.0055447537,0.0028679057,0.0052122725,0.0015750335,0.0011463249,0.0002184992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014046066,0.00015820138,0.045999486,0.00025238516,0.00023337342,0.00035152675,0.0027833087,0.07706527,0.0032807281,0.80155444,0.0011074885,0.06707323],"study_design_scores_gemma":[0.000030884858,0.00016183959,0.023494193,0.000117755735,0.00013136376,0.0004957579,0.0011465742,0.5401215,0.001083465,0.42473945,0.008389296,0.00008793881],"about_ca_topic_score_codex":0.0049133166,"about_ca_topic_score_gemma":0.004619685,"teacher_disagreement_score":0.0067911413,"about_ca_system_score_codex":0.0014353319,"about_ca_system_score_gemma":0.000535035,"threshold_uncertainty_score":0.020700395},"labels":[],"label_agreement":null},{"id":"W2309741164","doi":"","title":"How Much Wavelength Conversion Allows a Reduction in the Blocking Rate","year":2006,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Concordia University","funders":"","keywords":"Tabu search; Blocking (statistics); Heuristic; Routing and wavelength assignment; Network topology; Computer science; Wavelength-division multiplexing; Mathematical optimization; Partition (number theory); Algorithm; Mathematics; Topology (electrical circuits); Computer network; Wavelength; Optics","score_opus":0.0051009426643510184,"score_gpt":0.1725827133046261,"score_spread":0.16748177064027508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309741164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80798036,0.000963795,0.17411745,0.0009305544,0.00006809354,0.000064065214,0.00011731235,0.0002680913,0.015490286],"genre_scores_gemma":[0.9710476,0.00038806425,0.027428985,0.000077921,0.000025822033,0.000025253375,0.000042398457,0.00006728738,0.00089670444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909735,0.00033806276,0.000018265915,0.00012909023,0.00012866706,0.00028869472],"domain_scores_gemma":[0.99712914,0.0020869838,0.00033134676,0.00025674916,0.00008444288,0.00011129125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014774934,0.00089370826,0.0009553627,0.00045518982,0.00057608436,0.0011959614,0.0009733656,0.0010129078,0.0026500584],"category_scores_gemma":[0.0051096696,0.00028432245,0.000520005,0.00068897865,0.0009533555,0.0015129672,0.0005067171,0.0009024643,0.00031485854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052802055,0.00038270827,0.0026656403,0.00020902677,0.00010948433,0.00011294573,0.00010550737,0.8942076,0.030490573,0.016914353,0.0007248329,0.053549346],"study_design_scores_gemma":[0.00013604457,0.00078431057,0.0023130325,0.00004100387,0.00019671858,0.00036536565,0.00025717643,0.9338428,0.032672144,0.027565587,0.0017847855,0.00004104288],"about_ca_topic_score_codex":0.0017204874,"about_ca_topic_score_gemma":0.0023999105,"teacher_disagreement_score":0.0026500584,"about_ca_system_score_codex":0.0006685354,"about_ca_system_score_gemma":0.00083294173,"threshold_uncertainty_score":0.008865297},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.054811962674564285,"score_gpt":0.30161053066050675,"score_spread":0.24679856798594246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310089532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35843197,0.0059373653,0.56714857,0.0067212526,0.00035477706,0.00009525235,0.0003013374,0.0005663642,0.060443144],"genre_scores_gemma":[0.8966864,0.0036173125,0.08544143,0.00066520215,0.0010125426,0.00021653512,0.00033329724,0.0003674375,0.011659842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983333,0.00070058234,0.000046391433,0.0003382397,0.00042309772,0.0001584214],"domain_scores_gemma":[0.9848053,0.012573304,0.000836166,0.00077576056,0.00062406296,0.00038539583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026326342,0.0009261046,0.001323289,0.0029658787,0.0016410914,0.0022818637,0.0015695199,0.0017908921,0.0066107446],"category_scores_gemma":[0.016481472,0.00069507246,0.0012162513,0.0020742281,0.004958484,0.0060293227,0.002675574,0.0036114857,0.0007399268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059201437,0.0000641885,0.0008720595,0.00014760885,0.000027191021,0.00010754411,0.0004268072,0.022315368,0.0009394314,0.95980144,0.002348367,0.012890756],"study_design_scores_gemma":[0.000019789137,0.00002626159,0.00033897045,0.00003460459,0.000009054357,0.00008263406,0.00014023697,0.08832089,0.0006584748,0.90797514,0.0023770088,0.000016890152],"about_ca_topic_score_codex":0.0011227197,"about_ca_topic_score_gemma":0.00049942575,"teacher_disagreement_score":0.0066107446,"about_ca_system_score_codex":0.0014603783,"about_ca_system_score_gemma":0.00073684345,"threshold_uncertainty_score":0.022115171},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01847488940365453,"score_gpt":0.23466102340845912,"score_spread":0.2161861340048046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339305992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011383422,0.000033519354,0.9983413,0.000016953056,0.00001293179,0.000013508823,0.0000053978765,0.00010820223,0.0003298731],"genre_scores_gemma":[0.22060171,0.00023376413,0.7741612,0.000084577085,0.00007382743,0.0002239996,0.00013607087,0.0002021567,0.004282749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00020545453,0.000024543358,0.00010969682,0.00022075902,0.000059999336],"domain_scores_gemma":[0.9988753,0.0006243684,0.00009796803,0.00011353982,0.00023299547,0.000055681943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011629908,0.00076173904,0.0009912197,0.00060903904,0.0004139748,0.00072105305,0.0012360576,0.0009095667,0.00296059],"category_scores_gemma":[0.0030096453,0.00048012854,0.0007045862,0.0006558785,0.000982788,0.00089633744,0.001277473,0.0016501908,0.0010229504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014846532,0.00005278309,0.00021722988,0.0001120551,0.000039549635,0.000078682206,0.00009619938,0.82832795,0.0068383366,0.03741759,0.002148855,0.12452231],"study_design_scores_gemma":[0.000009777663,0.000034779332,0.000021627542,0.0000040442283,0.000004230312,0.000018613673,0.0000032269702,0.99423164,0.0013455807,0.0033832202,0.000937098,0.0000061482674],"about_ca_topic_score_codex":0.002129971,"about_ca_topic_score_gemma":0.0011217523,"teacher_disagreement_score":0.00296059,"about_ca_system_score_codex":0.00058491493,"about_ca_system_score_gemma":0.0009946664,"threshold_uncertainty_score":0.009904146},"labels":[],"label_agreement":null},{"id":"W2339340189","doi":"","title":"Impacts of Imports and Natural Gas on Electricity Prices: The Case of Ontario","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Energy, Environment, and Transportation Policies","field":"Energy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Natural gas; Electricity; Economics; Natural resource economics; Natural (archaeology); Business; Geography; Engineering; Waste management","score_opus":0.0041288677792746965,"score_gpt":0.1972715096755472,"score_spread":0.1931426418962725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339340189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94122106,0.0005642397,0.00020936134,0.003762296,0.000012136676,0.000028761186,0.0009380428,0.000014485332,0.053249653],"genre_scores_gemma":[0.99050057,0.00049251365,0.00012219795,0.0001439598,0.0000071878167,0.0000066811513,0.00017570565,0.000006516307,0.008544634],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991567,0.000098264034,0.000020235853,0.000046328325,0.00017260206,0.0005058165],"domain_scores_gemma":[0.9987465,0.00035334687,0.00020178579,0.00004268879,0.0004105018,0.00024509328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040846458,0.00019253347,0.0003561993,0.00048267576,0.0033991395,0.0028095413,0.0008845077,0.0014776123,0.0068375356],"category_scores_gemma":[0.0023394858,0.0003273667,0.0008398651,0.0017234187,0.0018232898,0.000987519,0.0008427993,0.0010769592,0.00019458814],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016828455,0.0004056899,0.5661094,0.00044676437,0.0006560388,0.013123574,0.010517441,0.10909129,0.00526568,0.23130749,0.03396947,0.02742434],"study_design_scores_gemma":[0.0005921647,0.00026447416,0.75487804,0.00018330303,0.0009610628,0.0010946152,0.04802731,0.06429209,0.002745157,0.02480245,0.10183895,0.0003203405],"about_ca_topic_score_codex":0.9934089,"about_ca_topic_score_gemma":0.99757594,"teacher_disagreement_score":0.050164245,"about_ca_system_score_codex":0.050164245,"about_ca_system_score_gemma":0.024814805,"threshold_uncertainty_score":0.3639688},"labels":[],"label_agreement":null},{"id":"W2339481321","doi":"","title":"On the minimum principle and dynamic programming for hybrid systems with low dimensional switching manifolds","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hybrid system; Class (philosophy); Mathematics; Codimension; Dynamic programming; Optimal control; Control theory (sociology); Control (management); Pure mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Combinatorics; Artificial intelligence","score_opus":0.009110286341357101,"score_gpt":0.21681046664830453,"score_spread":0.20770018030694742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339481321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03146424,0.0010262852,0.9501447,0.0009495638,0.000048707512,0.000035785637,0.00008078195,0.00005136822,0.016198566],"genre_scores_gemma":[0.82789475,0.0025150324,0.15512532,0.00033566702,0.0002874553,0.0004260317,0.00022444323,0.00015580154,0.013035447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955064,0.00019814592,0.000015305055,0.00008186774,0.00010750746,0.000046628287],"domain_scores_gemma":[0.99864966,0.0010023263,0.00011325217,0.000047707894,0.000121878555,0.000065220156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015711654,0.0009713544,0.00094855303,0.0008182626,0.000630802,0.0011850151,0.0009938523,0.0010790295,0.0029529445],"category_scores_gemma":[0.002699272,0.00047776275,0.00094568345,0.0006806056,0.0025587755,0.0018226772,0.0020087527,0.0022541303,0.0003092622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024845147,0.000026373624,0.00020876517,0.00009352437,0.00003073891,0.00008382983,0.000121482946,0.15504576,0.0019177424,0.8323231,0.0009115637,0.009212298],"study_design_scores_gemma":[0.0000083136,0.00004230321,0.00020491281,0.000024136169,0.000006161056,0.000037183218,0.00003860445,0.45115516,0.00026189408,0.5468891,0.0013195677,0.000012661828],"about_ca_topic_score_codex":0.0012997425,"about_ca_topic_score_gemma":0.0007736436,"teacher_disagreement_score":0.0029529445,"about_ca_system_score_codex":0.00091812626,"about_ca_system_score_gemma":0.000809401,"threshold_uncertainty_score":0.009878576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Economics; Computer science; Mathematical economics; Natural resource economics; Environmental economics","score_opus":0.024771599393710004,"score_gpt":0.21649435925722776,"score_spread":0.19172275986351775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341460036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03253794,0.03735252,0.7851199,0.023152279,0.0010341796,0.00014327692,0.00027290458,0.00009557645,0.12029147],"genre_scores_gemma":[0.8697002,0.045456946,0.060415696,0.0017705244,0.001247219,0.00024714094,0.00012874212,0.000045210458,0.020988284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982101,0.0011295963,0.000069110356,0.0001217746,0.0003178849,0.00015159488],"domain_scores_gemma":[0.9980205,0.0015571874,0.0001527359,0.00006304017,0.000112149035,0.00009433328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015981094,0.00097167795,0.0011042373,0.0009548817,0.0008405597,0.0031351843,0.0013509021,0.0021513954,0.0029000565],"category_scores_gemma":[0.0034396532,0.00053007103,0.0008598935,0.0016539391,0.0033572628,0.0037539632,0.0013028819,0.002444475,0.0002544301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010258276,0.0000269753,0.00014274874,0.000066809866,0.000022798384,0.000037999864,0.000066915265,0.068336844,0.00011459381,0.92466635,0.0013768527,0.005130875],"study_design_scores_gemma":[0.000016508759,0.000019404899,0.00013565246,0.000045302102,0.000008669449,0.000017676957,0.00008801653,0.06992913,0.00007492347,0.92103076,0.0086198775,0.000014152006],"about_ca_topic_score_codex":0.009092819,"about_ca_topic_score_gemma":0.00738919,"teacher_disagreement_score":0.009092819,"about_ca_system_score_codex":0.0032588928,"about_ca_system_score_gemma":0.0023045081,"threshold_uncertainty_score":0.023645103},"labels":[],"label_agreement":null},{"id":"W2341859722","doi":"","title":"Load shaping via grid wide coordination of heating-cooling electric loads: A mean field games based approach","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Grid; Distributed generation; Aggregate (composite); Load balancing (electrical power); Smoothing; Computer science; Engineering; Renewable energy; Electrical engineering; Mathematics","score_opus":0.01318602606314883,"score_gpt":0.19504715880688955,"score_spread":0.18186113274374072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341859722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047029383,0.0002206552,0.9356033,0.0006328634,0.00007540573,0.0000812777,0.000084398554,0.000120711935,0.01615192],"genre_scores_gemma":[0.9625576,0.00014650452,0.029055974,0.00013534319,0.00003746528,0.00010905582,0.00003677201,0.000038466416,0.007882638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00016190736,0.000009172764,0.0000666545,0.000051180257,0.00007922895],"domain_scores_gemma":[0.9993783,0.00035606258,0.00008904545,0.000023279877,0.000076320204,0.000076996075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000816849,0.0009941933,0.0010528237,0.00044417984,0.00050950947,0.0011841689,0.0011126195,0.0010798594,0.0038612154],"category_scores_gemma":[0.001333852,0.0004571551,0.00079870864,0.00032527206,0.0012031696,0.0009569323,0.0013021054,0.001129046,0.0002735641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004417095,0.00002450408,0.00020788598,0.000019788315,0.000022239097,0.00006456415,0.00003516732,0.972635,0.0006821021,0.022532431,0.0006149105,0.0031172629],"study_design_scores_gemma":[0.0000058376954,0.000012658437,0.000038624297,0.0000019983795,0.0000034837835,0.0000045877396,0.000008581266,0.9942268,0.00005530481,0.00548928,0.00014999537,0.000002884068],"about_ca_topic_score_codex":0.007232312,"about_ca_topic_score_gemma":0.00730153,"teacher_disagreement_score":0.007232312,"about_ca_system_score_codex":0.0017575886,"about_ca_system_score_gemma":0.0011318398,"threshold_uncertainty_score":0.014380395},"labels":[],"label_agreement":null},{"id":"W2546541767","doi":"","title":"Minimum CAPEX Design of Segment p -Cycles with Full Node Protection","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Node (physics); Context (archaeology); Compromise; Path (computing); Computer science; Network Access Protection; Reliability engineering; Computer network; Engineering","score_opus":0.019292572964773935,"score_gpt":0.2044228798776518,"score_spread":0.18513030691287785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546541767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19027808,0.0007251473,0.79318696,0.000206343,0.00007183012,0.00034980194,0.00012977106,0.0005577917,0.014494278],"genre_scores_gemma":[0.95954704,0.00012585813,0.03799078,0.0000378891,0.000014738848,0.000089221336,0.00003572288,0.00004581461,0.0021129418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.00008682145,0.000023876377,0.00008240851,0.000081583996,0.000078927915],"domain_scores_gemma":[0.9992592,0.00018734141,0.00013377634,0.00014355336,0.0002143552,0.00006190337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046437836,0.0006185029,0.00051069027,0.00050110527,0.00043842132,0.0008377763,0.001521026,0.0003773376,0.0031897724],"category_scores_gemma":[0.0012710206,0.00024285118,0.00026123863,0.0004036362,0.00041079195,0.0008253723,0.0005664177,0.00039179463,0.0002767272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014461555,0.00022767247,0.002159361,0.00057890225,0.0001492657,0.0005729376,0.00035686436,0.55729365,0.15829778,0.07381166,0.0041114613,0.20099428],"study_design_scores_gemma":[0.00013025427,0.0010227691,0.0010860948,0.000057698267,0.000092416354,0.00045171488,0.000073721785,0.91225827,0.05822135,0.018115673,0.008455091,0.000034997265],"about_ca_topic_score_codex":0.001051385,"about_ca_topic_score_gemma":0.0016229679,"teacher_disagreement_score":0.0031897724,"about_ca_system_score_codex":0.0008624007,"about_ca_system_score_gemma":0.0008285333,"threshold_uncertainty_score":0.010670841},"labels":[],"label_agreement":null},{"id":"W2562580352","doi":"","title":"Future of the Canadian Oil Sector: Insights from a Forecasting-Planning Approach","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Global Energy and Sustainability Research","field":"Energy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Production (economics); Oil price; Shore; Oil production; Oil sands; Business; Economics; Engineering; Geography; Petroleum engineering; Microeconomics; Asphalt; Geology","score_opus":0.014640014048922621,"score_gpt":0.20403483359621108,"score_spread":0.18939481954728846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562580352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46379387,0.028474001,0.14454633,0.06545488,0.000347592,0.00032368655,0.014637101,0.00063596276,0.28178656],"genre_scores_gemma":[0.9652169,0.009173612,0.01803356,0.00022252201,0.00005960506,0.00003545839,0.0014426261,0.000035885874,0.005779882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.000076581295,0.000010155939,0.000041667427,0.000108414344,0.000077956],"domain_scores_gemma":[0.99932873,0.00023027942,0.000063482425,0.000024674613,0.0002746093,0.00007827857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775786,0.00076956785,0.0002881473,0.0019721123,0.0013936502,0.0025567927,0.0012729276,0.0007185295,0.0032999183],"category_scores_gemma":[0.0026749007,0.00026961125,0.0004653213,0.0036686065,0.0008251714,0.0011297732,0.0005674785,0.00087478023,0.00016845748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047668425,0.00003757077,0.023174116,0.00017499138,0.000072938565,0.00028665146,0.0007937434,0.7225966,0.0003158773,0.16877285,0.0147389155,0.06898808],"study_design_scores_gemma":[0.000011914138,0.000014414019,0.01545878,0.0001686352,0.00006626921,0.000045101217,0.0013887277,0.8927063,0.00024928988,0.056130406,0.03369593,0.00006433208],"about_ca_topic_score_codex":0.9731986,"about_ca_topic_score_gemma":0.97020954,"teacher_disagreement_score":0.028228808,"about_ca_system_score_codex":0.028228808,"about_ca_system_score_gemma":0.025803726,"threshold_uncertainty_score":0.20481527},"labels":[],"label_agreement":null},{"id":"W2563497407","doi":"","title":"Approximated cooperative equilibria for games played over event trees","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Stochastic game; Mathematical economics; Event (particle physics); Focus (optics); Class (philosophy); Mathematics; Tree (set theory); Computer science; Economics; Combinatorics; Artificial intelligence; Physics","score_opus":0.03603536184778274,"score_gpt":0.23106910902451155,"score_spread":0.1950337471767288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563497407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24193215,0.0004865648,0.7337888,0.00054086035,0.00005067298,0.00011077553,0.00022327328,0.0001675373,0.02269949],"genre_scores_gemma":[0.9622264,0.0004320817,0.028176317,0.00009896265,0.000034305565,0.00014981598,0.00017128003,0.000047549504,0.008663278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988335,0.00042477567,0.000071771254,0.0001853751,0.00022560332,0.00025889435],"domain_scores_gemma":[0.99558985,0.002796724,0.0007206218,0.00018777185,0.00034401292,0.00036095973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015891916,0.0010383595,0.0010104539,0.0011494128,0.0008461959,0.0020061668,0.0013344759,0.0014525288,0.0058242013],"category_scores_gemma":[0.009847038,0.00036487012,0.0009394769,0.0007995521,0.0017027241,0.0023105182,0.0013162863,0.0012973623,0.00057722186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010370884,0.0000549907,0.00072666584,0.000077727236,0.000042601045,0.00030614188,0.00034893665,0.16307999,0.0015397379,0.8282218,0.00085828133,0.0046394602],"study_design_scores_gemma":[0.000028588693,0.000042571846,0.00021800298,0.0000290335,0.000011990398,0.00007747606,0.000099545585,0.60406834,0.0003178347,0.39398316,0.0011071247,0.000016414882],"about_ca_topic_score_codex":0.0028627792,"about_ca_topic_score_gemma":0.002064301,"teacher_disagreement_score":0.0058242013,"about_ca_system_score_codex":0.002080816,"about_ca_system_score_gemma":0.0008553361,"threshold_uncertainty_score":0.019483924},"labels":[],"label_agreement":null},{"id":"W2564716879","doi":"","title":"General variable neighborhood search for the uncapacitated single allocation \\(p\\)-hub center problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Heuristic; Mathematical optimization; Variable (mathematics); Local search (optimization); Descent (aeronautics); Computer science; Mathematics; Ant colony optimization algorithms; Metaheuristic; Engineering; Geography","score_opus":0.030715310732639483,"score_gpt":0.24590282781208728,"score_spread":0.2151875170794478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564716879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02626305,0.00032378588,0.9698102,0.00011609984,0.00002180245,0.00006175844,0.00004617516,0.00014527423,0.0032119127],"genre_scores_gemma":[0.55094063,0.000396732,0.44297194,0.000104811195,0.000040157498,0.00024232484,0.0002269012,0.00012465597,0.004951823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997075,0.00014184877,0.000006931268,0.000060483537,0.000049290236,0.00003386089],"domain_scores_gemma":[0.9996691,0.00022094221,0.000040234878,0.000021635196,0.000030035833,0.00001806592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659276,0.00045158953,0.00079311966,0.00039685657,0.0002896854,0.00041365018,0.00094448816,0.0005365967,0.001484263],"category_scores_gemma":[0.00113774,0.00025976409,0.00038473817,0.00053652946,0.0004239203,0.0006359324,0.0004923142,0.00057351,0.00020464345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034159446,0.000025421026,0.00022830036,0.0000414512,0.000015381987,0.00003388822,0.000018283294,0.9672925,0.0005692587,0.010279181,0.0008641512,0.020598097],"study_design_scores_gemma":[0.0000090724825,0.00002138708,0.00005667496,0.0000033762974,0.0000028385136,0.0000149867665,0.000006941157,0.995453,0.00020557783,0.0036252919,0.0005982967,0.0000024923263],"about_ca_topic_score_codex":0.0034536088,"about_ca_topic_score_gemma":0.0046166424,"teacher_disagreement_score":0.0034536088,"about_ca_system_score_codex":0.0005533643,"about_ca_system_score_gemma":0.0008524931,"threshold_uncertainty_score":0.0068669915},"labels":[],"label_agreement":null},{"id":"W2567006712","doi":"","title":"Improved Compact Linearizations for the Unconstrained Quadratic 0-1 Minimization Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Linearization; Mathematics; Quadratic equation; Minification; Upper and lower bounds; Mathematical optimization; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.011528368713001955,"score_gpt":0.2189448606967072,"score_spread":0.20741649198370526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567006712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02934951,0.00068831124,0.95200765,0.00037630764,0.00013342008,0.00025574217,0.0003034532,0.0020429108,0.014842668],"genre_scores_gemma":[0.41912806,0.0009926016,0.557747,0.0005648564,0.00016018235,0.0008413454,0.0016761018,0.0007972166,0.018092576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992648,0.00022607816,0.000040024577,0.000095218085,0.00027754623,0.00009637239],"domain_scores_gemma":[0.99872476,0.000607552,0.00018557903,0.00017978979,0.00023805039,0.00006429202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012999771,0.001586777,0.0010420568,0.0009047363,0.00046559703,0.0009317394,0.0016041625,0.0010092157,0.011160805],"category_scores_gemma":[0.003995074,0.00046885828,0.0008836784,0.0009462729,0.00072372105,0.002190484,0.0016613274,0.0018317228,0.0027354704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042068644,0.00044519533,0.0005359812,0.0005251234,0.00006922542,0.00033389142,0.00044909245,0.6428823,0.010584037,0.059152946,0.016744211,0.26785737],"study_design_scores_gemma":[0.00016074513,0.0005122886,0.00036887117,0.00006805864,0.000031030817,0.0001556464,0.0001871942,0.9549419,0.0061200755,0.023537565,0.013869729,0.000046969486],"about_ca_topic_score_codex":0.0024225507,"about_ca_topic_score_gemma":0.0031798978,"teacher_disagreement_score":0.011160805,"about_ca_system_score_codex":0.00069968385,"about_ca_system_score_gemma":0.0009926746,"threshold_uncertainty_score":0.037336588},"labels":[],"label_agreement":null},{"id":"W2581872955","doi":"","title":"A Simulation-and-Regression Approach for Stochastic Dynamic Programs with Endogenous State Variables","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Water resources management and optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"State variable; Control variable; Variable (mathematics); Endogeneity; Stochastic control; Flexibility (engineering); Discretization; Variables; Regression analysis; State (computer science); Computer science; Mathematical optimization; Econometrics; Mathematics; Optimal control; Statistics; Algorithm","score_opus":0.019453085225566054,"score_gpt":0.18567732656024863,"score_spread":0.16622424133468258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581872955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006966958,0.0003052529,0.98828274,0.00035511696,0.000037703423,0.00005254759,0.000043895107,0.0001025517,0.003853121],"genre_scores_gemma":[0.63349956,0.0014293615,0.3543447,0.00025295175,0.00019392867,0.0008148623,0.00022895698,0.0002502629,0.008985426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985434,0.0010229441,0.000036419016,0.00013633196,0.00015363467,0.00010720919],"domain_scores_gemma":[0.99561065,0.0035893782,0.00032900154,0.00012322766,0.00023727237,0.00011048732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026589395,0.00141332,0.0018606563,0.0010578089,0.0006115221,0.0011843973,0.0013543274,0.0018197404,0.004213649],"category_scores_gemma":[0.008006936,0.00076689577,0.0014718308,0.0010834566,0.0014535575,0.0012360794,0.0015330769,0.0019241404,0.00037020372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006743163,0.000012855403,0.00009351234,0.000015703612,0.000014790678,0.000015113399,0.000009961112,0.98625284,0.000086495405,0.011987571,0.000060144674,0.0014441463],"study_design_scores_gemma":[0.0000032862993,0.000006185515,0.000012060813,0.0000030667484,0.0000025608815,0.0000022054396,0.0000022336894,0.99707484,0.0000387797,0.0026934384,0.00015902663,0.0000022683544],"about_ca_topic_score_codex":0.01042663,"about_ca_topic_score_gemma":0.0056244913,"teacher_disagreement_score":0.01042663,"about_ca_system_score_codex":0.0012310118,"about_ca_system_score_gemma":0.0021095653,"threshold_uncertainty_score":0.020731926},"labels":[],"label_agreement":null},{"id":"W2583058118","doi":"","title":"On the Impact of Symmetry-Breaking Constraints on Spatial Branch-and-Bound for Circle Packing in a Square","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Homogeneous space; Square (algebra); Symmetry (geometry); Point (geometry); Branch and bound; Node (physics); Task (project management); Relaxation (psychology); Mathematics; Regular polygon; Packing problems; Symmetry breaking; Square root; Linear programming relaxation; Upper and lower bounds; Branch and cut; Mathematical optimization; Computer science; Linear programming; Geometry; Mathematical analysis; Physics; Engineering","score_opus":0.018688709998038396,"score_gpt":0.22758614048801823,"score_spread":0.20889743048997983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583058118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09815353,0.0010779422,0.86929727,0.0017427643,0.00012520098,0.0001364151,0.000107691354,0.00019902451,0.029160269],"genre_scores_gemma":[0.63630885,0.001605271,0.35621038,0.00050100486,0.0001573555,0.00024247896,0.00014540394,0.0004029999,0.0044262405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975504,0.0014598422,0.000066533285,0.00017833442,0.00047552667,0.00026933855],"domain_scores_gemma":[0.98492163,0.013090567,0.0006257124,0.00061101734,0.0005456684,0.00020548032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004156228,0.0010180314,0.0012070782,0.00093399873,0.0011330843,0.0023561665,0.0012543023,0.0012426926,0.0071747927],"category_scores_gemma":[0.026555128,0.0006607711,0.0007417384,0.0022657542,0.0022719456,0.0041153175,0.0017962817,0.0020604753,0.0006699347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002159012,0.000080021535,0.0005629324,0.00014942435,0.0000263168,0.00010536724,0.00012743735,0.83787596,0.0016043695,0.11441925,0.0026927001,0.042140305],"study_design_scores_gemma":[0.000030548927,0.00006370648,0.00013580066,0.000020475847,0.000009844931,0.000028468838,0.000057483303,0.9503082,0.0010512919,0.04730352,0.000978986,0.0000115517],"about_ca_topic_score_codex":0.0050190464,"about_ca_topic_score_gemma":0.0042909677,"teacher_disagreement_score":0.0071747927,"about_ca_system_score_codex":0.0015540288,"about_ca_system_score_gemma":0.0015002112,"threshold_uncertainty_score":0.024002075},"labels":[],"label_agreement":null},{"id":"W2583578899","doi":"","title":"Using Predictive Risk for Process Control","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Flexibility (engineering); Computer science; Process (computing); Statistical process control; Scale (ratio); Reliability engineering; Statistics; Engineering; Mathematics","score_opus":0.14596068118722164,"score_gpt":0.4002281405507771,"score_spread":0.25426745936355544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583578899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010326199,0.00070977287,0.9842285,0.0006039145,0.00007360563,0.000030857085,0.000040294497,0.00019840137,0.0037884924],"genre_scores_gemma":[0.9075859,0.0009400484,0.08637655,0.00018567812,0.00022119515,0.00015320425,0.00008889821,0.000083406594,0.0043651387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996287,0.0018474432,0.0001493967,0.0004911107,0.0010245891,0.00020045554],"domain_scores_gemma":[0.98895115,0.007932497,0.0010733032,0.0007777522,0.0010743599,0.00019095915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007724642,0.0015614979,0.0012946941,0.0014384538,0.0005564881,0.0027357424,0.001384852,0.0012724554,0.0033332792],"category_scores_gemma":[0.021223567,0.00042237277,0.0011241474,0.0011064864,0.0020552324,0.0027094253,0.0016078447,0.002498246,0.00030960943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060619197,0.000030436686,0.0011610803,0.00006113992,0.00006741819,0.00008124496,0.000058183163,0.83439296,0.00033186923,0.13841502,0.0005703886,0.024769614],"study_design_scores_gemma":[0.000004565704,0.00002547009,0.00011555992,0.000017219305,0.000010406275,0.000011449491,0.0000073438277,0.93029547,0.00017111858,0.06895109,0.00037982353,0.000010450532],"about_ca_topic_score_codex":0.006614102,"about_ca_topic_score_gemma":0.003508583,"teacher_disagreement_score":0.007724642,"about_ca_system_score_codex":0.0020438556,"about_ca_system_score_gemma":0.0014576238,"threshold_uncertainty_score":0.04085231},"labels":[],"label_agreement":null},{"id":"W2586386567","doi":"","title":"Location and Allocation of Switching Equipment (Splitters/AWGs) in a WDM PON Network","year":2011,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Passive optical network; Splitter; Computer science; Wavelength-division multiplexing; Computer network; Digital subscriber line; Access network; Broadband; Orthogonal frequency-division multiple access; Fiber to the x; Telecommunications; Optics","score_opus":0.01404942592445199,"score_gpt":0.20126947650789817,"score_spread":0.18722005058344618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586386567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32890323,0.00020450544,0.6674135,0.00018655766,0.000021896905,0.000107850276,0.00018537209,0.0003497678,0.0026272957],"genre_scores_gemma":[0.8301106,0.00015531313,0.16765454,0.00003146375,0.000009182112,0.00006164917,0.000121213765,0.000025344285,0.0018305769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982125,0.000060992472,0.0000049457053,0.000039612325,0.000036707563,0.00003657931],"domain_scores_gemma":[0.9998155,0.00008429725,0.000045673627,0.000014777488,0.000025371695,0.000014370543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035190376,0.0005093218,0.0004042284,0.0004498938,0.00033171696,0.0005668379,0.00053051184,0.00048072133,0.00079128717],"category_scores_gemma":[0.00067234255,0.00037084558,0.00021529956,0.0005998811,0.0003578052,0.00048234695,0.00039345966,0.00025421215,0.00013122261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004922855,0.000029573277,0.00088383217,0.000019225503,0.0000064171268,0.000036471625,0.000020209887,0.97848916,0.0035711157,0.0019611453,0.00026708352,0.01466666],"study_design_scores_gemma":[0.000004520639,0.000018728168,0.00028348717,0.0000016241244,0.000003979612,0.000015052968,0.000012934313,0.9974255,0.0015148274,0.0005689164,0.00014710515,0.0000032886182],"about_ca_topic_score_codex":0.009081273,"about_ca_topic_score_gemma":0.012296731,"teacher_disagreement_score":0.009081273,"about_ca_system_score_codex":0.0010298422,"about_ca_system_score_gemma":0.0008428716,"threshold_uncertainty_score":0.01805681},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Betweenness centrality; Centrality; Network theory; Transmission (telecommunications); Mathematics; Computer science; Theoretical computer science; Combinatorics; Telecommunications","score_opus":0.046103757014474916,"score_gpt":0.22119234785641548,"score_spread":0.17508859084194056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586633569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20817922,0.0038932506,0.76357704,0.0008491141,0.00030649695,0.00015727177,0.0013269079,0.00038347652,0.021327216],"genre_scores_gemma":[0.9021474,0.0019611944,0.090754315,0.000116977106,0.00033792134,0.00024205973,0.0009807392,0.00011737505,0.003342097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910516,0.00021381523,0.000051546966,0.00020125198,0.00034101884,0.000087246255],"domain_scores_gemma":[0.9961612,0.0021093637,0.00069780526,0.00027857543,0.0005909987,0.00016203884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158926,0.0004968577,0.0007309271,0.0045686,0.0005894967,0.0016809938,0.0008276946,0.0006661437,0.0017794458],"category_scores_gemma":[0.007198278,0.00019560046,0.00037319638,0.004073181,0.0013731963,0.0031396674,0.0007439559,0.0011461534,0.00030460776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018917027,0.000078297366,0.004148155,0.0002691167,0.0000853842,0.00023765358,0.00033675827,0.07062365,0.009431582,0.7813984,0.0046365066,0.12856536],"study_design_scores_gemma":[0.000034635254,0.0001736933,0.0056310506,0.000101254904,0.00007354721,0.00086908217,0.00030709652,0.3084843,0.004572658,0.6675306,0.012096953,0.00012507223],"about_ca_topic_score_codex":0.00057671673,"about_ca_topic_score_gemma":0.00056294166,"teacher_disagreement_score":0.0045686,"about_ca_system_score_codex":0.0009933193,"about_ca_system_score_gemma":0.0004195093,"threshold_uncertainty_score":0.0072070956},"labels":[],"label_agreement":null},{"id":"W2593941571","doi":"","title":"A New Column Generation Algorithm for Logical Analysis of Data","year":2009,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Classifier (UML); Algorithm; Computer science; Piecewise linear function; Margin (machine learning); Set (abstract data type); Mathematics; Data mining; Artificial intelligence; Machine learning","score_opus":0.03436270686708329,"score_gpt":0.2784537656612443,"score_spread":0.24409105879416101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593941571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008144684,0.00005923104,0.99806815,0.000047088997,0.000021542863,0.00003847634,0.000054929325,0.00066183874,0.00023419473],"genre_scores_gemma":[0.018991869,0.00008871236,0.9791139,0.000121240395,0.00005900474,0.00016874446,0.0003861734,0.00015373387,0.00091656373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889946,0.00025081306,0.00007615171,0.0002395113,0.0004541001,0.00007991064],"domain_scores_gemma":[0.99826616,0.000824239,0.0001427662,0.0002171455,0.00048383995,0.000065792345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183901,0.0009563417,0.0008370796,0.0016025604,0.00053168903,0.0016778967,0.0013337294,0.00074879715,0.0059172558],"category_scores_gemma":[0.0041947104,0.00046111352,0.00085531734,0.0013276575,0.00067775435,0.0013543661,0.001254365,0.0017319879,0.0028946234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020076979,0.00010563543,0.0010550087,0.00020376193,0.000078936166,0.00013373974,0.000095549214,0.09798258,0.02145791,0.023981186,0.013548374,0.8411565],"study_design_scores_gemma":[0.000037888498,0.000060898372,0.00019915203,0.000014124438,0.000019491406,0.00013190729,0.000015880334,0.97169554,0.007285433,0.012801077,0.007713764,0.000024790745],"about_ca_topic_score_codex":0.002152484,"about_ca_topic_score_gemma":0.0025419875,"teacher_disagreement_score":0.0059172558,"about_ca_system_score_codex":0.0007348155,"about_ca_system_score_gemma":0.0013924171,"threshold_uncertainty_score":0.01979518},"labels":[],"label_agreement":null},{"id":"W2594286179","doi":"","title":"Loops and Multiple Edges in Modularity Maximization of Networks","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Maximization; Null model; Mathematics; Null (SQL); Modularity (biology); Random graph; Combinatorics; Clique; Discrete mathematics; Computer science; Mathematical optimization; Graph; Data mining","score_opus":0.005553992580215262,"score_gpt":0.2040848397628506,"score_spread":0.19853084718263533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594286179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15395072,0.0003331887,0.84169436,0.00047771295,0.000016012104,0.00003683098,0.000052091007,0.00016846032,0.0032706303],"genre_scores_gemma":[0.9127799,0.00028808918,0.08519045,0.000081365375,0.00004215584,0.00011763434,0.00007718019,0.000078777535,0.0013444282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978775,0.0013422695,0.000044928805,0.00028464015,0.00029159116,0.00015910927],"domain_scores_gemma":[0.9850188,0.011567548,0.0011392244,0.0011036268,0.0007227546,0.00044810947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041985163,0.00062427536,0.000734441,0.001535725,0.00082549895,0.0011436358,0.0016236115,0.0012594423,0.0012883241],"category_scores_gemma":[0.027448127,0.000605543,0.00069540006,0.0009294501,0.0034147596,0.00438661,0.0019059179,0.0011973936,0.00027039638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016316817,0.000079693615,0.0024846373,0.00010290033,0.000049448503,0.00014417084,0.0003584129,0.38780648,0.0028701539,0.58909184,0.0008815413,0.015967544],"study_design_scores_gemma":[0.000013488054,0.00002080954,0.00030234997,0.000007616413,0.0000067936,0.00003798667,0.000026107035,0.6227008,0.0006047772,0.3759738,0.0002939984,0.0000114890945],"about_ca_topic_score_codex":0.0013101397,"about_ca_topic_score_gemma":0.0010151602,"teacher_disagreement_score":0.0041985163,"about_ca_system_score_codex":0.0012493167,"about_ca_system_score_gemma":0.0005808798,"threshold_uncertainty_score":0.02220416},"labels":[],"label_agreement":null},{"id":"W2595087815","doi":"","title":"Two Sample Tests for the Nonparametric Behrens-Fisher Problem with Clustered Data","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Nonparametric statistics; Mathematics; Statistics; Type I and type II errors; Statistical hypothesis testing; Test statistic; Statistic; Null hypothesis; Robustness (evolution); Mann–Whitney U test; Econometrics","score_opus":0.1551449561418909,"score_gpt":0.4193848797666594,"score_spread":0.2642399236247685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595087815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016319001,0.00035259695,0.98154056,0.00022775447,0.00009290148,0.00014800153,0.00010650365,0.000105199615,0.0011074474],"genre_scores_gemma":[0.31284836,0.00041366942,0.68215483,0.0003783066,0.00031630142,0.0014098904,0.00047140414,0.00011111762,0.001896146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9802941,0.01288781,0.0006710558,0.0023107617,0.0032692316,0.0005670115],"domain_scores_gemma":[0.90111697,0.0843299,0.004937619,0.0050454205,0.0037004407,0.0008695551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023691026,0.0011791066,0.002348358,0.0034709496,0.0011230326,0.0019541124,0.0034840335,0.002885531,0.0049115075],"category_scores_gemma":[0.12855834,0.00047287584,0.0016990078,0.0026441177,0.004207143,0.0044418173,0.002993731,0.0029627923,0.0006911333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006935082,0.0002305085,0.00866401,0.00060802966,0.0007238097,0.00060894736,0.00079161016,0.06853882,0.0024222024,0.6531309,0.0027472917,0.2608403],"study_design_scores_gemma":[0.00017737054,0.00085847767,0.0062617855,0.00018887788,0.00012954141,0.00056972896,0.00037460896,0.34735113,0.0033202632,0.63427234,0.006317971,0.00017796987],"about_ca_topic_score_codex":0.00088570867,"about_ca_topic_score_gemma":0.0006182253,"teacher_disagreement_score":0.023691026,"about_ca_system_score_codex":0.0011120272,"about_ca_system_score_gemma":0.0021233007,"threshold_uncertainty_score":0.12529165},"labels":[],"label_agreement":null},{"id":"W2595282281","doi":"","title":"Some Applications of the Generalized Vehicle Routing Problem","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Vertex (graph theory); Routing (electronic design automation); Computer science; Mathematical optimization; Set (abstract data type); Extension (predicate logic); Variety (cybernetics); Mathematics; Theoretical computer science; Graph; Computer network; Artificial intelligence","score_opus":0.011344872875552733,"score_gpt":0.21834270917941423,"score_spread":0.20699783630386148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595282281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022268152,0.020495288,0.75131595,0.009611484,0.0010468712,0.00014037042,0.0004871287,0.00032243703,0.19431233],"genre_scores_gemma":[0.4887671,0.039731815,0.38766214,0.002577361,0.0031474577,0.00044786063,0.0012061577,0.00031796502,0.076142125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990803,0.00037444287,0.00004630071,0.00015147448,0.00026202886,0.00008539825],"domain_scores_gemma":[0.9993012,0.0003927856,0.00006194921,0.00008047701,0.00011754134,0.00004601159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011040311,0.0010624724,0.0006699315,0.00095920294,0.0010401589,0.001470798,0.0011401029,0.0018017053,0.0075745806],"category_scores_gemma":[0.0029954566,0.00038773697,0.0014561609,0.002324781,0.0013646706,0.0018359098,0.0017425168,0.0022549392,0.001156137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021701393,0.000036799876,0.00024538505,0.00015182361,0.000026573056,0.0002488249,0.00017312182,0.092484154,0.00039461273,0.85063314,0.012972552,0.042611245],"study_design_scores_gemma":[0.00001970551,0.000027068812,0.00023236679,0.000052066604,0.000010830587,0.00023920643,0.00008468307,0.10146134,0.00017208964,0.8149005,0.08278252,0.000017626448],"about_ca_topic_score_codex":0.0052081896,"about_ca_topic_score_gemma":0.0038601956,"teacher_disagreement_score":0.0075745806,"about_ca_system_score_codex":0.0013395369,"about_ca_system_score_gemma":0.0008839512,"threshold_uncertainty_score":0.025339544},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.02090497517781242,"score_gpt":0.2545152877863284,"score_spread":0.233610312608516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595320992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18505247,0.01274956,0.68878025,0.0036484052,0.0005738403,0.00015939909,0.0012655859,0.00026015297,0.107510366],"genre_scores_gemma":[0.8368234,0.0049815574,0.14672801,0.0006993877,0.0008233495,0.0002454082,0.00045817698,0.000063036925,0.00917762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827075,0.000524561,0.00014322167,0.00038615896,0.0004830137,0.00019217502],"domain_scores_gemma":[0.99486226,0.003516375,0.0003822125,0.00034151014,0.00055998255,0.00033762655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594421,0.0007845347,0.0010339913,0.0039309296,0.0016984344,0.002044342,0.0014445886,0.0013856072,0.004377949],"category_scores_gemma":[0.008955788,0.00047391123,0.0008813638,0.0029713984,0.0031576124,0.006550724,0.0022434976,0.0032490413,0.0005848344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584916,0.000012271465,0.00033568323,0.00007537255,0.00001207292,0.0001074941,0.00029118004,0.0033618766,0.0007858027,0.98565894,0.0012394025,0.008084104],"study_design_scores_gemma":[0.000012478497,0.00004629167,0.0009436582,0.00006441523,0.000023868508,0.00034942105,0.00020460949,0.018127048,0.0007394249,0.9716788,0.007780026,0.00002986473],"about_ca_topic_score_codex":0.0010872625,"about_ca_topic_score_gemma":0.0013165133,"teacher_disagreement_score":0.004377949,"about_ca_system_score_codex":0.0016351218,"about_ca_system_score_gemma":0.00043749518,"threshold_uncertainty_score":0.014645755},"labels":[],"label_agreement":null},{"id":"W2595353928","doi":"","title":"Stability of International Environmental Agreements: An Illustration with Asymmetrical Countries","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Merge (version control); Welfare; Stock (firearms); Economics; Econometrics; Computer science; Geography","score_opus":0.056650422184293774,"score_gpt":0.2076269242000642,"score_spread":0.15097650201577043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595353928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5112443,0.0007040735,0.3529789,0.003606421,0.000081274775,0.00015889824,0.00029725686,0.00022459141,0.13070427],"genre_scores_gemma":[0.9875365,0.00014414368,0.010542148,0.000084677275,0.000012970184,0.0000447597,0.000041826566,0.000017861987,0.0015751112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760085,0.0013066008,0.00011734089,0.0002994882,0.0004366034,0.0002391746],"domain_scores_gemma":[0.99547297,0.002110113,0.0010396516,0.00057136227,0.0004622622,0.00034370745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004015708,0.00033441404,0.0006200354,0.0015929041,0.0015436303,0.0027132444,0.0012833752,0.002013466,0.0059419842],"category_scores_gemma":[0.014013974,0.00027158254,0.0010212157,0.0015599345,0.0030595062,0.0045424104,0.0033311094,0.002015015,0.00046452624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006452694,0.00003449984,0.0025895543,0.00001828455,0.000019752633,0.00021029767,0.0003898629,0.14165255,0.00037409013,0.848262,0.00048681322,0.0058977087],"study_design_scores_gemma":[0.00006141795,0.000042692376,0.001204878,0.000037278736,0.000015464278,0.00011683636,0.00044350905,0.3844411,0.00036979516,0.6088366,0.004405726,0.00002467624],"about_ca_topic_score_codex":0.004290422,"about_ca_topic_score_gemma":0.0019444126,"teacher_disagreement_score":0.0059419842,"about_ca_system_score_codex":0.002484034,"about_ca_system_score_gemma":0.0010496315,"threshold_uncertainty_score":0.021237373},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0062882823700675244,"score_gpt":0.18857809644757312,"score_spread":0.1822898140775056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595487535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03597835,0.0006261913,0.96083343,0.00007215042,0.00007167815,0.000024952975,0.000027475458,0.00012348407,0.0022422303],"genre_scores_gemma":[0.9496601,0.00086368003,0.043605242,0.000052074105,0.00005649163,0.00010237198,0.000104615334,0.000033475862,0.005521991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997248,0.000052782012,0.000018871136,0.00006833777,0.00010672697,0.000028477207],"domain_scores_gemma":[0.9996202,0.0001419644,0.000080572754,0.00003289858,0.00011372141,0.00001071793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039724188,0.0008093686,0.00037562384,0.00032212434,0.00026257482,0.00058954133,0.000483713,0.0004604595,0.0012566647],"category_scores_gemma":[0.0012197805,0.0001965543,0.00034739813,0.00038303828,0.0004104606,0.0008361907,0.00046069283,0.00043786,0.00016774549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025710027,0.000054264343,0.0004649306,0.00043721218,0.000115570336,0.00032946264,0.00023818262,0.67370594,0.11569714,0.13130559,0.00091963465,0.07647486],"study_design_scores_gemma":[0.000022487047,0.00011460823,0.0002379183,0.00001177996,0.000022166834,0.000043589494,0.000016911921,0.9701635,0.0087749995,0.018117283,0.0024607736,0.000013849298],"about_ca_topic_score_codex":0.0016288125,"about_ca_topic_score_gemma":0.0016518807,"teacher_disagreement_score":0.0016288125,"about_ca_system_score_codex":0.00045494258,"about_ca_system_score_gemma":0.0003550322,"threshold_uncertainty_score":0.004203975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Vertex (graph theory); Simple graph; Connectivity; Chromatic scale; Bound graph; Degree (music); Discrete mathematics; Graph power; Physics; Line graph","score_opus":0.007890478338472364,"score_gpt":0.19889675716680183,"score_spread":0.19100627882832946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596078115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654784,0.0032623578,0.1874397,0.0029836092,0.00012510594,0.000103737046,0.0006878065,0.00040065867,0.039518617],"genre_scores_gemma":[0.93275803,0.0004661762,0.05992303,0.00023218588,0.00009297799,0.000063307896,0.00047799372,0.00008471759,0.005901646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956304,0.00017892408,0.000013464005,0.00011518598,0.00005329207,0.00007608843],"domain_scores_gemma":[0.9975809,0.0016784753,0.00024050075,0.00019822523,0.000119416065,0.00018252606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000945324,0.00027989698,0.0007782506,0.0016575026,0.0012903529,0.0013004073,0.0009813177,0.0008279171,0.003960321],"category_scores_gemma":[0.005255891,0.00037197556,0.00039330233,0.0011500272,0.0013480758,0.0019176559,0.0010860147,0.00076832215,0.00029000957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011452658,0.00021056435,0.015307639,0.00033305841,0.00014646725,0.0002340531,0.000585274,0.1805121,0.0047788494,0.6638618,0.01701237,0.11587255],"study_design_scores_gemma":[0.00018265814,0.0001431723,0.003107075,0.00006900632,0.000061034905,0.00023959066,0.0002852382,0.47744367,0.0023961936,0.50881207,0.00722167,0.000038590497],"about_ca_topic_score_codex":0.002166462,"about_ca_topic_score_gemma":0.0045253397,"teacher_disagreement_score":0.003960321,"about_ca_system_score_codex":0.0015781095,"about_ca_system_score_gemma":0.00055009284,"threshold_uncertainty_score":0.013248563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Newsvendor model; Linear programming; Robust optimization; Mathematics; Piecewise linear function; Computation; Column generation; Set (abstract data type); Optimization problem; Computer science; Algorithm","score_opus":0.06477491058583826,"score_gpt":0.28609883806500125,"score_spread":0.221323927479163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597535316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011100432,0.00087617576,0.98544323,0.00023599589,0.000025232406,0.000020505115,0.0000410735,0.00014782563,0.0021095537],"genre_scores_gemma":[0.6867703,0.0022704846,0.305461,0.00013481952,0.00010773215,0.00017168035,0.00015529401,0.0002552766,0.0046734056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874413,0.000644418,0.00006171742,0.00018366962,0.00027185748,0.00009423168],"domain_scores_gemma":[0.9970329,0.0022437847,0.00030089525,0.00015635345,0.00018079826,0.00008525056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032381709,0.0016118791,0.0016521346,0.0007649857,0.00037959384,0.0013823707,0.00095400703,0.0012342881,0.0019834228],"category_scores_gemma":[0.006473526,0.0008102603,0.0013264499,0.001235489,0.0015293479,0.0017618898,0.0016073472,0.0023413796,0.00022030262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019504683,0.000010434669,0.00009550235,0.00004726983,0.000018413977,0.000022806484,0.000023698463,0.97400755,0.0005361768,0.019252514,0.00018276332,0.0057832953],"study_design_scores_gemma":[0.0000028415766,0.00001589956,0.000026258027,0.000006699505,0.0000041718313,0.000008083357,0.0000066125867,0.9911843,0.00024823964,0.008198606,0.00029406097,0.0000041860144],"about_ca_topic_score_codex":0.003082401,"about_ca_topic_score_gemma":0.0013250276,"teacher_disagreement_score":0.0032381709,"about_ca_system_score_codex":0.0015264773,"about_ca_system_score_gemma":0.00081008126,"threshold_uncertainty_score":0.017125309},"labels":[],"label_agreement":null},{"id":"W2597956993","doi":"","title":"A Continuous Analysis Framework for the Solution of Location-Allocation Problems with Dense Demand","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University","funders":"","keywords":"Location-allocation; Heuristic; Mathematical optimization; Computer science; Facility location problem; Euclidean geometry; Function (biology); Operations research; Mathematics","score_opus":0.01826066043496189,"score_gpt":0.21020515929094205,"score_spread":0.19194449885598017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597956993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000290154,0.0001343011,0.9981793,0.00010883578,0.00002123368,0.000014929918,0.00001410996,0.00002857203,0.0012085036],"genre_scores_gemma":[0.16453622,0.0020115543,0.82725614,0.00026019235,0.00034240706,0.00066262955,0.00021295481,0.00014907017,0.0045688944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.0006486207,0.00006632425,0.00022447758,0.000479049,0.0001417543],"domain_scores_gemma":[0.9975001,0.001788714,0.00018958237,0.00012162419,0.00031296222,0.00008703801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032587317,0.0018169864,0.0017064689,0.0015995214,0.00091002183,0.002689272,0.0025512304,0.0020153834,0.0062112003],"category_scores_gemma":[0.00678096,0.0010026667,0.0022762138,0.002212083,0.0025645506,0.0021424459,0.0020543651,0.004041696,0.0009091508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015924561,0.000050255705,0.00016749505,0.0002059963,0.00004118771,0.00007147328,0.000090574824,0.7177671,0.00065987004,0.26020628,0.0019685994,0.01875519],"study_design_scores_gemma":[0.00001415716,0.000030962507,0.000045054523,0.00002857028,0.00001069907,0.000024675555,0.000020652915,0.93443877,0.00015427901,0.06160679,0.0036154406,0.000009986431],"about_ca_topic_score_codex":0.006232939,"about_ca_topic_score_gemma":0.0044535412,"teacher_disagreement_score":0.006232939,"about_ca_system_score_codex":0.0021375197,"about_ca_system_score_gemma":0.0036409511,"threshold_uncertainty_score":0.020778477},"labels":[],"label_agreement":null},{"id":"W2598679417","doi":"","title":"On Reference Model Tracking for Markov Jump Systems","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Control theory (sociology); Tracking (education); State (computer science); Controller (irrigation); Jump; State vector; Computer science; Markov chain; Mathematics; Mathematical optimization; Control (management); Algorithm; Artificial intelligence","score_opus":0.018373147940905936,"score_gpt":0.22295891351614278,"score_spread":0.20458576557523683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598679417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050733574,0.0028617247,0.9843158,0.000302348,0.00013451317,0.00002784655,0.000028395367,0.00010416115,0.00715191],"genre_scores_gemma":[0.80394983,0.013635599,0.15913439,0.0005572843,0.00094768585,0.00041356182,0.00040111778,0.00016111051,0.020799477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992112,0.00026104721,0.00003518563,0.00016095696,0.00026563217,0.00006604923],"domain_scores_gemma":[0.9988506,0.0007372243,0.00010883775,0.00007529393,0.00020139902,0.000026660595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001389937,0.0009746348,0.0010377873,0.00066140364,0.0005244623,0.0013637383,0.0009846903,0.0017093234,0.0031717857],"category_scores_gemma":[0.0036211896,0.00032221831,0.0009356983,0.0012218364,0.0013395376,0.0017877801,0.0012360169,0.0019091907,0.000582418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010763625,0.00004655827,0.00032283147,0.00041125424,0.00006315467,0.00029748003,0.00031559603,0.5943219,0.005292903,0.33376107,0.0019166563,0.06314293],"study_design_scores_gemma":[0.00001736011,0.00010674237,0.00014118468,0.000056460656,0.000016533331,0.000062515974,0.000026540723,0.90357524,0.001076608,0.08979744,0.0050973445,0.000026090129],"about_ca_topic_score_codex":0.0048618037,"about_ca_topic_score_gemma":0.0024535696,"teacher_disagreement_score":0.0048618037,"about_ca_system_score_codex":0.0010315797,"about_ca_system_score_gemma":0.00075070915,"threshold_uncertainty_score":0.01061064},"labels":[],"label_agreement":null},{"id":"W2599299976","doi":"","title":"Variable Neighborhood Search for Extremal Graphs. 22. Extending Bounds for Independence to Upper Irredundance","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set; Independence (probability theory)","score_opus":0.01918832843579429,"score_gpt":0.2993492857366926,"score_spread":0.28016095730089835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599299976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27518708,0.0036906616,0.66420895,0.0032846965,0.00018554424,0.00024527646,0.0016160344,0.0011048636,0.05047686],"genre_scores_gemma":[0.85575426,0.00075737963,0.1349896,0.00042445541,0.0002006156,0.00020202193,0.0015580896,0.00025301726,0.005860443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.00061937084,0.000068813664,0.00036247954,0.00029568103,0.00023912372],"domain_scores_gemma":[0.99015725,0.0072907396,0.00062590686,0.0011420716,0.00038452778,0.0003994786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021163528,0.0004924782,0.0010815797,0.0019694,0.0015191792,0.0018893419,0.0020089333,0.0008982598,0.005356115],"category_scores_gemma":[0.013346939,0.00067235215,0.0008014304,0.0020249304,0.0018160605,0.0045314077,0.0023478945,0.0021690733,0.00058748253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010475313,0.00027382717,0.014782706,0.0006162095,0.00019516548,0.0002870672,0.00079065695,0.18704568,0.005792898,0.6148317,0.016794933,0.15754162],"study_design_scores_gemma":[0.000070012706,0.00010395057,0.0025001874,0.000058438254,0.00007754357,0.00015867903,0.00011878856,0.43256095,0.0029757186,0.5548337,0.0065119355,0.000030024055],"about_ca_topic_score_codex":0.0025422222,"about_ca_topic_score_gemma":0.0043309284,"teacher_disagreement_score":0.005356115,"about_ca_system_score_codex":0.0018660598,"about_ca_system_score_gemma":0.00075245026,"threshold_uncertainty_score":0.017917931},"labels":[],"label_agreement":null},{"id":"W2599337092","doi":"","title":"Buying Cooperation in an Asymmetric Environmental Differential Game","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Differential game; Stochastic game; Damages; Nash equilibrium; Differential (mechanical device); Non-cooperative game; Bargaining problem; Mathematical economics; Economics; Dividend; Microeconomics; Game theory; Mathematics; Mathematical optimization; Engineering; Finance","score_opus":0.033766873751957,"score_gpt":0.2151499575270949,"score_spread":0.1813830837751379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599337092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5920332,0.00016743783,0.33875468,0.0022740478,0.00005916549,0.00020375005,0.00018026921,0.00008164627,0.06624573],"genre_scores_gemma":[0.9868053,0.00006871543,0.0072689415,0.00009978651,0.000020608673,0.000075183874,0.000030838015,0.000008153201,0.0056224135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712116,0.0015594622,0.00009499635,0.00032289655,0.0004098177,0.000491655],"domain_scores_gemma":[0.99578995,0.0026394385,0.0005568229,0.0002573745,0.00031806732,0.00043840206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029663707,0.0007920812,0.0010434551,0.00066859816,0.0008891633,0.001862477,0.0014030595,0.0021975583,0.0060845083],"category_scores_gemma":[0.0060787783,0.00048157142,0.0006734655,0.00045598915,0.002657751,0.002302831,0.0018786589,0.0016187417,0.0004944338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041563096,0.00020892562,0.001631164,0.00012823113,0.000075731725,0.0015965495,0.0008199645,0.15793404,0.006435957,0.8212932,0.0012780072,0.0081826085],"study_design_scores_gemma":[0.00021360969,0.00013769035,0.00059951015,0.000028990042,0.000037996484,0.0002913107,0.00047525988,0.5281029,0.0009795899,0.46666777,0.002426831,0.000038639624],"about_ca_topic_score_codex":0.002164292,"about_ca_topic_score_gemma":0.0013293156,"teacher_disagreement_score":0.0060845083,"about_ca_system_score_codex":0.0022830453,"about_ca_system_score_gemma":0.0008760377,"threshold_uncertainty_score":0.020354688},"labels":[],"label_agreement":null},{"id":"W2600058557","doi":"","title":"On Robust Forecasting in Dynamic Vector Time Series Models","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Statistics Canada","funders":"","keywords":"Estimator; Outlier; Autoregressive model; Mathematics; Robust statistics; Asymptotic distribution; Statistics; Series (stratigraphy); M-estimator; Econometrics","score_opus":0.07044197632275527,"score_gpt":0.3323263796329178,"score_spread":0.2618844033101625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600058557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012923435,0.0032725006,0.97950214,0.00070507295,0.00015205672,0.000022658794,0.0001690453,0.00019398044,0.0030591125],"genre_scores_gemma":[0.83880454,0.008479833,0.14455079,0.0004280928,0.0009330756,0.00019336624,0.0010303896,0.00037137952,0.005208593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963356,0.0020390213,0.00017162642,0.000530446,0.0007424532,0.00018083713],"domain_scores_gemma":[0.97390205,0.021057371,0.002107947,0.0011416681,0.0016091241,0.00018177295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008215065,0.0011287723,0.002198012,0.0018655059,0.00039200103,0.0020537465,0.001741831,0.0017173176,0.002478749],"category_scores_gemma":[0.041746594,0.0005277223,0.0012199414,0.0025146275,0.0015829734,0.0023655116,0.0017600172,0.0023070977,0.00040236113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049800758,0.000016290442,0.0004987336,0.00013600658,0.000092520495,0.00008888271,0.00005617665,0.8397979,0.00035973324,0.13517818,0.0012755651,0.022450225],"study_design_scores_gemma":[0.000004059697,0.000011319389,0.00011232999,0.000017937591,0.000010360543,0.000009512456,0.0000048561296,0.9547363,0.00011163699,0.04440992,0.0005633402,0.000008493239],"about_ca_topic_score_codex":0.0078648655,"about_ca_topic_score_gemma":0.0025030382,"teacher_disagreement_score":0.008215065,"about_ca_system_score_codex":0.0012885561,"about_ca_system_score_gemma":0.0010463743,"threshold_uncertainty_score":0.043445945},"labels":[],"label_agreement":null},{"id":"W2600127727","doi":"","title":"What Are They Trying to Accomplish on my Website, Now? Dynamic Identification of Anonymous Consumers' Visit Goals","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Clickstream; Purchasing; Identification (biology); Personalization; Database transaction; Product (mathematics); Transaction data; Computer science; Internet privacy; World Wide Web; Advertising; E-commerce; Business; Marketing; The Internet; Database; Web navigation","score_opus":0.015436618792244318,"score_gpt":0.23517320286178156,"score_spread":0.21973658406953725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600127727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737012,0.00015717442,0.012191378,0.0008778273,0.000016532775,0.00004500225,0.00039785102,0.000096610325,0.012516521],"genre_scores_gemma":[0.99574006,0.00007518454,0.0022838656,0.00003839944,0.0000066395223,0.000013741583,0.00010199045,0.000009176943,0.0017308473],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99957854,0.00015432213,0.000018122037,0.00006834967,0.00009627181,0.00008435447],"domain_scores_gemma":[0.99764,0.001013089,0.0005290833,0.0001306401,0.0003399101,0.00034730794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010391442,0.00023182783,0.000297339,0.0010791466,0.0005107596,0.0022019686,0.00037585504,0.00076173403,0.002293085],"category_scores_gemma":[0.0051265466,0.00022921781,0.0003457557,0.0007697036,0.00057194603,0.0018502929,0.00053376966,0.0005736421,0.0005093686],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057790073,0.0004069395,0.84733087,0.00008049756,0.00013862172,0.0006504729,0.0063003832,0.013793329,0.0012379033,0.028772958,0.004818672,0.09589139],"study_design_scores_gemma":[0.000044780474,0.00053584453,0.5855166,0.000102570906,0.00021793302,0.0013623516,0.012839234,0.32768878,0.0012688643,0.05396012,0.01628225,0.00018072141],"about_ca_topic_score_codex":0.009396899,"about_ca_topic_score_gemma":0.013192483,"teacher_disagreement_score":0.009396899,"about_ca_system_score_codex":0.0005333018,"about_ca_system_score_gemma":0.00041143,"threshold_uncertainty_score":0.018684447},"labels":[],"label_agreement":null},{"id":"W2601022401","doi":"","title":"On Consistent Testing for Serial Correlation in Seasonal Time Series Models","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Test statistic; Autocorrelation; Estimator; Mathematics; Econometrics; Statistics; Weighting; Series (stratigraphy); Smoothing; Statistic; Statistical hypothesis testing; Context (archaeology); Kernel (algebra); Kernel density estimation; Geography","score_opus":0.027441035446284512,"score_gpt":0.19849047073136447,"score_spread":0.17104943528507996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601022401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025221994,0.0018018124,0.96659,0.0019458998,0.0002918893,0.00016192118,0.00025559144,0.00020982235,0.0035211442],"genre_scores_gemma":[0.54711396,0.0030249357,0.44050285,0.0023433545,0.0015879326,0.0011833018,0.0012472933,0.00032487296,0.0026714967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9250787,0.061990634,0.0022261378,0.00424657,0.00540401,0.0010538439],"domain_scores_gemma":[0.40948445,0.5667748,0.006505067,0.0077093705,0.008631525,0.0008947547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.08291326,0.0015715754,0.003660688,0.0055451426,0.0011639678,0.0021850003,0.0036219538,0.003361174,0.0035445676],"category_scores_gemma":[0.33830193,0.00094934955,0.0029067474,0.0072773555,0.007525157,0.0045369733,0.002983748,0.0043940027,0.00053799764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006546227,0.00034629006,0.028538886,0.0006978464,0.0021149323,0.0015662706,0.0010759421,0.12142678,0.0019087861,0.67808276,0.008861582,0.15472536],"study_design_scores_gemma":[0.00024406024,0.0005716906,0.0052260743,0.00025352353,0.00026780716,0.0003403296,0.00020537453,0.28322706,0.0011889096,0.7045224,0.0038423887,0.000110342895],"about_ca_topic_score_codex":0.0031968488,"about_ca_topic_score_gemma":0.0017215254,"teacher_disagreement_score":0.08291326,"about_ca_system_score_codex":0.0014850519,"about_ca_system_score_gemma":0.0031258424,"threshold_uncertainty_score":0.43849248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.013328185719392762,"score_gpt":0.2576371197784077,"score_spread":0.24430893405901494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601917914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78107184,0.0016626527,0.1875122,0.0014624628,0.000080881284,0.000028572878,0.00021302493,0.00029376618,0.027674528],"genre_scores_gemma":[0.9891454,0.00044180712,0.007265817,0.000081153776,0.00009231716,0.000024780731,0.00007520414,0.00005824331,0.0028152498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954456,0.000113118345,0.000013269515,0.00012978262,0.000120992634,0.000078309065],"domain_scores_gemma":[0.9952419,0.0031337808,0.00058971887,0.0002958756,0.00037659844,0.0003620878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006024623,0.0005317605,0.00046945506,0.002508338,0.00092570233,0.001591104,0.001191928,0.00079972117,0.003888235],"category_scores_gemma":[0.0067899,0.00034650075,0.00026431092,0.0014263578,0.0030344604,0.0022478718,0.0011727437,0.0011439916,0.0003588765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014808969,0.00006109131,0.004508969,0.00015293897,0.000034657867,0.00018461268,0.0004422795,0.06131048,0.012195219,0.9065935,0.0018529715,0.012515188],"study_design_scores_gemma":[0.000018402938,0.000037791757,0.004252252,0.00003317584,0.000013490841,0.0002657921,0.00024299398,0.17373656,0.002877511,0.816735,0.0017424915,0.000044595567],"about_ca_topic_score_codex":0.0013317087,"about_ca_topic_score_gemma":0.0013221785,"teacher_disagreement_score":0.003888235,"about_ca_system_score_codex":0.0015281899,"about_ca_system_score_gemma":0.0003490201,"threshold_uncertainty_score":0.013007462},"labels":[],"label_agreement":null},{"id":"W2602070625","doi":"","title":"Delay-Dependent Robust Stabilizability of Singular Linear Systems with Delays","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Control theory (sociology); Mathematics; Impulse (physics); Bounded function; Robust control; Norm (philosophy); Linear system; Linear matrix inequality; State vector; Full state feedback; Computer science; Control system; Mathematical optimization; Control (management); Mathematical analysis; Engineering; Law","score_opus":0.012904234254723168,"score_gpt":0.17424897854534477,"score_spread":0.1613447442906216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602070625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12191235,0.0006606355,0.87173426,0.0001732371,0.000058959453,0.000028750137,0.00004481892,0.0006612217,0.0047258087],"genre_scores_gemma":[0.9875732,0.0003187724,0.010631099,0.000019376896,0.000037463567,0.000033219283,0.00004946705,0.000023876804,0.0013136314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.00004180768,0.00002212585,0.000077786935,0.00013623017,0.0000372222],"domain_scores_gemma":[0.9993698,0.00024715086,0.00019934443,0.000052523992,0.000111970636,0.000019210911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035775782,0.00061790604,0.00044892586,0.00039088493,0.00023355012,0.00070982357,0.00043401218,0.00036497173,0.0008240577],"category_scores_gemma":[0.0019498625,0.00020567434,0.0003212117,0.00027645877,0.0006306388,0.00055006554,0.0004954932,0.00049164874,0.00016468845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023950085,0.000030811803,0.00052225514,0.00025139,0.000084599924,0.0003703158,0.00025413753,0.7916868,0.1021761,0.05830454,0.00051919086,0.045560397],"study_design_scores_gemma":[0.000021192915,0.00015187862,0.00029485486,0.00001134151,0.000018922708,0.00006237522,0.000026569096,0.966609,0.013153141,0.018486688,0.0011495273,0.000014461411],"about_ca_topic_score_codex":0.0016654403,"about_ca_topic_score_gemma":0.0009074961,"teacher_disagreement_score":0.0016654403,"about_ca_system_score_codex":0.00041121923,"about_ca_system_score_gemma":0.00047942196,"threshold_uncertainty_score":0.0033114552},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Channel coordination; Channel (broadcasting); Marketing channel; Business; Microeconomics; Marketing; Industrial organization; Economics; Vertical integration; Computer science; Telecommunications; Supply chain","score_opus":0.007713042120090302,"score_gpt":0.17939772769238813,"score_spread":0.17168468557229782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602073264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27513093,0.0014876156,0.5696758,0.0043455395,0.00021622276,0.00024552966,0.00031443487,0.00021458777,0.14836942],"genre_scores_gemma":[0.9676082,0.00080972956,0.019086696,0.00020819169,0.0001283301,0.00010680089,0.00006893553,0.000068727895,0.011914251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750096,0.0010082066,0.00007498745,0.00043810954,0.00028940928,0.000688221],"domain_scores_gemma":[0.9905641,0.0061178883,0.0015900102,0.00054060866,0.00051173806,0.0006756026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028048973,0.00068222196,0.0016202349,0.000977275,0.0013097472,0.0036429483,0.0012652634,0.0018826715,0.012449377],"category_scores_gemma":[0.008843349,0.0007220787,0.001000493,0.0011991496,0.0035552531,0.0044405246,0.002143381,0.0013673004,0.0007900602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025332774,0.0000885819,0.000786208,0.000078528334,0.000051333907,0.00031842824,0.00020121492,0.20046242,0.0016434874,0.7861647,0.0024790964,0.0074726236],"study_design_scores_gemma":[0.00016124816,0.00011307721,0.0011058552,0.000029671495,0.00004969794,0.0001388868,0.00025350385,0.43304306,0.0005055927,0.5608009,0.0037490083,0.0000494486],"about_ca_topic_score_codex":0.0052827443,"about_ca_topic_score_gemma":0.0030806446,"teacher_disagreement_score":0.012449377,"about_ca_system_score_codex":0.0032659092,"about_ca_system_score_gemma":0.0020852596,"threshold_uncertainty_score":0.041647315},"labels":[],"label_agreement":null},{"id":"W2602074824","doi":"","title":"Complement to a Comparative Analysis of Heuristics for the p-Median Problem","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Heuristic; Complement (music); Artificial neural network; Series (stratigraphy); Mathematics; Evolutionary algorithm; Variable neighborhood search; Computer science; Mathematical optimization; Artificial intelligence; Algorithm; Metaheuristic","score_opus":0.030612689729685522,"score_gpt":0.29267806898487475,"score_spread":0.26206537925518925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602074824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16456126,0.005725692,0.7914696,0.00096443156,0.00028634045,0.00030177514,0.0004886224,0.0011936657,0.0350086],"genre_scores_gemma":[0.52088064,0.003593087,0.46778825,0.00036576926,0.00019928203,0.0002878295,0.0007793394,0.000494284,0.005611509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978235,0.0009790879,0.00010032181,0.000345261,0.0005551295,0.00019677231],"domain_scores_gemma":[0.98762417,0.009499826,0.0005585219,0.0012466825,0.0008664567,0.00020445338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037062897,0.0009831439,0.0012781017,0.0025736452,0.0010554333,0.0014194578,0.0015521648,0.0019210936,0.005883232],"category_scores_gemma":[0.016238734,0.0003949834,0.0012981725,0.0035497302,0.0008339154,0.0027475124,0.00095011323,0.0012363943,0.00063142396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008165078,0.0004758351,0.0027528733,0.0006199999,0.00024616165,0.00007625805,0.00012359113,0.708849,0.0013251833,0.04190935,0.0060656653,0.23673958],"study_design_scores_gemma":[0.00012629885,0.0006203334,0.0017467972,0.000093671784,0.00007661464,0.0002531339,0.00022872144,0.95816934,0.0032627732,0.030027691,0.0053599565,0.000034748486],"about_ca_topic_score_codex":0.003922203,"about_ca_topic_score_gemma":0.0057832394,"teacher_disagreement_score":0.005883232,"about_ca_system_score_codex":0.0019361638,"about_ca_system_score_gemma":0.0017749318,"threshold_uncertainty_score":0.019681394},"labels":[],"label_agreement":null},{"id":"W2602444306","doi":"","title":"Estimation and Model Adequacy Checking for Multivariate Seasonal Autoregressive Time Series Models with Periodically Varying Parameters","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Autocovariance; Autoregressive model; Mathematics; Autocorrelation; Estimator; Series (stratigraphy); Statistics; Multivariate statistics; Autoregressive integrated moving average; Time series; Asymptotic distribution; Applied mathematics; Bivariate analysis; Econometrics","score_opus":0.0809170528962094,"score_gpt":0.3145019767367994,"score_spread":0.23358492384059001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602444306","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13694447,0.00022795745,0.8610409,0.0002348014,0.000016783068,0.00006932024,0.00021828532,0.00028204208,0.00096547283],"genre_scores_gemma":[0.8838074,0.00031467245,0.11402562,0.000060270304,0.000054673474,0.00022370402,0.0008160472,0.000067831614,0.0006296946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994156,0.0038452786,0.00029593805,0.0006573723,0.00082305813,0.00022232861],"domain_scores_gemma":[0.94022316,0.05232308,0.002822733,0.0026186402,0.0018041859,0.00020818698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01433633,0.00079597946,0.0011966976,0.0017380111,0.0004576066,0.0011613645,0.0011629647,0.00088587194,0.0015165746],"category_scores_gemma":[0.07836164,0.00054410147,0.0014275095,0.0010834654,0.000987608,0.0018674239,0.0013653036,0.0015839157,0.00016888222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001994094,0.00014381671,0.031550776,0.00016577118,0.00032632746,0.00035136292,0.00033389934,0.84496653,0.0021949213,0.05096445,0.000680837,0.06812193],"study_design_scores_gemma":[0.000013046922,0.000068627945,0.003261334,0.000017767212,0.000024160989,0.00005653467,0.00004982344,0.97591454,0.0005589934,0.019695539,0.00032093067,0.000018656441],"about_ca_topic_score_codex":0.0068080346,"about_ca_topic_score_gemma":0.0046897572,"teacher_disagreement_score":0.01433633,"about_ca_system_score_codex":0.0006142049,"about_ca_system_score_gemma":0.002012399,"threshold_uncertainty_score":0.07581866},"labels":[],"label_agreement":null},{"id":"W2602837592","doi":"","title":"A Magnetic Procedure for the Stability Number","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Stability (learning theory); Magnet; Discrete mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.036486242238186715,"score_gpt":0.26930187030698366,"score_spread":0.23281562806879694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602837592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053426687,0.00046740638,0.88571244,0.0010177676,0.0005565623,0.0004143401,0.00043019146,0.0011395027,0.05683515],"genre_scores_gemma":[0.43885052,0.0003892878,0.5330584,0.0003620257,0.0002427764,0.0005782572,0.00043756654,0.00045711704,0.025623975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990043,0.00021601137,0.00006322525,0.00027374525,0.00034676434,0.000095944],"domain_scores_gemma":[0.99826956,0.0007821858,0.00013146905,0.0003020786,0.00045311704,0.00006145252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008049771,0.00063134753,0.00039260107,0.002217129,0.0019041671,0.0010860959,0.0009146429,0.0006659812,0.010663804],"category_scores_gemma":[0.0041930196,0.00028317352,0.0006530306,0.0010618212,0.0024061883,0.0017815517,0.0011359336,0.0014049801,0.0027630106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045374033,0.00013584549,0.0017346402,0.00031680893,0.0000388917,0.000242059,0.0005888287,0.0078533245,0.058400378,0.6663166,0.009223369,0.2546955],"study_design_scores_gemma":[0.00008826265,0.00038760863,0.0024709625,0.00010572061,0.00006837785,0.00079357903,0.0003312731,0.04995265,0.10306309,0.7635387,0.07905259,0.00014717955],"about_ca_topic_score_codex":0.000958075,"about_ca_topic_score_gemma":0.001131296,"teacher_disagreement_score":0.010663804,"about_ca_system_score_codex":0.00082997186,"about_ca_system_score_gemma":0.00117201,"threshold_uncertainty_score":0.035673976},"labels":[],"label_agreement":null},{"id":"W2602862967","doi":"","title":"Fifty Years of Vehicle Routing","year":2009,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Heuristics; Metaheuristic; Truck; Routing (electronic design automation); Computer science; Decomposition; Mathematical optimization; Operations research; Mathematics; Engineering; Computer network","score_opus":0.01020903419138404,"score_gpt":0.23720877505741528,"score_spread":0.22699974086603125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602862967","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007704024,0.31615996,0.13047242,0.05928887,0.02097152,0.00015612022,0.001126566,0.00052324677,0.46359733],"genre_scores_gemma":[0.21082616,0.42860854,0.073339336,0.019172437,0.0145500135,0.0003534176,0.0018143881,0.0005604309,0.2507753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982767,0.00049515517,0.0000921174,0.00037170463,0.0005881258,0.00017624181],"domain_scores_gemma":[0.99855644,0.0006098044,0.000087868255,0.00023590302,0.00038396337,0.00012603783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021153863,0.0008633401,0.000837092,0.0012023303,0.0016202551,0.0041972664,0.0014756578,0.002262216,0.019950254],"category_scores_gemma":[0.0058509866,0.00047912548,0.0006138933,0.002496679,0.003668964,0.005648549,0.0028795733,0.0031923873,0.0075835045],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060139024,0.00003717197,0.00043487852,0.0003232794,0.000023289396,0.0000906787,0.0003435838,0.0053831367,0.00022224922,0.7576823,0.05970466,0.17569456],"study_design_scores_gemma":[0.0000069944203,0.00002894438,0.0001837524,0.00040491566,0.0000062005433,0.0000970613,0.00014017326,0.0012122641,0.00011013379,0.14797547,0.8498162,0.000017868],"about_ca_topic_score_codex":0.0039853444,"about_ca_topic_score_gemma":0.0030035304,"teacher_disagreement_score":0.019950254,"about_ca_system_score_codex":0.0029879967,"about_ca_system_score_gemma":0.002227973,"threshold_uncertainty_score":0.066740215},"labels":[],"label_agreement":null},{"id":"W2603287415","doi":"","title":"Discrete-Time Survival Trees","year":2007,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Statistical Methods and Bayesian Inference","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Research Unit on Children's Psychosocial Maladjustment; University of British Columbia; HEC Montréal","funders":"","keywords":"Categorical variable; Statistics; Covariate; Interpretability; Mathematics; Survival analysis; Artificial intelligence; Computer science","score_opus":0.024504729530312845,"score_gpt":0.31628695031437537,"score_spread":0.2917822207840625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603287415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018786952,0.003618632,0.9627901,0.0010160664,0.00050219486,0.00020927451,0.005411672,0.0014838122,0.0061813304],"genre_scores_gemma":[0.46283817,0.006551096,0.4902855,0.0007062584,0.0007861751,0.00093894865,0.017322676,0.0006461838,0.019925069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978968,0.00092187565,0.00016156485,0.0004484062,0.00039179486,0.00017945856],"domain_scores_gemma":[0.9872547,0.009385672,0.0008734124,0.0009259281,0.0012285215,0.00033184368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045983423,0.0008919843,0.0011858693,0.0038678583,0.00087270676,0.0031848592,0.0018676912,0.001803054,0.0124314455],"category_scores_gemma":[0.021366306,0.0005796609,0.0021321794,0.004526128,0.00084970176,0.0023980276,0.001516467,0.0025714526,0.0037845871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003646414,0.0001283242,0.020644339,0.00096296036,0.00038835386,0.0005104859,0.0008084817,0.27437332,0.0011474383,0.222123,0.0343608,0.4441878],"study_design_scores_gemma":[0.00006929354,0.00012583785,0.0045440434,0.00029774726,0.00014263309,0.0006912111,0.00022569038,0.6050927,0.00077219674,0.33295497,0.054992683,0.0000909795],"about_ca_topic_score_codex":0.0029644251,"about_ca_topic_score_gemma":0.0036992745,"teacher_disagreement_score":0.0124314455,"about_ca_system_score_codex":0.0014109006,"about_ca_system_score_gemma":0.0013331776,"threshold_uncertainty_score":0.041587293},"labels":[],"label_agreement":null},{"id":"W2603318542","doi":"","title":"Polynomially Solvable Cases of the Constant Rank Unconstrained Quadratic 0-1 Programming Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic programming; Quadratic equation; Quadratic function; Matrix (chemical analysis); Function (biology); Mathematical optimization; Computer science; Geometry","score_opus":0.019421498859845596,"score_gpt":0.27469018667941114,"score_spread":0.2552686878195655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603318542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16697617,0.002558972,0.7521533,0.003643737,0.0004458211,0.00018388403,0.0013711083,0.0005992157,0.07206786],"genre_scores_gemma":[0.88254035,0.0007496685,0.09355021,0.00044168413,0.00051595754,0.0001942345,0.0009890633,0.00025694395,0.020761825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839956,0.00058935094,0.000047954003,0.00035622393,0.00029063877,0.00031626353],"domain_scores_gemma":[0.9963936,0.0026774965,0.00040518193,0.0001693226,0.00019695109,0.00015749643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014170194,0.0012823591,0.0013343832,0.00054473866,0.00062401395,0.0019309958,0.0013014947,0.0021463619,0.008364468],"category_scores_gemma":[0.008218239,0.00038524283,0.000615159,0.0010150616,0.001662037,0.0018806333,0.0013651918,0.0023440768,0.00066066463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000540802,0.00027208318,0.0008537238,0.0007149863,0.000078889505,0.0012092389,0.00019422908,0.43632525,0.001691652,0.5015815,0.01830484,0.038232792],"study_design_scores_gemma":[0.00012322633,0.000112969974,0.0003347022,0.000034940906,0.000016153637,0.0002208944,0.00010351987,0.6758071,0.0009425057,0.3193078,0.0029636028,0.00003259526],"about_ca_topic_score_codex":0.0027210861,"about_ca_topic_score_gemma":0.0027161995,"teacher_disagreement_score":0.008364468,"about_ca_system_score_codex":0.0008920888,"about_ca_system_score_gemma":0.0009427839,"threshold_uncertainty_score":0.027981937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.012033092598875505,"score_gpt":0.2524866901072873,"score_spread":0.2404535975084118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603607199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63798785,0.0049666427,0.118255846,0.0400799,0.0020848538,0.000076466,0.0012403907,0.0006654255,0.19464263],"genre_scores_gemma":[0.9816404,0.0011441944,0.007942101,0.0017050414,0.0011155189,0.000051407565,0.00052222074,0.00008698144,0.0057920916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978569,0.00039239728,0.000119451164,0.0006238497,0.0005894408,0.00041792472],"domain_scores_gemma":[0.9889292,0.0069706775,0.0009408871,0.0016255737,0.0008846136,0.00064904086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028422826,0.00046104606,0.0013796687,0.0023339277,0.0024495078,0.004225939,0.0016962271,0.002300755,0.008715075],"category_scores_gemma":[0.014249266,0.0004452127,0.0011126613,0.0026908515,0.0074421037,0.009774498,0.003127055,0.0040951287,0.0014400334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015675701,0.000033644606,0.0015267713,0.00004770371,0.000014205242,0.00007656254,0.00042698678,0.0013321049,0.00057673984,0.98062474,0.0065523395,0.0086314315],"study_design_scores_gemma":[0.000033584394,0.000026731774,0.0008870382,0.000022635182,0.0000130975895,0.00010697637,0.00016785727,0.003569094,0.0006399481,0.9890698,0.0054413155,0.000021809432],"about_ca_topic_score_codex":0.0013365077,"about_ca_topic_score_gemma":0.0007119224,"teacher_disagreement_score":0.008715075,"about_ca_system_score_codex":0.0019172272,"about_ca_system_score_gemma":0.0007580799,"threshold_uncertainty_score":0.029154778},"labels":[],"label_agreement":null},{"id":"W2604827926","doi":"","title":"The Secondary Benefits of Climate Change Mitigation: An Overlapping Generations Approach","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Fiscal Policy and Economic Growth","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; HEC Montréal","funders":"","keywords":"Climate change; Natural resource economics; Political economy of climate change; Welfare; Greenhouse gas; Climate change mitigation; Environmental science; Economics; Ecology; Market economy","score_opus":0.026726354307205755,"score_gpt":0.1946286460578995,"score_spread":0.16790229175069377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604827926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34886208,0.004501952,0.59054965,0.011310959,0.00045411786,0.00015908066,0.00087160367,0.00019178617,0.04309883],"genre_scores_gemma":[0.96139115,0.0024523279,0.017216116,0.00042622912,0.00025123823,0.00010970867,0.00011509723,0.00003349987,0.018004688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991462,0.00052701257,0.000017832941,0.0000985231,0.00006998851,0.00014038043],"domain_scores_gemma":[0.9988172,0.00067698193,0.00018910432,0.000086735534,0.00007384043,0.00015621349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018068195,0.00094291236,0.0010665943,0.0009184753,0.00088019436,0.0015926742,0.0016655939,0.0020249623,0.007004071],"category_scores_gemma":[0.003674921,0.000496438,0.0012837799,0.0007784038,0.0011968588,0.0016838474,0.0013587219,0.0014541681,0.00036859125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013875845,0.000091595466,0.004732599,0.00006801223,0.00028211254,0.0007974434,0.00039349642,0.52278453,0.0004417454,0.45041814,0.0024809807,0.017370556],"study_design_scores_gemma":[0.00010161784,0.00008168845,0.002461901,0.00003984546,0.00019620106,0.00021116054,0.00019519942,0.6179945,0.00013097185,0.37275538,0.005789859,0.00004171888],"about_ca_topic_score_codex":0.012540503,"about_ca_topic_score_gemma":0.011409419,"teacher_disagreement_score":0.012540503,"about_ca_system_score_codex":0.0018956331,"about_ca_system_score_gemma":0.0009917397,"threshold_uncertainty_score":0.024935007},"labels":[],"label_agreement":null},{"id":"W2605316234","doi":"","title":"IP Restoration vs. Optical Protection: Which One has the Least Bandwidth Requirements?","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Survivability; Bandwidth (computing); Computer science; Computer network; Wavelength-division multiplexing; Data recovery; Scheme (mathematics); Mathematics; Computer hardware","score_opus":0.0314189055612623,"score_gpt":0.2193070326784906,"score_spread":0.1878881271172283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605316234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9143408,0.0017295403,0.07991779,0.0008955818,0.000028295035,0.000052878273,0.00009028836,0.00009932828,0.002845407],"genre_scores_gemma":[0.99067557,0.00027444458,0.00866587,0.00003500343,0.000019031237,0.000013377829,0.000017841196,0.0000104247565,0.0002884478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.00055681996,0.000039165316,0.0001928601,0.00018519265,0.00021214549],"domain_scores_gemma":[0.99441445,0.0039414517,0.0008005083,0.0002969843,0.00032889657,0.00021769233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023792768,0.00070825394,0.00071292656,0.0012837847,0.00034733373,0.001428354,0.0007975195,0.001442072,0.001872928],"category_scores_gemma":[0.007428798,0.00025781634,0.00036454192,0.0006480088,0.0010197612,0.002693717,0.0007115765,0.00043386573,0.0002132996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051642596,0.001227772,0.02864279,0.0011617125,0.0002771526,0.00066066784,0.00019390784,0.6290574,0.12524095,0.029481249,0.0014871075,0.17740501],"study_design_scores_gemma":[0.00010723526,0.0017675638,0.007284245,0.00008008054,0.0002091746,0.00041157176,0.00044715547,0.93228066,0.036954653,0.019577332,0.0008270618,0.000053393185],"about_ca_topic_score_codex":0.0008895476,"about_ca_topic_score_gemma":0.0010208392,"teacher_disagreement_score":0.0023792768,"about_ca_system_score_codex":0.0006902402,"about_ca_system_score_gemma":0.00041436093,"threshold_uncertainty_score":0.012583017},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005213141375044285,"score_gpt":0.18570011307695328,"score_spread":0.180486971701909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605694204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0417844,0.00075845333,0.88143057,0.0006486322,0.0002547681,0.00031755804,0.00023319626,0.00085453124,0.07371798],"genre_scores_gemma":[0.6618315,0.00062826206,0.31093943,0.0002823325,0.000069898124,0.00036844178,0.00018745459,0.00019638799,0.025496354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995396,0.00013810294,0.000017748207,0.000050518436,0.00018131247,0.00007262662],"domain_scores_gemma":[0.99968386,0.00010989957,0.000042952743,0.00005142722,0.00009733128,0.000014575102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529665,0.00081836316,0.00039882396,0.0005030154,0.00043356454,0.0011793145,0.00079919165,0.00039594134,0.008838829],"category_scores_gemma":[0.0017628964,0.0002332141,0.00020179688,0.0004884404,0.00034732014,0.00089712517,0.00052046566,0.00060322275,0.0007576821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019107349,0.00007712487,0.00046800575,0.00023031271,0.00002706483,0.00018628575,0.00006449078,0.6432053,0.017110229,0.11780743,0.010950803,0.20968194],"study_design_scores_gemma":[0.000052218376,0.00011749068,0.00016702856,0.000028251892,0.000016397335,0.00014046863,0.000034497192,0.94624025,0.010669263,0.022174114,0.020349806,0.000010168508],"about_ca_topic_score_codex":0.0010748723,"about_ca_topic_score_gemma":0.0018852887,"teacher_disagreement_score":0.008838829,"about_ca_system_score_codex":0.00081323605,"about_ca_system_score_gemma":0.0010323289,"threshold_uncertainty_score":0.029568851},"labels":[],"label_agreement":null},{"id":"W2606254134","doi":"","title":"Design and Dimensioning of Logical Survivable Topologies against Multiple Failures","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dimensioning; Computer science; Network topology; Computer network; Redundancy (engineering); Heuristics; Wavelength-division multiplexing; Distributed computing; Path protection; Scalability; Backup; Quality of service; Engineering","score_opus":0.013946030340864645,"score_gpt":0.2018001424037892,"score_spread":0.18785411206292457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606254134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22328478,0.0005494732,0.7674489,0.0006668343,0.000059621747,0.00020407376,0.00029169518,0.00036321583,0.007131449],"genre_scores_gemma":[0.8861321,0.00030862217,0.11212761,0.00007313228,0.000015992939,0.00014865838,0.00017022813,0.00004478902,0.00097895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963295,0.00018384709,0.000017478294,0.00004370334,0.00006766744,0.000054218945],"domain_scores_gemma":[0.99881554,0.00064819935,0.00023770088,0.00007530284,0.00013132887,0.000091957714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009261889,0.0004909044,0.00036879827,0.00067544135,0.00023816992,0.0007743657,0.0007057068,0.00053555716,0.0017445708],"category_scores_gemma":[0.0025750985,0.00033270766,0.00031761354,0.0004054727,0.00058933324,0.0009072761,0.00061190955,0.00045603365,0.00016341405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000336815,0.000020677222,0.00024460978,0.000058578447,0.000007890154,0.000048922844,0.000022086402,0.978312,0.0023458982,0.006187336,0.00036545965,0.012352805],"study_design_scores_gemma":[0.000009960213,0.00006417449,0.00008833938,0.000007971255,0.0000046315536,0.000022373917,0.000029907878,0.99387276,0.00086617406,0.0044221324,0.0006082132,0.0000032385792],"about_ca_topic_score_codex":0.00062517746,"about_ca_topic_score_gemma":0.0007725271,"teacher_disagreement_score":0.0017445708,"about_ca_system_score_codex":0.00077044516,"about_ca_system_score_gemma":0.0005724017,"threshold_uncertainty_score":0.005836189},"labels":[],"label_agreement":null},{"id":"W2609554869","doi":"","title":"Dynamic Model of R&D, Spillovers and Efficiency of Bertrand and Cournot Equilibria","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Cournot competition; Bertrand competition; Bertrand paradox (economics); Duopoly; Economics; Differential game; Mathematical economics; Productivity; Competition (biology); Microeconomics; Stackelberg competition; Investment (military); Oligopoly; Mathematics; Mathematical optimization","score_opus":0.010624814863506398,"score_gpt":0.18667071950749195,"score_spread":0.17604590464398556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609554869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3887998,0.0013822388,0.5321797,0.0016794923,0.00006134522,0.00016055221,0.00043391492,0.00015323126,0.07514974],"genre_scores_gemma":[0.97585547,0.00043982247,0.012657028,0.00005679414,0.00002373181,0.00006403429,0.000058609614,0.000008654849,0.010835812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914885,0.00033618,0.000032926313,0.0001525289,0.0001420926,0.00018744743],"domain_scores_gemma":[0.99861264,0.0007366594,0.00030930096,0.00008440582,0.00010591074,0.000151074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012070696,0.0007418193,0.001167653,0.00090955157,0.00062996603,0.0030850207,0.0017284424,0.0019939619,0.00452441],"category_scores_gemma":[0.003220082,0.00059869135,0.0009232307,0.00105708,0.0022058538,0.0029216295,0.0011269448,0.0010600939,0.00040793887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086395376,0.00008949996,0.00065195066,0.00006325175,0.000038377224,0.00036169568,0.00012594019,0.50957876,0.0017629758,0.4830711,0.00042123234,0.0037487897],"study_design_scores_gemma":[0.000087218454,0.000068540656,0.000646143,0.00001572933,0.000030263382,0.00015166684,0.00006230162,0.8369995,0.00038056163,0.16020006,0.0013194,0.000038646667],"about_ca_topic_score_codex":0.00854181,"about_ca_topic_score_gemma":0.0044456962,"teacher_disagreement_score":0.00854181,"about_ca_system_score_codex":0.0026666878,"about_ca_system_score_gemma":0.0013539902,"threshold_uncertainty_score":0.019348204},"labels":[],"label_agreement":null},{"id":"W2609805035","doi":"","title":"Design of Multi-Granularity Directed Segment \\(p\\)-Cycles","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spare part; Wavelength-division multiplexing; Granularity; Computer science; Node (physics); Multiplexing; Distributed computing; Engineering; Mathematical optimization; Wavelength; Telecommunications; Mathematics","score_opus":0.010578403928176074,"score_gpt":0.21162470421196036,"score_spread":0.20104630028378428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609805035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15624058,0.00027966773,0.83718425,0.00010797751,0.00002377205,0.00011181243,0.000095540694,0.0002606069,0.0056957817],"genre_scores_gemma":[0.85320777,0.00014797249,0.14477433,0.000043414228,0.0000071565023,0.00013954776,0.00009339658,0.000050577975,0.0015358784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998449,0.00005132124,0.000007765881,0.000028468843,0.00003635381,0.000031170624],"domain_scores_gemma":[0.9997515,0.000081861086,0.00006211244,0.000027563285,0.0000540117,0.000022931801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027872447,0.00041191053,0.0002853057,0.00036625806,0.00023671515,0.00034786278,0.00062821526,0.00030476812,0.0014886502],"category_scores_gemma":[0.00052248646,0.000248016,0.00027142154,0.00032168304,0.00024866217,0.00035850125,0.0003508255,0.0002462319,0.00014940028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012228462,0.000048967915,0.0009515406,0.00013232982,0.000025741258,0.000107189604,0.000062727995,0.8818944,0.023907777,0.015040032,0.00082755485,0.07687936],"study_design_scores_gemma":[0.00002005358,0.00014487405,0.00021777788,0.000009405676,0.000011456737,0.000042192933,0.00001727166,0.9852165,0.007826359,0.0044054585,0.0020824433,0.0000062228464],"about_ca_topic_score_codex":0.00083672075,"about_ca_topic_score_gemma":0.001316522,"teacher_disagreement_score":0.0014886502,"about_ca_system_score_codex":0.0004876465,"about_ca_system_score_gemma":0.00056855584,"threshold_uncertainty_score":0.0049800277},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015129462610439235,"score_gpt":0.25761095197534983,"score_spread":0.2424814893649106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610662316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02002234,0.016923834,0.9225975,0.0025038589,0.00066987216,0.00046190267,0.0005594184,0.0009192424,0.035342064],"genre_scores_gemma":[0.1372123,0.017325025,0.83670163,0.0011319453,0.00049339177,0.0011661287,0.0011708987,0.0009747868,0.0038239823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896763,0.0058031855,0.0006601248,0.00062679814,0.0025646961,0.0006688566],"domain_scores_gemma":[0.9778202,0.017488249,0.0011295539,0.0012753877,0.0020063247,0.00028033493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010620717,0.0028371518,0.0020560503,0.0023558158,0.0009623208,0.0041802684,0.0029195368,0.0025251627,0.006370319],"category_scores_gemma":[0.02407288,0.0011566778,0.0024849677,0.0038627635,0.0011176522,0.0046468233,0.0020564653,0.0053855944,0.0015228442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005839461,0.00051885506,0.00067036477,0.0014827722,0.00019634407,0.00012653494,0.0002929262,0.649823,0.001825663,0.10389925,0.009797325,0.2307831],"study_design_scores_gemma":[0.00018435183,0.00040971488,0.00053804263,0.00053957896,0.00010751373,0.00019324772,0.00038534307,0.9093396,0.0028015932,0.061053358,0.024387442,0.000060260238],"about_ca_topic_score_codex":0.0012196772,"about_ca_topic_score_gemma":0.0015368946,"teacher_disagreement_score":0.010620717,"about_ca_system_score_codex":0.0028700337,"about_ca_system_score_gemma":0.0027634047,"threshold_uncertainty_score":0.056168377},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04427547191506248,"score_gpt":0.2242310602243066,"score_spread":0.17995558830924413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610727005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2018463,0.0005381159,0.7063557,0.004140994,0.00016663634,0.00037678384,0.00075500814,0.0001611988,0.08565936],"genre_scores_gemma":[0.96634245,0.0003206411,0.01789323,0.00019067418,0.000042669904,0.00025086149,0.000102562735,0.000012802973,0.0148442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734926,0.0014893408,0.000077293655,0.00035668892,0.00032190984,0.00040547788],"domain_scores_gemma":[0.9979419,0.0013409879,0.00021030058,0.000092793875,0.00010918202,0.0003047522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026843576,0.0009141132,0.001113465,0.0005521899,0.00070072484,0.0021005785,0.0022631828,0.0032141644,0.006068496],"category_scores_gemma":[0.0049444675,0.0005856826,0.0009043611,0.0006267172,0.0022423025,0.003784066,0.0017082642,0.0020494051,0.0003933192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021593503,0.000119679935,0.0007846523,0.0001000946,0.0000754948,0.0006373201,0.0002674117,0.26887587,0.0017217343,0.7193653,0.0013761427,0.006460391],"study_design_scores_gemma":[0.00018931196,0.00017360848,0.0005304279,0.00002635521,0.000047757178,0.00016617293,0.0001415664,0.72956705,0.0005420029,0.26430324,0.004261415,0.00005117913],"about_ca_topic_score_codex":0.006335451,"about_ca_topic_score_gemma":0.003702142,"teacher_disagreement_score":0.006335451,"about_ca_system_score_codex":0.0031592445,"about_ca_system_score_gemma":0.0018179363,"threshold_uncertainty_score":0.02292198},"labels":[],"label_agreement":null},{"id":"W2610733719","doi":"","title":"A General Multi-Shift Scheduling System","year":2001,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Robustness (evolution); Scheduling (production processes); Computer science; Constraint programming; Mathematical optimization; Constraint (computer-aided design); Operations research; Constraint satisfaction; Variety (cybernetics); Industrial engineering; Artificial intelligence; Engineering; Mathematics; Stochastic programming","score_opus":0.08885830895559776,"score_gpt":0.3426135323313483,"score_spread":0.2537552233757505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610733719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13474186,0.0012540994,0.8267504,0.00105553,0.0002978067,0.00044220558,0.0017400556,0.0014208829,0.03229724],"genre_scores_gemma":[0.87379783,0.0009480982,0.09924215,0.00018810184,0.00017250993,0.00023110084,0.0012148215,0.00008624982,0.02411915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943787,0.0001035207,0.00002408098,0.00022485848,0.00010581433,0.000103833234],"domain_scores_gemma":[0.9997508,0.00005775841,0.000041921197,0.00004281566,0.0000636453,0.000043064807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046050272,0.0007060442,0.00078721193,0.00045450605,0.0010272827,0.0011897582,0.0014592314,0.0012786996,0.010588572],"category_scores_gemma":[0.00066553766,0.00031230215,0.000698486,0.0014249051,0.00049072335,0.0010835887,0.0011315774,0.0005529354,0.0018523152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040904141,0.00010388638,0.0012358086,0.00039635372,0.000092982315,0.0008198171,0.00015051784,0.86537826,0.011415832,0.0438043,0.007613338,0.06857996],"study_design_scores_gemma":[0.00009457943,0.00014938922,0.0010455725,0.000013855374,0.00003948911,0.00029170435,0.000057589514,0.95789826,0.0009718222,0.021181567,0.01822782,0.000028384844],"about_ca_topic_score_codex":0.0055182735,"about_ca_topic_score_gemma":0.005080596,"teacher_disagreement_score":0.010588572,"about_ca_system_score_codex":0.00081079593,"about_ca_system_score_gemma":0.0012486444,"threshold_uncertainty_score":0.035422325},"labels":[],"label_agreement":null},{"id":"W2611369009","doi":"","title":"One-Sample Location Tests for Multilevel Data","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Sign test; Wilcoxon signed-rank test; Statistical hypothesis testing; Statistics; Asymptotic distribution; Mathematics; Null hypothesis; Sign (mathematics); Rank (graph theory); Sample (material); Null (SQL); Computer science; Data mining; Estimator; Combinatorics","score_opus":0.20181538497179444,"score_gpt":0.3926227991427445,"score_spread":0.19080741417095007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611369009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097400315,0.0003248272,0.8990593,0.00032301818,0.00006200896,0.00016746925,0.00028078575,0.00030298295,0.0020792428],"genre_scores_gemma":[0.7348598,0.00012405543,0.2630602,0.00012840808,0.00009022512,0.00047097917,0.00041494018,0.0001053789,0.0007460275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9684937,0.022765277,0.0009978922,0.00319589,0.003946956,0.0006002366],"domain_scores_gemma":[0.7710362,0.19958127,0.011108406,0.011327494,0.005837262,0.0011093578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026750965,0.00065030594,0.0019148536,0.0035765553,0.00084520195,0.0017069961,0.0022214877,0.0014627443,0.005372772],"category_scores_gemma":[0.2063048,0.00031889032,0.0014401727,0.003450925,0.0028605994,0.003750101,0.0023051307,0.0022447768,0.0006690909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010567784,0.0004511962,0.105931565,0.0008255731,0.0021171416,0.0008664863,0.0010114777,0.13776225,0.006316336,0.25143462,0.0036662146,0.48856044],"study_design_scores_gemma":[0.0001865523,0.0014068276,0.04163711,0.00023622903,0.00029704126,0.0006067494,0.00057810004,0.6132244,0.0073549207,0.32887977,0.005439489,0.00015279032],"about_ca_topic_score_codex":0.0009508518,"about_ca_topic_score_gemma":0.0007713028,"teacher_disagreement_score":0.026750965,"about_ca_system_score_codex":0.0007282381,"about_ca_system_score_gemma":0.00096780213,"threshold_uncertainty_score":0.1414743},"labels":[],"label_agreement":null},{"id":"W2611735943","doi":"","title":"Canadian Energy and Climate Policies: A SWOT Analysis in Search for Federal/Provincial Coherence","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Arctic and Russian Policy Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Coherence (philosophical gambling strategy); SWOT analysis; Political science; Energy policy; Geography; Economics; Renewable energy; Engineering; Management; Statistics; Mathematics","score_opus":0.018825390539338592,"score_gpt":0.293963675814433,"score_spread":0.27513828527509443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611735943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157294,0.00088077463,0.0034440537,0.0025015934,0.000031049454,0.00019671003,0.022016773,0.00008573307,0.055113886],"genre_scores_gemma":[0.9883109,0.00032835384,0.0025128555,0.00013298857,0.0000050881026,0.000048540576,0.005175411,0.000023139608,0.0034627256],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818546,0.0002701492,0.000092653965,0.0001731311,0.00077379827,0.0005047244],"domain_scores_gemma":[0.99484926,0.0011487858,0.00040950757,0.0002133335,0.0029700182,0.00040913362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002005696,0.00035335842,0.00078776956,0.004006916,0.0035808778,0.0029829056,0.00081541494,0.0004573885,0.0062799756],"category_scores_gemma":[0.010295956,0.00019398921,0.0009699196,0.017128805,0.0009241482,0.00094930665,0.0013594268,0.0007881731,0.00021478512],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005943165,0.000110672765,0.76460886,0.00051566935,0.0010699509,0.00029144462,0.008381623,0.0400878,0.0008323001,0.08723277,0.036243882,0.06003069],"study_design_scores_gemma":[0.00003918649,0.000067507724,0.86249065,0.00019838936,0.0005571597,0.000039708986,0.03398105,0.03697903,0.00050879497,0.00703819,0.058032203,0.00006805678],"about_ca_topic_score_codex":0.99590874,"about_ca_topic_score_gemma":0.99730444,"teacher_disagreement_score":0.9587791,"about_ca_system_score_codex":0.041220885,"about_ca_system_score_gemma":0.09009905,"threshold_uncertainty_score":0.2990799},"labels":[],"label_agreement":null},{"id":"W2611872372","doi":"","title":"On State Feedback Stabilization of Singular Systems with Random Abrupt Changes","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Full state feedback; Mathematics; Bounded function; Piecewise; Linear system; Impulse (physics); Norm (philosophy); Robust control; Feedback controller; Computer science; Control system; Engineering; Control (management); Mathematical analysis","score_opus":0.0034553570349793584,"score_gpt":0.15727343314322284,"score_spread":0.1538180761082435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611872372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05064703,0.0043844185,0.9322877,0.00045157177,0.00022876414,0.000060648443,0.000067462744,0.0002944584,0.0115779685],"genre_scores_gemma":[0.97618437,0.004003103,0.015509503,0.00016158719,0.00038474856,0.000105340696,0.00008808027,0.000046185785,0.0035172135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00011005236,0.000023896924,0.00010735812,0.00022967152,0.000048400343],"domain_scores_gemma":[0.9992449,0.00043597832,0.00012232954,0.000044934204,0.00012562596,0.000026128531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577856,0.000656396,0.00075641007,0.00056985655,0.0003277864,0.0006016945,0.00049143087,0.00063615333,0.0011268256],"category_scores_gemma":[0.001980445,0.000186458,0.0005375476,0.00052436866,0.001517239,0.0007013722,0.00087312853,0.00077204185,0.00017227531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021667397,0.00005055795,0.0006489439,0.0006386813,0.00014181992,0.000929587,0.0003958438,0.78221583,0.035037264,0.12551896,0.0015441921,0.0526616],"study_design_scores_gemma":[0.000027578773,0.00029055373,0.000789185,0.000053218424,0.00004250131,0.00015573562,0.000056979494,0.93298167,0.0058048624,0.055641916,0.004119441,0.000036393918],"about_ca_topic_score_codex":0.0011049302,"about_ca_topic_score_gemma":0.0005660785,"teacher_disagreement_score":0.0011268256,"about_ca_system_score_codex":0.0004705348,"about_ca_system_score_gemma":0.00028947808,"threshold_uncertainty_score":0.0037696362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023572636302335942,"score_gpt":0.21728482571343927,"score_spread":0.19371218941110332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612233487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04837727,0.0035947599,0.9329045,0.0015645251,0.00017095704,0.00006539684,0.00027154747,0.00024314143,0.012807908],"genre_scores_gemma":[0.9291679,0.005137477,0.045758635,0.00023136039,0.0004389124,0.00012557342,0.000332842,0.00015036082,0.018656895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.00048672353,0.00003524371,0.00013270657,0.0001704867,0.00010140769],"domain_scores_gemma":[0.99795413,0.0011887575,0.00033460616,0.00016469398,0.00021382672,0.00014393305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023306068,0.0011702792,0.0010155389,0.0009404679,0.00050984905,0.0022669232,0.001257683,0.001322159,0.004395764],"category_scores_gemma":[0.008528382,0.00063642923,0.0013726138,0.0014528816,0.0017186743,0.0025653057,0.0011106197,0.0023605444,0.00066801027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026728118,0.000043818665,0.0031453276,0.000087890556,0.00008345032,0.00031670893,0.00018789248,0.5159715,0.00071069086,0.45828056,0.0043946854,0.016750824],"study_design_scores_gemma":[0.000007297985,0.0000114088025,0.00081215065,0.000018906583,0.000012385981,0.000071674745,0.00003079096,0.8602481,0.00008064328,0.13730712,0.0013835942,0.000015968351],"about_ca_topic_score_codex":0.015020038,"about_ca_topic_score_gemma":0.007515441,"teacher_disagreement_score":0.015020038,"about_ca_system_score_codex":0.0017163329,"about_ca_system_score_gemma":0.0011570284,"threshold_uncertainty_score":0.029865205},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04037595506049975,"score_gpt":0.20904401361029953,"score_spread":0.16866805854979977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612945519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17861955,0.000102539314,0.81376714,0.00020859312,0.00003092498,0.00011220114,0.00028907252,0.00070843,0.006161501],"genre_scores_gemma":[0.85351324,0.0000623376,0.14327653,0.00007614141,0.000009038313,0.00018942806,0.0002639675,0.00011551005,0.0024937647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997749,0.0001098111,0.000008809305,0.000037421323,0.00004058929,0.000028498902],"domain_scores_gemma":[0.9989901,0.00068725506,0.00009978054,0.0000628152,0.000116697556,0.000043335604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083267747,0.0006029837,0.0009941818,0.00041241912,0.00035573408,0.00083092984,0.000790248,0.00095049985,0.0024549551],"category_scores_gemma":[0.0024241,0.00042942553,0.0005370106,0.00030726814,0.0006081568,0.00062440126,0.00082256505,0.00048438183,0.00025623207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020817022,0.0000064287146,0.00018461487,0.0000058939668,0.000006006685,0.000009570047,0.0000062596437,0.9974483,0.000262654,0.0004002189,0.000044879343,0.0016044247],"study_design_scores_gemma":[0.000004025173,0.0000043522828,0.000020568565,8.856513e-7,6.367194e-7,6.6401645e-7,0.0000018123404,0.9996325,0.00010613645,0.00019024854,0.000037433234,6.373974e-7],"about_ca_topic_score_codex":0.011670599,"about_ca_topic_score_gemma":0.0068063294,"teacher_disagreement_score":0.011670599,"about_ca_system_score_codex":0.00057841884,"about_ca_system_score_gemma":0.0010505324,"threshold_uncertainty_score":0.02320534},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; 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","score_opus":0.01087848835570577,"score_gpt":0.23200012419225466,"score_spread":0.2211216358365489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614002522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052377535,0.00032642108,0.98750883,0.0002568545,0.000037847727,0.00006445998,0.0002273076,0.00011894702,0.0062215473],"genre_scores_gemma":[0.26330578,0.002162861,0.7082476,0.00030293738,0.00022375728,0.00079741556,0.0014263982,0.00032239966,0.023210712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999067,0.00040626308,0.00004128625,0.00012801177,0.00023548742,0.00012199986],"domain_scores_gemma":[0.9992386,0.0004521824,0.000104965955,0.00005197812,0.00010477383,0.000047486705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021370142,0.0019519709,0.0012444136,0.0011763026,0.0005640249,0.0014585576,0.00085084984,0.0014232539,0.008068828],"category_scores_gemma":[0.0026253772,0.0011550395,0.0016457081,0.0013489332,0.0007855956,0.001632032,0.0010187819,0.0024699876,0.0011370465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032365708,0.000026132377,0.00013506305,0.00006074505,0.000026652011,0.000045459255,0.000037929345,0.90690035,0.00082672574,0.07756744,0.001322625,0.013018495],"study_design_scores_gemma":[0.000011211476,0.000014632383,0.00006323472,0.00001303539,0.0000078151315,0.000010235109,0.00001094817,0.9251826,0.00020514132,0.0728291,0.0016454228,0.0000066729035],"about_ca_topic_score_codex":0.0047471165,"about_ca_topic_score_gemma":0.004068462,"teacher_disagreement_score":0.008068828,"about_ca_system_score_codex":0.0019963908,"about_ca_system_score_gemma":0.0017651074,"threshold_uncertainty_score":0.026992917},"labels":[],"label_agreement":null},{"id":"W2614309153","doi":"","title":"A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematical optimization; Facility location problem; Fixed cost; Heuristic; Computer science; Location-allocation; Fixed point; Mathematics; Economics","score_opus":0.009475611608757808,"score_gpt":0.1926013734441536,"score_spread":0.18312576183539578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614309153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025069084,0.0009005182,0.96212244,0.00044251082,0.00011598339,0.00017003687,0.00039903985,0.00019717064,0.010583265],"genre_scores_gemma":[0.663759,0.0014148592,0.32237396,0.00008930548,0.00019061832,0.0005287329,0.00049835735,0.000095202646,0.011049943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802977,0.0008908342,0.000059541322,0.00033656784,0.00034197676,0.00034143304],"domain_scores_gemma":[0.99839455,0.0010890219,0.00012647503,0.000097760756,0.00013908235,0.00015303888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001762613,0.0014332838,0.0015548465,0.0013333204,0.00085861137,0.0029340992,0.0030525243,0.003276821,0.006325693],"category_scores_gemma":[0.003589589,0.0009796657,0.0010758118,0.004129975,0.0017268839,0.0024788207,0.001766485,0.0020716004,0.0006234436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110758636,0.00007627074,0.0003287825,0.00021996064,0.000040907795,0.0002552014,0.00007421176,0.85494983,0.00089960766,0.120306216,0.0017940761,0.020944213],"study_design_scores_gemma":[0.0000654809,0.00010293685,0.0002908385,0.000029055753,0.000042123305,0.00023801769,0.000083134066,0.95615226,0.0004575977,0.03810042,0.0044020345,0.00003607487],"about_ca_topic_score_codex":0.007370834,"about_ca_topic_score_gemma":0.00601146,"teacher_disagreement_score":0.007370834,"about_ca_system_score_codex":0.0029409581,"about_ca_system_score_gemma":0.001933579,"threshold_uncertainty_score":0.021338224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01299273276368908,"score_gpt":0.2503155618157183,"score_spread":0.2373228290520292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615542916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98521554,0.0012295928,0.0020582832,0.0010356951,0.000021766877,0.0006957019,0.000572143,0.0000239432,0.009147293],"genre_scores_gemma":[0.9885499,0.0012240981,0.0068948474,0.00015942466,0.000007146989,0.00016345156,0.00034785154,0.000009403692,0.0026438062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977053,0.0011029559,0.00008611195,0.00014649394,0.00064075325,0.00031849134],"domain_scores_gemma":[0.991322,0.005550332,0.0003443226,0.00013514029,0.0019218457,0.0007263699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003724698,0.00076382235,0.00070166134,0.0010294184,0.0026597336,0.002166537,0.0011493788,0.00079082244,0.0022267364],"category_scores_gemma":[0.010448546,0.00023464714,0.0009107001,0.0023381761,0.0011750656,0.00058530754,0.000838261,0.0011369399,0.00015478447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00481437,0.007322625,0.21703617,0.003133189,0.0010601125,0.0015019892,0.010817633,0.4357971,0.0030658904,0.010880783,0.014759346,0.28981075],"study_design_scores_gemma":[0.0013315885,0.0041619544,0.25983587,0.0007797126,0.00055735157,0.00015351173,0.03758559,0.6662612,0.0020129704,0.00466951,0.022271486,0.00037929494],"about_ca_topic_score_codex":0.972368,"about_ca_topic_score_gemma":0.9825842,"teacher_disagreement_score":0.040403318,"about_ca_system_score_codex":0.040403318,"about_ca_system_score_gemma":0.043741632,"threshold_uncertainty_score":0.29314798},"labels":[],"label_agreement":null},{"id":"W2615859282","doi":"","title":"Classification algorithms for virtual metrology","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Metrology; Computer science; Algorithm; Process (computing); Sampling (signal processing); Dimensional metrology; Quality (philosophy); Measurement uncertainty; Data mining; Mathematics; Computer vision; Statistics","score_opus":0.020471203136089924,"score_gpt":0.22981892768203055,"score_spread":0.20934772454594064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615859282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054354956,0.00096143613,0.99180096,0.00021408437,0.00012236668,0.000031498133,0.00006320728,0.00042339013,0.0009474444],"genre_scores_gemma":[0.40872675,0.0014323099,0.5835974,0.0003552695,0.00048528635,0.00030296316,0.0008373661,0.0002179088,0.004044728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982539,0.00051344745,0.0001434322,0.00037624995,0.0005796307,0.00013333648],"domain_scores_gemma":[0.99638784,0.0018125592,0.00031491608,0.0005170293,0.00086710555,0.000100625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021375408,0.00072409975,0.0012787392,0.0017450509,0.00071924337,0.0021064528,0.0017091158,0.0020018017,0.002750995],"category_scores_gemma":[0.008572005,0.0003075577,0.0009228759,0.0017537978,0.0009065851,0.0021348079,0.001542222,0.0019138649,0.0012689843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017936797,0.00010493879,0.0012065433,0.00017419693,0.000082388135,0.00005501795,0.00007560548,0.37984735,0.0038889146,0.040755663,0.005655481,0.5679745],"study_design_scores_gemma":[0.0000063830744,0.000026936405,0.00028809678,0.000015239765,0.000005412587,0.000037150512,0.000013425327,0.9769562,0.0009912342,0.019395879,0.0022541215,0.000010030519],"about_ca_topic_score_codex":0.001902503,"about_ca_topic_score_gemma":0.00094535825,"teacher_disagreement_score":0.002750995,"about_ca_system_score_codex":0.0009885724,"about_ca_system_score_gemma":0.00074888207,"threshold_uncertainty_score":0.011304557},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04946418448940374,"score_gpt":0.24393245371925829,"score_spread":0.19446826922985455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615971611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.412807,0.00039241303,0.51298445,0.0018086919,0.000039868213,0.00008678404,0.00021898135,0.00013954895,0.07152228],"genre_scores_gemma":[0.98612183,0.00021678596,0.00915157,0.00008688868,0.000013670321,0.00005004757,0.000059855123,0.00002981107,0.0042694244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00030050147,0.000022862963,0.00012083508,0.00011310958,0.00018711573],"domain_scores_gemma":[0.998218,0.00076799706,0.0004102646,0.00018608462,0.0001706272,0.0002469489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818523,0.00073049363,0.00095865206,0.0004943961,0.0007370776,0.0026783096,0.0015836125,0.001220647,0.004849509],"category_scores_gemma":[0.0056964927,0.00042672374,0.0011149946,0.0006056747,0.0024095075,0.0031857346,0.0026679744,0.0013188984,0.00044079468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007091469,0.00005356348,0.00048021207,0.000041992127,0.000047797806,0.00011524441,0.00025034853,0.5379601,0.0005769094,0.45607492,0.000695509,0.0036324444],"study_design_scores_gemma":[0.00002986306,0.000026299174,0.00023303235,0.0000106841835,0.000020671043,0.000020565747,0.00012972356,0.7072037,0.00015010271,0.29130477,0.00085924176,0.000011402533],"about_ca_topic_score_codex":0.0061417846,"about_ca_topic_score_gemma":0.003109666,"teacher_disagreement_score":0.0061417846,"about_ca_system_score_codex":0.0019700488,"about_ca_system_score_gemma":0.0014114327,"threshold_uncertainty_score":0.016223252},"labels":[],"label_agreement":null},{"id":"W2616466037","doi":"","title":"A Tabu Search Heuristic for the Dimensioning of 3G Multi-Service Networks","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Dimensioning; Tabu search; Heuristic; Computer science; A priori and a posteriori; Service (business); Mathematical optimization; Operations research; Algorithm; Artificial intelligence; Engineering; Mathematics","score_opus":0.022204941657694315,"score_gpt":0.2350248554885643,"score_spread":0.21281991383086998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616466037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044891804,0.0015260985,0.94731873,0.00041492775,0.00009111594,0.00020226448,0.000205682,0.0006609418,0.004688449],"genre_scores_gemma":[0.43993092,0.0008028587,0.5554453,0.00028272523,0.000047898535,0.00055194856,0.00036402728,0.00018045801,0.0023939062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993119,0.000428365,0.000020859996,0.000071504,0.000080442114,0.00008699037],"domain_scores_gemma":[0.9986078,0.0010688815,0.000104132894,0.000056312045,0.00010640235,0.000056439363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622199,0.0009580188,0.001242044,0.0012503713,0.00075770257,0.001137247,0.0012816797,0.0013132797,0.0030265136],"category_scores_gemma":[0.0032398521,0.0007275663,0.0008099824,0.0014749517,0.0009984623,0.0013028305,0.00069714524,0.0009834681,0.00037896886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005116802,0.000030890136,0.00021490359,0.000047206973,0.000025076097,0.000029823845,0.00004462358,0.9739125,0.00020728602,0.006799685,0.00097234396,0.017664462],"study_design_scores_gemma":[0.000019502433,0.000030233623,0.000048399706,0.000011789799,0.000006668292,0.000010223763,0.000016115866,0.99514174,0.000120227734,0.0040233512,0.00056610635,0.0000056062004],"about_ca_topic_score_codex":0.0072789574,"about_ca_topic_score_gemma":0.0056051305,"teacher_disagreement_score":0.0072789574,"about_ca_system_score_codex":0.0016342246,"about_ca_system_score_gemma":0.0018774878,"threshold_uncertainty_score":0.01447314},"labels":[],"label_agreement":null},{"id":"W2617018756","doi":"","title":"Efficient Correlation Matching for Normal-Copula Dependence when Univariate Marginals Are Discrete","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Univariate; Copula (linguistics); Marginal distribution; Applied mathematics; Multivariate random variable; Bivariate analysis; Rank (graph theory); Statistics; Random variable; Combinatorics; Multivariate statistics; Econometrics","score_opus":0.027949594083539604,"score_gpt":0.2980764267496721,"score_spread":0.2701268326661325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617018756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030975765,0.00017227234,0.96696156,0.000102001235,0.000017706843,0.000042094376,0.000036946873,0.00039352948,0.0012979801],"genre_scores_gemma":[0.59773564,0.00019149731,0.39738795,0.000118222015,0.00004584676,0.00010284657,0.0002336868,0.00030587908,0.0038785066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817693,0.00081353245,0.00007097397,0.00022146574,0.00049665733,0.00022043368],"domain_scores_gemma":[0.98472637,0.011167949,0.0009617554,0.0015213684,0.0011420578,0.00048050363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062181004,0.0005975794,0.0013249669,0.0013961677,0.00060477736,0.0012009307,0.0019895874,0.001101023,0.0047046263],"category_scores_gemma":[0.026196985,0.00071711553,0.00090413436,0.0013553462,0.0011396122,0.0021001566,0.0021573512,0.0015582622,0.00081406644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028255087,0.00012903409,0.0031322814,0.00009833476,0.00007231187,0.00015134535,0.00014251,0.82756853,0.0029261338,0.07312047,0.0020713455,0.09030512],"study_design_scores_gemma":[0.000004203624,0.000008076505,0.00012814473,0.0000029278344,0.000002576718,0.0000118298885,0.000004868877,0.9955029,0.00030153574,0.0038812486,0.00014860471,0.000003134483],"about_ca_topic_score_codex":0.0070007686,"about_ca_topic_score_gemma":0.0063347663,"teacher_disagreement_score":0.0070007686,"about_ca_system_score_codex":0.0019731263,"about_ca_system_score_gemma":0.002245188,"threshold_uncertainty_score":0.032884896},"labels":[],"label_agreement":null},{"id":"W2618217765","doi":"","title":"Mixed Effects Random Forest for Clustered Data","year":2010,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Random forest; Extension (predicate logic); Computer science; Random effects model; Maximization; Expectation–maximization algorithm; Revenue; Statistics; Mathematics; Algorithm; Data mining; Maximum likelihood; Artificial intelligence; Mathematical optimization; Finance; Economics","score_opus":0.07299921656652991,"score_gpt":0.33576867311439573,"score_spread":0.2627694565478658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618217765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010733145,0.00016886267,0.9977562,0.00007934242,0.00004364247,0.0000977016,0.00018082713,0.00045470733,0.00014549808],"genre_scores_gemma":[0.041557755,0.00018947541,0.9549192,0.00017041611,0.00011425593,0.0009937752,0.0011822213,0.00022576896,0.00064713415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97810924,0.01683307,0.00061339187,0.0028225607,0.0011433493,0.00047830088],"domain_scores_gemma":[0.9640911,0.027530113,0.0014388468,0.0042685387,0.0022900347,0.0003813228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035640508,0.0020854562,0.002726839,0.0029021353,0.0015185985,0.0017158809,0.0053894836,0.0027189457,0.0052813967],"category_scores_gemma":[0.06497141,0.0012871283,0.0046160724,0.0028503472,0.0012707623,0.0031789294,0.002013172,0.0039043152,0.0024263507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011159088,0.00033540765,0.009199789,0.0012498529,0.0021904618,0.0009051983,0.00039126497,0.4591198,0.0029436671,0.11683099,0.01715414,0.38856357],"study_design_scores_gemma":[0.00017030505,0.00015414918,0.0011509034,0.000105304935,0.00020953015,0.00026100557,0.000039535244,0.8827942,0.00095324207,0.107113846,0.006971106,0.0000768861],"about_ca_topic_score_codex":0.0047623543,"about_ca_topic_score_gemma":0.0076707155,"teacher_disagreement_score":0.035640508,"about_ca_system_score_codex":0.0010684838,"about_ca_system_score_gemma":0.002242611,"threshold_uncertainty_score":0.18848729},"labels":[],"label_agreement":null},{"id":"W2618417782","doi":"","title":"AutoGraphiX: A Survey","year":2005,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Geography","score_opus":0.019389482831308306,"score_gpt":0.22547142741063506,"score_spread":0.20608194457932674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618417782","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021430966,0.70745623,0.108314574,0.0049461834,0.0019145826,0.00027290694,0.004932104,0.008740676,0.14199175],"genre_scores_gemma":[0.06151335,0.76404893,0.08495032,0.0035044681,0.0017712925,0.00023389637,0.020479191,0.004586805,0.05891178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985354,0.0002305922,0.00007685237,0.00043701724,0.00058187306,0.00013827454],"domain_scores_gemma":[0.99622345,0.0017748501,0.00016721,0.0007302945,0.0007790175,0.00032512337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023698446,0.0008669834,0.00077861414,0.0070011895,0.0005988936,0.0023408162,0.0023008129,0.0009374499,0.021347838],"category_scores_gemma":[0.005083504,0.00093518576,0.00073990185,0.009482662,0.00074135646,0.006793869,0.0021390773,0.0016091986,0.008812829],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008879876,0.00013575274,0.002176973,0.002499305,0.000043280485,0.00006671359,0.00014179721,0.0021100952,0.0016695895,0.04189873,0.0890458,0.8601233],"study_design_scores_gemma":[0.00000898699,0.00007297001,0.0011574727,0.0004815539,0.000022873744,0.00042851456,0.000078830955,0.0014455238,0.0015005511,0.006052099,0.98873365,0.000017061824],"about_ca_topic_score_codex":0.0023600447,"about_ca_topic_score_gemma":0.0023983377,"teacher_disagreement_score":0.021347838,"about_ca_system_score_codex":0.001023199,"about_ca_system_score_gemma":0.0018834117,"threshold_uncertainty_score":0.07141566},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Electrification; Road transport; Transport engineering; Business; Economic growth; Geography; Regional science; Environmental planning; Engineering; Electricity; Economics","score_opus":0.001638469327502132,"score_gpt":0.12555401854327491,"score_spread":0.12391554921577279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618469925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45027262,0.06328371,0.0032901247,0.10812338,0.0024966046,0.0001906542,0.13498063,0.0007083413,0.23665395],"genre_scores_gemma":[0.84645325,0.03916173,0.003647768,0.0036361201,0.0001953192,0.00006349309,0.021100268,0.000101487996,0.08564045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915457,0.000023770232,0.00001687965,0.000047887952,0.0004154206,0.00034143406],"domain_scores_gemma":[0.9985922,0.000020145302,0.000060253165,0.0000095776595,0.0010483628,0.0002694047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709926,0.0009868094,0.00030573693,0.0017611284,0.0026379067,0.002821656,0.0010039002,0.001192007,0.0087328805],"category_scores_gemma":[0.0011329105,0.00019233824,0.0009286631,0.006205949,0.0007278086,0.0016438689,0.0011499237,0.0012459785,0.0007319005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010177518,0.00024376129,0.1397682,0.0016915385,0.00037521857,0.0014396977,0.0021823891,0.024909386,0.0027500195,0.09793734,0.50085956,0.22682515],"study_design_scores_gemma":[0.00006924444,0.00011866561,0.32202056,0.00073929026,0.0002386971,0.00036777603,0.006722769,0.0094796475,0.0014825719,0.0050560986,0.6535258,0.00017878952],"about_ca_topic_score_codex":0.9964702,"about_ca_topic_score_gemma":0.9980471,"teacher_disagreement_score":0.080271035,"about_ca_system_score_codex":0.080271035,"about_ca_system_score_gemma":0.12369659,"threshold_uncertainty_score":0.58240986},"labels":[],"label_agreement":null},{"id":"W2618630910","doi":"","title":"Robustness of random forests for regression","year":2010,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Robustness (evolution); Random forest; Regression; Computer science; Mathematics; Linear regression; Robust regression; Least absolute deviations; Algorithm; Statistics; Data mining; Artificial intelligence","score_opus":0.04572534788833244,"score_gpt":0.36867371454409564,"score_spread":0.3229483666557632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618630910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11490938,0.006042978,0.8728852,0.0011347253,0.0003172148,0.0002570911,0.00052863616,0.0014627194,0.0024619903],"genre_scores_gemma":[0.7917625,0.0015342091,0.20288703,0.0005004622,0.0004682908,0.0003010054,0.0011293227,0.00049214106,0.00092513044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9706196,0.021369534,0.0010861671,0.002868883,0.0033319257,0.0007239802],"domain_scores_gemma":[0.8371511,0.13705182,0.0077443714,0.01146654,0.0054932074,0.001092966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.051176764,0.002784785,0.002183963,0.0039448407,0.0015930542,0.0025466683,0.0028001147,0.0031396435,0.0016637857],"category_scores_gemma":[0.14875618,0.0008047931,0.0026652694,0.0020274702,0.0026165273,0.0040362217,0.0025532732,0.0032769907,0.0008081352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074472197,0.00010177555,0.012346617,0.00039721324,0.0010504626,0.00016450611,0.0001897769,0.89859635,0.002353918,0.016082635,0.0016095747,0.06636242],"study_design_scores_gemma":[0.000055763576,0.00020719749,0.0024659308,0.00009093509,0.00011044664,0.00013195923,0.000048795817,0.9630748,0.0023936008,0.030181168,0.0011780356,0.00006136364],"about_ca_topic_score_codex":0.005032213,"about_ca_topic_score_gemma":0.0025851831,"teacher_disagreement_score":0.051176764,"about_ca_system_score_codex":0.0016384154,"about_ca_system_score_gemma":0.001343772,"threshold_uncertainty_score":0.27065188},"labels":[],"label_agreement":null},{"id":"W2618734637","doi":"","title":"System-of-systems approach to air transportation design using nested optimization and direct search","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Systems Engineering Methodologies and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; McGill University","funders":"","keywords":"Mathematical optimization; Sizing; Optimization problem; Computer science; Decomposition; Variable neighborhood search; National Airspace System; Variable (mathematics); Engineering; Aviation; Metaheuristic; Mathematics","score_opus":0.038427961597032254,"score_gpt":0.22977594220969044,"score_spread":0.19134798061265818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618734637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003343081,0.00026466345,0.9924258,0.00011311741,0.000028982271,0.00007352356,0.00003503218,0.00007864528,0.003637253],"genre_scores_gemma":[0.31372303,0.0008516004,0.67841756,0.0001657092,0.00010435592,0.0010661122,0.00019098204,0.0001243524,0.0053564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903667,0.0005412414,0.000035246583,0.000104307444,0.00022649177,0.000055984405],"domain_scores_gemma":[0.9983368,0.0012505483,0.00012560458,0.00005081121,0.00019085986,0.00004540878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019660671,0.0014078841,0.0014026806,0.00083811395,0.0005661365,0.0012833507,0.0014143048,0.0011371602,0.0040549194],"category_scores_gemma":[0.0033184746,0.0007562465,0.0013802273,0.00084377965,0.0012294117,0.0007703773,0.0016557777,0.0014776482,0.0003978735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011350235,0.000016577818,0.00013167012,0.00006239642,0.000025981344,0.000028569097,0.000032416992,0.9813005,0.00033090345,0.013087492,0.00016359473,0.004808486],"study_design_scores_gemma":[0.000006056254,0.000016678247,0.000024479014,0.000004961384,0.0000044704975,0.000004328527,0.0000063801986,0.9946163,0.00006859805,0.0047279536,0.0005174392,0.0000022566257],"about_ca_topic_score_codex":0.010457218,"about_ca_topic_score_gemma":0.010447773,"teacher_disagreement_score":0.010457218,"about_ca_system_score_codex":0.0010492037,"about_ca_system_score_gemma":0.002212925,"threshold_uncertainty_score":0.020792723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012313448427720653,"score_gpt":0.23387578125639197,"score_spread":0.22156233282867133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619681116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98952264,0.00007259578,0.005689355,0.00020619307,0.000015255815,0.00003166162,0.00082256424,0.00013180246,0.003508063],"genre_scores_gemma":[0.9962488,0.000033901826,0.0026436055,0.000016280163,0.0000024447077,0.000019800595,0.00046535904,0.000017571874,0.0005522908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998652,0.000031975378,0.000009857299,0.000030921747,0.00002575041,0.000036330526],"domain_scores_gemma":[0.9991473,0.00048879714,0.0000816452,0.000051736984,0.00015261582,0.00007800401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043925087,0.00045975097,0.0004556094,0.00043188792,0.00037244166,0.000840762,0.00094427087,0.0010453764,0.0014230047],"category_scores_gemma":[0.002307573,0.00031055306,0.00072223734,0.0005132515,0.0005956,0.00043729082,0.0006279399,0.0006205087,0.00011501242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043978423,0.000033098248,0.0074549164,0.000013623997,0.000014179042,0.000075941105,0.000036312784,0.9900122,0.0005715849,0.0005829068,0.00013800384,0.0010232513],"study_design_scores_gemma":[0.000014019202,0.0000094455345,0.0016230334,0.0000023440598,0.0000040458863,0.000006070156,0.00002307724,0.9978725,0.00017549633,0.00015991702,0.000106054926,0.000003984263],"about_ca_topic_score_codex":0.10870012,"about_ca_topic_score_gemma":0.057834223,"teacher_disagreement_score":0.10870012,"about_ca_system_score_codex":0.0011391286,"about_ca_system_score_gemma":0.00097040395,"threshold_uncertainty_score":0.21613485},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013903122429022762,"score_gpt":0.21879400676485564,"score_spread":0.20489088433583288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620856806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2001244,0.0048407214,0.7634468,0.0021900886,0.00034650878,0.00041236088,0.00079455687,0.00073737785,0.02710724],"genre_scores_gemma":[0.87165904,0.001834907,0.12019827,0.0003408236,0.00011164688,0.0004988282,0.0005042454,0.00015663532,0.0046955883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980647,0.0013456021,0.000066565364,0.00014656824,0.00019657958,0.00018008903],"domain_scores_gemma":[0.99161506,0.0071935346,0.00042582396,0.00016542186,0.00041510342,0.00018501404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043658214,0.0018155695,0.0018093506,0.0012498059,0.0004946827,0.0020230408,0.0016270671,0.0017994324,0.004296431],"category_scores_gemma":[0.0070920987,0.00077521184,0.0015703083,0.0011290401,0.00063065806,0.0016171157,0.00122837,0.002085057,0.00041355102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006947451,0.000052470026,0.00012705663,0.00003109126,0.000018787883,0.000006088484,0.000008179079,0.9948986,0.00003405149,0.0016431496,0.00012163702,0.0029893913],"study_design_scores_gemma":[0.000008174895,0.000032919226,0.000030074258,0.0000049939586,0.0000046682226,0.0000011770619,0.000006916077,0.9992198,0.000027495578,0.00058602856,0.00007577414,0.0000020058408],"about_ca_topic_score_codex":0.012632143,"about_ca_topic_score_gemma":0.009572822,"teacher_disagreement_score":0.012632143,"about_ca_system_score_codex":0.0022179182,"about_ca_system_score_gemma":0.0018077837,"threshold_uncertainty_score":0.025117218},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Clique; Variable neighborhood search; Heuristic; Mathematical optimization; Mathematics; Local search (optimization); Computer science; Metaheuristic; Combinatorics","score_opus":0.01734099212668329,"score_gpt":0.2219894169001398,"score_spread":0.20464842477345652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621333565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05689776,0.0003718746,0.9330272,0.00045829004,0.00004335438,0.00012045617,0.00018050514,0.00017545986,0.008725101],"genre_scores_gemma":[0.37686524,0.0004894388,0.61627233,0.0002583901,0.00007996639,0.00027180678,0.00089520245,0.0001829273,0.004684736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891853,0.0005891025,0.000023823683,0.00020738,0.00015771869,0.000103569975],"domain_scores_gemma":[0.99912053,0.00054964673,0.000075492826,0.00012226509,0.000073716335,0.00005828195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012305205,0.000691108,0.000934094,0.00047385655,0.00068428315,0.0009586708,0.0011388058,0.0013874209,0.0039707306],"category_scores_gemma":[0.002804748,0.00034788664,0.00073300616,0.0012321485,0.00073384587,0.0016671227,0.0012481182,0.0011016395,0.00047002753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000973385,0.00013630006,0.0010438033,0.0002851048,0.00009919312,0.00032508577,0.00021214927,0.78144807,0.0054459698,0.113625534,0.007124545,0.090156905],"study_design_scores_gemma":[0.0000465822,0.00008811645,0.00051277067,0.000031265998,0.000025090205,0.0002151763,0.00017160717,0.86778235,0.0017525001,0.12176686,0.0075891875,0.000018505158],"about_ca_topic_score_codex":0.0021779588,"about_ca_topic_score_gemma":0.003290844,"teacher_disagreement_score":0.0039707306,"about_ca_system_score_codex":0.0005890468,"about_ca_system_score_gemma":0.0010719447,"threshold_uncertainty_score":0.0132834315},"labels":[],"label_agreement":null},{"id":"W2621948318","doi":"","title":"Dynamic Modelling of Protein and Oxidative Metabolisms Simulates the Pathogenesis of Parkinson's Disease","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Parkinson's disease; In silico; Oxidative stress; Disease; Pathogenesis; Reactive oxygen species; Mechanism (biology); Neuroscience; Biological system; Computational biology; Bioinformatics; Biology; Medicine; Genetics; Biochemistry; Immunology; Pathology; Gene; Physics","score_opus":0.015217205342564977,"score_gpt":0.23376536909075463,"score_spread":0.21854816374818964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621948318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77485466,0.0008780968,0.18237235,0.0022031856,0.000310984,0.00010892148,0.0019090527,0.00043027507,0.036932487],"genre_scores_gemma":[0.9838213,0.00033730324,0.00824205,0.00011630748,0.0000365365,0.00012223318,0.00041232732,0.000045720175,0.006866148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999008,0.000033614935,0.0000059118856,0.00002272226,0.000016137375,0.000020821095],"domain_scores_gemma":[0.9996244,0.00021119622,0.000053768228,0.000022361626,0.000047666643,0.000040640458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002258845,0.00048561595,0.00074332487,0.00035954086,0.00041731872,0.0007925859,0.0006956586,0.0016505427,0.0030535315],"category_scores_gemma":[0.0010049399,0.00032094875,0.00086543127,0.00040383748,0.0006473273,0.00063745544,0.0006229607,0.00059784885,0.00023028199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024622012,0.000014299189,0.0004841318,0.000012449301,0.000011854523,0.0000418789,0.000017914517,0.99522036,0.00064918725,0.002848546,0.00014255299,0.00053215],"study_design_scores_gemma":[0.000011833026,0.000011209975,0.00024181734,0.0000024921235,0.000006091881,0.000008670414,0.0000074662353,0.9977527,0.000106124346,0.0015404061,0.00030706282,0.0000042188935],"about_ca_topic_score_codex":0.016777826,"about_ca_topic_score_gemma":0.007440491,"teacher_disagreement_score":0.016777826,"about_ca_system_score_codex":0.0006537632,"about_ca_system_score_gemma":0.00085380604,"threshold_uncertainty_score":0.033360302},"labels":[],"label_agreement":null},{"id":"W2622279009","doi":"","title":"The Maximum Return-on-investment Plant Location Problem with Market Share","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Royal Military College of Canada","funders":"","keywords":"Heuristics; Mathematical optimization; Tabu search; Extension (predicate logic); Simple (philosophy); Variable (mathematics); Mathematics; Computer science","score_opus":0.010058999731381945,"score_gpt":0.18322064504733562,"score_spread":0.17316164531595368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622279009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19164497,0.001383307,0.76377344,0.0023065156,0.00010718598,0.00047205074,0.0009576114,0.00035611098,0.03899864],"genre_scores_gemma":[0.861992,0.0010938488,0.122639224,0.00011982691,0.00010887653,0.00043453454,0.0005084828,0.000159647,0.012943487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988342,0.0006486085,0.00003521545,0.00016097988,0.00012584944,0.00019518191],"domain_scores_gemma":[0.99828374,0.0012515993,0.00018667617,0.00007307402,0.0000803579,0.00012462452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017247908,0.0013867664,0.0018543147,0.00080868485,0.0006890719,0.0021164042,0.00167738,0.0028936025,0.006560134],"category_scores_gemma":[0.0042915316,0.0006549447,0.0010011361,0.0017906203,0.0011916369,0.003234183,0.0012732192,0.0010555756,0.0005444605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017735807,0.00012390046,0.0005203317,0.00023451373,0.0000653244,0.00037069232,0.0000930003,0.900682,0.0012112701,0.072629735,0.0032323634,0.02065951],"study_design_scores_gemma":[0.00016622886,0.00025996083,0.00054395443,0.000052373758,0.00006139134,0.0003884284,0.00018316814,0.8794828,0.0016247188,0.11069071,0.006512655,0.00003363891],"about_ca_topic_score_codex":0.0028825717,"about_ca_topic_score_gemma":0.0029114916,"teacher_disagreement_score":0.006560134,"about_ca_system_score_codex":0.0017974166,"about_ca_system_score_gemma":0.0014636075,"threshold_uncertainty_score":0.021945894},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01683419893696322,"score_gpt":0.22551014217170268,"score_spread":0.20867594323473945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622363162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050948378,0.00031674653,0.94547874,0.000094089475,0.000021512918,0.00006205817,0.00006340394,0.00016967517,0.0028453711],"genre_scores_gemma":[0.46989933,0.00029353463,0.5257916,0.00012457577,0.000050723917,0.00030005389,0.0004934182,0.00013785218,0.0029089472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.0003534993,0.000024910702,0.00015642846,0.00011855829,0.00007978376],"domain_scores_gemma":[0.99949443,0.00028533614,0.000061873616,0.00007242152,0.000052277508,0.000033641227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012097872,0.0006971921,0.0011762629,0.0006490954,0.000592791,0.00061990693,0.0014534108,0.0010193309,0.0019939665],"category_scores_gemma":[0.0019818065,0.00033396386,0.0006385116,0.0011330141,0.0004936304,0.001384256,0.0013508346,0.00074248627,0.0003209154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013327802,0.00009051836,0.0010386729,0.00008026269,0.00006550337,0.000102121856,0.00009348805,0.9020341,0.0022134448,0.020364322,0.002063359,0.07172083],"study_design_scores_gemma":[0.000030190446,0.000054722546,0.00016872858,0.00000718109,0.000009766738,0.00004094412,0.000030885058,0.98511976,0.00049624406,0.013043392,0.0009925364,0.0000057144416],"about_ca_topic_score_codex":0.0015472037,"about_ca_topic_score_gemma":0.002309749,"teacher_disagreement_score":0.0019939665,"about_ca_system_score_codex":0.00047964096,"about_ca_system_score_gemma":0.00069541833,"threshold_uncertainty_score":0.0066704154},"labels":[],"label_agreement":null},{"id":"W2622626562","doi":"","title":"Territorial Intelligence Modelling for Energy Development (TIMED) - A Case Study for the Baie-des-Sables (Canada) Wind Farm","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wind power; Meteorology; Environmental science; Geography; Climatology; Engineering; Geology","score_opus":0.043027985577043654,"score_gpt":0.25063658630445573,"score_spread":0.20760860072741208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622626562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8712514,0.0002630198,0.076044686,0.00072534266,0.00002109156,0.0002096541,0.0007416152,0.00021436099,0.05052882],"genre_scores_gemma":[0.9649423,0.00017434993,0.024993394,0.000018985005,0.0000018177477,0.00005340027,0.0002569025,0.000034950153,0.009523969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998305,0.000058150526,0.000008068302,0.000025911311,0.00003570762,0.000041586736],"domain_scores_gemma":[0.9996494,0.00019265288,0.000020053289,0.000023571694,0.000078819605,0.000035586287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040412167,0.0003562273,0.00025529397,0.00040471656,0.0011341716,0.0018395361,0.00089614576,0.0008145692,0.002508671],"category_scores_gemma":[0.0010972688,0.00022150677,0.000447075,0.0010018641,0.0009685825,0.0007037752,0.00067367154,0.0005330403,0.00014279263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088127825,0.00008223972,0.011549774,0.00008538433,0.000028862745,0.0008287695,0.001520619,0.9326647,0.0010494918,0.033892993,0.0013641977,0.01684475],"study_design_scores_gemma":[0.00003167928,0.000041637104,0.0050250334,0.000036656413,0.000036543533,0.00010974069,0.0037663516,0.967946,0.00079368183,0.010029577,0.01215843,0.000024704223],"about_ca_topic_score_codex":0.7585549,"about_ca_topic_score_gemma":0.8527487,"teacher_disagreement_score":0.24144512,"about_ca_system_score_codex":0.0056932284,"about_ca_system_score_gemma":0.0058897203,"threshold_uncertainty_score":0.48573405},"labels":[],"label_agreement":null},{"id":"W2622701941","doi":"","title":"The Tube Challenge","year":2014,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Graph; Mathematical optimization; Computer science; Mathematics; Combinatorics; Operations research","score_opus":0.007399020629852008,"score_gpt":0.19636572500793276,"score_spread":0.18896670437808075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622701941","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1013421,0.0047120713,0.2492933,0.10589776,0.003441238,0.00048601924,0.0061155837,0.001421845,0.5272901],"genre_scores_gemma":[0.7239856,0.004466211,0.066735744,0.009713457,0.0020910373,0.00066221284,0.0065029413,0.00078224967,0.18506052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774903,0.0011087293,0.000066091096,0.00041940846,0.0003245281,0.00033220762],"domain_scores_gemma":[0.9950216,0.0031362737,0.00018942934,0.00040497858,0.00052839064,0.000719323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013710009,0.0007191532,0.0014158007,0.00048031803,0.0027361808,0.0039448314,0.0024167818,0.0044093304,0.049887843],"category_scores_gemma":[0.008293073,0.00034680316,0.0010958455,0.0014760675,0.0030040387,0.0071905055,0.0031249716,0.004450289,0.005935088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022235922,0.00011010761,0.00042650176,0.00025836492,0.000034010256,0.0002889616,0.00028557205,0.022745136,0.0003624672,0.7547845,0.18661743,0.033864614],"study_design_scores_gemma":[0.000087329616,0.00008722966,0.00032317126,0.00012476354,0.000019407295,0.00022388855,0.0007042021,0.050488062,0.00045729353,0.7747942,0.1726515,0.00003892054],"about_ca_topic_score_codex":0.005674047,"about_ca_topic_score_gemma":0.0051210024,"teacher_disagreement_score":0.049887843,"about_ca_system_score_codex":0.0023637074,"about_ca_system_score_gemma":0.0024338227,"threshold_uncertainty_score":0.16689146},"labels":[],"label_agreement":null},{"id":"W2623685577","doi":"","title":"A space-discretized mixed-integer linear model for air-conflict resolution with speed and heading maneuvers","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Discretization; Bottleneck; Acceleration; Heading (navigation); Mathematical optimization; Computer science; Space (punctuation); Integer (computer science); Control theory (sociology); Position (finance); Mathematics; Engineering; Mathematical analysis; Artificial intelligence; Aerospace engineering; Physics","score_opus":0.007849816493943194,"score_gpt":0.18683433981444325,"score_spread":0.17898452332050005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623685577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018892776,0.00056046963,0.9707225,0.0004632179,0.00012061655,0.00006488922,0.00026820146,0.00024299101,0.008664257],"genre_scores_gemma":[0.85865057,0.00057520677,0.12514666,0.0002579657,0.000069425434,0.0004979692,0.0004703791,0.00009266568,0.014239165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995054,0.00022142616,0.000021924641,0.00008256183,0.00009361246,0.00007504418],"domain_scores_gemma":[0.99913293,0.00059070135,0.00010067943,0.000024212815,0.00011398218,0.000037572747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008534596,0.0010541214,0.0011205113,0.0003510346,0.0004641586,0.001541316,0.0011103294,0.0016915689,0.0041149775],"category_scores_gemma":[0.0016351459,0.00062577776,0.0010120715,0.00059686013,0.0007579759,0.00079395715,0.0010061063,0.0019151816,0.0005550081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014301009,0.000009256384,0.00008927023,0.000020800782,0.000006211456,0.000019081173,0.000009661315,0.99635375,0.0001642031,0.001961297,0.00013720573,0.0012150476],"study_design_scores_gemma":[0.000003929576,0.0000070802425,0.000017993289,0.0000020879138,0.000001899054,0.0000019732654,0.0000029544524,0.9993266,0.000039386123,0.00043701156,0.0001575451,0.0000016236453],"about_ca_topic_score_codex":0.012323858,"about_ca_topic_score_gemma":0.008954612,"teacher_disagreement_score":0.012323858,"about_ca_system_score_codex":0.00089492253,"about_ca_system_score_gemma":0.0011465384,"threshold_uncertainty_score":0.024504244},"labels":[],"label_agreement":null},{"id":"W2624330451","doi":"","title":"Variable Neighborhood Search for Extremal Graphs: 5. Three Ways to Automate Finding Conjectures","year":2000,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Heuristic; Variable (mathematics); Mathematics; Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.024638150233571892,"score_gpt":0.2699066596012974,"score_spread":0.2452685093677255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624330451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.143517,0.0002735441,0.8405685,0.0007171194,0.000043594056,0.0001613658,0.00021469065,0.0025527007,0.011951489],"genre_scores_gemma":[0.45856836,0.00013604735,0.53666824,0.00014298737,0.00003634514,0.00017279606,0.00048019394,0.0003125519,0.0034824118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980798,0.00072042714,0.000094594194,0.00045345453,0.0004439022,0.00020785385],"domain_scores_gemma":[0.99393266,0.0029407346,0.00041242113,0.0020227425,0.00048615682,0.00020519143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023086327,0.00051900966,0.001143942,0.0016799802,0.0012205965,0.0024591754,0.0024526615,0.0011501482,0.0066719265],"category_scores_gemma":[0.007999769,0.00048757446,0.0009884844,0.001118736,0.002858212,0.0038270568,0.002944555,0.0011909747,0.0010254323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000825941,0.0003854118,0.02039731,0.00055382005,0.00014360779,0.0002387355,0.0011495665,0.06193022,0.01739655,0.644676,0.0061043235,0.24619853],"study_design_scores_gemma":[0.00016469251,0.00019992248,0.0027945507,0.00007830749,0.000061627485,0.00035278234,0.0004947293,0.4605485,0.02413275,0.50334215,0.0077447724,0.00008525121],"about_ca_topic_score_codex":0.0013593024,"about_ca_topic_score_gemma":0.0027394434,"teacher_disagreement_score":0.0066719265,"about_ca_system_score_codex":0.0008668086,"about_ca_system_score_gemma":0.001042975,"threshold_uncertainty_score":0.022319853},"labels":[],"label_agreement":null},{"id":"W2625384342","doi":"","title":"Algorithms for l 1 -Embeddability and Related Problems","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Heuristics; Constructive; Combinatorics; Tabu search; Variable (mathematics); Quadratic equation; Column generation; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Process (computing); Geometry","score_opus":0.01363005821147332,"score_gpt":0.23065202503526375,"score_spread":0.21702196682379044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625384342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012163906,0.00037815367,0.9806387,0.0005664618,0.000037836773,0.00012464204,0.00014877762,0.0013661034,0.004575365],"genre_scores_gemma":[0.12224796,0.00037323052,0.8711092,0.00022489272,0.00007340693,0.00031322875,0.0007715725,0.00041297096,0.0044735624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.0003617472,0.00006311929,0.0002386606,0.00022313118,0.00017655759],"domain_scores_gemma":[0.99581784,0.0030750784,0.00029704598,0.00045273156,0.0002521403,0.00010521783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015546564,0.0012951783,0.001243345,0.0015938112,0.0010550186,0.0018769322,0.002855551,0.0018257891,0.0105047375],"category_scores_gemma":[0.0072907545,0.0007601033,0.0013501201,0.002243517,0.0017219294,0.0035986567,0.0030384199,0.002284686,0.002124477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025400548,0.00034526532,0.0011280167,0.0005678268,0.0000674456,0.0001531584,0.00045941063,0.33445403,0.0031317389,0.20870131,0.01610717,0.4346306],"study_design_scores_gemma":[0.00015360904,0.00007124115,0.00017420732,0.000044813507,0.00002307457,0.000119936885,0.00013215585,0.7481284,0.002044361,0.24346067,0.0056258338,0.000021589985],"about_ca_topic_score_codex":0.002365011,"about_ca_topic_score_gemma":0.0038403485,"teacher_disagreement_score":0.0105047375,"about_ca_system_score_codex":0.0014983233,"about_ca_system_score_gemma":0.001072245,"threshold_uncertainty_score":0.035141885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02676783419656683,"score_gpt":0.2297629505321584,"score_spread":0.20299511633559156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625411102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004092523,0.00043084822,0.990728,0.00017834529,0.00007736235,0.000077401615,0.00009334743,0.00019252028,0.0041296156],"genre_scores_gemma":[0.26410708,0.0013191638,0.7259511,0.0005146278,0.00026148258,0.00070316327,0.00074688374,0.00027768363,0.0061189113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847645,0.0005967581,0.00007046697,0.0001820735,0.0005147772,0.00015946598],"domain_scores_gemma":[0.9971903,0.0018228415,0.00030765866,0.00024249763,0.00035378753,0.00008301315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023788805,0.0015703277,0.00096917787,0.0014281212,0.0006781359,0.0017112341,0.0012116313,0.0013102476,0.0072412463],"category_scores_gemma":[0.007931448,0.0006230462,0.0010918379,0.0018176975,0.0013637481,0.0015725543,0.0016955255,0.0037873841,0.0013421316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025144318,0.00016409255,0.0003774224,0.0003707378,0.000045841804,0.00019418,0.00014204087,0.63142896,0.008879194,0.24682276,0.008186663,0.103136666],"study_design_scores_gemma":[0.000038973027,0.000042267155,0.000067471134,0.000041149,0.000011470588,0.000042114898,0.000011650257,0.9445287,0.003281091,0.04864128,0.0032814262,0.0000124176],"about_ca_topic_score_codex":0.0012051562,"about_ca_topic_score_gemma":0.0011743244,"teacher_disagreement_score":0.0072412463,"about_ca_system_score_codex":0.0011603743,"about_ca_system_score_gemma":0.0010995833,"threshold_uncertainty_score":0.0242244},"labels":[],"label_agreement":null},{"id":"W2625873807","doi":"","title":"Dynamic R&D with Strategic Behavior","year":2004,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Microeconomics; Production (economics); Economics; Context (archaeology); Nash equilibrium; Order (exchange); Pareto principle; Investment (military); Function (biology); Welfare; Time horizon; Government (linguistics); Mathematical economics; Market economy; Finance; Operations management","score_opus":0.014896083619378346,"score_gpt":0.1907799318499778,"score_spread":0.17588384823059944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625873807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33294863,0.0007724384,0.6029335,0.0024461949,0.00008602254,0.00015359253,0.0006611993,0.00028812402,0.05971031],"genre_scores_gemma":[0.95767874,0.0003887267,0.027210569,0.00013497141,0.000022034588,0.0001530325,0.00014701056,0.000021066597,0.014243754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.00051434926,0.000037181886,0.00022513585,0.00017243912,0.000256441],"domain_scores_gemma":[0.9982247,0.0010221965,0.0003159724,0.00014699799,0.00011431523,0.00017580458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012721119,0.0010293905,0.0012788574,0.0007131202,0.00062917545,0.0026218886,0.001715386,0.002237094,0.00843309],"category_scores_gemma":[0.004165613,0.0006839764,0.0010669235,0.0010459756,0.0017387683,0.0025915587,0.0014576786,0.0012390009,0.00068737176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012007219,0.00008855458,0.00080049306,0.000058199326,0.000046640303,0.00028969094,0.000059182734,0.72274995,0.0010814369,0.2693796,0.00056904653,0.004757213],"study_design_scores_gemma":[0.00009990504,0.000060707272,0.00033933567,0.00001108133,0.000020003907,0.0000692973,0.000049080365,0.8497637,0.00035929406,0.14761157,0.0015937573,0.000022198165],"about_ca_topic_score_codex":0.0067118667,"about_ca_topic_score_gemma":0.004910042,"teacher_disagreement_score":0.00843309,"about_ca_system_score_codex":0.0021958726,"about_ca_system_score_gemma":0.0016130282,"threshold_uncertainty_score":0.028211534},"labels":[],"label_agreement":null},{"id":"W2626158319","doi":"","title":"A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algorithm; Variable neighborhood search; Heuristic; Computer science; Feature (linguistics); Optimization problem; Extremal optimization; Graph; Mathematics; Invariant (physics); Mathematical optimization; Theoretical computer science; Metaheuristic; Meta-optimization","score_opus":0.016419768284362,"score_gpt":0.2747208318595703,"score_spread":0.2583010635752083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626158319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001636469,0.00028458677,0.9959459,0.00012176147,0.000030859548,0.000040992236,0.000033313205,0.0003398128,0.0015662337],"genre_scores_gemma":[0.05692541,0.00038282978,0.93889034,0.00017987544,0.00009013809,0.00027971494,0.0002034525,0.00022656759,0.0028216618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919206,0.0003362683,0.000040979034,0.00017884505,0.00020675224,0.000045077886],"domain_scores_gemma":[0.9988348,0.00077819184,0.0000831009,0.00013152265,0.00013378201,0.000038532457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348874,0.0011580383,0.001323577,0.0014257032,0.00073142216,0.0010936981,0.0014864102,0.0015148578,0.003830727],"category_scores_gemma":[0.003977463,0.00070084806,0.0010881091,0.0017095146,0.0014989745,0.0016458671,0.0016939451,0.0021147693,0.0014062726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011557199,0.00012565863,0.000985383,0.0003068707,0.00017521738,0.000085123545,0.00013856053,0.48305112,0.0030206472,0.12891258,0.009078287,0.37400493],"study_design_scores_gemma":[0.000037634785,0.00006192685,0.00015501665,0.000030334104,0.000018152297,0.000053555566,0.00001436699,0.9157287,0.0009373728,0.0784408,0.00450784,0.00001430222],"about_ca_topic_score_codex":0.0018422488,"about_ca_topic_score_gemma":0.0020418318,"teacher_disagreement_score":0.003830727,"about_ca_system_score_codex":0.0008503825,"about_ca_system_score_gemma":0.0010966203,"threshold_uncertainty_score":0.012815058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007120415479881766,"score_gpt":0.21636412026788557,"score_spread":0.2092437047880038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626220413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092131376,0.00045435852,0.89401567,0.0003026126,0.000107224776,0.00023809874,0.00010400147,0.0015554175,0.011091238],"genre_scores_gemma":[0.6756056,0.000379783,0.31527433,0.00015647967,0.00013390071,0.00036560345,0.00022468332,0.00026254266,0.007597033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986733,0.0005774265,0.000100211335,0.0001781139,0.00028653792,0.00018437946],"domain_scores_gemma":[0.9977354,0.0013337531,0.00029722627,0.00042712668,0.000148619,0.00005786918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016488777,0.00055515603,0.00057011977,0.00085512624,0.00039682136,0.000978902,0.00094325695,0.00048732097,0.0050173323],"category_scores_gemma":[0.005662372,0.00031758842,0.0005198712,0.00062385225,0.0010965462,0.003543128,0.0009455983,0.00073492015,0.0017865816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057742425,0.0001160789,0.0013570437,0.00018149943,0.000037831283,0.00045935676,0.00046154467,0.043387976,0.02935065,0.7651371,0.0021864239,0.15674709],"study_design_scores_gemma":[0.00045325875,0.0010568646,0.00075304357,0.00020260249,0.0000756649,0.0014982631,0.00015011357,0.35357732,0.10482794,0.4940317,0.04317001,0.00020327349],"about_ca_topic_score_codex":0.00015215181,"about_ca_topic_score_gemma":0.0002722265,"teacher_disagreement_score":0.0050173323,"about_ca_system_score_codex":0.00053741876,"about_ca_system_score_gemma":0.00039223934,"threshold_uncertainty_score":0.016784668},"labels":[],"label_agreement":null},{"id":"W2626613082","doi":"","title":"Locomotive assignment under consist busting and maintenance constraints","year":2014,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Pacific Railway (Canada); Concordia University","funders":"","keywords":"Column generation; Train; Heuristics; Scalability; Decomposition; String (physics); Optimization problem; Computer science; Engineering; Mathematical optimization; Algorithm; Mathematics","score_opus":0.004225027175911758,"score_gpt":0.1605987540331355,"score_spread":0.15637372685722375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626613082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06445957,0.00017872831,0.9267231,0.00024841627,0.00004543106,0.000109974695,0.0005509144,0.00037081557,0.007312908],"genre_scores_gemma":[0.758197,0.00029927798,0.2309844,0.00015625915,0.000036959314,0.00023634448,0.0010679546,0.00016368854,0.008858097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.00012200591,0.00001019053,0.0000817022,0.0000723239,0.00007860739],"domain_scores_gemma":[0.99966407,0.00012893429,0.00007318037,0.00004077609,0.00004616141,0.00004688897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005331831,0.0008976049,0.0009573737,0.0005034709,0.00036062152,0.0010314805,0.0012476019,0.0010232037,0.00487694],"category_scores_gemma":[0.0009872594,0.00059522747,0.0007465521,0.0012739507,0.00046204918,0.0011173621,0.0007616121,0.0008667553,0.00049782003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026190386,0.00002435413,0.00032108923,0.000026844888,0.000010297652,0.00004132415,0.000011099695,0.98795706,0.00065025844,0.0035839637,0.0009825266,0.0063649747],"study_design_scores_gemma":[0.0000075958233,0.000020413401,0.00017275226,0.0000023722287,0.0000042611555,0.000015926336,0.000009827373,0.9974612,0.00018181899,0.0016032708,0.0005172443,0.000003334148],"about_ca_topic_score_codex":0.013351442,"about_ca_topic_score_gemma":0.0140597075,"teacher_disagreement_score":0.013351442,"about_ca_system_score_codex":0.0009852119,"about_ca_system_score_gemma":0.001193601,"threshold_uncertainty_score":0.026547432},"labels":[],"label_agreement":null},{"id":"W2641449783","doi":"","title":"A Time-Consistent Open-Loop Stackelberg Equilibrium of Shelf-Space Allocation","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Stackelberg competition; Goodwill; Product (mathematics); Microeconomics; Space (punctuation); Nash equilibrium; Economics; Mathematical economics; Business; Computer science; Mathematics","score_opus":0.015359749472307591,"score_gpt":0.22535384085658489,"score_spread":0.2099940913842773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2641449783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2700036,0.00027774178,0.70029986,0.0011329935,0.00008999009,0.00012539186,0.00033116053,0.00017122421,0.027568014],"genre_scores_gemma":[0.97132605,0.0002055493,0.019969618,0.000085532934,0.000023856473,0.00010689497,0.000059853577,0.0000150832275,0.008207585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00022885483,0.000026573243,0.00017458573,0.00012292607,0.00019556722],"domain_scores_gemma":[0.99880457,0.0006022794,0.0002593366,0.00004974863,0.00014360962,0.00014046779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011093629,0.00081890804,0.0012792837,0.0005642037,0.00080638635,0.0023210358,0.0016795243,0.0020156298,0.0058243927],"category_scores_gemma":[0.0038128651,0.00048344617,0.00097161316,0.0005117491,0.002083055,0.0026044385,0.0010964439,0.0010689114,0.0006027432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029927338,0.00015918209,0.0015587007,0.00013966633,0.0001121999,0.00057051395,0.00044043857,0.35277987,0.008670063,0.6240068,0.001894039,0.0093693],"study_design_scores_gemma":[0.000104934334,0.00013479337,0.00035904042,0.000013507859,0.000037262693,0.00009007709,0.00011627874,0.7982239,0.00088530796,0.19866435,0.001321655,0.000048828002],"about_ca_topic_score_codex":0.004669019,"about_ca_topic_score_gemma":0.003176345,"teacher_disagreement_score":0.0058243927,"about_ca_system_score_codex":0.0017616627,"about_ca_system_score_gemma":0.0015323003,"threshold_uncertainty_score":0.01948452},"labels":[],"label_agreement":null},{"id":"W2649134529","doi":"","title":"An Anytime Deduction Algorithm for the Probabilistic Logic and Entailment Problems","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Probabilistic logic; Logical consequence; Probabilistic argumentation; Consistency (knowledge bases); Range (aeronautics); Set (abstract data type); Algorithm; Computer science; Probabilistic CTL; Imprecise probability; Mathematics; Artificial intelligence; Theoretical computer science; Probabilistic analysis of algorithms; Probability distribution; Statistics; Programming language","score_opus":0.007834545499640567,"score_gpt":0.23277187697653298,"score_spread":0.2249373314768924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2649134529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033523482,0.00009518327,0.9943514,0.00013402732,0.00003052557,0.0000681396,0.000081750906,0.00073624117,0.0011503136],"genre_scores_gemma":[0.046642337,0.00010700439,0.9515881,0.00008995253,0.00005414657,0.00008846627,0.00026848668,0.000103265724,0.0010582504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998643,0.00032129377,0.0001152757,0.00030280466,0.00051738723,0.00010030544],"domain_scores_gemma":[0.99699795,0.0020454968,0.00014531042,0.0003691579,0.00036916495,0.00007293454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015516654,0.00092626264,0.000932856,0.0011199744,0.000857718,0.0018723585,0.0020414935,0.0009033952,0.005461719],"category_scores_gemma":[0.0069319583,0.00049714284,0.0016746058,0.0013261896,0.00089318986,0.003168903,0.0018667296,0.0023008576,0.0011054828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023556298,0.00027000371,0.00082538754,0.00054121285,0.0000907931,0.0002968769,0.00042249926,0.08159616,0.006130777,0.24587525,0.008689128,0.6550263],"study_design_scores_gemma":[0.00012278381,0.00010548429,0.00020400844,0.00004432941,0.000078579986,0.00035026722,0.00007563027,0.6423429,0.007671183,0.33694914,0.012024851,0.000030856587],"about_ca_topic_score_codex":0.0021268446,"about_ca_topic_score_gemma":0.0034787084,"teacher_disagreement_score":0.005461719,"about_ca_system_score_codex":0.0011511463,"about_ca_system_score_gemma":0.002046056,"threshold_uncertainty_score":0.018271267},"labels":[],"label_agreement":null},{"id":"W2652595374","doi":"","title":"An Enhanced Optimization Model for Scheduling Freight Trains","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Pacific Railway (Canada); Concordia University","funders":"","keywords":"Train; Schedule; Scalability; Scheduling (production processes); Computer science; Column generation; Freight trains; Track (disk drive); Mathematical optimization; Convergence (economics); Operations research; Engineering; Mathematics","score_opus":0.007685638485981742,"score_gpt":0.19071682088909567,"score_spread":0.18303118240311392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2652595374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010083569,0.00018329355,0.9836088,0.00017670981,0.000047023335,0.000070959046,0.00022509097,0.00022425472,0.005380348],"genre_scores_gemma":[0.53498363,0.00076374033,0.4411236,0.0002433228,0.00013635303,0.00059046893,0.00081234094,0.00022703833,0.02111949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994973,0.00014115237,0.000022579385,0.000118300966,0.00014397659,0.00007664703],"domain_scores_gemma":[0.9997011,0.00014248482,0.000046606667,0.00002485061,0.00005859947,0.000026328751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068983505,0.0010725913,0.0008700896,0.00039414028,0.00029114512,0.0012166423,0.001478292,0.001067288,0.005462538],"category_scores_gemma":[0.0012009105,0.00051488786,0.0007948281,0.00082257914,0.0004673726,0.001214421,0.00085585465,0.0015500328,0.0007636448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014194146,0.0000180424,0.00005320478,0.000020157873,0.000005931725,0.000019949663,0.0000096557715,0.9893925,0.00056593685,0.0058985357,0.0004753458,0.0035265812],"study_design_scores_gemma":[0.000005172614,0.000007107848,0.00001842319,0.0000012756439,0.0000018602894,0.0000033715057,0.0000018425694,0.998323,0.00008259371,0.0010465196,0.0005073872,0.0000013967327],"about_ca_topic_score_codex":0.010327807,"about_ca_topic_score_gemma":0.008737406,"teacher_disagreement_score":0.010327807,"about_ca_system_score_codex":0.0012120894,"about_ca_system_score_gemma":0.0016273778,"threshold_uncertainty_score":0.02053541},"labels":[],"label_agreement":null},{"id":"W2727324042","doi":"","title":"Deadlock Avoidance and Detection in Railway Simulation Systems","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"","keywords":"Deadlock prevention algorithms; Computer science; Reservation; Scheduling (production processes); Train; Distributed computing; Deadlock; Real-time computing; Algorithm; Mathematical optimization; Computer network; Mathematics; Geography","score_opus":0.003984293277856587,"score_gpt":0.16653566412140278,"score_spread":0.16255137084354618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727324042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0715118,0.00027625746,0.9245741,0.0001346713,0.000018970219,0.00007240348,0.000046863795,0.0011711314,0.0021938775],"genre_scores_gemma":[0.78674376,0.00021189552,0.21131305,0.000046997924,0.000011310426,0.00014676999,0.0001370579,0.000098325596,0.0012907548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740463,0.001405113,0.00019977226,0.0002983919,0.0005075182,0.00018466823],"domain_scores_gemma":[0.9940368,0.0043611536,0.0005551343,0.00045612355,0.00045098158,0.00013969386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003184958,0.0006795666,0.0007934017,0.0010883217,0.000683789,0.0012820538,0.0010338278,0.0006672849,0.0011417434],"category_scores_gemma":[0.009227173,0.0007313692,0.00088031223,0.00074237556,0.0017081845,0.0012162663,0.0016836887,0.0008663978,0.00015719565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001189426,0.000037610178,0.0022702932,0.00006629187,0.000042267555,0.00006528347,0.00016422705,0.94961905,0.0035714866,0.022794435,0.00019782792,0.021052305],"study_design_scores_gemma":[0.000009908109,0.000019215962,0.00009079104,0.0000054985394,0.0000065594863,0.00001285991,0.000011068653,0.9920351,0.0012609813,0.0061732135,0.0003689887,0.00000576805],"about_ca_topic_score_codex":0.006227203,"about_ca_topic_score_gemma":0.0033103814,"teacher_disagreement_score":0.006227203,"about_ca_system_score_codex":0.001159005,"about_ca_system_score_gemma":0.0015317111,"threshold_uncertainty_score":0.016843855},"labels":[],"label_agreement":null},{"id":"W2730102021","doi":"","title":"Multivariate Forests with Missing Mixed Outcomes","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Missing data; Multivariate statistics; Imputation (statistics); Multivariate analysis; Statistics; Random forest; Sample (material); Computer science; Econometrics; Mathematics; Artificial intelligence","score_opus":0.010695181670737778,"score_gpt":0.23141159970339228,"score_spread":0.22071641803265452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730102021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019670182,0.0002232154,0.9968076,0.00018099943,0.00006547311,0.000054617725,0.00018810735,0.0002646525,0.00024838455],"genre_scores_gemma":[0.07222264,0.0005564545,0.9223043,0.00034879133,0.0004678882,0.00066689396,0.001408918,0.00022941716,0.0017947708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98412293,0.011398694,0.00051479315,0.0018265776,0.0015740205,0.00056290516],"domain_scores_gemma":[0.96654093,0.025703708,0.0017440269,0.0033847752,0.0020160496,0.00061055867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02647805,0.0014563771,0.0028748726,0.0021648956,0.0017102723,0.0019225056,0.0049544065,0.0019421182,0.005347708],"category_scores_gemma":[0.04538996,0.0013714234,0.0037985004,0.0027835765,0.0012946707,0.0041149016,0.0030834635,0.0037492549,0.002018865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009488813,0.0003780524,0.010946887,0.0008292747,0.0012211348,0.0006395824,0.00060608814,0.23785846,0.0015019464,0.27051082,0.017607305,0.4569515],"study_design_scores_gemma":[0.00013811993,0.00007416259,0.001123246,0.00013152538,0.00013629705,0.00027331788,0.000058652167,0.6451746,0.0007150382,0.3452806,0.0068293842,0.00006508538],"about_ca_topic_score_codex":0.003171594,"about_ca_topic_score_gemma":0.0060122265,"teacher_disagreement_score":0.02647805,"about_ca_system_score_codex":0.00070915796,"about_ca_system_score_gemma":0.0020789742,"threshold_uncertainty_score":0.14003098},"labels":[],"label_agreement":null},{"id":"W2730291569","doi":"","title":"Solving Variational Inequalities with a Quadratic Cut Method: A Primal-Dual, Jacobian-Free Approach","year":2002,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Jacobian matrix and determinant; Variational inequality; Mathematics; Quadratic equation; Variety (cybernetics); Dual (grammatical number); Mathematical optimization; Applied mathematics; Variational analysis; Geometry","score_opus":0.060038660424786935,"score_gpt":0.3105596200361779,"score_spread":0.2505209596113909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730291569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010969366,0.00013015511,0.9971596,0.0001262273,0.000027349097,0.000016364254,0.000014712254,0.00003271011,0.0013959437],"genre_scores_gemma":[0.11846952,0.00056610873,0.8738127,0.00020604244,0.00020554275,0.00023105917,0.00013364466,0.00019118373,0.0061842273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989887,0.00037985243,0.000031283183,0.00012126881,0.00040420584,0.00007469937],"domain_scores_gemma":[0.9990157,0.0005659465,0.000064345484,0.00006568645,0.00021277844,0.000075578544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792076,0.0013547499,0.001312837,0.0012119423,0.0005456972,0.001535407,0.0018910951,0.0016470223,0.0036110412],"category_scores_gemma":[0.004118823,0.0008228786,0.00088363886,0.0011613031,0.001606138,0.0017458252,0.0023135582,0.003036846,0.00064907037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006330778,0.00010393942,0.00030396748,0.00018783807,0.00005798146,0.00009822334,0.00010681705,0.65599686,0.0018729958,0.2615101,0.0031478116,0.076550186],"study_design_scores_gemma":[0.00002330477,0.000028414523,0.00004012298,0.000013577539,0.000009224836,0.000024178835,0.00000739704,0.95981747,0.00039468548,0.037746992,0.0018865942,0.000007980278],"about_ca_topic_score_codex":0.002688245,"about_ca_topic_score_gemma":0.0023405442,"teacher_disagreement_score":0.0036110412,"about_ca_system_score_codex":0.0011033256,"about_ca_system_score_gemma":0.0016801346,"threshold_uncertainty_score":0.014766097},"labels":[],"label_agreement":null},{"id":"W2731138409","doi":"","title":"A new family of facet defining inequalities for the maximum edge-weighted clique problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Clique; Mathematics; Enhanced Data Rates for GSM Evolution; Clique problem; Facet (psychology); Combinatorics; Cutting-plane method; Polynomial; Discrete mathematics; Mathematical optimization; Computer science; Graph; Artificial intelligence; Chordal graph; Integer programming; 1-planar graph","score_opus":0.03173730701773475,"score_gpt":0.25760608253380635,"score_spread":0.2258687755160716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731138409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059823254,0.0003255471,0.9813545,0.00030254977,0.00009303033,0.0001183299,0.00033845552,0.000117783406,0.011367572],"genre_scores_gemma":[0.20106457,0.0019319091,0.7833402,0.000711384,0.00040854444,0.00066042563,0.0017780565,0.0003773291,0.009727557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759597,0.0005609585,0.00012582968,0.00041832795,0.0010022622,0.0002966736],"domain_scores_gemma":[0.9972957,0.001557111,0.00032270612,0.00021157795,0.00043975975,0.00017325216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021190734,0.0013550171,0.00087601173,0.0015505229,0.0010031138,0.0026861327,0.0016822129,0.0010922925,0.0053102905],"category_scores_gemma":[0.007006572,0.0005842831,0.0015439095,0.001992687,0.0012992438,0.0049044536,0.0018330546,0.0054680244,0.00066540326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012347806,0.00016462886,0.0018318684,0.00038815825,0.00010151703,0.00033533128,0.00042677377,0.09428998,0.010502098,0.7320567,0.01682606,0.14295349],"study_design_scores_gemma":[0.0000471937,0.00017785306,0.001284827,0.0001819245,0.00006429455,0.00073144434,0.00026484756,0.5357656,0.0063529355,0.39892974,0.056112513,0.00008677692],"about_ca_topic_score_codex":0.0024746424,"about_ca_topic_score_gemma":0.0028956227,"teacher_disagreement_score":0.0053102905,"about_ca_system_score_codex":0.0014833714,"about_ca_system_score_gemma":0.0012477344,"threshold_uncertainty_score":0.017764688},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Transport engineering; Computer science; Engineering","score_opus":0.005411153842116133,"score_gpt":0.1513943057377581,"score_spread":0.14598315189564198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735767489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74320734,0.0001594093,0.002212973,0.0039474545,0.00036135962,0.0003722655,0.0046343133,0.0011492299,0.24395567],"genre_scores_gemma":[0.45142558,0.00008632671,0.0007173484,0.00024050985,0.00003292219,0.00002186285,0.0011419174,0.00013903363,0.54619443],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991812,0.00004582688,0.000010547231,0.0001087256,0.00018356364,0.00047001656],"domain_scores_gemma":[0.9988117,0.000044342072,0.00002793189,0.000039987164,0.0006491663,0.00042682554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035830378,0.00031318353,0.0002052921,0.0013337942,0.0065510655,0.0018469917,0.0006670122,0.0011275816,0.07450509],"category_scores_gemma":[0.0010308258,0.00029072104,0.00017059944,0.0011838417,0.0005894745,0.00056425884,0.00072018406,0.000989196,0.007585841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017901316,0.0012147734,0.20465116,0.00012495548,0.000049438404,0.0023878482,0.00878112,0.025815623,0.016643586,0.0201194,0.39517704,0.32324493],"study_design_scores_gemma":[0.000072447845,0.00057129166,0.32398632,0.000050150476,0.000025133022,0.0002345123,0.014996984,0.011342207,0.0049324143,0.001104398,0.6425758,0.00010826142],"about_ca_topic_score_codex":0.9264335,"about_ca_topic_score_gemma":0.97273916,"teacher_disagreement_score":0.07450509,"about_ca_system_score_codex":0.018468764,"about_ca_system_score_gemma":0.025445487,"threshold_uncertainty_score":0.24924433},"labels":[],"label_agreement":null},{"id":"W2736725188","doi":"","title":"Ambulance Location and Relocation Models","year":2000,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Relocation; Queueing theory; Computer science; Server; Probabilistic logic; Operations research; Stochastic modelling; Engineering; Computer network; Artificial intelligence; Mathematics; Statistics","score_opus":0.012835436512033204,"score_gpt":0.18391782099249318,"score_spread":0.17108238448045998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736725188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15439852,0.010181062,0.7093402,0.007605458,0.00084918144,0.00042913522,0.006433684,0.0012327499,0.10953001],"genre_scores_gemma":[0.84457713,0.0078420695,0.07266448,0.0005575771,0.00043248918,0.00036941216,0.0035452496,0.00017774526,0.06983385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982705,0.00047687712,0.00008231682,0.0004126715,0.00040053582,0.00035704527],"domain_scores_gemma":[0.9984459,0.00049759966,0.00037511034,0.00016427273,0.000352594,0.00016450365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012359193,0.0010829696,0.0008816091,0.001200854,0.00090832304,0.0034932357,0.004936411,0.0025303324,0.008276039],"category_scores_gemma":[0.00414498,0.0007063234,0.0008767767,0.0025779612,0.0011545302,0.0034450362,0.0017973541,0.0019133021,0.0031044923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062458654,0.000048765287,0.0016830828,0.000064431595,0.0000379345,0.00020183565,0.00020992168,0.8266101,0.00028708085,0.14973317,0.0056030396,0.0154581],"study_design_scores_gemma":[0.00004645458,0.00007635771,0.0011567104,0.00006122445,0.00004997342,0.00034584675,0.00019914987,0.90936065,0.00028715757,0.054270837,0.034076646,0.00006896904],"about_ca_topic_score_codex":0.0252406,"about_ca_topic_score_gemma":0.014785289,"teacher_disagreement_score":0.0252406,"about_ca_system_score_codex":0.0024996437,"about_ca_system_score_gemma":0.0019418186,"threshold_uncertainty_score":0.05018735},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Probabilistic logic; Satisfiability; Consistency (knowledge bases); Mathematics; Logical consequence; Set (abstract data type); Mathematical optimization; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.02820314155902571,"score_gpt":0.21046074507494203,"score_spread":0.18225760351591633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736770525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039315713,0.0005938121,0.9880592,0.000775085,0.000028798122,0.000068985464,0.000049488135,0.00052139274,0.005971712],"genre_scores_gemma":[0.15112723,0.0011834594,0.84140074,0.0008719698,0.00015666467,0.00037228322,0.00029842873,0.00052041555,0.004068864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899698,0.0050877933,0.00050216995,0.0013682018,0.00257161,0.00050045573],"domain_scores_gemma":[0.9861267,0.0069323936,0.0005640962,0.004648207,0.0014018085,0.00032668468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007041012,0.0015124666,0.0020594343,0.0028308495,0.0011107197,0.004962379,0.0043828962,0.002138202,0.0069582155],"category_scores_gemma":[0.017882146,0.0014435992,0.0022619814,0.0030618694,0.004982272,0.010596878,0.008487454,0.006854076,0.0014533631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014783505,0.00019695301,0.0010739552,0.0006627125,0.00026290736,0.00023069991,0.0013994873,0.06718393,0.0054480266,0.58910537,0.0048845834,0.32940352],"study_design_scores_gemma":[0.000056872574,0.00016738991,0.00049793953,0.00015220021,0.00021668372,0.00020725696,0.0004274394,0.27016884,0.008409276,0.70363224,0.015979588,0.000084240884],"about_ca_topic_score_codex":0.0017626456,"about_ca_topic_score_gemma":0.006039628,"teacher_disagreement_score":0.007041012,"about_ca_system_score_codex":0.0019487288,"about_ca_system_score_gemma":0.0027552382,"threshold_uncertainty_score":0.03723687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.018417143726199722,"score_gpt":0.24256187666005355,"score_spread":0.22414473293385384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737156094","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07001761,0.6895352,0.14569771,0.005455012,0.0012037713,0.000059596765,0.0005660575,0.0002784506,0.08718662],"genre_scores_gemma":[0.50789034,0.42870662,0.047876522,0.0014889032,0.004882903,0.00009250749,0.0007646272,0.00021093809,0.008086684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988236,0.00024632885,0.00007123912,0.0003781896,0.00038342638,0.000097321004],"domain_scores_gemma":[0.9972367,0.001827122,0.00017904626,0.00020299903,0.00040398634,0.0001501837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008654456,0.000833382,0.0010523144,0.0055946293,0.00087676325,0.002648034,0.0012742176,0.0012855326,0.0037657355],"category_scores_gemma":[0.0036811016,0.00066826626,0.00067154656,0.006561927,0.0020447487,0.0048564123,0.0018478639,0.0019671537,0.001138912],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007305443,0.00014790398,0.0023091482,0.0025153763,0.00008854384,0.00028371738,0.00058578275,0.010614305,0.002101938,0.7113343,0.011061291,0.2588847],"study_design_scores_gemma":[0.000019732024,0.000102505204,0.0022502576,0.00060305704,0.00003654176,0.0017020479,0.00041274753,0.01990431,0.0013132367,0.8258314,0.14776763,0.000056520505],"about_ca_topic_score_codex":0.0010701403,"about_ca_topic_score_gemma":0.00041856163,"teacher_disagreement_score":0.0055946293,"about_ca_system_score_codex":0.0015296158,"about_ca_system_score_gemma":0.0006275893,"threshold_uncertainty_score":0.0125976205},"labels":[],"label_agreement":null},{"id":"W2737290634","doi":"","title":"A Sharp Upper Bound on Algebraic Connectivity Using Domination Number","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Domination analysis; Algebraic connectivity; Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Upper and lower bounds; Connectivity; Algebraic number; Laplacian matrix; Discrete mathematics; Graph; Eigenvalues and eigenvectors","score_opus":0.027318605387957516,"score_gpt":0.30346227195819375,"score_spread":0.27614366657023626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737290634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30895758,0.01613662,0.5449132,0.007294226,0.00061951444,0.00017308137,0.0012033597,0.0010296798,0.1196728],"genre_scores_gemma":[0.95049715,0.005310534,0.03748847,0.00082537223,0.00076772756,0.00017632388,0.00041464405,0.00017688997,0.004342802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792814,0.0004617722,0.00007088418,0.00051196996,0.0005966181,0.0004305933],"domain_scores_gemma":[0.9793393,0.016491689,0.0012142356,0.0009193396,0.0009909353,0.0010444968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018651311,0.001794752,0.0015437528,0.00432826,0.0016001428,0.0030987272,0.0020997329,0.0016241148,0.0055979807],"category_scores_gemma":[0.021109598,0.00080712396,0.0011104409,0.0026617507,0.0041514174,0.0074241087,0.0039833332,0.00403909,0.00067883485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036098447,0.00011964257,0.0042937505,0.00069340254,0.00014617747,0.00089413516,0.0006649422,0.062196176,0.016523585,0.86278534,0.0091623245,0.04215958],"study_design_scores_gemma":[0.000042798863,0.00019156204,0.0034534861,0.00028871812,0.00013811613,0.0014550345,0.00023100337,0.16339734,0.006110788,0.8125487,0.0120253805,0.0001170726],"about_ca_topic_score_codex":0.0007516218,"about_ca_topic_score_gemma":0.00097152893,"teacher_disagreement_score":0.0055979807,"about_ca_system_score_codex":0.0017919128,"about_ca_system_score_gemma":0.00044884026,"threshold_uncertainty_score":0.018727124},"labels":[],"label_agreement":null},{"id":"W2737342012","doi":"","title":"Numerical investigation of non-hierarchical coordination for distributed multidisciplinary design optimization with fixed computational budget","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada); McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; MATLAB; Computer science; Convergence (economics); Augmented Lagrangian method; Optimization problem; Consistency (knowledge bases); Mathematics; Algorithm","score_opus":0.01947192149283435,"score_gpt":0.2563932753391899,"score_spread":0.23692135384635551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737342012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4307697,0.0005827655,0.5293765,0.0008476103,0.00007940002,0.00027666352,0.00021496807,0.00037258025,0.037479788],"genre_scores_gemma":[0.93418807,0.00010534887,0.06373572,0.000047777623,0.000009254795,0.00017052745,0.000056155044,0.00003655215,0.0016506098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.0002384524,0.000018730852,0.00006200378,0.00012943888,0.00007841212],"domain_scores_gemma":[0.9974246,0.0017946373,0.00027262905,0.00016236461,0.00021102128,0.00013469257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872807,0.0006113452,0.00076208985,0.00058721437,0.00059244706,0.0009498517,0.00083701505,0.0012964866,0.002414091],"category_scores_gemma":[0.004809216,0.0002862929,0.00048136536,0.0005817525,0.0009964544,0.0006183069,0.0012504179,0.000879008,0.00018185713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029392748,0.000022670432,0.00041073526,0.000028556378,0.0000062628656,0.00003713385,0.000018938423,0.994695,0.00041568864,0.0025682757,0.00009208964,0.0016751653],"study_design_scores_gemma":[0.000010106303,0.000019713592,0.00008190717,0.0000034225932,0.0000022981776,0.000004360056,0.000014893333,0.9989864,0.00018726617,0.0005634648,0.00012455987,0.0000015879103],"about_ca_topic_score_codex":0.0076687876,"about_ca_topic_score_gemma":0.005870771,"teacher_disagreement_score":0.0076687876,"about_ca_system_score_codex":0.00092285516,"about_ca_system_score_gemma":0.0013223328,"threshold_uncertainty_score":0.015248299},"labels":[],"label_agreement":null},{"id":"W2737902914","doi":"","title":"Proximity and Remoteness in Graphs: Results and Conjectures","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Independence number; Upper and lower bounds; Graph; Matching (statistics); Discrete mathematics; Statistics","score_opus":0.01002575101590103,"score_gpt":0.24838504648810705,"score_spread":0.23835929547220602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737902914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50044745,0.03597967,0.37364239,0.01525753,0.000495338,0.000098354976,0.0008718103,0.0009462906,0.072261155],"genre_scores_gemma":[0.96129555,0.008468056,0.022516739,0.0006841774,0.0019666038,0.00009604733,0.00041766482,0.00021920302,0.004335944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99490416,0.0012852539,0.00029060594,0.001770773,0.0012867115,0.00046254208],"domain_scores_gemma":[0.9191145,0.06559654,0.0054501393,0.005137898,0.0019001286,0.0028007783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053289817,0.0011922499,0.002161894,0.005119426,0.002504628,0.0053589786,0.003319811,0.0028607135,0.0070234286],"category_scores_gemma":[0.04703071,0.0012147571,0.001454547,0.006086016,0.009123951,0.024468798,0.005631442,0.005225368,0.001240725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082213106,0.00032075806,0.010084504,0.0012177286,0.00011931851,0.0005237303,0.0029274328,0.03950134,0.0039267675,0.8773983,0.0056943037,0.05746369],"study_design_scores_gemma":[0.000041042655,0.00017933092,0.003605695,0.00012811826,0.00006829208,0.0006126835,0.00068497064,0.031665895,0.0015338012,0.9563824,0.0050501875,0.000047517868],"about_ca_topic_score_codex":0.0011373038,"about_ca_topic_score_gemma":0.0006125511,"teacher_disagreement_score":0.0070234286,"about_ca_system_score_codex":0.0021918193,"about_ca_system_score_gemma":0.0005387453,"threshold_uncertainty_score":0.028182685},"labels":[],"label_agreement":null},{"id":"W2737990324","doi":"","title":"Pricing strategies of complementary products in distribution channels: A dynamic approach","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Product (mathematics); Business; Dynamic pricing; Channel (broadcasting); Microeconomics; Margin (machine learning); Transfer pricing; Differential game; Industrial organization; Pricing strategies; Differential (mechanical device); Marketing; Economics; Computer science; Mathematics","score_opus":0.03478521967888057,"score_gpt":0.22030542936947387,"score_spread":0.1855202096905933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737990324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6985817,0.0006591831,0.2751775,0.0009174973,0.00004934438,0.00021731998,0.00018215866,0.00008391609,0.024131423],"genre_scores_gemma":[0.98860556,0.00016476559,0.006844902,0.00003881867,0.000021405245,0.000045043504,0.000027687425,0.000011518074,0.004240222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.00059268944,0.00003127902,0.00018049135,0.00019029282,0.00039501966],"domain_scores_gemma":[0.99392444,0.0042430595,0.00079813466,0.00018320578,0.00035829266,0.0004928813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020505337,0.0007449229,0.0013214892,0.0016653198,0.00079554145,0.0031972013,0.0017763798,0.0018694958,0.006589422],"category_scores_gemma":[0.008146503,0.0008755474,0.00119753,0.0008279087,0.0024739737,0.0040915213,0.00164914,0.0013120833,0.00036206227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002888084,0.0002515076,0.004381683,0.0001240491,0.00009602258,0.0005835548,0.00033004995,0.8021535,0.0029421917,0.17307474,0.0010924584,0.014681321],"study_design_scores_gemma":[0.00003085768,0.000074231146,0.00083815464,0.000010713741,0.000028782331,0.000102243284,0.00021703131,0.9549384,0.000331431,0.042516574,0.0008805319,0.00003089652],"about_ca_topic_score_codex":0.0045860377,"about_ca_topic_score_gemma":0.0028284881,"teacher_disagreement_score":0.006589422,"about_ca_system_score_codex":0.002789637,"about_ca_system_score_gemma":0.0011672259,"threshold_uncertainty_score":0.022043765},"labels":[],"label_agreement":null},{"id":"W2738316842","doi":"","title":"Résolution numérique de problèmes de complémentarité linéaire et évaluation d'options américaines","year":2002,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Linear complementarity problem; Valuation (finance); Mathematics; Discretization; Mathematical optimization; Complementarity theory; Mixed complementarity problem; Complementarity (molecular biology); Applied mathematics; Computer science; Algorithm; Nonlinear system; Economics; Finance; Mathematical analysis; Physics","score_opus":0.035754904458440116,"score_gpt":0.23139113703065484,"score_spread":0.1956362325722147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738316842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1180717,0.00054547004,0.87110245,0.0012210348,0.00010272103,0.00009864276,0.00009921336,0.00025917424,0.008499597],"genre_scores_gemma":[0.7120336,0.00035903152,0.27975088,0.00016209106,0.00012209515,0.00025202453,0.0001881055,0.000152114,0.0069800117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804544,0.0012022151,0.000044425386,0.0001783768,0.00035779978,0.00017179803],"domain_scores_gemma":[0.98842645,0.009705651,0.00031607144,0.00025196865,0.00095931155,0.00034058763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005025375,0.0010627932,0.0016604933,0.0012284325,0.00084825495,0.0035837146,0.0010627599,0.0028721127,0.0037287753],"category_scores_gemma":[0.01743041,0.00047119477,0.0008589485,0.0010688681,0.0027958187,0.0015788354,0.0016679117,0.0040752087,0.00035338133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020520111,0.0000909552,0.0008776921,0.000108877925,0.000041282932,0.00012418299,0.00017097665,0.89892393,0.0017673046,0.07785702,0.0009802293,0.018852325],"study_design_scores_gemma":[0.00001738724,0.000008856024,0.00006105646,0.0000056794443,0.0000014025889,0.000008903106,0.000013570361,0.99444616,0.00045222847,0.004711262,0.00027026326,0.0000032284547],"about_ca_topic_score_codex":0.022034572,"about_ca_topic_score_gemma":0.008682111,"teacher_disagreement_score":0.022034572,"about_ca_system_score_codex":0.0024971291,"about_ca_system_score_gemma":0.001976262,"threshold_uncertainty_score":0.043812633},"labels":[],"label_agreement":null},{"id":"W2739351832","doi":"","title":"A Survey of Automated Conjectures in Spectral Graph Theory","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Graph; Computer science; Graph theory; Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.02045557587740854,"score_gpt":0.2840638379587068,"score_spread":0.2636082620812983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739351832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079133175,0.2002392,0.5034027,0.03618851,0.0036335944,0.00029119442,0.0020288036,0.0033629283,0.17171991],"genre_scores_gemma":[0.6273864,0.17723884,0.15657577,0.005391524,0.012947636,0.0004406544,0.0050499337,0.0013569201,0.013612254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9916741,0.0030873867,0.0004832906,0.0015119154,0.002895966,0.00034736976],"domain_scores_gemma":[0.9440767,0.042107627,0.0013759747,0.0067833792,0.0051341476,0.0005220741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009315353,0.0012944309,0.0018910007,0.007977754,0.0026572517,0.005370879,0.0035120558,0.0024990814,0.013092867],"category_scores_gemma":[0.036080774,0.0013498039,0.0013686637,0.010171789,0.009151098,0.016650824,0.0041370923,0.0042895516,0.0036449945],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012718521,0.00033961496,0.0033423144,0.0029926316,0.0000756895,0.0002622432,0.0006965201,0.006554461,0.00074690895,0.72642326,0.033488028,0.22495109],"study_design_scores_gemma":[0.000046209254,0.00008328643,0.0015931797,0.00119669,0.000038895138,0.00044733612,0.00033732728,0.01844841,0.0016454402,0.8813261,0.09476708,0.0000700023],"about_ca_topic_score_codex":0.0015050748,"about_ca_topic_score_gemma":0.0007949167,"teacher_disagreement_score":0.013092867,"about_ca_system_score_codex":0.0028589172,"about_ca_system_score_gemma":0.0025790378,"threshold_uncertainty_score":0.049264908},"labels":[],"label_agreement":null},{"id":"W2739676197","doi":"","title":"Bounds and Conjectures for the Signless Laplacian Index of Graphs","year":2009,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Domination analysis; Vertex (graph theory); Upper and lower bounds; Clique number; Spectral radius; Algebraic number; Laplace operator; Graph; Connectivity; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.016318487520812774,"score_gpt":0.27137224616983896,"score_spread":0.2550537586490262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739676197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8812817,0.00080028415,0.07126852,0.001958875,0.000097186086,0.000030318652,0.00038156615,0.0003536433,0.043827947],"genre_scores_gemma":[0.9933454,0.00013704869,0.0050732885,0.00007222462,0.00008077895,0.000016834341,0.00014986467,0.000022961043,0.0011016825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984819,0.00036070633,0.00007972746,0.00036006945,0.00051705126,0.00020051091],"domain_scores_gemma":[0.9852668,0.009677416,0.0016030478,0.0018652515,0.0010323655,0.0005551379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025132953,0.0003980341,0.00058622425,0.0024719622,0.0012004726,0.0023670911,0.0010504539,0.0007088083,0.0048358403],"category_scores_gemma":[0.013876223,0.00026501188,0.00048508047,0.0014353162,0.0040109274,0.0038428502,0.001416549,0.001576654,0.00038508605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039038286,0.0001685073,0.01778138,0.00018036415,0.00003234288,0.00021590304,0.0008254339,0.028455168,0.005875335,0.91295576,0.0037687463,0.02935067],"study_design_scores_gemma":[0.000049387392,0.0001555751,0.0042089727,0.000040979292,0.00002443541,0.00028158815,0.0004060196,0.076774545,0.005899713,0.9090303,0.0030892864,0.000039063096],"about_ca_topic_score_codex":0.00052185013,"about_ca_topic_score_gemma":0.0007450595,"teacher_disagreement_score":0.0048358403,"about_ca_system_score_codex":0.0012155431,"about_ca_system_score_gemma":0.00050247053,"threshold_uncertainty_score":0.016177535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005442328154904626,"score_gpt":0.19132459760863058,"score_spread":0.18588226945372596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740520909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021861143,0.0016640703,0.9528912,0.0016122478,0.00036164696,0.00023335335,0.0004592527,0.0001912514,0.020725872],"genre_scores_gemma":[0.5214877,0.004833604,0.4563423,0.0006804222,0.0015787176,0.00066197047,0.0015662244,0.0002857755,0.012563244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570495,0.002271385,0.00027104886,0.0005777635,0.00083131634,0.00034344784],"domain_scores_gemma":[0.99404645,0.0042491346,0.00045120707,0.00067322305,0.00036219668,0.00021769066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049615176,0.0013627309,0.0015646517,0.00078725733,0.0014864214,0.0025783095,0.0013528939,0.001542313,0.006724938],"category_scores_gemma":[0.013710283,0.00056338904,0.0017421203,0.0018664153,0.0023203802,0.00338712,0.002004535,0.0035672956,0.0014927919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013046927,0.00009498597,0.00068822317,0.0002921182,0.00006581614,0.00019077887,0.00019068683,0.13330969,0.0009786802,0.8067471,0.007817806,0.04949359],"study_design_scores_gemma":[0.00006538157,0.000054867684,0.00011972597,0.000029420025,0.000013594362,0.00009881421,0.000052497497,0.14085391,0.0004544151,0.8496989,0.008545389,0.000013031472],"about_ca_topic_score_codex":0.0015893105,"about_ca_topic_score_gemma":0.0009378966,"teacher_disagreement_score":0.006724938,"about_ca_system_score_codex":0.00131738,"about_ca_system_score_gemma":0.0021125537,"threshold_uncertainty_score":0.026239336},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Center (category theory); Goodness of fit; Call management; Variance (accounting); Statistics; Mathematics; Telecommunications; Call control","score_opus":0.010358602340037439,"score_gpt":0.21447263293982255,"score_spread":0.2041140305997851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741500941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5824428,0.00034121372,0.41014934,0.0010813109,0.00009553221,0.00013529367,0.0008299737,0.0005229551,0.00440161],"genre_scores_gemma":[0.97386307,0.0003039651,0.022077983,0.00008601821,0.000083839645,0.00012677678,0.0004955887,0.000052212996,0.0029106382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986498,0.0005481202,0.000062417595,0.0002448154,0.0002573031,0.00023763422],"domain_scores_gemma":[0.99449277,0.0032721877,0.001027361,0.00032030288,0.0006195375,0.00026781458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022803436,0.00082784094,0.00077947864,0.0009771911,0.0006158063,0.0019282785,0.002277791,0.0023293542,0.002244641],"category_scores_gemma":[0.011369511,0.00075892097,0.00069300085,0.0016004628,0.00074412004,0.0020179246,0.0008892844,0.0019834954,0.0004898132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044978708,0.00006577946,0.004159287,0.000018328556,0.000027012651,0.000067344445,0.00016116898,0.9768983,0.0005263117,0.01408238,0.0005160433,0.0034330504],"study_design_scores_gemma":[0.000006185771,0.00001432192,0.0005033918,0.0000019953227,0.0000041250237,0.00001088934,0.000022432765,0.99693644,0.00006299446,0.0022378643,0.0001918768,0.0000075603552],"about_ca_topic_score_codex":0.023649525,"about_ca_topic_score_gemma":0.016130306,"teacher_disagreement_score":0.023649525,"about_ca_system_score_codex":0.0020506636,"about_ca_system_score_gemma":0.0013725446,"threshold_uncertainty_score":0.047023714},"labels":[],"label_agreement":null},{"id":"W2741988167","doi":"","title":"Recherche à voisinage variable de graphes extrémaux. 13. À propos de la maille","year":2005,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Humanities; Mathematics; Combinatorics; Philosophy","score_opus":0.04135848229991372,"score_gpt":0.3075989000990868,"score_spread":0.26624041779917307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741988167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27437767,0.00803434,0.5450256,0.004939585,0.0012705991,0.00019362048,0.0028844073,0.0019643067,0.16130976],"genre_scores_gemma":[0.71765876,0.0026581471,0.17055903,0.0012873269,0.0007381893,0.00030726634,0.0037488847,0.0008674785,0.10217484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988096,0.00033968198,0.000035703593,0.00044092155,0.00026408973,0.00011004552],"domain_scores_gemma":[0.99705374,0.0018184355,0.00022903195,0.00034658352,0.00042437378,0.00012791925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017371958,0.00082020985,0.0007932187,0.0019946215,0.0013815383,0.0027238633,0.0010432672,0.0011641113,0.016202621],"category_scores_gemma":[0.0057412544,0.0006624796,0.0009939333,0.0012467323,0.0018559023,0.0031463576,0.0012335423,0.0030112425,0.0028937457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027939762,0.00009029027,0.005332715,0.0005041224,0.00010553063,0.00019532406,0.00058311713,0.016041579,0.009012484,0.8747914,0.017019486,0.07604457],"study_design_scores_gemma":[0.0001380295,0.00025515814,0.0073420997,0.00018440414,0.00010569311,0.000718302,0.00051054533,0.11231888,0.023550948,0.7601517,0.09463215,0.00009207022],"about_ca_topic_score_codex":0.0033068734,"about_ca_topic_score_gemma":0.004711323,"teacher_disagreement_score":0.016202621,"about_ca_system_score_codex":0.0023928815,"about_ca_system_score_gemma":0.001013265,"threshold_uncertainty_score":0.054203212},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"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","score_opus":0.02842779412637151,"score_gpt":0.26189771106823284,"score_spread":0.23346991694186134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742471139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018871535,0.02556858,0.95838404,0.00079625985,0.00031233727,0.00006051926,0.00059053494,0.0007083578,0.011692225],"genre_scores_gemma":[0.08634505,0.1006391,0.77814317,0.000673637,0.0010348648,0.0006282105,0.003027836,0.00086946203,0.02863866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.00014436306,0.00004786199,0.00012412241,0.00017704471,0.00003996049],"domain_scores_gemma":[0.9995432,0.00024539526,0.000054614222,0.000062946485,0.0000785519,0.000015375601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069513044,0.0017907941,0.0013637091,0.0010305243,0.00044020134,0.0016075355,0.0020688765,0.0014989126,0.0067781857],"category_scores_gemma":[0.0017883828,0.0010020531,0.0015461147,0.0028335925,0.00048658715,0.002084228,0.00062884303,0.001689433,0.0036736312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049212882,0.0001372981,0.0007043232,0.00094644225,0.00010093698,0.00007456075,0.00009065042,0.5024253,0.001444766,0.11025447,0.051397853,0.33237424],"study_design_scores_gemma":[0.000025901058,0.00007159106,0.00061985175,0.0002814339,0.00006109939,0.00023571857,0.00005902943,0.6959296,0.00089902186,0.1414328,0.16034694,0.00003705413],"about_ca_topic_score_codex":0.0046170647,"about_ca_topic_score_gemma":0.0051966226,"teacher_disagreement_score":0.0067781857,"about_ca_system_score_codex":0.0013666501,"about_ca_system_score_gemma":0.0014527736,"threshold_uncertainty_score":0.022675276},"labels":[],"label_agreement":null},{"id":"W2742915422","doi":"","title":"Evolutionary Farsightedness in International Environmental Agreements","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Replicator equation; Stock (firearms); Economics; Sequential game; International trade; Game theory; Mathematical economics; Geography","score_opus":0.02454216142634288,"score_gpt":0.1905751583601369,"score_spread":0.166032996933794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742915422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68129003,0.0005428529,0.2813994,0.002509052,0.00007350227,0.000080462276,0.00012504969,0.00013660244,0.033843063],"genre_scores_gemma":[0.9923819,0.00009496322,0.004512259,0.00007100814,0.000016049025,0.000022438855,0.00001777765,0.000007633853,0.00287596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757487,0.0013280379,0.00009980152,0.0004671935,0.00026692307,0.00026312284],"domain_scores_gemma":[0.9894366,0.0064480086,0.0021817628,0.0007683156,0.00039627386,0.00076901674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004340455,0.000440138,0.0009901696,0.0005762711,0.00093068846,0.0026918282,0.0014945868,0.0024851698,0.004205378],"category_scores_gemma":[0.022488935,0.00047057224,0.0006263673,0.00045690982,0.0030168851,0.0047518048,0.0016410062,0.0018934277,0.00029729703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001081139,0.000058809495,0.003080447,0.000051915486,0.000050162496,0.00041404943,0.00081828533,0.30697384,0.0013997124,0.67578065,0.00059024047,0.010673726],"study_design_scores_gemma":[0.000077982615,0.000069977534,0.0010178938,0.000021158821,0.000016623992,0.0001618209,0.00027187695,0.35759306,0.0002403381,0.63879555,0.0017009465,0.00003281971],"about_ca_topic_score_codex":0.002869353,"about_ca_topic_score_gemma":0.0017373799,"teacher_disagreement_score":0.004340455,"about_ca_system_score_codex":0.0016007577,"about_ca_system_score_gemma":0.0009090188,"threshold_uncertainty_score":0.022954822},"labels":[],"label_agreement":null},{"id":"W2744929031","doi":"","title":"A stochastic optimization formulation for the transition from open pit to underground mining","year":2016,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Open-pit mining; Cash flow; Net present value; Underground mining (soft rock); Set (abstract data type); Present value; Production (economics); Mining engineering; Computer science; Mathematical optimization; Operations research; Engineering; Mathematics; Economics; Coal mining","score_opus":0.017597067808820883,"score_gpt":0.21654400668647644,"score_spread":0.19894693887765555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744929031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040229265,0.00049902615,0.9402617,0.0011529155,0.00010220643,0.00014060477,0.0006714016,0.000117501426,0.016825277],"genre_scores_gemma":[0.83400995,0.00092483056,0.14307933,0.00022513025,0.000111200185,0.00050330284,0.000550104,0.00010933439,0.020486897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.00031503462,0.000029626177,0.00016257905,0.00015971405,0.00014225097],"domain_scores_gemma":[0.99897337,0.00064563076,0.00015059924,0.000027709018,0.000121551086,0.00008106304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017723535,0.0011690102,0.0011849654,0.0006702045,0.0005240706,0.0018015741,0.0014068908,0.0016701778,0.00599442],"category_scores_gemma":[0.0023706825,0.00092707755,0.0011493142,0.00093926664,0.0010215972,0.0012403576,0.0009626294,0.0019365876,0.00035993027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018029596,0.00001775488,0.00015938104,0.000028542383,0.000011759056,0.000039839902,0.000014189094,0.9828196,0.00022368898,0.014694386,0.00031976184,0.0016531098],"study_design_scores_gemma":[0.000010142812,0.00002759672,0.00014121365,0.000008500036,0.000008878988,0.000010789185,0.000015200976,0.9921022,0.00009825506,0.007034641,0.00053604686,0.000006515227],"about_ca_topic_score_codex":0.012705889,"about_ca_topic_score_gemma":0.010016648,"teacher_disagreement_score":0.012705889,"about_ca_system_score_codex":0.0023979878,"about_ca_system_score_gemma":0.003572367,"threshold_uncertainty_score":0.025263846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristic; Mathematics; Clique; Variable neighborhood search; Greedy algorithm; Clique problem; Vertex (graph theory); Mathematical optimization; Simplicity; Variable (mathematics); Combinatorics; Algorithm; Metaheuristic; Graph; Chordal graph","score_opus":0.01852289698079633,"score_gpt":0.26060745756493653,"score_spread":0.24208456058414018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747220382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0218722,0.0007151221,0.9691187,0.00031056424,0.00004993678,0.00007111351,0.00009963007,0.00023874249,0.00752406],"genre_scores_gemma":[0.49534473,0.0006589579,0.49618882,0.00021396628,0.0001138923,0.00036924024,0.00052745396,0.00019995766,0.0063829725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995134,0.00024891633,0.000009254813,0.000080855934,0.00009779195,0.00004969561],"domain_scores_gemma":[0.99929047,0.0005064323,0.000040303305,0.00005556247,0.00007347618,0.00003374823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751267,0.0003433766,0.0007308554,0.0006811169,0.0006017869,0.0005632403,0.00079167413,0.0006409104,0.003878164],"category_scores_gemma":[0.003170919,0.0002768003,0.00046082897,0.0010346979,0.00068148895,0.0010675469,0.0009049368,0.000796826,0.00039860752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012877039,0.00008040743,0.0005719579,0.00014229164,0.000052349264,0.00006502135,0.00008190376,0.74176466,0.0018321489,0.13767247,0.0077549918,0.10985296],"study_design_scores_gemma":[0.000027071304,0.00003287122,0.0001259452,0.000011727807,0.0000064461215,0.000028616212,0.000013587341,0.9463064,0.00041128884,0.050358366,0.0026712765,0.0000062788376],"about_ca_topic_score_codex":0.002486403,"about_ca_topic_score_gemma":0.0032801274,"teacher_disagreement_score":0.003878164,"about_ca_system_score_codex":0.00063589966,"about_ca_system_score_gemma":0.000835415,"threshold_uncertainty_score":0.012973785},"labels":[],"label_agreement":null},{"id":"W2748138450","doi":"","title":"Slowing Deforestation Pace through Subsidies: A Differential Game","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Deforestation (computer science); Subsidy; Revenue; Pace; Natural resource economics; Economics; Time horizon; Horizon; Differential game; Geography; Computer science; Finance; Market economy; Mathematics; Mathematical optimization","score_opus":0.050171922280813346,"score_gpt":0.2254889691397198,"score_spread":0.17531704685890645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748138450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41366136,0.00092056167,0.47979665,0.006797196,0.00021726332,0.0004169302,0.00073780253,0.00018754363,0.0972647],"genre_scores_gemma":[0.97912645,0.000507878,0.010714438,0.00026235034,0.000057591158,0.00011967869,0.000046150806,0.00001555097,0.009149951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891543,0.0005221502,0.000029010323,0.00014051098,0.00011902913,0.00027380654],"domain_scores_gemma":[0.99866617,0.00086600974,0.00016722019,0.00004416841,0.0000582088,0.0001981455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001580481,0.0008483968,0.0010899642,0.0004949105,0.0007208346,0.0019386617,0.001476161,0.0027653766,0.0042487145],"category_scores_gemma":[0.003619028,0.0004193326,0.00076803524,0.000632105,0.0023181515,0.0026837029,0.001519883,0.0016505136,0.0003137818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003894951,0.00023030244,0.0018069417,0.00012556532,0.00008237862,0.0007093916,0.00036227464,0.5381486,0.0037643327,0.4397517,0.0027439252,0.011885162],"study_design_scores_gemma":[0.0003086851,0.00025937904,0.00093126507,0.0000334611,0.00006192388,0.00021183674,0.00023063929,0.76768744,0.00047041394,0.22369903,0.0060568824,0.00004908281],"about_ca_topic_score_codex":0.006420612,"about_ca_topic_score_gemma":0.0042152437,"teacher_disagreement_score":0.006420612,"about_ca_system_score_codex":0.0029497296,"about_ca_system_score_gemma":0.0014061547,"threshold_uncertainty_score":0.021401882},"labels":[],"label_agreement":null},{"id":"W2751463747","doi":"","title":"Combining Adaptation and Mitigation: A Game Theoretic Approach","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Adaptation (eye); Computer science; Game theory; Economics; Mathematical economics; Psychology","score_opus":0.03887150287094761,"score_gpt":0.2063909849754955,"score_spread":0.16751948210454787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751463747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00857011,0.0005137843,0.9584519,0.0025776546,0.0001228828,0.000113250186,0.00005647358,0.000051866875,0.029542068],"genre_scores_gemma":[0.7650754,0.0019186796,0.21807282,0.0011237768,0.00044394567,0.00047933517,0.000056078556,0.000080450336,0.012749491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960672,0.0024646514,0.000105770116,0.00046998673,0.0004759989,0.00041637267],"domain_scores_gemma":[0.9982663,0.0012247831,0.00014865187,0.00008889268,0.00011101735,0.00016036918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033163165,0.0020314106,0.0015603795,0.0013804685,0.0010243718,0.0028898972,0.0026681547,0.0028990144,0.004776963],"category_scores_gemma":[0.0038845006,0.00078219787,0.0018405321,0.00093520357,0.0029957057,0.0042152917,0.004042205,0.0025029012,0.0003772448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041437175,0.000073575866,0.00021097406,0.000116306896,0.00012941728,0.00009403005,0.00015610838,0.28141817,0.0010044116,0.70384115,0.00081116124,0.012103229],"study_design_scores_gemma":[0.000046013192,0.000107089334,0.00014315835,0.0000436722,0.000073379735,0.00006030656,0.00010051395,0.31017146,0.00048334888,0.6813931,0.0073359907,0.00004203909],"about_ca_topic_score_codex":0.003206887,"about_ca_topic_score_gemma":0.0037809252,"teacher_disagreement_score":0.004776963,"about_ca_system_score_codex":0.0025019753,"about_ca_system_score_gemma":0.002819344,"threshold_uncertainty_score":0.01815319},"labels":[],"label_agreement":null},{"id":"W2754956095","doi":"","title":"Goal Achieving Probabilities of Cone-Constrained Mean-variance Portfolios","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Probabilistic logic; Portfolio; Investment strategy; Variance (accounting); Financial market; Mathematical economics; Economics; Terminal (telecommunication); Cone (formal languages); Project portfolio management; Econometrics; Computer science; Mathematics; Finance; Statistics; Algorithm","score_opus":0.013299109471479689,"score_gpt":0.18099427426847028,"score_spread":0.1676951647969906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754956095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08621682,0.00041076343,0.90564513,0.00034949087,0.000029468629,0.00008677368,0.00012148978,0.00014469845,0.0069953725],"genre_scores_gemma":[0.9181049,0.00071340095,0.075343765,0.00014825763,0.000050284005,0.0002419735,0.00022671469,0.00011191254,0.0050587873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.00034395407,0.000051229097,0.00016806812,0.00031989193,0.00023494406],"domain_scores_gemma":[0.9920831,0.005865127,0.0008554059,0.00023991436,0.0005811448,0.00037535935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034112646,0.00095024,0.0009894633,0.0012480714,0.00054722547,0.0025078382,0.0015622318,0.0012852497,0.004751992],"category_scores_gemma":[0.019331183,0.0007180328,0.0009190956,0.0007099271,0.0017977648,0.0033904826,0.0014122449,0.0017099207,0.0003539302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009216603,0.000059865408,0.0026472704,0.000088997134,0.000039453957,0.00021125321,0.00013715695,0.6567159,0.0013017621,0.32552093,0.0011292694,0.012056031],"study_design_scores_gemma":[0.000009172798,0.00002617519,0.00038160372,0.000027339927,0.000008147546,0.000058442274,0.000025630121,0.9247014,0.00048528795,0.07401505,0.00024600164,0.00001576883],"about_ca_topic_score_codex":0.002236484,"about_ca_topic_score_gemma":0.0018373722,"teacher_disagreement_score":0.004751992,"about_ca_system_score_codex":0.0017684097,"about_ca_system_score_gemma":0.0016741602,"threshold_uncertainty_score":0.018040717},"labels":[],"label_agreement":null},{"id":"W2756314504","doi":"","title":"Optimisation du nombre de sites d'entreposage de poteaux chez Hydro-Québec","year":2005,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Water Systems and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geography","score_opus":0.004569943567113249,"score_gpt":0.17114377908917977,"score_spread":0.16657383552206653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756314504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362767,0.00014063454,0.0042377855,0.000067293586,0.000009511522,0.00003309094,0.0004216866,0.00007358971,0.0013887864],"genre_scores_gemma":[0.9908303,0.000061083796,0.004127463,0.000020200454,0.0000028970896,0.000029017447,0.00054653746,0.000022378894,0.004360083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997639,0.000045264627,0.0000071044483,0.00006814117,0.000038688835,0.00007684763],"domain_scores_gemma":[0.99924517,0.00038519016,0.000061451945,0.000027505113,0.00016824502,0.00011247956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006183037,0.00080682867,0.0008556336,0.0008477257,0.0008232512,0.0017796592,0.00071056606,0.001062695,0.003139669],"category_scores_gemma":[0.0012396578,0.00044320893,0.00064062036,0.0007143397,0.0005400227,0.0005165844,0.00035459673,0.0005493975,0.0002485472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068682525,0.0001712721,0.05001163,0.00011180946,0.00018058,0.00022564945,0.00014499138,0.91062456,0.01212218,0.0005765497,0.0011340963,0.02400976],"study_design_scores_gemma":[0.00014616168,0.0004137065,0.15018643,0.000028077895,0.00009425547,0.000048992497,0.0006636246,0.8399991,0.00629051,0.0003033949,0.0017717174,0.000054029348],"about_ca_topic_score_codex":0.6536517,"about_ca_topic_score_gemma":0.7113967,"teacher_disagreement_score":0.6536517,"about_ca_system_score_codex":0.0043166713,"about_ca_system_score_gemma":0.0024312688,"threshold_uncertainty_score":0.696776},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; 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)","score_opus":0.02783251239958681,"score_gpt":0.2516446497586241,"score_spread":0.2238121373590373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763534418","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028677746,0.00071107474,0.83193463,0.00024854674,0.0002142515,0.0005616315,0.006259048,0.14900377,0.0081992475],"genre_scores_gemma":[0.07214488,0.0014570365,0.8303279,0.0015353134,0.00035049405,0.006514322,0.02327507,0.053312674,0.011082229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99180496,0.0027703275,0.0010287622,0.00087589293,0.0030323057,0.00048778014],"domain_scores_gemma":[0.9668697,0.023723077,0.0020271984,0.003313623,0.00363145,0.0004349629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006486413,0.0030992816,0.0014081554,0.0047963206,0.00077795406,0.0029636782,0.0054248124,0.0018525841,0.04046169],"category_scores_gemma":[0.055630084,0.0015126999,0.0016767819,0.002730402,0.001541344,0.0029121176,0.002399559,0.0030985258,0.022849066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001172678,0.00035052377,0.0070631416,0.0036656256,0.0005709244,0.0012692563,0.00037689653,0.090846576,0.010334394,0.05267297,0.32564765,0.50602937],"study_design_scores_gemma":[0.000829693,0.00052414165,0.00433681,0.0012698123,0.0001910242,0.0021931308,0.00011012626,0.5563021,0.048050214,0.08563577,0.3001384,0.0004188251],"about_ca_topic_score_codex":0.0034520896,"about_ca_topic_score_gemma":0.0029477347,"teacher_disagreement_score":0.04046169,"about_ca_system_score_codex":0.0014133569,"about_ca_system_score_gemma":0.0041215583,"threshold_uncertainty_score":0.13535786},"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":"W2770067348","doi":"","title":"The Canadian contribution to avoiding dangerous climate changes: An analysis of technological options and energy trade","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Global Energy and Sustainability Research","field":"Energy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Climate change; Natural resource economics; Economics; Energy (signal processing); International trade; Environmental science; Business; Geology","score_opus":0.014929390920532344,"score_gpt":0.26789940796456807,"score_spread":0.2529700170440357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770067348","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3666467,0.008134001,0.0036238339,0.013278775,0.00013485122,0.000094416275,0.002288121,0.000062540945,0.6057367],"genre_scores_gemma":[0.9642209,0.004071919,0.001308128,0.0003104799,0.000037017155,0.000014089254,0.00024158738,0.000029266872,0.029766642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842453,0.00016990057,0.000022709168,0.00008767578,0.0006706432,0.0006244656],"domain_scores_gemma":[0.99834144,0.00040502675,0.00011660732,0.00007431399,0.00079282845,0.00026973936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011066224,0.0006188446,0.00048234093,0.0029223533,0.0045485334,0.005536246,0.0013331338,0.0016834948,0.010338402],"category_scores_gemma":[0.0046272622,0.0003060481,0.0012204063,0.0051822024,0.0028396621,0.0013079876,0.0013415662,0.0014183992,0.00028669005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045794726,0.000077709796,0.03503006,0.0003627105,0.00032995513,0.0007954596,0.0017875778,0.10205994,0.0011725725,0.7883291,0.017098906,0.05249811],"study_design_scores_gemma":[0.00015294687,0.00015084182,0.21762012,0.0005908891,0.0014236475,0.00075409265,0.020056687,0.1156413,0.0018999508,0.23983067,0.40148056,0.00039824736],"about_ca_topic_score_codex":0.98228157,"about_ca_topic_score_gemma":0.991148,"teacher_disagreement_score":0.06338457,"about_ca_system_score_codex":0.06338457,"about_ca_system_score_gemma":0.056295186,"threshold_uncertainty_score":0.4598894},"labels":[],"label_agreement":null},{"id":"W2948477331","doi":"","title":"Decremental clustering for the solution of \\(p\\)-dispersion problems to proven optimality","year":2019,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Optical Imaging and Spectroscopy Techniques","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Cluster analysis; Dispersion (optics); Matrix (chemical analysis); Mathematical optimization; Computer science; Statistics; Physics; Chemistry; Chromatography; Optics","score_opus":0.013488473651569344,"score_gpt":0.28229273857270615,"score_spread":0.2688042649211368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948477331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022123557,0.0009377304,0.963509,0.0018730058,0.00012067189,0.00020345164,0.00021490188,0.00026526063,0.010752419],"genre_scores_gemma":[0.27344438,0.0008776418,0.7086336,0.00069178804,0.00024568854,0.0007570462,0.0007309114,0.00033206062,0.014286957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976605,0.0009729973,0.00015532233,0.0004031043,0.0005145612,0.00029348885],"domain_scores_gemma":[0.9900693,0.0076241456,0.00046037792,0.00070301385,0.00082336646,0.0003197452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005910212,0.0015687923,0.0020014436,0.001611316,0.0017258092,0.0022353714,0.0033588572,0.0036228334,0.0050482755],"category_scores_gemma":[0.024251502,0.0007916756,0.0015475132,0.001652675,0.0029453,0.0031267474,0.0045830132,0.0037975933,0.00094191753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035258644,0.00019112528,0.0014310535,0.00046604482,0.00014816588,0.00014974995,0.0003425348,0.7401456,0.0015866248,0.18844774,0.00833946,0.058399208],"study_design_scores_gemma":[0.000028905204,0.000051958414,0.00015889239,0.000047831607,0.00001239102,0.00002853923,0.000041109426,0.92741257,0.00040280982,0.07023303,0.0015722947,0.000009622135],"about_ca_topic_score_codex":0.008551799,"about_ca_topic_score_gemma":0.009716769,"teacher_disagreement_score":0.008551799,"about_ca_system_score_codex":0.0031317049,"about_ca_system_score_gemma":0.0039671906,"threshold_uncertainty_score":0.031256616},"labels":[],"label_agreement":null},{"id":"W2995996834","doi":"","title":"Graphon Mean Field Games and the GMFG equations: e-Nash equilibria","year":2019,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Uniqueness; Nash equilibrium; Dynamical systems theory; Mathematical economics; Game theory; Population; Mathematics; Stability theory; Dynamical system (definition); Field (mathematics); Computer science; Applied mathematics; Pure mathematics; Mathematical analysis; Physics; Nonlinear system","score_opus":0.013955190386706399,"score_gpt":0.24766861315997657,"score_spread":0.23371342277327017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995996834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16705115,0.0021127209,0.7508857,0.0070287026,0.00027360217,0.00009763748,0.00027943225,0.000106116764,0.07216484],"genre_scores_gemma":[0.92594814,0.0014966378,0.051548988,0.00083546946,0.000212569,0.00021981607,0.00013669571,0.000033069577,0.019568617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966955,0.00015599128,0.000010415234,0.0000573729,0.000065297594,0.000041415526],"domain_scores_gemma":[0.9992131,0.00043914097,0.00012585302,0.000041081672,0.00008117193,0.000099609024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007706948,0.00054766616,0.00049458415,0.000714949,0.0006223189,0.0011460481,0.0008142654,0.0016563785,0.003057539],"category_scores_gemma":[0.0031720614,0.00020192929,0.00057920086,0.00042925778,0.0020289584,0.0019577614,0.0011360905,0.0014161059,0.00028806596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010500156,0.000009450939,0.0002747483,0.00001809578,0.000008396697,0.000057802765,0.000073917894,0.026986253,0.00044784477,0.9685278,0.0009487494,0.002636329],"study_design_scores_gemma":[0.000016691743,0.000012095466,0.00020284792,0.000012891173,0.000004146156,0.000043399592,0.00004587549,0.1388817,0.00013776429,0.8586036,0.0020278506,0.0000111621275],"about_ca_topic_score_codex":0.0045690057,"about_ca_topic_score_gemma":0.003023656,"teacher_disagreement_score":0.0045690057,"about_ca_system_score_codex":0.001269772,"about_ca_system_score_gemma":0.0007357502,"threshold_uncertainty_score":0.010228515},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"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","score_opus":0.012720356515452589,"score_gpt":0.20983289194795843,"score_spread":0.19711253543250584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000089047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06906226,0.00070403365,0.91677326,0.00065284333,0.00009255967,0.000106331114,0.0002482874,0.0005584363,0.011802017],"genre_scores_gemma":[0.48220184,0.0006003758,0.5106891,0.00051201327,0.000116875686,0.0002263415,0.00082883873,0.00043553527,0.0043891044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834406,0.00081516535,0.00006274219,0.00024332757,0.000312504,0.00022216288],"domain_scores_gemma":[0.99151623,0.0066201407,0.0005932451,0.00048676212,0.00056839123,0.00021519749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031748083,0.001630798,0.0014085136,0.0008473384,0.0004488024,0.001794329,0.0017109369,0.0014476625,0.0046481537],"category_scores_gemma":[0.0120971305,0.00092118216,0.0011141202,0.00124547,0.0011859129,0.002886873,0.0018247718,0.0029083428,0.0007762142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019568288,0.00022573043,0.00045333526,0.00026186113,0.000054208846,0.000112936876,0.00008644731,0.9335016,0.002720571,0.02593203,0.0036244486,0.03283111],"study_design_scores_gemma":[0.000024071302,0.00005676002,0.000076864584,0.000019022635,0.0000068949844,0.00003563983,0.00002011359,0.9858708,0.0008294266,0.012448094,0.00060539285,0.0000069305906],"about_ca_topic_score_codex":0.0029502276,"about_ca_topic_score_gemma":0.0029304689,"teacher_disagreement_score":0.0046481537,"about_ca_system_score_codex":0.00097398815,"about_ca_system_score_gemma":0.0013978813,"threshold_uncertainty_score":0.016790211},"labels":[],"label_agreement":null},{"id":"W3005767958","doi":"","title":"The Aadhaar project as a guide for an alternative digital development in Quebec","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Social Sciences and Governance","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Business; Computer science; Political science","score_opus":0.036371816118598715,"score_gpt":0.32114584441265365,"score_spread":0.28477402829405496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005767958","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042686597,0.028747892,0.036190953,0.08834912,0.0019455779,0.00327385,0.006893272,0.0013508052,0.790562],"genre_scores_gemma":[0.15075208,0.012333831,0.0630018,0.006123731,0.00007742923,0.0013752101,0.0021044044,0.0005041057,0.7637274],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970542,0.0009901816,0.00012074369,0.00018469,0.0011017106,0.0005484025],"domain_scores_gemma":[0.99721587,0.00050105964,0.00008436747,0.00021635507,0.0013659946,0.00061629596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965295,0.0004925477,0.00032266407,0.0019266153,0.006191992,0.0066985246,0.0014162079,0.0021373802,0.02253524],"category_scores_gemma":[0.004317559,0.00040766015,0.0005153656,0.0028083727,0.0021542185,0.001899428,0.0021433074,0.0019696455,0.0015499967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006162023,0.0002663293,0.0049461736,0.0003411462,0.000026745976,0.00090082875,0.0064683035,0.0035133564,0.0018698565,0.33107373,0.35199,0.29854196],"study_design_scores_gemma":[0.000015913922,0.000025726607,0.004022586,0.0002310339,0.0000057136904,0.00007361583,0.00197463,0.00074694323,0.0002887525,0.002655212,0.98993427,0.000025555655],"about_ca_topic_score_codex":0.97995126,"about_ca_topic_score_gemma":0.98367465,"teacher_disagreement_score":0.9317225,"about_ca_system_score_codex":0.06827746,"about_ca_system_score_gemma":0.15250835,"threshold_uncertainty_score":0.49539},"labels":[],"label_agreement":null},{"id":"W3009460062","doi":"","title":"On the difference of energies of a graph and its complement graph","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Complement graph; Distance-regular graph; Graph energy; Graph; Regular graph; Discrete mathematics; Line graph; Null graph; Cubic graph; Voltage graph; Simplex graph; Strength of a graph; Graph power","score_opus":0.04631915453908972,"score_gpt":0.258584714138284,"score_spread":0.21226555959919427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009460062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8987666,0.0009408555,0.08389925,0.0011468859,0.00011663759,0.0000150611595,0.00025801721,0.000057703783,0.01479904],"genre_scores_gemma":[0.9885719,0.0002345509,0.008306218,0.00010293734,0.0001062425,0.000025771025,0.00016035655,0.000051224637,0.0024407792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00023860685,0.00002070771,0.0001620381,0.000171827,0.00009210789],"domain_scores_gemma":[0.99403524,0.00475994,0.0003693829,0.000250078,0.0002649759,0.00032037147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011194475,0.00043081865,0.00073955394,0.0019897597,0.00056118023,0.0010976384,0.00093863363,0.0009698134,0.0042179227],"category_scores_gemma":[0.006045078,0.00021041589,0.00031749607,0.00093607634,0.0024039608,0.0024203393,0.0011682092,0.0010904673,0.0002573026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004009507,0.00010166027,0.0051533496,0.00017073538,0.0000794369,0.0002859967,0.00041416555,0.0547167,0.0081460215,0.91160554,0.0022707738,0.0166547],"study_design_scores_gemma":[0.000024633298,0.000095697564,0.0053928387,0.00004669076,0.00002322479,0.000420071,0.0002720329,0.19084328,0.001855835,0.7987312,0.002260277,0.000034214398],"about_ca_topic_score_codex":0.00041025734,"about_ca_topic_score_gemma":0.0003748033,"teacher_disagreement_score":0.0042179227,"about_ca_system_score_codex":0.0008071489,"about_ca_system_score_gemma":0.00017779446,"threshold_uncertainty_score":0.014110386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01582555029809753,"score_gpt":0.24318568317454362,"score_spread":0.22736013287644607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013962532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3231077,0.00074604177,0.6558977,0.0008630886,0.000085016436,0.00026489928,0.0001754513,0.00065533613,0.018204784],"genre_scores_gemma":[0.6140191,0.00018834368,0.38334483,0.000118890006,0.00003338086,0.00023921693,0.00024219454,0.000111502166,0.0017025635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00033446684,0.00001698773,0.00006959014,0.00009414405,0.00007325879],"domain_scores_gemma":[0.9928664,0.0062704505,0.00023483834,0.00015757882,0.00027163327,0.00019912707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443166,0.00070774485,0.0008829945,0.0007485877,0.0005598883,0.0010256628,0.001242247,0.001167361,0.0043830853],"category_scores_gemma":[0.007377818,0.00035747312,0.00055298995,0.000908375,0.0007383227,0.00096234225,0.0008682126,0.0014374905,0.0002786219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034600653,0.00018524034,0.0011994528,0.00015460206,0.000034861638,0.000058510563,0.00007727882,0.9374374,0.0014313002,0.023544263,0.0013735882,0.034157507],"study_design_scores_gemma":[0.000024568884,0.000030944713,0.00006617733,0.0000057825437,0.000003949886,0.000007725274,0.000009185879,0.99655765,0.00014760069,0.0030330843,0.000111845686,0.0000014390855],"about_ca_topic_score_codex":0.0032341443,"about_ca_topic_score_gemma":0.0026220807,"teacher_disagreement_score":0.0043830853,"about_ca_system_score_codex":0.0010134227,"about_ca_system_score_gemma":0.0014459373,"threshold_uncertainty_score":0.014662862},"labels":[],"label_agreement":null},{"id":"W3015463290","doi":"","title":"The contribution of mathematical models to climate policy design: A researcher's perspective","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Greenhouse gas; Climate change; Climate policy; Perspective (graphical); Energy policy; Adaptation (eye); Climate model; Energy sector; Economics; Environmental economics; Natural resource economics; Environmental resource management; Environmental science; Computer science; Engineering; Renewable energy; Ecology","score_opus":0.1588725697958539,"score_gpt":0.32321977416542935,"score_spread":0.16434720436957545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015463290","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008515316,0.104854114,0.5903692,0.25000826,0.0038880087,0.000039845243,0.00020963523,0.00020301227,0.041912556],"genre_scores_gemma":[0.3535438,0.31800613,0.27412423,0.016742766,0.024003854,0.00023841532,0.0002257455,0.0002909485,0.012824096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969578,0.0021207766,0.00013121567,0.00018932359,0.00047801647,0.00012288871],"domain_scores_gemma":[0.9719545,0.024576407,0.0008416719,0.0010567544,0.0012395739,0.00033118395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009235682,0.0011064284,0.0012507115,0.0023294184,0.000617702,0.0039767455,0.0018979044,0.0029008344,0.0033482157],"category_scores_gemma":[0.02539161,0.00069256243,0.0015366912,0.0018246425,0.0049347742,0.008577493,0.002078476,0.006887103,0.00087659917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010348818,0.000035826368,0.00030648257,0.00025804088,0.00004247874,0.000033287997,0.00009418292,0.028700525,0.00007457505,0.9478123,0.0059021637,0.016729679],"study_design_scores_gemma":[0.000010577392,0.000020673178,0.000113820955,0.00020058689,0.00001522546,0.000048239617,0.00008690877,0.030800635,0.0001475596,0.93094337,0.037591122,0.000021252503],"about_ca_topic_score_codex":0.0017967424,"about_ca_topic_score_gemma":0.0011088363,"teacher_disagreement_score":0.009235682,"about_ca_system_score_codex":0.0022095733,"about_ca_system_score_gemma":0.0022068531,"threshold_uncertainty_score":0.048843503},"labels":[],"label_agreement":null},{"id":"W3021027451","doi":"","title":"A cost-effectiveness differential game model for climate agreements","year":2013,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Economics; Negotiation; Nash equilibrium; Differential game; Budget constraint; Equity (law); Differential (mechanical device); Weighting; Microeconomics; Mathematics; Mathematical optimization","score_opus":0.13034352146593892,"score_gpt":0.2750070936922209,"score_spread":0.144663572226282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021027451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032122552,0.00042240426,0.9119684,0.001743671,0.000121582256,0.00022209331,0.00048173437,0.00008947164,0.052828126],"genre_scores_gemma":[0.8549704,0.00083068636,0.0996762,0.0003931571,0.00012063661,0.0009251298,0.00032513536,0.000052213116,0.0427064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987249,0.0006548213,0.000041591527,0.00018316091,0.00022201375,0.00017352197],"domain_scores_gemma":[0.9990934,0.0005358293,0.00010646719,0.00004428953,0.00009860117,0.00012140094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016142388,0.0012251281,0.001270956,0.0007260771,0.0008603832,0.002418003,0.002692544,0.0025615615,0.008690507],"category_scores_gemma":[0.002681492,0.0005714646,0.0010812599,0.00090883946,0.0021402948,0.002535186,0.0018302972,0.002132567,0.0008160453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038706323,0.000049415437,0.00020367652,0.000053068696,0.000020063366,0.00015832497,0.00010977721,0.5133329,0.0005923293,0.4820884,0.00077191705,0.002581432],"study_design_scores_gemma":[0.00006044215,0.000042234635,0.00011131059,0.000013320704,0.0000126823825,0.000048658243,0.00004213241,0.86886525,0.0000912799,0.12734555,0.0033480725,0.000019069912],"about_ca_topic_score_codex":0.008255642,"about_ca_topic_score_gemma":0.0056047323,"teacher_disagreement_score":0.008690507,"about_ca_system_score_codex":0.004108487,"about_ca_system_score_gemma":0.00176373,"threshold_uncertainty_score":0.029809296},"labels":[],"label_agreement":null},{"id":"W3021054588","doi":"","title":"Pricing the CBOT T-Bonds Futures","year":2006,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Futures contract; Interest rate; Bond; Computer science; Interest rate derivative; Hedge; Treasury; Derivative (finance); Econometrics; Markov chain; Financial engineering; Economics; Financial economics; Finance; Machine learning","score_opus":0.008753301676693637,"score_gpt":0.18668143482922686,"score_spread":0.17792813315253322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021054588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0495867,0.00017486754,0.94404817,0.0003512486,0.00007684211,0.000037508897,0.00003800356,0.00015126211,0.0055354633],"genre_scores_gemma":[0.57885194,0.0002476682,0.4141785,0.000060399398,0.000042891224,0.000085492145,0.0000705199,0.0000623894,0.006400127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997305,0.000106511514,0.00001225778,0.00003291778,0.00010122193,0.000016555163],"domain_scores_gemma":[0.9996346,0.0001810945,0.000045164907,0.000030584622,0.00007238182,0.00003617992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008472335,0.000325964,0.00041859233,0.00029340165,0.00034704723,0.0008945087,0.000836861,0.0009981053,0.002712838],"category_scores_gemma":[0.0033725102,0.00025948338,0.00032227885,0.0004259065,0.00059743895,0.0009996602,0.0005982538,0.00078332267,0.0002687989],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071276685,0.000043017266,0.0014635217,0.00004049342,0.000012944993,0.00012513575,0.00007160282,0.8279146,0.0037339313,0.13272953,0.0010990235,0.032694884],"study_design_scores_gemma":[0.0000072885305,0.000008151581,0.000046621888,0.000002797009,9.1050816e-7,0.000016510217,0.0000045441348,0.992762,0.00023776744,0.0063136593,0.000596775,0.0000029827665],"about_ca_topic_score_codex":0.0049526505,"about_ca_topic_score_gemma":0.0031900923,"teacher_disagreement_score":0.0049526505,"about_ca_system_score_codex":0.0005783949,"about_ca_system_score_gemma":0.00089114875,"threshold_uncertainty_score":0.009847641},"labels":[],"label_agreement":null},{"id":"W3021131438","doi":"","title":"A scalable exact algorithm for the vertex \\(p\\)-center problem","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computation; Scalability; Vertex (graph theory); Algorithm; Matrix (chemical analysis); Reduction (mathematics); Cardinality (data modeling); Mathematics; Computer science; Mathematical optimization; Theoretical computer science; Graph; Data mining","score_opus":0.015712609302719883,"score_gpt":0.21843178083930995,"score_spread":0.20271917153659005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021131438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029971927,0.00040971357,0.9459637,0.0007342506,0.00013463701,0.00034454567,0.0005477274,0.0033555618,0.018538062],"genre_scores_gemma":[0.18426025,0.00016181356,0.8088246,0.00019069371,0.00007449307,0.00035902974,0.0009147176,0.0005145925,0.004699734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.00014510572,0.00003210663,0.00017130634,0.00017222874,0.0002084781],"domain_scores_gemma":[0.998672,0.0007753658,0.000095608346,0.00018868162,0.000172251,0.00009613543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097080716,0.0012246217,0.001447508,0.00083710434,0.0008502756,0.0014949349,0.0023709666,0.0016144479,0.014369748],"category_scores_gemma":[0.0034061312,0.0006168178,0.00091492094,0.0014850921,0.00069809135,0.0017747139,0.0019589188,0.0014472302,0.0025348437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003372553,0.00028790085,0.00077877846,0.00030943312,0.00005679293,0.00018657291,0.00015100204,0.7539156,0.002963418,0.028873384,0.021311097,0.19082874],"study_design_scores_gemma":[0.00010745092,0.000034004403,0.000087382556,0.000010264686,0.000007648252,0.00003540045,0.000036019846,0.98614,0.00042732467,0.011584305,0.0015241664,0.000006064389],"about_ca_topic_score_codex":0.012173157,"about_ca_topic_score_gemma":0.014886835,"teacher_disagreement_score":0.014369748,"about_ca_system_score_codex":0.0014534066,"about_ca_system_score_gemma":0.0033941162,"threshold_uncertainty_score":0.048071623},"labels":[],"label_agreement":null},{"id":"W3022546941","doi":"","title":"Optimal Hedging when the Underlying Asset Follows a Regime-Switching Markov Process","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Recursion (computer science); Benchmark (surveying); Mathematical optimization; Asset (computer security); Markov process; Function (biology); Reduction (mathematics); Penalty method; Markov chain; Process (computing); Computer science; Bellman equation; Mathematics; Algorithm; Statistics","score_opus":0.032150131810494566,"score_gpt":0.24340103730178786,"score_spread":0.2112509054912933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022546941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09641777,0.00021004681,0.90109944,0.00018567014,0.00003449498,0.00004276176,0.0000389152,0.0001219257,0.0018489717],"genre_scores_gemma":[0.92847395,0.00021814881,0.06925552,0.00005610336,0.000026354866,0.00004810771,0.00005239402,0.000022121516,0.0018473978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.00021426588,0.000028471817,0.000097474185,0.00012348512,0.00007890223],"domain_scores_gemma":[0.9978067,0.00150789,0.00028730702,0.00021178712,0.00009700594,0.00008928292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022637867,0.00043477863,0.00078287977,0.000308244,0.00027071676,0.00097129244,0.0009637232,0.0009239387,0.0019926822],"category_scores_gemma":[0.00521968,0.00039897324,0.0006114921,0.0004034158,0.0009319924,0.0011424299,0.0006751241,0.0010177589,0.00015609455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013093339,0.00007510939,0.0011413121,0.00005617113,0.000043297452,0.000112801914,0.0000656523,0.91839045,0.0032595724,0.052623127,0.00034284175,0.023758706],"study_design_scores_gemma":[0.000012633767,0.00002609343,0.00016122316,0.0000038022836,0.000005154105,0.000013030183,0.0000033169993,0.9879099,0.00052831566,0.0112193115,0.00011221622,0.0000050455924],"about_ca_topic_score_codex":0.0016111333,"about_ca_topic_score_gemma":0.0013839271,"teacher_disagreement_score":0.0022637867,"about_ca_system_score_codex":0.0006056273,"about_ca_system_score_gemma":0.0008679417,"threshold_uncertainty_score":0.011972189},"labels":[],"label_agreement":null},{"id":"W3023120748","doi":"","title":"Farsightedness in a coalitional Great Fish War","year":2010,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical economics; Mainstream; Economics; Stochastic game; Political science; Law","score_opus":0.019069327541412124,"score_gpt":0.279130291858589,"score_spread":0.2600609643171769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023120748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5902841,0.00095420127,0.30508956,0.004671372,0.00017725713,0.00012824804,0.00027543376,0.0001208286,0.09829909],"genre_scores_gemma":[0.9871567,0.00026520822,0.005551808,0.00017490367,0.000050385373,0.000035821242,0.000037579524,0.000013265583,0.006714386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987909,0.00045762677,0.000045462377,0.00025918917,0.00015156726,0.00029523537],"domain_scores_gemma":[0.9937457,0.0030825415,0.0016214238,0.00050100527,0.00034352063,0.00070578215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002627171,0.0007172005,0.0009907938,0.00078118185,0.0014120996,0.0025006272,0.0015756801,0.002311931,0.008212544],"category_scores_gemma":[0.011006857,0.00038381043,0.0011708902,0.0005514872,0.004255666,0.0036668396,0.0040857913,0.0024818126,0.00061016245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014591284,0.000071915165,0.0024346053,0.0000803811,0.000056359986,0.00077156763,0.00077637535,0.11325001,0.001064404,0.87264025,0.0015076675,0.0072005684],"study_design_scores_gemma":[0.00009265291,0.000112760354,0.00074813364,0.000035926238,0.00003682327,0.00023275841,0.0004653637,0.21749936,0.00032161365,0.77740765,0.0029994475,0.00004749442],"about_ca_topic_score_codex":0.0042421655,"about_ca_topic_score_gemma":0.003067125,"teacher_disagreement_score":0.008212544,"about_ca_system_score_codex":0.0016153221,"about_ca_system_score_gemma":0.000985695,"threshold_uncertainty_score":0.027473688},"labels":[],"label_agreement":null},{"id":"W3110377137","doi":"","title":"An oligopoly game of CDR strategy deployment in a steady-state net-zero emission climate regime","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Oligopoly; Steady state (chemistry); Stochastic game; Net (polyhedron); Economics; Mathematical economics; Zero (linguistics); Zero emission; Computer science; Mathematics; Cournot competition; Ecology; Chemistry","score_opus":0.05713845978483705,"score_gpt":0.24744913093835236,"score_spread":0.1903106711535153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110377137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38411596,0.00018345204,0.5586991,0.0020039794,0.000077103476,0.00027928423,0.0006138768,0.00018905987,0.05383822],"genre_scores_gemma":[0.9732857,0.00012866447,0.020011695,0.00011842404,0.000010336346,0.00012993591,0.00006038485,0.000012102611,0.006242785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992099,0.00039256734,0.000019401326,0.00016451871,0.00006864829,0.00014503115],"domain_scores_gemma":[0.99933463,0.00033054914,0.000103407976,0.000045462755,0.00006403661,0.00012187576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510122,0.0005076259,0.0007105475,0.0003665983,0.0006874652,0.001808579,0.001030981,0.0015746872,0.00453164],"category_scores_gemma":[0.0019879597,0.00034103516,0.0006283871,0.0004595284,0.0014671813,0.0019965721,0.0009640175,0.0011487046,0.0003298161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017575274,0.00008225275,0.001377868,0.00005174424,0.000047731894,0.0004978191,0.00020922291,0.6688634,0.0022327455,0.3201732,0.0011686194,0.0051196036],"study_design_scores_gemma":[0.00007956477,0.0000922927,0.0005915879,0.000011465005,0.000020418065,0.00008161271,0.00016484475,0.92303544,0.00026884986,0.07346718,0.002158415,0.00002840581],"about_ca_topic_score_codex":0.008883413,"about_ca_topic_score_gemma":0.0077626077,"teacher_disagreement_score":0.008883413,"about_ca_system_score_codex":0.0021520867,"about_ca_system_score_gemma":0.0017545618,"threshold_uncertainty_score":0.01766342},"labels":[],"label_agreement":null},{"id":"W3114879400","doi":"","title":"Proceedings of the Edge Intelligence Workshop, Montréal, Canada, March 2--3, 2020","year":2020,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.021979474989648962,"score_gpt":0.20037115846591025,"score_spread":0.17839168347626128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114879400","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011327757,0.019856667,0.029381277,0.049223837,0.02651782,0.0005119968,0.027280843,0.00525061,0.8306492],"genre_scores_gemma":[0.014377193,0.004532749,0.0061067063,0.0016097944,0.00053138216,0.00006885123,0.013284333,0.00043008025,0.9590589],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934703,0.000065467546,0.0000130556045,0.000069738504,0.00028997005,0.00021472371],"domain_scores_gemma":[0.99862313,0.00009484348,0.000022685588,0.000072902054,0.00068078964,0.0005055165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784947,0.0014342285,0.0007508837,0.0010585983,0.0020054623,0.004517774,0.0018637753,0.0014338953,0.16001885],"category_scores_gemma":[0.0015054869,0.00044438272,0.0004660848,0.001230452,0.0008350215,0.0017452652,0.0014676654,0.0014823993,0.066636644],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010498069,0.00004367932,0.0004137996,0.00005232843,0.0000072461753,0.000058846832,0.00004783151,0.00038892936,0.00050326233,0.0024918222,0.9637872,0.032100137],"study_design_scores_gemma":[0.000025069641,0.000017465383,0.001298873,0.000062592604,0.00001403498,0.000030899977,0.0002598643,0.0015386211,0.0006718476,0.0014167178,0.994651,0.000013005946],"about_ca_topic_score_codex":0.46478608,"about_ca_topic_score_gemma":0.74835515,"teacher_disagreement_score":0.53521395,"about_ca_system_score_codex":0.0056710616,"about_ca_system_score_gemma":0.012314965,"threshold_uncertainty_score":0.92416143},"labels":[],"label_agreement":null},{"id":"W3122728683","doi":"","title":"Price bias and common practice in option pricing","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Simon Fraser University","funders":"","keywords":"Unobservable; Econometrics; Estimator; Economics; Valuation of options; Jump; Stock price; Volatility (finance); Mathematics; Statistics; Series (stratigraphy)","score_opus":0.02315251716223651,"score_gpt":0.23591810176640873,"score_spread":0.21276558460417222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122728683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08410131,0.006641875,0.8779496,0.008603151,0.00056514214,0.000080768805,0.00017193235,0.00056020863,0.02132599],"genre_scores_gemma":[0.82246053,0.0031886755,0.16724096,0.0013137046,0.0008613012,0.00015640842,0.00016657611,0.00032440675,0.004287396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9807664,0.0077090655,0.00114395,0.003426318,0.0064174915,0.0005367126],"domain_scores_gemma":[0.89984375,0.06880712,0.0073766625,0.016557308,0.006810265,0.00060494157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023889463,0.00069685496,0.0014542823,0.0027071044,0.0012853042,0.0040237643,0.0028701595,0.003952168,0.0039768796],"category_scores_gemma":[0.16558382,0.0007973185,0.0010264213,0.002943329,0.0077355094,0.009300285,0.0037768448,0.00497413,0.00075184816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079108446,0.000057274086,0.008321308,0.00022407252,0.00011391355,0.00031667828,0.00077072176,0.018085716,0.0012297326,0.9199279,0.0020774202,0.048796266],"study_design_scores_gemma":[0.000023735769,0.00003777205,0.0024276495,0.00014250429,0.000025652496,0.00034495068,0.00007001278,0.09285128,0.0018888602,0.8981157,0.004010252,0.00006160801],"about_ca_topic_score_codex":0.0019833823,"about_ca_topic_score_gemma":0.0010231555,"teacher_disagreement_score":0.023889463,"about_ca_system_score_codex":0.0021901564,"about_ca_system_score_gemma":0.00095186295,"threshold_uncertainty_score":0.1263411},"labels":[],"label_agreement":null},{"id":"W3123330426","doi":"","title":"An Analysis of the True Notional Bond System Applied to the CBOT T-Bond Futures","year":2007,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Notional amount; Futures contract; Bond; Treasury; Interest rate; Computer science; Econometrics; Economics; Financial economics; Finance","score_opus":0.008605923956863151,"score_gpt":0.20432457569456944,"score_spread":0.19571865173770628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123330426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23996407,0.0009311849,0.74213964,0.0007691215,0.00017192218,0.00006540538,0.00008500171,0.00006924001,0.015804341],"genre_scores_gemma":[0.95473325,0.00051960064,0.041022953,0.000052676463,0.00006451082,0.0000402895,0.00005242263,0.00003842116,0.0034758844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948764,0.00025123803,0.000019442788,0.00006213592,0.0001357862,0.000043672328],"domain_scores_gemma":[0.9990889,0.00049919076,0.00011574742,0.00008096362,0.00014314834,0.000072078554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015861931,0.00035610306,0.0004197129,0.00037502544,0.0004423587,0.0014984295,0.0007792959,0.0008294244,0.0034177455],"category_scores_gemma":[0.005864032,0.00026239088,0.0005263195,0.0004782585,0.0011444074,0.0019438436,0.0009703301,0.0012958988,0.00015860127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199255,0.000017831868,0.0010273439,0.00004884578,0.000018838626,0.0001895384,0.000083930965,0.46134138,0.0028596353,0.52217907,0.0007147125,0.011456904],"study_design_scores_gemma":[0.0000071625163,0.000028688313,0.00026229458,0.000005813086,0.0000043663827,0.000041538922,0.000017962828,0.9581314,0.00029065026,0.040559936,0.00064224127,0.00000795268],"about_ca_topic_score_codex":0.0036792045,"about_ca_topic_score_gemma":0.0011664028,"teacher_disagreement_score":0.0036792045,"about_ca_system_score_codex":0.0007685848,"about_ca_system_score_gemma":0.00086716306,"threshold_uncertainty_score":0.011433542},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018086824855486114,"score_gpt":0.19939264924714825,"score_spread":0.18130582439166215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123748904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044608835,0.00045027432,0.9473443,0.0005895604,0.000058900747,0.00007497633,0.000044866025,0.0001315464,0.0066967914],"genre_scores_gemma":[0.6621161,0.0009205594,0.32356706,0.00010634958,0.00015042372,0.00021508851,0.00009669573,0.000116132855,0.012711536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.0002341873,0.000022487287,0.000050818267,0.00015590942,0.00003214671],"domain_scores_gemma":[0.99868625,0.00092861854,0.00010801131,0.00007914713,0.00014204455,0.00005597683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015578556,0.0006994868,0.0007555777,0.00067944906,0.0005329062,0.0013064165,0.00090971624,0.0013417585,0.0052437866],"category_scores_gemma":[0.0051476345,0.0004890372,0.00069766334,0.0009913028,0.0009607519,0.0013420703,0.0010918805,0.0016266815,0.00033147004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000682355,0.000060503313,0.0008878967,0.00006475526,0.000024842588,0.0002959507,0.00014205709,0.7632118,0.0024889973,0.20484032,0.0011195276,0.026795175],"study_design_scores_gemma":[0.000011392035,0.000017799766,0.00013929282,0.0000061248707,0.000004612518,0.000059886133,0.00001301103,0.96778584,0.00033420476,0.03018039,0.0014404,0.000007005255],"about_ca_topic_score_codex":0.0029834232,"about_ca_topic_score_gemma":0.0035116072,"teacher_disagreement_score":0.0052437866,"about_ca_system_score_codex":0.0008020763,"about_ca_system_score_gemma":0.00083154486,"threshold_uncertainty_score":0.017542183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006613941624739147,"score_gpt":0.18769602478419378,"score_spread":0.18108208315945465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124869028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10336437,0.0014568173,0.88876015,0.00077725673,0.00011636229,0.000040503437,0.000053847543,0.000093468436,0.0053372486],"genre_scores_gemma":[0.9118055,0.0008083847,0.08276651,0.00012778312,0.000068481044,0.000058897418,0.000079567006,0.000043002052,0.0042418316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992706,0.00028862723,0.000042701373,0.00017678074,0.00015146693,0.000069798116],"domain_scores_gemma":[0.99828327,0.0012594148,0.00015555925,0.000098759876,0.00011043202,0.000092639195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021405485,0.0006915728,0.0011072641,0.0005835537,0.0003147673,0.0019172117,0.0007663786,0.0015301366,0.0024515244],"category_scores_gemma":[0.00626377,0.00062153616,0.0006463779,0.0005813069,0.0017330586,0.0025170448,0.0009031813,0.001308696,0.00015238585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010501475,0.00010895745,0.0007547474,0.00013996499,0.000067333254,0.00013962596,0.00011574141,0.7683968,0.0022541473,0.20528099,0.0006606231,0.021976069],"study_design_scores_gemma":[0.000028161881,0.00005194628,0.00021839354,0.000015974289,0.000012462994,0.00002568535,0.000026807573,0.910789,0.0005558134,0.087722845,0.0005375651,0.00001531145],"about_ca_topic_score_codex":0.0014946624,"about_ca_topic_score_gemma":0.0009654817,"teacher_disagreement_score":0.0024515244,"about_ca_system_score_codex":0.0011057557,"about_ca_system_score_gemma":0.0009559946,"threshold_uncertainty_score":0.011320472},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013668052445914097,"score_gpt":0.19025290748750912,"score_spread":0.17658485504159502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125688599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04658337,0.00036053153,0.95049816,0.00047929582,0.000014562548,0.0000641774,0.00013142815,0.00017295557,0.0016954569],"genre_scores_gemma":[0.66888696,0.00085273146,0.3218479,0.00017012846,0.00009423303,0.00039854168,0.0006335216,0.00012518506,0.0069907107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973949,0.0014757045,0.00014008251,0.0004210999,0.00041888014,0.00014932199],"domain_scores_gemma":[0.9845957,0.012883751,0.0010511035,0.0007551723,0.0005851999,0.00012900648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007885674,0.0006908463,0.0015682941,0.0017060903,0.0006816744,0.0018866729,0.002299527,0.0019663265,0.0031500761],"category_scores_gemma":[0.029108675,0.00083269103,0.0013285411,0.001901719,0.0012102287,0.0034295127,0.0017258913,0.0022023385,0.00066125835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080538484,0.00006307206,0.013674644,0.00010117755,0.00011453706,0.00039383516,0.00038970387,0.7742181,0.00050049013,0.1366557,0.0015123774,0.07229588],"study_design_scores_gemma":[0.000012486322,0.00002518876,0.0015199288,0.000020596792,0.000014032712,0.00012382474,0.000046042394,0.91304827,0.00028056622,0.083922975,0.00095716194,0.000028951361],"about_ca_topic_score_codex":0.004899616,"about_ca_topic_score_gemma":0.0036559277,"teacher_disagreement_score":0.007885674,"about_ca_system_score_codex":0.0011360543,"about_ca_system_score_gemma":0.0010611938,"threshold_uncertainty_score":0.04170394},"labels":[],"label_agreement":null},{"id":"W3125962037","doi":"","title":"Replication methods for financial indexes","year":2017,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Replication (statistics); Portfolio; Replicate; Replicating portfolio; Computer science; Stochastic game; Index (typography); Econometrics; Project portfolio management; Asset (computer security); Portfolio optimization; Economics; Finance; Mathematics; Mathematical economics; Statistics; Project management","score_opus":0.05686322340515852,"score_gpt":0.3283049231625737,"score_spread":0.27144169975741517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125962037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017085518,0.0009665321,0.99311286,0.00036065828,0.00026605956,0.00024650714,0.00031096823,0.0007160374,0.002311742],"genre_scores_gemma":[0.12084298,0.0020283856,0.8619083,0.000674643,0.0014542356,0.0028741576,0.0017128482,0.0014275847,0.0070768227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9498051,0.028849177,0.003192697,0.008375282,0.008793663,0.0009841254],"domain_scores_gemma":[0.7833161,0.13716885,0.012532943,0.053361606,0.012310404,0.0013100876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0426658,0.002616164,0.0029258665,0.0063471505,0.002202873,0.0062393816,0.0055494434,0.004111415,0.013584878],"category_scores_gemma":[0.2330847,0.0018208242,0.004327541,0.005995954,0.0059227897,0.010697906,0.006641711,0.0058275573,0.0051771216],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026380218,0.00010412868,0.0050210156,0.00068350206,0.00053440145,0.00031289514,0.00082264736,0.0484679,0.0013560666,0.7283865,0.007913711,0.20613343],"study_design_scores_gemma":[0.000096400196,0.00012531418,0.0008321894,0.00022984795,0.00011199662,0.0003317871,0.00013757347,0.22743537,0.0014391532,0.744953,0.024191508,0.0001159316],"about_ca_topic_score_codex":0.0032692992,"about_ca_topic_score_gemma":0.0017450966,"teacher_disagreement_score":0.0426658,"about_ca_system_score_codex":0.0027616222,"about_ca_system_score_gemma":0.0033166334,"threshold_uncertainty_score":0.22564101},"labels":[],"label_agreement":null},{"id":"W3135177914","doi":"","title":"Comptes rendus du neuvième atelier de résolution de problèmes industriels de Montréal, 19-23 août 2019 / Proceedings of the ninth Montréal industrial problem solving workshop, August 19-23, 2019","year":2020,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Sustainable Industrial Ecology","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ninth; Humanities; Art; Physics","score_opus":0.01578432158929575,"score_gpt":0.19626667228920883,"score_spread":0.18048235069991309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135177914","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15084274,0.056411147,0.31728303,0.07541718,0.008146357,0.0010030735,0.016288877,0.007150092,0.36745748],"genre_scores_gemma":[0.3522025,0.0144696,0.25471827,0.0034664106,0.0012274346,0.0006403684,0.018895201,0.0023580156,0.3520222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9905269,0.0024805963,0.00031773638,0.0012130708,0.0042539504,0.0012077275],"domain_scores_gemma":[0.9900725,0.0023153373,0.00032941377,0.00091894553,0.0048529673,0.0015107796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010774638,0.0017369782,0.0011538403,0.003817806,0.0031543795,0.008991388,0.0028165916,0.0024115627,0.041135054],"category_scores_gemma":[0.01819555,0.0010142158,0.0017319534,0.0023838028,0.0025033941,0.003092122,0.0035373247,0.0026678233,0.0057238955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013269295,0.00056262943,0.0067086243,0.00081593625,0.00023100793,0.0004436966,0.0018075055,0.052629843,0.00514191,0.11386979,0.30756703,0.5088951],"study_design_scores_gemma":[0.00024997955,0.0002020718,0.017559404,0.0004088005,0.00006531738,0.00020476869,0.0013764969,0.060602807,0.005568163,0.010689143,0.9029484,0.00012464999],"about_ca_topic_score_codex":0.77678764,"about_ca_topic_score_gemma":0.7833026,"teacher_disagreement_score":0.22321236,"about_ca_system_score_codex":0.021028167,"about_ca_system_score_gemma":0.029840171,"threshold_uncertainty_score":0.44905376},"labels":[],"label_agreement":null},{"id":"W3156498763","doi":"","title":"The strategic impact of adaptation in a transboundary pollution dynamic game","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Damages; Adaptation (eye); Incentive; Natural resource economics; Economics; Sequential game; Microeconomics; Environmental resource management; Environmental economics; Game theory","score_opus":0.07431145159799897,"score_gpt":0.2753828490504237,"score_spread":0.20107139745242475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156498763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86905426,0.00016623203,0.11026313,0.00080832315,0.00003800369,0.000057537844,0.00010137565,0.000046547644,0.0194646],"genre_scores_gemma":[0.99594206,0.00007063006,0.002338671,0.000037195863,0.0000027731191,0.000019792496,0.000012342624,0.00000421192,0.001572459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993419,0.00034635724,0.000016976264,0.00007399584,0.000051066112,0.00016960608],"domain_scores_gemma":[0.99837565,0.00094990537,0.00027614052,0.0000657443,0.0001146894,0.00021785073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011777017,0.00064897444,0.00065299385,0.0003653616,0.00052618684,0.0012734424,0.00071432715,0.0012113312,0.0042033535],"category_scores_gemma":[0.003975939,0.00031721318,0.0006674274,0.0002828624,0.0015999974,0.0018151694,0.0013251556,0.0010202029,0.00017305107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002576953,0.00010395797,0.0034421724,0.00008623508,0.00008577723,0.00058807497,0.00028609324,0.8733653,0.006500265,0.10953651,0.0004289218,0.0053190608],"study_design_scores_gemma":[0.00007354088,0.00032574692,0.0037740597,0.000025426878,0.000071483366,0.0001540524,0.00071193447,0.89952135,0.0012759633,0.09300407,0.0010069794,0.00005531978],"about_ca_topic_score_codex":0.0071336203,"about_ca_topic_score_gemma":0.004754426,"teacher_disagreement_score":0.0071336203,"about_ca_system_score_codex":0.001413089,"about_ca_system_score_gemma":0.0011014222,"threshold_uncertainty_score":0.0141842365},"labels":[],"label_agreement":null},{"id":"W3160276877","doi":"","title":"Coupling Climate Damages and GHG Abatement Costs in a Linear Programming Framework","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Damages; Greenhouse gas; Linear programming; Mathematical optimization; Economics; Empirical research; Climate change; Emissions trading; Environmental economics; Natural resource economics; Computer science; Operations research; Econometrics; Engineering; Mathematics","score_opus":0.03836657520294035,"score_gpt":0.2523834184863392,"score_spread":0.21401684328339887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160276877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03969648,0.00048099604,0.9456465,0.0009621233,0.000042873853,0.00005983041,0.000095318486,0.00009368441,0.012922132],"genre_scores_gemma":[0.89584,0.0014036659,0.0858723,0.00029164526,0.00013093122,0.00029805503,0.00012707412,0.00012178902,0.015914563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979668,0.0011577383,0.000056687426,0.00023720351,0.0002996778,0.00028194464],"domain_scores_gemma":[0.9963845,0.0028572043,0.00036655788,0.00011373597,0.00018033948,0.000097674165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002655151,0.0012943699,0.0013819726,0.0010670607,0.00066188443,0.003075877,0.0014820027,0.0016496347,0.005696871],"category_scores_gemma":[0.0063083144,0.0010393462,0.0013645068,0.0018892967,0.0018797948,0.0035227204,0.0018076109,0.0026523795,0.00036726118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084532,0.000021324082,0.00016216373,0.000020741243,0.000023547376,0.000028891543,0.000018203551,0.9328032,0.00009057641,0.06424404,0.000136127,0.002442631],"study_design_scores_gemma":[0.000008063602,0.000028864424,0.00022654166,0.000009699105,0.000019651847,0.000019925847,0.000035595287,0.8610525,0.00014253275,0.13783316,0.00061017997,0.00001319696],"about_ca_topic_score_codex":0.008180811,"about_ca_topic_score_gemma":0.00804901,"teacher_disagreement_score":0.008180811,"about_ca_system_score_codex":0.0034252815,"about_ca_system_score_gemma":0.0020152752,"threshold_uncertainty_score":0.024852276},"labels":[],"label_agreement":null},{"id":"W3161061639","doi":"","title":"Price of Connectivity for the vertex cover problem and the dominating set problem: Conjectures and investigation of critical graphs","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Dominating set; Bipartite graph; Vertex (graph theory); Bounded function; Discrete mathematics; Maximal independent set; Feedback vertex set; Edge cover; Connected component; Chordal graph; Graph; 1-planar graph","score_opus":0.01896815255539841,"score_gpt":0.2868417533792701,"score_spread":0.2678736008238717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161061639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5480493,0.01988758,0.28454757,0.04194807,0.001344501,0.00034000358,0.0015703803,0.0005895566,0.10172305],"genre_scores_gemma":[0.9427369,0.0073621892,0.03585785,0.0025487063,0.0024701846,0.00031654522,0.00091792457,0.0004000858,0.0073896223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726033,0.00071658526,0.00010372891,0.0007891562,0.0007618654,0.0003681875],"domain_scores_gemma":[0.9421751,0.04721763,0.0034970725,0.002702233,0.00226609,0.0021418969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043347753,0.0015271591,0.0022002198,0.0034494298,0.0023146272,0.0065400177,0.00385828,0.005202565,0.009800437],"category_scores_gemma":[0.05375391,0.0011535375,0.0022577678,0.00409074,0.0068526412,0.020890042,0.0033657486,0.0070635844,0.0006781187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003263939,0.00013977005,0.0035692262,0.00042579896,0.000087009365,0.00028557825,0.00043013215,0.026219599,0.001703845,0.94014096,0.009923396,0.01674835],"study_design_scores_gemma":[0.00007405927,0.00010029588,0.0016683493,0.0001378135,0.000057963,0.00043835273,0.00023935687,0.092195034,0.0008361613,0.8977512,0.006444228,0.000057215035],"about_ca_topic_score_codex":0.0020862531,"about_ca_topic_score_gemma":0.0010152749,"teacher_disagreement_score":0.009800437,"about_ca_system_score_codex":0.0053599956,"about_ca_system_score_gemma":0.001113821,"threshold_uncertainty_score":0.038889647},"labels":[],"label_agreement":null},{"id":"W3172907549","doi":"","title":"A stochastic online algorithm for unloading boxes from a conveyor line","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université du Québec à Chicoutimi; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sequence (biology); Algorithm; Heuristic; Computer science; Line (geometry); Simple (philosophy); Quality (philosophy); Dynamic programming; Online algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.01564426478377512,"score_gpt":0.23890303531705698,"score_spread":0.22325877053328186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172907549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025061378,0.00017315078,0.9705796,0.00016029597,0.00005793301,0.00015054521,0.00010644095,0.0009221335,0.0027885512],"genre_scores_gemma":[0.38348025,0.000178758,0.61174375,0.0001475483,0.000055649132,0.00046429128,0.00042962967,0.00014482022,0.0033553871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992712,0.0001713945,0.000037038175,0.00019531927,0.00016646681,0.00015862817],"domain_scores_gemma":[0.9988726,0.00066946197,0.00014938184,0.00009757261,0.000102515434,0.00010841209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011811384,0.0012742098,0.0016608997,0.0006855044,0.0007399921,0.00092354446,0.0018689361,0.0017524901,0.005518394],"category_scores_gemma":[0.0022827967,0.0007454743,0.00088140374,0.00076365203,0.0008057661,0.0011107372,0.0012707877,0.001266047,0.0006554099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011488218,0.000091575115,0.00029962164,0.00008623945,0.000025746773,0.000050347662,0.000031330783,0.9486505,0.0014307508,0.005696537,0.0010607113,0.04246175],"study_design_scores_gemma":[0.000034763878,0.00004214339,0.00006952373,0.0000047536187,0.0000048752568,0.000014877778,0.000006169364,0.9973084,0.00030200538,0.0018725718,0.00033482476,0.000005117384],"about_ca_topic_score_codex":0.007186092,"about_ca_topic_score_gemma":0.007902677,"teacher_disagreement_score":0.007186092,"about_ca_system_score_codex":0.0011719664,"about_ca_system_score_gemma":0.003615642,"threshold_uncertainty_score":0.01846093},"labels":[],"label_agreement":null},{"id":"W3184471030","doi":"","title":"Deep Reinforcement Learning for Optimal Stopping with Application in Financial Engineering","year":2021,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Optimal stopping; Reinforcement learning; Computer science; Benchmark (surveying); Categorical variable; Stochastic control; Deep learning; Artificial intelligence; Mathematical optimization; Machine learning; Optimal control; Mathematics","score_opus":0.023690737743615155,"score_gpt":0.3158420411063364,"score_spread":0.29215130336272127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184471030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015881196,0.0049455552,0.97367847,0.001283521,0.00014529114,0.00003872781,0.00007593391,0.00040424464,0.0035471441],"genre_scores_gemma":[0.79115593,0.0042884285,0.19804637,0.0005097839,0.00026217237,0.0002497173,0.00025718048,0.00016046311,0.0050699543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992223,0.0003436784,0.000052995456,0.00014250378,0.0001697615,0.00006877101],"domain_scores_gemma":[0.9936326,0.005217037,0.00029718014,0.0001808272,0.0004924289,0.00017994126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027913023,0.0012185873,0.0016440151,0.00082612934,0.00042714213,0.0013264586,0.0011429971,0.0017020184,0.003221501],"category_scores_gemma":[0.014576906,0.0005364098,0.00064096844,0.001073084,0.001435846,0.0013438156,0.0013887865,0.0032963585,0.00042793338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006981685,0.00007966509,0.0013155878,0.00021914537,0.00006820371,0.000059328904,0.000065596185,0.886597,0.00062623876,0.05738948,0.0013541278,0.052155957],"study_design_scores_gemma":[0.000008325746,0.00001636262,0.000066695946,0.000015977133,0.000004672156,0.0000051785246,0.0000033329943,0.9806224,0.00014862638,0.018683622,0.00042048184,0.0000042201364],"about_ca_topic_score_codex":0.006102272,"about_ca_topic_score_gemma":0.004198622,"teacher_disagreement_score":0.006102272,"about_ca_system_score_codex":0.0016452122,"about_ca_system_score_gemma":0.0017008245,"threshold_uncertainty_score":0.014761984},"labels":[],"label_agreement":null},{"id":"W3212490479","doi":"","title":"Exact Analysis of a Paired Sibling Study","year":2001,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Economic Policies and Impacts","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Goodness of fit; Sibling; Monte Carlo method; Statistics; Mathematics; Independence (probability theory); Set (abstract data type); Psychology; Computer science; Developmental psychology","score_opus":0.03458034443270312,"score_gpt":0.23501225854094107,"score_spread":0.20043191410823796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212490479","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5447479,0.0016637637,0.43741068,0.00045358198,0.00026227112,0.0007532863,0.004019251,0.00021033066,0.010478828],"genre_scores_gemma":[0.9500893,0.00020300408,0.045063324,0.00015134877,0.0000777254,0.00066972186,0.0015172466,0.000031099044,0.0021973297],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.951818,0.033288438,0.0014165647,0.0057142004,0.0064878697,0.0012748974],"domain_scores_gemma":[0.84038115,0.12601194,0.006266429,0.023133093,0.0030504623,0.001156975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038380668,0.00039014278,0.0015226484,0.0016042236,0.0009815656,0.0011022467,0.0018981466,0.0009621754,0.01717172],"category_scores_gemma":[0.11649014,0.00038478107,0.0011705133,0.002070942,0.0020731606,0.0016355912,0.0020397876,0.0013568205,0.0007397435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003961932,0.00072187366,0.36140433,0.0010398437,0.0038903914,0.006273907,0.0030277877,0.021839265,0.004383376,0.29050606,0.0102782715,0.29267302],"study_design_scores_gemma":[0.00082625716,0.00376195,0.25641868,0.0003051626,0.001829341,0.010147871,0.0026099961,0.24093446,0.005997326,0.4486685,0.02833993,0.0001604875],"about_ca_topic_score_codex":0.0010017081,"about_ca_topic_score_gemma":0.0008916784,"teacher_disagreement_score":0.038380668,"about_ca_system_score_codex":0.0005855232,"about_ca_system_score_gemma":0.0010251318,"threshold_uncertainty_score":0.20297879},"labels":[],"label_agreement":null},{"id":"W33127994","doi":"10.1038/s41598-020-75729-8","title":"Stochastic Hybrid Systems: Stability and Stabilization","year":2004,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Constant (computer programming); Norm (philosophy); Applied mathematics; Bounded function; Mathematical economics; Control theory (sociology); Computer science; Philosophy; Control (management); Mathematical analysis","score_opus":0.007413350854792146,"score_gpt":0.17232283418902963,"score_spread":0.1649094833342375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33127994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077919945,0.002055586,0.89388674,0.0023238417,0.00025029198,0.000072918425,0.00028916166,0.0003879028,0.022813583],"genre_scores_gemma":[0.98098505,0.0009504174,0.010300762,0.00015845805,0.00011530982,0.00015973664,0.00014179738,0.000043833465,0.0071445666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.00023055435,0.000031757187,0.00017324316,0.00012150171,0.00008930688],"domain_scores_gemma":[0.9964671,0.002221941,0.0005888983,0.0001318476,0.0004619011,0.00012828488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014562468,0.00085555285,0.0010803888,0.0006497815,0.0008483042,0.0018784549,0.00070603576,0.0011905318,0.0033244085],"category_scores_gemma":[0.0062214015,0.00034306393,0.0007652525,0.00045176773,0.0022606538,0.00093113724,0.0019515314,0.0014801725,0.0004232829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011856803,0.000032908516,0.0031434067,0.00016888017,0.0001463458,0.00022475509,0.00028010333,0.82036227,0.0023073247,0.157548,0.0020481064,0.01361939],"study_design_scores_gemma":[0.000013900672,0.000024790177,0.00063705136,0.00001635134,0.00001296271,0.000019253619,0.000056018853,0.9519684,0.00019848366,0.045932714,0.0011063943,0.0000138824425],"about_ca_topic_score_codex":0.009931241,"about_ca_topic_score_gemma":0.0040949653,"teacher_disagreement_score":0.009931241,"about_ca_system_score_codex":0.0012728489,"about_ca_system_score_gemma":0.00096643984,"threshold_uncertainty_score":0.01974684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; HEC Montréal","funders":"","keywords":"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","score_opus":0.026079749883816547,"score_gpt":0.26129814585476147,"score_spread":0.2352183959709449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W341116111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025681766,0.00018400082,0.9711897,0.00036069666,0.000031768108,0.000028075392,0.000023069577,0.00008629885,0.0024146996],"genre_scores_gemma":[0.67864496,0.00045222993,0.31486362,0.00014777487,0.00009814009,0.0001866543,0.00009969622,0.00009262185,0.0054143085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993755,0.00034056764,0.000030267885,0.00006182662,0.0001408089,0.000051087995],"domain_scores_gemma":[0.9957911,0.0029167987,0.00028051715,0.00039056916,0.00039381513,0.00022719266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030565464,0.0004981494,0.0009809382,0.0008294762,0.00053303654,0.001201398,0.0010881366,0.0010645108,0.003256035],"category_scores_gemma":[0.008869,0.00045751475,0.0007302605,0.00055615354,0.0017816477,0.0016689593,0.0015136192,0.0017889759,0.00038938815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005158318,0.000039982377,0.00082922203,0.000043774944,0.000017146898,0.000087580665,0.00007324132,0.68231326,0.0013427563,0.30579913,0.0003447929,0.009057543],"study_design_scores_gemma":[0.000004009091,0.00000450771,0.000019877038,0.0000025112042,0.0000010211659,0.0000046065425,0.0000016735567,0.983508,0.0001277026,0.016203849,0.00011966349,0.0000024811668],"about_ca_topic_score_codex":0.0026824626,"about_ca_topic_score_gemma":0.0018001881,"teacher_disagreement_score":0.003256035,"about_ca_system_score_codex":0.0011047154,"about_ca_system_score_gemma":0.0013680911,"threshold_uncertainty_score":0.01616472},"labels":[],"label_agreement":null},{"id":"W36656422","doi":"","title":"Competitive Price-Matching Guarantees in an Uncertain Demand Environment","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Newsvendor model; Tacit collusion; Collusion; Microeconomics; Economics; Order (exchange); Bertrand competition; Matching (statistics); Competition (biology); Product (mathematics); Demand curve; Industrial organization; Business; Oligopoly; Marketing; Cournot competition; Supply chain","score_opus":0.012514590643213027,"score_gpt":0.21408368524300955,"score_spread":0.20156909459979652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36656422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5093091,0.0003760206,0.45907542,0.0017300156,0.00006681544,0.00015242354,0.00091346353,0.00031460155,0.028062193],"genre_scores_gemma":[0.99007726,0.00015310092,0.0073541384,0.000053758144,0.00002866253,0.000042025218,0.00007557364,0.00002017215,0.0021952032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970879,0.0008859875,0.00014990858,0.0006053684,0.00062631373,0.00064458925],"domain_scores_gemma":[0.9826392,0.010552735,0.0041329223,0.0011380895,0.000961187,0.00057589466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029924305,0.00096591463,0.0015306378,0.00066037284,0.0008990763,0.002719817,0.0019948606,0.0024434892,0.0050555714],"category_scores_gemma":[0.01610904,0.0009968437,0.0011895411,0.0007754261,0.0024473357,0.004424959,0.0019686392,0.0021111157,0.00051385927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034593747,0.00017718045,0.00289376,0.00015078524,0.0000938003,0.0011065429,0.00045739845,0.48053733,0.0033099472,0.50143814,0.0014890857,0.008000134],"study_design_scores_gemma":[0.00006582155,0.0001311986,0.0011245131,0.000014914187,0.00003665971,0.00015320763,0.00016993994,0.8526672,0.0006344852,0.14398065,0.00096630753,0.000055151108],"about_ca_topic_score_codex":0.005159758,"about_ca_topic_score_gemma":0.0034645197,"teacher_disagreement_score":0.005159758,"about_ca_system_score_codex":0.0018000912,"about_ca_system_score_gemma":0.0011068617,"threshold_uncertainty_score":0.01691258},"labels":[],"label_agreement":null},{"id":"W54355086","doi":"","title":"The Strategic Value of a Seller's Advance Booking Discount Program","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Microeconomics; Product (mathematics); Profit (economics); Value (mathematics); Economics; Incentive; Business; Welfare economics; Mathematics","score_opus":0.011931242094598131,"score_gpt":0.2426891329497854,"score_spread":0.23075789085518725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54355086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8780014,0.0008145624,0.060604338,0.0015151849,0.000042756423,0.00012876376,0.00027736367,0.00007033326,0.05854531],"genre_scores_gemma":[0.9958203,0.00016188546,0.0021704978,0.000035475616,0.0000095937785,0.000015531394,0.000020271253,0.0000050944595,0.0017613397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990509,0.0005037751,0.0000293654,0.000107024985,0.00012260767,0.0001862692],"domain_scores_gemma":[0.9944131,0.0040473677,0.000710564,0.0001844043,0.00022115519,0.00042345878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021862534,0.0005717703,0.0006119632,0.00046193533,0.0005321765,0.0020084889,0.0009388604,0.0015984245,0.0046880706],"category_scores_gemma":[0.006635761,0.000442747,0.000677435,0.0004321338,0.0019031715,0.0025765528,0.0012386687,0.0014735641,0.00017435403],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016703607,0.0005178643,0.01005248,0.00036789908,0.00025434396,0.0013671215,0.0003700249,0.5722484,0.0053379308,0.378953,0.0014130605,0.027447429],"study_design_scores_gemma":[0.00024582067,0.0015241564,0.0058126412,0.00009283384,0.00019284752,0.00036338813,0.0006482689,0.8040877,0.0018383241,0.18238556,0.0026887134,0.00011964084],"about_ca_topic_score_codex":0.0032555196,"about_ca_topic_score_gemma":0.0019976015,"teacher_disagreement_score":0.0046880706,"about_ca_system_score_codex":0.0023953596,"about_ca_system_score_gemma":0.0012939065,"threshold_uncertainty_score":0.017379642},"labels":[],"label_agreement":null}]}