{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44047606,0.0001758851,0.55459726,0.00060242304,0.00023458549,0.00007651024,0.0000033037375,0.00013678233,0.003697163],"genre_scores_gemma":[0.50865436,0.000025440382,0.49064037,0.00033436183,0.00012235991,0.000011472528,0.000008026244,0.000010599957,0.00019303623],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99886906,0.000020960026,0.00023904581,0.00037115274,0.00016309317,0.0003366903],"domain_scores_gemma":[0.99919057,0.00015893418,0.00006632416,0.00046576528,0.000025590256,0.0000928212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063899864,0.00011007288,0.00012365167,0.0002654335,0.00019412351,0.00011074157,0.00061758916,0.000085594394,0.0000034774318],"category_scores_gemma":[0.0000553369,0.000113426206,0.000041799067,0.00094430667,0.00008085862,0.00029511526,0.00009834217,0.00021916715,0.000017246879],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026110665,0.00008846034,0.0038926727,0.000013200619,0.000013615856,0.00007344688,0.0050840448,0.00002503756,0.00088840525,0.3589674,0.0024970316,0.6284541],"study_design_scores_gemma":[0.00570851,0.0005582537,0.4817489,0.00076560874,0.00008064529,0.00063520396,0.01289527,0.17280689,0.019780388,0.10833236,0.19157496,0.005112987],"about_ca_topic_score_codex":0.00015272968,"about_ca_topic_score_gemma":0.000026255813,"teacher_disagreement_score":0.6233411,"about_ca_system_score_codex":0.00007335426,"about_ca_system_score_gemma":0.000026079091,"threshold_uncertainty_score":0.46253866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.848958,0.032902386,0.07108189,0.024100224,0.008179549,0.0016445715,0.0049276175,0.00006319246,0.008142534],"genre_scores_gemma":[0.9669362,0.000110138586,0.004439742,0.00022340255,0.00079045154,0.00004211379,0.00003653352,0.000038966606,0.027382506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981306,0.000039034956,0.000917766,0.00043470156,0.000072917464,0.0004049667],"domain_scores_gemma":[0.9980885,0.00043024315,0.00067728106,0.00061565574,0.0001302204,0.000058105798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044028272,0.00023080994,0.00064479286,0.00014716468,0.00050734356,0.00008597706,0.00038125223,0.00026279912,0.0006748128],"category_scores_gemma":[0.0002994494,0.00023173698,0.00068606384,0.0005009237,0.00043276162,0.000117336356,0.000050706265,0.00019321537,0.000041820134],"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.00008547972,0.00040879086,0.07559023,0.00032877614,0.00019332947,0.0000065665777,0.0003387991,0.005534665,0.00047586628,0.8985339,0.015695669,0.00280793],"study_design_scores_gemma":[0.0033676543,0.00030649445,0.08898091,0.00020193677,0.00030218222,0.00002358703,0.00034865105,0.060583957,0.0010860822,0.07639373,0.76748216,0.0009226751],"about_ca_topic_score_codex":0.0063244207,"about_ca_topic_score_gemma":0.0019828517,"teacher_disagreement_score":0.82214016,"about_ca_system_score_codex":0.00015990634,"about_ca_system_score_gemma":0.00006282241,"threshold_uncertainty_score":0.95606744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97137755,0.0005302893,0.0150615005,0.0010067695,0.00032094916,0.0002806523,0.000087131666,0.00005086701,0.0112842675],"genre_scores_gemma":[0.99547523,0.00009670824,0.0017486124,0.0011685138,0.00006270596,0.000022300053,0.000017607106,0.000022406866,0.0013859277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984946,0.000017437898,0.00058167573,0.00046267794,0.000025402422,0.00041815444],"domain_scores_gemma":[0.9992183,0.0000349684,0.00023677056,0.00037472814,0.000010145785,0.00012507701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028208646,0.00020613277,0.00043358735,0.00022827544,0.00009174422,0.00006204935,0.00025129007,0.00017845958,0.000102109596],"category_scores_gemma":[0.00007404929,0.00025278653,0.00010974178,0.00016096736,0.00011124339,0.0002390053,0.000029338615,0.00029178016,0.00019696889],"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.000015644142,0.000094444265,0.0058640996,0.0000067644946,0.000019749608,0.0000052058913,0.0014729263,0.0014893175,0.00001629468,0.9894423,0.0000524025,0.00152084],"study_design_scores_gemma":[0.001483524,0.000107551044,0.055677522,0.000017023147,0.0000058221185,0.000011776175,0.00013616082,0.015048604,0.000015301115,0.9177477,0.009266647,0.00048238228],"about_ca_topic_score_codex":0.0003321936,"about_ca_topic_score_gemma":0.00017917423,"teacher_disagreement_score":0.07169463,"about_ca_system_score_codex":0.00050127355,"about_ca_system_score_gemma":0.000020743782,"threshold_uncertainty_score":0.99999243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36046535,0.000108363434,0.6328241,0.0032405842,0.00023508597,0.0001849195,0.0000012132283,0.0003177379,0.0026226633],"genre_scores_gemma":[0.9862422,0.00000394116,0.011312382,0.0020370707,0.00021592183,0.000014043718,8.064535e-7,0.000009135437,0.00016453398],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991713,0.000106027095,0.00014308692,0.00020114878,0.00018105622,0.00019736712],"domain_scores_gemma":[0.99929065,0.00016027158,0.00007263035,0.0004220631,0.00003699645,0.000017371289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030615626,0.00009808089,0.00007631625,0.000058309848,0.0006801203,0.00023122616,0.0004908591,0.000057831847,0.0000070904744],"category_scores_gemma":[0.00003542172,0.00006264499,0.000053247313,0.00026203942,0.00011849365,0.00015829857,0.0000560119,0.00023034499,0.000012852903],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005242948,0.00023086923,0.0004902249,0.00006939351,0.000051411338,0.000213892,0.012144111,0.000301834,0.15759082,0.18571217,0.017156757,0.6259861],"study_design_scores_gemma":[0.0003063273,0.00022313546,0.0035888285,0.00006723972,0.000017778319,0.0002965719,0.0007058274,0.03054301,0.91312903,0.034172248,0.016447246,0.0005027305],"about_ca_topic_score_codex":0.00040341791,"about_ca_topic_score_gemma":0.000016032884,"teacher_disagreement_score":0.7555382,"about_ca_system_score_codex":0.00007459744,"about_ca_system_score_gemma":0.000019350671,"threshold_uncertainty_score":0.52310044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13701549,0.000082774146,0.8624191,0.000080395694,0.00014187198,0.00008286446,0.0000038349467,0.000042718177,0.00013093081],"genre_scores_gemma":[0.87894166,0.00007261261,0.120735906,0.00003589106,0.00016042721,0.000003873009,0.000026422156,0.0000067187284,0.000016499696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.000023007453,0.00017134368,0.000054248467,0.00006962417,0.000083426086],"domain_scores_gemma":[0.99976885,0.00005645975,0.000040944407,0.00008229463,0.000037317106,0.000014146021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010018152,0.00007394624,0.00010036706,0.000032578726,0.00008566046,0.000016970778,0.00006533489,0.000051150524,0.000008457132],"category_scores_gemma":[0.00004113782,0.00005591866,0.000022633365,0.00006870665,0.00006409716,0.00006310782,0.0000036449298,0.00006921656,3.2709525e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034089036,0.000011473389,0.0000018563395,0.000007559897,0.000009430051,2.7198007e-7,0.001930999,0.95154625,0.019215586,0.021319041,0.00014548672,0.005777983],"study_design_scores_gemma":[0.0008873833,0.00027078993,0.00032752627,0.000060813476,0.00004298482,0.0000047344097,0.00033548893,0.49878174,0.45125854,0.047217336,0.00057331286,0.00023934693],"about_ca_topic_score_codex":0.000019389729,"about_ca_topic_score_gemma":0.000002989232,"teacher_disagreement_score":0.74192613,"about_ca_system_score_codex":0.000029528966,"about_ca_system_score_gemma":0.000008040144,"threshold_uncertainty_score":0.22802968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27581683,0.00072185014,0.7158249,0.0044695106,0.00224384,0.00017902991,0.00013299406,0.000095057316,0.00051599887],"genre_scores_gemma":[0.13522233,0.0002405767,0.8486757,0.0032540243,0.0014912938,0.000014184444,0.00004556586,0.000061005376,0.010995322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977955,0.00008278885,0.0004272007,0.00068694784,0.00037259984,0.0006349575],"domain_scores_gemma":[0.99834317,0.00013672646,0.0001500011,0.0008293076,0.00015272382,0.00038804938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023100505,0.00029600592,0.00029439435,0.0001374437,0.00087503553,0.00027304873,0.00088340347,0.0001827775,0.000058735488],"category_scores_gemma":[0.00010084728,0.0003440734,0.00010385477,0.0006370403,0.000357591,0.000359459,0.00028580916,0.00034431703,0.00027352397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000795838,0.0003572385,0.005959457,0.00010120716,0.00013286169,0.0011135258,0.051456816,0.0015623035,0.0014142833,0.06896596,0.06442509,0.8045033],"study_design_scores_gemma":[0.0008223968,0.00021637775,0.007014373,0.00029597184,0.00009537673,0.0016494445,0.0008950274,0.6332771,0.0011415249,0.0016055149,0.3516411,0.0013457724],"about_ca_topic_score_codex":0.0014176102,"about_ca_topic_score_gemma":0.000027380655,"teacher_disagreement_score":0.8031575,"about_ca_system_score_codex":0.00026065233,"about_ca_system_score_gemma":0.00016917504,"threshold_uncertainty_score":0.9999011},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30316055,0.000022800761,0.6943326,0.00013393145,0.00002582074,0.00011865846,0.0000013684246,0.000012254059,0.0021919964],"genre_scores_gemma":[0.9709097,0.000009214615,0.02800449,0.00057820865,0.00009520838,0.00008750625,0.000054777025,0.0000135408345,0.00024735674],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931645,0.000057256308,0.00012098068,0.00030546184,0.00006678735,0.00013307006],"domain_scores_gemma":[0.9997178,0.0000058601663,0.000039718714,0.00013865536,0.000033159846,0.000064811946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018011694,0.000087985645,0.000077099794,0.00007644569,0.000086066575,0.000027080296,0.00007109781,0.00013737936,0.0000017003398],"category_scores_gemma":[0.000044672157,0.00009094263,0.000017279044,0.00014090943,0.000027830596,0.000004126283,0.000018476652,0.00007468939,0.0000010886486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007670954,0.000050997616,0.0026389454,0.000027083965,0.00000426205,2.9769142e-8,0.00012721367,0.042498562,0.9442716,0.00487886,0.0012271072,0.0041986075],"study_design_scores_gemma":[0.0007839436,0.00010131965,0.010629026,0.00000973583,0.000007768601,0.000002860994,0.00013908614,0.9222586,0.030731848,0.0011267504,0.03396969,0.00023934641],"about_ca_topic_score_codex":0.000019468342,"about_ca_topic_score_gemma":0.000020099164,"teacher_disagreement_score":0.91353977,"about_ca_system_score_codex":0.000043888078,"about_ca_system_score_gemma":0.0000339318,"threshold_uncertainty_score":0.3708533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86070406,0.00036759727,0.00016777513,0.0002536981,0.0008657498,0.00009936679,0.0000272575,0.000012354324,0.13750212],"genre_scores_gemma":[0.9984993,0.00018146497,0.00036187543,0.0004967023,0.00015202443,0.000016074324,0.000008171827,0.0000102948015,0.00027409315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991108,0.000031887394,0.00039961628,0.00021406233,0.000042279804,0.00020134026],"domain_scores_gemma":[0.9994785,0.00009674278,0.00016694835,0.00021237982,0.00001893246,0.000026476126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061138585,0.000108150154,0.00021099363,0.00012450485,0.00011230417,0.000040051218,0.00021889804,0.00030604558,0.0002449617],"category_scores_gemma":[0.0001681703,0.000096095704,0.000091956186,0.00021151976,0.00035427944,0.00015499128,0.000019112376,0.00044984446,0.000045911715],"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.00015882669,0.000069914364,0.055515584,0.000015014439,0.000013888385,0.0000044307326,0.0054556816,0.0000035289786,0.0000065025797,0.9378141,0.00072203216,0.00022045578],"study_design_scores_gemma":[0.0011503106,0.0003585852,0.8150558,0.000007184938,0.0000047760873,0.0000032180837,0.0007808566,0.000107667496,0.00009243014,0.15633531,0.025895135,0.00020876178],"about_ca_topic_score_codex":0.00056464324,"about_ca_topic_score_gemma":0.000089966125,"teacher_disagreement_score":0.7814788,"about_ca_system_score_codex":0.00006231996,"about_ca_system_score_gemma":0.00001477306,"threshold_uncertainty_score":0.39186692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029989902,0.000063902175,0.9655849,0.001821098,0.00037760197,0.00021554639,0.000004488651,0.00022171465,0.0017208518],"genre_scores_gemma":[0.96304333,0.000034161407,0.034611017,0.0014671121,0.00042558298,0.000013690133,0.000007613541,0.000028392504,0.00036910665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984743,0.000059956765,0.00024145166,0.00052008027,0.0001873155,0.0005168956],"domain_scores_gemma":[0.99897426,0.00024627763,0.00010892736,0.00043762857,0.00005619948,0.00017670196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028763598,0.00021384432,0.00025743968,0.0001124129,0.00046939234,0.00045713256,0.0006931661,0.00010506868,0.0000048648726],"category_scores_gemma":[0.00006962788,0.00021361772,0.00014813035,0.00017988973,0.00009664712,0.0003211992,0.00012804307,0.00018671548,0.0000054475836],"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.000028465001,0.00005436067,0.00016955961,0.000040937713,0.000059635375,0.00006950171,0.0010362722,0.027995177,0.00029641812,0.8251115,0.00088056276,0.14425759],"study_design_scores_gemma":[0.00028864646,0.000056426663,0.000066818706,0.00001628086,0.000013249568,0.000067752786,0.000004454477,0.89819854,0.00036059838,0.0988464,0.0018190949,0.00026172865],"about_ca_topic_score_codex":0.000027058819,"about_ca_topic_score_gemma":0.000070274305,"teacher_disagreement_score":0.93305343,"about_ca_system_score_codex":0.000108035674,"about_ca_system_score_gemma":0.000055185395,"threshold_uncertainty_score":0.87110776},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09096202,0.042447615,0.78500056,0.001228568,0.05288546,0.00087453605,0.00006664261,0.0009600543,0.025574539],"genre_scores_gemma":[0.9484381,0.0006934282,0.0100575145,0.00001144515,0.004034213,0.0003562743,0.00015301978,0.00023631116,0.03601967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980062,0.00019185433,0.0005562178,0.00040763305,0.0002790451,0.0005590197],"domain_scores_gemma":[0.99866366,0.00005200649,0.00016601238,0.00040965545,0.00043344777,0.0002752164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004515686,0.00040637064,0.0004303816,0.00024881336,0.00013226907,0.00014607448,0.00018859774,0.0008034837,0.0000043193527],"category_scores_gemma":[0.000085561565,0.000470498,0.00013689337,0.00034669903,0.00012301587,0.00012391961,0.00001821344,0.0003311804,0.000009172384],"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.000037760394,0.000029546552,0.000008068516,0.00025867647,0.00016274684,0.0000139351205,0.002054795,0.76218164,0.0015853376,0.22690909,0.0033222914,0.0034361354],"study_design_scores_gemma":[0.0009629045,0.00017620224,0.000004193137,0.00024262875,0.00011854359,0.00021492745,0.002724576,0.7350385,0.0059385146,0.0012190072,0.25274518,0.0006148273],"about_ca_topic_score_codex":0.013280319,"about_ca_topic_score_gemma":0.00009962495,"teacher_disagreement_score":0.8574761,"about_ca_system_score_codex":0.0026127258,"about_ca_system_score_gemma":0.00013076952,"threshold_uncertainty_score":0.9997747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952389,0.00045863498,0.00019213939,0.0004389805,0.00087589247,0.00010536448,0.0000081840035,0.00006421717,0.0026177024],"genre_scores_gemma":[0.9981119,0.000010939184,0.00031449564,0.00028950596,0.0011407303,0.0000017132846,0.000033762768,0.000020044443,0.00007688375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909216,0.000010577072,0.00020444707,0.00021829286,0.00023736859,0.00023716141],"domain_scores_gemma":[0.99949294,0.000025778216,0.0001702874,0.00017106275,0.00010911928,0.000030783252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023704776,0.00016526258,0.00022392343,0.000112849586,0.00011842142,0.00012339371,0.00019878463,0.00014541142,0.000048145175],"category_scores_gemma":[0.00018543963,0.0001481653,0.00006350432,0.00016876114,0.00017773666,0.00054272,0.0001878055,0.00024023105,0.000013629841],"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.00015745265,0.00012439443,0.18386379,0.0005948857,0.00017025799,0.00007708998,0.003336808,0.0000399909,0.008301053,0.7832032,0.004894988,0.015236119],"study_design_scores_gemma":[0.008549536,0.00019683612,0.35438278,0.00021758689,0.00045001062,0.00009316933,0.015048886,0.0021391343,0.0040080543,0.4580292,0.154375,0.0025097956],"about_ca_topic_score_codex":0.00018898668,"about_ca_topic_score_gemma":0.000049198046,"teacher_disagreement_score":0.32517394,"about_ca_system_score_codex":0.0000284476,"about_ca_system_score_gemma":0.000015867574,"threshold_uncertainty_score":0.60420054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9987531,0.000078636636,0.00018902305,0.0004992532,0.00009561766,0.00025391666,0.000025326672,0.0000057811244,0.000099347366],"genre_scores_gemma":[0.99961054,0.00009643245,0.00006098526,0.00014059122,0.000042037296,0.000012569715,0.000022610322,0.0000058453493,0.000008373921],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99904585,0.00012235242,0.00016486061,0.00018611398,0.000268753,0.00021206297],"domain_scores_gemma":[0.9996577,0.000032453707,0.00010660291,0.00010637402,0.0000053494523,0.00009154965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018530863,0.0001152627,0.00011427425,0.000015590802,0.00011200977,0.000028533364,0.00010353241,0.00005365911,0.000048289163],"category_scores_gemma":[0.000018164406,0.000079639234,0.000022257744,0.000065485256,0.00028021273,0.0003817492,0.0000907371,0.0001525227,0.0000025774816],"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.00001072031,0.000027045375,0.99089974,0.000023967807,0.000008110396,0.00002295398,0.0028933976,0.00036643937,0.00055715867,0.000040753297,0.000020435888,0.005129256],"study_design_scores_gemma":[0.00031941658,0.000040892628,0.9948089,0.000020228279,0.000014825643,0.00002638752,0.003407178,0.00024574317,0.0008125599,0.00019413224,0.000007788547,0.00010193469],"about_ca_topic_score_codex":0.22123255,"about_ca_topic_score_gemma":0.4204436,"teacher_disagreement_score":0.19921103,"about_ca_system_score_codex":0.00097231637,"about_ca_system_score_gemma":0.000019238822,"threshold_uncertainty_score":0.7839533},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5479739,0.00007816665,0.45041788,0.000060526443,0.000043565637,0.00032166514,0.000017853656,0.00033591167,0.0007505438],"genre_scores_gemma":[0.8944383,0.000027912554,0.10497859,0.00004803668,0.00023350485,0.000057898353,0.00007045541,0.000075196214,0.00007005201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891084,0.000026234362,0.00030475683,0.0002646785,0.00013143149,0.0003620785],"domain_scores_gemma":[0.99940264,0.00017693803,0.00008571467,0.00014636619,0.00009563983,0.00009267144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024541613,0.00023277655,0.00027191106,0.000097925615,0.00017875335,0.00007765195,0.0000704348,0.000093938965,0.0000019327176],"category_scores_gemma":[0.0001063173,0.00022799493,0.000037551614,0.00011734536,0.00011711816,0.00012711948,0.000011341214,0.00018317236,0.0000013167271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010015509,0.000056391822,0.009507069,0.002000922,0.00027541447,0.00022445126,0.0024788282,0.9030504,0.03286049,0.040127862,0.0019298646,0.007388097],"study_design_scores_gemma":[0.0019618387,0.00017186944,0.0017155431,0.00028626484,0.00013629008,0.00026521148,0.00065478205,0.9878565,0.0046987673,0.0011786798,0.00028507138,0.00078914734],"about_ca_topic_score_codex":0.00015778009,"about_ca_topic_score_gemma":0.0000632858,"teacher_disagreement_score":0.34646448,"about_ca_system_score_codex":0.00020590682,"about_ca_system_score_gemma":0.000068365676,"threshold_uncertainty_score":0.9297363},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20204432,0.012474669,0.75946397,0.006658462,0.0011611972,0.0023584946,0.0013223434,0.00012612785,0.014390424],"genre_scores_gemma":[0.8879237,0.0008374506,0.086873576,0.00025479821,0.00025931426,0.00044637264,0.000016534235,0.00007256667,0.023315651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989299,0.00008569337,0.0003599322,0.00020685741,0.000116182964,0.00030142936],"domain_scores_gemma":[0.99802095,0.0009887102,0.00024737662,0.0005788128,0.000097334676,0.00006681283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045983004,0.00018821066,0.00025535276,0.000053553,0.00042694688,0.000018786563,0.00039888467,0.00014610907,0.00023218288],"category_scores_gemma":[0.00011162201,0.00014985586,0.00030704372,0.000292743,0.0010274682,0.000073167124,0.000023466506,0.00022110173,0.000024780029],"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.00007782281,0.00024081381,0.0001990154,0.00027513603,0.00014855228,0.000001846812,0.010099599,0.0000033506676,0.00020173591,0.98282963,0.0029165568,0.0030059258],"study_design_scores_gemma":[0.0005057967,0.00005579523,0.00013827659,0.000057226076,0.0003059428,0.0000120167115,0.0021906148,0.00014292622,0.0017766472,0.92084527,0.07380312,0.00016638616],"about_ca_topic_score_codex":0.00009918779,"about_ca_topic_score_gemma":0.00016173677,"teacher_disagreement_score":0.6858794,"about_ca_system_score_codex":0.000028405348,"about_ca_system_score_gemma":0.000027190525,"threshold_uncertainty_score":0.6110945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784703,0.00084221363,0.00037911406,0.0011282135,0.0012174237,0.00016239291,0.0000020346115,0.00024379294,0.017554488],"genre_scores_gemma":[0.99432415,0.0006669829,0.0010663625,0.00073444966,0.0029028996,0.00002915354,0.000004460615,0.000014912396,0.00025662238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799514,0.00041929304,0.00018139818,0.0002607756,0.000541649,0.0006017743],"domain_scores_gemma":[0.99914545,0.00009955698,0.000073365714,0.00018153597,0.00015093722,0.00034915886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894845,0.00013569432,0.00018072159,0.0000147583205,0.0010057794,0.00013596308,0.00032267222,0.00016895679,0.000022955084],"category_scores_gemma":[0.00029063705,0.00013457844,0.00007486336,0.00038423095,0.000646003,0.0012099477,0.00003163656,0.00028729666,0.000032137454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000069664544,0.00006800528,0.035367265,0.0000059797067,0.000035519875,0.000024875728,0.40444788,0.0011375307,0.000014301913,0.53185606,0.0057149874,0.021257898],"study_design_scores_gemma":[0.0007430392,0.00016020428,0.054104455,0.000044077104,0.000050684102,0.0000029785763,0.1008847,0.00003954919,0.00008824573,0.33927682,0.50371534,0.0008899528],"about_ca_topic_score_codex":0.0070830244,"about_ca_topic_score_gemma":0.0026126655,"teacher_disagreement_score":0.49800032,"about_ca_system_score_codex":0.000259713,"about_ca_system_score_gemma":0.00013856882,"threshold_uncertainty_score":0.9995289},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1411988,0.0032706144,0.8353242,0.0019307041,0.0004419254,0.00029436187,0.00019548034,0.00010262336,0.01724128],"genre_scores_gemma":[0.9661066,0.0010652392,0.029605938,0.0015483419,0.0005105247,0.00016795807,0.00008034029,0.000061431194,0.00085363624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999072,0.0000017464208,0.00032349763,0.00032177268,0.000032611468,0.00024836443],"domain_scores_gemma":[0.99942034,0.00003423334,0.00012425726,0.0002909976,0.00001859412,0.00011157656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002115252,0.0001308452,0.00023799941,0.00007286825,0.00026837032,0.00006105773,0.0002398168,0.00016951995,0.00019602456],"category_scores_gemma":[0.00006548513,0.00014880038,0.00007960302,0.0002442787,0.00010045369,0.00021353629,0.000010837879,0.00031061756,0.00016557147],"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.000003523272,0.000054129196,0.00038686293,0.000016395992,0.000008653024,6.4832346e-7,0.00049703644,5.626811e-7,0.00017441854,0.96847117,0.00036352247,0.030023074],"study_design_scores_gemma":[0.00027269105,0.000039396655,0.0019137888,0.0000033166987,0.0000061942646,0.0000070000947,0.000041817922,0.0008095997,0.0001450164,0.60204214,0.39446795,0.00025110602],"about_ca_topic_score_codex":0.00026282898,"about_ca_topic_score_gemma":0.00006633233,"teacher_disagreement_score":0.8249078,"about_ca_system_score_codex":0.000033817967,"about_ca_system_score_gemma":0.000015586927,"threshold_uncertainty_score":0.6067903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033202,0.0011766391,0.091572024,0.000179604,0.00041351654,0.00008758441,0.0000011118483,0.00048278618,0.0027665345],"genre_scores_gemma":[0.781439,0.000057372443,0.21799356,0.00006734651,0.00028643274,0.000007206185,0.0000029975467,0.00004299885,0.000103049315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989583,0.00009194169,0.00024679626,0.00012515404,0.00012539933,0.00045239797],"domain_scores_gemma":[0.9995665,0.00011528044,0.000029708744,0.0001724104,0.000019571882,0.00009653307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864559,0.00014502573,0.00017351824,0.00012145612,0.00009687145,0.00003938011,0.00011969157,0.00015192355,0.000045434812],"category_scores_gemma":[0.00019410352,0.00016483101,0.00004163799,0.000323846,0.000040607883,0.00027918443,0.000022079821,0.00035196915,0.00004640956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009411731,0.0000628484,0.2873797,0.00011016122,0.000050568884,0.000012916661,0.016237305,0.6201088,0.015484358,0.023034645,0.00025708956,0.03725218],"study_design_scores_gemma":[0.000858116,0.00001493081,0.037359063,0.000088170906,0.000020229418,0.000019044646,0.0014796772,0.9337995,0.019684836,0.00056897226,0.0053938413,0.00071360037],"about_ca_topic_score_codex":0.000030185096,"about_ca_topic_score_gemma":0.0000034579375,"teacher_disagreement_score":0.31369072,"about_ca_system_score_codex":0.0001620735,"about_ca_system_score_gemma":0.000006223041,"threshold_uncertainty_score":0.67216134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12578738,0.019561388,0.8132619,0.030022953,0.00250146,0.0011674481,0.00020349225,0.00016197661,0.0073319618],"genre_scores_gemma":[0.9636681,0.00037535682,0.011617367,0.0008040309,0.00045626253,0.0000624229,0.00007839488,0.000047953483,0.022890106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895089,0.0014051216,0.0017654399,0.002791644,0.0031683075,0.001360539],"domain_scores_gemma":[0.9894638,0.0039516445,0.0008191576,0.00396395,0.001172266,0.0006292003],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005868649,0.0007380935,0.0015254703,0.002178206,0.0014878015,0.0015251873,0.004783441,0.0005039576,0.0061222585],"category_scores_gemma":[0.007589392,0.0006308668,0.0008688861,0.009755151,0.0025541848,0.0014243203,0.0008829442,0.0009942724,0.0055682324],"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.00041798328,0.0048487717,0.0063932044,0.00007639681,0.014355184,0.00025430927,0.10595951,0.21023749,0.000577963,0.21965988,0.06596923,0.3712501],"study_design_scores_gemma":[0.0027384406,0.00019881735,0.007517459,0.00008781383,0.005852232,0.000044532986,0.024633408,0.8739761,0.000039991395,0.061380927,0.021935336,0.0015949345],"about_ca_topic_score_codex":0.0065432074,"about_ca_topic_score_gemma":0.0009924518,"teacher_disagreement_score":0.83788073,"about_ca_system_score_codex":0.0010607665,"about_ca_system_score_gemma":0.00066179293,"threshold_uncertainty_score":0.9998121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617628,0.000029148225,0.0018129244,0.0006215434,0.0011649535,0.00020263717,0.0000017488059,0.00010221513,0.03430207],"genre_scores_gemma":[0.99565643,0.000003576181,0.00011531052,0.0008783902,0.0025730864,0.000008773216,0.00007565419,0.000018489765,0.000670275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989543,0.000010056298,0.00033767748,0.0002369805,0.00017188645,0.00028911218],"domain_scores_gemma":[0.9994953,0.00004363243,0.00012951095,0.0001252235,0.00019707684,0.000009206274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003041058,0.00017347302,0.00020370162,0.000296566,0.00020757144,0.00017163254,0.000122856,0.0001732874,0.0005121559],"category_scores_gemma":[0.00012539499,0.00016046404,0.000045247576,0.00073205045,0.00020745362,0.0007594901,0.000032238484,0.00021716513,0.00018733903],"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.0005275313,0.00029911438,0.010896232,0.0001193461,0.00005290696,0.0001249098,0.0005646355,0.000052085325,0.011070034,0.959838,0.0066664848,0.009788772],"study_design_scores_gemma":[0.01865413,0.00017865811,0.48651972,0.00046201862,0.00029198674,0.000045271558,0.004899262,0.012177225,0.0032856914,0.048263345,0.4211907,0.0040319897],"about_ca_topic_score_codex":0.00022810225,"about_ca_topic_score_gemma":0.00014724418,"teacher_disagreement_score":0.9115746,"about_ca_system_score_codex":0.000064629974,"about_ca_system_score_gemma":0.000028314318,"threshold_uncertainty_score":0.6543534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559293,0.00021278688,0.9421377,0.0003490683,0.00050906726,0.0009561956,0.000023481085,0.00007740051,0.00014134435],"genre_scores_gemma":[0.750664,0.0000071272093,0.2480202,0.00027679754,0.00041366194,0.00023128602,0.000017538096,0.00003100134,0.00033839318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776006,0.000053523057,0.0005376814,0.00049355486,0.00056222925,0.0005929438],"domain_scores_gemma":[0.99812543,0.0007228166,0.0002342548,0.00032878888,0.0001740389,0.00041465572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015064244,0.00025299907,0.0003677015,0.0003564812,0.00043124345,0.0004062717,0.00032768835,0.00017118189,0.000031577634],"category_scores_gemma":[0.0009768124,0.00020008857,0.00009052997,0.000607136,0.00017010407,0.000380727,0.00008463499,0.00020983114,0.00008590926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007822635,0.00007267191,0.00026573124,0.0000052831842,0.0000311068,0.0000011185591,0.010161452,0.028955858,0.00003645496,0.015076947,0.00045448221,0.9448607],"study_design_scores_gemma":[0.0048693977,0.00079841376,0.00648888,0.0001165411,0.0003517243,0.00011341233,0.01835057,0.86664814,0.00029185825,0.054121125,0.045041054,0.0028088633],"about_ca_topic_score_codex":0.000014648831,"about_ca_topic_score_gemma":0.000008781456,"teacher_disagreement_score":0.9420518,"about_ca_system_score_codex":0.000056455454,"about_ca_system_score_gemma":0.000046170422,"threshold_uncertainty_score":0.8159375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022291329,0.009711148,0.95284,0.0012294479,0.0012999286,0.00010564946,0.000017267532,0.00037539142,0.0121298535],"genre_scores_gemma":[0.30501944,0.011101058,0.6621869,0.0001154091,0.0004982785,0.000014750046,0.000025626909,0.000059682872,0.020978857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989753,0.000049914703,0.00019070826,0.00020747315,0.00009427292,0.00048235088],"domain_scores_gemma":[0.99951553,0.00008434136,0.000045123183,0.0002005033,0.000036958292,0.000117527765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009714673,0.00020790446,0.0001581847,0.000085387226,0.00026754153,0.00005809543,0.00012305223,0.00031966378,0.000613856],"category_scores_gemma":[0.00013909089,0.0002451352,0.000081462014,0.00011933806,0.0003561013,0.00018203573,0.00001955534,0.00037513737,0.00022529456],"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.000007919882,0.00007583065,0.0004183447,0.0002855065,0.000069809284,0.00009350728,0.0016267817,0.4831756,0.000201939,0.40143573,0.00741747,0.10519153],"study_design_scores_gemma":[0.0007830337,0.000124143,0.0029864777,0.00008829466,0.00015389596,0.00013235748,0.00045488932,0.19165301,0.005129621,0.7469922,0.05074429,0.0007578253],"about_ca_topic_score_codex":0.00011906191,"about_ca_topic_score_gemma":0.000020013988,"teacher_disagreement_score":0.3455564,"about_ca_system_score_codex":0.0006227544,"about_ca_system_score_gemma":0.0000070048027,"threshold_uncertainty_score":0.9996323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6912883,0.00017588834,0.30450436,0.00018609097,0.00020028291,0.00029924008,0.000029826799,0.00012975167,0.0031862715],"genre_scores_gemma":[0.99664116,0.00002029567,0.0031781793,0.00002682725,0.00002840834,0.000011422383,0.000012296447,0.000017985682,0.00006342034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.000053849948,0.00023698651,0.0000920066,0.00016601791,0.00011779769],"domain_scores_gemma":[0.9993008,0.00030930812,0.00007788768,0.00024672935,0.000046449684,0.000018834851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014348826,0.00010742038,0.00013540311,0.00006756781,0.00011680229,0.000009269083,0.00013381512,0.00006832056,0.000010074203],"category_scores_gemma":[0.00012566536,0.00007298886,0.000038409737,0.00016682815,0.00011401062,0.000043307693,0.0000069594735,0.00018150061,0.0000016422495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020700572,0.000012145756,0.00013495612,0.00008201059,0.000010330725,0.00000868806,0.0019700534,0.9941173,0.00025785615,0.0031592252,0.0001103513,0.000116342286],"study_design_scores_gemma":[0.0006540072,0.000051800864,0.0046636867,0.0001872807,0.00002103987,0.0000095928235,0.0015051952,0.98029566,0.01152413,0.00019699211,0.00066818553,0.00022244267],"about_ca_topic_score_codex":0.00003967735,"about_ca_topic_score_gemma":0.000016915848,"teacher_disagreement_score":0.3053529,"about_ca_system_score_codex":0.00013525644,"about_ca_system_score_gemma":0.000025840753,"threshold_uncertainty_score":0.29763997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3982833,0.062702574,0.25787792,0.26774976,0.003015863,0.001001897,0.000034347227,0.00011063652,0.0092236865],"genre_scores_gemma":[0.88196826,0.012852807,0.00681199,0.009860258,0.00082349376,0.000048010857,0.000005490612,0.000029296303,0.087600425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953794,0.0012270904,0.0008492711,0.0007682082,0.0010766397,0.0006993839],"domain_scores_gemma":[0.99580836,0.0022570249,0.00029932283,0.0011402558,0.00025924662,0.00023578967],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0056202314,0.00037350273,0.00049245905,0.00008847478,0.003284284,0.0011207226,0.000968851,0.00047952196,0.00007880756],"category_scores_gemma":[0.0011033644,0.0001879816,0.00037063134,0.0005557432,0.004632793,0.0006384159,0.00012463912,0.00083659805,0.00011339447],"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.00060248753,0.00006672733,0.00006135996,0.00000507391,0.000043339754,0.0000034885143,0.0035240045,0.0085094515,0.000054791013,0.7415434,0.008613305,0.23697254],"study_design_scores_gemma":[0.0014057305,0.000072750096,0.00050557725,0.00001129197,0.00008002356,0.000024501413,0.00043964494,0.26853323,0.000019160403,0.67003256,0.058683436,0.00019209401],"about_ca_topic_score_codex":0.00029210735,"about_ca_topic_score_gemma":0.00026843723,"teacher_disagreement_score":0.48368493,"about_ca_system_score_codex":0.00015350367,"about_ca_system_score_gemma":0.00019306087,"threshold_uncertainty_score":0.9999162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599258,0.004526135,0.013507509,0.006910825,0.010224001,0.00020882516,0.000053667023,0.00013996592,0.004503299],"genre_scores_gemma":[0.9428643,0.00011704066,0.040470306,0.0003421447,0.00004406465,0.0000036712809,0.000025089244,0.000022955743,0.016110409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99817526,0.00025422985,0.0004521828,0.00042517515,0.00030503378,0.0003880974],"domain_scores_gemma":[0.9976385,0.00044384223,0.00022096993,0.0007799097,0.0007139111,0.00020287247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011356783,0.00020399886,0.00027690773,0.00017797212,0.00032623872,0.00010552836,0.00054182136,0.00040112276,0.0002526422],"category_scores_gemma":[0.0007356142,0.00021040242,0.000102102254,0.0012318755,0.0007297241,0.00029413524,0.00011625803,0.00082889554,0.0003303265],"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.00001479543,0.00020526416,0.036665313,0.00003676058,0.00006081278,0.000017247547,0.002502355,0.0001374202,0.0039929785,0.92413914,0.01776287,0.014465045],"study_design_scores_gemma":[0.002157334,0.00078109954,0.49271667,0.0002367533,0.00017054465,0.00018071449,0.00011173599,0.06506259,0.0032417946,0.29301357,0.14077944,0.0015477366],"about_ca_topic_score_codex":0.0045961565,"about_ca_topic_score_gemma":0.0016889126,"teacher_disagreement_score":0.63112557,"about_ca_system_score_codex":0.00002471897,"about_ca_system_score_gemma":0.0002655719,"threshold_uncertainty_score":0.85799617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060979705,0.00005990498,0.93740743,0.00019263725,0.00043690452,0.00029544448,0.0000039941724,0.0003555565,0.0002684466],"genre_scores_gemma":[0.36691985,0.0000031478025,0.63200027,0.0007781712,0.00006742413,0.00008422468,0.0000030361803,0.000013076654,0.00013080041],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875754,0.00008188337,0.00022094471,0.00035465788,0.0002868827,0.00029810058],"domain_scores_gemma":[0.9989509,0.00051671127,0.00008362611,0.00026389284,0.000069026166,0.00011584041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034111794,0.0001448506,0.0001551157,0.000093901595,0.00032732822,0.000095230425,0.00028180148,0.00008919747,0.000028279272],"category_scores_gemma":[0.00090822886,0.00014283885,0.00007708578,0.00015351322,0.000079613645,0.00025757385,0.000033546497,0.00018336793,0.000008008153],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014015229,0.0005393048,0.0014657086,0.00022498758,0.0001706202,0.00010528856,0.01138945,0.0002577377,0.47184318,0.13395877,0.007164965,0.37273982],"study_design_scores_gemma":[0.0007820344,0.0002625808,0.00037785945,0.000040957304,0.0000063772677,0.000018127368,0.000093855466,0.004947891,0.9831084,0.0069119385,0.0031399566,0.0003100416],"about_ca_topic_score_codex":0.000018417224,"about_ca_topic_score_gemma":0.0000065613467,"teacher_disagreement_score":0.51126516,"about_ca_system_score_codex":0.000120584766,"about_ca_system_score_gemma":0.000039628703,"threshold_uncertainty_score":0.5824799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838887,0.000013432788,0.00018283662,0.0016011007,0.00018214453,0.0002466119,0.00003252207,0.0000336475,0.013819016],"genre_scores_gemma":[0.9940135,0.0000019931456,0.001217539,0.0003882834,0.00008406993,0.000035479225,0.0000012336363,0.000016924718,0.0042409617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.000108213404,0.0001691903,0.00013290718,0.0001496337,0.00014266622],"domain_scores_gemma":[0.9981522,0.0009935158,0.00011676749,0.0006685629,0.000037059213,0.000031923624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047994356,0.000108710745,0.00011661492,0.000025716445,0.0004217637,0.000018574061,0.00040845908,0.00010807533,0.00070079754],"category_scores_gemma":[0.00030727094,0.000058116948,0.00013550448,0.00014124486,0.00044598608,0.00002788055,0.000034183573,0.00045467986,0.000026531026],"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.0000053425197,0.00007203866,0.00029689635,0.000014550259,0.000020087982,3.4565952e-7,0.0011198326,4.823777e-7,0.012656734,0.9820719,0.003588201,0.00015358719],"study_design_scores_gemma":[0.000106864914,0.00001242614,0.0016134573,0.000008252549,0.000021418928,0.0000061591363,0.00024427378,0.000020144525,0.029437037,0.9613963,0.0070592994,0.000074360854],"about_ca_topic_score_codex":0.0000035393618,"about_ca_topic_score_gemma":0.000047167538,"teacher_disagreement_score":0.020675596,"about_ca_system_score_codex":0.000007995345,"about_ca_system_score_gemma":0.000017212751,"threshold_uncertainty_score":0.7673242},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028977878,0.000013972257,0.98873836,0.0038799269,0.000057369558,0.00061627687,0.002157848,0.00021109404,0.0014273883],"genre_scores_gemma":[0.40053192,0.0000060571247,0.59220105,0.0009898021,0.00020985036,0.00018817656,0.0024875896,0.00003965271,0.0033459277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989934,0.000036049147,0.00033401104,0.00028953815,0.00013294857,0.00021407231],"domain_scores_gemma":[0.9969289,0.0022121964,0.00011684581,0.000510146,0.00012378536,0.00010813811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021598376,0.00013857565,0.00016687736,0.000040240742,0.00027538443,0.00004843951,0.0002897013,0.00013639967,0.0003342944],"category_scores_gemma":[0.002167347,0.00012624753,0.000042718762,0.00016020841,0.000117672644,0.00012683241,0.000047089216,0.00015897045,0.00019437291],"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.000021596223,0.0002591283,0.000033046195,0.000026550273,0.000028992541,5.753411e-7,0.00019514498,0.000007707389,0.00023167653,0.9029669,0.085550755,0.010677894],"study_design_scores_gemma":[0.0022034396,0.00003963022,0.0010736149,0.000023138433,0.00013374556,0.000012625035,0.0000704389,0.6476603,0.00027472398,0.1907098,0.15746915,0.00032937457],"about_ca_topic_score_codex":0.000008259471,"about_ca_topic_score_gemma":0.000009159832,"teacher_disagreement_score":0.71225715,"about_ca_system_score_codex":0.00008628383,"about_ca_system_score_gemma":0.000030648953,"threshold_uncertainty_score":0.5148225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869932,0.00008107802,0.0077187256,0.0012879034,0.00035037307,0.00010545389,6.844638e-7,0.00016837419,0.0032942102],"genre_scores_gemma":[0.99496233,0.000091874914,0.0007722724,0.00274829,0.001357367,0.00001601775,0.000020531923,0.000018303273,0.000013015478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991086,0.000023944516,0.00020053575,0.0002647282,0.000116268035,0.00028592077],"domain_scores_gemma":[0.9994253,0.000035664067,0.00011612599,0.00022045273,0.00018900917,0.000013485265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003766729,0.00016970887,0.00016368246,0.000051214327,0.0006234058,0.00025130453,0.00012500824,0.00008146681,0.000014909662],"category_scores_gemma":[0.000115907926,0.00013992278,0.00002892416,0.00041765446,0.00016029079,0.0039118547,0.00004330618,0.00018969167,0.000012641933],"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.000031417116,0.000035369663,0.029435173,0.00006648707,0.000016660548,0.0000020155253,0.00039288876,0.00117352,0.0011304423,0.9450234,0.00035162218,0.022340965],"study_design_scores_gemma":[0.0005490519,0.000017971575,0.6944507,0.00009404494,0.000037828115,0.000006017335,0.0006918479,0.0037975444,0.00022297927,0.1318465,0.16772917,0.00055633805],"about_ca_topic_score_codex":0.0004466927,"about_ca_topic_score_gemma":0.0000720628,"teacher_disagreement_score":0.81317693,"about_ca_system_score_codex":0.000015181424,"about_ca_system_score_gemma":0.0000071374284,"threshold_uncertainty_score":0.5705885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851684,0.0003481191,0.010706164,0.0017682352,0.0002507551,0.0001797654,0.0000011786575,0.00057749916,0.0009999134],"genre_scores_gemma":[0.9857552,0.00019013179,0.013636251,0.000038161426,0.00016397017,0.000021586284,0.000007545897,0.000022653667,0.0001645044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992901,0.00003258563,0.0001271728,0.00015991282,0.000107865526,0.0002823337],"domain_scores_gemma":[0.99964935,0.000087940956,0.000023893914,0.00020794281,0.000015203726,0.000015653839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013663185,0.00014129313,0.00012429614,0.000085475884,0.00010312029,0.000051851886,0.00018007557,0.00017042324,0.0000031671218],"category_scores_gemma":[0.000039559032,0.00011359119,0.00004103371,0.00029956223,0.00014378097,0.00014735648,0.000017849274,0.00044502076,0.00000552718],"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.00011898034,0.0002217066,0.0024594895,0.0003302784,0.00013688157,0.0005409951,0.0046049156,0.1773331,0.09324687,0.42402112,0.026143288,0.27084237],"study_design_scores_gemma":[0.0042506396,0.0002784095,0.01022061,0.0002525021,0.0001224182,0.00036701476,0.027028441,0.49994376,0.05867611,0.24311128,0.15304299,0.002705811],"about_ca_topic_score_codex":0.000013977538,"about_ca_topic_score_gemma":0.000016569835,"teacher_disagreement_score":0.32261068,"about_ca_system_score_codex":0.00014274433,"about_ca_system_score_gemma":0.0000032071998,"threshold_uncertainty_score":0.46321142},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96968496,0.00018929387,0.0024329966,0.000699481,0.00008915319,0.0011884706,0.000016927686,0.00022693782,0.025471766],"genre_scores_gemma":[0.9821451,0.00004852639,0.015924357,0.00030818314,0.00009567548,0.00043200538,0.0000102170925,0.00004380039,0.0009921661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887586,0.000105622385,0.00020334503,0.00024860023,0.00019422763,0.00037237265],"domain_scores_gemma":[0.99893385,0.0002479702,0.00012932258,0.0005035661,0.000046159046,0.00013912657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054580695,0.0002117725,0.0002509661,0.00012966404,0.0005510862,0.0000743376,0.00046629357,0.00009786461,0.00006023355],"category_scores_gemma":[0.00004242817,0.00015503343,0.00008790114,0.00045704402,0.0002987794,0.00018923647,0.000069858994,0.00024369064,0.00004272332],"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.000036444457,0.0004089262,0.004464209,0.000034083718,0.00013553162,0.000001197801,0.0034829099,0.0000028965349,0.0001546782,0.9878852,0.0026359153,0.00075804786],"study_design_scores_gemma":[0.00067524187,0.0001689465,0.004437484,0.00005156773,0.000108985856,0.000012511678,0.0010092058,0.0000034302293,0.0008495376,0.9757013,0.01665032,0.00033148582],"about_ca_topic_score_codex":0.00002007219,"about_ca_topic_score_gemma":0.00002136594,"teacher_disagreement_score":0.0244796,"about_ca_system_score_codex":0.00002648959,"about_ca_system_score_gemma":0.000012769347,"threshold_uncertainty_score":0.632208},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06531078,0.00010721567,0.93262035,0.000049589446,0.00045394903,0.00054615294,0.000008346579,0.00036215465,0.0005414734],"genre_scores_gemma":[0.10447791,0.00004436803,0.89431983,0.00008267119,0.00028119056,0.000174783,0.00008202216,0.000079157304,0.00045805456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00010758171,0.00024664847,0.00021008655,0.00012371792,0.00023918677],"domain_scores_gemma":[0.99953884,0.000066557266,0.000048396152,0.00016859075,0.00011221015,0.000065421285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033165392,0.0001524386,0.00015073834,0.000090493646,0.00020473587,0.00007016809,0.00006729625,0.00018084365,0.000022594411],"category_scores_gemma":[0.00019196047,0.00017737036,0.000060054434,0.0002475059,0.000044412864,0.00016670415,0.0000038998437,0.00012054393,0.0000034058164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001855994,0.00011712116,0.0027160777,0.00021735774,0.00012483315,0.000008297966,0.0036327152,0.5748179,0.012745197,0.05759586,0.0056901868,0.34231588],"study_design_scores_gemma":[0.00066395366,0.000041206185,0.000092240996,0.000005588952,0.000021771168,0.0000145707545,0.0000858452,0.97801846,0.01055881,0.0005556207,0.009717971,0.0002239724],"about_ca_topic_score_codex":0.0000028095449,"about_ca_topic_score_gemma":0.0000036005083,"teacher_disagreement_score":0.40320054,"about_ca_system_score_codex":0.00020859632,"about_ca_system_score_gemma":0.000028103394,"threshold_uncertainty_score":0.72329533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971305,0.00011204006,0.000011128124,0.00013866226,0.00011418147,0.00006934075,0.0000071459403,0.000014423636,0.0024025603],"genre_scores_gemma":[0.9990358,0.00007748177,0.00027369245,0.00020625026,0.000040867963,0.0000041175867,0.00001230357,0.000012214791,0.0003373092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993353,0.000021866608,0.00022128382,0.00013677501,0.00011548214,0.00016927754],"domain_scores_gemma":[0.9994268,0.0001032068,0.00016868266,0.00022418103,0.000016293614,0.000060846247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012340864,0.00012407539,0.00016024981,0.000062153966,0.00011403894,0.000009084409,0.00007942082,0.000100842786,0.00005078569],"category_scores_gemma":[0.000025202704,0.00008537541,0.000064673455,0.00008918078,0.00027641995,0.000064895474,0.000006022287,0.00032244035,7.457425e-7],"study_design_candidate":"observational","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.00020080827,0.0002814865,0.10768198,0.00008975628,0.000256425,0.00040516758,0.03293004,0.000581463,0.053784195,0.7949183,0.00018230503,0.008688101],"study_design_scores_gemma":[0.0014825964,0.00035585687,0.8193705,0.00002370154,0.00017395077,0.00059611344,0.00071137777,0.00009727922,0.1438378,0.013191077,0.019711541,0.0004481967],"about_ca_topic_score_codex":0.15368688,"about_ca_topic_score_gemma":0.39615297,"teacher_disagreement_score":0.7817272,"about_ca_system_score_codex":0.000049666727,"about_ca_system_score_gemma":0.00004475929,"threshold_uncertainty_score":0.8519488},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21543981,0.000048876464,0.7814871,0.0024800356,0.00011912192,0.0002800628,0.000003000556,0.00005831909,0.00008365058],"genre_scores_gemma":[0.94444346,0.0000018057184,0.05463688,0.0003902275,0.000037197275,0.000052095522,0.000011333935,0.000009001225,0.00041801887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915195,0.000048346665,0.00013532271,0.00024797965,0.00026409078,0.00015233496],"domain_scores_gemma":[0.9992999,0.00020545842,0.00009204693,0.0001950609,0.00012182479,0.00008574847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034594335,0.000105867155,0.00011255882,0.00006644347,0.0002969034,0.00025398933,0.00021045105,0.0000305923,0.0000011644503],"category_scores_gemma":[0.000057576643,0.00006526009,0.000035157846,0.0001573559,0.000032431093,0.00016046196,0.000043659595,0.00008153808,0.00000336495],"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.000038991064,0.0000684955,0.00042551698,0.000026181791,0.000095248804,0.000010328787,0.0010150269,0.033905383,0.000027410373,0.9618963,0.00031857667,0.0021725364],"study_design_scores_gemma":[0.0003966242,0.000099227276,0.0002248696,0.000021200749,0.000016280663,0.000030809595,0.00009371537,0.99475646,0.000013556349,0.002932943,0.0012939769,0.00012036514],"about_ca_topic_score_codex":0.000018846971,"about_ca_topic_score_gemma":0.000007753942,"teacher_disagreement_score":0.9608511,"about_ca_system_score_codex":0.00006913046,"about_ca_system_score_gemma":0.000054568965,"threshold_uncertainty_score":0.2661229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789782,0.0014300466,0.00017014492,0.006146102,0.00008809263,0.00015281385,0.00007092968,0.000008344921,0.012955286],"genre_scores_gemma":[0.98127604,0.016651541,0.00082793675,0.0010682647,0.000024242978,0.000008213096,0.000011192194,0.0000069264506,0.00012564898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926484,0.000008333405,0.0003490263,0.00019197527,0.000008831093,0.00017700811],"domain_scores_gemma":[0.9996017,0.00002074019,0.00015954759,0.00019112008,0.0000029380626,0.00002395998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000323938,0.00009487126,0.0002084123,0.00015340191,0.000061430685,0.0000331829,0.00014566637,0.00007484545,0.000018370845],"category_scores_gemma":[0.000006446936,0.00009817437,0.00005137116,0.000086994674,0.00008178651,0.00010922705,0.00001646737,0.00008641227,0.000019137393],"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.000013276942,0.000040351555,0.0028829807,0.00003062331,0.0000173365,0.000002209697,0.0021590735,0.000096767646,0.0000023552034,0.98868835,0.00008461129,0.005982035],"study_design_scores_gemma":[0.0012619181,0.00013881887,0.41811857,0.00002967879,0.000014416226,0.000020546038,0.0026108532,0.0074390005,0.000019723437,0.54481643,0.02514761,0.00038241834],"about_ca_topic_score_codex":0.00010020109,"about_ca_topic_score_gemma":0.00008824462,"teacher_disagreement_score":0.44387195,"about_ca_system_score_codex":0.000107891916,"about_ca_system_score_gemma":0.0000022697338,"threshold_uncertainty_score":0.40034345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34280518,0.0007201799,0.6476679,0.00018174443,0.00055796804,0.00022107059,0.0000015244834,0.00041225538,0.0074321744],"genre_scores_gemma":[0.98665595,0.00001677983,0.012615853,0.0002586902,0.0002696399,0.00004130262,0.0000198204,0.00004750761,0.00007443915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.000049334085,0.00032866557,0.00024285473,0.0003680395,0.0003306973],"domain_scores_gemma":[0.9992874,0.00014568468,0.00007487454,0.00027914048,0.00010721747,0.00010568546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004126275,0.00021577161,0.00026416965,0.00024561374,0.00006815689,0.00003660421,0.00020631513,0.00013264587,0.000011914725],"category_scores_gemma":[0.00020737041,0.00023580088,0.00008400656,0.00047807573,0.000034221674,0.00015402232,0.000026992651,0.00024736187,0.0000067340816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005577822,0.00006830013,0.0024431641,0.00029015605,0.00014598086,0.000011957452,0.0019344614,0.9692709,0.0038285686,0.0019479482,0.008693835,0.011308969],"study_design_scores_gemma":[0.0008857178,0.00009609379,0.0005948973,0.000051942618,0.000050071983,0.000005661474,0.00030780502,0.96993583,0.024292149,0.00036043007,0.0030668457,0.00035254328],"about_ca_topic_score_codex":0.00024174903,"about_ca_topic_score_gemma":0.000023102026,"teacher_disagreement_score":0.6438508,"about_ca_system_score_codex":0.00044001962,"about_ca_system_score_gemma":0.000038328297,"threshold_uncertainty_score":0.96156806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280616,0.0001329356,0.8701332,0.00023531396,0.0005726033,0.00030009053,6.151297e-7,0.000075086944,0.00048855966],"genre_scores_gemma":[0.95949274,0.0000066515468,0.039782666,0.00010197782,0.00025562258,0.000057946505,6.595744e-7,0.000010457561,0.00029128755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989074,0.00015101366,0.00021621663,0.00019459653,0.00021455708,0.00031622578],"domain_scores_gemma":[0.999347,0.00005033551,0.00014446706,0.00028966143,0.00007408031,0.000094495954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045871965,0.00012749166,0.00016524472,0.00008490716,0.00014988298,0.0000506257,0.00023574401,0.00009501621,0.000012224238],"category_scores_gemma":[0.000011636538,0.00009816774,0.00004861578,0.00019720077,0.00006573542,0.00032392197,0.000029462566,0.0001368661,0.000016199208],"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.0014451644,0.002048822,0.022151887,0.00087329425,0.0011584685,0.000088662426,0.11619609,0.047707133,0.17887634,0.40758103,0.018204642,0.20366848],"study_design_scores_gemma":[0.0063997814,0.0050116996,0.018091701,0.00086542213,0.00017290565,0.002148463,0.0054668807,0.78353584,0.12548698,0.0049710623,0.044421665,0.0034275951],"about_ca_topic_score_codex":0.00009229568,"about_ca_topic_score_gemma":0.000008613008,"teacher_disagreement_score":0.83143115,"about_ca_system_score_codex":0.0001046721,"about_ca_system_score_gemma":0.00002638195,"threshold_uncertainty_score":0.4003164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8979609,0.00052322244,0.000021029102,0.0008532811,0.0002207916,0.00009000692,0.000010165492,0.00003075322,0.100289874],"genre_scores_gemma":[0.9963566,0.000005472356,0.00071757723,0.00033294366,0.00034639324,0.00003987738,0.000041642397,0.000015824844,0.0021436596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986095,0.00019199854,0.00019888418,0.0002655842,0.0003017357,0.00043230213],"domain_scores_gemma":[0.99900264,0.00008287871,0.000059091213,0.00043768014,0.00018586915,0.00023183212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093917144,0.00016306667,0.00019872503,0.00009177732,0.0005406558,0.000069070855,0.0004465449,0.00031719587,0.00018531957],"category_scores_gemma":[0.00013288016,0.000112526126,0.00011544742,0.00035207282,0.00030466786,0.00011270891,0.000056895104,0.00048470494,0.0000081869985],"study_design_candidate":"theoretical_or_conceptual","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.00007772502,0.00014648949,0.03051876,0.00021938773,0.00032517055,0.00006933581,0.02871249,0.01923323,0.00069126114,0.825184,0.0061184736,0.0887037],"study_design_scores_gemma":[0.0022542833,0.00015330302,0.10807552,0.00012068843,0.0000850157,0.000060112474,0.029729381,0.03161693,0.0018944348,0.33120412,0.49344617,0.0013600498],"about_ca_topic_score_codex":0.7253003,"about_ca_topic_score_gemma":0.2841174,"teacher_disagreement_score":0.49397987,"about_ca_system_score_codex":0.0004076206,"about_ca_system_score_gemma":0.00028621865,"threshold_uncertainty_score":0.7289456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9363738,0.0013521835,0.04524358,0.000721544,0.0007994636,0.00052943925,0.00056677056,0.00009089861,0.014322361],"genre_scores_gemma":[0.98995185,0.000073392126,0.003090103,0.00042237414,0.0002713528,0.00011782057,0.000094209354,0.000046904945,0.005932012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866384,0.0000164,0.0005148411,0.00042860923,0.000024471903,0.0003518482],"domain_scores_gemma":[0.9991776,0.00008728644,0.0002400758,0.00028780408,0.00004809868,0.00015914608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047358943,0.00020536168,0.00046557028,0.00011098409,0.00012922878,0.000102143174,0.00021555836,0.00016932069,0.00016323509],"category_scores_gemma":[0.00014785017,0.00022151174,0.00015082366,0.00009087302,0.00014536017,0.00027841996,0.000044375658,0.00012316709,0.00010433319],"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.00015197466,0.00005623015,0.0016200612,0.0000132851865,0.00010342847,0.0000016423112,0.0028755972,0.00058221025,0.000052943968,0.9851887,0.008958372,0.00039553788],"study_design_scores_gemma":[0.005106009,0.00042939727,0.0013871415,0.000016624701,0.000023674897,0.000009498072,0.0013438367,0.060365833,0.0006468075,0.65757877,0.27220345,0.00088894024],"about_ca_topic_score_codex":0.00012701168,"about_ca_topic_score_gemma":0.00003873532,"teacher_disagreement_score":0.32760993,"about_ca_system_score_codex":0.00023911512,"about_ca_system_score_gemma":0.0000394375,"threshold_uncertainty_score":0.9032987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02488365,0.00017314516,0.96747404,0.0007011472,0.00047905758,0.0005328052,0.000020616335,0.0004048619,0.0053306744],"genre_scores_gemma":[0.34661534,0.000024974857,0.6510115,0.00028515205,0.00044064748,0.00012475667,0.000108730506,0.00010692506,0.0012819655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.0001139081,0.00023838702,0.00019206706,0.00020492224,0.00035970355],"domain_scores_gemma":[0.9991597,0.00020053363,0.00003578972,0.0002628271,0.00022721136,0.000113935006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886891,0.0001635773,0.00014558471,0.000071988754,0.000186246,0.000113027636,0.00021244556,0.00014457948,0.000018784638],"category_scores_gemma":[0.000115095645,0.00013670731,0.00004995818,0.00033783226,0.000072463416,0.00015892278,0.000020990534,0.00023103345,0.000010054329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029640149,0.0000590551,0.0008549423,0.00006759779,0.000117855554,0.0000010787817,0.0032975525,0.93748295,0.0069693946,0.03700993,0.0058049494,0.008305027],"study_design_scores_gemma":[0.0011667638,0.00007007257,0.00013197544,0.000015997144,0.00003450408,0.000012712616,0.0003436854,0.9708391,0.004522268,0.0024405795,0.02016864,0.00025369122],"about_ca_topic_score_codex":0.00002299502,"about_ca_topic_score_gemma":0.000002969525,"teacher_disagreement_score":0.3217317,"about_ca_system_score_codex":0.00027552756,"about_ca_system_score_gemma":0.000046712415,"threshold_uncertainty_score":0.5574763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014747381,0.000094657145,0.99090445,0.0056388136,0.00029410236,0.00057377893,0.000019410536,0.00019248023,0.00080755085],"genre_scores_gemma":[0.5007994,0.000010607921,0.4969253,0.0005829211,0.00039573267,0.00008398974,0.000078093966,0.000019469473,0.0011045012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990287,0.000050674567,0.0002655351,0.00026358696,0.00014190977,0.0002495998],"domain_scores_gemma":[0.99888843,0.00046737326,0.000114479095,0.0003656722,0.00012033407,0.00004370854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019013186,0.00014341834,0.00013768495,0.00008284568,0.0007925116,0.0002914997,0.0005598017,0.00007529325,0.000009528249],"category_scores_gemma":[0.000053081763,0.0001088112,0.000111654066,0.0004828702,0.00023540834,0.00023188774,0.00003349351,0.00013770408,0.0000029060657],"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.000006875086,0.000097255,0.00023696854,0.000023816967,0.00003350534,0.000001416032,0.0008164048,0.0035882907,0.00054467225,0.9772288,0.0035178189,0.013904131],"study_design_scores_gemma":[0.0006187417,0.00007420292,0.00088139204,0.00001000669,0.000022373048,0.0000131128645,0.00008462103,0.8817461,0.0005321425,0.10643619,0.009370391,0.00021070798],"about_ca_topic_score_codex":0.00015574868,"about_ca_topic_score_gemma":0.00011411469,"teacher_disagreement_score":0.8781578,"about_ca_system_score_codex":0.00004408423,"about_ca_system_score_gemma":0.00007896251,"threshold_uncertainty_score":0.60954386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12624201,0.00010006488,0.8720042,0.0000030496026,0.000032948064,0.00060749374,0.00000408262,0.00024026424,0.000765848],"genre_scores_gemma":[0.9077432,0.0000077058,0.091782846,0.000007311003,0.000018778946,0.000109204586,0.00009357537,0.0000418186,0.00019556379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999421,0.000010946613,0.00011552147,0.0001624439,0.00008422965,0.00020583071],"domain_scores_gemma":[0.9997547,0.000027708418,0.000033891523,0.00011048734,0.000025277344,0.000047926154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006147534,0.00014997035,0.00012227811,0.00008025661,0.00012451182,0.00004899302,0.00007384407,0.000054256274,0.0000043813543],"category_scores_gemma":[0.000005780947,0.000115274466,0.000023305909,0.000096390526,0.00005357177,0.00010853199,0.00001263099,0.00007172195,9.5220383e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006192665,0.000032221844,0.00023576706,0.0001404358,0.00006983301,0.0000022833178,0.0047210013,0.9846449,0.000037250593,0.00045472043,0.0000038528133,0.009595802],"study_design_scores_gemma":[0.00053728797,0.00008923891,0.000088096574,0.000020278385,0.0000492654,0.0000029648938,0.00015578265,0.99813026,0.000037264683,0.00058336457,0.00013385252,0.00017232764],"about_ca_topic_score_codex":0.000012956686,"about_ca_topic_score_gemma":0.0000043005466,"teacher_disagreement_score":0.7815012,"about_ca_system_score_codex":0.00003727703,"about_ca_system_score_gemma":0.00000287299,"threshold_uncertainty_score":0.47007564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679251,0.000041076077,0.024932133,0.000039581566,0.00013913578,0.0003047632,0.000030918192,0.00006520002,0.006522112],"genre_scores_gemma":[0.9993012,0.000013795182,0.00054656644,0.00005112973,0.000031086725,0.000015421572,0.0000060839516,0.000027320284,0.000007377813],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99941653,0.00002905807,0.00017207823,0.000120271376,0.00007733477,0.00018475496],"domain_scores_gemma":[0.9995359,0.00022690883,0.00004741335,0.00013094525,0.000022193075,0.000036639958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017137198,0.00012207137,0.00015456376,0.000118398326,0.00007457043,0.000026606647,0.00007716066,0.000096484175,0.000095469746],"category_scores_gemma":[0.00007869541,0.00009931139,0.00007535257,0.00012201041,0.0001163481,0.00004318375,0.0000062819004,0.00017574549,0.0000028018585],"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.0005689879,0.00038330365,0.045196295,0.000825065,0.0006226206,0.00002571021,0.06322972,0.13290168,0.0044995197,0.3049334,0.00086351647,0.4459502],"study_design_scores_gemma":[0.013531894,0.0036567058,0.5206082,0.0030357467,0.00016739233,0.00009849536,0.0030638436,0.31480208,0.031471826,0.10611544,0.00041072638,0.0030376655],"about_ca_topic_score_codex":0.00018077559,"about_ca_topic_score_gemma":0.00004123456,"teacher_disagreement_score":0.4754119,"about_ca_system_score_codex":0.000069598755,"about_ca_system_score_gemma":0.000012735498,"threshold_uncertainty_score":0.4049801},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15305842,0.00009476572,0.8444601,0.000025577276,0.00043457127,0.0003656448,0.00015704829,0.0000689853,0.0013348494],"genre_scores_gemma":[0.88791054,0.0000042446,0.11154182,0.000070243084,0.00025055566,0.000060552582,0.0000011196372,0.000022900183,0.00013801544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978184,0.00010875664,0.00048126353,0.0005396581,0.0006719676,0.0003799612],"domain_scores_gemma":[0.99666435,0.001933248,0.00034150024,0.00029912865,0.00059058063,0.0001711772],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0009640438,0.00017680868,0.00031459742,0.00013516234,0.00054474984,0.00008022975,0.00051061367,0.00012769275,0.00007675575],"category_scores_gemma":[0.008660416,0.00013842541,0.00009458248,0.0003451893,0.00036962054,0.0004642206,0.000026511241,0.00026793344,0.000022845663],"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.0045955624,0.00055422826,0.3155948,0.00017093487,0.00043695647,0.00011820552,0.052427925,0.009531592,0.0012745135,0.18285398,0.0012845325,0.43115678],"study_design_scores_gemma":[0.0012482833,0.00018533789,0.0069822003,0.000015348916,0.000073229276,0.000008126119,0.0026019942,0.06152356,0.0015241832,0.9247388,0.0008198701,0.0002790221],"about_ca_topic_score_codex":0.0000280334,"about_ca_topic_score_gemma":0.000004586363,"teacher_disagreement_score":0.7418849,"about_ca_system_score_codex":0.000097975404,"about_ca_system_score_gemma":0.00006393537,"threshold_uncertainty_score":0.99969006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.843496,0.0016822277,0.15204415,0.000062001076,0.00016057104,0.00028940808,6.541699e-7,0.00010393303,0.0021610253],"genre_scores_gemma":[0.989848,0.00022121226,0.009788142,0.000030140998,0.000027464119,0.000040801457,0.000005334504,0.000019649435,0.000019239229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930763,0.00004381746,0.0002984172,0.00011595944,0.00008652886,0.00014764979],"domain_scores_gemma":[0.9995015,0.000055231158,0.0000715165,0.0003062063,0.000029644054,0.000035866353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000253522,0.00010069912,0.00014561763,0.00007902758,0.000042953863,0.000008007804,0.00012804416,0.00007455165,0.000007574897],"category_scores_gemma":[0.000015240112,0.00011306987,0.000017551778,0.000201736,0.000035190315,0.00012874388,0.000027946355,0.00015636132,0.00000303372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026821456,0.0002894679,0.06574032,0.002280421,0.00035555926,0.00001767367,0.20780836,0.23691756,0.08781466,0.22263661,0.0005787323,0.17529243],"study_design_scores_gemma":[0.0052012256,0.0002908005,0.32418907,0.0022838525,0.000116178664,0.00009905246,0.011227561,0.5711241,0.031944115,0.041789103,0.009408675,0.0023262664],"about_ca_topic_score_codex":0.00017342853,"about_ca_topic_score_gemma":0.00010716793,"teacher_disagreement_score":0.33420655,"about_ca_system_score_codex":0.00015057194,"about_ca_system_score_gemma":0.0000097853135,"threshold_uncertainty_score":0.46108556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3901567,0.0015187142,0.6055079,0.0011177589,0.00016327924,0.0001611491,0.0000013621948,0.00013697687,0.0012361808],"genre_scores_gemma":[0.9730637,0.0004978119,0.02560941,0.0007025839,0.00006105833,0.0000061124447,0.00000255096,0.000008044058,0.00004873725],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989521,0.00028020845,0.00015153126,0.00029447433,0.00008868367,0.0002329988],"domain_scores_gemma":[0.99924827,0.00015671136,0.000046971785,0.00037075786,0.000036879377,0.00014041833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035543958,0.0001567205,0.00015787664,0.000044399938,0.00050412724,0.0000898295,0.0003484065,0.00007773339,0.000017306424],"category_scores_gemma":[0.000013444934,0.00012222385,0.000035904108,0.00018673475,0.00017883426,0.0001918843,0.000074346106,0.00020350757,0.0000010309399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008107193,0.00013656521,0.035101183,0.000027655253,0.000030810294,0.000009104506,0.020803524,0.00008129527,0.0004633024,0.18434647,0.00096948526,0.75794953],"study_design_scores_gemma":[0.0025487703,0.0006090142,0.4711181,0.00040952163,0.000040845516,0.000025552488,0.0004446753,0.44406325,0.0047470448,0.04805777,0.026502581,0.0014328783],"about_ca_topic_score_codex":0.000010374471,"about_ca_topic_score_gemma":0.0000057880316,"teacher_disagreement_score":0.75651664,"about_ca_system_score_codex":0.000027654825,"about_ca_system_score_gemma":0.00001773106,"threshold_uncertainty_score":0.4984144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06074159,0.0067964275,0.9216822,0.004157023,0.00016044563,0.00018235833,0.0022965334,0.000075565746,0.0039079],"genre_scores_gemma":[0.46587536,0.0015039357,0.46797764,0.0015092598,0.005208974,0.000017945535,0.014317786,0.00006310119,0.04352601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980528,0.000032079726,0.0005655765,0.00065654743,0.0002937686,0.00039922303],"domain_scores_gemma":[0.9982882,0.00016577722,0.00022588903,0.00089905807,0.00012129897,0.00029977475],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019612016,0.00027934584,0.00064047356,0.00009633415,0.00018133628,0.00007573436,0.0006139172,0.0006602372,0.0017074362],"category_scores_gemma":[0.000099116085,0.00030416876,0.0005557761,0.0009374253,0.0003074082,0.00019284975,0.000053124426,0.00031062381,0.000005200419],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079929094,0.0010519931,0.001024622,0.0003517101,0.0071827816,0.00007701259,0.0005470496,0.00023067847,0.059098575,0.026781986,0.1243149,0.7792588],"study_design_scores_gemma":[0.0024104177,0.00028072824,0.00070748304,0.000089645495,0.016986217,0.000036330777,0.000470405,0.75249285,0.08427038,0.007800095,0.13327749,0.0011779781],"about_ca_topic_score_codex":0.00010266576,"about_ca_topic_score_gemma":0.000023252127,"teacher_disagreement_score":0.77808076,"about_ca_system_score_codex":0.00009082837,"about_ca_system_score_gemma":0.00010490527,"threshold_uncertainty_score":0.99994105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74241966,0.00018301349,0.25633433,0.00011968373,0.000015519186,0.00010568817,0.0000027106416,0.000029533989,0.00078983273],"genre_scores_gemma":[0.9937032,0.000025749056,0.00604342,0.00003761734,0.0001044508,0.000002984839,0.000032873682,0.0000062755503,0.00004343977],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994102,0.00004337805,0.000188412,0.00015785277,0.00006421451,0.00013594369],"domain_scores_gemma":[0.99966055,0.000042738677,0.00007996883,0.00015302424,0.000031300155,0.000032421834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001076275,0.00009667719,0.00019347423,0.00007700331,0.00005639938,0.000018628463,0.000079516176,0.00005372312,0.000022550134],"category_scores_gemma":[0.0000058567034,0.00009966306,0.000051885534,0.0002088179,0.00006477863,0.00006891143,0.000018657589,0.00014816955,2.7722757e-7],"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.000027126347,0.00018299835,0.69479245,0.0000068540317,0.000042218853,0.000001922685,0.0004960657,0.012210926,0.00042389685,0.08374076,0.00049581047,0.20757896],"study_design_scores_gemma":[0.00106452,0.00009294718,0.39790317,0.000049053036,0.000060659408,0.000001191084,0.00019811351,0.4464314,0.0024611836,0.1503966,0.0009223136,0.00041885828],"about_ca_topic_score_codex":0.00021732715,"about_ca_topic_score_gemma":0.000026770515,"teacher_disagreement_score":0.43422046,"about_ca_system_score_codex":0.00001882988,"about_ca_system_score_gemma":0.000005886272,"threshold_uncertainty_score":0.40641418},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036043106,0.0001109934,0.9935887,0.00043171653,0.00009759869,0.00093614234,0.00027951144,0.00007827384,0.00087277155],"genre_scores_gemma":[0.0280537,0.000013205047,0.9708325,0.00036157676,0.00017469136,0.0000567466,0.000040678464,0.000054425254,0.00041242686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985001,0.000055638095,0.00032668188,0.00041001634,0.0002507729,0.0004567542],"domain_scores_gemma":[0.98610806,0.012613062,0.00015048048,0.0008972461,0.000114613875,0.00011654731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161166,0.00020374756,0.00027942756,0.00007226621,0.00032226596,0.00005868268,0.00048899394,0.00009301568,0.0000211013],"category_scores_gemma":[0.0027812836,0.00012392177,0.000046291385,0.00030193018,0.00023479712,0.00014302309,0.00009980367,0.0002718943,0.0000024036083],"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.00029558296,0.00016917606,0.00039357954,0.00015497765,0.00013672056,0.000017338154,0.0007612695,0.00010239814,0.00006589396,0.7375184,0.0046741497,0.25571048],"study_design_scores_gemma":[0.0016292485,0.00020451935,0.00035521694,0.00003220653,0.00020330114,0.000030235113,0.00032506822,0.008748751,0.00014040091,0.9673624,0.020628082,0.0003405954],"about_ca_topic_score_codex":0.0000732828,"about_ca_topic_score_gemma":0.0003367992,"teacher_disagreement_score":0.25536987,"about_ca_system_score_codex":0.000062615276,"about_ca_system_score_gemma":0.00003279086,"threshold_uncertainty_score":0.5053383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.746476,0.0004959011,0.24920876,0.0003467985,0.0001745571,0.00048601886,0.000010202359,0.00047940123,0.002322349],"genre_scores_gemma":[0.81089383,0.000121226105,0.18810244,0.00010958136,0.00018673054,0.0000666858,0.000004336003,0.000043891614,0.00047129497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00008156212,0.00027179718,0.00013219051,0.00015444423,0.00019396703],"domain_scores_gemma":[0.9994476,0.000072716764,0.00007149982,0.00031472612,0.00004887281,0.00004460126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019894828,0.00011507922,0.00015291975,0.00004989681,0.00028147548,0.000011043198,0.00023507304,0.00010245998,0.000013446971],"category_scores_gemma":[0.000035825356,0.000098878096,0.00008323648,0.00036607965,0.00014273856,0.00008479298,0.000030499978,0.00021035527,0.00000714737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009559083,0.000075744916,0.02266007,0.00017234636,0.00014207889,0.0000040828063,0.007045413,0.7627564,0.056933712,0.13328338,0.00175135,0.015165884],"study_design_scores_gemma":[0.0029232376,0.00004186141,0.026440745,0.000089295674,0.0001238883,0.00012645198,0.0004209383,0.802286,0.12717646,0.015528841,0.023619523,0.001222719],"about_ca_topic_score_codex":0.000020036912,"about_ca_topic_score_gemma":0.0000013485849,"teacher_disagreement_score":0.117754534,"about_ca_system_score_codex":0.00007745382,"about_ca_system_score_gemma":0.000021683321,"threshold_uncertainty_score":0.40321317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52314895,0.00018601614,0.47428378,0.0013571474,0.00008431454,0.00039434148,0.0000039855076,0.00008648916,0.0004549601],"genre_scores_gemma":[0.8485307,0.000102735554,0.15025055,0.00019759053,0.000026809492,0.00006763514,0.000003944837,0.000014416263,0.00080561364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988366,0.000091538655,0.00017653359,0.0003870034,0.00017891637,0.00032944838],"domain_scores_gemma":[0.9990829,0.0003069404,0.000047253263,0.00038339678,0.000081504026,0.00009796633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500083,0.00011670335,0.00015179696,0.0002686992,0.0004553467,0.000036238973,0.00040672152,0.00010228623,0.0000023798975],"category_scores_gemma":[0.0001855469,0.000114387054,0.000052726038,0.00064611755,0.00038060598,0.0005633482,0.00009134827,0.0002646802,0.0000043256637],"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.000038403872,0.000055664288,0.018752847,0.000021234968,0.000010856181,0.0000457178,0.0024632842,0.00007207039,0.0003544161,0.96200556,0.00031413097,0.015865827],"study_design_scores_gemma":[0.0011255204,0.000112651585,0.06482249,0.000014592023,0.0000033695271,0.000110812354,0.00007272026,0.009118578,0.0006097126,0.9192576,0.004451035,0.00030094254],"about_ca_topic_score_codex":0.00002289741,"about_ca_topic_score_gemma":0.00004086279,"teacher_disagreement_score":0.32538173,"about_ca_system_score_codex":0.00006137671,"about_ca_system_score_gemma":0.000052278476,"threshold_uncertainty_score":0.46645686},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921524,0.0001489795,0.0016385511,0.0003990927,0.00016311089,0.00010651721,0.000591631,0.000015254515,0.0047844974],"genre_scores_gemma":[0.9974459,0.00068962894,0.0012356981,0.00022664916,0.00012236218,0.000010033681,0.00015062395,0.000012268633,0.00010685164],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991423,0.000009916104,0.00039083546,0.00025110628,0.000045104887,0.00016074996],"domain_scores_gemma":[0.99946004,0.000035892677,0.00023872782,0.00018951396,0.000011628234,0.00006417389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018374607,0.00010916845,0.00021755879,0.00014207404,0.0001285187,0.000020037396,0.00015063709,0.00009193701,0.00083051913],"category_scores_gemma":[0.00002820002,0.000120318735,0.00005045272,0.000072867915,0.00033292727,0.00035874086,0.000022026725,0.00010166134,0.000066919914],"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.00009472246,0.00022480128,0.88820183,0.000013305516,0.000063398875,0.000004522823,0.0037152288,0.000022774038,0.000035098496,0.107256785,0.00012265233,0.00024486647],"study_design_scores_gemma":[0.0032036372,0.0007483552,0.925285,0.000011775083,0.000020391319,0.00008672795,0.0028729306,0.0036327885,0.002487589,0.011895685,0.048903354,0.0008518033],"about_ca_topic_score_codex":0.0002516378,"about_ca_topic_score_gemma":0.00006796664,"teacher_disagreement_score":0.0953611,"about_ca_system_score_codex":0.0002703282,"about_ca_system_score_gemma":0.000009883048,"threshold_uncertainty_score":0.9093602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44272915,0.0022752243,0.5508527,0.000040459858,0.00048151633,0.0008155901,0.00004363505,0.0004849495,0.0022767948],"genre_scores_gemma":[0.99515676,0.000023391985,0.0039702,0.000028943508,0.00045023678,0.000100103745,0.00002929291,0.000071325994,0.000169752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.000040274692,0.00048457275,0.0002932771,0.00032246776,0.00048491062],"domain_scores_gemma":[0.9987613,0.00051074364,0.00011051726,0.00035451804,0.00014367522,0.00011924011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249068,0.00025433247,0.00033311546,0.00014796997,0.00027476382,0.00012735982,0.0002506837,0.00020817744,0.000013009174],"category_scores_gemma":[0.00007609797,0.00022687283,0.00008446953,0.00023336158,0.000057008565,0.00024638922,0.000015499203,0.00018682191,0.000009813639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00174683,0.0002741729,0.029270122,0.005481679,0.0016761352,0.00024440527,0.018892188,0.8264584,0.03252291,0.051700324,0.0029038708,0.028828999],"study_design_scores_gemma":[0.0076393443,0.0006128066,0.0008161755,0.000531801,0.00039731708,0.00029512146,0.0067895665,0.9535497,0.005234137,0.001794276,0.02016929,0.0021704887],"about_ca_topic_score_codex":0.00013138446,"about_ca_topic_score_gemma":0.00012263544,"teacher_disagreement_score":0.5524276,"about_ca_system_score_codex":0.00037139317,"about_ca_system_score_gemma":0.00002351465,"threshold_uncertainty_score":0.9251606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59414923,0.0009740605,0.3689033,0.015574441,0.0005925648,0.0015412975,0.000009388862,0.00028808723,0.017967623],"genre_scores_gemma":[0.99055463,0.000014643626,0.0074188355,0.0012053703,0.000029089972,0.00008225437,0.0000032563817,0.000013491077,0.0006784054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986216,0.00018237319,0.00022233582,0.0003247022,0.0003065586,0.00034243375],"domain_scores_gemma":[0.9983202,0.0009885913,0.00007104103,0.00049816,0.00006627362,0.000055728346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010546618,0.00016250127,0.00018936495,0.00006813039,0.0008018165,0.0002814137,0.00049106893,0.00009554599,0.000017585151],"category_scores_gemma":[0.000048491256,0.00008550107,0.00009431776,0.00042831802,0.000425967,0.000114594135,0.00007371226,0.0002520546,0.00001812873],"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.000039202798,0.000036898724,0.00088918075,0.000015671914,0.000023921106,0.0000029187927,0.0005549638,0.00012912528,0.00008023553,0.9946613,0.0027080358,0.0008585959],"study_design_scores_gemma":[0.0028410088,0.00004987023,0.00084237347,0.00002830559,0.00001918227,0.000041457937,0.00006222919,0.05879502,0.00022098729,0.93613863,0.0007976917,0.00016321748],"about_ca_topic_score_codex":0.00018026451,"about_ca_topic_score_gemma":0.0000047935214,"teacher_disagreement_score":0.39640543,"about_ca_system_score_codex":0.000018583167,"about_ca_system_score_gemma":0.00003872527,"threshold_uncertainty_score":0.61670053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12792651,0.000075469114,0.86881876,0.00033666057,0.00012669335,0.00041457484,0.00001506514,0.000032972865,0.0022532742],"genre_scores_gemma":[0.86859673,0.000092253096,0.1286773,0.000108327244,0.000117616066,0.00007283067,0.000090500784,0.000027334527,0.0022171193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998053,0.000099964855,0.0005986034,0.00030925032,0.0007995801,0.00013957555],"domain_scores_gemma":[0.9977855,0.000092955954,0.00046211015,0.00046970224,0.0010154641,0.000174275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026051,0.00012073627,0.00025940326,0.00037812334,0.00008949607,0.000032160773,0.0002776934,0.000112869464,0.00003227277],"category_scores_gemma":[0.00043053093,0.00009151493,0.000054746593,0.0013967138,0.00017054626,0.0002861455,0.000030648618,0.000093303584,0.000028549373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080182486,0.000059031026,0.017624307,0.000005106177,0.0000124751605,3.5037192e-7,0.0018478624,0.970185,0.00010144235,0.0015972647,0.0029707698,0.005516234],"study_design_scores_gemma":[0.0020775795,0.0009832454,0.0040440313,0.000057891546,0.000114279756,0.000017022494,0.0042206123,0.9338268,0.0021008844,0.004343866,0.047670696,0.00054309046],"about_ca_topic_score_codex":0.00015234693,"about_ca_topic_score_gemma":0.000068826295,"teacher_disagreement_score":0.7406702,"about_ca_system_score_codex":0.000058928825,"about_ca_system_score_gemma":0.00012926661,"threshold_uncertainty_score":0.37318704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22672729,0.00021738994,0.7689739,0.0030136162,0.00011382366,0.00062539196,0.000001914461,0.000058545902,0.0002681556],"genre_scores_gemma":[0.9945022,0.00007533085,0.003967873,0.0006015429,0.00017776534,0.00016572552,0.00006222315,0.000012457264,0.00043487235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904066,0.000013065328,0.00030020697,0.00022742782,0.00023972381,0.0001789039],"domain_scores_gemma":[0.9989781,0.00007589486,0.00017123201,0.0003104387,0.00045422948,0.0000101354835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036511634,0.00013283866,0.00019259968,0.0002241381,0.0005203455,0.000050210365,0.00018482127,0.00007348093,0.00005442191],"category_scores_gemma":[0.00016254345,0.000096265896,0.00010502621,0.0012290129,0.00021761034,0.00028955875,0.000023474297,0.000088989465,0.00001791912],"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.0005280403,0.000501567,0.10921585,0.0011491147,0.002438757,0.0000030013161,0.0043025594,0.1850735,0.00019110201,0.67819583,0.0070520774,0.0113486],"study_design_scores_gemma":[0.0025995749,0.0001360963,0.37322822,0.00015017083,0.004690053,0.0000058172036,0.004171203,0.5231587,0.00022833621,0.02647416,0.06403779,0.0011198428],"about_ca_topic_score_codex":0.0011987803,"about_ca_topic_score_gemma":0.0011030743,"teacher_disagreement_score":0.76777494,"about_ca_system_score_codex":0.000039789742,"about_ca_system_score_gemma":0.0000201644,"threshold_uncertainty_score":0.40021294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40373316,0.0007785519,0.5787944,0.000065926644,0.0008853173,0.0005769014,0.00003735404,0.00041112202,0.01471723],"genre_scores_gemma":[0.9976858,0.000014479598,0.0013592934,0.0000800924,0.00024093242,0.00006981646,0.000009790909,0.000039209976,0.0005005883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885684,0.000019931027,0.00032670915,0.0002214064,0.00018667357,0.0003884396],"domain_scores_gemma":[0.99910843,0.00041741406,0.000041878313,0.00027099738,0.000065128545,0.00009612868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057778467,0.00018708114,0.00026113534,0.00009353832,0.00013797163,0.00006158254,0.00017411512,0.00021697444,0.0000045656097],"category_scores_gemma":[0.00007706987,0.0001813977,0.00009611931,0.00009084735,0.000045373195,0.00009568911,0.0000050470185,0.00023119894,0.000011621507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054609386,0.00008718841,0.0005618745,0.0011617889,0.00023423618,0.000027349113,0.0039230734,0.49397883,0.0086512985,0.4362995,0.005281651,0.0492471],"study_design_scores_gemma":[0.0014291417,0.00012367807,0.0005476742,0.00014428658,0.000038862247,0.000013880553,0.0009954125,0.97596747,0.0006969657,0.0060343836,0.013414725,0.0005935393],"about_ca_topic_score_codex":0.000036147394,"about_ca_topic_score_gemma":0.000037301023,"teacher_disagreement_score":0.5939526,"about_ca_system_score_codex":0.00026198858,"about_ca_system_score_gemma":0.0000139146805,"threshold_uncertainty_score":0.7397184},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02682496,0.00030891155,0.9679646,0.0005861403,0.00068127154,0.0013062336,0.00003326332,0.00021145449,0.00208318],"genre_scores_gemma":[0.4498512,0.000011461771,0.54688895,0.00048595775,0.00020780133,0.00024458638,0.000008504916,0.000052678733,0.0022488213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959893,0.000088352834,0.00043134223,0.0010827848,0.0007866541,0.0016215577],"domain_scores_gemma":[0.9966512,0.0013508212,0.00009463893,0.00094389886,0.00047472867,0.00048475654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031263223,0.00032763282,0.00034729822,0.0006524402,0.0010963947,0.00041586516,0.001956259,0.00025363662,0.000027333954],"category_scores_gemma":[0.00041117644,0.0003354401,0.00020960926,0.0015735502,0.00029911028,0.0009899626,0.0003097025,0.0005379761,0.000018030316],"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.00022944977,0.00007271773,0.0013052962,0.000063644955,0.00003419103,0.000024043602,0.0010910375,0.00015246909,0.0065020663,0.9488939,0.0004280985,0.041203074],"study_design_scores_gemma":[0.0018164617,0.0007172239,0.0020986851,0.00008191805,0.000015555086,0.00014531173,0.00046400476,0.012270993,0.01945021,0.93832535,0.023692675,0.00092162885],"about_ca_topic_score_codex":0.000021289454,"about_ca_topic_score_gemma":0.000009299147,"teacher_disagreement_score":0.42302626,"about_ca_system_score_codex":0.00030064586,"about_ca_system_score_gemma":0.00020065656,"threshold_uncertainty_score":0.99990976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941156,0.0003701565,0.0012547958,0.00054874504,0.0002394596,0.00013332743,0.00010236027,0.000030555424,0.0032050046],"genre_scores_gemma":[0.9978186,0.0005061628,0.00028817946,0.00078241096,0.0002702902,0.000009572079,0.00013214254,0.000017671337,0.00017496965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99887776,0.000014998921,0.00043274602,0.00034438624,0.000020389363,0.00030974345],"domain_scores_gemma":[0.99954367,0.000023722936,0.00013646838,0.0002046508,0.000002659221,0.00008884342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016229371,0.00015265252,0.00028114204,0.0004038151,0.00011359186,0.00010842726,0.00014964098,0.00015954877,0.00034563272],"category_scores_gemma":[0.000027483467,0.00019668047,0.00006790267,0.0001613353,0.000051911356,0.00036151274,0.000016933558,0.00019814173,0.00025826768],"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.000114036215,0.0008597232,0.21447058,0.000024276438,0.000038060713,0.000026818743,0.009976546,0.0005385401,0.0014857937,0.7375496,0.00024557754,0.034670465],"study_design_scores_gemma":[0.0040018787,0.0005965929,0.8512588,0.000018705814,0.000015455867,0.000029193086,0.0008438634,0.04542626,0.0008839675,0.08324321,0.012183849,0.0014981867],"about_ca_topic_score_codex":0.00011432956,"about_ca_topic_score_gemma":0.00006699532,"teacher_disagreement_score":0.65430635,"about_ca_system_score_codex":0.00033261804,"about_ca_system_score_gemma":0.0000038070568,"threshold_uncertainty_score":0.8020397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14553952,0.000025955333,0.84912103,0.00010652584,0.00008046237,0.00017828358,0.000019055957,0.00007726913,0.0048518805],"genre_scores_gemma":[0.21852933,0.0000071586546,0.7799401,0.0000984848,0.000040809275,0.000010700126,0.0000055079067,0.0000408786,0.0013269971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998731,0.00006594518,0.00033546178,0.00027327298,0.00018349437,0.00041082216],"domain_scores_gemma":[0.9979641,0.001606373,0.00008842186,0.00020523627,0.000038961392,0.000096909214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060816645,0.00018787298,0.0002919374,0.000109448585,0.00012486409,0.000019723459,0.00011239738,0.00014455951,0.000037688686],"category_scores_gemma":[0.0009200772,0.00017165947,0.00005674469,0.00015056538,0.00011922532,0.00015928443,0.000025478499,0.0003397964,0.000010174408],"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.00012414683,0.00006705825,0.0000079167785,0.00005501067,0.000011700501,0.00011980449,0.001042053,0.0050502303,0.00033149376,0.97379285,0.000081325146,0.019316427],"study_design_scores_gemma":[0.00029181762,0.000079539226,0.00003861888,0.00005272888,0.000009299949,0.000018109962,0.000118285585,0.1436862,0.0001544094,0.8553255,0.000042703497,0.00018274055],"about_ca_topic_score_codex":0.000008719043,"about_ca_topic_score_gemma":0.000059806996,"teacher_disagreement_score":0.13863596,"about_ca_system_score_codex":0.00019976642,"about_ca_system_score_gemma":0.000015222297,"threshold_uncertainty_score":0.700007},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945191,0.00022182179,0.0004389525,0.00097259076,0.0008557832,0.0004052184,0.000009660977,0.00014467159,0.0024321987],"genre_scores_gemma":[0.99716955,0.00017900264,0.00013211413,0.001063665,0.00014870966,0.000026476684,0.000042149764,0.000043441276,0.0011948785],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983548,0.00003215071,0.000488266,0.00043999855,0.00035375112,0.0003310508],"domain_scores_gemma":[0.9987632,0.00013957707,0.00040167305,0.00045529255,0.00020814048,0.00003209367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003489995,0.00026170656,0.00035330135,0.00048288555,0.00050022954,0.00038509275,0.00036285885,0.0001304096,0.00015572985],"category_scores_gemma":[0.000117549294,0.00026972132,0.00014407045,0.00048799306,0.00011630885,0.0012256769,0.00010524429,0.0002424266,0.0002907062],"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.0005827493,0.00053424184,0.78638226,0.0007177829,0.00021686971,0.00021550494,0.0040282593,0.0002716853,0.065858774,0.0033107183,0.0065536476,0.13132751],"study_design_scores_gemma":[0.001034493,0.000020020578,0.9765187,0.0003337811,0.00021021097,0.000024356106,0.0027676588,0.00089036144,0.0008341036,0.0006581866,0.015954042,0.0007540787],"about_ca_topic_score_codex":0.0002823672,"about_ca_topic_score_gemma":0.00031338385,"teacher_disagreement_score":0.19013645,"about_ca_system_score_codex":0.000085481275,"about_ca_system_score_gemma":0.00001847667,"threshold_uncertainty_score":0.9999755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9041702,0.00038518838,0.06760478,0.00045209215,0.00049111433,0.00045011236,0.00018092949,0.000063446125,0.026202122],"genre_scores_gemma":[0.9889615,0.0000048450006,0.007227081,0.00012358787,0.00021836637,0.000021783713,0.00005242323,0.000023861272,0.003366557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881476,0.000010698725,0.00054709165,0.00030832793,0.00004155566,0.00027756626],"domain_scores_gemma":[0.99924684,0.00024195349,0.00024138148,0.00016132365,0.000046969413,0.000061541294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006426084,0.0001387172,0.0003521078,0.0002131349,0.0001853785,0.00006318506,0.00008904505,0.00012090997,0.00015308095],"category_scores_gemma":[0.00018324533,0.00016263544,0.00013010645,0.00026957114,0.000061026756,0.0001973169,0.000016790365,0.00011722767,0.000082494145],"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.00019823825,0.000050736562,0.013066018,0.000026547443,0.000056925415,0.000007395345,0.0006032335,0.010234735,0.000036753365,0.97365415,0.00047399837,0.0015912625],"study_design_scores_gemma":[0.002583283,0.00052083045,0.03087226,0.0000677491,0.000029939572,0.000029582867,0.0004866426,0.4538304,0.0000444672,0.49248916,0.018213129,0.00083256897],"about_ca_topic_score_codex":0.0003194204,"about_ca_topic_score_gemma":0.00016636161,"teacher_disagreement_score":0.481165,"about_ca_system_score_codex":0.00020757638,"about_ca_system_score_gemma":0.000014393839,"threshold_uncertainty_score":0.66320807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927421,0.00007030613,0.0031016709,0.00068572274,0.000030155114,0.0001675925,0.000011453277,0.00006754639,0.0031234433],"genre_scores_gemma":[0.99406224,0.000081965896,0.004915232,0.00008100545,0.000021026977,0.000057482244,0.0000013234147,0.000016242326,0.00076346874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993167,0.00006251756,0.00018230928,0.00017841658,0.00008478815,0.00017529372],"domain_scores_gemma":[0.99928075,0.000352473,0.000059943366,0.00023590238,0.000013813443,0.000057120127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020297142,0.00011175373,0.00015301007,0.0000495649,0.00012933233,0.000018212082,0.00010438588,0.00007746203,0.000078512756],"category_scores_gemma":[0.000096125674,0.00007931041,0.000041665025,0.00015698196,0.00028020106,0.00008911139,0.000015165414,0.000083176026,0.000037177877],"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.0000069765624,0.000041505653,0.013006345,0.00003758496,0.000010843314,0.000004116049,0.0011342447,2.6343361e-8,0.0009387111,0.9823798,0.00040524986,0.0020346004],"study_design_scores_gemma":[0.0003285198,0.000007774117,0.0071639367,0.000059860202,0.000011625992,0.000011271376,0.00018542004,0.0000050077347,0.0007153758,0.9896291,0.001754052,0.00012808057],"about_ca_topic_score_codex":0.0000075001467,"about_ca_topic_score_gemma":0.00006410532,"teacher_disagreement_score":0.0072492803,"about_ca_system_score_codex":0.000030447367,"about_ca_system_score_gemma":0.000006974759,"threshold_uncertainty_score":0.32341847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049658,0.0019079141,0.0906549,0.000030716037,0.00038219904,0.00048205763,0.000030247165,0.00028863747,0.0012574772],"genre_scores_gemma":[0.99719983,0.00006382354,0.0023544787,0.000014639977,0.00016034424,0.000053097367,0.0000097545235,0.00005165739,0.000092350005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815536,0.00012013067,0.00056889764,0.00032810034,0.0004483257,0.00037920487],"domain_scores_gemma":[0.9987555,0.00019851043,0.00009681582,0.00060921744,0.00019548532,0.00014443132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039554382,0.00028715451,0.0005568549,0.00008908386,0.0001732097,0.000020380334,0.0002478455,0.00023144111,0.000024464704],"category_scores_gemma":[0.000065687214,0.00024845396,0.00012794274,0.00023042098,0.00036747087,0.00014807045,0.000017144632,0.00031809573,0.000009784182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003045913,0.00022235866,0.05815608,0.0010929217,0.0004477206,0.00020379903,0.0064485134,0.9252086,0.0031990334,0.0036155921,0.00024036683,0.0008603989],"study_design_scores_gemma":[0.010818284,0.0018292179,0.018150507,0.00063689845,0.0005089152,0.0021455442,0.011078423,0.9260751,0.008387638,0.0007985125,0.01582222,0.0037487408],"about_ca_topic_score_codex":0.00047095478,"about_ca_topic_score_gemma":0.000081080725,"teacher_disagreement_score":0.09223401,"about_ca_system_score_codex":0.00030474213,"about_ca_system_score_gemma":0.00006353148,"threshold_uncertainty_score":0.9999968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9570398,0.00047945572,0.0034571327,0.0024853107,0.00017594844,0.000074528805,0.000027362463,0.0000153798,0.036245096],"genre_scores_gemma":[0.99653304,0.000069874484,0.00015597444,0.00022937973,0.000055201257,0.000009154229,0.000017770626,0.000007929802,0.0029217016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993849,0.000033638134,0.0002773173,0.00016901053,0.000030249445,0.00010488904],"domain_scores_gemma":[0.9995052,0.00013908299,0.00017763344,0.00013984024,0.000018987796,0.0000192344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005435649,0.000075495605,0.00016915388,0.00013628474,0.00014015684,0.000033589477,0.00007702997,0.000042866173,0.0005040814],"category_scores_gemma":[0.00007490083,0.000069415095,0.00006995973,0.00016991062,0.00007760319,0.000043414686,0.000011564252,0.000091462185,0.000032524335],"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.000010164246,0.000028851655,0.0050204047,0.000010483871,0.000026972946,7.2439644e-7,0.00011003962,0.000114751056,0.000050008624,0.99243945,0.0014184699,0.000769707],"study_design_scores_gemma":[0.0017193947,0.00010956439,0.11381809,0.000070094924,0.00005499132,0.0000092260925,0.0006665553,0.1027113,0.00042977947,0.72516906,0.054482497,0.0007594557],"about_ca_topic_score_codex":0.00020004124,"about_ca_topic_score_gemma":0.00003716074,"teacher_disagreement_score":0.26727036,"about_ca_system_score_codex":0.000038390684,"about_ca_system_score_gemma":0.0000027932442,"threshold_uncertainty_score":0.5519338},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044494625,0.000029524701,0.99147,0.0023405522,0.00014192905,0.00050613366,0.00006502895,0.000033039607,0.0009643388],"genre_scores_gemma":[0.49767113,0.000009564009,0.50088906,0.0008322777,0.00008631725,0.000040629388,0.000065622145,0.0000047306353,0.00040064348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898446,0.000021572878,0.00026662124,0.00023631995,0.00024074719,0.00025030578],"domain_scores_gemma":[0.9989255,0.00037070358,0.00010822036,0.00042730937,0.0000947003,0.0000735442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585913,0.000103031954,0.00022025306,0.00024994402,0.00019108204,0.00008779741,0.0008513626,0.000022076241,0.000008629603],"category_scores_gemma":[0.00001516286,0.00007469601,0.00010580965,0.0011065387,0.00008772534,0.000110545974,0.00015875131,0.000066359826,0.0000054911247],"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.000024777113,0.000114327064,0.0011652888,0.000026011621,0.0011744156,0.0000072194953,0.013001027,0.0009986438,0.00006536354,0.8908816,0.019581107,0.07296024],"study_design_scores_gemma":[0.0013091154,0.00052697794,0.03963028,0.000022258317,0.0011625984,0.0000016672774,0.004324488,0.47028062,0.0012687842,0.016943008,0.46385208,0.00067812455],"about_ca_topic_score_codex":0.00007829532,"about_ca_topic_score_gemma":0.0003421253,"teacher_disagreement_score":0.87393856,"about_ca_system_score_codex":0.000042966927,"about_ca_system_score_gemma":0.000011679654,"threshold_uncertainty_score":0.3046015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.374432,0.00002733449,0.6241361,0.0007235516,0.000010052799,0.00028885438,0.00003326592,0.00011684851,0.00023198852],"genre_scores_gemma":[0.5075267,0.000006938105,0.49180004,0.00008704043,0.000014463079,0.00010313954,0.000011982975,0.000014037382,0.00043566886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840134,0.00004165752,0.0003312203,0.00047586393,0.0004945458,0.00025534292],"domain_scores_gemma":[0.9986584,0.0004847982,0.00024198327,0.00028495648,0.00020524507,0.0001246046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045471083,0.0001861024,0.00025730944,0.00011201142,0.0009877278,0.00021069097,0.0002867493,0.00012372839,0.000008213157],"category_scores_gemma":[0.0004825139,0.00013686095,0.0000738268,0.00020076822,0.00055854756,0.0006201365,0.00005702848,0.00016642768,0.0000047543826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007660432,0.0001702188,0.0011478384,0.000045755296,0.00010372132,0.00003746209,0.021750487,0.62710303,0.0022691025,0.20330107,0.0035208235,0.13978443],"study_design_scores_gemma":[0.00032320968,0.000085144355,0.000164622,0.000028136112,0.000014223741,0.00008198667,0.00005493894,0.8834452,0.00032551461,0.11517905,0.00012425173,0.00017373107],"about_ca_topic_score_codex":0.000025836067,"about_ca_topic_score_gemma":0.0000021515439,"teacher_disagreement_score":0.25634214,"about_ca_system_score_codex":0.000057742545,"about_ca_system_score_gemma":0.00010590162,"threshold_uncertainty_score":0.75969034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98668087,0.00009391427,0.0072911573,0.0018189484,0.000047456768,0.0008112304,0.00002496929,0.00009983874,0.0031316157],"genre_scores_gemma":[0.9860879,0.000024041126,0.011207312,0.00025445758,0.00008923551,0.0004873419,0.000003522236,0.000018408551,0.0018277412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940455,0.000033859866,0.00014638907,0.00015979912,0.00009047964,0.00016491122],"domain_scores_gemma":[0.9987266,0.00078107894,0.000047584104,0.00034830923,0.000055888337,0.000040555722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162513,0.000097827855,0.000107730906,0.000011259354,0.00060719735,0.0000125593415,0.0001769548,0.000075458214,0.00023681285],"category_scores_gemma":[0.00024832616,0.00006651828,0.000102401915,0.00012406813,0.00033778662,0.000033775268,0.000013158553,0.00013983283,0.000027048454],"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.000020790843,0.00009577625,0.0014870568,0.000057479305,0.00001543704,8.109753e-7,0.0030172113,3.9460843e-7,0.00020527253,0.9864712,0.008044659,0.00058395957],"study_design_scores_gemma":[0.00027933135,0.000023865015,0.002024318,0.000004026442,0.000042179854,0.00004775909,0.0005578037,0.00008060554,0.00079911604,0.9749443,0.021083606,0.000113086135],"about_ca_topic_score_codex":0.000004248791,"about_ca_topic_score_gemma":0.000010398769,"teacher_disagreement_score":0.013038947,"about_ca_system_score_codex":0.000020848114,"about_ca_system_score_gemma":0.000025000145,"threshold_uncertainty_score":0.46701324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76167256,0.0039927503,0.22318807,0.0026930298,0.0013083864,0.00020382066,0.00002486441,0.0003336723,0.0065828497],"genre_scores_gemma":[0.67886835,0.00026581538,0.31853804,0.00018999429,0.00033708394,0.0000017123236,0.0000070052783,0.00004945975,0.0017425332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982654,0.00020955355,0.00051325245,0.00026970316,0.00024757098,0.0004945508],"domain_scores_gemma":[0.99900657,0.0002612123,0.00014547732,0.00036361936,0.00008087132,0.00014224084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067287445,0.0002293801,0.00036812344,0.0001269198,0.00011690853,0.000048605096,0.00024262823,0.0003905918,0.00017524832],"category_scores_gemma":[0.00037678803,0.00031789392,0.00016091822,0.00051622064,0.00016831623,0.00019443987,0.000025550718,0.0005489414,0.000052444877],"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.000019588064,0.000107468615,0.0034483417,0.00015288756,0.00010304128,0.00006091125,0.008521596,0.27502602,0.009719441,0.0886565,0.0013801011,0.6128041],"study_design_scores_gemma":[0.0026351474,0.00036768935,0.12808718,0.0005940701,0.00027046064,0.00008966719,0.0010808025,0.7987199,0.024002964,0.011607811,0.031002158,0.0015421391],"about_ca_topic_score_codex":0.00012038744,"about_ca_topic_score_gemma":0.0000031691127,"teacher_disagreement_score":0.61126196,"about_ca_system_score_codex":0.00026120656,"about_ca_system_score_gemma":0.000041103955,"threshold_uncertainty_score":0.99992734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015939282,0.0010787719,0.9374807,0.002700518,0.0018451487,0.00024563944,0.00018964398,0.00011869299,0.04040163],"genre_scores_gemma":[0.017273745,0.00015694051,0.94939286,0.00029283212,0.0012614571,0.0000073112287,0.000017120366,0.00008191541,0.031515818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971075,0.00040600944,0.0006759083,0.00045719833,0.00045194777,0.0009014089],"domain_scores_gemma":[0.99364346,0.0051647914,0.0001971812,0.00048244867,0.00011464741,0.0003974807],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017821181,0.00040494488,0.0006456206,0.00011133055,0.0003229648,0.00013251363,0.00033698726,0.0005147966,0.003378036],"category_scores_gemma":[0.0023813192,0.00038028657,0.00022208237,0.00032516898,0.0010378974,0.00013816904,0.0000705524,0.00068754563,0.0006837216],"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.000055903598,0.0001425455,0.0008922776,0.00015201978,0.00008485982,0.00022766873,0.0012380467,2.4853657e-7,0.0004438345,0.7914553,0.0035378337,0.20176944],"study_design_scores_gemma":[0.0006246631,0.00020968821,0.008557969,0.00018174817,0.0002143891,0.00006025733,0.00048321404,0.000731222,0.0009113624,0.94892675,0.038457762,0.0006409903],"about_ca_topic_score_codex":0.00018365105,"about_ca_topic_score_gemma":0.00011536387,"teacher_disagreement_score":0.20112844,"about_ca_system_score_codex":0.00021537821,"about_ca_system_score_gemma":0.00006496548,"threshold_uncertainty_score":0.9998649},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37200812,0.00068987167,0.5859966,0.003353377,0.00047192196,0.00583603,0.00015134952,0.00064837397,0.030844327],"genre_scores_gemma":[0.45754668,0.0000125620245,0.5383373,0.000052717583,0.00010073533,0.00008587388,0.000011452033,0.00005442463,0.0037982613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816626,0.00015404145,0.000556077,0.00025171298,0.00045086816,0.0004210563],"domain_scores_gemma":[0.9983064,0.00070843875,0.00029115693,0.00039803315,0.00022812137,0.0000678504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037909398,0.00020431945,0.00032527518,0.000101674894,0.00034742878,0.000063552725,0.00030032912,0.00013112875,0.00009442349],"category_scores_gemma":[0.0005918615,0.00015039009,0.0001344058,0.00045878068,0.00085187535,0.00013032161,0.00006265293,0.00030053448,0.0000044401845],"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.00016291378,0.0007665411,0.0030493725,0.00076440716,0.00018985265,0.0001504103,0.0022217713,0.00519674,0.005824605,0.9605024,0.004572352,0.016598633],"study_design_scores_gemma":[0.013397497,0.0008291743,0.00050347554,0.0009326637,0.00048079455,0.0011668657,0.00957552,0.028137976,0.052140668,0.8678838,0.022292107,0.0026594787],"about_ca_topic_score_codex":0.00016819076,"about_ca_topic_score_gemma":0.0002205743,"teacher_disagreement_score":0.09261862,"about_ca_system_score_codex":0.00016459274,"about_ca_system_score_gemma":0.00027213778,"threshold_uncertainty_score":0.61327296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9439978,0.00078923133,0.0045779096,0.020090712,0.0003054248,0.0010671925,0.000076524775,0.00021100475,0.028884226],"genre_scores_gemma":[0.9894935,0.00010242397,0.00054473395,0.0053570014,0.00031956477,0.000042032978,0.000012934618,0.000034977937,0.0040928316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982696,0.00025200174,0.00037548336,0.0003760666,0.00029563054,0.00043118844],"domain_scores_gemma":[0.9976986,0.0009393019,0.0002265703,0.00094784895,0.00005798376,0.00012970607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004621418,0.00035860154,0.0003374337,0.00009735578,0.0010520889,0.00014410153,0.00055060774,0.00042342147,0.00036880022],"category_scores_gemma":[0.0002444736,0.0002506762,0.00027218138,0.00040188408,0.00048784434,0.000055776654,0.000022265478,0.0011122536,0.0002756822],"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.000067494984,0.00025867447,0.00004046123,0.000029114093,0.000078033016,0.00001252775,0.006631142,0.00002029721,0.00026161637,0.97397476,0.012863511,0.005762385],"study_design_scores_gemma":[0.00065141026,0.0001616192,0.0019972378,0.00007478608,0.00012066691,0.000029231793,0.0007562816,0.00012912956,0.00048681992,0.965421,0.029864658,0.0003071216],"about_ca_topic_score_codex":0.000008349434,"about_ca_topic_score_gemma":0.000011440613,"teacher_disagreement_score":0.045495726,"about_ca_system_score_codex":0.000078762874,"about_ca_system_score_gemma":0.000047588455,"threshold_uncertainty_score":0.9999946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8378492,0.0030683316,0.0006763377,0.0014156819,0.0004115798,0.0002243821,0.00041525386,0.00004222708,0.155897],"genre_scores_gemma":[0.9957392,0.00028694305,0.0017351318,0.00046728505,0.0013284306,0.00006791872,0.00013152165,0.000023884568,0.00021967918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988769,0.000018290995,0.0005192968,0.00027045433,0.000024599696,0.0002904432],"domain_scores_gemma":[0.99931145,0.000046757916,0.0002814682,0.00028990678,0.000018122377,0.000052286985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033823962,0.00012918597,0.0002348942,0.00010414891,0.00054491084,0.0000907203,0.00019792955,0.00012707007,0.000028430206],"category_scores_gemma":[0.00001704517,0.0001304244,0.00010098846,0.00013157178,0.00017455094,0.00037185583,0.000027772508,0.00016110543,0.000038925264],"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.000004956559,0.000039009345,0.01024257,0.000021290118,0.000015432699,2.1315985e-7,0.0006333205,0.00009190817,0.0000101040405,0.9848203,0.0005407062,0.0035801686],"study_design_scores_gemma":[0.0011080252,0.00010963371,0.47665927,0.000015941749,0.00001769268,0.00001816688,0.00053982326,0.016232286,0.00026795227,0.44982755,0.054526642,0.00067699974],"about_ca_topic_score_codex":0.00030946877,"about_ca_topic_score_gemma":0.00009711863,"teacher_disagreement_score":0.53499275,"about_ca_system_score_codex":0.00007017202,"about_ca_system_score_gemma":0.000008971587,"threshold_uncertainty_score":0.53185534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31287888,0.0014879102,0.66338265,0.010087352,0.00132495,0.000981881,0.0000040337836,0.0025651753,0.0072871884],"genre_scores_gemma":[0.96199137,0.000092993636,0.036958102,0.00007813421,0.0005657913,0.00012833237,0.0000059675813,0.0000391236,0.00014016371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989195,0.000030620475,0.00021485548,0.00015873575,0.00023335786,0.0004429391],"domain_scores_gemma":[0.9994087,0.0000619095,0.00003245138,0.00036449567,0.000052621217,0.000079807236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022276622,0.00017613356,0.00015741144,0.000053405038,0.00034047378,0.00007184452,0.00019810798,0.00024295239,0.00003266668],"category_scores_gemma":[0.00021278272,0.0001419755,0.000039914816,0.00037414973,0.00030041582,0.00039222254,0.000042886535,0.00061743235,0.00008630931],"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.0002732398,0.00034909009,0.0033080867,0.0002754218,0.00041410694,0.00001502603,0.0029324787,0.048743546,0.018396012,0.6796426,0.011391896,0.23425846],"study_design_scores_gemma":[0.004802008,0.0013408358,0.067519106,0.00050024875,0.00052937126,0.00029100498,0.0033309276,0.13180847,0.055410445,0.083786726,0.6459592,0.00472168],"about_ca_topic_score_codex":0.0000037209638,"about_ca_topic_score_gemma":0.000015339678,"teacher_disagreement_score":0.6491125,"about_ca_system_score_codex":0.00023854869,"about_ca_system_score_gemma":0.000009144785,"threshold_uncertainty_score":0.5789593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20442814,0.00032797625,0.78685606,0.0002399743,0.0009209069,0.00046916417,0.0000021475012,0.0021380468,0.0046176175],"genre_scores_gemma":[0.61520267,0.00007008029,0.38412285,0.00010760477,0.000265017,0.000099868754,0.0000036265772,0.00006236296,0.00006589328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985027,0.000029343153,0.00021792084,0.00030271505,0.00016108288,0.00078624795],"domain_scores_gemma":[0.99826944,0.0010616202,0.000026421563,0.00043153626,0.00003834574,0.00017262847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022438541,0.00030312742,0.0003124385,0.000062984924,0.00017263192,0.000047265145,0.00032803687,0.0004930044,0.000048492828],"category_scores_gemma":[0.00052654016,0.00028550188,0.000086722364,0.00032111772,0.00048184762,0.00014385271,0.00005964529,0.0014041377,0.000093816496],"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.0000969661,0.000060148108,0.0026653046,0.00006224649,0.00024151389,0.00029143298,0.00030488527,0.63309973,0.013813932,0.18844226,0.01587451,0.14504708],"study_design_scores_gemma":[0.0033646394,0.000839902,0.022957454,0.00022833444,0.00032446138,0.00033573632,0.0004219752,0.39857808,0.04440562,0.40172994,0.12204262,0.004771247],"about_ca_topic_score_codex":0.0000020041607,"about_ca_topic_score_gemma":0.000013532627,"teacher_disagreement_score":0.41077456,"about_ca_system_score_codex":0.00012878944,"about_ca_system_score_gemma":0.000010397522,"threshold_uncertainty_score":0.9999597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7378516,0.0028068302,0.2578839,0.000075988435,0.00013027937,0.00012525589,0.0000014354405,0.000632418,0.0004922863],"genre_scores_gemma":[0.71580094,0.00039367398,0.2837126,0.000019920002,0.000029100056,0.000009501694,0.00000170657,0.00001548443,0.000017101855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921876,0.000031337157,0.00017020179,0.00012244312,0.000087175315,0.00037009217],"domain_scores_gemma":[0.99913687,0.00058856624,0.000027768803,0.000168282,0.000018315503,0.00006017573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014623765,0.00015234895,0.00022643617,0.00005644891,0.000090679096,0.000011559545,0.000111108435,0.00020826964,0.0000067483575],"category_scores_gemma":[0.00027920023,0.00012862026,0.000029829494,0.000120026154,0.00039740623,0.00015977291,0.000065571236,0.00024752598,0.0000046651303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013405978,0.00015719976,0.076267414,0.00029164468,0.00027062042,0.00004614563,0.0021430585,0.51274663,0.11200632,0.19429651,0.0024153625,0.099225014],"study_design_scores_gemma":[0.0044006393,0.0008126806,0.04680013,0.00036121742,0.00019527673,0.00012604482,0.010046609,0.4994568,0.31945133,0.079454735,0.0345748,0.0043197447],"about_ca_topic_score_codex":0.0000042471097,"about_ca_topic_score_gemma":0.0000013397644,"teacher_disagreement_score":0.20744503,"about_ca_system_score_codex":0.00004025618,"about_ca_system_score_gemma":0.000002455175,"threshold_uncertainty_score":0.5244982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96468824,0.0020407797,0.02032935,0.00010131797,0.00004355669,0.000048825605,0.000053526965,0.000005443806,0.012688932],"genre_scores_gemma":[0.9966308,0.0009584713,0.0018628434,0.00005214102,0.0000027557617,0.0000014938657,0.0000030451067,0.0000075792577,0.00048085747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993187,0.0000113005735,0.000340591,0.00018753449,0.00003087027,0.0001109715],"domain_scores_gemma":[0.99959826,0.000029406357,0.00016643647,0.00013410958,0.000018652421,0.000053142146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021868895,0.00008401882,0.00030457103,0.00015934,0.00004790619,0.000011587101,0.000055212004,0.00006203297,0.00014827243],"category_scores_gemma":[0.000040937997,0.00009350777,0.00006949833,0.000137115,0.0001900709,0.000063047715,0.000009666265,0.000062622894,0.0000027251892],"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.00001806631,0.000067469584,0.026885843,0.00007721469,0.00007773742,8.037912e-7,0.000991569,0.00068940653,0.0017049608,0.9690921,0.000043057185,0.00035180213],"study_design_scores_gemma":[0.003512031,0.00023749271,0.015053552,0.000043927324,0.000119027885,0.00001806453,0.0008276087,0.7011001,0.0016517508,0.2737657,0.0028979867,0.00077271555],"about_ca_topic_score_codex":0.000039872593,"about_ca_topic_score_gemma":0.0000096433005,"teacher_disagreement_score":0.7004107,"about_ca_system_score_codex":0.000017748598,"about_ca_system_score_gemma":0.000009375926,"threshold_uncertainty_score":0.3813136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4217794,0.0003074085,0.5753815,0.000060949817,0.00031108575,0.00021270159,0.0000060642265,0.0017350472,0.0002058329],"genre_scores_gemma":[0.5053045,0.00010956133,0.4944759,0.0000109119865,0.000028168692,0.000017897823,0.0000031186444,0.000024858904,0.000025104004],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.000018581622,0.00020751434,0.00016431745,0.000118958524,0.00027547227],"domain_scores_gemma":[0.99941206,0.00015074755,0.000031825308,0.0003113339,0.000036525056,0.000057533933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010036787,0.00017027782,0.00021995741,0.000074845615,0.00006809346,0.000011731399,0.00022413788,0.00027620702,0.00002258567],"category_scores_gemma":[0.00013035511,0.00016354941,0.0000507044,0.00019204256,0.00031288655,0.00007514762,0.00003244442,0.00057368434,0.000009644634],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055274268,0.00022491343,0.0039883065,0.00018005405,0.00020615745,0.000056869998,0.00086851354,0.13130425,0.68244267,0.029291257,0.0009862223,0.15039553],"study_design_scores_gemma":[0.0020292208,0.00013865107,0.01474137,0.000065665314,0.000089750436,0.000031060998,0.000285502,0.6872775,0.26334348,0.026333166,0.004362918,0.0013017155],"about_ca_topic_score_codex":0.0000065028057,"about_ca_topic_score_gemma":0.000014917354,"teacher_disagreement_score":0.55597323,"about_ca_system_score_codex":0.00004450137,"about_ca_system_score_gemma":0.000005738051,"threshold_uncertainty_score":0.66693515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091106,0.0007149846,0.90576524,0.0006350267,0.000094717456,0.00037001303,0.000007654988,0.00045359918,0.0008527906],"genre_scores_gemma":[0.72788376,0.00004056749,0.27193865,0.000013160191,0.00003038348,0.000052806263,0.0000035542187,0.000015081217,0.00002206112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951065,0.000002081741,0.00017375896,0.000074747804,0.00006553468,0.00017323325],"domain_scores_gemma":[0.99956465,0.0001872746,0.00002753013,0.00017573351,0.000026984828,0.000017840015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003946825,0.000085819345,0.00013317962,0.00003168525,0.00011638063,0.0000085571655,0.00015237222,0.00009996885,0.0000028360514],"category_scores_gemma":[0.000044158733,0.00006455849,0.000053271415,0.00014107177,0.00014962592,0.00006162064,0.000014517999,0.00016756526,0.000002799447],"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.0000042946663,0.000013677912,0.00026253378,0.00003299084,0.000027217598,2.0338959e-7,0.00037995228,0.6045924,0.00051698886,0.3758748,0.00027311762,0.018021816],"study_design_scores_gemma":[0.0014657557,0.00020978667,0.0022682685,0.00007145215,0.00009280787,0.0000056008316,0.0013258469,0.22208008,0.017666934,0.71027553,0.0440404,0.00049751543],"about_ca_topic_score_codex":0.0000024932997,"about_ca_topic_score_gemma":0.000014634793,"teacher_disagreement_score":0.63677776,"about_ca_system_score_codex":0.00007206572,"about_ca_system_score_gemma":0.0000049824534,"threshold_uncertainty_score":0.26326188},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99693245,0.00014751735,0.0008727391,0.00025042135,0.0001488178,0.00017975138,0.00064903504,0.0000093124645,0.0008099673],"genre_scores_gemma":[0.99882835,0.00035970053,0.00054139615,0.00007230053,0.00007783036,0.000014308763,0.000052838892,0.000015655156,0.000037637063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990699,0.0000051615484,0.0005333588,0.00018871069,0.00002257269,0.00018024177],"domain_scores_gemma":[0.99939215,0.00001066518,0.00039665992,0.00015697643,0.0000037589189,0.00003977164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086236665,0.00010497785,0.00030107878,0.00016169496,0.00003957522,0.000010689004,0.0000885237,0.00007860559,0.0006971327],"category_scores_gemma":[0.000008654655,0.00012761512,0.00012060853,0.000052866522,0.00012213478,0.00010097816,0.000032542834,0.000074619675,0.000042438587],"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.00006975443,0.00047184125,0.10213919,0.00024375744,0.00021341204,0.0000038799703,0.031430393,0.000083809915,0.013562998,0.8478586,0.000097716715,0.003824623],"study_design_scores_gemma":[0.008989255,0.0007631775,0.6033775,0.000052332747,0.00005876567,0.000026793668,0.009992728,0.00027347115,0.13277586,0.23988284,0.0027821,0.0010251654],"about_ca_topic_score_codex":0.00073474454,"about_ca_topic_score_gemma":0.000071621194,"teacher_disagreement_score":0.6079758,"about_ca_system_score_codex":0.00019184606,"about_ca_system_score_gemma":0.000010051367,"threshold_uncertainty_score":0.76331145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75615245,0.000569371,0.23669043,0.0013099072,0.0010768255,0.0001263354,0.000009715416,0.00031525,0.0037497175],"genre_scores_gemma":[0.87290186,0.000018648741,0.12090712,0.0002821499,0.00054870546,0.000017950117,0.0000055133005,0.000023796409,0.0052942857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682575,0.0002776203,0.0006699153,0.0006599586,0.0009806275,0.0005861004],"domain_scores_gemma":[0.9978586,0.00063391525,0.00021680287,0.00076857995,0.00024062427,0.00028149787],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024988474,0.00023022633,0.00038148928,0.00042380052,0.0009427649,0.00045926834,0.0007802098,0.00023293975,0.0001545162],"category_scores_gemma":[0.002009187,0.00018439493,0.00026873703,0.0012366632,0.00024254405,0.0002733586,0.000074403346,0.00041862833,0.0013880013],"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.00017562087,0.00053231005,0.17489709,0.000038266837,0.0003061196,0.0006420359,0.008952261,0.03342293,0.0023830459,0.7228302,0.0047768666,0.051043276],"study_design_scores_gemma":[0.0055182567,0.00018794979,0.091296874,0.00017829014,0.00023793144,0.0009862686,0.011558622,0.6535919,0.0010126458,0.03138129,0.20187466,0.0021753686],"about_ca_topic_score_codex":0.00023498274,"about_ca_topic_score_gemma":0.000057215937,"teacher_disagreement_score":0.69144887,"about_ca_system_score_codex":0.00016234902,"about_ca_system_score_gemma":0.000097036806,"threshold_uncertainty_score":0.9993895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011872578,0.00003897936,0.98615354,0.0002820612,0.000113274014,0.00028576123,0.00050583365,0.000071417446,0.00067653356],"genre_scores_gemma":[0.0918641,0.000004014388,0.90724945,0.00011625216,0.0002286819,0.000037763813,0.00018728561,0.000020998968,0.0002914324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990947,0.000047904025,0.0002491084,0.00026706728,0.00013600457,0.00020521392],"domain_scores_gemma":[0.99495465,0.0042691226,0.00008737263,0.00052489946,0.00011732197,0.00004662441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035372644,0.000106336054,0.00017498105,0.000034636363,0.00014383905,0.00004003628,0.0002701545,0.000097535514,0.000046287616],"category_scores_gemma":[0.0071064797,0.00010282714,0.000025280995,0.00008280117,0.00010397604,0.00007983207,0.000046160447,0.00010476167,0.000010623788],"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.000011464572,0.000104512605,0.00030375036,0.00010160389,0.000010722494,4.9790253e-7,0.00009631723,0.0000024107046,0.00035612367,0.9290815,0.006150083,0.063781016],"study_design_scores_gemma":[0.00036040472,0.000035920788,0.005264138,0.000024460747,0.00003728887,0.0000012788432,0.000030086234,0.01372948,0.00041112135,0.97126985,0.008678007,0.00015795247],"about_ca_topic_score_codex":0.0002710077,"about_ca_topic_score_gemma":0.000067283225,"teacher_disagreement_score":0.07999153,"about_ca_system_score_codex":0.00004378132,"about_ca_system_score_gemma":0.000031643256,"threshold_uncertainty_score":0.8507634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350879,0.00068924617,0.00039361333,0.023442665,0.00015517378,0.00029143566,0.000113460526,0.000043710585,0.03978275],"genre_scores_gemma":[0.9963553,0.0003301906,0.00041127612,0.0011366286,0.0004340982,0.000038287635,0.0000061756214,0.000008804695,0.001279252],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99854445,0.00011923707,0.0001477655,0.0001666032,0.00015749662,0.0008644622],"domain_scores_gemma":[0.99931294,0.00017093637,0.000037577214,0.00008520918,0.000035029338,0.0003583009],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005335405,0.00010692607,0.00021957554,0.00028669205,0.0015254581,0.00006879702,0.00012608983,0.0001330288,0.000027245442],"category_scores_gemma":[0.00009379303,0.0000982887,0.00007478748,0.0005107333,0.00051894935,0.00013551806,0.000030627947,0.0000912937,0.0000023360146],"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.0000131805145,0.000016591453,0.55957764,0.000011522262,0.000098132106,0.0000020787263,0.072817914,0.0000029657451,0.0000030402155,0.36232135,0.0016940421,0.0034415459],"study_design_scores_gemma":[0.0008789274,0.000088980356,0.6051325,0.00002161582,0.00025786425,0.000002997502,0.07792141,0.00022470424,0.000049212762,0.0057776156,0.30886173,0.00078240637],"about_ca_topic_score_codex":0.8663558,"about_ca_topic_score_gemma":0.9669917,"teacher_disagreement_score":0.35654372,"about_ca_system_score_codex":0.00044770614,"about_ca_system_score_gemma":0.00025006238,"threshold_uncertainty_score":0.9997744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415145,0.0014250571,0.05362285,0.00006457152,0.00047128813,0.0005544686,0.000033571894,0.00023225648,0.0020814522],"genre_scores_gemma":[0.9992778,0.000026212574,0.00019712366,0.000016086637,0.00016422446,0.000045787056,0.000022937991,0.00003780029,0.00021204013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.00007513156,0.00028176128,0.00018082606,0.0002676883,0.0002313638],"domain_scores_gemma":[0.9993018,0.00018556703,0.00008250179,0.00025384812,0.00013260457,0.00004368116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022174473,0.00018923682,0.00035699885,0.00009675269,0.00007125302,0.000043102656,0.00009853805,0.00009994397,0.000009226301],"category_scores_gemma":[0.000036609017,0.00015764833,0.00005059813,0.00018030376,0.00010781739,0.00006842815,0.0000040227997,0.000117354444,0.0000051901125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010919885,0.00015067935,0.004962149,0.0015301557,0.0002801844,0.00002634285,0.0034860729,0.94281834,0.0094140675,0.03063936,0.0015160544,0.0040846164],"study_design_scores_gemma":[0.073579036,0.004792067,0.030833902,0.003775751,0.0008407191,0.00012266688,0.01178533,0.6714851,0.059351556,0.025760157,0.11083826,0.006835453],"about_ca_topic_score_codex":0.0003757098,"about_ca_topic_score_gemma":0.00023847322,"teacher_disagreement_score":0.27133322,"about_ca_system_score_codex":0.00014791686,"about_ca_system_score_gemma":0.000014132848,"threshold_uncertainty_score":0.64287126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94973147,0.0014130085,0.045977797,0.00093211257,0.00018862737,0.00010083007,0.000026624217,0.000033932818,0.0015955806],"genre_scores_gemma":[0.981464,0.00027949444,0.017246932,0.000060919418,0.0005796906,0.0000055580517,0.000013648199,0.000015087929,0.00033462993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99927145,0.0000073886426,0.0003004585,0.00022728943,0.000026855208,0.00016655381],"domain_scores_gemma":[0.99961,0.000036917474,0.00015891268,0.000121084864,0.000020329799,0.0000527303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001400882,0.00010364426,0.00018821078,0.00015239402,0.00030748523,0.00006675725,0.000059124264,0.000103215876,0.000046947232],"category_scores_gemma":[0.000101219965,0.00012388821,0.000046469737,0.00016459727,0.000113551934,0.00028420787,0.000017370014,0.00011127944,0.000026025904],"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.00001115481,0.00004004134,0.3671006,0.000013779703,0.000022935028,0.0000020135105,0.0044392287,0.00060636067,0.00040996476,0.61422133,0.00049201574,0.012640592],"study_design_scores_gemma":[0.00054956076,0.000043706303,0.7600388,0.000017442037,0.000012022927,0.000015002624,0.00024481842,0.03501417,0.0003628768,0.0299397,0.17337798,0.00038392883],"about_ca_topic_score_codex":0.00039427,"about_ca_topic_score_gemma":0.00019485092,"teacher_disagreement_score":0.5842816,"about_ca_system_score_codex":0.00012448613,"about_ca_system_score_gemma":0.000010906753,"threshold_uncertainty_score":0.50520146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7966171,0.00015774817,0.19967087,0.00018722897,0.0004875306,0.0001344856,0.000012198781,0.00006318526,0.0026696655],"genre_scores_gemma":[0.8511656,0.00008685897,0.14799187,0.00026420798,0.000111481146,0.0000013138333,0.00013048644,0.0000053295607,0.00024289294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931175,0.00002698561,0.00015778626,0.000158472,0.00012819079,0.00021684123],"domain_scores_gemma":[0.99971455,0.000031112257,0.000043284857,0.000114322014,0.00004040749,0.00005630059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010682634,0.00010043743,0.000098520846,0.000026118374,0.00039453962,0.00003410274,0.000087543034,0.000060958213,0.0035387243],"category_scores_gemma":[0.000026580821,0.00007374033,0.00004269409,0.00011199813,0.0000958413,0.00020328844,0.000008356276,0.00007363751,0.00008676104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005264378,0.000044451583,0.16686687,0.000028546723,0.000072692405,0.000023053488,0.012667378,0.7822838,0.000052917636,0.0015480854,0.0006900131,0.03566954],"study_design_scores_gemma":[0.00026305852,0.00007035715,0.13424121,0.000013078219,0.00004823314,0.000013674914,0.00086225505,0.8606088,0.00033434576,0.0016559983,0.001639499,0.0002494987],"about_ca_topic_score_codex":0.001369116,"about_ca_topic_score_gemma":0.00016722924,"teacher_disagreement_score":0.07832499,"about_ca_system_score_codex":0.00001343624,"about_ca_system_score_gemma":0.000010169116,"threshold_uncertainty_score":0.99737215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21189675,0.0026503587,0.77257115,0.0061852336,0.00518445,0.00065971474,0.000016332175,0.00016381152,0.00067222695],"genre_scores_gemma":[0.9352711,0.0006930254,0.060549967,0.00015651174,0.0016325056,0.00007562333,0.00013089167,0.00005901044,0.0014313746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985745,0.00008059132,0.00031833947,0.00027328773,0.00012859076,0.00062469835],"domain_scores_gemma":[0.9993291,0.0001231334,0.000086332366,0.00020877752,0.00011575514,0.00013693213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060919736,0.00023721857,0.00021385161,0.00007656457,0.0003901139,0.000056632223,0.00007712587,0.00034385326,0.00004400441],"category_scores_gemma":[0.00017443807,0.00026743396,0.00013678086,0.00018115106,0.00021552172,0.00067553844,0.00001290519,0.00027967052,0.000019445382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048445756,0.00009477655,0.000814908,0.00039643937,0.00009824311,3.884745e-7,0.004711266,0.845929,0.0013715524,0.13120459,0.0030586775,0.012271692],"study_design_scores_gemma":[0.0029345616,0.0003003597,0.008611569,0.0007118764,0.00085147354,0.00017164602,0.012671438,0.8247299,0.0148386285,0.07258361,0.059437938,0.002156978],"about_ca_topic_score_codex":0.00012646857,"about_ca_topic_score_gemma":0.000038529757,"teacher_disagreement_score":0.72337437,"about_ca_system_score_codex":0.0009380128,"about_ca_system_score_gemma":0.000026337846,"threshold_uncertainty_score":0.99997777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6089591,0.00017996327,0.33309388,0.02026318,0.0007667627,0.0026741326,0.000005727322,0.0008958086,0.033161487],"genre_scores_gemma":[0.9920538,0.000022388103,0.0022084422,0.0025173756,0.00033387926,0.00021627649,0.00012963236,0.000032787244,0.0024854247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985204,0.000011749123,0.00034011458,0.00040493804,0.0003995795,0.00032327205],"domain_scores_gemma":[0.9991316,0.000009448844,0.00012389629,0.00035054638,0.0003573205,0.000027197579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030007263,0.0002351087,0.0001926403,0.00022074011,0.0003859481,0.00025353523,0.0002603506,0.00008969543,0.00020058166],"category_scores_gemma":[0.00004748506,0.00021305353,0.00005065785,0.00063258526,0.00012858056,0.00077340513,0.00005271751,0.00017058961,0.0007680197],"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.00023972463,0.00073756307,0.01055923,0.0008007391,0.0002108373,0.00003761297,0.0015981733,0.06276462,0.0005062923,0.8786607,0.0059985886,0.03788594],"study_design_scores_gemma":[0.017028688,0.00027574267,0.07311224,0.0005830407,0.0007393269,0.00003786996,0.012723029,0.013853976,0.0012113795,0.029171538,0.84732985,0.003933298],"about_ca_topic_score_codex":0.0037400837,"about_ca_topic_score_gemma":0.0031894606,"teacher_disagreement_score":0.84948915,"about_ca_system_score_codex":0.00021101955,"about_ca_system_score_gemma":0.000049630577,"threshold_uncertainty_score":0.98715955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99710906,0.00012482337,0.00065050065,0.00018474784,0.0002877773,0.00094081153,0.00038040464,0.0000723737,0.00024947815],"genre_scores_gemma":[0.9972386,0.0000046607497,0.00062592566,0.0010138454,0.00003117177,0.0002060314,0.00070381793,0.000028125813,0.00014783446],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99753433,0.00051584805,0.00051713025,0.00089068426,0.00010448154,0.0004375377],"domain_scores_gemma":[0.99839294,0.00043747656,0.00013743037,0.000731881,0.00014902794,0.0001512653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018392547,0.0003213325,0.0004805744,0.0006460503,0.00023921649,0.000072412564,0.0003711707,0.00011983203,0.00018444535],"category_scores_gemma":[0.0006799178,0.00029733338,0.00007904254,0.0014035722,0.00009455046,0.00019048424,0.000098603894,0.00033733202,0.00016505549],"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.004562545,0.00641408,0.92634416,0.000015045927,0.0039910227,0.0004057017,0.028461443,0.003094254,0.006466241,0.0004186349,0.00419003,0.015636839],"study_design_scores_gemma":[0.003062482,0.00022159723,0.98747456,0.000019394709,0.00021936941,0.0000017613696,0.007495198,0.0004904915,0.00017237855,0.0002097472,0.00024574064,0.00038727524],"about_ca_topic_score_codex":0.90488654,"about_ca_topic_score_gemma":0.5497349,"teacher_disagreement_score":0.35515165,"about_ca_system_score_codex":0.00080153183,"about_ca_system_score_gemma":0.00033464207,"threshold_uncertainty_score":0.9999479},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.253143,0.000040232164,0.7417617,0.00008845135,0.0021729146,0.00021547712,0.000008252536,0.0003164821,0.0022534765],"genre_scores_gemma":[0.99660623,0.0000052468286,0.001945096,0.000058457983,0.00096522,0.00006605784,0.000016682421,0.000026022086,0.00031099946],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993872,0.000043033033,0.00018473726,0.00013739207,0.000081518956,0.00016612813],"domain_scores_gemma":[0.99960274,0.00013641312,0.00003399823,0.00014119645,0.0000378835,0.000047803376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030238807,0.000098455464,0.0001518358,0.00010317656,0.00012211614,0.000027145039,0.00006364122,0.00025775004,0.000013089636],"category_scores_gemma":[0.00009014761,0.000093977156,0.00007206297,0.00010513786,0.00003129049,0.000058443686,0.0000037012733,0.00014847587,0.00003960154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106914005,0.00003320051,0.00038867266,0.000069068636,0.00014923439,0.0000016585227,0.0008984151,0.0047211857,0.0439849,0.17434566,0.0238869,0.7514142],"study_design_scores_gemma":[0.0017522438,0.0004959831,0.0021788096,0.000010426745,0.00003874017,0.00002167503,0.0003376708,0.34380177,0.008149473,0.0024649126,0.64035815,0.00039018254],"about_ca_topic_score_codex":0.000012918542,"about_ca_topic_score_gemma":0.0000040437126,"teacher_disagreement_score":0.751024,"about_ca_system_score_codex":0.00008359973,"about_ca_system_score_gemma":0.0000047172143,"threshold_uncertainty_score":0.38322774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9063747,0.00044929792,0.01864189,0.050613385,0.0005244893,0.00057503395,0.0085945595,0.00005628665,0.014170384],"genre_scores_gemma":[0.9807588,0.0003975764,0.006696779,0.006589796,0.00149625,0.000118256,0.0007878244,0.000039301653,0.0031154398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981814,0.000037205067,0.0007884945,0.0005606482,0.00004549092,0.00038678042],"domain_scores_gemma":[0.9987541,0.00027693933,0.00023698746,0.0005692313,0.000056024575,0.00010671606],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004878467,0.00029103665,0.00038242515,0.00009667839,0.00058652845,0.0005881534,0.00054959935,0.00013127654,0.00064383104],"category_scores_gemma":[0.00008579954,0.00021748284,0.00011092562,0.00022934975,0.0001644801,0.00042307872,0.000102377024,0.0004031952,0.001154928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006370493,0.00015593735,0.0004595392,0.0000045896554,0.00038746998,0.00000570041,0.08338457,0.52980226,0.00012238362,0.24473788,0.13792767,0.0023749259],"study_design_scores_gemma":[0.0020690172,0.00010364044,0.0019228583,0.000029262208,0.00003091014,0.0000018155795,0.01003603,0.7193782,0.00048910937,0.007929495,0.2572546,0.0007551066],"about_ca_topic_score_codex":0.005254394,"about_ca_topic_score_gemma":0.011427954,"teacher_disagreement_score":0.23680839,"about_ca_system_score_codex":0.00036679095,"about_ca_system_score_gemma":0.000057947756,"threshold_uncertainty_score":0.99962276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01790255,0.0009624742,0.9788896,0.0007133692,0.00049498485,0.0007452113,0.0000015473983,0.00007743785,0.00021285332],"genre_scores_gemma":[0.8534145,0.00011414017,0.14358053,0.0020932923,0.000103477025,0.00016262018,0.0000044105423,0.000027426559,0.0004996219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983649,0.00018975842,0.0002868267,0.00040562896,0.00028923835,0.00046362606],"domain_scores_gemma":[0.9979728,0.0008647503,0.00012262091,0.00081316807,0.00013806086,0.00008862656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091314,0.00017313902,0.00019543828,0.00007398512,0.0004266428,0.00009627709,0.00087324745,0.000077610115,0.00001451346],"category_scores_gemma":[0.000087184126,0.00013339492,0.00010282733,0.0006199268,0.000104649975,0.000113412876,0.0001719216,0.00023831615,0.000011094914],"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.000045378787,0.0001902106,0.0012895219,0.0001668058,0.00021446838,0.00003964652,0.0032142685,0.45058125,0.00021829871,0.4919962,0.0074776616,0.044566292],"study_design_scores_gemma":[0.0007203341,0.000066190034,0.0008829139,0.000029737948,0.000031149753,0.0000059617055,0.0001561337,0.98279583,0.00027404405,0.00068262836,0.01417304,0.00018201314],"about_ca_topic_score_codex":0.00007830312,"about_ca_topic_score_gemma":0.000036809248,"teacher_disagreement_score":0.8355119,"about_ca_system_score_codex":0.000095339514,"about_ca_system_score_gemma":0.00005325264,"threshold_uncertainty_score":0.5439687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17140956,0.00003886917,0.82538253,0.0003170715,0.00021358431,0.000317555,0.000076637305,0.00007355297,0.0021706088],"genre_scores_gemma":[0.4343267,0.000002456003,0.5644199,0.00007321963,0.00011598776,0.000033291315,0.000015510524,0.000024803312,0.0009881355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986548,0.00012736463,0.00037367988,0.00028008886,0.00023630762,0.00032779697],"domain_scores_gemma":[0.99788564,0.0014611749,0.00024449156,0.00023865777,0.000097043194,0.00007296065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005460498,0.0001874441,0.00027450363,0.00006660595,0.00030175655,0.000078806144,0.00016251719,0.00014102532,0.00009707332],"category_scores_gemma":[0.0006928105,0.00016529502,0.00009005499,0.00009250392,0.0000955229,0.000055027806,0.000033193905,0.00021703042,0.000014322371],"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.000043214823,0.000043321314,0.00097628485,0.00011161308,0.000013854204,0.0000107189735,0.0005528739,0.001063593,0.00025248175,0.9941088,0.00067989336,0.0021433255],"study_design_scores_gemma":[0.00044167016,0.00004267939,0.0064150156,0.000093197756,0.000060182127,0.00001148012,0.00021866364,0.04184683,0.00020983747,0.949871,0.00053478463,0.00025465077],"about_ca_topic_score_codex":0.00020255479,"about_ca_topic_score_gemma":0.00003444952,"teacher_disagreement_score":0.26291713,"about_ca_system_score_codex":0.00010684581,"about_ca_system_score_gemma":0.000021832231,"threshold_uncertainty_score":0.6740535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067647874,0.00065990427,0.91860664,0.0023538994,0.006967054,0.0013414645,0.0010039572,0.00007532092,0.0013438814],"genre_scores_gemma":[0.04257772,0.000085087784,0.9512321,0.00043609223,0.0013036496,0.000116728304,0.0001365375,0.000080464306,0.0040316265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976271,0.0003506366,0.00053812395,0.00059472595,0.0002442668,0.0006451755],"domain_scores_gemma":[0.9825604,0.015403781,0.00021766195,0.0013789884,0.00014983276,0.00028936943],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014740716,0.00036243105,0.00068459427,0.00006489923,0.00034555438,0.00016592474,0.0008232667,0.0005840209,0.00027752554],"category_scores_gemma":[0.020604705,0.00032955877,0.00015576323,0.00013530398,0.0007082937,0.00017408421,0.00021655574,0.00081728754,0.00008055136],"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.0002116039,0.00016546196,0.00021353607,0.0013176289,0.00011070324,0.0000237848,0.0004524685,6.73151e-7,0.0008758948,0.7622072,0.026938599,0.20748247],"study_design_scores_gemma":[0.006376528,0.00027064688,0.0013974102,0.00020596018,0.0005087858,0.000047402995,0.0000991171,0.04231535,0.0011039772,0.8419841,0.10514595,0.0005447896],"about_ca_topic_score_codex":0.000100585545,"about_ca_topic_score_gemma":0.00032252917,"teacher_disagreement_score":0.20693767,"about_ca_system_score_codex":0.000046486522,"about_ca_system_score_gemma":0.0000809629,"threshold_uncertainty_score":0.99991566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26389998,0.022452442,0.66178656,0.02968079,0.0080384035,0.00042616585,0.0001426157,0.0006070008,0.012966055],"genre_scores_gemma":[0.85617346,0.0009820913,0.100376226,0.004028867,0.0016170254,0.000021897124,0.000028236993,0.000055635657,0.03671659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970338,0.0007959297,0.00037448198,0.0006581269,0.00034427576,0.0007934068],"domain_scores_gemma":[0.99824464,0.000400969,0.00013579708,0.0007452221,0.0001460992,0.00032726975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015371204,0.00035072066,0.0003255561,0.0002541326,0.00059627625,0.00039688702,0.0010727654,0.00034752022,0.00039206562],"category_scores_gemma":[0.00012253992,0.00037330936,0.00028101352,0.0013344883,0.00097246224,0.0008501949,0.00014282472,0.00065880496,0.00056601124],"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.000011742587,0.00016325417,0.002532475,0.000018359697,0.000061830586,0.000068078465,0.003512308,0.00008363328,0.000025535945,0.6462616,0.0052518034,0.34200943],"study_design_scores_gemma":[0.0013882417,0.00030614968,0.13639775,0.000082031525,0.000062093655,0.00037456973,0.00015949765,0.044180393,0.00066684873,0.15376048,0.66123277,0.0013891611],"about_ca_topic_score_codex":0.0004361387,"about_ca_topic_score_gemma":0.00028888695,"teacher_disagreement_score":0.655981,"about_ca_system_score_codex":0.000088730514,"about_ca_system_score_gemma":0.000093788,"threshold_uncertainty_score":0.9998719},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955974,0.00017311049,0.00036104574,0.0004028367,0.00007677384,0.00025597963,0.000020185154,0.000037754915,0.0030748837],"genre_scores_gemma":[0.99904877,0.000011898847,0.0004409515,0.000135743,0.000039853014,0.000016603402,0.000035491463,0.000020013345,0.0002506751],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99940777,0.000012281599,0.00013398228,0.00009212751,0.00014799405,0.00020584097],"domain_scores_gemma":[0.9996619,0.000008749078,0.00003657282,0.00015630649,0.000055965695,0.00008050556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026509415,0.00010533276,0.0000982713,0.000044359862,0.00011421392,0.000018530609,0.00012633018,0.000090789414,0.00013421614],"category_scores_gemma":[0.0000035611388,0.000075473785,0.00002806267,0.00023926792,0.00003479652,0.000076143144,3.9967657e-7,0.00022094497,0.0000021946196],"study_design_candidate":"observational","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.000070031405,0.0000583398,0.1504915,0.00061131024,0.0011266286,0.00004085257,0.010734933,0.10944271,0.18522765,0.037969355,0.27052832,0.23369838],"study_design_scores_gemma":[0.0005684018,0.000078161545,0.92674303,0.00002769603,0.000065244734,0.000020240164,0.00017639958,0.019302238,0.035184428,0.00090259395,0.0164523,0.00047924448],"about_ca_topic_score_codex":0.88470626,"about_ca_topic_score_gemma":0.96676934,"teacher_disagreement_score":0.77625155,"about_ca_system_score_codex":0.00033821038,"about_ca_system_score_gemma":0.00022428954,"threshold_uncertainty_score":0.30777317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06310251,0.00072695134,0.93089557,0.0011198309,0.0026880815,0.0007252117,0.00022774086,0.000033513683,0.00048060453],"genre_scores_gemma":[0.032074932,0.000115469105,0.9593721,0.000044516128,0.0006094817,0.00007820692,0.000015198672,0.00006426898,0.0076258257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983441,0.00014552656,0.00054498145,0.00032237679,0.0002154058,0.00042756484],"domain_scores_gemma":[0.99484235,0.0039788694,0.00032235862,0.000422779,0.0002491191,0.00018453751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076629396,0.00026897373,0.0006446479,0.00006602696,0.00021777822,0.000022074626,0.0002092055,0.0005000183,0.00015152812],"category_scores_gemma":[0.0038614129,0.00022437212,0.00023536384,0.0001050158,0.0006744616,0.00012745701,0.000039951392,0.0005535996,0.00000216778],"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.00044213206,0.00018638902,0.000046552876,0.001074957,0.00005087765,0.000008716841,0.0006940628,0.00062019465,0.0024866438,0.83000344,0.0025362251,0.16184978],"study_design_scores_gemma":[0.003766679,0.00015791655,0.00005053682,0.00029873848,0.00020848695,0.000027967706,0.00014817186,0.083769426,0.004789884,0.88909066,0.017369455,0.00032209032],"about_ca_topic_score_codex":0.000014459458,"about_ca_topic_score_gemma":0.00009128451,"teacher_disagreement_score":0.1615277,"about_ca_system_score_codex":0.00003881335,"about_ca_system_score_gemma":0.000057666846,"threshold_uncertainty_score":0.914963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13327946,0.00017125037,0.86529183,0.0000060300117,0.00015285707,0.00041608236,0.000010116427,0.0002958655,0.00037649888],"genre_scores_gemma":[0.7041795,0.0000106803045,0.29563254,0.000002457412,0.00006343221,0.00005754288,0.000013102664,0.000028613538,0.000012101132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991753,0.00012198606,0.0002589608,0.00016852542,0.00011423927,0.00016095143],"domain_scores_gemma":[0.99949723,0.0001797887,0.0000335377,0.0001798275,0.000048564027,0.00006104751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052769925,0.00013055305,0.00024596104,0.0001281683,0.000079804784,0.000022752207,0.00008499473,0.000118442105,3.7238667e-7],"category_scores_gemma":[0.000027905438,0.00013083244,0.000028732837,0.00028686028,0.000027371854,0.000056681874,0.000003265335,0.00008096013,6.5840703e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033638537,0.0000049089053,0.00008671144,0.00046085194,0.000020857533,2.1559286e-7,0.0007471165,0.9876528,0.005171039,0.0053922017,0.000025123845,0.00043485587],"study_design_scores_gemma":[0.00013507488,0.000017299479,0.00051883934,0.00005921956,0.00002293867,0.0000087670005,0.000515673,0.9968012,0.0015339943,0.0000050541416,0.00023945286,0.0001424684],"about_ca_topic_score_codex":0.00008697861,"about_ca_topic_score_gemma":7.24675e-7,"teacher_disagreement_score":0.5709001,"about_ca_system_score_codex":0.00007974138,"about_ca_system_score_gemma":0.0000063981543,"threshold_uncertainty_score":0.5335192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792457,0.000009570227,0.019552141,0.000063346364,0.00007493944,0.0003188497,0.000019869547,0.000019377641,0.0006961909],"genre_scores_gemma":[0.9957857,0.0000016368576,0.0037264084,0.000054342927,0.000018167397,0.0000071336704,0.000014748636,0.000016047665,0.00037581866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999003,0.000057009343,0.0002615891,0.0001869952,0.00033656243,0.00015483145],"domain_scores_gemma":[0.99927795,0.00012734577,0.00025232916,0.00023338979,0.000046838533,0.000062137806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871752,0.0001231572,0.00016301012,0.000024684765,0.00010256578,0.000015227262,0.00014566474,0.0000796433,0.000050636772],"category_scores_gemma":[0.00011007367,0.00008663221,0.000039414324,0.00017115414,0.00026192857,0.000105434025,0.00006349612,0.00008518218,0.000009580174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010154107,0.000057351423,0.08015718,0.00002055105,0.000026833235,0.00000284952,0.0031044113,0.90528333,0.009788418,0.00016060953,0.00003071044,0.0012661904],"study_design_scores_gemma":[0.0009540247,0.000116732335,0.17596155,0.000028388387,0.000041258758,0.0000026774594,0.00019221709,0.81904525,0.0026560496,0.00057298236,0.00028705795,0.00014182633],"about_ca_topic_score_codex":0.0009791052,"about_ca_topic_score_gemma":0.00010906121,"teacher_disagreement_score":0.09580438,"about_ca_system_score_codex":0.000087417175,"about_ca_system_score_gemma":0.000020575031,"threshold_uncertainty_score":0.35327587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0781267,0.00013814542,0.9181161,0.000072791336,0.00016593815,0.00025095412,0.0000068503305,0.0001989948,0.0029235152],"genre_scores_gemma":[0.9256102,0.0000588198,0.07370694,0.000030614658,0.000108282,0.000026932812,0.000095524345,0.000034300432,0.0003284146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931896,0.000020608153,0.0002282349,0.00014446404,0.00011354154,0.00017417133],"domain_scores_gemma":[0.9996135,0.000068403424,0.00006453193,0.00015388566,0.00006215063,0.00003750348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014266477,0.00013712766,0.00022425289,0.00009801108,0.00005876952,0.000011980188,0.00009420821,0.00011432433,0.000008534188],"category_scores_gemma":[0.000017313198,0.00012838763,0.000058577712,0.00010448594,0.00006558366,0.00016114686,0.000009547256,0.00011754879,0.0000028044524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011444206,0.000021956377,0.00011069744,0.00018993698,0.000054777673,1.8238748e-7,0.00067496166,0.9841581,0.00003024134,0.009237326,0.0030166726,0.0023906773],"study_design_scores_gemma":[0.0006183512,0.00017715117,0.00009788868,0.000028100481,0.000042302803,4.4907466e-7,0.00015732227,0.9849679,0.00042551497,0.0001922275,0.013134925,0.00015789582],"about_ca_topic_score_codex":0.0000072892576,"about_ca_topic_score_gemma":0.00001691789,"teacher_disagreement_score":0.84748346,"about_ca_system_score_codex":0.000050574363,"about_ca_system_score_gemma":0.000005582167,"threshold_uncertainty_score":0.52354956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02354145,0.0000477681,0.95292026,0.0063202153,0.0002759416,0.00033914964,0.0000010607315,0.00033965334,0.016214507],"genre_scores_gemma":[0.77193403,0.000037827824,0.2259413,0.0015077154,0.00011535549,0.000052210664,0.0000061280552,0.000013718322,0.00039169233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988438,0.0001270941,0.00022812998,0.00025935305,0.00027039123,0.00027123562],"domain_scores_gemma":[0.9992476,0.000075862234,0.00013144307,0.000272427,0.00014108136,0.00013159547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285442,0.00013595232,0.000111647765,0.00008855231,0.0005399326,0.00039211148,0.00037719475,0.00008618608,0.000029821682],"category_scores_gemma":[0.00008349418,0.00011097746,0.00006197778,0.0003367107,0.00013975603,0.0007111618,0.00012730857,0.00026552437,0.00007159221],"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.000010937939,0.000028164819,0.0038185383,0.000015762973,0.000028081051,0.000028134726,0.017177956,0.0043714764,0.00013472437,0.9290339,0.001330974,0.04402137],"study_design_scores_gemma":[0.0048624044,0.00068937294,0.014769749,0.0004111085,0.0001127025,0.0013259584,0.014044926,0.37676695,0.0014316703,0.5034299,0.07975237,0.0024028916],"about_ca_topic_score_codex":0.00016215062,"about_ca_topic_score_gemma":0.0000994974,"teacher_disagreement_score":0.7483926,"about_ca_system_score_codex":0.00015776497,"about_ca_system_score_gemma":0.00015291014,"threshold_uncertainty_score":0.45255297},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982615,0.010923679,0.005484779,0.00018066356,0.000040263618,0.00058481866,0.00011533098,0.000020105985,0.000035381414],"genre_scores_gemma":[0.993193,0.00047197545,0.0060156453,0.00007229338,0.00003204264,0.00005896014,0.000025422449,0.00002553727,0.000105156134],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99903464,0.000084969106,0.00021363422,0.0001939516,0.00023478901,0.00023800801],"domain_scores_gemma":[0.9991889,0.00007364475,0.00015560891,0.00027043096,0.00006996822,0.00024145676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016550963,0.00018198848,0.00033774352,0.000078386256,0.00010790103,0.0000067815663,0.00006783793,0.00006849416,0.000019370042],"category_scores_gemma":[0.000045951485,0.0001186042,0.00012922428,0.00013176935,0.00020716141,0.00009752879,0.000029882196,0.00008945068,0.0000018439964],"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.0074868444,0.0075272927,0.49005342,0.0031155841,0.0058190627,0.00032430238,0.02136417,0.00800204,0.2728651,0.08443018,0.000044613127,0.0989674],"study_design_scores_gemma":[0.006733327,0.00043616688,0.8227676,0.00045775826,0.004547984,0.00002591604,0.0016295139,0.08877194,0.05288127,0.012065097,0.008902298,0.00078109716],"about_ca_topic_score_codex":0.00004984147,"about_ca_topic_score_gemma":0.0000011003907,"teacher_disagreement_score":0.3327142,"about_ca_system_score_codex":0.00003388774,"about_ca_system_score_gemma":0.00004104481,"threshold_uncertainty_score":0.4836539},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21469931,0.000770098,0.00541029,0.15156995,0.001393866,0.0037840644,0.00004058443,0.001086811,0.621245],"genre_scores_gemma":[0.96187174,0.00013315542,0.0013751368,0.020313784,0.0012576665,0.00029826708,0.00023689741,0.00004988655,0.014463475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872327,0.00001899764,0.000262998,0.00031341723,0.00037198013,0.00030934287],"domain_scores_gemma":[0.9993546,0.000025023226,0.00009259786,0.0003855334,0.000120662844,0.000021611117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004041583,0.00020615538,0.000117162504,0.000110385525,0.0006691916,0.00028878037,0.00029338535,0.000059603,0.00046402682],"category_scores_gemma":[0.00004054934,0.0001358145,0.000045763143,0.00034974632,0.000114117836,0.00042767642,0.000054807046,0.00017118898,0.00045889232],"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.00038534662,0.00024517791,0.0026106492,0.0003604182,0.00014926454,0.000011736309,0.00058514765,0.0036781272,0.000017467657,0.4871458,0.45858157,0.046229295],"study_design_scores_gemma":[0.00046332285,0.000023519588,0.0051311636,0.000048017355,0.000034580473,0.000001602083,0.00060706626,0.012751847,0.000021527389,0.0032130668,0.97745085,0.00025343642],"about_ca_topic_score_codex":0.00023919427,"about_ca_topic_score_gemma":0.0011334745,"teacher_disagreement_score":0.7471724,"about_ca_system_score_codex":0.00013490379,"about_ca_system_score_gemma":0.00001809604,"threshold_uncertainty_score":0.58982855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07946615,0.00047165577,0.90051484,0.00044190814,0.00047949122,0.00035218569,0.00001613982,0.0007093012,0.01754833],"genre_scores_gemma":[0.3461444,0.000112342685,0.6514556,0.0003863128,0.0004436796,0.000041624986,0.000044635355,0.00013463786,0.0012367396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835765,0.0002259787,0.0002767285,0.00026235124,0.00034571294,0.00053156895],"domain_scores_gemma":[0.9991733,0.00014215901,0.000045434277,0.00033145957,0.00011889955,0.00018873553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530411,0.000227443,0.00020880367,0.00008701654,0.00033932485,0.00018599501,0.00037999664,0.00017906165,0.000051560644],"category_scores_gemma":[0.00013299038,0.00019879235,0.000059524507,0.00045423058,0.00010551598,0.00025308674,0.00009441801,0.0005321419,0.000030467967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029952453,0.00005577296,0.0039815875,0.000117789416,0.00021800151,0.000025559955,0.010129433,0.87150854,0.013055834,0.067725055,0.01815518,0.014997315],"study_design_scores_gemma":[0.001118209,0.000049503302,0.00031619117,0.000037516133,0.000048093883,0.000035072117,0.00096612156,0.9834276,0.0013664527,0.0033689898,0.008747912,0.00051833165],"about_ca_topic_score_codex":0.000126665,"about_ca_topic_score_gemma":0.0000034743102,"teacher_disagreement_score":0.26667827,"about_ca_system_score_codex":0.0003016159,"about_ca_system_score_gemma":0.000060679005,"threshold_uncertainty_score":0.81065166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07143847,0.0002128631,0.92552924,0.00019030459,0.0019279413,0.00058153697,0.000005125261,0.00004214466,0.000072394054],"genre_scores_gemma":[0.9307804,0.00001035013,0.06767371,0.00030411713,0.00079971855,0.00019746595,0.0000020135035,0.000012521721,0.00021970253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830323,0.00004985238,0.0002828507,0.00039464678,0.0003444625,0.00062496],"domain_scores_gemma":[0.99851394,0.0007562639,0.00009110828,0.00029570202,0.00018602042,0.00015697214],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00086020614,0.00019526294,0.0001709558,0.00007544801,0.0014448501,0.00020222715,0.0007093008,0.000055844026,0.0000025401218],"category_scores_gemma":[0.00009578657,0.00014761365,0.00007111414,0.00026385472,0.00013843959,0.0004024505,0.00014514152,0.00011339819,8.536447e-7],"study_design_candidate":"design_other","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.00006515385,0.00040313322,0.001391747,0.00005200653,0.00018792863,0.000112503374,0.049945455,0.0047488515,0.0001367589,0.06477922,0.00079368154,0.87738353],"study_design_scores_gemma":[0.0016929581,0.0005506711,0.0003482599,0.0000902484,0.0001208145,0.0005407383,0.037765455,0.6823949,0.0077805854,0.014072636,0.25303185,0.0016108585],"about_ca_topic_score_codex":0.023575244,"about_ca_topic_score_gemma":0.041398786,"teacher_disagreement_score":0.8757727,"about_ca_system_score_codex":0.00025026966,"about_ca_system_score_gemma":0.0004260046,"threshold_uncertainty_score":0.99985516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41208437,0.01709996,0.21936728,0.2049333,0.01318544,0.0007795674,0.00011389772,0.0010223544,0.13141382],"genre_scores_gemma":[0.98200715,0.0019173028,0.0031350332,0.00047221608,0.00065525074,0.000043734795,0.000032290067,0.000043788958,0.011693235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990882,0.000048158236,0.00027416166,0.00015231797,0.00013411224,0.000303017],"domain_scores_gemma":[0.99929065,0.00021164092,0.00003187431,0.00031661958,0.000070297545,0.00007890303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875197,0.00015391115,0.00012220583,0.0000423573,0.00042537256,0.00006104888,0.00016314509,0.00019337761,0.00017581329],"category_scores_gemma":[0.00006162746,0.00013896653,0.00008517117,0.00020001414,0.00028942287,0.00009631454,0.000004669858,0.00040990984,0.00022963145],"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.0000028306235,0.000027543485,0.00022035676,0.000056103225,0.000051264746,0.0000020609293,0.0027756656,0.00087887247,0.00010035413,0.8855062,0.004269036,0.10610971],"study_design_scores_gemma":[0.00027966738,0.000030721556,0.010503115,0.000018412531,0.000031398464,0.0000041784097,0.00044227543,0.0029214066,0.00015124265,0.015203593,0.9702359,0.0001781311],"about_ca_topic_score_codex":0.00010087089,"about_ca_topic_score_gemma":0.0005370376,"teacher_disagreement_score":0.9659668,"about_ca_system_score_codex":0.00009889681,"about_ca_system_score_gemma":0.0000199564,"threshold_uncertainty_score":0.5666891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09174329,0.000051369967,0.9043199,0.00040398052,0.00009400677,0.0003245087,0.0000044641056,0.00034194358,0.0027165483],"genre_scores_gemma":[0.92876834,0.00007597137,0.06888683,0.00010739684,0.00013587711,0.000021042575,0.000055749002,0.000056232995,0.0018925562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931824,0.000015610864,0.00013320836,0.00019755005,0.00010239193,0.00023297238],"domain_scores_gemma":[0.999693,0.000044543413,0.00003227915,0.00013462023,0.000028260629,0.00006732644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001483373,0.00016770605,0.00016957286,0.00010777095,0.00013816003,0.000031334825,0.00006525388,0.000104389364,0.000005039192],"category_scores_gemma":[0.00002096264,0.00015491979,0.000041353724,0.00009208536,0.00007083354,0.0001340909,0.000010681398,0.00012118709,0.0000030826552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098216944,0.0000064690507,0.00006421699,0.000111088375,0.000044725293,0.0000010414332,0.0010377218,0.9758764,0.00012177205,0.01887651,0.0029410443,0.0008208023],"study_design_scores_gemma":[0.0010910305,0.000050824798,0.000048288835,0.000028156355,0.000047870293,0.0000021602873,0.00015771411,0.9906996,0.00014536646,0.00015665799,0.00736705,0.00020530594],"about_ca_topic_score_codex":0.000009038335,"about_ca_topic_score_gemma":0.000029200366,"teacher_disagreement_score":0.83702505,"about_ca_system_score_codex":0.00006419934,"about_ca_system_score_gemma":0.000004637685,"threshold_uncertainty_score":0.63174456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07664785,0.00016968863,0.9140967,0.0006990732,0.00019639789,0.0007550003,0.000027177646,0.00043320947,0.006974917],"genre_scores_gemma":[0.4724756,0.000020660033,0.5250954,0.0008692859,0.00017533753,0.00022958388,0.000011439062,0.000062774714,0.0010599374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972366,0.00007945187,0.0002898451,0.00079184555,0.0005243189,0.0010779004],"domain_scores_gemma":[0.99800587,0.00061681616,0.00004363185,0.0008584625,0.00013758654,0.0003376298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080763025,0.0002870705,0.0003118795,0.0003873151,0.000820536,0.00033345536,0.0015957173,0.00017521522,0.00027999977],"category_scores_gemma":[0.00009951082,0.00026780486,0.00015351562,0.0011998509,0.00020858478,0.0005170596,0.00017613242,0.0004056501,0.00010235867],"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.000086420965,0.000042522723,0.00040067054,0.000030116575,0.000040655716,0.000035106692,0.0011562648,0.0016791776,0.0019680667,0.93895346,0.0005890188,0.055018544],"study_design_scores_gemma":[0.0010497012,0.00038179217,0.0010222974,0.00004068434,0.000010966995,0.00008794344,0.0000665302,0.04904736,0.0059846705,0.9338866,0.007856662,0.0005648027],"about_ca_topic_score_codex":0.0000354399,"about_ca_topic_score_gemma":0.000010516282,"teacher_disagreement_score":0.39582774,"about_ca_system_score_codex":0.00012796589,"about_ca_system_score_gemma":0.00010818071,"threshold_uncertainty_score":0.9999774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101681076,0.0003195969,0.8953711,0.00075282244,0.0003784493,0.00028760498,0.0000025635004,0.00008777428,0.0011190325],"genre_scores_gemma":[0.65023804,0.000023898652,0.34813526,0.00023649236,0.000051745366,0.0000546098,0.000012778711,0.000007668644,0.0012395252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992159,0.000065102635,0.00016110047,0.00029751792,0.00010996425,0.00015044308],"domain_scores_gemma":[0.99948275,0.00014773477,0.000048136353,0.00016945392,0.000084696236,0.00006725065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041887732,0.000087707915,0.000094178,0.00006280576,0.000233199,0.00008484234,0.0001212827,0.00007673359,0.000007917224],"category_scores_gemma":[0.0001359787,0.00008365232,0.000041048337,0.00025497674,0.00006058141,0.0002221828,0.000018665038,0.000086259206,0.0000043267887],"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.0000030301915,0.00005526546,0.00033408205,0.00003088891,0.00002169711,0.0000018285634,0.0014822374,0.0015337698,0.00047617298,0.92346835,0.000602029,0.071990654],"study_design_scores_gemma":[0.0013105487,0.00022197574,0.0051920465,0.000011095298,0.000015661819,0.00012735887,0.000058895905,0.21505897,0.0029351143,0.7002746,0.074375525,0.00041825933],"about_ca_topic_score_codex":0.0000035307432,"about_ca_topic_score_gemma":0.0000015767347,"teacher_disagreement_score":0.5485569,"about_ca_system_score_codex":0.000037960584,"about_ca_system_score_gemma":0.000040491603,"threshold_uncertainty_score":0.34112424},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2145748,0.006748877,0.7599296,0.0024995236,0.0064872974,0.001122879,0.00026920348,0.0004032991,0.007964549],"genre_scores_gemma":[0.3164055,0.0018265641,0.60515076,0.0006979612,0.0016783999,0.00035495448,0.0005577128,0.0002528139,0.073075324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850094,0.00015397799,0.00044726778,0.00028036392,0.00016436844,0.00045307356],"domain_scores_gemma":[0.99920535,0.00019276912,0.00008593026,0.00022739633,0.0001586337,0.00012994042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047520048,0.00027398998,0.00029486985,0.000105926134,0.0003362317,0.00020284526,0.00007004305,0.0003745957,0.0009130521],"category_scores_gemma":[0.0002549055,0.00034317235,0.00014296552,0.00021417321,0.00015987897,0.00025402932,0.00000757177,0.00024728093,0.000048576814],"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.000021875694,0.00007503551,0.00020376385,0.00048473376,0.00013049119,0.0000049190694,0.00895215,0.3523126,0.0032406538,0.61017346,0.02157943,0.0028209032],"study_design_scores_gemma":[0.0026819922,0.00019002375,0.00003737159,0.000064541346,0.00012201728,0.000033638415,0.0012597725,0.20031995,0.010305316,0.004175973,0.7799838,0.0008255836],"about_ca_topic_score_codex":0.00007388198,"about_ca_topic_score_gemma":0.00007873716,"teacher_disagreement_score":0.7584044,"about_ca_system_score_codex":0.00030262064,"about_ca_system_score_gemma":0.00008404185,"threshold_uncertainty_score":0.999902},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94242036,0.014384505,0.011418673,0.004992277,0.0021721385,0.00038578635,0.0005176393,0.00006657823,0.023642067],"genre_scores_gemma":[0.9603603,0.0027010106,0.011203985,0.00045641442,0.00021193684,0.000064133324,0.000057005356,0.00009166525,0.02485355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789196,0.000017191294,0.00065720186,0.000696818,0.000036925823,0.0006999203],"domain_scores_gemma":[0.9988066,0.00003526324,0.0003915866,0.0005363097,0.000034281955,0.0001959649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002862679,0.00037585993,0.00060607766,0.00018452408,0.00033181833,0.0002079999,0.00033632628,0.00042826164,0.00081811036],"category_scores_gemma":[0.000010033076,0.0004620092,0.00020383338,0.0001969964,0.00070003245,0.00040226936,0.000040510993,0.0005293772,0.00073837757],"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.000041393123,0.0002221348,0.003016771,0.000056807196,0.000112120324,0.00010949409,0.0014973452,0.002561982,0.000007972959,0.98987293,0.000058498048,0.002442556],"study_design_scores_gemma":[0.0042115427,0.0007588689,0.0064425366,0.00013399587,0.00014351313,0.00031780932,0.0025555312,0.0014539048,0.000061182014,0.9280213,0.054364216,0.0015355698],"about_ca_topic_score_codex":0.0012027742,"about_ca_topic_score_gemma":0.00065642537,"teacher_disagreement_score":0.061851595,"about_ca_system_score_codex":0.0009739867,"about_ca_system_score_gemma":0.00010851371,"threshold_uncertainty_score":0.99978316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024249312,0.00027612847,0.9740525,0.00016428862,0.00012170677,0.0005753388,0.00000438799,0.0002600276,0.00029633986],"genre_scores_gemma":[0.1328664,0.00008517678,0.8664487,0.00009482808,0.00008299532,0.000041458214,0.000024711982,0.000042409996,0.00031332774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648196,0.00080319913,0.00038578568,0.00079926127,0.0005678698,0.0009619208],"domain_scores_gemma":[0.99838704,0.00065756735,0.0001371802,0.00040445937,0.000223545,0.00019023422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002038632,0.000311108,0.0003513969,0.0010491003,0.00088459195,0.00027130533,0.00081997114,0.00021817297,0.000022346685],"category_scores_gemma":[0.00024808705,0.0003328536,0.00019915115,0.0019939626,0.00027625327,0.00094371324,0.00012577983,0.0010895627,0.000004099244],"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.00007591763,0.00009443366,0.0004074439,0.000016106931,0.000030182237,0.0000953353,0.005279162,0.29780227,0.00063969224,0.13162948,0.0000065927543,0.56392336],"study_design_scores_gemma":[0.0011399359,0.00041878378,0.00015832364,0.00003929135,0.000008227477,0.000061357874,0.00095301034,0.8997062,0.0006841626,0.09633505,0.00013551593,0.00036013895],"about_ca_topic_score_codex":0.000027010728,"about_ca_topic_score_gemma":0.0000013462356,"teacher_disagreement_score":0.6019039,"about_ca_system_score_codex":0.00023992798,"about_ca_system_score_gemma":0.00010556602,"threshold_uncertainty_score":0.9999123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72208375,0.00040982745,0.2620774,0.0014094216,0.00129158,0.000301317,0.0000032228447,0.00017980751,0.0122436695],"genre_scores_gemma":[0.911923,0.000052057625,0.08710085,0.000780835,0.00005988307,0.000019825084,0.0000017729482,0.00000812722,0.000053637887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987077,0.00024658363,0.00019331477,0.00034669213,0.00023313815,0.0002725317],"domain_scores_gemma":[0.9992782,0.00021518236,0.000049242015,0.000340791,0.000028903534,0.00008771859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038981068,0.00014774852,0.00017060284,0.00018310364,0.00016651335,0.000077204146,0.00035789097,0.000112149566,0.000043034746],"category_scores_gemma":[0.00009758284,0.00012228027,0.0001047297,0.0007983956,0.00012611644,0.0001218176,0.000014271136,0.00027143437,0.00004365652],"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.000115615185,0.0006514465,0.116508365,0.000048403497,0.000046373363,0.00034015285,0.0035457525,0.0059100986,0.00023673556,0.8146292,0.0031573393,0.05481054],"study_design_scores_gemma":[0.038047545,0.0012861241,0.051947635,0.00049743266,0.00007926921,0.00021941843,0.00084311643,0.34460312,0.0546387,0.20234515,0.30013493,0.0053575616],"about_ca_topic_score_codex":0.000028306307,"about_ca_topic_score_gemma":0.000021535598,"teacher_disagreement_score":0.612284,"about_ca_system_score_codex":0.000031328967,"about_ca_system_score_gemma":0.00006147976,"threshold_uncertainty_score":0.49864444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61792696,0.00025340499,0.33611777,0.00021477527,0.00052989786,0.00012233041,0.000006093726,0.00025642215,0.04457232],"genre_scores_gemma":[0.99761444,0.000028084656,0.0017382983,0.00012709538,0.000104178886,0.000009939942,0.0000023250225,0.000022919736,0.00035273825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999228,0.000033424385,0.00017899483,0.00017958244,0.00010803063,0.00027198668],"domain_scores_gemma":[0.999609,0.00010512811,0.000033081546,0.00013161833,0.000024939436,0.000096244614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020085719,0.00015108648,0.00017775901,0.000044127883,0.0001447688,0.00004620478,0.000071427334,0.00009540338,0.000025541269],"category_scores_gemma":[0.000044275985,0.00013830686,0.000032099888,0.00007210644,0.00033298516,0.000050327533,0.00001334464,0.00015822082,0.000012959831],"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.000013428474,0.000067051944,0.005463,0.00035881327,0.00025396686,0.0000639739,0.0049915034,0.17684644,0.012177452,0.67780834,0.0059847,0.11597133],"study_design_scores_gemma":[0.008288979,0.00054799055,0.07103459,0.001304507,0.00021175538,0.0010752585,0.018357772,0.69544184,0.010888535,0.022288937,0.16569379,0.0048660496],"about_ca_topic_score_codex":0.000033342712,"about_ca_topic_score_gemma":0.000012395886,"teacher_disagreement_score":0.6555194,"about_ca_system_score_codex":0.00009448468,"about_ca_system_score_gemma":0.000008071263,"threshold_uncertainty_score":0.563999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97284377,0.00017400114,0.00030692347,0.0028233475,0.00026856485,0.00040689748,0.0000035615615,0.00010409491,0.02306882],"genre_scores_gemma":[0.9956189,0.000014852237,0.0011243494,0.00077792,0.00021453666,0.000024694007,0.000049650105,0.000038124374,0.0021370007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881786,0.000018572577,0.00032875207,0.00031163334,0.00024025468,0.00028290748],"domain_scores_gemma":[0.9991564,0.000057004858,0.00024045624,0.0003548674,0.0001684009,0.000022861905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039028807,0.00020069073,0.00027817106,0.00020082109,0.00016997222,0.00027035666,0.00042587097,0.000105518164,0.00036251714],"category_scores_gemma":[0.000105567866,0.00020198991,0.000105837265,0.0004454104,0.00017487223,0.00090259244,0.0002603846,0.00016758904,0.00017900355],"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.0013543518,0.0021210008,0.12647662,0.001958651,0.0007127941,0.00022814059,0.0042446614,0.001034084,0.2522208,0.45949084,0.0239437,0.12621437],"study_design_scores_gemma":[0.034917872,0.00042409467,0.27199218,0.002030157,0.0042492514,0.00015505946,0.008447603,0.0073250257,0.039412607,0.07799372,0.54470277,0.008349642],"about_ca_topic_score_codex":0.0018147328,"about_ca_topic_score_gemma":0.00014651714,"teacher_disagreement_score":0.5207591,"about_ca_system_score_codex":0.000083050334,"about_ca_system_score_gemma":0.000058399917,"threshold_uncertainty_score":0.82369095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055411193,0.0019943186,0.98952353,0.0017690567,0.00013597598,0.00060700334,0.0000032760772,0.00039531663,0.000030432575],"genre_scores_gemma":[0.14621069,0.00001840268,0.85300064,0.0002503298,0.00017655834,0.00015728996,0.000008843084,0.0000100754805,0.00016719445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913585,0.000039800358,0.00014442671,0.0003296065,0.00014193979,0.0002084008],"domain_scores_gemma":[0.99944025,0.000081444494,0.00007707567,0.00029207004,0.000071137736,0.000038034694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027539418,0.00012606775,0.00009779032,0.000051099527,0.0003593087,0.00025906836,0.00042421912,0.000081574515,0.0000018276531],"category_scores_gemma":[0.000020630703,0.00008355652,0.000032028234,0.00015412112,0.00016162418,0.00034151692,0.000048409132,0.00013747031,9.631741e-7],"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.000004233689,0.00011120969,0.00009832559,0.000054362215,0.000012790576,0.0000046864766,0.00094837346,0.00007520441,0.0033909346,0.43230867,0.0009729979,0.5620182],"study_design_scores_gemma":[0.00030107427,0.00025933582,0.00034045565,0.000020550133,0.000023654915,0.00010907381,0.000060811213,0.17085947,0.0056967884,0.81914514,0.0029011667,0.00028250614],"about_ca_topic_score_codex":0.00011669529,"about_ca_topic_score_gemma":0.000013014125,"teacher_disagreement_score":0.5617357,"about_ca_system_score_codex":0.00009222436,"about_ca_system_score_gemma":0.0000230728,"threshold_uncertainty_score":0.34073362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29936454,0.00007332011,0.69857496,0.000027464708,0.00018019073,0.00015937192,0.0000041199114,0.00022714984,0.0013888754],"genre_scores_gemma":[0.8324691,0.000023513323,0.16680993,0.000040609586,0.00016227832,0.00012233364,0.000025022819,0.00004068043,0.00030652434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.000009352043,0.00018849799,0.00016851563,0.000084495296,0.00025272436],"domain_scores_gemma":[0.9996335,0.000018830626,0.000024938823,0.00017875507,0.000052186453,0.00009180979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070267466,0.00013760944,0.0001397656,0.00006883157,0.00014598256,0.00006896563,0.00012602564,0.00014247367,0.000034358116],"category_scores_gemma":[0.000013258435,0.00013310583,0.000056608642,0.00009356097,0.00002955272,0.00028216292,0.000003071099,0.00009025485,0.000009042252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001318985,0.000011764324,0.0000034535437,0.000027571677,0.000010921713,1.913142e-7,0.0016042724,0.9762803,0.013608568,0.0057184002,0.00010750278,0.002625753],"study_design_scores_gemma":[0.00022881373,0.000021171823,0.000014397198,0.00000974956,0.000005836621,0.0000011002135,0.0001882911,0.99671775,0.0019930976,0.00052445516,0.000114498755,0.00018084102],"about_ca_topic_score_codex":0.000030871575,"about_ca_topic_score_gemma":0.000009284599,"teacher_disagreement_score":0.53310454,"about_ca_system_score_codex":0.000064437154,"about_ca_system_score_gemma":0.000010833657,"threshold_uncertainty_score":0.5427898},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96492624,0.0009613774,0.031816375,0.000014967772,0.00048115218,0.00017576202,7.35943e-7,0.00016282016,0.0014605402],"genre_scores_gemma":[0.999363,0.000042718388,0.0001371099,0.000009643255,0.0001166467,0.000049960345,0.0000013628078,0.00002105986,0.0002584912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993499,0.00002965768,0.0002014607,0.00014034842,0.0000898069,0.00018880943],"domain_scores_gemma":[0.99973243,0.0000544873,0.000025083127,0.00011361083,0.000022767743,0.0000516315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104047154,0.00011515667,0.00013516807,0.000104319086,0.00007612845,0.00006805201,0.000049611986,0.00012954067,0.000006866677],"category_scores_gemma":[0.000020426747,0.00011206419,0.000019791929,0.00015820086,0.000030864965,0.00018722432,0.0000055049395,0.00013671316,0.000029103468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018302453,0.000005802697,0.0013485141,0.000085582564,0.0000074423006,0.0000024647438,0.000750514,0.9746933,0.006635786,0.0009014191,0.000051976884,0.015515392],"study_design_scores_gemma":[0.00024221711,0.00001762391,0.015691223,0.00003408409,0.0000026203627,0.000009838432,0.00024248697,0.97979265,0.0005352107,0.00012874398,0.003129457,0.000173856],"about_ca_topic_score_codex":0.0007095568,"about_ca_topic_score_gemma":0.0000954092,"teacher_disagreement_score":0.03443674,"about_ca_system_score_codex":0.0001081192,"about_ca_system_score_gemma":0.000003009739,"threshold_uncertainty_score":0.4569845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107274584,0.00005751558,0.8873553,0.00359042,0.00023533402,0.00020413953,6.7999423e-7,0.00016735136,0.0011146225],"genre_scores_gemma":[0.35800874,0.0000011253388,0.64089364,0.0006190409,0.00003745015,0.000017099823,6.658753e-7,0.00001268329,0.0004095183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998751,0.00012478013,0.00017626301,0.00037850853,0.00020916607,0.00036026922],"domain_scores_gemma":[0.9989797,0.00016037344,0.000085570944,0.00053476985,0.000072707764,0.00016686985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020810883,0.000200885,0.00023961658,0.000084583226,0.00024161811,0.00027839356,0.0005344249,0.000115023075,0.00001830626],"category_scores_gemma":[0.00004587843,0.00013604791,0.000074212745,0.00019359238,0.000081797196,0.00054242794,0.000074811374,0.00021962893,0.000039709303],"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.0000071740787,0.000058977083,0.014468801,0.000018496463,0.00006902418,0.00003755835,0.0022205627,0.000013448463,0.0010364709,0.60190207,0.0011701554,0.37899724],"study_design_scores_gemma":[0.0017658866,0.00011593382,0.4891545,0.00004955899,0.000027967699,0.00005201838,0.000037414327,0.03778762,0.0018779071,0.46611753,0.0021881757,0.00082549255],"about_ca_topic_score_codex":0.00017846428,"about_ca_topic_score_gemma":0.000019776717,"teacher_disagreement_score":0.4746857,"about_ca_system_score_codex":0.000042224987,"about_ca_system_score_gemma":0.000036923826,"threshold_uncertainty_score":0.5547873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019934447,0.000120422585,0.98467165,0.00095022866,0.000048070528,0.00056060596,0.00003543528,0.00025103675,0.011369084],"genre_scores_gemma":[0.0052549113,0.000045747198,0.9844016,0.0002537921,0.0001995714,0.00018242502,0.00003308415,0.00008997127,0.009538897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971548,0.00044324854,0.0004934059,0.0004665097,0.000911104,0.00053097337],"domain_scores_gemma":[0.997108,0.0015178571,0.00023689886,0.0006638647,0.00030347527,0.00016992868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008779484,0.0003127618,0.00042175304,0.00026497562,0.00046558157,0.0001651212,0.0003877152,0.00019581198,0.0007079154],"category_scores_gemma":[0.002052961,0.00026923246,0.00008839914,0.00056984305,0.0002548412,0.00045664207,0.00011053034,0.00056610984,0.000028621389],"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.0000796267,0.00059717166,0.00017058865,0.00048738805,0.00030371596,0.000056631623,0.026010549,0.008756565,0.00013759374,0.95102465,0.008467279,0.003908244],"study_design_scores_gemma":[0.0032069664,0.0002254759,0.0000759289,0.00008216104,0.00010997035,0.0002909182,0.00505632,0.78914046,0.00032380357,0.19790652,0.0026236668,0.0009577803],"about_ca_topic_score_codex":0.000029275187,"about_ca_topic_score_gemma":0.00001820996,"teacher_disagreement_score":0.78038394,"about_ca_system_score_codex":0.00029372884,"about_ca_system_score_gemma":0.00008162905,"threshold_uncertainty_score":0.999976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046971418,0.0011372498,0.94782805,0.00037181,0.00033355708,0.00037281043,0.000026180076,0.0003133123,0.0026456083],"genre_scores_gemma":[0.12086578,0.00007944585,0.8779666,0.00017891978,0.00016335462,0.000066074805,0.000022890243,0.00007823874,0.00057868747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.00009770706,0.0003607712,0.00014641519,0.00016880089,0.0002645035],"domain_scores_gemma":[0.9990457,0.0003911749,0.00008624683,0.00024821894,0.00012599124,0.0001026187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781606,0.00017029273,0.00024936805,0.00008488263,0.00009289471,0.000043033346,0.00022207227,0.0001612213,0.000007499488],"category_scores_gemma":[0.00023392943,0.0001397934,0.00008030806,0.00024099083,0.00007103448,0.00009926504,0.000027196109,0.00021598295,0.0000049424225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012034761,0.0000401563,0.0020712218,0.00060619845,0.00044097286,0.000004703635,0.045745168,0.53699607,0.00307729,0.24672683,0.038661156,0.1255099],"study_design_scores_gemma":[0.0058378377,0.0003975657,0.0014221583,0.0002488275,0.000256648,0.000034473556,0.013467477,0.756542,0.013887345,0.10176908,0.104658,0.0014785712],"about_ca_topic_score_codex":0.00008997619,"about_ca_topic_score_gemma":0.000007828265,"teacher_disagreement_score":0.21954595,"about_ca_system_score_codex":0.00009723144,"about_ca_system_score_gemma":0.00009307469,"threshold_uncertainty_score":0.57006097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9397107,0.00005831789,0.000048820588,0.003175752,0.00031128037,0.0000900044,0.0000112315065,0.000050037877,0.05654389],"genre_scores_gemma":[0.9794183,0.000013097967,0.00006199174,0.007179781,0.001015708,0.000014033427,0.00011150681,0.000016951273,0.012168653],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925447,0.0000028569584,0.00018065037,0.00017645555,0.00013346827,0.00025211176],"domain_scores_gemma":[0.99978614,0.0000108044715,0.000041927004,0.00012411644,0.000017012015,0.000019998257],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006349685,0.00013435008,0.0001343097,0.000041255455,0.00037448583,0.00008608545,0.00013529665,0.00005361541,0.0052622464],"category_scores_gemma":[0.0000026090604,0.00013130977,0.000047707093,0.000067636356,0.000063850384,0.00032268304,0.000013880176,0.000082828155,0.0003320239],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00021589761,0.00015530942,0.17210606,0.0001778472,0.00031315407,0.00023473267,0.0013002197,0.007889261,0.0017258734,0.19458956,0.5718701,0.049422022],"study_design_scores_gemma":[0.00033868843,0.0000020519294,0.036905438,0.0000038356275,0.000018537288,0.000004436364,0.00005318105,0.0006417807,0.00007124523,0.00049749814,0.96125954,0.00020377876],"about_ca_topic_score_codex":0.41181046,"about_ca_topic_score_gemma":0.41792792,"teacher_disagreement_score":0.38938946,"about_ca_system_score_codex":0.00027295444,"about_ca_system_score_gemma":0.00005249849,"threshold_uncertainty_score":0.9956471},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89788616,0.00035768488,0.03199352,0.0075914767,0.00028939705,0.00039233215,0.0000013053967,0.00031636565,0.061171744],"genre_scores_gemma":[0.99234134,0.0002559048,0.0004733494,0.0026626305,0.00027855785,0.000028096418,0.000046020425,0.000012342653,0.0039017524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992526,0.000007917982,0.00018578468,0.00024255554,0.00015622638,0.00015488495],"domain_scores_gemma":[0.9996623,0.0000059595673,0.00003269663,0.00019907976,0.00008803267,0.000011946638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018438725,0.00011434744,0.00009265908,0.00010132526,0.00024674722,0.00012114274,0.00010603555,0.000057762976,0.0004795386],"category_scores_gemma":[0.000022203387,0.00011790654,0.000023182749,0.0003207989,0.00007559833,0.00090936135,0.00001908218,0.00008018823,0.00042051196],"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.000055261364,0.00009178556,0.0017656139,0.00032510533,0.000028403916,0.0000023706866,0.0005745014,0.022214472,0.00006236045,0.7305596,0.011817455,0.2325031],"study_design_scores_gemma":[0.0008215032,0.000012431923,0.041179426,0.000044330576,0.000062894316,0.0000022309935,0.0005112397,0.5756742,0.000025017522,0.064735495,0.31636423,0.00056699215],"about_ca_topic_score_codex":0.0011194522,"about_ca_topic_score_gemma":0.0001765589,"teacher_disagreement_score":0.66582406,"about_ca_system_score_codex":0.000037107442,"about_ca_system_score_gemma":0.0000060707143,"threshold_uncertainty_score":0.54049706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30374652,0.00030739364,0.6860078,0.004486554,0.00018775386,0.0002818883,0.0000019114516,0.00012889456,0.004851262],"genre_scores_gemma":[0.9672194,0.000004715689,0.032273173,0.00035309608,0.000071993476,0.00002887953,6.928384e-7,0.0000050015,0.000043051536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987907,0.00009238091,0.00015726,0.00045703104,0.00018650547,0.00031611885],"domain_scores_gemma":[0.99921036,0.00010650501,0.000040039995,0.00045862288,0.000031436102,0.00015302098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040942515,0.00015938147,0.00015848292,0.000022636534,0.00038868553,0.00017794539,0.00056173734,0.000082368904,0.0000025246425],"category_scores_gemma":[0.00017977941,0.000106216496,0.00005362501,0.00035172797,0.0004421561,0.00015497339,0.00021684515,0.00016497096,0.000021195798],"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.0000047070284,0.000035582878,0.0031623566,0.000018262503,0.000010158944,0.000006989645,0.0044413297,0.0007903178,0.000006696732,0.94887275,0.00007188055,0.042578995],"study_design_scores_gemma":[0.000821392,0.00021225028,0.0859929,0.00003099662,0.00002810424,0.0001602708,0.0007210305,0.014016707,0.00021741197,0.8927609,0.004477838,0.0005601977],"about_ca_topic_score_codex":0.00015386718,"about_ca_topic_score_gemma":0.00016135552,"teacher_disagreement_score":0.6634729,"about_ca_system_score_codex":0.00027316264,"about_ca_system_score_gemma":0.000084533116,"threshold_uncertainty_score":0.43313828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96492964,0.0028445502,0.021112703,0.0021557563,0.0003718075,0.0006265604,0.0002371965,0.00006558729,0.007656168],"genre_scores_gemma":[0.97060484,0.00046968786,0.015418537,0.00012596222,0.000082702274,0.000090430156,0.000031639665,0.0000427068,0.0131334895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841774,0.00030820625,0.00046097545,0.00027524625,0.00018009468,0.00035774847],"domain_scores_gemma":[0.99793583,0.0008983915,0.00025393988,0.00061090634,0.00016459242,0.00013636],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005463462,0.00022916883,0.00036222223,0.00008770645,0.0002105666,0.00004747595,0.0003245908,0.00023204928,0.0011304595],"category_scores_gemma":[0.00024782133,0.00023380881,0.00020017682,0.00053796085,0.0010138227,0.00015654456,0.000026176138,0.0003477842,0.0002717095],"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.000012068307,0.0003208047,0.0050247707,0.00023578038,0.00009414204,0.0000024855449,0.0019660543,0.0000016230026,0.00075240404,0.97834694,0.010594687,0.0026482544],"study_design_scores_gemma":[0.00026861308,0.00004432209,0.025654688,0.00007835951,0.000062718864,0.000010099238,0.00045781388,0.00007589439,0.0014624243,0.96333283,0.008308444,0.00024378348],"about_ca_topic_score_codex":0.0008544795,"about_ca_topic_score_gemma":0.0002812542,"teacher_disagreement_score":0.020629918,"about_ca_system_score_codex":0.00005074544,"about_ca_system_score_gemma":0.000031015195,"threshold_uncertainty_score":0.9997826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827912,0.000011132262,0.006538357,0.00095931673,0.00006578035,0.0002508441,0.00000956511,0.0001123826,0.009261451],"genre_scores_gemma":[0.9915502,0.000003360246,0.0071551492,0.0006035409,0.00010790673,0.000017102508,0.0000075290714,0.000016601505,0.00053860253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916697,0.00008382773,0.00017145794,0.00023407004,0.00014615075,0.00019755593],"domain_scores_gemma":[0.99915963,0.00034639423,0.00009573738,0.00029181747,0.000045567347,0.00006085657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029206078,0.00014654617,0.00016748454,0.000067049565,0.0004125453,0.000057924448,0.00011654834,0.00013289267,0.00020707259],"category_scores_gemma":[0.00017882875,0.00014050135,0.00010296127,0.00020082467,0.00010853189,0.00012560333,0.000008930967,0.00021645872,0.00006050602],"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.000024020237,0.00017820353,0.00020955842,0.000008680635,0.000016571035,0.0000030788585,0.00092282257,0.0000032634466,0.003211931,0.9920725,0.00080645405,0.0025428913],"study_design_scores_gemma":[0.00036849998,0.00003130692,0.002001832,0.00002092191,0.00003591474,0.000024881158,0.00012726945,0.00026864622,0.0036391001,0.9919498,0.0013548454,0.00017701196],"about_ca_topic_score_codex":0.000007341366,"about_ca_topic_score_gemma":0.0000042933825,"teacher_disagreement_score":0.008759036,"about_ca_system_score_codex":0.000101753445,"about_ca_system_score_gemma":0.000016282824,"threshold_uncertainty_score":0.57294786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026621385,0.000010570478,0.9951093,0.0010744549,0.00013746598,0.00081147306,0.000027903414,0.00014308053,0.000023601204],"genre_scores_gemma":[0.20997284,0.0000012329799,0.7893548,0.00006302533,0.0000424974,0.00010235183,0.00041340344,0.000020138224,0.000029698384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983375,0.00018067996,0.0003742445,0.00045291142,0.0004193928,0.00023527307],"domain_scores_gemma":[0.9978002,0.00047420716,0.00031064975,0.0002351989,0.0009738091,0.00020594077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032316532,0.00020942416,0.00025904563,0.00018728623,0.00023913427,0.00006550358,0.0003304788,0.00013356417,0.0000022148288],"category_scores_gemma":[0.00031592717,0.00019570667,0.000053194384,0.0007872998,0.00028657375,0.000723076,0.000057714147,0.00016651046,0.0000023692364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000141367,0.000082326944,0.0009483649,0.000015198651,0.000025781726,0.0000032436235,0.0014553644,0.9905466,0.000090976966,0.0046463516,0.00024470157,0.0017997682],"study_design_scores_gemma":[0.002428042,0.00042250965,0.0027476347,0.000018497269,0.000013117368,0.000018974266,0.00009841604,0.98523515,0.0009886575,0.007771065,0.000020869453,0.00023707213],"about_ca_topic_score_codex":0.000009283076,"about_ca_topic_score_gemma":6.5901764e-7,"teacher_disagreement_score":0.2073107,"about_ca_system_score_codex":0.00026369133,"about_ca_system_score_gemma":0.0002750069,"threshold_uncertainty_score":0.79806864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582195,0.00095653866,0.035440568,0.003963785,0.000058161233,0.00027170836,0.0000036069052,0.00010689885,0.0009791915],"genre_scores_gemma":[0.9703137,0.00023479787,0.028719286,0.000614275,0.000017384667,0.0000035942953,0.000001261985,0.0000051855645,0.00009046074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987587,0.0001439827,0.00016859038,0.0004493137,0.0001818479,0.0002976147],"domain_scores_gemma":[0.9992726,0.0001826842,0.000044512657,0.00035091944,0.00004030147,0.0001089799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050599704,0.00012912808,0.00016298216,0.00022626216,0.00016631997,0.0001083149,0.00033445293,0.000098674376,4.6167688e-7],"category_scores_gemma":[0.00019800373,0.00011304533,0.000022413456,0.00045244943,0.00032254143,0.00039513438,0.00008017835,0.00030657247,7.386958e-7],"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.0001731252,0.000044258424,0.0021839822,0.000019115716,0.0000074988866,0.00014373715,0.0034827627,0.000020987822,0.0014143572,0.820746,0.00013071107,0.17163345],"study_design_scores_gemma":[0.0011995686,0.00017678438,0.076059036,0.000022510554,0.0000018130391,0.000083307124,0.00007074089,0.0020786126,0.0014575765,0.9177386,0.00088611036,0.0002253507],"about_ca_topic_score_codex":0.000023822671,"about_ca_topic_score_gemma":0.000028408682,"teacher_disagreement_score":0.1714081,"about_ca_system_score_codex":0.000027719865,"about_ca_system_score_gemma":0.000019952247,"threshold_uncertainty_score":0.46098548},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88996744,0.001163411,0.09256307,0.00069003087,0.00025878253,0.00021469631,0.00014701286,0.000033152155,0.014962397],"genre_scores_gemma":[0.9973516,0.00010036785,0.0019094279,0.000039041857,0.000039850533,0.00001646555,0.0004061679,0.0000079789625,0.0001290993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908346,0.00002619181,0.0004302556,0.0002496756,0.00004518929,0.00016520362],"domain_scores_gemma":[0.9995443,0.000013460064,0.00018416304,0.00017917034,0.000031557593,0.000047334826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044212257,0.00009676427,0.00028577555,0.00018765195,0.000045527748,0.00003264406,0.00012521695,0.000047968973,0.000057793903],"category_scores_gemma":[0.000048485497,0.00011135895,0.000056763554,0.00045208793,0.00006973344,0.00016241088,0.000021615917,0.00011299279,0.000018827994],"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.000024499976,0.00025157921,0.019068904,0.000110115994,0.00007612697,0.0000035986202,0.0037073353,0.0019494746,0.000046425805,0.9735143,0.0005784418,0.0006691529],"study_design_scores_gemma":[0.0063800043,0.00047982286,0.077929296,0.00009874557,0.00009237062,0.000032708573,0.06403184,0.26242322,0.000732122,0.5166223,0.0693017,0.0018758582],"about_ca_topic_score_codex":0.0005587647,"about_ca_topic_score_gemma":0.000046274206,"teacher_disagreement_score":0.456892,"about_ca_system_score_codex":0.00017790699,"about_ca_system_score_gemma":0.000024584682,"threshold_uncertainty_score":0.45410863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040086962,0.015567843,0.8943129,0.044564907,0.0005235079,0.00049616996,0.00030088497,0.00009158254,0.0040552295],"genre_scores_gemma":[0.8854411,0.009519845,0.09447399,0.0023884287,0.0008311744,0.0005007604,0.00015095403,0.00007067771,0.0066230376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981788,0.00004463262,0.0006453023,0.0004906953,0.000068079324,0.00057252095],"domain_scores_gemma":[0.9988915,0.00016006833,0.00039770102,0.00030796375,0.00010062043,0.00014218893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068293983,0.0002595949,0.00037096,0.00020978978,0.00065416656,0.00015553649,0.00025685687,0.00041027597,0.00033136996],"category_scores_gemma":[0.00028859964,0.00036577546,0.0001834522,0.0005410097,0.000301294,0.00031617517,0.000044267657,0.000464421,0.00032858294],"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.000007974953,0.00039277662,0.0068551116,0.00009459742,0.00005106416,0.00000397797,0.0068068644,0.0012315229,0.000039169852,0.9674775,0.0035404356,0.013499028],"study_design_scores_gemma":[0.00072491565,0.0001391935,0.044451114,0.00010061919,0.00004026765,0.00007602471,0.00060524733,0.14261557,0.000035715733,0.7157584,0.09487936,0.00057359133],"about_ca_topic_score_codex":0.001850737,"about_ca_topic_score_gemma":0.00061670406,"teacher_disagreement_score":0.84535414,"about_ca_system_score_codex":0.00085243804,"about_ca_system_score_gemma":0.0000699448,"threshold_uncertainty_score":0.9998794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960649,0.00011831178,0.0011170519,0.00013157341,0.000027837086,0.00019507758,0.000037125224,0.0002058177,0.0021022758],"genre_scores_gemma":[0.9975703,0.000013291656,0.002141828,0.00013364668,0.000012873783,0.000013562485,0.000017157166,0.000010707209,0.00008665204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899566,0.00029841106,0.0002684559,0.00015569583,0.000097850956,0.00018391553],"domain_scores_gemma":[0.99886984,0.0006793048,0.00010258044,0.0002652126,0.000041692976,0.000041401294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087557,0.00012252394,0.00023306721,0.00015454867,0.00007245805,0.000011046483,0.00017665849,0.00011600573,0.00005819922],"category_scores_gemma":[0.0003134236,0.00010819074,0.00007451796,0.0004535686,0.00019726124,0.000037169193,0.000006835684,0.00018740575,0.00000503157],"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.000051981988,0.00015691752,0.0022730075,0.000014938484,0.000020447642,0.0000045498805,0.0015242898,0.000011902838,0.0015105354,0.99294466,0.00086787535,0.0006188784],"study_design_scores_gemma":[0.00029365782,0.000039577528,0.1624354,0.00001241358,0.000011632494,0.0000049736414,0.00012908365,0.00009400541,0.0022414455,0.8346012,0.000032659667,0.000103904684],"about_ca_topic_score_codex":0.00005559094,"about_ca_topic_score_gemma":0.00012981969,"teacher_disagreement_score":0.16016239,"about_ca_system_score_codex":0.000020107287,"about_ca_system_score_gemma":0.000020079777,"threshold_uncertainty_score":0.44118902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731202,0.00035787022,0.02295364,0.0016958861,0.00003961854,0.00047008292,0.00002966309,0.000045532284,0.0012874864],"genre_scores_gemma":[0.99694103,0.00003159349,0.002424069,0.00036425196,0.000030243542,0.000035909747,0.000002881728,0.0000080880745,0.00016191947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995381,0.000027241893,0.00013965867,0.000108787564,0.000069487265,0.00011669988],"domain_scores_gemma":[0.9989955,0.0006558659,0.00007954926,0.00020196503,0.00003615517,0.00003096593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002080682,0.000088636,0.00013472892,0.000045514244,0.0002873554,0.000023782757,0.00013175464,0.00008314428,0.000007559382],"category_scores_gemma":[0.00007387364,0.000060755778,0.00007238563,0.000111278765,0.00028527557,0.000028316324,0.000006642896,0.000103033475,3.3058535e-7],"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.000027936978,0.000034866873,0.00021735167,0.000022835107,0.000028765078,2.606508e-7,0.0014828499,0.0000015442854,0.0007421488,0.9916711,0.0010174734,0.0047528683],"study_design_scores_gemma":[0.00029069075,0.000048876005,0.0022287797,0.000007499198,0.000043974935,0.000005242264,0.0005090244,0.000061611805,0.0016068937,0.99138176,0.0037397565,0.00007589071],"about_ca_topic_score_codex":0.000004533645,"about_ca_topic_score_gemma":0.000012932975,"teacher_disagreement_score":0.023820823,"about_ca_system_score_codex":0.0000059408094,"about_ca_system_score_gemma":0.000009099115,"threshold_uncertainty_score":0.24775487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94647235,0.0002308533,0.04715313,0.00017221508,0.0011009004,0.00010388888,0.000002182603,0.00047083315,0.0042936592],"genre_scores_gemma":[0.7652483,0.000046001234,0.23427293,0.00007317668,0.00018583713,0.0000145950025,0.0000081669805,0.00003432757,0.00011669641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993475,0.000010591084,0.00017598513,0.00014173653,0.000101250145,0.00022292532],"domain_scores_gemma":[0.9996822,0.000041200477,0.00001727134,0.00016235975,0.00002309674,0.00007387082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016150383,0.00012048088,0.000121365425,0.0001596572,0.00006235209,0.00004662149,0.00012345637,0.0001910677,0.00006226798],"category_scores_gemma":[0.00006965392,0.00012721684,0.000036195743,0.00030104961,0.000050321603,0.00009380723,0.000009226047,0.000636646,0.000048067803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089800715,0.000095955234,0.02272726,0.00019462737,0.00006847625,0.00005059782,0.004473487,0.8635496,0.014988771,0.046379298,0.0002748855,0.047188085],"study_design_scores_gemma":[0.00082900986,0.000014553734,0.002582068,0.000038876587,0.000009705447,0.00002804544,0.00033343124,0.98648536,0.003849159,0.002349102,0.00301044,0.00047022302],"about_ca_topic_score_codex":0.000015999158,"about_ca_topic_score_gemma":0.000033712593,"teacher_disagreement_score":0.1871198,"about_ca_system_score_codex":0.00003892633,"about_ca_system_score_gemma":0.000010798048,"threshold_uncertainty_score":0.5187753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56659,0.00577984,0.39453158,0.01001103,0.0027368008,0.0005796162,0.000022849492,0.00032019088,0.019428067],"genre_scores_gemma":[0.9421643,0.00019413534,0.017643223,0.011125065,0.001782145,0.000040116924,0.000039689865,0.00015836251,0.026852941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971386,0.00012890097,0.0006188172,0.0007713727,0.00039019945,0.00095210096],"domain_scores_gemma":[0.9986375,0.00009542973,0.00020079415,0.0006550308,0.00030357973,0.000107663895],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00088720315,0.0005172462,0.00058234064,0.000483547,0.00064474717,0.00043010246,0.00044401528,0.00029612787,0.00094368594],"category_scores_gemma":[0.00096336013,0.0005746884,0.0003377379,0.0011688557,0.00020103638,0.001281349,0.00013499298,0.00055118167,0.0018098777],"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.00025605905,0.00057710125,0.0041656303,0.00073848997,0.0006937319,0.00039032043,0.0022315057,0.35354608,0.0015980842,0.59723616,0.016583504,0.02198331],"study_design_scores_gemma":[0.0016568919,0.000028694058,0.000049202445,0.00042792034,0.000588679,0.000031959327,0.0014755527,0.098456144,0.00027713188,0.08021737,0.8152956,0.0014948632],"about_ca_topic_score_codex":0.000455403,"about_ca_topic_score_gemma":0.00017263879,"teacher_disagreement_score":0.7987121,"about_ca_system_score_codex":0.0002995659,"about_ca_system_score_gemma":0.000032055643,"threshold_uncertainty_score":0.9999696},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5437406,0.0063545196,0.26975277,0.017461898,0.0003154323,0.0011627119,0.00012632344,0.00048801504,0.16059774],"genre_scores_gemma":[0.09235859,0.0012948299,0.8236492,0.0011002651,0.00062655634,0.0002448427,0.000017437076,0.00012105046,0.080587186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969055,0.001303469,0.00042436723,0.00041046634,0.00018386255,0.0007723275],"domain_scores_gemma":[0.9964797,0.0023131836,0.00018108959,0.000670837,0.00008130611,0.00027389763],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034779247,0.00035358366,0.0003472192,0.00013519365,0.0006328378,0.00016331124,0.0004658295,0.0010422971,0.0010916016],"category_scores_gemma":[0.00082887965,0.0003757551,0.00022624448,0.00066668686,0.0009590041,0.00022805606,0.00006042309,0.0013381306,0.00029609626],"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.000031841224,0.000631332,0.00028615634,0.00028127606,0.00012721459,0.000023401988,0.008146158,0.000114640214,0.00455146,0.9480359,0.022028979,0.015741626],"study_design_scores_gemma":[0.00040698436,0.000034309727,0.00010049976,0.0001009979,0.00018596754,0.0001705437,0.0010941715,0.0009549259,0.0047029397,0.7220416,0.26988736,0.00031968005],"about_ca_topic_score_codex":0.00018418433,"about_ca_topic_score_gemma":0.000045787914,"teacher_disagreement_score":0.5538965,"about_ca_system_score_codex":0.0005455578,"about_ca_system_score_gemma":0.00024661847,"threshold_uncertainty_score":0.99986947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4657649,0.00052738865,0.5330605,0.00012176732,0.0000796981,0.00026921433,0.00006133976,0.000078647914,0.000036574726],"genre_scores_gemma":[0.74950516,0.000111656176,0.25006685,0.0000538331,0.00010358027,0.000031432108,0.000015449863,0.00005305976,0.00005898571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988846,0.00007046996,0.00034342363,0.00027565562,0.000087667664,0.00033814146],"domain_scores_gemma":[0.9989904,0.00063432066,0.000069763584,0.00012470596,0.00008656333,0.0000942282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986121,0.00019085938,0.0003307067,0.000070700204,0.00016682303,0.00006808688,0.000068849164,0.00013461403,0.0000013841069],"category_scores_gemma":[0.00037065,0.0001968663,0.00004636559,0.00009421584,0.00010631298,0.0002819443,0.000035912755,0.00013589955,9.1480835e-8],"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.00024701378,0.000055698187,0.022742698,0.0007460041,0.0003576051,0.0000034655834,0.013504195,0.31039882,0.0047348845,0.0036250616,0.0005067592,0.6430778],"study_design_scores_gemma":[0.0011790821,0.00004274502,0.006467127,0.00010276094,0.00003052221,0.0000069619073,0.00022309246,0.990333,0.0008559457,0.0003124844,0.00021948156,0.00022679406],"about_ca_topic_score_codex":0.00003843971,"about_ca_topic_score_gemma":0.00004350786,"teacher_disagreement_score":0.6799342,"about_ca_system_score_codex":0.00005363629,"about_ca_system_score_gemma":0.000010587831,"threshold_uncertainty_score":0.80279744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760595,0.00040977102,0.00017430524,0.0018753636,0.0006712421,0.000155782,0.00021114005,0.000018460101,0.020424461],"genre_scores_gemma":[0.9959732,0.0004827324,0.0006180245,0.0008119828,0.00018407767,0.000060028724,0.00013706024,0.000016547016,0.0017163354],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99908,0.000007130922,0.00037605714,0.0002684738,0.000024420498,0.00024388813],"domain_scores_gemma":[0.99962914,0.000023688222,0.00013019452,0.0001519994,0.0000036864874,0.00006129483],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009655909,0.00011726737,0.00017568427,0.00022698577,0.000081753555,0.00004856367,0.00021604027,0.00011155525,0.0055729644],"category_scores_gemma":[0.000017387203,0.00015004649,0.00006542549,0.000059993097,0.00009313988,0.0003532739,0.00005988326,0.00013930275,0.0038966413],"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.000015112513,0.00024045775,0.81284064,0.00001245177,0.000064825144,0.000008445146,0.0034463692,0.00004945806,0.00009160596,0.17588212,0.0047580535,0.0025904689],"study_design_scores_gemma":[0.0013930319,0.000033837678,0.76099366,0.000010772761,0.0000028644401,0.000014958748,0.0012425013,0.0068550394,0.00004329841,0.14865604,0.08024943,0.00050454744],"about_ca_topic_score_codex":0.0007154365,"about_ca_topic_score_gemma":0.000031237298,"teacher_disagreement_score":0.075491376,"about_ca_system_score_codex":0.0005146616,"about_ca_system_score_gemma":0.0000035196508,"threshold_uncertainty_score":0.9968789},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09182269,0.000019588317,0.9063128,0.0009305961,0.00014252526,0.00043287658,0.000033554945,0.00012830523,0.00017701926],"genre_scores_gemma":[0.8682812,0.000017055045,0.1311523,0.00016309513,0.00012787782,0.00013766186,0.000028730816,0.000029173783,0.0000629488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.0000060512784,0.00013685414,0.000119013,0.000033460223,0.0001252577],"domain_scores_gemma":[0.99958247,0.00020491557,0.000023839963,0.00013850007,0.00001603209,0.00003423757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010859142,0.00008483479,0.000090762165,0.000036262438,0.00013393386,0.00008448159,0.0001560831,0.000075127035,0.000041438685],"category_scores_gemma":[0.00002290427,0.00006199397,0.000031527154,0.000042454372,0.000009952757,0.00021444522,0.000013928116,0.000034050718,0.000004259199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065675784,0.0000068998306,0.000012334848,0.000010212695,0.000054872853,2.95738e-7,0.0041763103,0.94843185,0.0009421021,0.014414734,0.0022145864,0.029670097],"study_design_scores_gemma":[0.00057051546,0.000058913854,0.00013283403,0.00005097723,0.000033546065,0.0000016770698,0.00023645787,0.98852503,0.0003839241,0.0074969055,0.0023146456,0.00019454688],"about_ca_topic_score_codex":0.000036477897,"about_ca_topic_score_gemma":0.000043804674,"teacher_disagreement_score":0.77645844,"about_ca_system_score_codex":0.00014815269,"about_ca_system_score_gemma":0.00000637916,"threshold_uncertainty_score":0.25280407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031400798,0.0052917367,0.96415204,0.012410365,0.0023826845,0.0007013263,0.000048123904,0.0002796446,0.011593991],"genre_scores_gemma":[0.0291322,0.0024774694,0.944663,0.0009333138,0.0020399552,0.0001389898,0.000030654857,0.00022338692,0.020361042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978212,0.0003031814,0.000412729,0.00036332614,0.00024420553,0.000855353],"domain_scores_gemma":[0.9973318,0.001688848,0.00006519681,0.000560289,0.0001780099,0.00017588784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016581726,0.00031822166,0.00030850703,0.00010333161,0.00062572514,0.00019745232,0.0004435557,0.00050984416,0.0006375088],"category_scores_gemma":[0.00033429774,0.00029956756,0.00017165189,0.0006809369,0.00023667654,0.00020481083,0.000057400684,0.0008303928,0.000078804354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000399879,0.000052670544,0.0015329623,0.00019133001,0.00020144758,0.000017000848,0.0018378285,0.47095865,0.00036695055,0.42334437,0.00315132,0.09830549],"study_design_scores_gemma":[0.0009718875,0.00007773652,0.00050699676,0.00006431316,0.00013870026,0.000109938825,0.00052596215,0.7232456,0.0008713951,0.02216105,0.25089455,0.00043186688],"about_ca_topic_score_codex":0.0002893749,"about_ca_topic_score_gemma":0.000010535454,"teacher_disagreement_score":0.4011833,"about_ca_system_score_codex":0.00041780758,"about_ca_system_score_gemma":0.00011731593,"threshold_uncertainty_score":0.99994564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9520949,0.0007585398,0.012923092,0.00061133184,0.00074097834,0.0001481993,0.00011580443,0.000065155225,0.032541957],"genre_scores_gemma":[0.9954642,0.000986346,0.0017460956,0.00060700864,0.00021030614,0.000031219868,0.00004025635,0.00003998453,0.0008745565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987239,0.000020289794,0.00044965922,0.0003633149,0.000031591157,0.00041119687],"domain_scores_gemma":[0.9993525,0.00007768587,0.00021520648,0.00025899577,0.000019529954,0.00007608444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000242914,0.00019104434,0.0003431588,0.00012265453,0.00021789549,0.000109705514,0.00013164447,0.00017171768,0.00059046],"category_scores_gemma":[0.00019649198,0.0002313334,0.00015520334,0.00013334687,0.000109753695,0.00031747052,0.000019447054,0.00018952218,0.00047488025],"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.000015151633,0.000045994162,0.016184922,0.0000351001,0.00004837299,0.000004805658,0.01096711,0.0000360693,0.000031232255,0.97181916,0.0006321851,0.00017992161],"study_design_scores_gemma":[0.0025685716,0.000116966825,0.015570707,0.000030526895,0.000030680636,0.00004044045,0.0033082084,0.0018002822,0.0009933789,0.69582003,0.2785694,0.0011507759],"about_ca_topic_score_codex":0.0003370148,"about_ca_topic_score_gemma":0.00015396236,"teacher_disagreement_score":0.27793723,"about_ca_system_score_codex":0.00030918696,"about_ca_system_score_gemma":0.0000127200265,"threshold_uncertainty_score":0.9433502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581229,0.00028033525,0.0062729586,0.0010410919,0.0003323824,0.000121440054,0.000057205354,0.000043127973,0.03372854],"genre_scores_gemma":[0.9932736,0.00022675909,0.0054860334,0.0005000064,0.00018514541,0.000027042903,0.000047353984,0.000020948293,0.00023307126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992354,0.000008096315,0.00028193076,0.00026372535,0.00001461318,0.00019624154],"domain_scores_gemma":[0.9995079,0.00006373321,0.00016165116,0.00017640721,0.000011323636,0.000079003636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030566988,0.00011282331,0.00020523157,0.000121587844,0.00015484534,0.000101128986,0.00009602602,0.00015044336,0.00014357916],"category_scores_gemma":[0.00008082244,0.00013804887,0.00004891112,0.00007827418,0.00023113712,0.00016929503,0.000023226854,0.00025311508,0.000086350476],"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.000006482677,0.000020253947,0.0072536883,0.00002404662,0.000013002852,6.729714e-7,0.007133514,0.000015635898,0.000033566903,0.9843676,0.0000527964,0.0010787328],"study_design_scores_gemma":[0.0012372093,0.000061431754,0.014614949,0.000008818673,0.000013310154,0.000058587168,0.0023084965,0.077715866,0.000108254935,0.887909,0.015423677,0.00054041034],"about_ca_topic_score_codex":0.00010344164,"about_ca_topic_score_gemma":0.000025817035,"teacher_disagreement_score":0.09645862,"about_ca_system_score_codex":0.000035022236,"about_ca_system_score_gemma":0.000005689529,"threshold_uncertainty_score":0.5629469},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87388706,0.0011577161,0.00097102276,0.0008056703,0.00036571737,0.00043332635,0.000074843345,0.00005848805,0.122246146],"genre_scores_gemma":[0.993055,0.00021662367,0.0040091197,0.00036523613,0.00012478165,0.00007319834,0.0000123946775,0.000023110875,0.002120562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852306,0.000021400754,0.00071008905,0.00035282283,0.00005001635,0.00034262522],"domain_scores_gemma":[0.9990821,0.00007726878,0.00039538502,0.00030829516,0.00005896593,0.00007797741],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031629473,0.00020257126,0.00048302204,0.00015033006,0.0001515552,0.000092825714,0.00023258127,0.00016159237,0.000987033],"category_scores_gemma":[0.00017507152,0.00021557785,0.00014475758,0.0001780618,0.0005528116,0.0004954682,0.00003367331,0.00018790884,0.00013296313],"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.000010552662,0.00005362249,0.023445452,0.00008091998,0.0000410789,0.0000022670877,0.0010436896,0.00000860457,0.00021785732,0.9729795,0.0011535711,0.00096287415],"study_design_scores_gemma":[0.0011691265,0.00027597495,0.23683457,0.00007389767,0.000015649368,0.000014602607,0.0015238064,0.0006518353,0.00044085342,0.7371368,0.021105004,0.00075789436],"about_ca_topic_score_codex":0.00079962227,"about_ca_topic_score_gemma":0.000013228208,"teacher_disagreement_score":0.23584272,"about_ca_system_score_codex":0.00007883791,"about_ca_system_score_gemma":0.00003677042,"threshold_uncertainty_score":0.9999262},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8485542,0.0061247405,0.124063656,0.012543399,0.0007688777,0.00031109678,0.00002406398,0.00039356732,0.0072164135],"genre_scores_gemma":[0.92740977,0.00053558516,0.043943133,0.00032003305,0.0020762812,0.00002530216,0.000066904,0.00010227522,0.02552071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836016,0.0001123911,0.00043219718,0.00030583589,0.00017523194,0.00061417994],"domain_scores_gemma":[0.9992461,0.000074866344,0.000107293556,0.00028634272,0.00005738578,0.00022798259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003406081,0.0003292754,0.00028218425,0.0001289265,0.00026414296,0.00018684985,0.00018595404,0.00046343196,0.0003475968],"category_scores_gemma":[0.00006698846,0.0003816064,0.0001481271,0.00018211658,0.00011313196,0.0004199891,0.000028713486,0.0003692687,0.00020166766],"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.000017875309,0.00009186034,0.018510275,0.0002762734,0.00014446993,0.000073658775,0.027827483,0.9152136,0.0037905911,0.0045155585,0.020110928,0.0094274515],"study_design_scores_gemma":[0.001100207,0.000065005464,0.0067210863,0.00016773751,0.00016343093,0.00036845493,0.0006350859,0.7991163,0.018303929,0.00031034934,0.17226808,0.00078030676],"about_ca_topic_score_codex":0.008515035,"about_ca_topic_score_gemma":0.0063537816,"teacher_disagreement_score":0.15215716,"about_ca_system_score_codex":0.0019060227,"about_ca_system_score_gemma":0.00015227002,"threshold_uncertainty_score":0.99986356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40015218,0.002374178,0.5845366,0.0070196236,0.0014483001,0.0006747246,0.00009367876,0.00033289273,0.00336778],"genre_scores_gemma":[0.26913244,0.000033396933,0.72086626,0.0016333839,0.002298068,0.00008489422,0.00005784059,0.00009703751,0.005796705],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973283,0.00026210884,0.0007268754,0.00065320753,0.00039495903,0.0006345843],"domain_scores_gemma":[0.99701476,0.0017764053,0.00034348096,0.00046598975,0.00022185166,0.00017750995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045131895,0.00036597406,0.0004946909,0.0001431463,0.00033227817,0.00028487697,0.00058278634,0.00031916742,0.0001049018],"category_scores_gemma":[0.0004512051,0.0003849378,0.0003007587,0.0010558905,0.00056816876,0.0011874773,0.00013945602,0.000381482,0.000059625803],"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.0006306807,0.0016724148,0.13446008,0.0011792295,0.00020995256,0.00042149753,0.0038681002,0.0047304886,0.03585068,0.3212012,0.3250365,0.17073919],"study_design_scores_gemma":[0.016382327,0.001022089,0.017181996,0.00069291703,0.00035098122,0.00065516355,0.00014602754,0.41091222,0.1264473,0.18387473,0.23995821,0.0023760293],"about_ca_topic_score_codex":0.00030476725,"about_ca_topic_score_gemma":0.000009505398,"teacher_disagreement_score":0.40618172,"about_ca_system_score_codex":0.00014836428,"about_ca_system_score_gemma":0.00038699203,"threshold_uncertainty_score":0.9998602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843457,0.0002590801,0.00035691907,0.012463981,0.000045747776,0.00008792863,0.00006400819,0.000049777274,0.002326899],"genre_scores_gemma":[0.9990911,0.00032961866,0.00013194185,0.00017009699,0.00002989419,0.000045495475,0.000041860738,0.000007656307,0.00015233806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862564,0.00022703594,0.00016164634,0.00027005182,0.00018482926,0.0005307734],"domain_scores_gemma":[0.99877435,0.00014059737,0.000071179566,0.00061465224,0.000109326014,0.00028987587],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008292739,0.00012091741,0.0002406099,0.00027291963,0.0035498491,0.0002079419,0.00042950315,0.00026827547,0.00001139465],"category_scores_gemma":[0.00096853066,0.000091888716,0.00007640122,0.00035528696,0.0008015145,0.000092756694,0.000076947515,0.0002330882,8.0746065e-7],"study_design_candidate":"theoretical_or_conceptual","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.00003531786,0.000019395204,0.0033091279,0.000004079023,0.000150915,0.000018811827,0.00026189836,0.001095679,0.00027659247,0.9524021,0.00000876234,0.042417295],"study_design_scores_gemma":[0.0014358968,0.0008430077,0.3184883,0.00003793101,0.0009894728,0.000041959225,0.011088684,0.026894843,0.003999913,0.069354154,0.56566226,0.0011635465],"about_ca_topic_score_codex":0.23976469,"about_ca_topic_score_gemma":0.8770282,"teacher_disagreement_score":0.883048,"about_ca_system_score_codex":0.00039904303,"about_ca_system_score_gemma":0.00005871522,"threshold_uncertainty_score":0.9977474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8155488,0.000114694056,0.17492695,0.0056278226,0.00011786556,0.0018223659,0.000007449858,0.00010031723,0.0017337569],"genre_scores_gemma":[0.90987056,0.000020176107,0.08891862,0.00038869132,0.000059226644,0.000061942585,0.000009232212,0.000014590653,0.00065694994],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931586,0.000013738024,0.00016615854,0.00017148237,0.00014717282,0.00018559038],"domain_scores_gemma":[0.9995632,0.000058097296,0.000044417207,0.00021253036,0.000059833837,0.00006191243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026280855,0.00008836106,0.00016820637,0.000041574687,0.000086264394,0.0000149204325,0.00008307971,0.00006037387,0.000024293658],"category_scores_gemma":[0.000057617974,0.000060307702,0.00008628647,0.0000754999,0.0000832234,0.00004965151,0.00003606566,0.0001272161,0.0000060703205],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068595546,0.00022754318,0.01652166,0.0006071708,0.00009766251,0.0000016344197,0.0016804468,0.00008008307,0.95697445,0.0071043517,0.0026070145,0.01341204],"study_design_scores_gemma":[0.005652444,0.0063081617,0.03522945,0.0010978427,0.0005128783,0.00009283813,0.0020232769,0.12812456,0.78501135,0.002932705,0.032196056,0.0008184224],"about_ca_topic_score_codex":0.0000896796,"about_ca_topic_score_gemma":0.000005501701,"teacher_disagreement_score":0.17196307,"about_ca_system_score_codex":0.00013498709,"about_ca_system_score_gemma":0.000018885794,"threshold_uncertainty_score":0.24592768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9663237,0.0003110102,0.009192917,0.004618985,0.00021665164,0.0006601102,0.00000580295,0.00014075526,0.018530121],"genre_scores_gemma":[0.99035597,0.000050393635,0.005901287,0.0010356329,0.00008789762,0.000045624773,0.0000043689033,0.000025531397,0.0024932798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987665,0.00020808679,0.0003223936,0.00026138965,0.00017726285,0.00026439223],"domain_scores_gemma":[0.9943784,0.0048967698,0.00013089881,0.00048672696,0.00003957593,0.00006766612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075219973,0.0001848061,0.00035347327,0.0000674423,0.00014384101,0.000055804103,0.00026511808,0.00017508722,0.00037564416],"category_scores_gemma":[0.0015729225,0.00011511883,0.0001189936,0.00014071133,0.00043347225,0.00008360437,0.000088690096,0.00031781997,0.00011121884],"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.00005038804,0.000029186795,0.0008112897,0.00010291424,0.00005585924,0.0000029477924,0.0025767528,9.2753055e-8,0.00046926277,0.99279475,0.0023334369,0.0007731258],"study_design_scores_gemma":[0.0011507928,0.00006887534,0.00015346234,0.00003609043,0.000055473658,0.00002249304,0.00047106837,0.00072376087,0.00087261613,0.9955137,0.0007552453,0.00017644386],"about_ca_topic_score_codex":0.000021062553,"about_ca_topic_score_gemma":0.00001601142,"teacher_disagreement_score":0.024032338,"about_ca_system_score_codex":0.000022657501,"about_ca_system_score_gemma":0.000016160617,"threshold_uncertainty_score":0.469441},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1787528,0.000032640626,0.81861967,0.00086456555,0.00023308472,0.00014262195,0.0000067702836,0.0001025446,0.0012452805],"genre_scores_gemma":[0.8121702,0.0000029752675,0.18709217,0.00054853474,0.00012219297,0.000007252628,0.0000034418854,0.0000085781485,0.000044670527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893564,0.00008198124,0.00020999768,0.00027565565,0.00027608327,0.00022065698],"domain_scores_gemma":[0.9987828,0.00025343295,0.0002017861,0.00053684466,0.00017260807,0.000052502626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019522,0.00013118016,0.00013876302,0.00009674082,0.0003774553,0.000067429544,0.0006253893,0.00007838758,0.00002171945],"category_scores_gemma":[0.000093018876,0.00009019976,0.0000644742,0.00046421977,0.0014140435,0.00017179537,0.00006954426,0.00023375617,0.000012409111],"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.000106091975,0.00017480929,0.0042718532,0.000091445494,0.000099590136,0.000040893174,0.0070668245,0.00024454374,0.0038938748,0.6290427,0.0005410861,0.35442632],"study_design_scores_gemma":[0.004660724,0.0025537827,0.012885005,0.00033189077,0.00011052206,0.0002545748,0.001169985,0.7379526,0.099234916,0.12918383,0.010127436,0.0015347382],"about_ca_topic_score_codex":0.00008796185,"about_ca_topic_score_gemma":0.000034924844,"teacher_disagreement_score":0.73770803,"about_ca_system_score_codex":0.00003354553,"about_ca_system_score_gemma":0.00010897862,"threshold_uncertainty_score":0.5210102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462194,0.00014819505,0.00078235904,0.022645716,0.00031117428,0.00080710754,0.000014340469,0.00006243212,0.029009273],"genre_scores_gemma":[0.98562443,0.00009058945,0.0013238898,0.0014876316,0.00062845874,0.00011752478,0.000004483695,0.000010971508,0.010712044],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883914,0.000065543965,0.00017249337,0.0002354815,0.000358654,0.00032867715],"domain_scores_gemma":[0.99948937,0.00019416442,0.00009261955,0.00006295909,0.000055214638,0.00010568961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976806,0.00008520418,0.0001007136,0.000014166551,0.00091898633,0.00034842818,0.00044418935,0.00006197258,0.0000063557163],"category_scores_gemma":[0.0007945097,0.000063315405,0.000047384983,0.00030271805,0.000435947,0.00042105754,0.000027589187,0.000098113625,0.000011512841],"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.00006326814,0.000039384642,0.005507486,0.0000050465696,0.000017938712,0.000008974572,0.5330584,0.000007568573,0.000023458568,0.27035278,0.014200081,0.1767156],"study_design_scores_gemma":[0.00020751226,0.000058723752,0.0022181333,0.000005477157,0.0000016288366,1.5712045e-7,0.05013719,0.00006111328,0.000054281394,0.0049005514,0.94222695,0.00012831244],"about_ca_topic_score_codex":0.15928754,"about_ca_topic_score_gemma":0.38253435,"teacher_disagreement_score":0.92802685,"about_ca_system_score_codex":0.0003145702,"about_ca_system_score_gemma":0.0007578914,"threshold_uncertainty_score":0.84631085},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959123,0.00008005695,0.0015893332,0.0017161653,0.00000986442,0.00017400867,0.00003997714,0.00001940674,0.00045889008],"genre_scores_gemma":[0.9987598,0.00006169167,0.0008661919,0.00024510265,0.000008699488,0.000026380829,0.0000021229807,0.000006554239,0.000023469287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994659,0.000060077673,0.00017685113,0.000107259395,0.000109405766,0.000080521604],"domain_scores_gemma":[0.99914515,0.00053593004,0.00009593063,0.00015512816,0.000032275806,0.000035568704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010371432,0.00008310277,0.00015505936,0.000035899004,0.0001033123,0.000005678504,0.00014939913,0.00003109841,0.000032744843],"category_scores_gemma":[0.00009578382,0.0000556108,0.00006203576,0.00017388805,0.00021576889,0.00001272025,0.000027360422,0.0000912795,7.7560094e-7],"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.000016713273,0.000045312005,0.00015617949,0.000070863956,0.00003461252,2.7123258e-7,0.0029019052,0.0000035949065,0.01140774,0.9849279,0.0002661605,0.00016874688],"study_design_scores_gemma":[0.00017356733,0.00007860868,0.0011891512,0.00002188711,0.000030335177,7.096919e-7,0.0007739218,0.000066553424,0.034094177,0.96340877,0.00009872672,0.00006362198],"about_ca_topic_score_codex":0.0000054253787,"about_ca_topic_score_gemma":0.0000042893594,"teacher_disagreement_score":0.022686437,"about_ca_system_score_codex":0.0000026341615,"about_ca_system_score_gemma":0.0000046921605,"threshold_uncertainty_score":0.22677425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061303638,0.00007916002,0.93720424,0.00040378678,0.00009201125,0.0005802868,0.000015252258,0.0001889962,0.00013260625],"genre_scores_gemma":[0.42068848,0.0000043428076,0.5789525,0.00014319528,0.000117635835,0.000041781594,0.0000072782095,0.000033542485,0.00001121272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.000060817503,0.0002509298,0.00014069279,0.00016119119,0.0001423879],"domain_scores_gemma":[0.9993457,0.00039108747,0.0000529247,0.00010116506,0.000061766434,0.000047348476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025137712,0.00011303487,0.00016481045,0.000035334608,0.00015688107,0.000030811778,0.00016454366,0.00005263474,0.000009714307],"category_scores_gemma":[0.000057779478,0.00009675556,0.00005526419,0.00021814815,0.000039681905,0.00006141475,0.000019610141,0.00017951829,0.0000017261282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000604248,0.000027562568,0.00026018766,0.000046082703,0.000093249306,0.000001109115,0.009175225,0.90899754,0.000055461664,0.0004441707,0.00022559559,0.0806678],"study_design_scores_gemma":[0.0008054757,0.00008435357,0.0004177965,0.0000060022926,0.000032932625,0.0000026296082,0.0011479327,0.9958019,0.0000997962,0.0009232142,0.0005709587,0.00010695308],"about_ca_topic_score_codex":0.000009396252,"about_ca_topic_score_gemma":0.0000017399999,"teacher_disagreement_score":0.35938486,"about_ca_system_score_codex":0.000031822296,"about_ca_system_score_gemma":0.000012566916,"threshold_uncertainty_score":0.39455774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65307087,0.0017474325,0.12953493,0.088034034,0.0004988386,0.0019065385,0.0012053871,0.00010073175,0.12390127],"genre_scores_gemma":[0.9957619,0.0012736799,0.0020003049,0.00027733974,0.00025240073,0.000067366265,0.0000046958066,0.000025432673,0.0003369345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867177,0.000032326247,0.0004530642,0.0002865887,0.00004172529,0.0005145249],"domain_scores_gemma":[0.99843997,0.00027147066,0.00036663524,0.00068397506,0.00009609833,0.00014184546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040932,0.00013823528,0.00036326592,0.00016706034,0.001074046,0.00025509897,0.00056478847,0.0001401244,0.00004309882],"category_scores_gemma":[0.0014364632,0.00012852362,0.00013340985,0.00008514893,0.0004076915,0.00025339605,0.00016433757,0.00019736284,0.0002520092],"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.0000923878,0.00003380544,0.0004318662,0.000011097928,0.00004315183,0.0000014835324,0.0040098466,0.00010002066,0.00001739362,0.9946647,0.0003236633,0.00027053012],"study_design_scores_gemma":[0.00044621754,0.000077147204,0.0015941656,0.000015350777,0.0000047823046,0.0000046811583,0.001049292,0.010658985,0.00021691126,0.98378974,0.001976096,0.00016664325],"about_ca_topic_score_codex":0.0013881914,"about_ca_topic_score_gemma":0.00015392022,"teacher_disagreement_score":0.342691,"about_ca_system_score_codex":0.00052838365,"about_ca_system_score_gemma":0.000034609246,"threshold_uncertainty_score":0.8260802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108877,0.00016397359,0.08328371,0.0004846143,0.0005209342,0.0012404211,0.0009792426,0.000060719343,0.0023786423],"genre_scores_gemma":[0.9955021,0.00042352627,0.0014739832,0.000564359,0.00024465713,0.0010292829,0.00014414648,0.00005355527,0.00056437345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998456,0.000013376164,0.00047316146,0.0004437439,0.000022273794,0.0005914213],"domain_scores_gemma":[0.9991911,0.00010960338,0.00024374494,0.0002914457,0.000031378422,0.00013270348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024693282,0.00022735093,0.00045873795,0.0001725935,0.00022047068,0.00015212035,0.00023168142,0.00019242054,0.00046029894],"category_scores_gemma":[0.000055323744,0.0002674518,0.00021215844,0.00007064119,0.00009727238,0.00030297632,0.00006730578,0.00014303382,0.0007441472],"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.00022040457,0.00038146396,0.041222498,0.0006144018,0.00029137958,0.0000021167973,0.0061416957,0.001480744,0.00033783284,0.940234,0.0028403688,0.006233065],"study_design_scores_gemma":[0.0036635152,0.000117721385,0.027373955,0.000029663615,0.000027591506,0.000005250779,0.00022394572,0.6401158,0.00025490357,0.31907722,0.008230471,0.00087996013],"about_ca_topic_score_codex":0.00024881787,"about_ca_topic_score_gemma":0.000031998352,"teacher_disagreement_score":0.63863504,"about_ca_system_score_codex":0.00027328962,"about_ca_system_score_gemma":0.000007544408,"threshold_uncertainty_score":0.99997777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044024285,0.07984239,0.80113477,0.03029859,0.0022509382,0.00041769128,0.00024209863,0.00007489375,0.04171435],"genre_scores_gemma":[0.94456834,0.0029858735,0.01329636,0.002530271,0.0058183065,0.00021558118,0.000067391775,0.00009302477,0.03042484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983486,0.000008458799,0.0006105969,0.0004632579,0.00005958669,0.0005094769],"domain_scores_gemma":[0.99887204,0.00020945341,0.0003811108,0.00043658158,0.0000416187,0.000059185946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032190434,0.00024358186,0.00034910857,0.00011903262,0.0010282281,0.00017807762,0.00042700753,0.00031334112,0.0001818248],"category_scores_gemma":[0.0001208381,0.00024791536,0.00016286923,0.00057604304,0.0004752612,0.00014772206,0.000055703782,0.00046110334,0.00042622906],"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.0000064257106,0.000087583656,0.0012583781,0.000044109183,0.00002627058,0.000004520189,0.00081761536,0.00013032975,0.000010395854,0.96602464,0.006834419,0.02475534],"study_design_scores_gemma":[0.0002043921,0.00003184387,0.015761623,0.0000151522545,0.0000206261,0.000016759454,0.00021897054,0.0010099814,0.000021633203,0.48799625,0.49445778,0.0002449867],"about_ca_topic_score_codex":0.0026211108,"about_ca_topic_score_gemma":0.00026607356,"teacher_disagreement_score":0.90054405,"about_ca_system_score_codex":0.00021614898,"about_ca_system_score_gemma":0.000038913815,"threshold_uncertainty_score":0.9999973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07227198,0.0004963046,0.72323877,0.04762775,0.007855587,0.0050950935,0.000048610582,0.0010682896,0.14229763],"genre_scores_gemma":[0.8819622,0.000166674,0.027288215,0.03711684,0.007997038,0.0009745333,0.0002599848,0.00014896221,0.044085566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895066,0.0000082035685,0.00022459165,0.00028386514,0.0002005585,0.0003321116],"domain_scores_gemma":[0.99939764,0.000029806146,0.000054638058,0.00031142772,0.00019237885,0.0000141190885],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000393851,0.00016207191,0.00012503185,0.00009892102,0.00070192356,0.00023233611,0.0003300424,0.000062490566,0.00074286613],"category_scores_gemma":[0.000049145867,0.00011793594,0.000106053834,0.00029891264,0.00019362415,0.000450902,0.00008648962,0.000096883385,0.0008134574],"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.000056898934,0.00023217268,0.0017029931,0.00022012317,0.00017020319,0.0000019365573,0.00045328378,0.00004572676,0.000052793235,0.14031889,0.38808176,0.46866325],"study_design_scores_gemma":[0.0006302926,0.000016390322,0.0013784161,0.000012164151,0.000046129033,5.8032566e-7,0.0003024857,0.07989359,0.000021783559,0.0044106347,0.9131086,0.0001789515],"about_ca_topic_score_codex":0.0006901787,"about_ca_topic_score_gemma":0.000274037,"teacher_disagreement_score":0.80969024,"about_ca_system_score_codex":0.00004867264,"about_ca_system_score_gemma":0.000009930812,"threshold_uncertainty_score":0.99996454},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19182485,0.0027592003,0.795327,0.0023652846,0.00033477764,0.00029788943,0.000027662169,0.000114287766,0.0069490056],"genre_scores_gemma":[0.98410493,0.000040302875,0.014221225,0.00065538177,0.0004199715,0.00018510401,0.000010599581,0.00005029538,0.0003121623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986471,0.000006933589,0.00042747418,0.00033434486,0.00006231525,0.00052184233],"domain_scores_gemma":[0.99905574,0.00012923079,0.00031658987,0.00035038858,0.00003389142,0.00011417714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006120754,0.00019468238,0.0002897243,0.00011262254,0.00078327145,0.00013759563,0.00040443274,0.00014361892,0.000036305537],"category_scores_gemma":[0.00018817255,0.00017987925,0.00012272752,0.00030251767,0.00009338966,0.00038851425,0.000055328466,0.00036694814,0.00015520441],"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.0000118969965,0.000055831482,0.0071099177,0.00003830266,0.00004189979,0.0000011543809,0.0063759894,0.000048949372,0.0000215021,0.98099333,0.0004169424,0.004884294],"study_design_scores_gemma":[0.0009698837,0.000065429354,0.021942826,0.000059391077,0.000060044524,0.00007105338,0.0036465246,0.0082958955,0.000062084066,0.8819591,0.08180773,0.0010600368],"about_ca_topic_score_codex":0.00016415726,"about_ca_topic_score_gemma":0.000010581789,"teacher_disagreement_score":0.7922801,"about_ca_system_score_codex":0.00012903372,"about_ca_system_score_gemma":0.000029677894,"threshold_uncertainty_score":0.7335263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94270486,0.001537763,0.000006918708,0.017423073,0.0045860284,0.00025074912,0.00013634359,0.000047327514,0.033306945],"genre_scores_gemma":[0.9790124,0.00084907335,0.0012827449,0.001285205,0.0008102396,0.00007258698,0.000034360135,0.000028642986,0.016624738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834394,0.00014453313,0.00033400673,0.00040539273,0.00022143406,0.00055069977],"domain_scores_gemma":[0.99933857,0.0001403769,0.00010476642,0.000182813,0.000055640627,0.00017782225],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033213303,0.0002365792,0.0003099188,0.00009657979,0.0006794006,0.00006522581,0.00031440667,0.00043134784,0.0024232469],"category_scores_gemma":[0.000055295557,0.00027804033,0.00013610804,0.0002867877,0.0026753652,0.00040125538,0.00008035897,0.00068838685,0.00035152372],"study_design_candidate":"theoretical_or_conceptual","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.000026387186,0.00031637034,0.08643898,0.000021384878,0.0000372824,0.00009211178,0.056249116,0.0000026637447,0.0014559715,0.8382245,0.010712263,0.0064230184],"study_design_scores_gemma":[0.0019336382,0.00014647967,0.047989815,0.000090889174,0.00007742345,0.000040916922,0.031951725,0.000093458766,0.0021582295,0.06450493,0.8497175,0.0012949714],"about_ca_topic_score_codex":0.009413,"about_ca_topic_score_gemma":0.025000243,"teacher_disagreement_score":0.83900523,"about_ca_system_score_codex":0.0006175561,"about_ca_system_score_gemma":0.000113736816,"threshold_uncertainty_score":0.99996716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911911,0.0008305716,0.00048731043,0.0020510082,0.0001401028,0.00023605024,0.00040927264,0.000059876158,0.004594694],"genre_scores_gemma":[0.99584734,0.002128569,0.0003828451,0.001226382,0.000121851284,0.00002020743,0.000060311886,0.000053085965,0.00015942301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979798,0.000030303325,0.0009065824,0.0005211151,0.00003672733,0.0005254756],"domain_scores_gemma":[0.99888057,0.000039173563,0.00045508592,0.00034560717,0.00001586586,0.00026367843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034187178,0.00024241566,0.0006035091,0.0002204827,0.000077722456,0.00007111447,0.00031239263,0.00018361009,0.00015331534],"category_scores_gemma":[0.00004606608,0.0002951443,0.00012466054,0.00024404997,0.00012218412,0.0003113286,0.000062349936,0.0002769425,0.00013814437],"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.0011090972,0.0008914212,0.306552,0.0010225255,0.00022550969,0.00014833639,0.06583451,0.0061693485,0.0038062658,0.5990381,0.003994188,0.011208641],"study_design_scores_gemma":[0.017759858,0.0043247784,0.15149593,0.00043804885,0.00010215261,0.000076118326,0.010180895,0.17897943,0.016278848,0.5187779,0.09540337,0.0061826543],"about_ca_topic_score_codex":0.00075894385,"about_ca_topic_score_gemma":0.0001073324,"teacher_disagreement_score":0.17281008,"about_ca_system_score_codex":0.00018621507,"about_ca_system_score_gemma":0.000021560321,"threshold_uncertainty_score":0.99995005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03987698,0.02938501,0.49932253,0.4078965,0.006551162,0.0010569354,0.000110537956,0.00013084195,0.015669527],"genre_scores_gemma":[0.96878284,0.0017311352,0.0075032217,0.0089523,0.0012453932,0.000015728188,0.00000387107,0.000040105242,0.011725396],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971515,0.00006673269,0.00065686496,0.0006803428,0.00074088015,0.0007036781],"domain_scores_gemma":[0.99812686,0.0002921353,0.0003390033,0.00038129996,0.00033808005,0.00052258983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029370424,0.0003664437,0.00046538268,0.00002955873,0.00042951433,0.00020668222,0.0018394921,0.00030254596,0.00012539123],"category_scores_gemma":[0.00008605787,0.00031232194,0.00019133162,0.0012164714,0.0007882481,0.00030969328,0.00054896914,0.0010809414,0.00002028009],"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.00006163987,0.00007319243,0.0014813876,0.00026365323,0.00009527044,0.00018860452,0.0071282615,0.00025328263,0.000060791805,0.18993999,0.5594407,0.24101324],"study_design_scores_gemma":[0.0002994178,0.00014586338,0.0008636665,0.00034151154,0.00010537143,0.00014689167,0.0022868097,0.5854776,0.00043730348,0.0055331234,0.40366927,0.0006931747],"about_ca_topic_score_codex":0.06794611,"about_ca_topic_score_gemma":0.025807593,"teacher_disagreement_score":0.92890584,"about_ca_system_score_codex":0.00022933008,"about_ca_system_score_gemma":0.001049106,"threshold_uncertainty_score":0.9999329},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46595058,0.0017104307,0.5044138,0.0024626418,0.00017224136,0.00024540463,0.000017636876,0.000041530224,0.024985734],"genre_scores_gemma":[0.9847928,0.0002540439,0.013982821,0.00063376385,0.00018514937,0.000035606696,0.000004751447,0.0000125054685,0.000098530116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992482,0.000005060504,0.00029687514,0.00025680626,0.000023038627,0.00016999089],"domain_scores_gemma":[0.99941486,0.00015042497,0.0002071261,0.00014903325,0.000035683828,0.0000428921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034665165,0.00008567323,0.00017339837,0.00013417298,0.00017849341,0.000050630017,0.00009532085,0.00009802975,0.000012006726],"category_scores_gemma":[0.00045151848,0.00010184997,0.000020448371,0.0003308008,0.00012975057,0.00022186077,0.000029591649,0.00015078149,0.00010713452],"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.00001351132,0.00004132735,0.004502017,0.000011287811,0.000005374131,0.0000015352947,0.002146998,0.0000023524037,0.000016965314,0.9872811,0.00003779613,0.005939729],"study_design_scores_gemma":[0.0007078298,0.0001560132,0.1083774,0.000026285503,0.000009325857,0.000035957324,0.0006710598,0.0030236,0.000073197814,0.7645536,0.122001626,0.0003641286],"about_ca_topic_score_codex":0.0006191454,"about_ca_topic_score_gemma":0.0000712472,"teacher_disagreement_score":0.5188422,"about_ca_system_score_codex":0.00008020678,"about_ca_system_score_gemma":0.000010790994,"threshold_uncertainty_score":0.41533214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2020818,0.0040497747,0.7796345,0.0057935314,0.0012918764,0.0005647769,0.0011130163,0.000025134657,0.0054456014],"genre_scores_gemma":[0.9928541,0.000045763674,0.004706337,0.0008712462,0.00080973783,0.00007853464,0.000042054937,0.00002551418,0.0005667081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981545,0.000008544452,0.0008150765,0.0004942466,0.000119306525,0.0004082794],"domain_scores_gemma":[0.9982811,0.00019042882,0.00053773815,0.0007731506,0.00009351281,0.0001240313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086745847,0.00022219575,0.000540595,0.00033310364,0.00075072143,0.00008167496,0.00073501864,0.00027893175,0.00004893202],"category_scores_gemma":[0.00007305789,0.00018727622,0.00033601237,0.0021907347,0.00033806142,0.000074609874,0.00006410802,0.00031186378,0.00006833215],"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.000033556873,0.00010928031,0.0023971086,0.000053951684,0.00030257515,9.1224473e-7,0.002648348,0.0019221205,0.000043918953,0.98540395,0.0005941298,0.0064901495],"study_design_scores_gemma":[0.0007821469,0.000144788,0.7490505,0.00006168741,0.0012067225,0.000017492988,0.009511102,0.009361344,0.0005057525,0.07198885,0.15645444,0.0009151771],"about_ca_topic_score_codex":0.0007444131,"about_ca_topic_score_gemma":0.0012249877,"teacher_disagreement_score":0.9134151,"about_ca_system_score_codex":0.0003048701,"about_ca_system_score_gemma":0.00004769529,"threshold_uncertainty_score":0.76369023},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17751066,0.00030616988,0.8123922,0.0011928204,0.000058801514,0.00051204464,0.00005332173,0.000079076715,0.007894924],"genre_scores_gemma":[0.9687444,0.00012149941,0.029453719,0.00073439494,0.00012442861,0.0005150388,0.000030474537,0.000030012312,0.0002460199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988219,0.0000030567528,0.00036613902,0.00046970282,0.000061548024,0.00027764592],"domain_scores_gemma":[0.99923205,0.00002059556,0.00016884474,0.0003790991,0.000035088055,0.00016430982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012773415,0.00016303967,0.0002250684,0.00018124426,0.00036918532,0.00006952206,0.00023189282,0.000091416725,0.00008136203],"category_scores_gemma":[0.000026637277,0.00017545071,0.00004219914,0.00046721468,0.000066419634,0.00019451944,0.00002933127,0.00014133342,0.00039658806],"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.0000140966,0.00023446417,0.00065031636,0.000014471724,0.00002001243,0.0000014471609,0.0019684213,0.00044163695,0.000070504575,0.97656614,0.000077341145,0.01994117],"study_design_scores_gemma":[0.003001332,0.0014367215,0.041289758,0.00007255348,0.00005771741,0.000054452248,0.0015214331,0.040293552,0.00039908284,0.42558226,0.48402786,0.0022632715],"about_ca_topic_score_codex":0.00020855964,"about_ca_topic_score_gemma":0.0000711308,"teacher_disagreement_score":0.7912338,"about_ca_system_score_codex":0.00022966997,"about_ca_system_score_gemma":0.000010062412,"threshold_uncertainty_score":0.7154673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63921726,0.0022154283,0.34790325,0.0026118027,0.000059229093,0.00019770768,0.000045465895,0.000073461415,0.0076763653],"genre_scores_gemma":[0.990478,0.000074815674,0.008563332,0.0003881657,0.00008510951,0.000017383634,0.0000073124083,0.000012326679,0.00037354894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.0000015920796,0.0002589985,0.00025464967,0.0000162408,0.00019804183],"domain_scores_gemma":[0.9996984,0.00002683967,0.00009378273,0.00012067756,0.000009538317,0.0000507667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012538512,0.00009558892,0.00023106087,0.00010739118,0.0001076294,0.000045953933,0.00009847519,0.000082679224,0.000013485044],"category_scores_gemma":[0.000057305584,0.00011246228,0.00003352816,0.00015855502,0.00007153107,0.00009746801,0.000014493382,0.00013118783,0.000056998353],"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.000008615309,0.000022553058,0.0017893554,0.000004271842,0.0000036421538,0.0000042942197,0.00046954863,0.000020644367,0.000036050027,0.99170166,0.000059347294,0.0058799936],"study_design_scores_gemma":[0.0011806819,0.00016371247,0.12289745,0.00002626098,0.000007512861,0.000028121505,0.00015932541,0.008718305,0.000049493086,0.8475549,0.018637266,0.000576933],"about_ca_topic_score_codex":0.00007312731,"about_ca_topic_score_gemma":0.0000031374377,"teacher_disagreement_score":0.35126072,"about_ca_system_score_codex":0.000044517325,"about_ca_system_score_gemma":0.000005571615,"threshold_uncertainty_score":0.45860785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5152534,0.0003327917,0.47952873,0.001276649,0.00017007896,0.00013214453,0.000090950234,0.000063632775,0.0031515895],"genre_scores_gemma":[0.93007404,0.000034939345,0.06920471,0.00013618171,0.000154002,0.000029930236,0.000077878176,0.00003397978,0.0002543347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886566,0.000008477766,0.00039213552,0.00036427815,0.000057867688,0.00031155758],"domain_scores_gemma":[0.99934727,0.000042606633,0.00022411952,0.00024086551,0.000043529653,0.00010163107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023800947,0.00017951032,0.00028549472,0.00012682233,0.00041513314,0.000114810304,0.00011363418,0.00016232219,0.000033048826],"category_scores_gemma":[0.00010872945,0.00019617872,0.00007127605,0.00020429872,0.00014567272,0.00027817654,0.000015018465,0.00021743629,0.00007762033],"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.000028978555,0.000110182234,0.02235454,0.0000209398,0.000039637147,0.000008880722,0.0024030793,0.03429358,0.00008090443,0.9359917,0.0012186208,0.0034489804],"study_design_scores_gemma":[0.0014875182,0.00011341197,0.008845083,0.000026468437,0.00001704985,0.000018916058,0.00012655754,0.076624766,0.00028158646,0.9087503,0.0031285882,0.00057976384],"about_ca_topic_score_codex":0.00096333784,"about_ca_topic_score_gemma":0.0004590204,"teacher_disagreement_score":0.4148206,"about_ca_system_score_codex":0.00019373295,"about_ca_system_score_gemma":0.000058081605,"threshold_uncertainty_score":0.7999936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17668094,0.01919789,0.78309846,0.011728026,0.0051077106,0.0006042753,0.0004301088,0.000041041047,0.0031115664],"genre_scores_gemma":[0.40720755,0.006000949,0.5532172,0.0008799326,0.002907051,0.00024732703,0.0000869825,0.00010174068,0.029351296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759763,0.000050371047,0.0008280491,0.000928921,0.000037358135,0.0005576794],"domain_scores_gemma":[0.9968077,0.00023925716,0.0009588916,0.0017627442,0.000120158606,0.000111281915],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024884492,0.00027353223,0.0006339386,0.00015629729,0.001985459,0.00037577222,0.0006942809,0.0007316004,0.000079067046],"category_scores_gemma":[0.005958391,0.00038650277,0.00037131464,0.0000902278,0.0004971353,0.0005934208,0.000097929085,0.0004481706,0.00007778509],"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.000049288446,0.00005957088,0.020421224,0.00009852907,0.000023767596,9.504471e-7,0.0009776031,0.00002478464,0.000022075463,0.58856463,0.0022908526,0.3874667],"study_design_scores_gemma":[0.00059891184,0.000083360916,0.045234993,0.000042568437,0.000024725805,0.0000026847508,0.000023040968,0.029989935,0.00025822155,0.36906454,0.5543158,0.00036122103],"about_ca_topic_score_codex":0.0011770607,"about_ca_topic_score_gemma":0.00013567855,"teacher_disagreement_score":0.55202496,"about_ca_system_score_codex":0.00030755653,"about_ca_system_score_gemma":0.000085566244,"threshold_uncertainty_score":0.9998587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86706185,0.02489884,0.0020504382,0.09744185,0.0024395809,0.0035842867,0.00019700933,0.000544532,0.0017815947],"genre_scores_gemma":[0.9376042,0.0076065613,0.013613235,0.0027130935,0.011562233,0.00027520262,0.0001430722,0.0007521121,0.025730304],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937399,0.00048544453,0.0015622991,0.0009867981,0.00065359316,0.002571948],"domain_scores_gemma":[0.9963085,0.0009167905,0.00090534275,0.00045652298,0.00038827644,0.0010245888],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.001729102,0.0010441251,0.0012906214,0.0003403993,0.00071096036,0.00034405533,0.0012542437,0.0037266358,0.0004550227],"category_scores_gemma":[0.0036614945,0.0010706957,0.0004719477,0.0016817173,0.0009612601,0.0009228555,0.0005177366,0.005041539,0.00018464332],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006004619,0.00023131038,0.019325376,0.0004378799,0.00060108874,0.00015891534,0.011474441,0.13400877,0.0024484498,0.009278167,0.8167266,0.0047085127],"study_design_scores_gemma":[0.024635967,0.002351883,0.014694294,0.0029702245,0.0031557234,0.0015659069,0.05355744,0.19567105,0.015578207,0.01786058,0.661703,0.00625573],"about_ca_topic_score_codex":0.017871358,"about_ca_topic_score_gemma":0.00034341635,"teacher_disagreement_score":0.15502363,"about_ca_system_score_codex":0.006827013,"about_ca_system_score_gemma":0.002268563,"threshold_uncertainty_score":0.99917436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99110174,0.00081555493,0.00042995534,0.0011992037,0.00020453217,0.00012574763,0.00023709849,0.000009568532,0.0058765854],"genre_scores_gemma":[0.9981157,0.0015225159,0.00009129285,0.000037738006,0.000049518992,0.000012105567,0.00001767356,0.0000141238315,0.00013933372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999141,0.000012184447,0.00040939447,0.00017999855,0.000016540256,0.00024089728],"domain_scores_gemma":[0.9991403,0.000040849387,0.0004152976,0.00035339946,0.000010637336,0.000039520404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039169277,0.00010967139,0.00023581332,0.00012593532,0.00035157386,0.0001580205,0.00026221233,0.000115517345,0.000048463793],"category_scores_gemma":[0.00004346044,0.000103796025,0.00015320964,0.000052567826,0.00026559285,0.000249595,0.000014506894,0.00015621043,0.000037840022],"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.00017976204,0.00009070028,0.03530158,0.000047959744,0.0001033333,0.000005163646,0.008683368,0.0015978697,0.0001254684,0.94789183,0.000045837154,0.005927134],"study_design_scores_gemma":[0.0011638239,0.00013060182,0.48936585,0.000018912871,0.000006596491,0.0000074039003,0.001343808,0.055091448,0.000015572508,0.45182407,0.00076214527,0.00026976963],"about_ca_topic_score_codex":0.0041913777,"about_ca_topic_score_gemma":0.0033715689,"teacher_disagreement_score":0.49606776,"about_ca_system_score_codex":0.00034241998,"about_ca_system_score_gemma":0.000031578154,"threshold_uncertainty_score":0.6336137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99211895,0.0023506994,0.0012289392,0.0005948721,0.0003674384,0.00026598072,0.00007378054,0.00004421722,0.0029551475],"genre_scores_gemma":[0.98036313,0.0048345975,0.014020957,0.00045497704,0.000119893135,0.000059666378,0.000019989859,0.000040416788,0.00008637781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985299,0.000010814088,0.000532097,0.00039867056,0.00002118635,0.0005073005],"domain_scores_gemma":[0.99934334,0.00011437175,0.00020540082,0.00022076393,0.000010625194,0.00010547951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006729297,0.00018569666,0.0003670545,0.00022652147,0.00019776712,0.000117973,0.00010795169,0.00020651113,0.00010056827],"category_scores_gemma":[0.00019116845,0.00023301397,0.000060829763,0.0001765511,0.00011139718,0.0001694394,0.00004180518,0.0003136995,0.00010094842],"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.000018362178,0.00008028711,0.25972787,0.00009486293,0.00002866089,0.00001470443,0.0032494778,0.00016045272,0.0000062269787,0.73511535,0.00004269259,0.001461068],"study_design_scores_gemma":[0.009313216,0.0006492791,0.10271503,0.000805128,0.00007244328,0.00013016669,0.01546444,0.062574886,0.0007336965,0.3424561,0.46004555,0.00504007],"about_ca_topic_score_codex":0.00022618628,"about_ca_topic_score_gemma":0.00012970068,"teacher_disagreement_score":0.46000284,"about_ca_system_score_codex":0.00026143217,"about_ca_system_score_gemma":0.0000073455885,"threshold_uncertainty_score":0.95020336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68762493,0.0006117135,0.30284882,0.00708848,0.00007469739,0.0012884774,0.000019863954,0.000023052087,0.00041995704],"genre_scores_gemma":[0.9757875,0.00003425688,0.023970895,0.000106953004,0.000010222045,0.00006532229,5.1252084e-7,0.0000061408305,0.000018198254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989952,0.00021398562,0.00017492368,0.0002349045,0.00019928832,0.00018173784],"domain_scores_gemma":[0.99455243,0.004587837,0.00018734904,0.00043783418,0.00018706247,0.000047467576],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015427157,0.00009916221,0.00019246004,0.000048421556,0.00080629747,0.00013370521,0.00054277224,0.00006200999,8.3291644e-7],"category_scores_gemma":[0.0016849709,0.00005742011,0.000046034937,0.00009485252,0.003939321,0.00035817944,0.00020231963,0.0001896204,9.291425e-8],"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.00008763708,0.000008767773,0.0021370654,0.00017543066,0.000027068338,5.625161e-7,0.005082358,0.000015980844,0.0018084086,0.9857447,0.000043376873,0.004868641],"study_design_scores_gemma":[0.0012313081,0.00010297985,0.0087530445,0.00003707438,0.000018570938,0.000013519918,0.00018893082,0.013333751,0.005825638,0.97036785,0.00004437148,0.00008294941],"about_ca_topic_score_codex":0.000053914355,"about_ca_topic_score_gemma":0.000012751562,"teacher_disagreement_score":0.28816256,"about_ca_system_score_codex":0.000011677271,"about_ca_system_score_gemma":0.000039340826,"threshold_uncertainty_score":0.99877137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019126303,0.00020020497,0.9790015,0.000117734446,0.00062145706,0.00018023432,0.00037607222,0.0002874055,0.00008907767],"genre_scores_gemma":[0.5852368,0.0000531638,0.41349435,0.000049880113,0.00057728734,0.000030223031,0.00025519513,0.00004768274,0.00025546795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.0000056808863,0.00015735356,0.00018564948,0.000072811374,0.00022240165],"domain_scores_gemma":[0.9993813,0.00013799507,0.000068640715,0.0003007041,0.000038527523,0.0000728552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046628473,0.00016380493,0.00018950025,0.000048448826,0.00037539678,0.000090602916,0.00018885404,0.000121317644,0.000012007684],"category_scores_gemma":[0.00018798147,0.00016807603,0.00005384589,0.00001813363,0.00010232953,0.00012025372,0.000020668173,0.00017429415,0.0000056028066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024761403,0.000042153115,0.000022264225,0.000059555856,0.000113112816,0.000014065338,0.000641087,0.84202397,0.00043424362,0.002475367,0.00044185854,0.15370755],"study_design_scores_gemma":[0.0008632911,0.000038681195,0.00021079734,0.000028434972,0.000048885388,0.000002659566,0.00007585167,0.98269653,0.0017368655,0.012519328,0.0015050007,0.00027364827],"about_ca_topic_score_codex":0.0000451244,"about_ca_topic_score_gemma":0.000022777569,"teacher_disagreement_score":0.56611043,"about_ca_system_score_codex":0.00007445393,"about_ca_system_score_gemma":0.000008081058,"threshold_uncertainty_score":0.68539417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103664376,0.000105334795,0.8955191,0.00026324738,0.000059706763,0.00026229583,5.657045e-7,0.000029677363,0.00009571775],"genre_scores_gemma":[0.9065232,0.000020076002,0.09184491,0.00006195622,0.00016639574,0.00020229067,0.000019428993,0.000021075133,0.0011406664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981596,0.000044509103,0.00033131771,0.0004212025,0.0006860211,0.0003573575],"domain_scores_gemma":[0.9986522,0.00065916235,0.000092277565,0.00025138463,0.00026936713,0.00007558326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080455974,0.00011940898,0.00020402415,0.00022789744,0.00021415055,0.00011901109,0.00025283635,0.00008789581,0.000027726732],"category_scores_gemma":[0.0023945235,0.0001041467,0.000053790634,0.0007791435,0.00006308989,0.00025015356,0.00006259281,0.00035188656,0.000014354445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005366272,0.000011849472,0.0009765424,0.0000092831015,0.0000050125013,0.000025279554,0.0008344891,0.946993,0.0006875841,0.002572851,0.000026978547,0.04780345],"study_design_scores_gemma":[0.0009243516,0.00009872451,0.0035351908,0.000019327981,0.0000035169446,0.000017536768,0.00093915476,0.96945536,0.002468414,0.0010990945,0.021236869,0.0002024553],"about_ca_topic_score_codex":0.000010544271,"about_ca_topic_score_gemma":0.00004071594,"teacher_disagreement_score":0.80367416,"about_ca_system_score_codex":0.00021878471,"about_ca_system_score_gemma":0.00011153531,"threshold_uncertainty_score":0.4246979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649911,0.011433939,0.0013717304,0.0025620928,0.0010839198,0.00030089085,0.00033363065,0.000029332623,0.017893393],"genre_scores_gemma":[0.97974014,0.0049643703,0.00045356582,0.00058830675,0.00029290238,0.000011491102,0.000026541233,0.0000409872,0.0138816815],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997385,0.00006943103,0.0012659609,0.00055022654,0.000052509044,0.0006768299],"domain_scores_gemma":[0.9980351,0.00020588412,0.00083713967,0.0006688881,0.00004549183,0.0002075481],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090411596,0.00030588964,0.0013017211,0.0014575213,0.00021950708,0.00012962063,0.00036385635,0.0002796013,0.0017159707],"category_scores_gemma":[0.00023216491,0.00040780983,0.00062629377,0.0020122884,0.00027772706,0.00036839437,0.00006942052,0.00031041715,0.00016112076],"study_design_candidate":"observational","study_design_consensus":"observational","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.000051783773,0.0009030188,0.8998141,0.000044458673,0.004642423,0.00003625138,0.012137721,0.0028770631,0.000009560895,0.06838228,0.0019167847,0.009184542],"study_design_scores_gemma":[0.0019383201,0.0006360695,0.8061787,0.00003696142,0.001284381,0.000013548377,0.0064496296,0.03267048,0.000023165601,0.005280372,0.14465985,0.00082855625],"about_ca_topic_score_codex":0.008629261,"about_ca_topic_score_gemma":0.0011685041,"teacher_disagreement_score":0.14274307,"about_ca_system_score_codex":0.0004514065,"about_ca_system_score_gemma":0.000035344685,"threshold_uncertainty_score":0.9998374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055659,0.0018014829,0.19084774,0.00009438438,0.00048471073,0.00040692734,0.00002579681,0.0003426792,0.00043038142],"genre_scores_gemma":[0.9994908,0.000025670159,0.00021008895,0.000024049512,0.00013777084,0.000061259656,0.00001041054,0.00002796783,0.000012004958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989512,0.00005348659,0.00030546755,0.00024610249,0.00018641276,0.00025734305],"domain_scores_gemma":[0.9993827,0.0001266814,0.000035419016,0.00027790936,0.00006258295,0.00011475084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776169,0.0001861446,0.00026568281,0.00005928207,0.00013592666,0.000080497695,0.00009719775,0.00009848576,0.000014634024],"category_scores_gemma":[0.0001040348,0.00018488361,0.00004861828,0.00011199332,0.00015634167,0.00016993638,0.000011546273,0.00017566301,0.0000101279575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024122586,0.00020912636,0.0058896393,0.0025047641,0.00034593,0.000048996135,0.015880873,0.81024456,0.010616692,0.1457109,0.0002470228,0.008060243],"study_design_scores_gemma":[0.02920646,0.0019665295,0.028491642,0.0013678161,0.0007654801,0.0010019015,0.04139536,0.7476174,0.012740217,0.10832169,0.019084048,0.008041411],"about_ca_topic_score_codex":0.0001457088,"about_ca_topic_score_gemma":0.000053307045,"teacher_disagreement_score":0.19392489,"about_ca_system_score_codex":0.0003951087,"about_ca_system_score_gemma":0.00002789345,"threshold_uncertainty_score":0.7539335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7690435,0.00023238701,0.22387625,0.001365376,0.00024417226,0.0009814134,0.000038093705,0.00009417405,0.0041246037],"genre_scores_gemma":[0.7956072,0.00007897491,0.20116158,0.00018171225,0.0001277556,0.000054358134,0.000044149798,0.00006201397,0.0026822465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974781,0.00019820948,0.0009245971,0.0004570898,0.00049558585,0.0004464029],"domain_scores_gemma":[0.99777424,0.0010255055,0.00048240964,0.0003728053,0.00011769642,0.00022731922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005101979,0.00043191665,0.00075311534,0.00015102944,0.000228774,0.00008437646,0.00017876318,0.0004283167,0.00023696912],"category_scores_gemma":[0.002029588,0.0003248371,0.00022136423,0.00029368166,0.00035468038,0.0001818051,0.000041452113,0.000569947,0.00001892499],"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.00016962903,0.0022190814,0.000767109,0.0028425776,0.00013606845,0.000011215673,0.019198606,0.000045109533,0.00045140187,0.9685538,0.0003378225,0.0052676247],"study_design_scores_gemma":[0.01408226,0.0032708005,0.0069069923,0.0067988196,0.0007664883,0.00024405206,0.026339097,0.27187347,0.058204025,0.60356975,0.0046125087,0.0033317464],"about_ca_topic_score_codex":0.00013353795,"about_ca_topic_score_gemma":0.000016150481,"teacher_disagreement_score":0.36498404,"about_ca_system_score_codex":0.00031133342,"about_ca_system_score_gemma":0.00007668394,"threshold_uncertainty_score":0.99992037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93840456,0.0001472855,0.008441308,0.00075291214,0.0003192651,0.00040578615,0.0000014611978,0.00011544816,0.051411957],"genre_scores_gemma":[0.99442047,0.000033820183,0.0010131259,0.003242602,0.0007586122,0.000018647639,0.00004572661,0.000031890846,0.0004351214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998475,0.00002650279,0.0003418843,0.00038071405,0.0003069899,0.00046890974],"domain_scores_gemma":[0.9995058,0.00006094208,0.00014136381,0.00024357623,0.000022023278,0.000026292011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009816233,0.000232712,0.00021971884,0.00037831406,0.00024823626,0.00018162615,0.00027870873,0.00009463494,0.00041542883],"category_scores_gemma":[0.000022890232,0.00022836555,0.0000689383,0.00024511607,0.00014300396,0.0008011578,0.00010522224,0.00023353496,0.00016341341],"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.00015362995,0.00039886084,0.061959986,0.00018661605,0.000051800573,0.00033752806,0.0029901278,0.0013902078,0.0009253095,0.9187149,0.0008770081,0.012014037],"study_design_scores_gemma":[0.004352255,0.00009787999,0.21104947,0.00019595708,0.00008966567,0.0000084219155,0.030604146,0.0059627816,0.00030916903,0.054010034,0.6917989,0.0015212824],"about_ca_topic_score_codex":0.00049685745,"about_ca_topic_score_gemma":0.0005163416,"teacher_disagreement_score":0.86470485,"about_ca_system_score_codex":0.000211944,"about_ca_system_score_gemma":0.000005783243,"threshold_uncertainty_score":0.93124765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645741,0.0009144747,0.0009193931,0.00031480505,0.00041107895,0.00035964468,9.411946e-7,0.00013656016,0.032369014],"genre_scores_gemma":[0.9983115,0.000059648835,0.00069863495,0.00020934254,0.0003710432,0.00001840358,0.0000059779904,0.00002428705,0.00030114656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883175,0.000013373327,0.00031219888,0.00020612121,0.00026165726,0.00037489826],"domain_scores_gemma":[0.99925715,0.00016438571,0.00021638261,0.00025370254,0.000093934614,0.0000144296855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008663367,0.00016580858,0.00017124783,0.000103297156,0.0005102676,0.0002279743,0.00026999126,0.00006937512,0.000035260393],"category_scores_gemma":[0.000036024212,0.00012223434,0.00010398182,0.00036130604,0.00022513597,0.00035364303,0.00006573597,0.0002366906,0.000012338085],"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.00011843018,0.0001348672,0.06756449,0.00014309495,0.000053929965,0.00004386989,0.0003386182,0.00002890553,0.0010800388,0.48555845,0.00034699356,0.4445883],"study_design_scores_gemma":[0.0019078858,0.000076509175,0.1773573,0.00031511742,0.00045934753,0.00002599152,0.0100207925,0.0033875674,0.000761517,0.039796975,0.7645722,0.0013187716],"about_ca_topic_score_codex":0.000362977,"about_ca_topic_score_gemma":0.00022418848,"teacher_disagreement_score":0.76422524,"about_ca_system_score_codex":0.000034963206,"about_ca_system_score_gemma":0.000017864206,"threshold_uncertainty_score":0.4984572},"labels":[],"label_agreement":null}]}