{"meta":{"query_hash":"1a9f3bd2850a","filters":{"topic":"Optimization and Mathematical Programming"},"cohort_total":263,"direct_labels_cover":0,"predictions_cover":263,"exported":263,"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/1a9f3bd2850a","api":"https://metacan.xera.ac/api/v1/cohort?topic=Optimization+and+Mathematical+Programming"},"results":[{"id":"W1003559035","doi":"10.5267/j.msl.2015.6.008","title":"A scenario based project portfolio selection","year":2015,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Portfolio; Computer science; Project portfolio management; Business; Finance; Project management; Artificial intelligence; Economics; Management","score_opus":0.022940278854839295,"score_gpt":0.2460824025597104,"score_spread":0.2231421237048711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1003559035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071267046,0.0004894722,0.9073231,0.0013421173,0.00005687084,0.00020411769,0.00048146286,0.00017404219,0.018661786],"genre_scores_gemma":[0.92760134,0.00058233243,0.0628088,0.00010656492,0.000043420972,0.00033361666,0.00033949272,0.000035801862,0.008148536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979401,0.0011926438,0.000049510465,0.00025935986,0.0003615959,0.00019666996],"domain_scores_gemma":[0.9991109,0.00046017332,0.0001450129,0.000045868124,0.0001376614,0.00010026863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016294151,0.0009365955,0.0010249497,0.00090524467,0.00046998117,0.002070873,0.0013727124,0.0018426314,0.0050963648],"category_scores_gemma":[0.0028077129,0.0005491082,0.0009183664,0.0014019255,0.00064477883,0.0017335783,0.0013666619,0.0010991624,0.00043047295],"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.00005093753,0.00003058023,0.00040875687,0.000039000373,0.000037673562,0.0002788881,0.000030767387,0.9669456,0.00068753085,0.02492506,0.00065830967,0.005906897],"study_design_scores_gemma":[0.000012282966,0.00004761529,0.00017181889,0.000009729089,0.0000090148915,0.000113724775,0.00002575545,0.987283,0.00022307911,0.011150791,0.00094035064,0.0000128840575],"about_ca_topic_score_codex":0.0020024288,"about_ca_topic_score_gemma":0.0010842351,"teacher_disagreement_score":0.0050963648,"about_ca_system_score_codex":0.001214885,"about_ca_system_score_gemma":0.0011984697,"threshold_uncertainty_score":0.017049074},"labels":[],"label_agreement":null},{"id":"W1182730838","doi":"10.1007/s10479-015-1969-3","title":"Goal programming model for management accounting and auditing: a new typology","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Typology; Audit; Compromise; Accounting; Computer science; Field (mathematics); Management accounting; Theory of computation; Guideline; Management science; Aggregate (composite); Business; Economics; Sociology; Political science; Mathematics; Algorithm","score_opus":0.3251146592553192,"score_gpt":0.4538097761543216,"score_spread":0.12869511689900243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1182730838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055469014,0.002887962,0.9357426,0.01225956,0.0004623917,0.000061157974,0.00029023923,0.00016562175,0.0425836],"genre_scores_gemma":[0.5241911,0.011026072,0.42973897,0.0041967905,0.0021075367,0.00085868005,0.0007843845,0.00048451984,0.026612006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761766,0.0012823516,0.00012643194,0.00032891487,0.000454122,0.00019042559],"domain_scores_gemma":[0.9966275,0.0022289634,0.00021392568,0.00032059915,0.00036562717,0.00024341402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003225549,0.0011818307,0.0012218795,0.0023314862,0.0013387469,0.008770922,0.002830919,0.0033911737,0.0056657107],"category_scores_gemma":[0.00509258,0.00056978624,0.0018622112,0.0042580897,0.0069404356,0.009990566,0.0021614528,0.0067130807,0.00086957373],"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.0000038742633,0.0000150592,0.00007024406,0.000023342927,0.000007184147,0.000017539991,0.000058908234,0.0037881092,0.000024536192,0.9922198,0.0012146354,0.0025568104],"study_design_scores_gemma":[0.0000068961203,0.000010065231,0.000051311556,0.00002990583,0.000007812852,0.000031439016,0.00007551912,0.03021051,0.00003019879,0.96199745,0.0075383135,0.000010506196],"about_ca_topic_score_codex":0.0030070606,"about_ca_topic_score_gemma":0.0024231859,"teacher_disagreement_score":0.008770922,"about_ca_system_score_codex":0.00331649,"about_ca_system_score_gemma":0.0032312742,"threshold_uncertainty_score":0.024062932},"labels":[],"label_agreement":null},{"id":"W1276039536","doi":"10.5267/j.dsl.2015.6.003","title":"Fuzzy goal programming applied to multi-objective programming problem with FREs as constraints","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Goal programming; Fuzzy logic; Mathematical optimization; Computer science; Artificial intelligence; Mathematics","score_opus":0.021802615391837244,"score_gpt":0.27728586561695073,"score_spread":0.2554832502251135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1276039536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020685347,0.0001467101,0.99596953,0.00008302515,0.000012626635,0.000038357888,0.000012842586,0.00003548462,0.0016328624],"genre_scores_gemma":[0.12982246,0.0006262479,0.86755055,0.000080782105,0.000036350426,0.0002908299,0.000055205262,0.00004584479,0.0014917502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888676,0.0006029264,0.00005642143,0.00014030142,0.00025050435,0.00006307305],"domain_scores_gemma":[0.9993019,0.00049158395,0.00006108527,0.000030269119,0.00009378292,0.000021401474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019150613,0.0011003573,0.0008808073,0.00080352364,0.0005538316,0.0010454496,0.0009441372,0.0009954248,0.0018370776],"category_scores_gemma":[0.0021403062,0.00041462193,0.0011062288,0.0011070241,0.00066817045,0.0011314955,0.0012028734,0.0017815467,0.00030081047],"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.000049405822,0.0000668777,0.00046675984,0.00051093445,0.00008633498,0.00023870131,0.00024413392,0.76328254,0.0030837266,0.13326629,0.0012716873,0.09743266],"study_design_scores_gemma":[0.000015129232,0.000082562765,0.000116059884,0.00005044785,0.000023277658,0.000087141634,0.000038931434,0.9639265,0.0015101319,0.030454535,0.0036818513,0.000013419541],"about_ca_topic_score_codex":0.0022719295,"about_ca_topic_score_gemma":0.0017408469,"teacher_disagreement_score":0.0022719295,"about_ca_system_score_codex":0.0007051189,"about_ca_system_score_gemma":0.001220579,"threshold_uncertainty_score":0.010127962},"labels":[],"label_agreement":null},{"id":"W1475261338","doi":"","title":"Manager Preferences Modelling for Stochastic Aggregate Planning","year":2011,"lang":"en","type":"article","venue":"Silesian Digital Library (Silesian Library)","topic":"Optimization and Mathematical Programming","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":"Laurentian University","funders":"","keywords":"Aggregate (composite); Computer science; Aggregate planning; Production planning; Microeconomics; Economics","score_opus":0.03118836438388797,"score_gpt":0.19292546228336727,"score_spread":0.1617370978994793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1475261338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016755436,0.00022956086,0.97676396,0.00035295903,0.000027823857,0.000039613657,0.0001228049,0.00009652663,0.0056112977],"genre_scores_gemma":[0.8214709,0.00070123107,0.16934042,0.0001593491,0.000097488264,0.00036200564,0.0002199066,0.00007847796,0.0075701475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825233,0.0010444222,0.000059101854,0.00017771822,0.00031655873,0.00014977837],"domain_scores_gemma":[0.9983734,0.0010597968,0.00025873465,0.000060274728,0.00015154162,0.0000962787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021160608,0.00090552896,0.00079692167,0.0005732371,0.0003692348,0.0016590032,0.0011977416,0.0011343873,0.0026970292],"category_scores_gemma":[0.0041733463,0.0005678938,0.0009104459,0.0010062179,0.00068221026,0.0014300545,0.000969382,0.0013958352,0.00038751747],"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.00005909553,0.00003450261,0.0006015443,0.00006529324,0.00004850202,0.00017790707,0.0001907758,0.84055644,0.00060611713,0.14791775,0.000769333,0.008972759],"study_design_scores_gemma":[0.000007726461,0.000020608024,0.000091329064,0.0000059942113,0.000009671376,0.000018309063,0.000023573466,0.9728589,0.00009525745,0.026052983,0.0008091916,0.0000064108513],"about_ca_topic_score_codex":0.0046139522,"about_ca_topic_score_gemma":0.004441005,"teacher_disagreement_score":0.0046139522,"about_ca_system_score_codex":0.0013362863,"about_ca_system_score_gemma":0.0012610633,"threshold_uncertainty_score":0.011190891},"labels":[],"label_agreement":null},{"id":"W1512988686","doi":"","title":"Kairos Management : Nouveaux outils pour le Management des Opportunités","year":2006,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Mathematical Programming","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":"Kairos; Political science; Philosophy; Linguistics","score_opus":0.021159530198354887,"score_gpt":0.228338705815791,"score_spread":0.2071791756174361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512988686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014239854,0.026985481,0.6628561,0.09754242,0.003129816,0.0009683691,0.00045407994,0.0017221795,0.19210179],"genre_scores_gemma":[0.29721507,0.04461139,0.5193808,0.009361594,0.0024579053,0.001787634,0.0005107161,0.0014280322,0.12324676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9807537,0.0089552,0.00086768676,0.0017488666,0.0065298015,0.0011446264],"domain_scores_gemma":[0.9730656,0.014419778,0.0018685742,0.00443413,0.0046793297,0.0015324748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01743782,0.0017716341,0.0013537833,0.003632259,0.0044758995,0.020871682,0.005619381,0.0065781795,0.02342026],"category_scores_gemma":[0.031685714,0.0014519762,0.0019103442,0.004122134,0.009535523,0.022023195,0.007130744,0.008060245,0.004609347],"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.00016045093,0.00019307989,0.0012500676,0.0015674531,0.00009154207,0.00021015047,0.0038573763,0.0076728673,0.0011243272,0.763267,0.018149082,0.20245656],"study_design_scores_gemma":[0.00007975652,0.00022623633,0.0017017435,0.0023040546,0.00011492313,0.00037713945,0.0066494555,0.032175172,0.0023424104,0.43192884,0.5218693,0.00023097053],"about_ca_topic_score_codex":0.015014918,"about_ca_topic_score_gemma":0.021466114,"teacher_disagreement_score":0.02342026,"about_ca_system_score_codex":0.008689538,"about_ca_system_score_gemma":0.019241635,"threshold_uncertainty_score":0.09222108},"labels":[],"label_agreement":null},{"id":"W1529531754","doi":"10.1023/a:1021874104605","title":"Selecting Sites for New Facilities Using Data Envelopment Analysis","year":2003,"lang":"en","type":"article","venue":"Journal of Productivity Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Selection (genetic algorithm); Computer science; Aggregate (composite); Mathematical optimization; Operations research; Resource (disambiguation); Mathematics; Artificial intelligence","score_opus":0.09226992933860148,"score_gpt":0.30245573831588957,"score_spread":0.21018580897728809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529531754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71289027,0.00036993937,0.27649972,0.00036539588,0.00006458164,0.0011187071,0.0013438147,0.0006552037,0.0066924538],"genre_scores_gemma":[0.82064176,0.00016844431,0.17674287,0.000021052036,0.000010467951,0.00025114935,0.00076895906,0.00005763581,0.0013376607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972832,0.0009850767,0.00015439594,0.00029334094,0.0009165051,0.00036747468],"domain_scores_gemma":[0.9930194,0.003610905,0.00062277383,0.00065796595,0.0014909224,0.0005979105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035452598,0.0011260525,0.0025964058,0.0076958467,0.001443309,0.0038187199,0.0016613378,0.0014244948,0.007963981],"category_scores_gemma":[0.010322574,0.00095495186,0.002281623,0.006019943,0.0006057899,0.0037269457,0.0016101971,0.0011068622,0.001448803],"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.0013226578,0.0011026281,0.0669948,0.000633937,0.00043445153,0.00052781455,0.000496433,0.58595085,0.017821653,0.014763648,0.0039594327,0.30599168],"study_design_scores_gemma":[0.00020972265,0.000565263,0.012478454,0.00006251249,0.0002236968,0.0001556444,0.0013768628,0.95954156,0.0115680825,0.011106742,0.0025861445,0.00012526529],"about_ca_topic_score_codex":0.007807699,"about_ca_topic_score_gemma":0.010812903,"teacher_disagreement_score":0.007963981,"about_ca_system_score_codex":0.0020048574,"about_ca_system_score_gemma":0.0038791827,"threshold_uncertainty_score":0.026642203},"labels":[],"label_agreement":null},{"id":"W1545660827","doi":"10.1002/9783527630844.app2","title":"Appendix B: Chance Constrained Programming","year":2010,"lang":"en","type":"other","venue":"","topic":"Optimization and Mathematical Programming","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","funders":"","keywords":"Library science; Citation; Operations research; Computer science; Engineering","score_opus":0.008141916425967996,"score_gpt":0.22379729797170353,"score_spread":0.21565538154573555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545660827","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018255113,0.0054295566,0.5111939,0.009331366,0.0035426957,0.00064522086,0.034819603,0.0013127892,0.4318994],"genre_scores_gemma":[0.09435076,0.014159289,0.49141118,0.0052022343,0.002839963,0.0029801044,0.038684025,0.0018240142,0.34854847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912447,0.00027280944,0.000049846396,0.000108684595,0.00037610915,0.000068050584],"domain_scores_gemma":[0.99654466,0.0015511413,0.00013336663,0.00025883867,0.0014213732,0.00009048149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096373045,0.001269838,0.0008159315,0.0011801112,0.0006645119,0.001532674,0.0013312966,0.0014857973,0.25629517],"category_scores_gemma":[0.008334935,0.0004658039,0.0007340267,0.002186164,0.0004945952,0.0015311401,0.0014135096,0.0022503715,0.046107855],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032451622,0.00008578008,0.00042668002,0.00045309376,0.000025096118,0.00022969648,0.000060480696,0.044192497,0.00032611197,0.31789845,0.5598627,0.076407],"study_design_scores_gemma":[0.000038581282,0.000022803195,0.0006421867,0.00043269747,0.000014363044,0.0002746673,0.000062200466,0.068862565,0.00048036687,0.2963841,0.6327412,0.00004430247],"about_ca_topic_score_codex":0.011043888,"about_ca_topic_score_gemma":0.009350655,"teacher_disagreement_score":0.25629517,"about_ca_system_score_codex":0.0019299726,"about_ca_system_score_gemma":0.003339785,"threshold_uncertainty_score":0.8573928},"labels":[],"label_agreement":null},{"id":"W1573636743","doi":"10.1023/a:1011392328632","title":"Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Université du Québec à Trois-Rivières; Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Nurse scheduling problem; Computer science; Scheduling (production processes); Job shop scheduling; Mathematics; Schedule; Flow shop scheduling","score_opus":0.012108327788104863,"score_gpt":0.26485392777579,"score_spread":0.2527455999876851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573636743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034704152,0.0004631029,0.955997,0.00088110834,0.00026016892,0.00015618539,0.00019942857,0.000297256,0.007041567],"genre_scores_gemma":[0.38211718,0.0013128762,0.6041683,0.00039159096,0.00031426112,0.0003631189,0.00032716137,0.00020164018,0.010803932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.00037506063,0.000017923438,0.00009275305,0.00010255435,0.00007122713],"domain_scores_gemma":[0.99855596,0.0010002332,0.000111630696,0.00005981261,0.00016363768,0.00010864368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702896,0.001167445,0.0014434301,0.0008398376,0.0010877578,0.0015023348,0.0014802684,0.0018926816,0.0038591987],"category_scores_gemma":[0.004292551,0.0005551383,0.0011904321,0.002215624,0.0011586678,0.0014984958,0.0014082977,0.0021241484,0.00037552146],"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.00017415988,0.00018829809,0.0006118449,0.00021269519,0.00006627078,0.0003572469,0.00013370224,0.8864833,0.00096334773,0.05241977,0.0065780403,0.051811296],"study_design_scores_gemma":[0.000056474266,0.000060622082,0.00020487621,0.000013108957,0.000023894267,0.000070340495,0.000088060886,0.95013535,0.00029994614,0.04675853,0.0022747533,0.000013978533],"about_ca_topic_score_codex":0.010332871,"about_ca_topic_score_gemma":0.011478553,"teacher_disagreement_score":0.010332871,"about_ca_system_score_codex":0.0012159651,"about_ca_system_score_gemma":0.002139343,"threshold_uncertainty_score":0.020545483},"labels":[],"label_agreement":null},{"id":"W1683347786","doi":"","title":"OPTIMIZING MULTI-OBJECTIVE DECISIONS ABOUT DISTRIBUTION CENTRES AND PLANT LOCATIONS IN SUPPLY CHAIN MANAGEMENT","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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 Lethbridge","funders":"","keywords":"Supply chain; Analytic hierarchy process; Operations research; Supply chain management; Distribution (mathematics); Computer science; Hierarchy; Process (computing); Focus (optics); Risk analysis (engineering); Operations management; Engineering; Business; Mathematics; Economics","score_opus":0.012317344724643218,"score_gpt":0.24345697936119004,"score_spread":0.23113963463654683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683347786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039765444,0.00041304546,0.9559184,0.00042715974,0.000029366489,0.00006507795,0.00006387994,0.00012021156,0.0031974197],"genre_scores_gemma":[0.7288651,0.00076447387,0.26801187,0.00009408657,0.00004440869,0.00017725756,0.000091548136,0.000070854454,0.0018804586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825066,0.0011973998,0.000034146185,0.00008909787,0.0002900973,0.00013855634],"domain_scores_gemma":[0.9986131,0.0010704714,0.00011446467,0.000036503316,0.00011678999,0.00004863204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029429318,0.001128295,0.0011478836,0.0008853982,0.0007534351,0.0017684223,0.0009918063,0.0014056888,0.0009326955],"category_scores_gemma":[0.0045874487,0.0007095531,0.00068050245,0.0018161269,0.0011407759,0.0015033624,0.0012938973,0.0013369585,0.00019162433],"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.00004632387,0.000030634536,0.00018772962,0.00005303865,0.000027096883,0.00003559611,0.000055480443,0.9749853,0.00041159673,0.011099672,0.00031524393,0.0127522],"study_design_scores_gemma":[0.00001871534,0.000043110133,0.00009160649,0.000010345068,0.000014580929,0.000009448091,0.000031157255,0.9826276,0.0005181716,0.016277136,0.00034940444,0.000008739723],"about_ca_topic_score_codex":0.0069903047,"about_ca_topic_score_gemma":0.0058671655,"teacher_disagreement_score":0.0069903047,"about_ca_system_score_codex":0.0012408207,"about_ca_system_score_gemma":0.0016642008,"threshold_uncertainty_score":0.015563905},"labels":[],"label_agreement":null},{"id":"W1729641220","doi":"10.3233/jid-2003-7407","title":"AGGREGATE PRODUCTION PLANNING UTILIZING A FUZZY LINEAR PROGRAMMING","year":2003,"lang":"en","type":"article","venue":"Journal of Integrated Design and Process Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Aggregate planning; Aggregate (composite); Production (economics); Fuzzy logic; Linear programming; Production planning; Computer science; Mathematical optimization; Mathematics; Economics; Microeconomics; Artificial intelligence; Materials science","score_opus":0.033196541970355174,"score_gpt":0.2882482717904504,"score_spread":0.2550517298200953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729641220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008040451,0.00008045729,0.9886994,0.000066408385,0.000008352144,0.00003316715,0.000043092346,0.00010770679,0.0029210136],"genre_scores_gemma":[0.60463303,0.00037417642,0.3891814,0.000054184056,0.000031882006,0.00027245338,0.0001425091,0.000049328137,0.0052610333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916935,0.00027562093,0.00004219176,0.00013496625,0.0003038152,0.00007403586],"domain_scores_gemma":[0.99944764,0.00035167634,0.000053928794,0.000026931182,0.00009956374,0.000020114318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010616467,0.0006858266,0.00076744193,0.0006276422,0.000538378,0.0016982703,0.0006660711,0.00062018906,0.0024594248],"category_scores_gemma":[0.0013295886,0.00036336988,0.00091116404,0.0010060171,0.0005047421,0.0010075005,0.0007332241,0.0008239598,0.00035408698],"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.000020581632,0.000014363609,0.000074139294,0.000026841717,0.00000986962,0.000022559941,0.00003351099,0.97390264,0.0006150738,0.007700266,0.00018401013,0.01739628],"study_design_scores_gemma":[0.000002584604,0.000018866343,0.000023793884,0.000003623008,0.0000035991907,0.000005946253,0.000008725601,0.9959551,0.00031989833,0.0033291618,0.00032543993,0.000003360572],"about_ca_topic_score_codex":0.009826817,"about_ca_topic_score_gemma":0.006105048,"teacher_disagreement_score":0.009826817,"about_ca_system_score_codex":0.0011937,"about_ca_system_score_gemma":0.0016087014,"threshold_uncertainty_score":0.019539237},"labels":[],"label_agreement":null},{"id":"W178407265","doi":"10.1007/978-1-4419-1665-5","title":"Handbook of Metaheuristics","year":2010,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1600,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Metaheuristic; Philosophy; Computer science; Artificial intelligence","score_opus":0.047795274687229924,"score_gpt":0.3949777228414696,"score_spread":0.34718244815423965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178407265","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013398392,0.14971791,0.5500793,0.0018187201,0.0034807727,0.00031874588,0.0040641725,0.008143855,0.2810367],"genre_scores_gemma":[0.015939048,0.102836125,0.5876329,0.0018591323,0.0016995782,0.0007860175,0.008720096,0.0032229545,0.27730414],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933773,0.00007494364,0.000052898617,0.00011605947,0.00037720503,0.000041201216],"domain_scores_gemma":[0.9993136,0.00028151373,0.000041255935,0.0001453661,0.00018297583,0.000035327703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997465,0.002223587,0.002587877,0.0026325167,0.00054750877,0.0029462131,0.0030891513,0.0017698178,0.06518848],"category_scores_gemma":[0.0017119218,0.0012740514,0.0012422499,0.0055595227,0.0006384194,0.0025540593,0.0014701987,0.0035933978,0.050913256],"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.000038894483,0.00010539396,0.00011924172,0.0011281007,0.00008667114,0.00005583654,0.00005523847,0.017413348,0.0020163537,0.038142238,0.24893838,0.69190025],"study_design_scores_gemma":[0.000037259055,0.00006475545,0.00040774108,0.0005145784,0.00004653825,0.0004312049,0.000030316714,0.025715405,0.0015060832,0.058519784,0.91267604,0.000050222814],"about_ca_topic_score_codex":0.001758427,"about_ca_topic_score_gemma":0.0032970652,"teacher_disagreement_score":0.06518848,"about_ca_system_score_codex":0.00077352277,"about_ca_system_score_gemma":0.0015323338,"threshold_uncertainty_score":0.21807718},"labels":[],"label_agreement":null},{"id":"W1795817323","doi":"10.1016/j.ejor.2015.10.006","title":"The bipartite quadratic assignment problem and extensions","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Tabu search; Quadratic assignment problem; Quadratic equation; Bipartite graph; Mathematics; Simple (philosophy); Mathematical optimization; Exponential function; Local search (optimization); Time complexity; Binary number; Polynomial; Exponential family; Combinatorial optimization; Algorithm; Computer science; Combinatorics; Applied mathematics","score_opus":0.13391053166741307,"score_gpt":0.3505228172317594,"score_spread":0.2166122855643463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795817323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08028336,0.005490619,0.71015763,0.007599568,0.0007118442,0.00014551377,0.001127573,0.00030936956,0.19417448],"genre_scores_gemma":[0.70548373,0.009342486,0.15982911,0.0024288972,0.0033637616,0.0006571526,0.0025112391,0.00042780666,0.115955874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782807,0.0010385207,0.00007649955,0.00039580837,0.00038736433,0.00027362094],"domain_scores_gemma":[0.9943967,0.0031528028,0.0005778832,0.00049270975,0.00080524536,0.0005746501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032374694,0.0012314001,0.0015346849,0.0016591453,0.001511625,0.0030032962,0.0031830478,0.0022253627,0.017955385],"category_scores_gemma":[0.0132616395,0.0007924187,0.0018067299,0.004574709,0.0024814373,0.0070572095,0.0044989306,0.005389757,0.0023383643],"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.00011331263,0.00022550712,0.00029815777,0.00025693668,0.000027494038,0.00009497559,0.00021122298,0.042434394,0.000316781,0.9123347,0.014485281,0.02920141],"study_design_scores_gemma":[0.000028005028,0.00003579876,0.00024207516,0.000052414518,0.000011661904,0.00010292717,0.00009102499,0.096107274,0.00006733567,0.89513266,0.008107837,0.000020885851],"about_ca_topic_score_codex":0.0034080725,"about_ca_topic_score_gemma":0.0027357724,"teacher_disagreement_score":0.017955385,"about_ca_system_score_codex":0.0016144918,"about_ca_system_score_gemma":0.0015716949,"threshold_uncertainty_score":0.06006676},"labels":[],"label_agreement":null},{"id":"W1832590774","doi":"","title":"La sélection de portefeuille à laide du Goal Programming imprécis : intégration des préférences du gestionnaire","year":2007,"lang":"fr","type":"article","venue":"ASAC","topic":"Optimization and Mathematical Programming","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":"Laurentian University","funders":"","keywords":"Political science; Humanities; Philosophy","score_opus":0.01058738135514629,"score_gpt":0.24848656928709584,"score_spread":0.23789918793194956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832590774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0433147,0.0006508307,0.9435237,0.00060211524,0.0000610782,0.000060394024,0.000097401185,0.00011566589,0.011574032],"genre_scores_gemma":[0.60860556,0.0010386579,0.37533274,0.00023561002,0.00008950503,0.00022194642,0.0001902341,0.00015064911,0.014135135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972115,0.0009773711,0.00013361964,0.00049214886,0.0010055919,0.00017980693],"domain_scores_gemma":[0.998102,0.000944468,0.00022774337,0.00025317335,0.00035785147,0.00011472228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026807117,0.000917473,0.000960077,0.00072351657,0.0006050527,0.0033338366,0.0009911904,0.00096919824,0.0035659536],"category_scores_gemma":[0.005819866,0.000497775,0.0011911807,0.000981957,0.0013363137,0.0035223155,0.0014877002,0.0017022971,0.0005028443],"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.00067083444,0.00020435418,0.003646671,0.0007503946,0.00023287322,0.00060800376,0.0010038924,0.26822963,0.026237823,0.5114167,0.0025784462,0.18442036],"study_design_scores_gemma":[0.00007115165,0.00052723975,0.0030279416,0.00022996985,0.00020438286,0.0006286975,0.00054147956,0.6706722,0.024911227,0.271316,0.027720466,0.00014921714],"about_ca_topic_score_codex":0.0024609037,"about_ca_topic_score_gemma":0.002070692,"teacher_disagreement_score":0.0035659536,"about_ca_system_score_codex":0.001077128,"about_ca_system_score_gemma":0.0012608333,"threshold_uncertainty_score":0.014177144},"labels":[],"label_agreement":null},{"id":"W1882825307","doi":"10.1007/s10479-015-2007-1","title":"Supply chain management through the stochastic goal programming model","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Goal programming; Stochastic programming; Supply chain; Theory of computation; Computer science; Supply chain management; Mathematical optimization; Function (biology); Operations research; Programming paradigm; Mathematics; Algorithm; Business; Marketing","score_opus":0.23925848199437783,"score_gpt":0.42602666382515814,"score_spread":0.1867681818307803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882825307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02504928,0.00029382942,0.96729505,0.0009934055,0.000048039077,0.000049435504,0.00011858486,0.000103031554,0.0060494575],"genre_scores_gemma":[0.86556137,0.0011553271,0.11908305,0.00023523411,0.00015798671,0.00029125594,0.00025940785,0.00011095397,0.013145387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983798,0.00086016185,0.000047129448,0.0001986767,0.00030204715,0.0002120893],"domain_scores_gemma":[0.99823195,0.0011647079,0.00021816386,0.000049982347,0.00021964565,0.00011559522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022895194,0.0011338936,0.0017457713,0.0009366031,0.0007227661,0.0028937222,0.0016773943,0.0021246022,0.002842165],"category_scores_gemma":[0.0047511915,0.0012348432,0.0012091174,0.0015614525,0.001174292,0.0027012983,0.001538084,0.002060447,0.00036174708],"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.000023970639,0.000026652018,0.00014728226,0.000025393412,0.000033031058,0.000029656074,0.00002280579,0.9468177,0.00012939498,0.049735807,0.00033904798,0.0026692657],"study_design_scores_gemma":[0.000007992747,0.000013398805,0.000030909836,0.0000054537563,0.000008537544,0.0000047121734,0.0000058954997,0.9767015,0.000038497605,0.022947941,0.00022908341,0.0000060774883],"about_ca_topic_score_codex":0.009447385,"about_ca_topic_score_gemma":0.0068268515,"teacher_disagreement_score":0.009447385,"about_ca_system_score_codex":0.0019181999,"about_ca_system_score_gemma":0.0032993427,"threshold_uncertainty_score":0.018784821},"labels":[],"label_agreement":null},{"id":"W1886666858","doi":"10.1139/cjce-2012-0212","title":"Rough approximation-based random model for quarry location and stone materials transportation problem","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Computer science; Operator (biology); Nonlinear system; Genetic algorithm; Fuzzy logic; Scale (ratio); Nonlinear programming; Mathematics; Artificial intelligence","score_opus":0.00821702361592906,"score_gpt":0.18203145276124974,"score_spread":0.1738144291453207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886666858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01608231,0.00035768538,0.9799422,0.00023009266,0.000038972485,0.000035967736,0.0000752706,0.000096678676,0.003140901],"genre_scores_gemma":[0.8403048,0.0010881441,0.15030056,0.00012113734,0.00008126721,0.00036434847,0.00031148284,0.00007156181,0.0073567503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880433,0.00044791691,0.0000479045,0.00020357268,0.0003359308,0.00016047599],"domain_scores_gemma":[0.99922204,0.000451076,0.0001294508,0.00003517125,0.00011554247,0.00004671972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015069864,0.0011268771,0.0021429402,0.0010159531,0.00058923545,0.0018513482,0.0021337587,0.0017534365,0.0020777807],"category_scores_gemma":[0.0019787606,0.00078245095,0.0020711569,0.0013964017,0.0011067373,0.0016082068,0.001055739,0.0016995085,0.00026794532],"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.000008648077,0.0000069926346,0.00008211307,0.00002337483,0.00001197941,0.00003844541,0.000013707846,0.9913932,0.00017392737,0.006749961,0.000113838854,0.0013838764],"study_design_scores_gemma":[0.0000032924124,0.000007760171,0.000027006678,0.0000019333474,0.0000034108186,0.0000060557886,0.000004073932,0.9978604,0.000028876724,0.0019603064,0.000094168136,0.0000027306462],"about_ca_topic_score_codex":0.013551831,"about_ca_topic_score_gemma":0.0075737964,"teacher_disagreement_score":0.013551831,"about_ca_system_score_codex":0.0014540448,"about_ca_system_score_gemma":0.0014764844,"threshold_uncertainty_score":0.026945889},"labels":[],"label_agreement":null},{"id":"W1889768074","doi":"","title":"On the Pareto Optimality in Goal Programming","year":2007,"lang":"en","type":"article","venue":"ASAC","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Laurentian University","funders":"","keywords":"Goal programming; Pareto principle; Mathematical optimization; Computer science; Mathematics; Mathematical economics","score_opus":0.013157132423274445,"score_gpt":0.24485732095524657,"score_spread":0.2317001885319721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889768074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024825685,0.009307128,0.8360348,0.009960255,0.0006014072,0.00007063595,0.00018764875,0.00010396555,0.11890851],"genre_scores_gemma":[0.68314743,0.015537002,0.2638512,0.0031657442,0.0020685182,0.00041521076,0.00038023654,0.00044396363,0.030990645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575657,0.00254791,0.00015212692,0.00030949534,0.0008959782,0.00033780714],"domain_scores_gemma":[0.9862227,0.01155102,0.00036116448,0.0005109119,0.0010266632,0.00032755852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008105544,0.0017004319,0.002360169,0.0024404514,0.0022384843,0.0045206402,0.0018125225,0.0024779895,0.0050812443],"category_scores_gemma":[0.023133291,0.001310373,0.0019083705,0.0037539331,0.008551916,0.007841104,0.0042518284,0.008030201,0.00076245517],"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.000019641744,0.000014960518,0.00010290625,0.000060614948,0.000017399861,0.000015810649,0.00009451596,0.013638019,0.00007174709,0.9765919,0.0018722096,0.00750021],"study_design_scores_gemma":[0.000005841747,0.000008539365,0.000059941747,0.000032913347,0.000007175659,0.0000073407327,0.000023439972,0.020782748,0.000040526294,0.97744286,0.0015830811,0.000005671781],"about_ca_topic_score_codex":0.0044189547,"about_ca_topic_score_gemma":0.0033331143,"teacher_disagreement_score":0.008105544,"about_ca_system_score_codex":0.003261099,"about_ca_system_score_gemma":0.0028125313,"threshold_uncertainty_score":0.042866766},"labels":[],"label_agreement":null},{"id":"W1905923734","doi":"10.1002/mcda.1466","title":"The Stochastic Goal Programming Model: Theory and Applications","year":2012,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Certainty; Computer science; Decision maker; Stochastic programming; Operations research; Goal programming; Stochastic modelling; Management science; Mathematical economics; Mathematical optimization; Mathematics; Economics","score_opus":0.018157295886323775,"score_gpt":0.30989797519897205,"score_spread":0.2917406793126483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1905923734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091107115,0.002722054,0.9665442,0.0024282169,0.00009884614,0.000042961034,0.000106915984,0.00008743046,0.018858625],"genre_scores_gemma":[0.7122547,0.0069373315,0.2652855,0.0009569272,0.0006363045,0.00046909915,0.0003428032,0.000113783106,0.01300359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978636,0.0012151289,0.000078397476,0.00025182738,0.00047369045,0.00011734605],"domain_scores_gemma":[0.9966101,0.002559013,0.0002547135,0.00009351308,0.00034402474,0.0001385959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025772622,0.00085392804,0.0009951565,0.0011935004,0.00047441546,0.0024460347,0.0012970521,0.0017839405,0.003479611],"category_scores_gemma":[0.0056335656,0.0004257328,0.0010632733,0.0023238931,0.0020581256,0.0016257578,0.002132977,0.0029928046,0.00047432157],"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.00001800761,0.000056554327,0.00035711337,0.0001237552,0.00004715045,0.00013001659,0.000097799704,0.19825314,0.00019512871,0.7787836,0.0023197313,0.019617967],"study_design_scores_gemma":[0.000009174071,0.00002115038,0.00010333823,0.00003938007,0.000010768459,0.00003807664,0.000025971434,0.58290416,0.00005367455,0.41303968,0.0037423647,0.000012188481],"about_ca_topic_score_codex":0.003916044,"about_ca_topic_score_gemma":0.0019412846,"teacher_disagreement_score":0.003916044,"about_ca_system_score_codex":0.0014909201,"about_ca_system_score_gemma":0.0015243283,"threshold_uncertainty_score":0.013630033},"labels":[],"label_agreement":null},{"id":"W1956780501","doi":"","title":"Aggregate production planning in an imprecise environment through the goal programming and the satisfaction functions","year":2008,"lang":"en","type":"article","venue":"ASAC","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Production (economics); Aggregate (composite); Aggregate planning; Computer science; Production planning; Goal programming; Process management; Management science; Operations research; Economics; Mathematics; Engineering; Microeconomics","score_opus":0.018148050940111755,"score_gpt":0.22893083663578015,"score_spread":0.21078278569566838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956780501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009686818,0.000094988376,0.9887833,0.00012225617,0.000007666646,0.000013111801,0.000043458043,0.00006550789,0.0011828458],"genre_scores_gemma":[0.48925698,0.0006054999,0.5063759,0.0000956353,0.000060765444,0.00020645675,0.00024830608,0.00017278393,0.0029776292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979194,0.0008915716,0.00009649113,0.000332252,0.0005534766,0.000206834],"domain_scores_gemma":[0.9979882,0.0012548203,0.00026818877,0.00019607547,0.00021085981,0.00008196615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030911507,0.0011360304,0.0016661468,0.0011011054,0.00067655917,0.003416925,0.0015104121,0.0008745069,0.0016598097],"category_scores_gemma":[0.0050254776,0.00091017,0.0017325415,0.0022517713,0.0019796377,0.0051285853,0.0020330332,0.0022464318,0.00028558384],"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.00008499433,0.000026943773,0.00035492476,0.000074285104,0.00007059905,0.00006627286,0.0001442285,0.8188073,0.0007769274,0.15560266,0.00045191686,0.02353891],"study_design_scores_gemma":[0.0000067594115,0.00002726564,0.00012117305,0.000016190694,0.000023098904,0.000013592232,0.000036084813,0.8460777,0.00063978607,0.152377,0.00064791593,0.000013440592],"about_ca_topic_score_codex":0.0055684247,"about_ca_topic_score_gemma":0.005749227,"teacher_disagreement_score":0.0055684247,"about_ca_system_score_codex":0.0013508603,"about_ca_system_score_gemma":0.0020250443,"threshold_uncertainty_score":0.016347766},"labels":[],"label_agreement":null},{"id":"W1963636653","doi":"10.1139/x10-179","title":"Using preference information in developing alternative forest plans","year":2010,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiple-criteria decision analysis; Preference; Preference elicitation; Context (archaeology); Computer science; Variety (cybernetics); Operations research; Group decision-making; Process (computing); Management science; Function (biology); Mathematics; Economics; Artificial intelligence; Statistics; Geography; Psychology","score_opus":0.12085289201064812,"score_gpt":0.33662517212653137,"score_spread":0.21577228011588323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963636653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706579,0.00020983182,0.91163975,0.00033626618,0.00001615767,0.00031317296,0.00009652111,0.00009060862,0.01023204],"genre_scores_gemma":[0.42085204,0.00026970703,0.5774136,0.000050135754,0.000007715664,0.00030412222,0.00011969923,0.000021216507,0.00096175674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964684,0.0023005893,0.00013177951,0.00015920326,0.0007848492,0.00015519738],"domain_scores_gemma":[0.99556196,0.0033312116,0.0002853468,0.0002541495,0.00049254723,0.0000747993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005348553,0.0008177072,0.0005881178,0.0019211016,0.0005743234,0.0012525581,0.0009229185,0.0006033763,0.0029697204],"category_scores_gemma":[0.012449184,0.00046873983,0.00081724016,0.0017994154,0.0006878823,0.0022747316,0.001083275,0.0007797353,0.0002492848],"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.00033063907,0.00024951246,0.0029118625,0.00053527195,0.0001358618,0.00055908825,0.0011283589,0.50037915,0.0047838027,0.119526386,0.0011609627,0.36829913],"study_design_scores_gemma":[0.000115042705,0.00033728263,0.001141407,0.00015320645,0.00010154498,0.00020896152,0.0005518694,0.8687145,0.0064868936,0.116691485,0.005430102,0.0000676527],"about_ca_topic_score_codex":0.0022759347,"about_ca_topic_score_gemma":0.0053949123,"teacher_disagreement_score":0.005348553,"about_ca_system_score_codex":0.0011477158,"about_ca_system_score_gemma":0.001691668,"threshold_uncertainty_score":0.028286159},"labels":[],"label_agreement":null},{"id":"W1964676846","doi":"10.4236/ajor.2011.14024","title":"Solving Bilevel Linear Multiobjective Programming Problems","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Linear programming; Decision maker; Pareto principle; Set (abstract data type); Pareto optimal; Computer science; Linear-fractional programming; Multiobjective programming; Mathematics; Resolution (logic); Multi-objective optimization; Optimization problem; Operations research; Artificial intelligence","score_opus":0.10967015286265903,"score_gpt":0.3538734093731688,"score_spread":0.24420325651050978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964676846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009230673,0.0005556478,0.98652077,0.00016291924,0.000032612137,0.000038932838,0.000027862257,0.00005730288,0.0033733097],"genre_scores_gemma":[0.4082527,0.002190225,0.58145416,0.000186216,0.00017807007,0.000477685,0.00029037235,0.00015509092,0.006815475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.0006521377,0.00006372943,0.00014902838,0.00020624089,0.00013566198],"domain_scores_gemma":[0.9982759,0.0012890939,0.00012970148,0.00007208697,0.00017147885,0.000061726205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212204,0.0014215072,0.0019893441,0.0007083859,0.00059843005,0.0025502827,0.0011389859,0.0019362955,0.0028395283],"category_scores_gemma":[0.0051147607,0.00063745695,0.0011217667,0.0013045905,0.0007875319,0.0015117358,0.0021303399,0.0020875053,0.0005826098],"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.0000432192,0.000060398346,0.00029359167,0.00041183713,0.000077447614,0.00013097451,0.00012396622,0.9229344,0.0012255313,0.030992758,0.00069062744,0.0430152],"study_design_scores_gemma":[0.000012130262,0.000037471604,0.000040278373,0.000028674578,0.000011200142,0.00003364084,0.000049259812,0.9637544,0.0005197996,0.034153566,0.0013515454,0.000007969974],"about_ca_topic_score_codex":0.0013033269,"about_ca_topic_score_gemma":0.000897788,"teacher_disagreement_score":0.0028395283,"about_ca_system_score_codex":0.00048513434,"about_ca_system_score_gemma":0.0011292284,"threshold_uncertainty_score":0.011222601},"labels":[],"label_agreement":null},{"id":"W1966664777","doi":"10.5539/mas.v6n3p2","title":"A General Approach for Solving Assignment Problems Involving with Fuzzy Cost Coefficients","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Assignment problem; Generalized assignment problem; Weapon target assignment problem; Mathematical optimization; Fuzzy number; Fuzzy logic; Mathematics; Quadratic assignment problem; Linear bottleneck assignment problem; Computer science; Function (biology); Optimization problem; Fuzzy set; Artificial intelligence","score_opus":0.02617851153748724,"score_gpt":0.23368535288512907,"score_spread":0.20750684134764183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966664777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059859967,0.00015736316,0.9975178,0.00008414629,0.000029349767,0.00003104542,0.00001537911,0.000013649352,0.0015526693],"genre_scores_gemma":[0.058961187,0.0013139416,0.9343817,0.00015687855,0.0001651626,0.00036882306,0.00010625315,0.000052787873,0.004493161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989955,0.00028792926,0.0000618969,0.000213804,0.0003802383,0.00006058317],"domain_scores_gemma":[0.9996138,0.00018811556,0.00003797117,0.000034258323,0.000112159265,0.000013660069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001573766,0.0013722694,0.0010189873,0.0013262237,0.000783151,0.0010760122,0.001791252,0.0016598809,0.0039343326],"category_scores_gemma":[0.0023530761,0.00051261764,0.001975841,0.0021532879,0.000828119,0.0016539351,0.0012236341,0.0025250583,0.0008783135],"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.000030218105,0.00007725897,0.00027484857,0.00067185436,0.00009720647,0.00020440678,0.00021630773,0.4547807,0.0063964264,0.40723222,0.0053858096,0.124632716],"study_design_scores_gemma":[0.000021538606,0.00007902929,0.00014245039,0.00007298267,0.00004408507,0.00025372862,0.000045358345,0.78706264,0.0015421064,0.19267143,0.018033741,0.00003091354],"about_ca_topic_score_codex":0.00216388,"about_ca_topic_score_gemma":0.0024428929,"teacher_disagreement_score":0.0039343326,"about_ca_system_score_codex":0.0009163434,"about_ca_system_score_gemma":0.0013023602,"threshold_uncertainty_score":0.0131616},"labels":[],"label_agreement":null},{"id":"W1970535376","doi":"10.1007/s10479-008-0419-x","title":"An XML-based schema for stochastic programs","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Schema (genetic algorithms); XML; Theory of computation; XML Schema (W3C); Programming language; XML Schema Editor; Document Structure Description; Theoretical computer science; Document type definition; Information retrieval; World Wide Web","score_opus":0.3896662908511025,"score_gpt":0.46968170142637294,"score_spread":0.08001541057527045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970535376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025341862,0.00037460594,0.9279536,0.0012042028,0.00032003887,0.00037295232,0.028045068,0.03172413,0.0074710744],"genre_scores_gemma":[0.051863287,0.0020447872,0.8368531,0.0019110419,0.0003041076,0.001554531,0.08193711,0.011033546,0.012498485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969216,0.000638961,0.001140295,0.00037532055,0.00076328916,0.00016045464],"domain_scores_gemma":[0.99364096,0.002726147,0.0004618777,0.0015415037,0.0014015902,0.00022796758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044349693,0.0013242087,0.0012664631,0.002628617,0.00096751685,0.0066253687,0.0025914798,0.0033905583,0.016937463],"category_scores_gemma":[0.010993888,0.0014455355,0.0019246332,0.0038189304,0.00085151615,0.0072157467,0.0023202964,0.0041438523,0.010327168],"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.0006187732,0.00038443506,0.0031162219,0.0017137653,0.0001741933,0.0014650252,0.0013403329,0.03922534,0.0102616055,0.5304016,0.19141257,0.21988612],"study_design_scores_gemma":[0.00020463548,0.00008087838,0.0008058432,0.00055451307,0.0000940639,0.0011378862,0.0002669589,0.12465294,0.013068163,0.18682435,0.6721637,0.00014599612],"about_ca_topic_score_codex":0.0041201203,"about_ca_topic_score_gemma":0.0032948048,"teacher_disagreement_score":0.016937463,"about_ca_system_score_codex":0.0015732199,"about_ca_system_score_gemma":0.0024595838,"threshold_uncertainty_score":0.056661487},"labels":[],"label_agreement":null},{"id":"W1973531844","doi":"10.3168/jds.s0022-0302(06)72233-0","title":"Modeling Small-Scale Dairy Farms in Central Mexico Using Multi-Criteria Programming","year":2006,"lang":"en","type":"article","venue":"Journal of Dairy Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":26,"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":"Consejo Nacional de Ciencia y Tecnología","keywords":"Forage; Agricultural science; Production (economics); Linear programming; Gross margin; Scale (ratio); Goal programming; Herd; Dairy cattle; Agricultural engineering; Business; Mathematics; Economics; Environmental science; Engineering; Operations research; Agronomy; Animal science; Biology; Geography; Mathematical optimization","score_opus":0.033195995780763515,"score_gpt":0.27804017874099135,"score_spread":0.24484418296022784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973531844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484981,0.00014926634,0.048350997,0.00027686186,0.0000097540815,0.000075462056,0.00037309044,0.00006956148,0.0021969145],"genre_scores_gemma":[0.9894461,0.00012823383,0.009150883,0.000012784048,0.0000047117783,0.00012073505,0.00015636261,0.000007624535,0.00097248494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.000094566974,0.00000990861,0.000050367507,0.000021865162,0.00006388472],"domain_scores_gemma":[0.99923205,0.00049738295,0.0001324002,0.0000188341,0.000066834735,0.00005244363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078059913,0.0005325576,0.00050564593,0.00043385974,0.000597363,0.0013275481,0.0008738647,0.0010909359,0.001429256],"category_scores_gemma":[0.0012561323,0.0005016678,0.0005826168,0.0006266049,0.0004590422,0.0006429152,0.00050808437,0.0004545269,0.00006708469],"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.000025841568,0.00002385441,0.002381838,0.000009033396,0.000013182416,0.00004367634,0.000013036455,0.99610895,0.00015835979,0.0003285164,0.0000459124,0.00084778684],"study_design_scores_gemma":[0.0000134278735,0.000024474588,0.0013747676,0.0000022410843,0.0000074869345,0.0000038094583,0.000045528956,0.9980849,0.00006459181,0.0002924213,0.00008317492,0.0000032165453],"about_ca_topic_score_codex":0.08017536,"about_ca_topic_score_gemma":0.062925145,"teacher_disagreement_score":0.08017536,"about_ca_system_score_codex":0.0019646464,"about_ca_system_score_gemma":0.0015134008,"threshold_uncertainty_score":0.15941739},"labels":[],"label_agreement":null},{"id":"W1974926966","doi":"10.1016/s0895-7177(03)00086-4","title":"Goal-optimal pareto solution of multiobjective linear programs and its computing with standard single objective LP software","year":2003,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Mathematical optimization; Pareto principle; Computer science; Linear programming; Software; Pareto optimal; Multi-objective optimization; Set (abstract data type); Mathematics","score_opus":0.017528573626382438,"score_gpt":0.20776368745023208,"score_spread":0.19023511382384964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974926966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008338771,0.00003741446,0.9870004,0.00004625518,0.000013042381,0.00002369216,0.000026177906,0.00044786397,0.0040664678],"genre_scores_gemma":[0.21929736,0.000107488886,0.7768288,0.000052758718,0.000018563995,0.0002552816,0.0001296556,0.0003625286,0.0029475407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958104,0.00014978164,0.000022383954,0.000044698692,0.00015077682,0.000051367577],"domain_scores_gemma":[0.9990885,0.00051027414,0.000047849728,0.00008463423,0.00022941576,0.0000393618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015864545,0.00092092325,0.00086915004,0.0009626985,0.00085329567,0.0013987755,0.0011047302,0.0010592031,0.0048386888],"category_scores_gemma":[0.0037475436,0.00066238554,0.0011120315,0.0007986607,0.0007928174,0.0010919163,0.0012068559,0.0014704921,0.0009932659],"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.00006653102,0.000065481,0.00023556991,0.00008080983,0.00002532294,0.000028856693,0.000067889174,0.90664023,0.00092681544,0.023759674,0.001045552,0.06705728],"study_design_scores_gemma":[0.0000052572345,0.000008200278,0.00002323298,0.0000051097645,0.000003605218,0.0000035367577,0.0000065630074,0.993166,0.00042952356,0.006141781,0.00020497198,0.0000021099054],"about_ca_topic_score_codex":0.003484199,"about_ca_topic_score_gemma":0.0036645788,"teacher_disagreement_score":0.0048386888,"about_ca_system_score_codex":0.0008318999,"about_ca_system_score_gemma":0.0013585989,"threshold_uncertainty_score":0.016186953},"labels":[],"label_agreement":null},{"id":"W1978157509","doi":"10.1016/s0898-1221(01)00264-4","title":"A two-phase optimization procedure for integer programming problems","year":2001,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical optimization; Integer programming; Mathematics; Nonlinear programming; Linear programming; Optimization problem; Integer (computer science); Simple (philosophy); Gradient descent; Nonlinear system; Computer science; Artificial intelligence","score_opus":0.01522489898792866,"score_gpt":0.26510343156140387,"score_spread":0.2498785325734752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978157509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008758274,0.000026657897,0.996603,0.000051926425,0.000040037183,0.000094838746,0.000026839372,0.00024393297,0.002036861],"genre_scores_gemma":[0.027183905,0.00006671299,0.9681834,0.00010108381,0.000042546242,0.0003996669,0.00013699455,0.00033320126,0.0035524962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892163,0.0004041764,0.000057862835,0.00011413895,0.00040313858,0.00009915902],"domain_scores_gemma":[0.9986499,0.00074759964,0.000059796792,0.00017807899,0.0003161727,0.000048456604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018080084,0.0012002947,0.0010059098,0.0012639439,0.000986885,0.0011502873,0.0015074807,0.0012747481,0.013376762],"category_scores_gemma":[0.0047761425,0.0008858467,0.0015496735,0.0013497183,0.0006676768,0.0016974307,0.002017077,0.0028161872,0.0032653566],"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.00047358047,0.00061428314,0.00042057017,0.00056688214,0.00011528013,0.0001892451,0.00023110192,0.1965106,0.024626158,0.1926452,0.013866479,0.56974065],"study_design_scores_gemma":[0.00019169651,0.00018558206,0.00020794236,0.000044661596,0.000037853915,0.00013422797,0.000036667865,0.9100893,0.009583989,0.062095635,0.017341604,0.000050795876],"about_ca_topic_score_codex":0.0013220047,"about_ca_topic_score_gemma":0.0018951533,"teacher_disagreement_score":0.013376762,"about_ca_system_score_codex":0.00039099075,"about_ca_system_score_gemma":0.0016579089,"threshold_uncertainty_score":0.044749737},"labels":[],"label_agreement":null},{"id":"W1978616476","doi":"10.1155/2013/201907","title":"Collaborative Decision-Making in Product Design: An Interactive Multiobjective Approach","year":2013,"lang":"en","type":"article","venue":"Journal of Industrial Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Trois-Rivières","funders":"","keywords":"Mathematical optimization; Computer science; Compromise; Multi-objective optimization; Pareto principle; Convergence (economics); Linear programming; Product (mathematics); Multiobjective programming; Process (computing); Pareto optimal; Group decision-making; Goal programming; Operations research; Mathematics","score_opus":0.022233138726763337,"score_gpt":0.2584301544068281,"score_spread":0.23619701568006476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978616476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004014372,0.00026085458,0.99030215,0.00013887654,0.000014305835,0.00007928991,0.000008126444,0.00005223673,0.005129757],"genre_scores_gemma":[0.17421867,0.00048622728,0.8222877,0.00008780728,0.000044739496,0.00039986102,0.000035382032,0.000051700237,0.0023878526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398065,0.0037296014,0.00017384597,0.00043834542,0.0014538339,0.00022381608],"domain_scores_gemma":[0.99659425,0.002571162,0.00020710159,0.0002580569,0.00022481028,0.00014470091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005419647,0.0014694695,0.0011629941,0.001601562,0.001525604,0.0026207988,0.002898142,0.0020179285,0.004301097],"category_scores_gemma":[0.0043371157,0.0007028955,0.0019318757,0.0012318821,0.0023057582,0.0026463785,0.0037471398,0.001621661,0.00057939906],"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.00016106732,0.000320643,0.0006801147,0.0006899382,0.0003280675,0.0004459038,0.0015767128,0.6294868,0.005668872,0.18595268,0.0011836517,0.17350562],"study_design_scores_gemma":[0.00011049974,0.00024681457,0.00029992545,0.00018971815,0.00012709954,0.00018835004,0.00040954468,0.77758306,0.0038167832,0.20224725,0.01470844,0.00007250821],"about_ca_topic_score_codex":0.0009885239,"about_ca_topic_score_gemma":0.001616022,"teacher_disagreement_score":0.005419647,"about_ca_system_score_codex":0.0013453695,"about_ca_system_score_gemma":0.001523636,"threshold_uncertainty_score":0.028662145},"labels":[],"label_agreement":null},{"id":"W1979596386","doi":"10.5267/j.uscm.2013.09.003","title":"A fuzzy multi-objective multi-follower linear Bi-level programming problem to supply chain optimization","year":2013,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear programming; Supply chain; Mathematical optimization; Fuzzy logic; Computer science; Chain (unit); Mathematics; Business; Artificial intelligence","score_opus":0.021702572576845054,"score_gpt":0.2512654341608052,"score_spread":0.22956286158396016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979596386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012692372,0.0008395737,0.980397,0.00062199775,0.00006887153,0.00006900191,0.00009543654,0.000053197113,0.0051625557],"genre_scores_gemma":[0.63565415,0.0018073982,0.35178563,0.00040241255,0.00019228857,0.00048443238,0.00028395772,0.00006165043,0.009328036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.000531554,0.00003524084,0.00020678657,0.00018865483,0.00009712266],"domain_scores_gemma":[0.9992331,0.0005612934,0.00006484762,0.000022933027,0.000077094286,0.000040795963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498687,0.0012156472,0.0013764743,0.0007732331,0.0007041563,0.0015616332,0.0012028224,0.002422628,0.0036188832],"category_scores_gemma":[0.0021990456,0.00052655337,0.0011107996,0.0017024971,0.0010689242,0.0013655962,0.0011849542,0.0018872415,0.00027536022],"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.000046196223,0.000076787175,0.00031663373,0.00023304642,0.00006741187,0.00016527025,0.00009465986,0.94148415,0.0009980306,0.038680788,0.0012366252,0.016600275],"study_design_scores_gemma":[0.00001115505,0.000040628627,0.000104577004,0.000015824884,0.000013073976,0.00002483827,0.000021011823,0.9864001,0.00018768846,0.01237074,0.0008026444,0.000007666585],"about_ca_topic_score_codex":0.0048792292,"about_ca_topic_score_gemma":0.0031631917,"teacher_disagreement_score":0.0048792292,"about_ca_system_score_codex":0.0014375013,"about_ca_system_score_gemma":0.0014020189,"threshold_uncertainty_score":0.012106419},"labels":[],"label_agreement":null},{"id":"W1980725479","doi":"10.1109/icmit.2008.4654515","title":"A decision framework for location-allocation problems: A case study in tea industry","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Concordia University","keywords":"Computer science; Analytic hierarchy process; Operations research; Fuzzy logic; Process (computing); Selection (genetic algorithm); Decision support system; Product (mathematics); Hierarchy; Management science; Risk analysis (engineering); Engineering; Artificial intelligence; Business; Mathematics; Economics","score_opus":0.042914596485492965,"score_gpt":0.30192810399588327,"score_spread":0.2590135075103903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980725479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2584618,0.0013884024,0.70755905,0.0024190021,0.00007605368,0.0007064521,0.00033088177,0.00020025669,0.028858123],"genre_scores_gemma":[0.72775924,0.0008386588,0.2668909,0.00007448774,0.000030397172,0.00030124484,0.000102525504,0.000029997454,0.003972568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981256,0.001320442,0.000059161794,0.00011320062,0.00021541196,0.00016622682],"domain_scores_gemma":[0.997727,0.0017834709,0.000087436725,0.000086942644,0.0001641892,0.00015110911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033795324,0.0007117928,0.0006847108,0.0010844454,0.00261127,0.0025072943,0.0013688072,0.0033332317,0.0043702405],"category_scores_gemma":[0.0034265853,0.00037854444,0.0010183264,0.0021070421,0.0013590467,0.0021848662,0.0017456516,0.0015200509,0.00030856038],"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.00024172572,0.0007305802,0.0026671928,0.00042552917,0.000062420535,0.0033634133,0.0015971034,0.7817196,0.0031200494,0.14256652,0.002360512,0.061145347],"study_design_scores_gemma":[0.00014922622,0.00041476366,0.0011912924,0.00010009569,0.000047319212,0.0007650572,0.0033870914,0.93174094,0.0019842542,0.04279675,0.017335668,0.00008755532],"about_ca_topic_score_codex":0.010041423,"about_ca_topic_score_gemma":0.019766565,"teacher_disagreement_score":0.010041423,"about_ca_system_score_codex":0.0025206448,"about_ca_system_score_gemma":0.0022283886,"threshold_uncertainty_score":0.019965947},"labels":[],"label_agreement":null},{"id":"W1981955289","doi":"10.1023/b:jogo.0000035028.40292.36","title":"An Exact Method for Fractional Goal Programming","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Quadratic programming; Fractional programming; Mathematical optimization; Goal programming; Sequential quadratic programming; Heuristic; Quadratic equation; Quadratically constrained quadratic program; Linear-fractional programming; Linear programming; Field (mathematics); Nonlinear programming; Nonlinear system","score_opus":0.010637421346521701,"score_gpt":0.3041844384937457,"score_spread":0.29354701714722403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981955289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012089083,0.00009811506,0.9953157,0.00006788912,0.0000844123,0.000019394065,0.000018741344,0.00009083269,0.00309607],"genre_scores_gemma":[0.10765602,0.00034763096,0.8829008,0.0001836471,0.00014403263,0.00018787241,0.00007010859,0.00024095268,0.008269008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.0001238143,0.000018203193,0.00004562138,0.00021907892,0.000044850738],"domain_scores_gemma":[0.9992441,0.00045066004,0.000029244127,0.00007910884,0.00016311764,0.000033809643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011121618,0.0006128898,0.001008565,0.00090687844,0.0007330543,0.00094012707,0.0012967255,0.0012284752,0.0059655546],"category_scores_gemma":[0.0036519575,0.0004808811,0.0008501415,0.00097085064,0.00094039046,0.0013140229,0.0013685023,0.001825387,0.0007544463],"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.00009958549,0.00012522067,0.00021848957,0.00021776845,0.000045315264,0.00009158231,0.0001341985,0.5066433,0.0037324873,0.25193042,0.0050907773,0.23167084],"study_design_scores_gemma":[0.000013217644,0.0000161566,0.00002939364,0.000012596375,0.000007842159,0.000021245878,0.000008480446,0.9577251,0.00035818553,0.03874882,0.0030523539,0.0000066266407],"about_ca_topic_score_codex":0.0043940987,"about_ca_topic_score_gemma":0.0053837197,"teacher_disagreement_score":0.0059655546,"about_ca_system_score_codex":0.0007729152,"about_ca_system_score_gemma":0.0013502982,"threshold_uncertainty_score":0.019956768},"labels":[],"label_agreement":null},{"id":"W1994418144","doi":"10.5539/jmr.v2n4p135","title":"Solving the Multiobjective Two Stage Fuzzy Transportation Problem by Zero Suffix Method","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Suffix; Fuzzy logic; Fuzzy number; Fuzzy transportation; Mathematical optimization; Zero (linguistics); Membership function; Fuzzy set; Computer science; Artificial intelligence","score_opus":0.03969795164962393,"score_gpt":0.38096736576963824,"score_spread":0.3412694141200143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994418144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014679375,0.00008680056,0.9832999,0.00005990332,0.000018099028,0.000037920207,0.000017795419,0.000034313118,0.0017659023],"genre_scores_gemma":[0.4048291,0.0002995757,0.5891756,0.000049325572,0.000032003965,0.0003542351,0.00012049501,0.00006338647,0.005076255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.00020155207,0.000022450035,0.00006650806,0.000104411774,0.00004223496],"domain_scores_gemma":[0.9995591,0.00026182164,0.00004209277,0.000025181529,0.000090463116,0.000021373507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012355568,0.0008179718,0.0010111261,0.0005144167,0.00053917174,0.0008862511,0.00086116896,0.001344494,0.003459088],"category_scores_gemma":[0.0012731277,0.00045280377,0.0012143187,0.0007066999,0.0005412326,0.0012019302,0.0008007208,0.0010396319,0.00030308779],"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.000099138495,0.000051736006,0.0004366148,0.000287953,0.000046420544,0.0001366892,0.00011779861,0.9307342,0.0045620133,0.025538133,0.0006371468,0.037352074],"study_design_scores_gemma":[0.00001913059,0.00008242427,0.00008284589,0.000009647191,0.000009501376,0.000022709972,0.000021162812,0.99217224,0.0008780472,0.005981934,0.0007130084,0.0000074008785],"about_ca_topic_score_codex":0.00309112,"about_ca_topic_score_gemma":0.0019582962,"teacher_disagreement_score":0.003459088,"about_ca_system_score_codex":0.0005485362,"about_ca_system_score_gemma":0.0013994251,"threshold_uncertainty_score":0.011571825},"labels":[],"label_agreement":null},{"id":"W1996400852","doi":"10.1002/mcda.447","title":"Decision‐maker's preferences modelling within the goal‐programming model: a new typology","year":2009,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Laurentian University","funders":"","keywords":"Typology; Decision maker; Goal programming; Preference; Computer science; Operations research; Artificial intelligence; Management science; Machine learning; Economics; Mathematics; Microeconomics; Sociology","score_opus":0.04376550800103314,"score_gpt":0.3173666911509759,"score_spread":0.27360118314994275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996400852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019537244,0.0011671364,0.95246243,0.002164716,0.00016876173,0.00009467875,0.00019089099,0.00010270717,0.024111513],"genre_scores_gemma":[0.65732217,0.0021452168,0.3332923,0.0005180736,0.00030692623,0.0006430386,0.00029574387,0.00011477858,0.005361807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948078,0.0032658356,0.00025659177,0.00050513126,0.00090140116,0.00026319397],"domain_scores_gemma":[0.9960233,0.0023834158,0.000467558,0.00039602251,0.0004932943,0.0002363585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040652407,0.0010393962,0.0009206697,0.0019932997,0.00064439944,0.0056834198,0.0021603198,0.0020768938,0.0032838115],"category_scores_gemma":[0.005696563,0.0004076275,0.0014454845,0.0034135396,0.0026306603,0.005143148,0.0021098754,0.0028457632,0.0005010525],"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.000057982223,0.0000772689,0.0009751783,0.00020511872,0.00008432035,0.00020439972,0.00053882593,0.06895787,0.0005537049,0.8983907,0.0021098542,0.027844867],"study_design_scores_gemma":[0.000033256743,0.000058255067,0.0003826939,0.00014569788,0.00003808681,0.00017612138,0.0004022374,0.41328913,0.00041844283,0.5712386,0.013767065,0.00005038297],"about_ca_topic_score_codex":0.00120625,"about_ca_topic_score_gemma":0.000868736,"teacher_disagreement_score":0.0056834198,"about_ca_system_score_codex":0.0015441998,"about_ca_system_score_gemma":0.0011348012,"threshold_uncertainty_score":0.021499336},"labels":[],"label_agreement":null},{"id":"W1998488507","doi":"10.1007/s12597-009-0024-z","title":"A simplex algorithm for network flow problems with piecewise linear fractional objective function","year":2009,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of New Brunswick","funders":"","keywords":"Piecewise linear function; Simplex algorithm; Linear-fractional programming; Linear programming; Simplex; Mathematics; Algorithm; Flow network; Criss-cross algorithm; Mathematical optimization; Function (biology); Flow (mathematics); Revised simplex method; Computer science; Mathematical analysis; Combinatorics; Geometry","score_opus":0.016767459184671568,"score_gpt":0.25869578936088833,"score_spread":0.24192833017621676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998488507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027668676,0.00015338865,0.9940753,0.000075994685,0.000039810602,0.00004614175,0.00003392417,0.00022880468,0.0025797028],"genre_scores_gemma":[0.06770874,0.00034027218,0.9263935,0.000065982706,0.000045610832,0.00037005427,0.00010699963,0.00023597921,0.004732874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995084,0.00021810913,0.00002222518,0.00004441267,0.00016772712,0.000039060717],"domain_scores_gemma":[0.99912745,0.00055071193,0.000037779646,0.000063749656,0.00018017578,0.00004017513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051066,0.0009505796,0.0014417637,0.00096992013,0.00069876027,0.0012224114,0.0011343737,0.0013802127,0.0059242807],"category_scores_gemma":[0.0037467817,0.0007131742,0.0008144531,0.0014985836,0.00062840653,0.0013021263,0.0014669248,0.0018420289,0.0010567649],"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.00011027357,0.00008511599,0.00021001598,0.00014761485,0.000060841263,0.000049516882,0.00009517578,0.787929,0.0014668857,0.041378945,0.003867253,0.16459945],"study_design_scores_gemma":[0.000016343416,0.000016280133,0.000023699862,0.000011470794,0.0000066695316,0.000011826464,0.000007292761,0.9907403,0.00027206732,0.0072386214,0.0016488213,0.0000066598254],"about_ca_topic_score_codex":0.005551404,"about_ca_topic_score_gemma":0.0041149873,"teacher_disagreement_score":0.0059242807,"about_ca_system_score_codex":0.00080150407,"about_ca_system_score_gemma":0.0016211917,"threshold_uncertainty_score":0.019818723},"labels":[],"label_agreement":null},{"id":"W2000238862","doi":"10.1007/s10666-014-9441-3","title":"Development of an Improved Fuzzy Robust Chance-Constrained Programming Model for Air Quality Management","year":2015,"lang":"en","type":"article","venue":"Environmental Modeling & Assessment","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Fuzzy logic; Mathematical optimization; Computer science; Operations research; Quality (philosophy); Robust optimization; Engineering; Artificial intelligence; Mathematics","score_opus":0.05943022732978743,"score_gpt":0.2967075953785811,"score_spread":0.23727736804879368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000238862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00699897,0.0001130575,0.98901355,0.000096319025,0.000038407885,0.000038090897,0.00007686205,0.00017969469,0.0034450744],"genre_scores_gemma":[0.7304767,0.00034365058,0.26019946,0.0001243264,0.00006723659,0.00037026184,0.0003093323,0.00015133516,0.007957652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962616,0.00008674041,0.000020548632,0.00008621227,0.00013155432,0.000048754828],"domain_scores_gemma":[0.99968874,0.000119884964,0.000042465173,0.000018650824,0.00011016192,0.000020176425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079824525,0.0007574846,0.0012153636,0.00044868563,0.00049945246,0.0011643266,0.0017612937,0.0014000882,0.003393874],"category_scores_gemma":[0.0012504084,0.0005334098,0.0011391481,0.0006250702,0.0003776734,0.0009565809,0.0009002644,0.0012198966,0.00043498923],"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.000007900655,0.0000075207545,0.000057708046,0.000015483372,0.000008030514,0.000015225744,0.0000061643073,0.9926475,0.00047883444,0.002211989,0.00016696307,0.004376718],"study_design_scores_gemma":[0.000001311301,0.000003985579,0.000013679926,9.297444e-7,0.0000017806536,0.0000017702743,6.175385e-7,0.99948055,0.000094728035,0.0002988106,0.00010032486,0.000001573159],"about_ca_topic_score_codex":0.016562944,"about_ca_topic_score_gemma":0.008880538,"teacher_disagreement_score":0.016562944,"about_ca_system_score_codex":0.00085349975,"about_ca_system_score_gemma":0.0019147852,"threshold_uncertainty_score":0.032933056},"labels":[],"label_agreement":null},{"id":"W2001887693","doi":"10.1109/icmsao.2013.6552647","title":"Generating maximal efficient faces for the multiobjective multicommodity flow problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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 Victoria","funders":"","keywords":"Adjacency list; Mathematical optimization; Flow (mathematics); Computer science; Flow network; Space (punctuation); Mathematics; Multi-commodity flow problem; Minimum-cost flow problem; Algorithm","score_opus":0.014141374820394039,"score_gpt":0.22395485196296563,"score_spread":0.2098134771425716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001887693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09861129,0.00017705507,0.8951776,0.00014363663,0.000025026733,0.000128538,0.00011354393,0.0001356405,0.005487626],"genre_scores_gemma":[0.4410187,0.00025894787,0.5559683,0.000053519838,0.00002293089,0.00036021395,0.0003270487,0.00008154654,0.0019087674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961615,0.00014796139,0.000011933144,0.000043600074,0.00012412795,0.000056230114],"domain_scores_gemma":[0.99922335,0.00055142207,0.000063523934,0.00004979968,0.000081894024,0.00002996866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092030666,0.0009227619,0.0007187216,0.000967584,0.00058318785,0.0006559435,0.00063872954,0.0009539211,0.002190979],"category_scores_gemma":[0.0021410019,0.0003610269,0.0009307075,0.0006551697,0.00047600653,0.0009665167,0.0010187271,0.0009510443,0.00023512461],"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.00005572065,0.00009586967,0.0005549074,0.0001059606,0.000023701046,0.00011182121,0.000088737186,0.90166944,0.0036824662,0.024776189,0.0009263115,0.0679089],"study_design_scores_gemma":[0.000010341385,0.00006746853,0.00013054516,0.000010969519,0.0000070663427,0.000042115684,0.000042573254,0.9805798,0.0020140181,0.01634738,0.00074015034,0.00000760441],"about_ca_topic_score_codex":0.00089282444,"about_ca_topic_score_gemma":0.0011917992,"teacher_disagreement_score":0.002190979,"about_ca_system_score_codex":0.00044967642,"about_ca_system_score_gemma":0.0007538922,"threshold_uncertainty_score":0.0073295236},"labels":[],"label_agreement":null},{"id":"W2003435156","doi":"10.1016/s0377-2217(00)00304-0","title":"PariTOP: A goal programming-based software for real estate assessment","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Québec Metro High Tech Park (Canada); Modellium (Canada); Université Laval","funders":"","keywords":"Computer science; Software; Software engineering; Programming language; Operations research; Mathematics","score_opus":0.07453186034599547,"score_gpt":0.3809128863409613,"score_spread":0.30638102599496586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003435156","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034664103,0.00009976365,0.8525268,0.00014108943,0.00006755718,0.00016068586,0.0020994674,0.13312301,0.008315181],"genre_scores_gemma":[0.085459985,0.0004457523,0.86607337,0.0003743494,0.000048110083,0.0009487692,0.0060491124,0.029152082,0.011448516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.000080221485,0.0000418482,0.00007288238,0.00015088076,0.000040007573],"domain_scores_gemma":[0.9988809,0.0006733211,0.000065513814,0.0001400589,0.0001794205,0.00006074098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011120299,0.001268507,0.0009360955,0.0010560548,0.00045793754,0.0017845689,0.0019953144,0.0009757938,0.032963276],"category_scores_gemma":[0.0035934746,0.0009773383,0.0012548706,0.00084422476,0.00047243925,0.0016921657,0.0016659375,0.0020375825,0.007857855],"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.0008624802,0.00047539148,0.0028586285,0.0019838018,0.00042984696,0.00056835683,0.00059356424,0.24364175,0.013558917,0.07007491,0.1791004,0.485852],"study_design_scores_gemma":[0.00021051469,0.00007337807,0.00053049164,0.00010674665,0.00008003521,0.00018568963,0.00004920534,0.8739313,0.011477281,0.035563186,0.0777311,0.000061089115],"about_ca_topic_score_codex":0.0029521172,"about_ca_topic_score_gemma":0.003666852,"teacher_disagreement_score":0.032963276,"about_ca_system_score_codex":0.0005873946,"about_ca_system_score_gemma":0.0012579102,"threshold_uncertainty_score":0.11027312},"labels":[],"label_agreement":null},{"id":"W2004862272","doi":"10.1016/j.amc.2008.06.034","title":"Post-optimality analysis of priority vectors derived from interval comparison matrices by lexicographic goal programming","year":2008,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Interval (graph theory); Ranking (information retrieval); Mathematics; Goal programming; Matrix (chemical analysis); Reciprocal; Interval arithmetic; Preference; Order (exchange); Linear programming; Mathematical optimization; Computer science; Combinatorics; Algorithm; Statistics; Artificial intelligence","score_opus":0.014982284959775017,"score_gpt":0.2513182937700201,"score_spread":0.23633600881024505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004862272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008248134,0.00007551339,0.9892812,0.00007197906,0.000019463496,0.00002845694,0.000031973646,0.00005862833,0.0021846178],"genre_scores_gemma":[0.4366328,0.000431802,0.5568647,0.00014993805,0.00008687411,0.00021320088,0.00033874623,0.00032129005,0.004960575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983612,0.00068508816,0.00008147281,0.00018233778,0.00048271,0.00020709496],"domain_scores_gemma":[0.99203837,0.0058858017,0.00043659421,0.0003166618,0.0011513284,0.00017114617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035040427,0.0007189689,0.0011566206,0.001355108,0.0005228865,0.0019019871,0.0011956852,0.00071065547,0.005917929],"category_scores_gemma":[0.0129312165,0.00076349056,0.0007569632,0.0015661913,0.0012434496,0.0031420519,0.001143138,0.0019690553,0.00052171136],"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.00021466486,0.0001152938,0.000552695,0.00021674667,0.000048292477,0.00006489273,0.00016668423,0.4774261,0.0021782971,0.45426238,0.0022478679,0.06250604],"study_design_scores_gemma":[0.000011943819,0.00005012104,0.00012243506,0.000016180666,0.000010219092,0.000012742218,0.000023878176,0.8906255,0.0008494873,0.10776948,0.0004979471,0.000010197187],"about_ca_topic_score_codex":0.0023094863,"about_ca_topic_score_gemma":0.00244191,"teacher_disagreement_score":0.005917929,"about_ca_system_score_codex":0.0010921344,"about_ca_system_score_gemma":0.0023158279,"threshold_uncertainty_score":0.019797444},"labels":[],"label_agreement":null},{"id":"W2008695031","doi":"10.3138/infor.50.3.106","title":"Portfolio Selection with Multiple Time Horizons: A Mean Variance—Stochastic Goal Programming Approach","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Portfolio; Time horizon; Mathematical optimization; Generalization; Horizon; Selection (genetic algorithm); Context (archaeology); Variance (accounting); Portfolio optimization; Stochastic programming; Arrow; Reliability (semiconductor); Modern portfolio theory; Computer science; Risk aversion (psychology); Mathematics; Econometrics; Mathematical economics; Economics; Expected utility hypothesis; Finance","score_opus":0.026234109610019873,"score_gpt":0.2757100540266441,"score_spread":0.24947594441662424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008695031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031230063,0.00019553452,0.99499005,0.00020615941,0.000015995762,0.0000197103,0.000009819897,0.000031206113,0.0014084448],"genre_scores_gemma":[0.5175385,0.0010366475,0.4759851,0.00034942324,0.00021764901,0.0004093525,0.00009386257,0.000102571255,0.004266918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963631,0.0021655294,0.00012212002,0.00035931222,0.00077090645,0.00021907226],"domain_scores_gemma":[0.99749374,0.0018381837,0.00022450734,0.00009449322,0.00023785335,0.00011126125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005295338,0.0015033007,0.0015950629,0.0011436647,0.00047058862,0.0018625833,0.0016460873,0.0018454309,0.0015381939],"category_scores_gemma":[0.006984984,0.0008132895,0.0014803833,0.0012815264,0.0010896298,0.001931631,0.0021009273,0.002217262,0.00020063079],"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.0000575326,0.00006490773,0.0004037857,0.00010301132,0.00016077202,0.0001099639,0.00008928602,0.84356344,0.00080378767,0.12456153,0.0006381572,0.029443864],"study_design_scores_gemma":[0.000009897324,0.000051833056,0.000082083054,0.00001755207,0.00002077543,0.000024761359,0.000010705468,0.9403953,0.00024297799,0.05853908,0.0005924076,0.000012696847],"about_ca_topic_score_codex":0.0010532893,"about_ca_topic_score_gemma":0.000789225,"teacher_disagreement_score":0.005295338,"about_ca_system_score_codex":0.0014109833,"about_ca_system_score_gemma":0.001563522,"threshold_uncertainty_score":0.028004766},"labels":[],"label_agreement":null},{"id":"W2011446372","doi":"10.1016/j.apm.2014.12.022","title":"An improved multi-choice goal programming approach for supplier selection problems","year":2014,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Goal programming; Purchasing; Mathematical optimization; Selection (genetic algorithm); Computer science; Operations research; Interval (graph theory); Minification; Linear programming; Control (management); Mathematics; Operations management; Artificial intelligence; Economics","score_opus":0.023833072171402844,"score_gpt":0.24282065346095896,"score_spread":0.21898758128955612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011446372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00302968,0.00011311023,0.9943295,0.00011649747,0.000040255843,0.00003355879,0.000034444405,0.00007484163,0.0022280735],"genre_scores_gemma":[0.21286078,0.00042526866,0.77722067,0.00023398377,0.00014960002,0.00040447302,0.00021717306,0.00021562769,0.00827244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830854,0.000834688,0.00006673344,0.0001683448,0.0004908216,0.0001308887],"domain_scores_gemma":[0.9985127,0.00093616446,0.00007161954,0.00007830152,0.00032707976,0.000074053416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029862004,0.0014017392,0.0021047154,0.0015419406,0.0006577248,0.0016730465,0.002548395,0.0019754234,0.0054910393],"category_scores_gemma":[0.004116553,0.0009635414,0.0019698902,0.0018501503,0.000696371,0.0016990039,0.002288757,0.002374181,0.00083504734],"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.000052073163,0.00012149719,0.00026126497,0.00012859982,0.00008345245,0.00007976191,0.0000731169,0.92497575,0.00079630385,0.033472136,0.0017274837,0.038228538],"study_design_scores_gemma":[0.000007590382,0.000018971441,0.000050453094,0.000006432935,0.000010334956,0.000008303239,0.0000049930754,0.99311924,0.000083132254,0.00622055,0.00046446628,0.0000055619607],"about_ca_topic_score_codex":0.005854333,"about_ca_topic_score_gemma":0.0052715805,"teacher_disagreement_score":0.005854333,"about_ca_system_score_codex":0.0011051554,"about_ca_system_score_gemma":0.0017228181,"threshold_uncertainty_score":0.018369377},"labels":[],"label_agreement":null},{"id":"W2014193286","doi":"10.1023/b:fodm.0000036866.18909.f1","title":"Matrix Games with Fuzzy Goals and Fuzzy Linear Programming Duality","year":2004,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Duality (order theory); Fuzzy logic; Dual (grammatical number); Mathematical optimization; Mathematics; Linear programming; Matrix (chemical analysis); Fuzzy number; Fuzzy associative matrix; Fuzzy set operations; Algebra over a field; Computer science; Fuzzy set; Artificial intelligence; Discrete mathematics; Pure mathematics","score_opus":0.013539111936895953,"score_gpt":0.2800384306364021,"score_spread":0.26649931869950616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014193286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024420684,0.0009244417,0.8933453,0.0036658898,0.0002562157,0.00010921865,0.0001521277,0.00006847477,0.07705775],"genre_scores_gemma":[0.8110012,0.0015237466,0.14882785,0.00084451603,0.00056070986,0.00051413797,0.00013865907,0.00006527934,0.036523964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970282,0.0018810026,0.00008447588,0.00022640101,0.0005696717,0.0002102361],"domain_scores_gemma":[0.9970245,0.0021529687,0.0002624115,0.000119378834,0.00025910558,0.0001816862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033691847,0.0014568674,0.0015335309,0.001047421,0.0011119277,0.00434145,0.0015295198,0.0025088405,0.005610254],"category_scores_gemma":[0.009123905,0.0007906329,0.0010356017,0.0012673989,0.0029801612,0.005298315,0.002597301,0.0031193974,0.0005717594],"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.0000211262,0.000019445095,0.000023882865,0.000026300782,0.000010154526,0.000030184205,0.000054014927,0.01440925,0.00011352391,0.9820696,0.00076728937,0.0024551784],"study_design_scores_gemma":[0.000017913839,0.000016514352,0.000024670906,0.000011862341,0.000005473462,0.000029752724,0.000029012217,0.06419072,0.00007421526,0.93432426,0.0012675634,0.00000801028],"about_ca_topic_score_codex":0.0019366376,"about_ca_topic_score_gemma":0.0016867715,"teacher_disagreement_score":0.005610254,"about_ca_system_score_codex":0.002500331,"about_ca_system_score_gemma":0.0017511477,"threshold_uncertainty_score":0.018768191},"labels":[],"label_agreement":null},{"id":"W2014231587","doi":"10.5539/mas.v3n9p84","title":"Optimal Programming Models for Portfolio Selection with Uncertain Chance Constraint","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Portfolio; Mathematical optimization; Constraint (computer-aided design); Maximization; Computer science; Selection (genetic algorithm); Profit maximization; Profit (economics); Order (exchange); Mathematics; Economics; Finance; Artificial intelligence; Microeconomics","score_opus":0.017524524380848817,"score_gpt":0.2416400442603717,"score_spread":0.22411551987952288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014231587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040752925,0.00079500995,0.98979914,0.00035076382,0.00004276988,0.000028786557,0.00007233489,0.000044680583,0.004791313],"genre_scores_gemma":[0.66490257,0.0054510506,0.3071756,0.00035448628,0.00039917245,0.00090412976,0.00053461146,0.00013931736,0.020139135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.00069971214,0.00005887334,0.00019882983,0.00029920423,0.00014460791],"domain_scores_gemma":[0.9989165,0.00073753594,0.00013155726,0.0000355051,0.00013314307,0.00004578692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021846646,0.0016015612,0.00143161,0.00085842155,0.00050583924,0.0022602999,0.0017036232,0.0016759966,0.0035414735],"category_scores_gemma":[0.0038831003,0.00074280053,0.0014208184,0.0016324369,0.0009932208,0.0020368805,0.0012213576,0.0024884169,0.0005363393],"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.000020019308,0.00001910941,0.00013879572,0.00006989271,0.000030442423,0.000068303285,0.000045524885,0.86464095,0.00019415922,0.12601857,0.00077251124,0.007981779],"study_design_scores_gemma":[0.0000061708324,0.000011748685,0.000037100002,0.000009245848,0.0000067104856,0.000012707016,0.000008887305,0.9444987,0.00005707591,0.05462909,0.00071554456,0.0000069576663],"about_ca_topic_score_codex":0.0042047426,"about_ca_topic_score_gemma":0.0027624352,"teacher_disagreement_score":0.0042047426,"about_ca_system_score_codex":0.0014976856,"about_ca_system_score_gemma":0.0014518636,"threshold_uncertainty_score":0.011847377},"labels":[],"label_agreement":null},{"id":"W2017428041","doi":"10.3329/ganit.v33i0.17660","title":"An Improved Decomposition Approach and its Computational Technique for Analyzing Primal-Dual Relationship in LP &amp; LFP Problems","year":2014,"lang":"en","type":"article","venue":"GANIT Journal of Bangladesh Mathematical Society","topic":"Optimization and Mathematical Programming","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":"Concordia University","funders":"","keywords":"Dual polyhedron; Dual (grammatical number); Linear programming; Decomposition; Decomposition method (queueing theory); Mathematical optimization; Computation; Computer science; Mathematics; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Chemistry","score_opus":0.021823145500673442,"score_gpt":0.27346529454738905,"score_spread":0.2516421490467156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017428041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096928445,0.00021492143,0.9965899,0.00009081012,0.00003980009,0.000019103307,0.000014781486,0.000026728216,0.0020347906],"genre_scores_gemma":[0.08955969,0.0013896927,0.9037184,0.00018068565,0.00025402612,0.00033087673,0.00011114185,0.00015747079,0.004297972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998955,0.00056694093,0.00004527185,0.00011521246,0.00024511758,0.00007250783],"domain_scores_gemma":[0.9989435,0.0006133432,0.00007445609,0.00010074149,0.00022611585,0.000041830575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025477684,0.0012983698,0.0009805968,0.0018055952,0.00086604495,0.0012558086,0.0010044996,0.0010764899,0.0051040202],"category_scores_gemma":[0.0049802894,0.0005179869,0.0018570253,0.0015532293,0.0012908698,0.0018801535,0.0017419636,0.0037879506,0.0013070282],"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.00007106356,0.000106039704,0.0008592768,0.00050822715,0.00008748865,0.00021512815,0.00036291336,0.21932527,0.006370795,0.6368451,0.006112103,0.12913647],"study_design_scores_gemma":[0.000011798155,0.000051080948,0.00014925768,0.000047708178,0.00002312153,0.000151841,0.000046868656,0.8704682,0.0011267428,0.120648704,0.0072564986,0.000018156989],"about_ca_topic_score_codex":0.0013505573,"about_ca_topic_score_gemma":0.0010958685,"teacher_disagreement_score":0.0051040202,"about_ca_system_score_codex":0.0006890794,"about_ca_system_score_gemma":0.0010214273,"threshold_uncertainty_score":0.017074704},"labels":[],"label_agreement":null},{"id":"W2022253420","doi":"10.1007/s10732-008-9093-z","title":"Special issue on mathematical contributions to metaheuristics editorial","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Heuristics; Optimization problem; Scheduling (production processes); Combinatorial optimization; Parallel metaheuristic; Embedding; Mathematics; Algorithm; Artificial intelligence; Meta-optimization","score_opus":0.012329317977126508,"score_gpt":0.2686253448139557,"score_spread":0.2562960268368292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022253420","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009430577,0.00713199,0.0004890772,0.018890483,0.97000396,0.000013093465,0.000039069702,0.00003463923,0.0033034584],"genre_scores_gemma":[0.00087117235,0.0038696125,0.00022667974,0.004251474,0.9826985,0.000014431325,0.000028810879,0.000058645914,0.007980733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960524,0.0007835884,0.00040865972,0.0005541151,0.0018585179,0.0003426417],"domain_scores_gemma":[0.9796443,0.0071976185,0.0016242922,0.00092562055,0.008149785,0.0024582963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004854917,0.0031149166,0.0032470978,0.006071091,0.0023244007,0.007908036,0.0029549147,0.007533431,0.02461628],"category_scores_gemma":[0.017256172,0.0008845301,0.0023927677,0.0023688076,0.0019135872,0.0044997213,0.0019562878,0.007950471,0.009692174],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007189159,0.00003059626,0.000056056542,0.00033020842,0.000042748914,0.00010144238,0.000013616623,0.00017312089,0.00019256312,0.0023352294,0.9848577,0.01179486],"study_design_scores_gemma":[0.00008555739,0.000078329846,0.00038105538,0.00037585438,0.000111465466,0.00023562406,0.000033048796,0.0009441965,0.00031132347,0.007486671,0.9899311,0.000025709136],"about_ca_topic_score_codex":0.0005892726,"about_ca_topic_score_gemma":0.0012970818,"teacher_disagreement_score":0.02461628,"about_ca_system_score_codex":0.0025584481,"about_ca_system_score_gemma":0.002025577,"threshold_uncertainty_score":0.08234966},"labels":[],"label_agreement":null},{"id":"W2022952894","doi":"10.3138/infor.50.3.134","title":"A Recourse Goal Programming Approach for the Portfolio Selection Problem","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Portfolio; Selection (genetic algorithm); Mathematical optimization; Stochastic programming; Goal programming; Computer science; Index (typography); Dynamic programming; Portfolio optimization; Modern portfolio theory; Post-modern portfolio theory; Expected return; Actuarial science; Operations research; Econometrics; Replicating portfolio; Economics; Mathematics; Financial economics; Artificial intelligence","score_opus":0.05204912035603266,"score_gpt":0.32489149592884015,"score_spread":0.2728423755728075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022952894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024637633,0.00024409061,0.9920006,0.0003594213,0.000023498344,0.00002906602,0.00004298544,0.00006161133,0.0047750096],"genre_scores_gemma":[0.34481642,0.0012236583,0.6344761,0.00041594735,0.00017727482,0.0005847607,0.00027208967,0.00016289091,0.01787082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850166,0.00087123946,0.00003460114,0.00015440659,0.00034311906,0.000094911295],"domain_scores_gemma":[0.9993387,0.00039933377,0.000057904104,0.000028082135,0.00013237998,0.000043683227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018069184,0.0012479092,0.0009802697,0.0009062307,0.00037115856,0.0017241422,0.0013493879,0.00125564,0.0042801364],"category_scores_gemma":[0.002084462,0.0004420916,0.00094273227,0.001097518,0.0009208153,0.00097003754,0.0012875943,0.002299095,0.00062693283],"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.00002548501,0.00009149512,0.00015550137,0.000096160154,0.000060486527,0.000121208235,0.00008364927,0.7481795,0.0006603526,0.21965231,0.0023126865,0.02856119],"study_design_scores_gemma":[0.000008741333,0.000026301428,0.00003854305,0.000019353807,0.0000074783775,0.000017218443,0.000010840962,0.9404419,0.00014799698,0.056727365,0.0025478196,0.0000065131157],"about_ca_topic_score_codex":0.004099164,"about_ca_topic_score_gemma":0.003910391,"teacher_disagreement_score":0.0042801364,"about_ca_system_score_codex":0.0016421825,"about_ca_system_score_gemma":0.001762915,"threshold_uncertainty_score":0.014318526},"labels":[],"label_agreement":null},{"id":"W2030995871","doi":"10.1007/s13675-014-0020-9","title":"Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design","year":2014,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":41,"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":"Column generation; Mathematics; Mathematical optimization; Lagrangian relaxation; Flow network; Fixed charge; Relaxation (psychology); Scale (ratio); Flow (mathematics)","score_opus":0.018767236074810463,"score_gpt":0.23482112105970493,"score_spread":0.21605388498489447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030995871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030669492,0.00039552923,0.96275353,0.00029532096,0.00003271345,0.00020684332,0.00012896635,0.0005073486,0.005010242],"genre_scores_gemma":[0.34015143,0.00028848273,0.65632707,0.00008181186,0.00003386817,0.00049181306,0.00032489529,0.00016222961,0.0021383963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.0002571696,0.0000141477685,0.00005892341,0.00011040019,0.00006357265],"domain_scores_gemma":[0.99869823,0.0009976563,0.00007982996,0.00008922278,0.000079238336,0.000055644046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876864,0.0010627173,0.000929559,0.0006434114,0.0007029367,0.0009004608,0.0011209506,0.0009930624,0.0049227583],"category_scores_gemma":[0.002893714,0.00052930793,0.000640566,0.0013792207,0.0007076306,0.0007682139,0.00083868485,0.001374307,0.0003990101],"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.000043769793,0.00006223494,0.00018493793,0.00007285264,0.00001513674,0.000040925832,0.000022772054,0.9471849,0.00061078114,0.0072113085,0.0012325875,0.043317653],"study_design_scores_gemma":[0.00002027055,0.00002923991,0.000039066734,0.0000043370114,0.0000040199143,0.000010766584,0.000006816515,0.9928804,0.0002730568,0.006290868,0.00043835927,0.0000028383934],"about_ca_topic_score_codex":0.006008831,"about_ca_topic_score_gemma":0.006972932,"teacher_disagreement_score":0.006008831,"about_ca_system_score_codex":0.0013439116,"about_ca_system_score_gemma":0.0016570708,"threshold_uncertainty_score":0.016468227},"labels":[],"label_agreement":null},{"id":"W2033740771","doi":"10.1007/s10732-010-9132-4","title":"Special issue on recent advances in metaheuristics","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Metaheuristic; Computer science; Artificial intelligence","score_opus":0.008997029815665738,"score_gpt":0.2597852151168496,"score_spread":0.25078818530118385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033740771","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021568525,0.27703464,0.0202017,0.022853646,0.6059904,0.00015096976,0.0006025537,0.0005178959,0.07049143],"genre_scores_gemma":[0.010434796,0.2513964,0.015071242,0.008698065,0.5699633,0.00014936617,0.0018668164,0.00073018344,0.14168988],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990885,0.00015689246,0.00009456788,0.00014583582,0.0004264023,0.00008779066],"domain_scores_gemma":[0.99520665,0.0018432772,0.00032372313,0.00031997086,0.0017478424,0.00055841065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124377,0.0013485556,0.002397138,0.0030352555,0.0007250869,0.0038825376,0.0018166241,0.0017552803,0.04915131],"category_scores_gemma":[0.0048552374,0.00041985678,0.00078117626,0.0042834585,0.00064255873,0.0029936715,0.0010712608,0.0027345836,0.0198429],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115603114,0.00011805879,0.00021101606,0.0012896619,0.00007557723,0.00011118174,0.000021669517,0.0008362801,0.00094575115,0.005607108,0.79210466,0.19856346],"study_design_scores_gemma":[0.000026254776,0.0001016202,0.00048355115,0.00031905714,0.00007499231,0.00029868862,0.000032152533,0.0015608701,0.00057547673,0.008666726,0.98784095,0.000019639141],"about_ca_topic_score_codex":0.00064397184,"about_ca_topic_score_gemma":0.0018353314,"teacher_disagreement_score":0.04915131,"about_ca_system_score_codex":0.0008229206,"about_ca_system_score_gemma":0.0011155976,"threshold_uncertainty_score":0.16442746},"labels":[],"label_agreement":null},{"id":"W2035108481","doi":"10.1287/mnsc.1070.0848","title":"Interactive Coordination of Objective Decompositions in Multiobjective Programming","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Automotive Research Center; University of Michigan","keywords":"Mathematical optimization; Decision maker; Selection (genetic algorithm); Decomposition; Multiobjective programming; Computer science; Multi-objective optimization; Sensitivity (control systems); Portfolio; Linear programming; Function (biology); Mathematics; Operations research; Artificial intelligence; Economics; Engineering","score_opus":0.009861900291178453,"score_gpt":0.2510570572414315,"score_spread":0.24119515695025306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035108481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040973485,0.000140609,0.99400926,0.000056418863,0.00001219291,0.000039264713,0.0000070512588,0.00007069657,0.001567075],"genre_scores_gemma":[0.24829946,0.0003471544,0.74911565,0.000076899676,0.00006175669,0.00044976408,0.00005495295,0.00013922874,0.0014551935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945312,0.0035898404,0.00020663523,0.00042918834,0.00091695844,0.0003261579],"domain_scores_gemma":[0.9938864,0.0046082307,0.00047367165,0.0005204979,0.00031907865,0.00019205731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007316743,0.001643066,0.0013837254,0.0014766769,0.00077417574,0.001841679,0.0014774083,0.0009811785,0.0025180564],"category_scores_gemma":[0.010532584,0.00085655705,0.0014589444,0.0014521152,0.0021350281,0.0023559167,0.0035490186,0.0020625894,0.00048391547],"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.00015253857,0.0001107512,0.00045299187,0.0001812218,0.00011610169,0.00013220943,0.00045753413,0.7605311,0.004064669,0.13998024,0.00078476075,0.09303588],"study_design_scores_gemma":[0.000046674773,0.00007397072,0.00012540614,0.000035389497,0.000024130204,0.00003118645,0.000057269925,0.90135723,0.0021012796,0.09388692,0.002237496,0.000023144614],"about_ca_topic_score_codex":0.0012995135,"about_ca_topic_score_gemma":0.0012621821,"teacher_disagreement_score":0.007316743,"about_ca_system_score_codex":0.001179301,"about_ca_system_score_gemma":0.0012346643,"threshold_uncertainty_score":0.038695097},"labels":[],"label_agreement":null},{"id":"W2035305502","doi":"10.1057/jors.2012.111","title":"An interval-coefficient fuzzy binary linear programming, the solution, and its application under uncertainties","year":2012,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Interval (graph theory); Mathematical optimization; Fuzzy logic; Binary number; Mathematics; Linear programming; Fuzzy number; Computer science; Fuzzy set; Applied mathematics; Artificial intelligence","score_opus":0.05726540508139351,"score_gpt":0.3608952675132997,"score_spread":0.3036298624319062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035305502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006919087,0.00027748986,0.9885908,0.00024843877,0.000023411993,0.00002079797,0.00002081829,0.000025397389,0.003873692],"genre_scores_gemma":[0.57163084,0.001365025,0.42117086,0.00015028211,0.00011234815,0.00029371242,0.000117264826,0.00005944796,0.005100132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.00047947295,0.000037777652,0.00014670887,0.00027752147,0.000100120524],"domain_scores_gemma":[0.999041,0.0006058518,0.00010586587,0.000027848871,0.00017680957,0.00004254447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017341479,0.00083333073,0.00091737375,0.0007781309,0.00062435394,0.0015528254,0.0010323491,0.0013103593,0.0016974766],"category_scores_gemma":[0.0050631175,0.00047711426,0.00071510737,0.0014573405,0.0010360127,0.0015171871,0.0013475682,0.0018112315,0.00016334318],"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.000045744855,0.00002206346,0.0002219296,0.00015981757,0.000016710614,0.00007084197,0.00011793744,0.8356401,0.0009949282,0.13621062,0.0010007105,0.025498616],"study_design_scores_gemma":[0.0000069748357,0.000019641548,0.000046361223,0.000018971923,0.000004563669,0.000018770072,0.000022829663,0.9636798,0.00030960716,0.035151783,0.00071347837,0.0000073296483],"about_ca_topic_score_codex":0.00366949,"about_ca_topic_score_gemma":0.0014216994,"teacher_disagreement_score":0.00366949,"about_ca_system_score_codex":0.0011290422,"about_ca_system_score_gemma":0.0014118267,"threshold_uncertainty_score":0.009171188},"labels":[],"label_agreement":null},{"id":"W2037044553","doi":"10.1007/s00170-012-4469-5","title":"Model and algorithm for fuzzy joint replenishment and delivery scheduling without explicit membership function","year":2012,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Mathematical optimization; Fuzzy logic; Piecewise; Computer science; Fuzzy number; Scheduling (production processes); Ranking (information retrieval); Fuzzy set; Algorithm; Mathematics","score_opus":0.023828985167893717,"score_gpt":0.25053684613483745,"score_spread":0.22670786096694373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037044553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005583063,0.000104600935,0.99260277,0.00009975934,0.000032881486,0.00004305224,0.000043150812,0.00019381908,0.0012969011],"genre_scores_gemma":[0.47624704,0.00032001297,0.5157009,0.00011095614,0.000060898117,0.00045220222,0.00023830155,0.000109931934,0.006759722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958986,0.00007756711,0.000023140248,0.000112037706,0.00012867783,0.00006876837],"domain_scores_gemma":[0.9994486,0.00029690217,0.0000509583,0.000032294094,0.00013936707,0.000031856947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011902824,0.000804494,0.0018751052,0.00071415975,0.0008466722,0.0015307311,0.0024077513,0.0019733189,0.004267629],"category_scores_gemma":[0.0018758452,0.00069069385,0.0009587261,0.0009066599,0.0007002592,0.0014326703,0.0012840262,0.0015357996,0.00070675707],"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.000061285566,0.000028445313,0.00011697865,0.000038244838,0.000015610232,0.00002580493,0.000031683023,0.9664414,0.0007107951,0.009478136,0.0004506788,0.022600947],"study_design_scores_gemma":[0.000009815251,0.00000804476,0.000017964287,0.0000023161242,0.000003539436,0.000005796413,0.0000029830235,0.99796426,0.00012593907,0.001704405,0.00015185212,0.0000031887218],"about_ca_topic_score_codex":0.017629882,"about_ca_topic_score_gemma":0.009591045,"teacher_disagreement_score":0.017629882,"about_ca_system_score_codex":0.0019596117,"about_ca_system_score_gemma":0.002919533,"threshold_uncertainty_score":0.035054564},"labels":[],"label_agreement":null},{"id":"W2039870850","doi":"10.2139/ssrn.1360248","title":"Polynomial Goal Programming and the Implicit Higher Moment Preferences of U.S. Institutional Investors in Hedge Funds","year":2009,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hedge fund; Institutional investor; Alternative beta; Moment (physics); Business; Hedge accounting; Economics; Mathematics; Global assets under management; Financial economics; Accounting; Finance; Open-end fund; Corporate governance; Physics","score_opus":0.007924493455207123,"score_gpt":0.22009507733110228,"score_spread":0.21217058387589516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039870850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8496732,0.0008147497,0.116741076,0.0052690473,0.000032326716,0.000020708285,0.00013684502,0.000052889587,0.027259171],"genre_scores_gemma":[0.9959304,0.0001552456,0.0022667504,0.000053953914,0.000011206297,0.000005264703,0.00001964416,0.0000047074186,0.0015528927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00031466052,0.000022908082,0.000058139107,0.000067942536,0.00010816446],"domain_scores_gemma":[0.9970414,0.0019454529,0.00048388273,0.00014839727,0.00019620899,0.0001846554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018660333,0.00020438158,0.00037091927,0.00022180242,0.00035065835,0.0017983845,0.00033480354,0.0009852283,0.0026924207],"category_scores_gemma":[0.011140589,0.00017406218,0.00024184053,0.000322909,0.0009303972,0.0022647767,0.000758943,0.0015625918,0.00019517736],"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.0007059853,0.00012021447,0.0085147815,0.0000778755,0.000063501,0.00020994488,0.0006616716,0.09770647,0.001272384,0.85872465,0.002340885,0.029601675],"study_design_scores_gemma":[0.000063301566,0.00008106429,0.003953872,0.000020770702,0.00002083534,0.000050407794,0.00044371365,0.19625618,0.0005301696,0.7970081,0.0015528331,0.000018700648],"about_ca_topic_score_codex":0.0023900182,"about_ca_topic_score_gemma":0.0035167534,"teacher_disagreement_score":0.0026924207,"about_ca_system_score_codex":0.0010747986,"about_ca_system_score_gemma":0.00079099805,"threshold_uncertainty_score":0.009868622},"labels":[],"label_agreement":null},{"id":"W2041943131","doi":"10.5267/j.msl.2011.05.005","title":"A BSC method for supplier selection strategy using TOPSIS and VIKOR: A case study of part maker industry","year":2011,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"TOPSIS; VIKOR method; Selection (genetic algorithm); Computer science; Operations research; Supplier evaluation; Operations management; Business; Process management; Supply chain management; Supply chain; Mathematics; Marketing; Economics; Artificial intelligence","score_opus":0.06245540750417248,"score_gpt":0.3049574885431869,"score_spread":0.2425020810390144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041943131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51622015,0.00044917502,0.4586205,0.00084078073,0.0000630889,0.0011453488,0.0005559519,0.00033941615,0.021765603],"genre_scores_gemma":[0.69885105,0.00030106102,0.2955228,0.000031124473,0.0000070185947,0.0005477526,0.0002458881,0.000026288664,0.004467049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980782,0.0012343939,0.00006904734,0.00011239943,0.00043106097,0.000074949894],"domain_scores_gemma":[0.99823284,0.0011814145,0.00008254193,0.000083118415,0.00036316022,0.000056872264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025959783,0.0007842088,0.0007325002,0.0018847567,0.0013475156,0.0013426509,0.0011133458,0.0014177604,0.004065403],"category_scores_gemma":[0.003161681,0.0003968645,0.0008479773,0.0032426529,0.00056020037,0.00077558606,0.00060803536,0.00074800587,0.00038743272],"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.00067687134,0.0011235503,0.0139922,0.0011208012,0.00022561506,0.004092817,0.0038878834,0.5606436,0.010362872,0.041121792,0.0062564053,0.3564956],"study_design_scores_gemma":[0.00012179557,0.00034166154,0.0035977545,0.00007622063,0.00006877612,0.00037199634,0.002298754,0.98102677,0.0034016126,0.0037921667,0.00483247,0.00006991317],"about_ca_topic_score_codex":0.022238338,"about_ca_topic_score_gemma":0.02846743,"teacher_disagreement_score":0.022238338,"about_ca_system_score_codex":0.0020458184,"about_ca_system_score_gemma":0.0023059445,"threshold_uncertainty_score":0.044217825},"labels":[],"label_agreement":null},{"id":"W2043472740","doi":"10.3926/jiem.451","title":"Workforce scheduling: A new model incorporating human factors","year":2012,"lang":"en","type":"article","venue":"Journal of Industrial Engineering and Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"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":"Workforce; Overtime; Human resources; Originality; Workforce management; Scheduling (production processes); Human resource management; Engineering; Operations management; Operations research; Computer science; Labour economics; Economics; Knowledge management; Psychology; Management; Social psychology","score_opus":0.06319480430748918,"score_gpt":0.25411539664196403,"score_spread":0.19092059233447484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043472740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073691346,0.0010829053,0.89641666,0.0017674868,0.00051208766,0.00037311597,0.0012050283,0.00041991225,0.024531437],"genre_scores_gemma":[0.86758757,0.0012594438,0.091583475,0.00047224172,0.00028747582,0.0009487955,0.00079876557,0.00016887265,0.03689327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.0003745011,0.000043010285,0.0002850382,0.00017202458,0.00023464877],"domain_scores_gemma":[0.9983699,0.00083506893,0.0002745798,0.0000489452,0.00026499396,0.00020653031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017812693,0.0016259622,0.0014979658,0.0009262599,0.0008117607,0.0020456004,0.0030033847,0.002619741,0.009730148],"category_scores_gemma":[0.0033956973,0.0009679036,0.0017486986,0.0010846391,0.0008141315,0.0014551268,0.0013864032,0.002368944,0.0011201911],"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.00005941241,0.000053916174,0.0005074314,0.000049575356,0.000028392542,0.00006822804,0.00006339999,0.99149644,0.00028111355,0.003054427,0.00053157355,0.0038060313],"study_design_scores_gemma":[0.000018758614,0.000042823,0.00016900411,0.000010462949,0.000015272959,0.000011137996,0.00002166223,0.99769324,0.00003838885,0.0013638103,0.0006079774,0.0000074077193],"about_ca_topic_score_codex":0.02318501,"about_ca_topic_score_gemma":0.0139309745,"teacher_disagreement_score":0.02318501,"about_ca_system_score_codex":0.0022527506,"about_ca_system_score_gemma":0.0030927146,"threshold_uncertainty_score":0.04610014},"labels":[],"label_agreement":null},{"id":"W2046861175","doi":"10.1007/s10700-006-0021-0","title":"Acceptable optimality in linear fractional programming with fuzzy coefficients","year":2006,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear programming; Mathematical optimization; Fuzzy logic; Fractional programming; Linear-fractional programming; Value (mathematics); Computer science; Nonlinear programming; Nonlinear system; Artificial intelligence; Statistics","score_opus":0.011760272251597197,"score_gpt":0.2648410122389339,"score_spread":0.2530807399873367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046861175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054175455,0.0008277535,0.9119652,0.0012905287,0.00011774936,0.00004654948,0.00005686612,0.00005120033,0.031468682],"genre_scores_gemma":[0.8120926,0.0008580371,0.17745256,0.00022859909,0.0001621386,0.00023333155,0.0000803722,0.00012762904,0.008764675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961926,0.0021293054,0.00014800929,0.00025472356,0.0009787618,0.00029663648],"domain_scores_gemma":[0.98992693,0.008573522,0.0003313963,0.00028623207,0.0007103187,0.00017165189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006145951,0.0008846999,0.0012994672,0.0012476578,0.0013526401,0.0038679487,0.0013019659,0.0015585833,0.002511263],"category_scores_gemma":[0.027201016,0.0008003158,0.00081562746,0.0016350315,0.0037944068,0.00340528,0.002045363,0.0033620414,0.00023905215],"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.000040396117,0.000018265418,0.00010580407,0.000058577352,0.000010527309,0.000046029265,0.00023290119,0.096379474,0.0003507253,0.8959503,0.00051040325,0.006296593],"study_design_scores_gemma":[0.000014002208,0.0000222693,0.000052248808,0.000027863663,0.0000072284183,0.000017711815,0.000058048558,0.18698247,0.00034371793,0.81163687,0.00082777586,0.00000984182],"about_ca_topic_score_codex":0.0035297307,"about_ca_topic_score_gemma":0.002861866,"teacher_disagreement_score":0.006145951,"about_ca_system_score_codex":0.0025086196,"about_ca_system_score_gemma":0.0019424316,"threshold_uncertainty_score":0.032503307},"labels":[],"label_agreement":null},{"id":"W2046874201","doi":"10.5539/jmr.v1n1p31","title":"An Improved Graph Method for Linear Goal Programming","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Southwestern University of Finance and Economics","keywords":"Linear programming; Mathematics; Goal programming; Graph; Mathematical optimization; Discrete mathematics","score_opus":0.0699535536938029,"score_gpt":0.43169864414949793,"score_spread":0.36174509045569503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046874201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095258857,0.0001652818,0.9944892,0.00010821143,0.000071181865,0.000035683424,0.00004460279,0.00035731576,0.0037759705],"genre_scores_gemma":[0.06686821,0.0006722939,0.9203961,0.00023905672,0.00016184768,0.00023983883,0.00031831185,0.0003884324,0.010715981],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990395,0.00034407756,0.000029974237,0.00016536217,0.0003604358,0.00006071025],"domain_scores_gemma":[0.9995509,0.00021034415,0.000024591664,0.000048828115,0.00013759585,0.000027740854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006853519,0.0010035445,0.00065230904,0.0013314817,0.0005195856,0.0008794742,0.0014005691,0.0007455105,0.008882196],"category_scores_gemma":[0.001430045,0.00033166638,0.000988919,0.0017362027,0.00069199543,0.0017533547,0.001154346,0.0018883384,0.0017772559],"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.00012402482,0.00015850646,0.00031849416,0.0004809015,0.00009528676,0.0001624592,0.00019873223,0.17829344,0.008389891,0.39404172,0.022041978,0.3956945],"study_design_scores_gemma":[0.00006484768,0.00010025575,0.00019299514,0.00004087256,0.000045780947,0.00010917617,0.000034093162,0.8257494,0.0027623917,0.13214368,0.038713258,0.000043318],"about_ca_topic_score_codex":0.00472426,"about_ca_topic_score_gemma":0.0050709182,"teacher_disagreement_score":0.008882196,"about_ca_system_score_codex":0.00084934116,"about_ca_system_score_gemma":0.0013572075,"threshold_uncertainty_score":0.029713929},"labels":[],"label_agreement":null},{"id":"W2047707165","doi":"10.1007/s10957-007-9265-2","title":"Merit-Function Piecewise SQP Algorithm for Mathematical Programs with Equilibrium Constraints","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Piecewise; Theory of computation; Mathematics; Sequential quadratic programming; Mathematical optimization; Complementarity theory; Constraint (computer-aided design); Complementarity (molecular biology); Stationary point; Point (geometry); Function (biology); Independence (probability theory); Piecewise linear function; Algorithm; Quadratic programming; Nonlinear system; Mathematical analysis","score_opus":0.008362994103040132,"score_gpt":0.2365910185940447,"score_spread":0.22822802449100454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047707165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007408013,0.00016230902,0.9897579,0.00014857839,0.00002750991,0.00002084402,0.000027453088,0.00028618184,0.0021611254],"genre_scores_gemma":[0.21997409,0.00021067348,0.7751251,0.0000851975,0.00003398982,0.00016203424,0.000119521355,0.00026139707,0.0040281503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.00011381073,0.000010731516,0.000025451996,0.00007860954,0.000030738353],"domain_scores_gemma":[0.99895954,0.00069588586,0.00006525526,0.000057804304,0.00018286827,0.000038590155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012130695,0.0006628686,0.0011914342,0.0007314079,0.00051831064,0.00085470994,0.0012249337,0.0013492749,0.003933391],"category_scores_gemma":[0.004082442,0.0005622113,0.00049021235,0.0009923162,0.00055888994,0.00097617734,0.0009552352,0.0013930226,0.0005901778],"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.00013850129,0.00005448938,0.00033925782,0.00015849172,0.000031787833,0.000055415123,0.00006712505,0.8119074,0.0018564115,0.041777495,0.0025872055,0.14102629],"study_design_scores_gemma":[0.000010837179,0.0000142528015,0.00003385161,0.0000067289584,0.0000035825744,0.0000094081,0.0000040903515,0.9940211,0.00024244635,0.005078037,0.0005727297,0.0000029151745],"about_ca_topic_score_codex":0.0030378005,"about_ca_topic_score_gemma":0.0032215822,"teacher_disagreement_score":0.003933391,"about_ca_system_score_codex":0.0008582175,"about_ca_system_score_gemma":0.001389544,"threshold_uncertainty_score":0.01315856},"labels":[],"label_agreement":null},{"id":"W2056235974","doi":"10.1007/s10479-012-1168-4","title":"A cardinality constrained stochastic goal programming model with satisfaction functions for venture capital investment decision making","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Venture capital; Portfolio; Investment (military); Cardinality (data modeling); Social venture capital; Theory of computation; Business; Capital investment; Resource (disambiguation); Selection (genetic algorithm); Goal programming; Economics; Microeconomics; Computer science; Finance; Industrial organization; Operations research; Mathematics; Artificial intelligence","score_opus":0.12974704198774223,"score_gpt":0.4075030370474891,"score_spread":0.27775599505974685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056235974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053077795,0.00059820974,0.934019,0.0021622353,0.000118367796,0.0001722895,0.00070912385,0.00016585265,0.008977084],"genre_scores_gemma":[0.85795885,0.00079029775,0.12709156,0.00034061543,0.00018612195,0.0006066009,0.0006773052,0.00010109725,0.012247552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965198,0.0020534205,0.00012993436,0.00047584495,0.0004038827,0.00041702174],"domain_scores_gemma":[0.9928844,0.0054635853,0.0005723446,0.0001968526,0.00044875263,0.0004340917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004583159,0.0016553759,0.003098135,0.0011283644,0.0007840519,0.0035864897,0.0030249301,0.0037405274,0.0049684364],"category_scores_gemma":[0.010594694,0.0016611068,0.0018371325,0.0020918658,0.0018471183,0.0033808448,0.0026300838,0.004272275,0.00047581372],"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.00007660946,0.00006885918,0.0003401277,0.000065787586,0.000058335903,0.00010987265,0.000068487316,0.9100334,0.00023301468,0.08427625,0.00096761313,0.0037015283],"study_design_scores_gemma":[0.000015497195,0.000019080573,0.00006599484,0.00000836982,0.000010586125,0.00000967508,0.000012838526,0.98042977,0.000038939335,0.019157607,0.00022311993,0.000008478071],"about_ca_topic_score_codex":0.0096278805,"about_ca_topic_score_gemma":0.0066730864,"teacher_disagreement_score":0.0096278805,"about_ca_system_score_codex":0.0028188745,"about_ca_system_score_gemma":0.0024847207,"threshold_uncertainty_score":0.024238408},"labels":[],"label_agreement":null},{"id":"W2059718457","doi":"10.4236/jmf.2012.21012","title":"Analytical Hierarchy Process and Goal Programming Approach for Asset Allocation","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Finance","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Laurentian University; Business Development Bank of Canada; Université du Québec à Montréal","funders":"","keywords":"Asset allocation; Goal programming; Portfolio; Scope (computer science); Variance (accounting); Hierarchy; Analytic hierarchy process; Project portfolio management; Financial market; Economics; Replicating portfolio; Black–Litterman model; Asset (computer security); Actuarial science; Modern portfolio theory; Computer science; Portfolio optimization; Financial economics; Operations research; Finance; Mathematical economics; Mathematics; Project management; Accounting","score_opus":0.019298364663407973,"score_gpt":0.27828319852628924,"score_spread":0.2589848338628813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059718457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016325403,0.00016004471,0.9959407,0.00016863967,0.000013430804,0.000041287534,0.000018281089,0.000032929944,0.0019920806],"genre_scores_gemma":[0.14418778,0.00076804624,0.8524283,0.00012460112,0.00008147714,0.0005492734,0.000087753,0.0000379858,0.0017346857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968867,0.0018497825,0.000106637635,0.00020930749,0.0007825006,0.0001650378],"domain_scores_gemma":[0.99809057,0.001380906,0.00012567111,0.000058677557,0.0002668742,0.00007736527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037804134,0.0011743412,0.0011715959,0.0016534062,0.00085610454,0.002180438,0.0012496285,0.001069727,0.001999886],"category_scores_gemma":[0.0049776244,0.00051088206,0.001522892,0.0022843252,0.0014697816,0.0013108511,0.0018292633,0.0025090792,0.00034895405],"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.000034197663,0.000119833996,0.0004925147,0.00024548837,0.00013095708,0.00008684791,0.00032062482,0.64071244,0.00082232815,0.28927848,0.0015155193,0.06624076],"study_design_scores_gemma":[0.00001635108,0.0000507748,0.00011652055,0.000024805653,0.000019244428,0.000016062922,0.000042524793,0.86166173,0.00023662712,0.13583696,0.0019627502,0.000015514974],"about_ca_topic_score_codex":0.008338522,"about_ca_topic_score_gemma":0.008284751,"teacher_disagreement_score":0.008338522,"about_ca_system_score_codex":0.0022463365,"about_ca_system_score_gemma":0.003978285,"threshold_uncertainty_score":0.019992948},"labels":[],"label_agreement":null},{"id":"W2064042079","doi":"10.5539/ijsp.v4n2p95","title":"Comparative Study of the Quick Convergent Inflow Algorithm (QCIA) and the Modified Quick Convergent Inflow Algorithm (MQCIA)","year":2015,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Inflow; Mathematics; Point (geometry); Set (abstract data type); Mathematical optimization; Computer science","score_opus":0.034473415459057376,"score_gpt":0.2870876548848006,"score_spread":0.25261423942574324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064042079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12269189,0.00096726284,0.8676639,0.00020019503,0.00011113643,0.00017257858,0.000048168753,0.0014585063,0.0066862754],"genre_scores_gemma":[0.4526716,0.00038017385,0.54390496,0.000121255434,0.000033898115,0.0002497895,0.00016696539,0.00028171192,0.002189644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852353,0.000660653,0.00010357404,0.00012547147,0.00046795027,0.0001188943],"domain_scores_gemma":[0.98936826,0.007452881,0.00057303853,0.00054338336,0.0018181695,0.00024422424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051339576,0.00074792566,0.0011098619,0.001315198,0.00040738258,0.0013305474,0.0009588576,0.0013958545,0.0018822305],"category_scores_gemma":[0.014401972,0.00029892274,0.00055726146,0.0009865297,0.0007486491,0.0012048486,0.00070476386,0.00093312387,0.00040753075],"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.0013227946,0.00025719908,0.0034756216,0.00035286078,0.00013983964,0.00011177786,0.0002276596,0.7026901,0.0056916024,0.012553696,0.0015058272,0.27167094],"study_design_scores_gemma":[0.000049773247,0.00019811567,0.00052682194,0.000012996168,0.000016534508,0.000039380448,0.000022592172,0.99526817,0.0025103074,0.0007142003,0.0006290776,0.000012024604],"about_ca_topic_score_codex":0.0034639207,"about_ca_topic_score_gemma":0.002687372,"teacher_disagreement_score":0.0051339576,"about_ca_system_score_codex":0.0007156644,"about_ca_system_score_gemma":0.001983591,"threshold_uncertainty_score":0.027151287},"labels":[],"label_agreement":null},{"id":"W2065073968","doi":"10.5539/mas.v7n6p90","title":"On Solving Linear Fractional Programming Problems","year":2013,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"VIT University","keywords":"Fractional programming; Linear programming; Simplex algorithm; Decomposition method (queueing theory); Linear-fractional programming; Mathematical optimization; Decomposition; Mathematics; Computer science; Fuzzy logic; Algorithm; Nonlinear programming; Nonlinear system; Discrete mathematics; Artificial intelligence","score_opus":0.013430967590885997,"score_gpt":0.2232066346652236,"score_spread":0.20977566707433762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065073968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001503683,0.000588815,0.99355316,0.00008158322,0.00004806373,0.00002782323,0.000012936389,0.000054926742,0.0041290303],"genre_scores_gemma":[0.120699085,0.0044355975,0.86348337,0.00021002431,0.00028311714,0.00039254758,0.00017371224,0.00013513521,0.010187364],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896204,0.0004052621,0.000041680192,0.00012317287,0.0004150497,0.000052826457],"domain_scores_gemma":[0.99964714,0.00019114009,0.000025722024,0.00003133767,0.000092163835,0.000012536821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283322,0.0011368531,0.001351359,0.00088390027,0.00071746035,0.0010814597,0.0008643389,0.0008965458,0.0032739735],"category_scores_gemma":[0.001912685,0.00029900225,0.0011549437,0.0014812534,0.0007939258,0.0014128091,0.0013047577,0.001885892,0.0007353503],"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.000106735315,0.00009741346,0.00036280815,0.0013752016,0.00012286863,0.00029277694,0.00036816925,0.35324687,0.023259312,0.25532785,0.005466693,0.35997334],"study_design_scores_gemma":[0.000030810123,0.00009286141,0.00014644176,0.00009339188,0.00003264642,0.00021599862,0.00005379765,0.9090177,0.0057780887,0.06394226,0.020561727,0.000034230387],"about_ca_topic_score_codex":0.0013803737,"about_ca_topic_score_gemma":0.00085488707,"teacher_disagreement_score":0.0032739735,"about_ca_system_score_codex":0.00043736194,"about_ca_system_score_gemma":0.0009138563,"threshold_uncertainty_score":0.010952473},"labels":[],"label_agreement":null},{"id":"W2065990064","doi":"10.1057/jors.2010.30","title":"Production planning with uncertainty in the quality of raw materials: a case in sawmills","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Production planning; Time horizon; Production (economics); Computer science; Stochastic programming; Mathematical optimization; Product (mathematics); Capacity planning; Quality (philosophy); Operations research; Mathematics; Economics","score_opus":0.08852421422799558,"score_gpt":0.40937107740112694,"score_spread":0.3208468631731314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065990064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7740097,0.0006526556,0.21636079,0.0009499525,0.000032365926,0.00016519669,0.00030259963,0.00012163984,0.0074050995],"genre_scores_gemma":[0.98643297,0.00017141362,0.012168964,0.000014703686,0.000008882095,0.000040475166,0.00003039741,0.000011099856,0.00112108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.00031669223,0.000022845154,0.00010491458,0.000117565556,0.00010051054],"domain_scores_gemma":[0.99755836,0.0018464422,0.00029870472,0.00006675582,0.000103139355,0.00012664382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017750789,0.0006386227,0.0011285454,0.00050130446,0.0007904035,0.001599957,0.0010191357,0.0021547435,0.002099841],"category_scores_gemma":[0.0033241855,0.00087940297,0.00095356995,0.0011303175,0.0011435465,0.0012502035,0.00073879526,0.0011385807,0.00010596325],"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.00007963018,0.000044333086,0.00070998655,0.000041122366,0.000013194626,0.0011127426,0.000042586922,0.9881345,0.0007532191,0.0066092247,0.00011014377,0.0023492398],"study_design_scores_gemma":[0.000027671413,0.00011745817,0.00072482304,0.000008568877,0.000017665541,0.00012228999,0.00009313069,0.99203897,0.00062239607,0.0059526246,0.00025691168,0.000017528067],"about_ca_topic_score_codex":0.0076839705,"about_ca_topic_score_gemma":0.005267237,"teacher_disagreement_score":0.0076839705,"about_ca_system_score_codex":0.0013873205,"about_ca_system_score_gemma":0.0010561775,"threshold_uncertainty_score":0.015278459},"labels":[],"label_agreement":null},{"id":"W2066316339","doi":"10.1002/mcda.448","title":"Fuzzy goal programming model: an overview of the current state‐of‐the art","year":2009,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Laurentian University","funders":"","keywords":"Goal programming; Decision maker; Computer science; Fuzzy logic; State (computer science); Operations research; Management science; Artificial intelligence; Mathematics; Engineering; Programming language","score_opus":0.05753464246591396,"score_gpt":0.36068800222586256,"score_spread":0.3031533597599486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066316339","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075622303,0.13039586,0.82174927,0.004408299,0.0002987392,0.00015742645,0.00029084482,0.0003886908,0.0347487],"genre_scores_gemma":[0.31637335,0.20272075,0.4658593,0.0018596934,0.0012620675,0.00066797185,0.00086973433,0.00024191194,0.0101451855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811304,0.0007683148,0.00010483241,0.0002576504,0.00065484655,0.0001013505],"domain_scores_gemma":[0.9987785,0.000847457,0.000076291784,0.000048782524,0.00019036539,0.000058529648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029365947,0.0010539648,0.0014788925,0.001961091,0.00041670617,0.004756394,0.002624788,0.002089146,0.003400818],"category_scores_gemma":[0.0032054514,0.0005538453,0.0013592255,0.0043060905,0.0012299288,0.0029929327,0.0012717383,0.0025661502,0.0009983872],"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.00011247422,0.00024297142,0.0006318728,0.0022698846,0.00018008072,0.00027174968,0.00031218652,0.21121319,0.0006067182,0.4375516,0.009550751,0.33705652],"study_design_scores_gemma":[0.00003400758,0.00009479823,0.00037422698,0.001090695,0.000084770676,0.00023730466,0.0001823009,0.5717631,0.0004657912,0.34901533,0.07658212,0.00007554833],"about_ca_topic_score_codex":0.004363631,"about_ca_topic_score_gemma":0.0017149273,"teacher_disagreement_score":0.004756394,"about_ca_system_score_codex":0.001946595,"about_ca_system_score_gemma":0.0019029441,"threshold_uncertainty_score":0.015530407},"labels":[],"label_agreement":null},{"id":"W2069540826","doi":"10.1016/j.apm.2012.01.034","title":"Adjacency based method for generating maximal efficient faces in multiobjective linear programming","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Defence Research and Development Canada","funders":"","keywords":"Extreme point; Adjacency list; Simplex; Linear programming; Mathematical optimization; Mathematics; Face (sociological concept); Feasible region; Simplex algorithm; Set (abstract data type); Regular polygon; Algorithm; Point (geometry); Polyhedron; Computer science; Combinatorics; Geometry","score_opus":0.03284012179857119,"score_gpt":0.28042299222797684,"score_spread":0.24758287042940566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069540826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007756122,0.000052266867,0.9892363,0.0000457076,0.00002568967,0.000041804524,0.000033876102,0.00009245031,0.0027158358],"genre_scores_gemma":[0.200073,0.00015328897,0.7931563,0.00008973402,0.00004723247,0.00039041668,0.00020246439,0.00018008192,0.0057074362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.0001526983,0.000012605024,0.000048325706,0.000111452646,0.000032544594],"domain_scores_gemma":[0.99919754,0.00053805404,0.00003371103,0.000048302267,0.00015039103,0.000031977957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000734945,0.00069904036,0.0008119414,0.0011159079,0.000739481,0.000669845,0.0011369052,0.0010180867,0.005512627],"category_scores_gemma":[0.0019724146,0.0005046603,0.0009822648,0.00075394096,0.0006242718,0.00089162064,0.0012296711,0.0012937007,0.0007255597],"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.00009777619,0.00012847991,0.00033472417,0.0002071901,0.00003826412,0.000107460524,0.00018685909,0.69431716,0.008712923,0.12402076,0.00408092,0.16776748],"study_design_scores_gemma":[0.0000075067464,0.000036975023,0.000054102526,0.000012624697,0.000009547213,0.000023841132,0.000018379864,0.97251475,0.0013536491,0.024610756,0.0013496988,0.0000081112585],"about_ca_topic_score_codex":0.0017599898,"about_ca_topic_score_gemma":0.0026008983,"teacher_disagreement_score":0.005512627,"about_ca_system_score_codex":0.0004835759,"about_ca_system_score_gemma":0.00074409734,"threshold_uncertainty_score":0.018441558},"labels":[],"label_agreement":null},{"id":"W2070738041","doi":"10.1016/s0308-521x(01)00082-8","title":"Livestock manure systems for swine finishing enterprises","year":2002,"lang":"en","type":"article","venue":"Agricultural Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Manure; Manure management; Agricultural science; Livestock; Environmental science; Agricultural engineering; Ammonia; Business; Mathematics; Agronomy; Engineering; Geography; Chemistry; Biology; Forestry","score_opus":0.019242282415613616,"score_gpt":0.19849670441755637,"score_spread":0.17925442200194275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070738041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8568362,0.0010323103,0.13322906,0.00058833486,0.00005486805,0.00011972564,0.00017012647,0.00006363713,0.007905782],"genre_scores_gemma":[0.98900676,0.0002937218,0.008733573,0.000013803766,0.000008523854,0.00003892809,0.000059982503,0.0000070227675,0.001837696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99976104,0.00012418989,0.000010072951,0.000025696949,0.000033465058,0.000045424153],"domain_scores_gemma":[0.999713,0.00016940842,0.00004204473,0.000014072023,0.000040487615,0.000020848793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060061336,0.0002411714,0.00040483792,0.00027735106,0.0005173235,0.0009595508,0.00040119197,0.0007439378,0.002215697],"category_scores_gemma":[0.0010187678,0.00020125961,0.00035394792,0.00047163724,0.00022316641,0.0008011887,0.00052670744,0.00027986016,0.00010606636],"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.0003497823,0.00030275347,0.0026399568,0.00014639909,0.000038888607,0.0001867257,0.00007105947,0.92542845,0.011190168,0.010633777,0.00080782856,0.048204277],"study_design_scores_gemma":[0.000053879165,0.0005182878,0.0021430354,0.00001811672,0.00003578456,0.00003775348,0.00019417108,0.98410714,0.002885914,0.0082673365,0.0017252207,0.000013310705],"about_ca_topic_score_codex":0.004252551,"about_ca_topic_score_gemma":0.0076293354,"teacher_disagreement_score":0.004252551,"about_ca_system_score_codex":0.00089507265,"about_ca_system_score_gemma":0.0006972047,"threshold_uncertainty_score":0.0084555745},"labels":[],"label_agreement":null},{"id":"W2071287365","doi":"10.1115/detc2013-12668","title":"Mixed Discrete and Continuous Variable Optimization Based on Constraint Aggregation and Relative Sensitivity","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Sensitivity (control systems); Constraint (computer-aided design); Mathematics; Differentiable function; Function (biology); Nonlinear programming; Variable (mathematics); Feasible region; Nonlinear system; Optimization problem; Constrained optimization; Computer science","score_opus":0.007625292604720208,"score_gpt":0.18766007823676184,"score_spread":0.18003478563204164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071287365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018331036,0.0001222681,0.99653107,0.000022149576,0.000019336512,0.000024237648,0.000010056334,0.00006244248,0.0013754073],"genre_scores_gemma":[0.1903014,0.0005594809,0.8054272,0.00007942251,0.000078716635,0.00035043288,0.0001111096,0.000112345595,0.0029798772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988701,0.00037941997,0.00006864851,0.00013832864,0.00049365114,0.000049742022],"domain_scores_gemma":[0.9989662,0.0007035695,0.00009791903,0.00007262845,0.00012984515,0.000029953007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015356635,0.0015192226,0.001345342,0.001144542,0.0005201869,0.0013484296,0.0011832543,0.0008572821,0.002223023],"category_scores_gemma":[0.0028750408,0.00068139087,0.0014561428,0.001614325,0.0006851233,0.0015839414,0.0014613236,0.0013987161,0.00037081676],"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.0000589107,0.000048831418,0.00036523605,0.00029925312,0.00010018305,0.00010779525,0.00008334619,0.87553483,0.00613523,0.029808702,0.00075086684,0.08670667],"study_design_scores_gemma":[0.0000066554453,0.000027688315,0.000059720704,0.000010946112,0.000010990201,0.000026033202,0.0000051905167,0.9947147,0.0011663828,0.0029441277,0.0010189092,0.000008692696],"about_ca_topic_score_codex":0.0025086936,"about_ca_topic_score_gemma":0.0019198158,"teacher_disagreement_score":0.0025086936,"about_ca_system_score_codex":0.0005721609,"about_ca_system_score_gemma":0.0010300974,"threshold_uncertainty_score":0.0081214905},"labels":[],"label_agreement":null},{"id":"W2074827063","doi":"10.5430/ijba.v4n1p105","title":"Personnel Selection Method Based on Personnel-Job Matching","year":2013,"lang":"en","type":"article","venue":"International Journal of Business Administration","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Disadvantage; Selection (genetic algorithm); Computer science; Job satisfaction; Personnel selection; Seekers; Fuzzy logic; Human resource management; Operations research; Knowledge management; Artificial intelligence; Management; Economics; Mathematics; Statistics; Law","score_opus":0.014900174512581951,"score_gpt":0.27247925524831873,"score_spread":0.25757908073573677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074827063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016890079,0.00018822595,0.9777384,0.00014157091,0.000093556955,0.00017359814,0.00003939584,0.000312818,0.0044223876],"genre_scores_gemma":[0.5875864,0.00043628764,0.39722428,0.00016224923,0.00024687022,0.0006703446,0.0002556317,0.000115928415,0.013302095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979786,0.0006051311,0.00010477552,0.00034664624,0.00076807913,0.00019671395],"domain_scores_gemma":[0.99943465,0.00015564958,0.000058808324,0.000034212582,0.0002536802,0.00006301334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127609,0.0006993869,0.0010495521,0.0021851105,0.0011898997,0.0009526668,0.0011761071,0.0007681469,0.0059703547],"category_scores_gemma":[0.002426488,0.0003059323,0.0010787634,0.0018198504,0.0003667547,0.001136169,0.0011072905,0.00054863817,0.00078722625],"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.0003551712,0.00027599998,0.0048919343,0.00032787188,0.00018567138,0.00020917285,0.0004258982,0.1567087,0.006970141,0.033784933,0.0064162035,0.78944826],"study_design_scores_gemma":[0.000133846,0.0002981032,0.00238394,0.000029378745,0.00010600276,0.00027096106,0.00016174346,0.9684607,0.003144359,0.018253753,0.00670362,0.000053685115],"about_ca_topic_score_codex":0.0030895688,"about_ca_topic_score_gemma":0.0018478357,"teacher_disagreement_score":0.0059703547,"about_ca_system_score_codex":0.00078018045,"about_ca_system_score_gemma":0.0016170801,"threshold_uncertainty_score":0.01997286},"labels":[],"label_agreement":null},{"id":"W2075501806","doi":"10.1023/a:1013346202934","title":"Long-Term Planning of Waste Management System in the City of Regina – an Integrated Inexact Optimization Approach","year":2001,"lang":"en","type":"article","venue":"Environmental Modeling & Assessment","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Plan (archaeology); Municipal solid waste; Operations research; Solid waste management; Reliability (semiconductor); Stochastic programming; Computer science; Operations management; Waste management; Business; Engineering; Mathematical optimization; Mathematics; Geography","score_opus":0.023519670109304846,"score_gpt":0.2533160536532565,"score_spread":0.22979638354395165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075501806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849126,0.0010486929,0.30421585,0.00083191873,0.00007131077,0.000078616875,0.0007189451,0.000322565,0.0077994475],"genre_scores_gemma":[0.9705165,0.00019873708,0.026827117,0.00002681881,0.000013432157,0.00006623056,0.00031382684,0.00004392142,0.001993366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954057,0.00019105045,0.000023122917,0.000078787576,0.00006371948,0.00010280758],"domain_scores_gemma":[0.9996439,0.00013852377,0.000059950227,0.000031569023,0.00008189686,0.00004415266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072552304,0.0006048336,0.0010092123,0.00069437694,0.0008001533,0.0015865624,0.0011047539,0.001409204,0.0014205059],"category_scores_gemma":[0.0011382326,0.0007701856,0.00096917694,0.00080259354,0.00051491807,0.00093435345,0.000811794,0.00064741954,0.0001695423],"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.000014035512,0.000011132575,0.00061948324,0.000008670439,0.000014237762,0.00004615803,0.000009441185,0.9964234,0.00012460673,0.0005085632,0.00007169305,0.002148601],"study_design_scores_gemma":[0.0000034090363,0.000017046745,0.0006169054,0.0000034341685,0.000013267346,0.000011022507,0.000038659535,0.9982658,0.00020334517,0.00062731985,0.00019266145,0.000007101533],"about_ca_topic_score_codex":0.057088632,"about_ca_topic_score_gemma":0.05638251,"teacher_disagreement_score":0.9429114,"about_ca_system_score_codex":0.001619335,"about_ca_system_score_gemma":0.002571823,"threshold_uncertainty_score":0.113512695},"labels":[],"label_agreement":null},{"id":"W2078978921","doi":"10.1155/2013/837919","title":"Bilevel Multiobjective Programming Applied to Water Resources Allocation","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"National High-tech Research and Development Program; Ministry of Water Resources; National Natural Science Foundation of China","keywords":"Mathematical optimization; Bilevel optimization; Linear programming; Computer science; Analytic hierarchy process; Fuzzy logic; Hierarchy; Operations research; Mathematics; Optimization problem; Artificial intelligence","score_opus":0.008404664537964594,"score_gpt":0.19489940562292482,"score_spread":0.18649474108496022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078978921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066327727,0.000538442,0.9892945,0.0001668348,0.00003443681,0.000045243592,0.000021826541,0.000055979042,0.0032098885],"genre_scores_gemma":[0.5545452,0.001997183,0.4378328,0.0001461231,0.000077569726,0.00053061714,0.0001394972,0.00008063799,0.004650393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987746,0.00070463814,0.00005736928,0.00012761488,0.00022818129,0.00010767035],"domain_scores_gemma":[0.9989812,0.00069455075,0.000092125985,0.000031754436,0.00015525761,0.00004499064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016745875,0.0013135436,0.0014472958,0.0011128697,0.0008184973,0.0017341569,0.0008792665,0.0012731211,0.0017007776],"category_scores_gemma":[0.0032152934,0.0006866104,0.0012593385,0.0023126088,0.0009539529,0.0009887128,0.0016712786,0.0020412828,0.00022358279],"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.000012574657,0.000024642632,0.0002447264,0.00010410178,0.000039431347,0.000065170454,0.000048972117,0.96655256,0.00045640962,0.018004483,0.0002762278,0.01417079],"study_design_scores_gemma":[0.000003949293,0.00002001369,0.00003611728,0.000011098334,0.000006318606,0.00001203849,0.0000148959925,0.9880271,0.00019330814,0.011088543,0.00058146846,0.00000516374],"about_ca_topic_score_codex":0.0053965244,"about_ca_topic_score_gemma":0.0040958175,"teacher_disagreement_score":0.0053965244,"about_ca_system_score_codex":0.0012858112,"about_ca_system_score_gemma":0.0018748752,"threshold_uncertainty_score":0.010730207},"labels":[],"label_agreement":null},{"id":"W2080447297","doi":"10.5539/jmr.v1n2p47","title":"Single and Multi Container Maintenance Model: A Fuzzy Geometric Programming Approach","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Container (type theory); Mathematics; Fuzzy logic; Mathematical optimization; Fuzzy number; Fuzzy set operations; Geometric programming; Operator (biology); Defuzzification; Fuzzy classification; Fuzzy set; Applied mathematics; Computer science; Artificial intelligence; Engineering","score_opus":0.14803862089933428,"score_gpt":0.33253712734571583,"score_spread":0.18449850644638155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080447297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02130369,0.00038633906,0.97256947,0.00038926414,0.00004843484,0.00003188839,0.000071882576,0.00007235486,0.005126642],"genre_scores_gemma":[0.8087773,0.0008697404,0.17921513,0.00011231264,0.00010828745,0.00021123287,0.0001564814,0.00005653777,0.010492974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993998,0.00016502506,0.000020809628,0.00017339134,0.00016378346,0.00007712685],"domain_scores_gemma":[0.9996681,0.0001439324,0.000074947966,0.00002054728,0.0000649712,0.000027477237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829042,0.0009158062,0.0008907299,0.0006163923,0.00048454903,0.0013677166,0.0020460803,0.0012891429,0.002727691],"category_scores_gemma":[0.0010937492,0.0003981791,0.0011758521,0.00082975405,0.00083467894,0.0020588376,0.00076846726,0.0011641302,0.0002005669],"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.000023353376,0.000021299069,0.00022345822,0.000047007066,0.000019991629,0.00010104127,0.000050175284,0.9265741,0.00072198926,0.06230348,0.0005314913,0.009382632],"study_design_scores_gemma":[0.0000047592657,0.000020042611,0.000060542785,0.0000037565437,0.0000064380038,0.00002880823,0.0000095664045,0.9856528,0.00015774886,0.013587654,0.00046151958,0.000006483005],"about_ca_topic_score_codex":0.004286755,"about_ca_topic_score_gemma":0.0023706418,"teacher_disagreement_score":0.004286755,"about_ca_system_score_codex":0.0014092495,"about_ca_system_score_gemma":0.0011419094,"threshold_uncertainty_score":0.010224879},"labels":[],"label_agreement":null},{"id":"W2081516133","doi":"10.1007/s11269-008-9380-3","title":"A Two-Step Infinite α-Cuts Fuzzy Linear Programming Method in Determination of Optimal Allocation Strategies in Agricultural Irrigation Systems","year":2008,"lang":"en","type":"article","venue":"Water Resources Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Linear programming; Fuzzy logic; Mathematical optimization; Fuzzy number; Mathematics; Fuzzy set operations; Linear-fractional programming; Computer science; Fuzzy set; Artificial intelligence","score_opus":0.015241318940135213,"score_gpt":0.24995074344953497,"score_spread":0.23470942450939974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081516133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009860252,0.00007715632,0.988477,0.00006805192,0.000024987507,0.00003860755,0.000017180428,0.000050532264,0.0013862521],"genre_scores_gemma":[0.31314,0.00017644769,0.68285877,0.000094611336,0.000042356576,0.00033056823,0.00009810085,0.00007321687,0.0031859193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934775,0.00033338697,0.000031133262,0.00008170264,0.00015246269,0.000053614098],"domain_scores_gemma":[0.9982759,0.0012060598,0.000073537216,0.00004561034,0.00032716623,0.00007174077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00260963,0.00061677315,0.0010094412,0.0008751504,0.00076498464,0.0012298162,0.0017103294,0.0013439755,0.0027722402],"category_scores_gemma":[0.0036919706,0.00074062985,0.0008884332,0.00077258423,0.00092449,0.0013726308,0.0009740605,0.001704367,0.00022018314],"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.00017245881,0.000116163836,0.0004070942,0.00015630345,0.00005522796,0.00006977315,0.00016783488,0.88972026,0.0025169447,0.025843129,0.0009784622,0.079796374],"study_design_scores_gemma":[0.00000773254,0.00002387972,0.000046530964,0.000008893838,0.000007871789,0.000007155135,0.000009978738,0.9969157,0.00034967336,0.0023977892,0.00021935436,0.000005514452],"about_ca_topic_score_codex":0.0063259113,"about_ca_topic_score_gemma":0.004676144,"teacher_disagreement_score":0.0063259113,"about_ca_system_score_codex":0.00093874236,"about_ca_system_score_gemma":0.0015471095,"threshold_uncertainty_score":0.0138011575},"labels":[],"label_agreement":null},{"id":"W2089233175","doi":"10.1023/b:anor.0000039515.90453.1d","title":"Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Theory of computation; Path (computing); Mathematical optimization; Mathematics; Heuristic; Set (abstract data type); Local search (optimization); Network planning and design; Computer science; Algorithm","score_opus":0.18403810617067948,"score_gpt":0.3873745427847574,"score_spread":0.20333643661407794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089233175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044101436,0.0005304311,0.949761,0.0002824957,0.000050110677,0.00006716116,0.00008741799,0.00007737614,0.0050425734],"genre_scores_gemma":[0.76744854,0.0010899993,0.22183302,0.00008239096,0.000056710083,0.00022206685,0.00016997902,0.000103007944,0.008994249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993662,0.00031350524,0.000024894367,0.00011073309,0.00012463395,0.000060041926],"domain_scores_gemma":[0.9974662,0.0015697404,0.00033158873,0.00015856134,0.0003074226,0.00016644335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015743701,0.0007695176,0.001185574,0.0011081853,0.0007832137,0.0010638407,0.0019124936,0.0012527442,0.0033995432],"category_scores_gemma":[0.0066713104,0.0008469566,0.00070653827,0.0017377556,0.0014659634,0.0026903653,0.0013423535,0.0010587248,0.00028533372],"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.000084894295,0.000032674026,0.00023127708,0.00007028707,0.000017569137,0.000019532818,0.000041021278,0.9158854,0.0005077025,0.06530605,0.0006364531,0.017167158],"study_design_scores_gemma":[0.000012149185,0.000046884397,0.00005666529,0.000010017444,0.000009593269,0.000018138211,0.0000137866955,0.9390497,0.00024247558,0.05994179,0.0005900451,0.000008692623],"about_ca_topic_score_codex":0.0030617032,"about_ca_topic_score_gemma":0.0032981841,"teacher_disagreement_score":0.0033995432,"about_ca_system_score_codex":0.0012007104,"about_ca_system_score_gemma":0.0008820649,"threshold_uncertainty_score":0.011372626},"labels":[],"label_agreement":null},{"id":"W2092768552","doi":"10.1007/s10489-012-0368-6","title":"Method for solving unbalanced fully fuzzy multi-objective solid minimal cost flow problems","year":2012,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission; Ryerson University","keywords":"Computer science; Fuzzy logic; Mathematical optimization; Product (mathematics); Fuzzy number; Flow (mathematics); Fuzzy transportation; Fuzzy set; Mathematics; Artificial intelligence","score_opus":0.03533817306306876,"score_gpt":0.3079266794170878,"score_spread":0.27258850635401904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092768552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057873917,0.0000912475,0.9912243,0.00005444752,0.000042232772,0.000041187235,0.000028172077,0.00008920936,0.0026418632],"genre_scores_gemma":[0.29576772,0.00021690331,0.6979396,0.000085004816,0.000059080914,0.0003078264,0.00013197407,0.00012628459,0.0053656856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997855,0.000055438526,0.000010647242,0.000023874461,0.00010136061,0.000023360342],"domain_scores_gemma":[0.9996166,0.00019187648,0.000029521172,0.000020444622,0.000116934665,0.0000246006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008909752,0.00071406004,0.00127606,0.00091425737,0.0005846382,0.00065593293,0.0011871877,0.00096252473,0.0039539197],"category_scores_gemma":[0.0012929154,0.0003913827,0.0006885431,0.00064995926,0.0005156216,0.00070148415,0.001006528,0.000897433,0.00039530825],"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.00014217492,0.000084175306,0.000410423,0.00026664435,0.00006535012,0.000094564246,0.000088257206,0.83933324,0.004866725,0.02663675,0.0014791166,0.12653248],"study_design_scores_gemma":[0.000011710089,0.0000225395,0.000049986418,0.000007924334,0.0000063440452,0.000012929146,0.0000072901366,0.99634737,0.00031211704,0.002549423,0.0006679335,0.0000044434614],"about_ca_topic_score_codex":0.003160141,"about_ca_topic_score_gemma":0.0039288574,"teacher_disagreement_score":0.0039539197,"about_ca_system_score_codex":0.00040017592,"about_ca_system_score_gemma":0.0008769814,"threshold_uncertainty_score":0.013227224},"labels":[],"label_agreement":null},{"id":"W2096219964","doi":"10.5267/j.msl.2014.7.031","title":"An approach for solving multi-objective assignment problem with interval parameters","year":2014,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interval (graph theory); Computer science; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.014660548658936498,"score_gpt":0.23083647211676425,"score_spread":0.21617592345782777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096219964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001881801,0.00021063928,0.9960645,0.000052127234,0.000032380678,0.000028880502,0.000018003733,0.000052153537,0.0016595073],"genre_scores_gemma":[0.08220108,0.0007957658,0.91478,0.00007618253,0.0001037426,0.00023244962,0.00009479224,0.000062735635,0.0016531808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994342,0.00018274503,0.00003135805,0.00010181454,0.00021348195,0.00003644344],"domain_scores_gemma":[0.99966073,0.00016225303,0.000044184362,0.000033619945,0.000076071345,0.000023166114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008747923,0.0011267575,0.00089996756,0.00097451813,0.00052129035,0.0009529963,0.0014785667,0.0010013607,0.002112782],"category_scores_gemma":[0.0016909207,0.0003677939,0.0014928805,0.0013991152,0.00034244132,0.0014421454,0.0011461786,0.0021658414,0.0004850599],"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.00007801323,0.00018445624,0.00057624327,0.00076267426,0.00019429988,0.00023185559,0.00026540275,0.63765776,0.01041238,0.092713356,0.0031808706,0.2537427],"study_design_scores_gemma":[0.000027008487,0.00018749824,0.00020259013,0.000076533426,0.00007354534,0.00022417158,0.0000670282,0.9257139,0.0027636732,0.058531366,0.01209656,0.000036279762],"about_ca_topic_score_codex":0.0007641434,"about_ca_topic_score_gemma":0.0006712871,"teacher_disagreement_score":0.002112782,"about_ca_system_score_codex":0.00043960233,"about_ca_system_score_gemma":0.00065231713,"threshold_uncertainty_score":0.007067919},"labels":[],"label_agreement":null},{"id":"W2097717037","doi":"10.5430/ijfr.v4n4p83","title":"Financial Statement Management, Liability Reduction and Asset Accumulation: An Application of Goal Programming Model to a Nigerian Bank","year":2013,"lang":"en","type":"article","venue":"International Journal of Financial Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Financial statement; Liability; Statement (logic); Financial statement analysis; Business; Finance; Shareholder; Asset (computer security); Actuarial science; Goal programming; Bank statement; Financial ratio; Economics; Accounting; Computer science; Operations research; Corporate governance; Engineering","score_opus":0.060073445682017126,"score_gpt":0.3976336304549813,"score_spread":0.3375601847729642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097717037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8321594,0.0003760169,0.14889331,0.001363948,0.000048001602,0.00023679617,0.00021364332,0.000099623394,0.016609218],"genre_scores_gemma":[0.9628875,0.0002744463,0.03462658,0.000057023077,0.000009462037,0.00011990014,0.00005847045,0.000011887276,0.0019546365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.00029145536,0.000013023252,0.000038319835,0.000034716384,0.0000749914],"domain_scores_gemma":[0.9986382,0.0011092682,0.00007980354,0.000016349524,0.000095297786,0.000061041326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273389,0.0006152089,0.0006096381,0.0005514188,0.00072776014,0.001511661,0.0006198576,0.0013059668,0.0017601497],"category_scores_gemma":[0.0019876095,0.0003232885,0.0006056715,0.0006978914,0.0005913602,0.0006724803,0.000879189,0.0011305942,0.00008927056],"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.0001414158,0.00020553441,0.0033292081,0.00008482032,0.00003478092,0.00040049222,0.0002331639,0.9786587,0.00043325117,0.0068889908,0.00047077992,0.009118917],"study_design_scores_gemma":[0.000019468785,0.00009424456,0.0007784878,0.000017035478,0.000016973789,0.000023548966,0.00025779495,0.9955076,0.00020808137,0.0027267386,0.00034037535,0.000009618584],"about_ca_topic_score_codex":0.022166232,"about_ca_topic_score_gemma":0.01968827,"teacher_disagreement_score":0.022166232,"about_ca_system_score_codex":0.0015440314,"about_ca_system_score_gemma":0.002567637,"threshold_uncertainty_score":0.044074416},"labels":[],"label_agreement":null},{"id":"W2097978888","doi":"10.5539/mas.v6n12p22","title":"Type II Sensitivity Analysis in Solid Assignment Problems","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"VIT University","keywords":"Sensitivity (control systems); Parametric statistics; Type (biology); Mathematical optimization; Computer science; Action (physics); Assignment problem; Mathematics; Algorithm; Statistics; Physics; Engineering","score_opus":0.018307689006117112,"score_gpt":0.2475322798865283,"score_spread":0.22922459088041117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097978888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012408767,0.0003510098,0.98134387,0.00018313363,0.000042966036,0.000044060977,0.00003780434,0.00006464912,0.0055237766],"genre_scores_gemma":[0.89585894,0.0013178233,0.097195625,0.00026569885,0.0001373085,0.00026649976,0.00015147714,0.00014704424,0.004659575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964329,0.0017426264,0.00010361013,0.00035900035,0.0010783881,0.00028341095],"domain_scores_gemma":[0.9926031,0.005898913,0.00048781573,0.00026543628,0.0006491314,0.00009551488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034796388,0.001347988,0.0011079647,0.0015323303,0.0006923952,0.0021651303,0.0009200694,0.0011333288,0.0020410216],"category_scores_gemma":[0.01256974,0.00056108925,0.0014994601,0.0011943744,0.001679746,0.0015866349,0.0018200072,0.0016517539,0.00020967028],"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.000053796386,0.000019897205,0.0007226359,0.00016225407,0.00006650636,0.00019302375,0.00012183925,0.92806923,0.0030699663,0.04995403,0.0007916162,0.0167752],"study_design_scores_gemma":[0.0000029872697,0.000029298722,0.00027937218,0.00002162694,0.000016438637,0.00007443331,0.000041528692,0.96571124,0.0012733656,0.03159952,0.00093079545,0.0000193671],"about_ca_topic_score_codex":0.0021572125,"about_ca_topic_score_gemma":0.00063066464,"teacher_disagreement_score":0.0034796388,"about_ca_system_score_codex":0.0011331576,"about_ca_system_score_gemma":0.000808943,"threshold_uncertainty_score":0.018402338},"labels":[],"label_agreement":null},{"id":"W2098352464","doi":"10.5430/air.v2n2p109","title":"Interactive Fuzzy Programming for Stochastic Two-level Linear Programming Problems through Probability Maximization","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear programming; Vagueness; Mathematical optimization; Stochastic programming; Simplex algorithm; Fuzzy logic; Computer science; Linear-fractional programming; Mathematics; Artificial intelligence","score_opus":0.2473736253788599,"score_gpt":0.4067232692812456,"score_spread":0.15934964390238568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098352464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020321317,0.0000814814,0.99683654,0.000047180172,0.000005171358,0.000018021383,0.0000061762507,0.000022757602,0.00095050415],"genre_scores_gemma":[0.36970776,0.0006647733,0.6254979,0.000094421855,0.00007938585,0.00046990535,0.000091558,0.000085106796,0.003309197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828136,0.00082450977,0.00006494799,0.0002202424,0.00047111415,0.00013775518],"domain_scores_gemma":[0.9980076,0.0015825016,0.00015045467,0.000061805265,0.0001355757,0.000062021725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030330976,0.0014584409,0.00096163014,0.00083302235,0.0007903056,0.0016638514,0.001487924,0.0011463172,0.0031750393],"category_scores_gemma":[0.0048993668,0.0006267076,0.0014790123,0.0011694061,0.0014817768,0.0018064299,0.0023433075,0.001985048,0.00035896344],"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.000051314797,0.000045038316,0.00032472122,0.00017797395,0.00005680355,0.00013003331,0.00022000041,0.8064765,0.0018604007,0.15486564,0.0005467498,0.035244744],"study_design_scores_gemma":[0.0000071103,0.00002319641,0.000047548034,0.000011700274,0.000007809524,0.000019519091,0.000012900297,0.9715873,0.0004389367,0.027184328,0.00065180863,0.000007910582],"about_ca_topic_score_codex":0.002479329,"about_ca_topic_score_gemma":0.0024507607,"teacher_disagreement_score":0.0031750393,"about_ca_system_score_codex":0.0015453434,"about_ca_system_score_gemma":0.0016139792,"threshold_uncertainty_score":0.016040742},"labels":[],"label_agreement":null},{"id":"W2101205695","doi":"10.1016/s0191-2615(99)00021-1","title":"Optimization of the transportation expense of a firm with contractual supplies","year":2000,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Selkirk College","funders":"","keywords":"Transportation theory; Nonlinear system; Mathematical optimization; Computer science; Operations research; Mathematics","score_opus":0.19293871666370144,"score_gpt":0.3847738904818201,"score_spread":0.19183517381811865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101205695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56595546,0.0015612013,0.35920596,0.00679197,0.00024331968,0.00042295465,0.0021283098,0.0003778325,0.06331303],"genre_scores_gemma":[0.9567526,0.00062278233,0.024077633,0.00008921392,0.00010801919,0.00013957567,0.00035135096,0.00012942785,0.017729437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869496,0.0006310706,0.000053430893,0.00020227862,0.00015009807,0.000268084],"domain_scores_gemma":[0.9951513,0.003641075,0.00033661578,0.00016409896,0.00023730949,0.00046973507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027932834,0.0010215372,0.0018315145,0.001207199,0.0007726457,0.003101445,0.0019512214,0.003525115,0.009840676],"category_scores_gemma":[0.0092124855,0.0012958192,0.0010127506,0.0018306499,0.0014598464,0.0028465658,0.001138019,0.0020121138,0.0006613204],"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.00070805865,0.00017916445,0.0013530377,0.00021721635,0.000073651616,0.00028056986,0.000072412455,0.927407,0.0016058964,0.05517599,0.0024748144,0.010452155],"study_design_scores_gemma":[0.00010418354,0.00021989833,0.0014762705,0.00002695848,0.00005768412,0.00008213334,0.000118550255,0.97322065,0.00087553967,0.022293173,0.0014936615,0.000031236854],"about_ca_topic_score_codex":0.011542765,"about_ca_topic_score_gemma":0.005940334,"teacher_disagreement_score":0.011542765,"about_ca_system_score_codex":0.0041708522,"about_ca_system_score_gemma":0.0028542788,"threshold_uncertainty_score":0.0329203},"labels":[],"label_agreement":null},{"id":"W2103088687","doi":"10.1111/j.1475-3995.2012.00844.x","title":"Aggregate planning through the imprecise goal programming model: integration of the manager's preferences","year":2012,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Aggregate planning; Aggregate (composite); Time horizon; Computer science; Production planning; Production (economics); Operations research; Goal programming; Plan (archaeology); Set (abstract data type); Range (aeronautics); Industrial engineering; Mathematical optimization; Economics; Engineering; Mathematics; Microeconomics","score_opus":0.10835373592673947,"score_gpt":0.3908507517331907,"score_spread":0.28249701580645126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103088687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025532456,0.00017687492,0.96812874,0.0006026073,0.000020470736,0.000036535414,0.00009768892,0.00006823156,0.0053364504],"genre_scores_gemma":[0.8227623,0.00048043815,0.1727414,0.00016367447,0.000051434236,0.00019344252,0.00010843022,0.00004321624,0.003455658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.0010828341,0.00006394923,0.00020764177,0.00039737235,0.0001706891],"domain_scores_gemma":[0.99803215,0.0013204997,0.00027235452,0.00010350186,0.00017212701,0.000099392295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025756399,0.00068958825,0.00086755387,0.0005100783,0.0003768909,0.0022669532,0.0013435399,0.0011507872,0.0016408149],"category_scores_gemma":[0.004036544,0.0005761646,0.00077172334,0.0013631909,0.0010236665,0.0020580227,0.0013049932,0.0019530347,0.00019543807],"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.00002792815,0.000019328372,0.00022531943,0.000026206462,0.000022076158,0.000088309,0.00010151304,0.9517263,0.00028678012,0.04183027,0.00029863018,0.0053472905],"study_design_scores_gemma":[0.0000058164906,0.000021171722,0.0000881037,0.000008053372,0.000009329156,0.000016437982,0.000031000716,0.9814648,0.00012471301,0.017677538,0.00054589263,0.0000071555387],"about_ca_topic_score_codex":0.005735144,"about_ca_topic_score_gemma":0.0052492437,"teacher_disagreement_score":0.005735144,"about_ca_system_score_codex":0.001388721,"about_ca_system_score_gemma":0.0012286021,"threshold_uncertainty_score":0.0136214495},"labels":[],"label_agreement":null},{"id":"W2106102140","doi":"10.1111/j.1467-8276.2008.01149.x","title":"Economic Development Prospects of Forest‐Dependent Communities: Analyzing Trade‐offs Using a Compromise‐Fuzzy Programming Framework","year":2008,"lang":"en","type":"article","venue":"American Journal of Agricultural Economics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Compromise; Weighting; Fuzzy logic; Diversification (marketing strategy); Rule of thumb; Economics; Computer science; Environmental economics; Natural resource economics; Business; Artificial intelligence; Marketing; Sociology; Algorithm","score_opus":0.016333784997525125,"score_gpt":0.21884270775520187,"score_spread":0.20250892275767673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106102140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78624564,0.00064234674,0.18982205,0.0017367231,0.000024799605,0.00012728598,0.00018161756,0.00003013031,0.021189451],"genre_scores_gemma":[0.98777825,0.00016222028,0.010508427,0.000026415697,0.0000067302653,0.00006322201,0.000026450942,0.000008125647,0.0014202473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903524,0.00058204413,0.00001704658,0.000076951146,0.000107959444,0.0001807222],"domain_scores_gemma":[0.9967746,0.0023600322,0.0002768435,0.000060217128,0.0002009994,0.00032722988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038052043,0.00070082967,0.0007078872,0.0013850142,0.0009325378,0.002905174,0.0009646358,0.0018503072,0.0034624098],"category_scores_gemma":[0.00813257,0.00057097734,0.00094562536,0.001143778,0.0013397398,0.0019230611,0.0022601234,0.0015752345,0.00013799264],"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.000105521365,0.0000817212,0.003880025,0.000051196574,0.00009389956,0.00032616142,0.00022309854,0.94305575,0.0005695891,0.04468821,0.00030032016,0.0066244355],"study_design_scores_gemma":[0.000014934351,0.00008783995,0.0017784005,0.000033359305,0.000029721015,0.000065038366,0.0004481827,0.9499396,0.0002090713,0.046939466,0.0004349714,0.000019441803],"about_ca_topic_score_codex":0.0048169685,"about_ca_topic_score_gemma":0.004199204,"teacher_disagreement_score":0.0048169685,"about_ca_system_score_codex":0.0027927428,"about_ca_system_score_gemma":0.0009537339,"threshold_uncertainty_score":0.020262897},"labels":[],"label_agreement":null},{"id":"W2106810399","doi":"10.5267/j.dsl.2015.1.004","title":"FFLP problem with symmetric trapezoidal fuzzy numbers","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fuzzy logic; Mathematical optimization; Mathematics; Fuzzy number; Applied mathematics; Computer science; Fuzzy set; Artificial intelligence","score_opus":0.020390418193946026,"score_gpt":0.25034021813096147,"score_spread":0.22994979993701545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106810399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064680995,0.0004052979,0.98569864,0.00026202048,0.0000652182,0.00007849759,0.000092940354,0.000047246,0.0068821018],"genre_scores_gemma":[0.39266914,0.0012003218,0.59634703,0.0003058447,0.00015217277,0.0005014145,0.0003949599,0.00006863557,0.008360464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998458,0.0005567814,0.0001315049,0.0002802817,0.0004373959,0.00013592513],"domain_scores_gemma":[0.9991229,0.00053450913,0.00007508102,0.0000456483,0.00019329968,0.000028638726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020570925,0.001076795,0.0011967311,0.00065917504,0.0007544732,0.001774056,0.0013140023,0.0017024777,0.0035100172],"category_scores_gemma":[0.003013283,0.00039723032,0.0013742343,0.0010286175,0.0007874618,0.001642883,0.0010215772,0.0016374673,0.00039334074],"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.00013135571,0.0000722434,0.00053516286,0.0005324302,0.000077499506,0.0005259129,0.0002614612,0.76030844,0.004771695,0.14364071,0.0049934424,0.08414965],"study_design_scores_gemma":[0.000018098397,0.00005783605,0.00011260642,0.00003751309,0.000015452502,0.000118529126,0.000057875055,0.94521135,0.0013621923,0.04994603,0.003042726,0.000019694471],"about_ca_topic_score_codex":0.0040959595,"about_ca_topic_score_gemma":0.0021683285,"teacher_disagreement_score":0.0040959595,"about_ca_system_score_codex":0.00096634676,"about_ca_system_score_gemma":0.0014705537,"threshold_uncertainty_score":0.011742234},"labels":[],"label_agreement":null},{"id":"W2109460885","doi":"10.1109/fuzzy.2011.6007355","title":"Multi-level multi-objective decision problem through fuzzy random regression based objective function","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University; Universiti Tun Hussein Onn Malaysia","keywords":"Mathematical optimization; Computer science; Fuzzy logic; Pareto principle; Scheme (mathematics); Membership function; Fuzzy set; Function (biology); Mathematics; Artificial intelligence","score_opus":0.06129800702448464,"score_gpt":0.27025224479920223,"score_spread":0.2089542377747176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109460885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006611338,0.00013787058,0.99210197,0.00012480812,0.000009597113,0.000044566903,0.000016839733,0.00004987055,0.00090316776],"genre_scores_gemma":[0.46110472,0.0004203548,0.53528535,0.0001137658,0.000050581242,0.00048620708,0.00011203065,0.0000767193,0.0023502684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732447,0.0015549605,0.0000942621,0.00030937136,0.00051159,0.0002052952],"domain_scores_gemma":[0.99859625,0.000979181,0.00014479207,0.000040805204,0.00018469343,0.000054310643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004744765,0.00119033,0.001867894,0.0011841541,0.0004962842,0.0018095572,0.0014614036,0.001615465,0.0018976703],"category_scores_gemma":[0.0039531365,0.0005297122,0.0014209556,0.0013066,0.00081583223,0.0015127079,0.0013568851,0.0013469119,0.00026330107],"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.000030933992,0.000031842217,0.00025056474,0.000089437424,0.000040247458,0.00006616726,0.000036486083,0.9754421,0.0009927447,0.010590176,0.00030232297,0.01212697],"study_design_scores_gemma":[0.0000069731377,0.00002495327,0.000043097174,0.000006249995,0.000007975887,0.000011726925,0.000007887672,0.996997,0.00025229156,0.0024689173,0.00016827154,0.000004696837],"about_ca_topic_score_codex":0.0026148777,"about_ca_topic_score_gemma":0.0015530185,"teacher_disagreement_score":0.004744765,"about_ca_system_score_codex":0.0012130147,"about_ca_system_score_gemma":0.0015005613,"threshold_uncertainty_score":0.025093019},"labels":[],"label_agreement":null},{"id":"W2111830973","doi":"10.5539/ijsp.v3n4p54","title":"Modified Quick Convergent Inflow Algorithm for Solving Linear Programming Problems","year":2014,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maximization; Mathematical optimization; Variance (accounting); Mathematics; Linear programming; Inflow; Minification; Function (biology); Point (geometry); Interior point method; Algorithm; Convergence (economics); Penalty method; Computer science; Applied mathematics","score_opus":0.017870351110174407,"score_gpt":0.2623471607619417,"score_spread":0.2444768096517673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111830973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012017062,0.000058944155,0.9971727,0.000038653237,0.00002701804,0.000041542222,0.000014314512,0.00026217458,0.0011829132],"genre_scores_gemma":[0.048108112,0.00015884892,0.9465614,0.00012091367,0.0000490101,0.0006032918,0.00011405671,0.00026035935,0.0040240134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990558,0.0003416374,0.000044327666,0.00009182041,0.00038548387,0.00008093825],"domain_scores_gemma":[0.9982455,0.0010623586,0.00010089186,0.00009678038,0.00041914696,0.00007537206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002267472,0.0013712471,0.0012279155,0.0009052132,0.0006013683,0.0011397174,0.001796274,0.0015940897,0.0071461173],"category_scores_gemma":[0.004319037,0.0007405801,0.0009488423,0.0007815444,0.00088710437,0.0009470436,0.0013733591,0.0024406244,0.0019352316],"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.00021717788,0.000114858325,0.00037236355,0.00031994793,0.00006620361,0.00016889618,0.00011843709,0.76915485,0.00822321,0.0344152,0.004366752,0.18246214],"study_design_scores_gemma":[0.000032622924,0.00005774872,0.000046542846,0.00001430416,0.000005759925,0.00002829462,0.0000067435844,0.9921996,0.001222418,0.0043847524,0.0019918692,0.000009360129],"about_ca_topic_score_codex":0.003010823,"about_ca_topic_score_gemma":0.0026813387,"teacher_disagreement_score":0.0071461173,"about_ca_system_score_codex":0.0008156652,"about_ca_system_score_gemma":0.0021098393,"threshold_uncertainty_score":0.023906171},"labels":[],"label_agreement":null},{"id":"W2116919268","doi":"","title":"Incorporating the Managers Preferences in Project Scheduling Problem through the Goal Programming Model","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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":"Laurentian University; Université Laval; Defence Research and Development Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Operations research; Goal programming; Compromise; Nurse scheduling problem; Automated planning and scheduling; Tabu search; Schedule; Mathematical optimization; Dynamic priority scheduling; Management science; Two-level scheduling; Engineering; Artificial intelligence; Mathematics","score_opus":0.031243506690162664,"score_gpt":0.2747929609617782,"score_spread":0.24354945427161553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116919268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01906024,0.00018159415,0.9737229,0.0004029442,0.000021474425,0.000042402622,0.000055800592,0.00008432849,0.0064282683],"genre_scores_gemma":[0.59135664,0.001026575,0.4002161,0.00018313878,0.00007009572,0.00035008576,0.00013125986,0.00008951172,0.0065765935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987184,0.0008669359,0.00002936083,0.000076804026,0.00020693782,0.000101528676],"domain_scores_gemma":[0.9994862,0.00032448143,0.00006113594,0.000029004155,0.00005876101,0.0000404738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016171209,0.0006325289,0.00053423,0.00032158213,0.00033742422,0.0014717656,0.00093264837,0.0008764284,0.0013985045],"category_scores_gemma":[0.0018202697,0.00045520067,0.00062708405,0.00073177426,0.00035877526,0.0014730267,0.0007310953,0.0012196463,0.00038084673],"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.00006983611,0.0000578598,0.00040067555,0.0000958235,0.000037945927,0.00014222499,0.00018335834,0.8971157,0.0017398347,0.07855431,0.0006397122,0.020962767],"study_design_scores_gemma":[0.000023970495,0.000072943854,0.00015489235,0.000020295824,0.000026807204,0.000048342274,0.000064992484,0.9639718,0.0007507963,0.03156451,0.0032831125,0.00001750761],"about_ca_topic_score_codex":0.002144003,"about_ca_topic_score_gemma":0.0029642899,"teacher_disagreement_score":0.002144003,"about_ca_system_score_codex":0.00060950214,"about_ca_system_score_gemma":0.0015778203,"threshold_uncertainty_score":0.008552253},"labels":[],"label_agreement":null},{"id":"W2117619657","doi":"10.5539/mas.v7n7p59","title":"Reevaluating FMOLP Decision Variable Coefficients Using the SWAT Results for the Optimization of Sustainable Agricultural Land Use in Small Watershed","year":2013,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Watershed; Soil and Water Assessment Tool; SWAT model; Agriculture; Land use; Environmental science; Water resource management; Agricultural land; Agricultural engineering; Computer science; Hydrology (agriculture); Geography; Cartography; Ecology","score_opus":0.03145836592930898,"score_gpt":0.24454830527664023,"score_spread":0.21308993934733125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117619657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6450986,0.00012706322,0.34822428,0.0001754493,0.000029237643,0.00015139033,0.00022794525,0.00041116538,0.0055548074],"genre_scores_gemma":[0.8549679,0.00008254404,0.14374296,0.000019294419,0.0000034411685,0.00010654065,0.00016597613,0.000071757786,0.00083948043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.00010364468,0.00001020768,0.000020635818,0.000073675015,0.000031592215],"domain_scores_gemma":[0.9993013,0.00041923832,0.00004651141,0.000030821077,0.00018259828,0.000019561625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012563398,0.00073598936,0.0004935206,0.00069422345,0.00043833946,0.0007872878,0.0005233288,0.00048397502,0.001143492],"category_scores_gemma":[0.0022970329,0.00035927907,0.00061081175,0.00054952054,0.0002492401,0.0005128151,0.0003229906,0.00061149854,0.00013782564],"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.000027463862,0.00004386993,0.0022349171,0.000031088803,0.000015760088,0.000046475285,0.00002833974,0.9820203,0.0023289525,0.0005039036,0.00011426842,0.012604687],"study_design_scores_gemma":[0.0000061422124,0.000030121251,0.00043662172,0.000005207263,0.0000073213073,0.000006022481,0.00002912333,0.9972978,0.0017273113,0.00021412775,0.00023508722,0.0000051938127],"about_ca_topic_score_codex":0.024747137,"about_ca_topic_score_gemma":0.024277514,"teacher_disagreement_score":0.024747137,"about_ca_system_score_codex":0.00091827835,"about_ca_system_score_gemma":0.0015747172,"threshold_uncertainty_score":0.049206197},"labels":[],"label_agreement":null},{"id":"W2117803830","doi":"10.5267/j.ijiec.2014.12.003","title":"Designing a performance measurement system for supply chain using balanced scorecard, path analysis, cooperative game theory and evolutionary game theory: A Case Study","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Balanced scorecard; Game theory; Supply chain; Path (computing); Computer science; Evolutionary game theory; Mathematical optimization; Mathematical economics; Mathematics; Process management; Engineering; Business; Marketing","score_opus":0.06035245931985457,"score_gpt":0.2777466659242099,"score_spread":0.21739420660435532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117803830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153514,0.0002538516,0.47300884,0.00071558525,0.00004012389,0.0014333073,0.00019298536,0.00039051595,0.00861335],"genre_scores_gemma":[0.728208,0.00021143477,0.26938903,0.000031888467,0.000008824345,0.00039881197,0.0001404951,0.000021638263,0.0015898743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969562,0.0017585208,0.00016586494,0.00018480327,0.00074646703,0.00018810059],"domain_scores_gemma":[0.9974062,0.0014134978,0.00020683157,0.00018639595,0.000676023,0.00011098031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040305536,0.00064992456,0.00047927667,0.0018104576,0.0011445213,0.0018669597,0.00074080244,0.0012901778,0.0015199061],"category_scores_gemma":[0.004480215,0.00031656606,0.00045249655,0.0027353326,0.0008050385,0.0024307694,0.0010418618,0.0006060344,0.00022692823],"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.0007749551,0.0026171105,0.059521716,0.0013374313,0.00015978,0.0035991552,0.008301105,0.24175403,0.042579304,0.07310081,0.0045007877,0.5617538],"study_design_scores_gemma":[0.00016576723,0.00164802,0.017795607,0.00018073473,0.00013939364,0.00091757975,0.0048282486,0.9096473,0.03916405,0.012107093,0.0132538555,0.00015241961],"about_ca_topic_score_codex":0.0036768909,"about_ca_topic_score_gemma":0.0033896463,"teacher_disagreement_score":0.0040305536,"about_ca_system_score_codex":0.0017468436,"about_ca_system_score_gemma":0.001559642,"threshold_uncertainty_score":0.021315873},"labels":[],"label_agreement":null},{"id":"W2125734567","doi":"10.1002/mcda.492","title":"Group Decision Makers' Preferences Modelling within the Goal Programming Model: An Overview and a Typology","year":2012,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Typology; Goal programming; Articulation (sociology); Group decision-making; Preference; Management science; Decision model; Computer science; Decision maker; Decision analysis; Process (computing); Group (periodic table); Decision process; Operations research; Artificial intelligence; Psychology; Machine learning; Sociology; Economics; Engineering; Social psychology; Political science; Mathematical economics; Microeconomics","score_opus":0.0828717758745934,"score_gpt":0.3479270677816569,"score_spread":0.26505529190706345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125734567","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028639782,0.0065217237,0.91844267,0.00345326,0.00021745244,0.00013845826,0.00014194204,0.0001621493,0.042282667],"genre_scores_gemma":[0.69172895,0.008898507,0.2928511,0.0005029347,0.0003419618,0.00060433685,0.0002382279,0.000114540664,0.0047194622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946904,0.0035499157,0.00026480888,0.000394141,0.00084074115,0.00026003798],"domain_scores_gemma":[0.9972983,0.0017873956,0.00023881014,0.00022831102,0.0003099379,0.0001372198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052150646,0.0009394457,0.0008357335,0.0036724673,0.0009875096,0.006083744,0.001910136,0.0021925515,0.0021845035],"category_scores_gemma":[0.004693333,0.0004390334,0.0014147924,0.0049890396,0.0035649135,0.005797099,0.0024397154,0.0027294245,0.00047421965],"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.000034731325,0.000054240583,0.0012015161,0.00024453012,0.000060948394,0.00030360892,0.0012402559,0.026343549,0.0003533185,0.9369951,0.0014647271,0.031703465],"study_design_scores_gemma":[0.000022756778,0.00006288876,0.0004919941,0.00033475924,0.000047535796,0.00038083366,0.0013535019,0.16378239,0.0005295269,0.805803,0.027129008,0.00006175783],"about_ca_topic_score_codex":0.001425731,"about_ca_topic_score_gemma":0.0006577151,"teacher_disagreement_score":0.006083744,"about_ca_system_score_codex":0.0017306941,"about_ca_system_score_gemma":0.0011521346,"threshold_uncertainty_score":0.027580202},"labels":[],"label_agreement":null},{"id":"W2131088269","doi":"10.1016/s0165-0114(03)00260-4","title":"Duality in linear programming with fuzzy parameters and matrix games with fuzzy pay-offs","year":2003,"lang":"en","type":"article","venue":"Fuzzy Sets and Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Duality (order theory); Fuzzy logic; Dual (grammatical number); Linear programming; Mathematical optimization; Matrix (chemical analysis); Fuzzy number; Fuzzy set operations; Fuzzy classification; Fuzzy associative matrix; Fuzzy set; Algebra over a field; Discrete mathematics; Artificial intelligence; Computer science; Pure mathematics","score_opus":0.016235213090994398,"score_gpt":0.24477320793112886,"score_spread":0.22853799484013446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131088269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02755404,0.0032280032,0.92623895,0.0029681942,0.00037921933,0.00008443906,0.00017020386,0.000062483145,0.039314613],"genre_scores_gemma":[0.8217454,0.004922266,0.13731432,0.00075059885,0.0011214062,0.00054936256,0.00021454616,0.00015971993,0.033222202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995972,0.0027813753,0.000120732766,0.0003205732,0.0005219201,0.00028338036],"domain_scores_gemma":[0.98997176,0.008137229,0.00062572723,0.00028328842,0.0005926773,0.00038931565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006831389,0.002079098,0.0033993446,0.0019859986,0.0013498302,0.0061307168,0.002296644,0.0030516058,0.0053518945],"category_scores_gemma":[0.019149894,0.001400383,0.0017064291,0.002739807,0.0054452554,0.008766442,0.0030743538,0.005821872,0.0004846259],"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.00003856427,0.000035058525,0.0000759733,0.00007202102,0.000021755382,0.000040250496,0.00008720339,0.043122564,0.00013556007,0.9522811,0.0008617931,0.003228154],"study_design_scores_gemma":[0.000016573063,0.000018343066,0.000041936837,0.000022368358,0.000007992618,0.000022852231,0.000040208975,0.12108573,0.00005403439,0.8778716,0.0008060496,0.00001243271],"about_ca_topic_score_codex":0.0032336016,"about_ca_topic_score_gemma":0.0024743255,"teacher_disagreement_score":0.006831389,"about_ca_system_score_codex":0.004422716,"about_ca_system_score_gemma":0.0026030503,"threshold_uncertainty_score":0.036128283},"labels":[],"label_agreement":null},{"id":"W2133185406","doi":"10.1007/s00186-015-0516-y","title":"Extensions of the sequential stochastic assignment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"Air Force Office of Scientific Research","keywords":"Mathematical optimization; Extension (predicate logic); Computer science; Assignment problem; Generalized assignment problem; Mathematics","score_opus":0.26806749435509003,"score_gpt":0.48368437789569024,"score_spread":0.2156168835406002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133185406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038105592,0.0005998548,0.9337925,0.0012302811,0.0002738194,0.000093271534,0.0003761694,0.00013512839,0.02539342],"genre_scores_gemma":[0.62718165,0.0021641983,0.28988484,0.00065197627,0.0014348376,0.0005312731,0.0014101644,0.00025887368,0.076482214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978684,0.001142356,0.00010341374,0.00039587682,0.00031968224,0.0001703319],"domain_scores_gemma":[0.9956761,0.002356068,0.0006147384,0.0004788606,0.0004922445,0.00038208763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031196997,0.0010635792,0.001147177,0.00088022335,0.00067190855,0.001550088,0.0018706359,0.0010395527,0.012848353],"category_scores_gemma":[0.008528051,0.00057810935,0.0016305045,0.0015742967,0.0012220942,0.003296984,0.0021195847,0.0023186433,0.0010796968],"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.00015195012,0.00015998854,0.00049879245,0.00013934208,0.000056137855,0.00014517557,0.00012169336,0.21828836,0.0007074624,0.74334645,0.005677252,0.030707512],"study_design_scores_gemma":[0.000041669562,0.00007840609,0.0002593961,0.000018348961,0.00001911556,0.00009544273,0.00003595435,0.45541832,0.00015518116,0.5367242,0.0071383235,0.000015687141],"about_ca_topic_score_codex":0.002137006,"about_ca_topic_score_gemma":0.002707219,"teacher_disagreement_score":0.012848353,"about_ca_system_score_codex":0.0011020037,"about_ca_system_score_gemma":0.0019437465,"threshold_uncertainty_score":0.042981982},"labels":[],"label_agreement":null},{"id":"W2134787308","doi":"10.3138/infor.47.1.5","title":"A Discrete Stochastic Goal Program for Portfolio Selection: The Case of United Arab Emirates Equity Market","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Portfolio; Equity (law); Stochastic programming; Goal programming; Normality; Selection (genetic algorithm); Economics; Computer science; Econometrics; Portfolio optimization; Modern portfolio theory; Actuarial science; Financial economics; Operations research; Mathematical optimization; Mathematics; Statistics; Machine learning","score_opus":0.04476132573014004,"score_gpt":0.36763829448810154,"score_spread":0.3228769687579615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134787308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16008256,0.00026081665,0.82826024,0.001084596,0.000033243028,0.00012852736,0.00013141453,0.000110683446,0.009907976],"genre_scores_gemma":[0.88789696,0.00017577891,0.107248396,0.00010970892,0.000028516488,0.00022697773,0.00011524962,0.000023968309,0.0041745803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990382,0.0006460207,0.000020538917,0.0000839644,0.00011665777,0.0000946593],"domain_scores_gemma":[0.9984108,0.0011601868,0.00013949827,0.000034225708,0.00016961928,0.00008558904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027231537,0.0007019489,0.0007917793,0.0006564786,0.0004759525,0.0012976694,0.0008064059,0.0010671162,0.0021499905],"category_scores_gemma":[0.0033826851,0.00035066452,0.0007198732,0.00055932323,0.0008257968,0.0006817654,0.0010010173,0.0009604961,0.00010814687],"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.00002231147,0.000030917116,0.00035078064,0.000017237746,0.000017871367,0.00006315404,0.000024068677,0.9795829,0.00009998277,0.01667976,0.00025264625,0.002858353],"study_design_scores_gemma":[0.0000058860132,0.000010750343,0.000046088488,0.0000025016793,0.0000025975967,0.00000462065,0.0000064191267,0.9973028,0.000029711679,0.0024916604,0.000095436386,0.0000015569527],"about_ca_topic_score_codex":0.008377704,"about_ca_topic_score_gemma":0.0061950563,"teacher_disagreement_score":0.008377704,"about_ca_system_score_codex":0.0014681296,"about_ca_system_score_gemma":0.0017146815,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2135362276","doi":"10.1002/9780470400531.eorms0411","title":"Instance Formats for Mathematical Optimization Models","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Optimization and Mathematical Programming","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":"Dalhousie University","funders":"","keywords":"Solver; Computer science; Software; Set (abstract data type); Focus (optics); Mathematical software; Software engineering; Software package; Theoretical computer science; Programming language","score_opus":0.04739222563648038,"score_gpt":0.3122788937281135,"score_spread":0.26488666809163314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135362276","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020726877,0.0006362787,0.96954423,0.0011579001,0.00028613664,0.00024731533,0.0038138933,0.005894411,0.016347256],"genre_scores_gemma":[0.057450563,0.0019937549,0.9135221,0.000859205,0.00033239354,0.0010468083,0.0122546,0.0036112738,0.008929315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.991608,0.0035842299,0.001852472,0.00065983454,0.0019579865,0.00033748217],"domain_scores_gemma":[0.98050743,0.011697079,0.0010893517,0.004363287,0.002011307,0.00033161024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008511854,0.0017619939,0.0014753249,0.0032763302,0.0009798463,0.01097776,0.0056828805,0.0023631249,0.020823995],"category_scores_gemma":[0.033038583,0.0014375288,0.0027579635,0.006230872,0.0015271774,0.015195455,0.0043261726,0.0067808535,0.0066730324],"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.00009589745,0.000101512625,0.00027691585,0.00043410365,0.000041850726,0.00019782962,0.00023552208,0.018353937,0.00047810233,0.87977636,0.026137993,0.073870026],"study_design_scores_gemma":[0.00009597653,0.00004297706,0.00010986389,0.00044420004,0.00004182401,0.00037219524,0.00014144658,0.10138948,0.003505773,0.6748249,0.21896668,0.00006460863],"about_ca_topic_score_codex":0.0011890426,"about_ca_topic_score_gemma":0.00159812,"teacher_disagreement_score":0.020823995,"about_ca_system_score_codex":0.0020717995,"about_ca_system_score_gemma":0.0018375778,"threshold_uncertainty_score":0.06966317},"labels":[],"label_agreement":null},{"id":"W2136049019","doi":"10.1139/x2012-135","title":"Balancing equity and efficiency of goal programming for use in forest management planning","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Goal programming; Minimax; Decision maker; Computer science; Operations research; Set (abstract data type); Management by objectives; Equity (law); Multiple-criteria decision analysis; Mathematical optimization; Management science; Mathematics; Economics; Business; Marketing","score_opus":0.080473235801199,"score_gpt":0.3531321448333193,"score_spread":0.2726589090321203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136049019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076575023,0.00021572637,0.9841726,0.00042546037,0.00001371594,0.000062304876,0.000011904529,0.000036028705,0.0074048634],"genre_scores_gemma":[0.4235423,0.0007322131,0.57251346,0.00018712202,0.000069215675,0.00043060334,0.00004010647,0.00009656829,0.0023883372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943435,0.003690912,0.00018222893,0.00032943123,0.0012278677,0.00022604736],"domain_scores_gemma":[0.9918182,0.0069070295,0.00035798614,0.00036714578,0.00045729044,0.00009223995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010860254,0.0010184404,0.00083270296,0.0012808767,0.0010023706,0.0026297912,0.0009092799,0.0006282413,0.0017649729],"category_scores_gemma":[0.016932478,0.0004947975,0.00094177126,0.0014125549,0.002666433,0.0029321848,0.0022568656,0.0020128589,0.00019704238],"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.000056450917,0.0000669759,0.0007003149,0.00017962696,0.00005361635,0.00007340364,0.0004679901,0.2590192,0.0011368169,0.6352411,0.00050876057,0.10249574],"study_design_scores_gemma":[0.000031893585,0.00012051801,0.00045644454,0.00014883876,0.00004492465,0.000066981534,0.00020524299,0.43131435,0.001982023,0.56043154,0.0051668673,0.000030321075],"about_ca_topic_score_codex":0.0023223558,"about_ca_topic_score_gemma":0.003405544,"teacher_disagreement_score":0.010860254,"about_ca_system_score_codex":0.0022318412,"about_ca_system_score_gemma":0.0026892845,"threshold_uncertainty_score":0.057435155},"labels":[],"label_agreement":null},{"id":"W2138089115","doi":"10.5430/air.v2n4p75","title":"An interactive fuzzy satisficing method for random fuzzy multiobjective linear programming problems through fractile criteria optimization with possibility","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Satisficing; Mathematical optimization; Goal programming; Fuzzy logic; Linear programming; Pareto principle; Preference; Mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.09963363422740967,"score_gpt":0.4310779230352048,"score_spread":0.33144428880779514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138089115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021422412,0.000047911388,0.9970861,0.000027663951,0.000005739787,0.000014518538,0.0000037608172,0.000028555305,0.00064350065],"genre_scores_gemma":[0.2848389,0.0002421075,0.7121636,0.000056721685,0.000043168624,0.00023387001,0.000060407852,0.00006896228,0.0022922093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989957,0.00039466526,0.00004624022,0.00012317716,0.00038276243,0.000057522524],"domain_scores_gemma":[0.9991555,0.0005180498,0.000088690445,0.000058492362,0.00013886933,0.000040350125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001885602,0.0011558171,0.0007477147,0.0009745586,0.00055402034,0.0009518071,0.0015412391,0.0009743334,0.0027685263],"category_scores_gemma":[0.0027837085,0.00046228265,0.0012672081,0.00071100704,0.0009901829,0.0014069967,0.0015035943,0.0015010765,0.00028976554],"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.00008362882,0.000069929694,0.00039680448,0.0002255886,0.000087993496,0.00015032975,0.0002956997,0.7689877,0.007956533,0.11586864,0.00079017883,0.10508692],"study_design_scores_gemma":[0.000013133531,0.00004354119,0.0000512125,0.00001641347,0.000013396769,0.000032713666,0.000015925876,0.98285127,0.0014564166,0.014294924,0.0011981104,0.000012894352],"about_ca_topic_score_codex":0.0012915357,"about_ca_topic_score_gemma":0.0012606736,"teacher_disagreement_score":0.0027685263,"about_ca_system_score_codex":0.0007319064,"about_ca_system_score_gemma":0.00084849785,"threshold_uncertainty_score":0.009972155},"labels":[],"label_agreement":null},{"id":"W2139575211","doi":"10.1287/ijoc.12.3.223.12638","title":"A Simplex-Based Tabu Search Method for Capacitated Network Design","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":167,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Simplex; Integer programming; Set (abstract data type); Network planning and design; Integer (computer science); Mathematics; Column generation; Computer science; Fixed charge; Algorithm; Combinatorics","score_opus":0.04292685753506973,"score_gpt":0.30508229562650413,"score_spread":0.2621554380914344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139575211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048064105,0.00036201795,0.98923045,0.0000739589,0.000043619275,0.00010686576,0.00013442629,0.0010367752,0.00420549],"genre_scores_gemma":[0.1052816,0.00034268977,0.89001787,0.00009245845,0.000032481235,0.00075541844,0.00035275554,0.00047597772,0.0026486884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992034,0.00048066015,0.000018552488,0.00005425315,0.0002009649,0.000042159652],"domain_scores_gemma":[0.9988888,0.0007011346,0.00006525282,0.00007893318,0.00023323159,0.000032583484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012257291,0.0011941525,0.0011928747,0.0014409552,0.0008240129,0.00097108184,0.0012807521,0.0011485979,0.007239245],"category_scores_gemma":[0.0039300816,0.0007674427,0.0006585634,0.0027237935,0.0005648971,0.00072458514,0.0008054352,0.0013036373,0.0017874934],"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.00006849281,0.000053343578,0.00022360476,0.00009152642,0.00005076225,0.000024991024,0.00005121809,0.86184484,0.000953318,0.009965228,0.003375842,0.12329687],"study_design_scores_gemma":[0.00001321796,0.000016927097,0.000027523358,0.00000775626,0.000004909984,0.000008453397,0.0000063861276,0.9959014,0.00025794932,0.0025686957,0.0011816524,0.000005162606],"about_ca_topic_score_codex":0.006000961,"about_ca_topic_score_gemma":0.0053104847,"teacher_disagreement_score":0.007239245,"about_ca_system_score_codex":0.000840631,"about_ca_system_score_gemma":0.001646204,"threshold_uncertainty_score":0.024217725},"labels":[],"label_agreement":null},{"id":"W2145460126","doi":"10.1061/9780784413616.127","title":"Case Studies for the Planning and Monitoring of Unit- and Fixed-Price Contracts Using Project Scheduling Software","year":2014,"lang":"en","type":"article","venue":"Computing in Civil and Building Engineering (2014)","topic":"Optimization and Mathematical Programming","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Cash flow; Software; Computer science; Activity-based costing; Schedule; Scheduling (production processes); Software project management; Operations research; Engineering management; Software development; Operations management; Business; Finance; Engineering; Software construction; Accounting","score_opus":0.0464893035019804,"score_gpt":0.3091626853596981,"score_spread":0.2626733818577177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145460126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86928636,0.00032618866,0.11525203,0.0002729721,0.00002667175,0.0013628101,0.00076365256,0.00017433416,0.012535025],"genre_scores_gemma":[0.85951567,0.00025967773,0.13736,0.00001024916,0.000008051098,0.00066640746,0.00028938794,0.000026439047,0.0018640998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99715304,0.0018220705,0.00017468177,0.00016511245,0.00045841438,0.00022669772],"domain_scores_gemma":[0.98756814,0.009866371,0.00077319774,0.0006258123,0.00071224855,0.00045426324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043492094,0.0006873246,0.00042403027,0.002187398,0.0014248041,0.0013724477,0.0014667204,0.0013486975,0.003211466],"category_scores_gemma":[0.008634899,0.00050773623,0.00078918965,0.0039312225,0.00075501413,0.0012364786,0.00090618536,0.0008995137,0.00019909788],"study_design_candidate":"qualitative","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.0006637349,0.00118029,0.032240804,0.00042691984,0.0001232845,0.004841603,0.0016159014,0.8556838,0.0033137554,0.0277075,0.0020737257,0.07012859],"study_design_scores_gemma":[0.00030341014,0.0011555209,0.016913718,0.00015505083,0.00010610823,0.0009078312,0.0034838328,0.9466597,0.010328234,0.010508248,0.0093924515,0.000085975946],"about_ca_topic_score_codex":0.011779391,"about_ca_topic_score_gemma":0.020183083,"teacher_disagreement_score":0.011779391,"about_ca_system_score_codex":0.0029450213,"about_ca_system_score_gemma":0.0023206307,"threshold_uncertainty_score":0.023421645},"labels":[],"label_agreement":null},{"id":"W2149139265","doi":"10.3138/infor.48.3.143","title":"Goal Programming Model for Fire and Emergency Service Facilities Site Selection","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Decision maker; Operations research; Service (business); Process (computing); Computer science; Site selection; Selection (genetic algorithm); Goal programming; Function (biology); Decision-making; Operations management; Process management; Business; Engineering; Artificial intelligence; Marketing","score_opus":0.042454664129446706,"score_gpt":0.3167141210032354,"score_spread":0.2742594568737887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149139265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023483617,0.0006967227,0.9543646,0.0011759662,0.000113883754,0.0001395695,0.00044076008,0.00022938136,0.019355573],"genre_scores_gemma":[0.778847,0.0015191868,0.19874859,0.00038151199,0.00013005892,0.00095888047,0.00066502485,0.000085471176,0.018664273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987041,0.00076723535,0.00003826056,0.00014645416,0.00016366775,0.00018028398],"domain_scores_gemma":[0.9990387,0.0006649873,0.00008700151,0.000021071963,0.000118095784,0.00007012195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016889715,0.0012459417,0.0012007384,0.0006820058,0.0006275085,0.0021850865,0.0017454214,0.0017376115,0.0038668355],"category_scores_gemma":[0.0020225085,0.0005511924,0.0010656645,0.0014344977,0.0009851659,0.001094497,0.0011018189,0.0022114506,0.0005771269],"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.000047455484,0.00005590375,0.00020229713,0.00007401221,0.000039731316,0.00012028052,0.00008121073,0.938844,0.00020542818,0.05487273,0.0010436589,0.004413227],"study_design_scores_gemma":[0.000018983945,0.00002921764,0.00006802816,0.000009924916,0.000011463889,0.000012350697,0.000026197691,0.98309463,0.000055851593,0.01573654,0.00092949515,0.000007247857],"about_ca_topic_score_codex":0.016556865,"about_ca_topic_score_gemma":0.012052985,"teacher_disagreement_score":0.016556865,"about_ca_system_score_codex":0.0022903604,"about_ca_system_score_gemma":0.0028217325,"threshold_uncertainty_score":0.032920957},"labels":[],"label_agreement":null},{"id":"W2151042303","doi":"10.5539/jas.v6n12p194","title":"Linear Programming-Based Optimization of Synthetic Fertilizers Formulation","year":2014,"lang":"en","type":"article","venue":"Journal of Agricultural Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fertilizer; Yield (engineering); Mathematics; Production (economics); Linear programming; Agricultural engineering; Economics; Agronomy; Mathematical optimization; Engineering","score_opus":0.009363871438292199,"score_gpt":0.22600297820826612,"score_spread":0.21663910676997392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151042303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02169914,0.00038415464,0.96787584,0.0002624218,0.000060283088,0.00014998387,0.00023995737,0.00022828951,0.009099911],"genre_scores_gemma":[0.4495677,0.00062245165,0.5370715,0.00021343237,0.00008312845,0.0011695615,0.00070172956,0.00021803303,0.010352479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993856,0.0002889094,0.00002580245,0.00008824299,0.00014074009,0.000070633985],"domain_scores_gemma":[0.9987374,0.0009361255,0.00008097667,0.000021051306,0.00019958167,0.000024905123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012774196,0.0010797206,0.001190182,0.00057718385,0.00028738595,0.0011567308,0.0008620589,0.0011344132,0.00384723],"category_scores_gemma":[0.00203808,0.00061672344,0.0009323068,0.00083402905,0.0005151996,0.0005433109,0.00067255215,0.0014135708,0.0005019256],"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.000020196016,0.000020598492,0.000085000276,0.000073597046,0.000008703944,0.000027553315,0.000009851279,0.9919825,0.00042170045,0.0020656507,0.00029909855,0.0049855397],"study_design_scores_gemma":[0.000004959602,0.000022062413,0.000029085055,0.0000048210873,0.0000032673631,0.0000044849876,0.000008910851,0.99835604,0.00023368771,0.0010085629,0.00032205967,0.0000021340852],"about_ca_topic_score_codex":0.0053076465,"about_ca_topic_score_gemma":0.0040992675,"teacher_disagreement_score":0.0053076465,"about_ca_system_score_codex":0.0008946174,"about_ca_system_score_gemma":0.0016880262,"threshold_uncertainty_score":0.012870312},"labels":[],"label_agreement":null},{"id":"W2152797042","doi":"10.5539/mas.v6n4p12","title":"Hybrid Two-Stage Algorithm for Solving Transportation Problem","year":2012,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Applied Science Private University","keywords":"Simplex algorithm; Mathematical optimization; Computer science; Algorithm; Genetic algorithm; Linear programming; Population; Multi stage; Hybrid algorithm (constraint satisfaction); Mathematics; Stochastic programming; Engineering","score_opus":0.01549142708471356,"score_gpt":0.24490145994498988,"score_spread":0.2294100328602763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152797042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049877563,0.00013627966,0.9917641,0.00006196956,0.000038003207,0.0000784113,0.000026196029,0.00030944677,0.0025977725],"genre_scores_gemma":[0.171653,0.00025042458,0.8195504,0.00012591634,0.0000381107,0.000571398,0.00025282183,0.000106717365,0.0074512134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941385,0.00017490362,0.00003458449,0.00011714588,0.00019768171,0.00006192754],"domain_scores_gemma":[0.9996388,0.00017853212,0.000026375716,0.00003525296,0.00010226204,0.000018793673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321879,0.0007489849,0.0007821274,0.00089493825,0.000543205,0.00080067234,0.0017463246,0.0017155632,0.00502502],"category_scores_gemma":[0.0011779738,0.00050499884,0.0011277094,0.0009812143,0.00042743338,0.0010657066,0.0010312437,0.0010229708,0.00089160533],"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.00015248975,0.00012446693,0.0006758188,0.00018922932,0.00008604964,0.000107507985,0.00009561749,0.7907422,0.0062419064,0.026650667,0.0029562053,0.17197774],"study_design_scores_gemma":[0.000026727761,0.000054680953,0.00007938629,0.0000064491715,0.000008913371,0.000041084873,0.000006564327,0.9941922,0.0009213944,0.00264971,0.0020027345,0.000010191765],"about_ca_topic_score_codex":0.003966932,"about_ca_topic_score_gemma":0.0036440385,"teacher_disagreement_score":0.00502502,"about_ca_system_score_codex":0.0006678979,"about_ca_system_score_gemma":0.0012747955,"threshold_uncertainty_score":0.016810417},"labels":[],"label_agreement":null},{"id":"W2153593711","doi":"10.3138/infor.50.3.117","title":"A Goal Programming Model with Satisfaction Function for Risk Management and Optimal Portfolio Diversification","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diversification (marketing strategy); Mathematical optimization; Portfolio; Computer science; Goal programming; Scalar (mathematics); Project portfolio management; Set (abstract data type); Portfolio optimization; Mathematics; Project management; Economics; Marketing; Management","score_opus":0.0357329195835477,"score_gpt":0.28867419863416377,"score_spread":0.2529412790506161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153593711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005280891,0.0001549344,0.9894965,0.0003949782,0.000021742237,0.000028098602,0.00004282503,0.000047208367,0.0045328657],"genre_scores_gemma":[0.545905,0.0007598952,0.44236514,0.0003275039,0.00010132244,0.00054818083,0.00022841945,0.0000927457,0.009671788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.00076474267,0.000040359737,0.00015892592,0.00025282038,0.00011934829],"domain_scores_gemma":[0.9993118,0.00038635195,0.00007095228,0.00004205275,0.000111675356,0.00007715081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020353526,0.0010218702,0.0008899703,0.00067574496,0.00052908575,0.00227219,0.0012613547,0.0016388991,0.0033779896],"category_scores_gemma":[0.0026997905,0.00039607534,0.0011552024,0.0013552371,0.0010792959,0.0018561329,0.0015531464,0.002293291,0.00044873587],"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.000040432667,0.000071444265,0.00024212543,0.000094120085,0.0000452558,0.00011039839,0.00012476892,0.57383287,0.0009425583,0.4056991,0.0018685138,0.01692836],"study_design_scores_gemma":[0.000011355225,0.000033507502,0.000049978335,0.000012501116,0.0000095500645,0.000024285151,0.000018944598,0.90835536,0.00015600925,0.090049416,0.0012680844,0.000011006763],"about_ca_topic_score_codex":0.0023445885,"about_ca_topic_score_gemma":0.0016347467,"teacher_disagreement_score":0.0033779896,"about_ca_system_score_codex":0.0014473171,"about_ca_system_score_gemma":0.00180495,"threshold_uncertainty_score":0.011300564},"labels":[],"label_agreement":null},{"id":"W2154326504","doi":"10.1287/opre.1120.1041","title":"Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Polyhedron; Heuristics; Fixed charge; Projection (relational algebra); Facet (psychology); Variable (mathematics); Mathematical optimization; Fixed cost; Computer science; Space (punctuation); Transportation theory; Facility location problem; Charge (physics); Unit (ring theory); Fixed point; Mathematics; Combinatorics; Algorithm; Physics; Mathematical analysis","score_opus":0.059166430063894146,"score_gpt":0.3412065012197392,"score_spread":0.28204007115584506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154326504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255557,0.00047960147,0.85016966,0.0007756599,0.00009954552,0.00033412728,0.00073273364,0.00017212215,0.021680862],"genre_scores_gemma":[0.7607854,0.00096312235,0.22641304,0.00015115901,0.00010770125,0.00041960637,0.0011901155,0.00009665056,0.009873101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00021042764,0.000028501296,0.00013287892,0.00022073962,0.00013966861],"domain_scores_gemma":[0.9993981,0.00026716266,0.000067407585,0.00006836158,0.00010503137,0.00009381269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448434,0.0007220649,0.0008860506,0.00037743346,0.0008257893,0.002349089,0.0011584813,0.0011055702,0.0062486157],"category_scores_gemma":[0.0022860623,0.00035909284,0.0010248569,0.0010975035,0.0011521187,0.0025987567,0.0012879971,0.0015097132,0.00049825414],"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.00030571912,0.00025906164,0.002657754,0.0004128944,0.000067727815,0.0008989784,0.00036500668,0.44517574,0.004855097,0.4551166,0.007512758,0.08237268],"study_design_scores_gemma":[0.000065453314,0.00013223384,0.00093251455,0.000056527915,0.000022143175,0.00047225773,0.00035117214,0.6948493,0.0028061331,0.29207093,0.008206148,0.000035158144],"about_ca_topic_score_codex":0.004767458,"about_ca_topic_score_gemma":0.0026766593,"teacher_disagreement_score":0.0062486157,"about_ca_system_score_codex":0.00095241173,"about_ca_system_score_gemma":0.0015997979,"threshold_uncertainty_score":0.020903707},"labels":[],"label_agreement":null},{"id":"W2161805526","doi":"10.1017/cbo9781107282094.007","title":"Solving integer programs","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Optimization and Mathematical Programming","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","funders":"","keywords":"Selection (genetic algorithm); Focus (optics); Point (geometry); Section (typography); Reading (process); Computer science; Integer (computer science); Mathematics education; Range (aeronautics); Management science; Mathematics; Engineering; Artificial intelligence; Programming language; Political science","score_opus":0.021380664321275427,"score_gpt":0.18634084016887525,"score_spread":0.16496017584759984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161805526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035817903,0.013489521,0.6131752,0.0028445774,0.0009502826,0.0002524187,0.0014360284,0.001512868,0.36275727],"genre_scores_gemma":[0.059158865,0.028682912,0.7124398,0.0014661656,0.0010840023,0.0007795549,0.003915945,0.0012286924,0.1912441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990338,0.00024861662,0.000060660714,0.00014454637,0.00042154852,0.00009081309],"domain_scores_gemma":[0.99945027,0.0003525729,0.000043569482,0.000058253278,0.00007452357,0.000020838144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009277707,0.0016756441,0.00081143045,0.00072102004,0.0007850003,0.0037878517,0.001348657,0.0010766094,0.037871137],"category_scores_gemma":[0.0028652754,0.000718497,0.0011272964,0.0018983858,0.0008417182,0.0028658556,0.0019442812,0.0029012773,0.013594217],"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.000033884982,0.00009174004,0.00018794487,0.0011503636,0.000044549466,0.00016711508,0.00026975444,0.029548008,0.0016441622,0.5640902,0.108716495,0.29405576],"study_design_scores_gemma":[0.000029467146,0.000048631973,0.00017970755,0.00050414004,0.00002168817,0.00034437628,0.00014185635,0.04138101,0.0016818378,0.32582206,0.62982255,0.00002272541],"about_ca_topic_score_codex":0.0005159825,"about_ca_topic_score_gemma":0.0010115607,"teacher_disagreement_score":0.037871137,"about_ca_system_score_codex":0.0008508137,"about_ca_system_score_gemma":0.0012154805,"threshold_uncertainty_score":0.12669164},"labels":[],"label_agreement":null},{"id":"W2169662397","doi":"10.5267/j.msl.2014.1.019","title":"A fuzzy mixed integer programming for marketing planning","year":2014,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer programming; Fuzzy logic; Computer science; Marketing; Business; Artificial intelligence; Algorithm","score_opus":0.011221531366785269,"score_gpt":0.23531657291484306,"score_spread":0.2240950415480578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169662397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045093247,0.00094258453,0.98507565,0.00041824282,0.000099328645,0.000098659846,0.00017716669,0.00009900321,0.008579895],"genre_scores_gemma":[0.3363232,0.002550268,0.6461305,0.0003218614,0.00022811542,0.0008548926,0.00045360028,0.00008206863,0.013055429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991493,0.00045559937,0.00003839322,0.00013508485,0.00013615837,0.00008543226],"domain_scores_gemma":[0.9991955,0.00060628395,0.000057308087,0.000014595545,0.00009358612,0.000032747965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014674355,0.0014328033,0.0011235479,0.00081743294,0.000676473,0.0017639466,0.0011553768,0.0014006231,0.005933077],"category_scores_gemma":[0.0019177089,0.00061910093,0.0013476644,0.0015832997,0.0005756505,0.0010406268,0.0009053016,0.0018066862,0.0005931236],"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.000039122584,0.000053651383,0.00029641812,0.00016330578,0.00003859024,0.00010239687,0.00005447107,0.93885314,0.00040398302,0.027828652,0.0019483849,0.030217845],"study_design_scores_gemma":[0.000007703296,0.000032388478,0.000053682295,0.000019254523,0.000009204283,0.000013549898,0.000021996906,0.98896325,0.00011640037,0.009062047,0.0016936437,0.000006804765],"about_ca_topic_score_codex":0.010888437,"about_ca_topic_score_gemma":0.009529248,"teacher_disagreement_score":0.010888437,"about_ca_system_score_codex":0.0016648704,"about_ca_system_score_gemma":0.0022209394,"threshold_uncertainty_score":0.021650076},"labels":[],"label_agreement":null},{"id":"W2190179764","doi":"","title":"OPTIMUM ALLOCATION OF COMPUTER RESOURCES THROUGH GOAL PROGRAMMING","year":2015,"lang":"en","type":"article","venue":"IJITR International Journal of Innovative Technology and Research - IJITR International Journal of Innovative Technology and Research","topic":"Optimization and Mathematical Programming","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":"Trinity College","funders":"","keywords":"Computer science; Implementation; Goal programming; Process (computing); Computer programming; Program Design Language; Software engineering; Distributed computing; Operations research; Programming language; Engineering","score_opus":0.06166204085384396,"score_gpt":0.40145543531103056,"score_spread":0.3397933944571866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2190179764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013273474,0.0001774873,0.9773881,0.00027560617,0.000015288495,0.00009475996,0.00003922011,0.00012803599,0.008608041],"genre_scores_gemma":[0.5417779,0.0010326924,0.4500683,0.00014471814,0.000038877624,0.00058122305,0.00011973861,0.000111500245,0.0061250334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987795,0.0006593346,0.00003331279,0.000120558296,0.00025037644,0.00015690093],"domain_scores_gemma":[0.99901843,0.0007299378,0.00007842544,0.000025286203,0.000108712455,0.000039133312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610694,0.00080477045,0.0009389597,0.00076685747,0.0004043423,0.0019312294,0.0007428161,0.00086872646,0.0018999268],"category_scores_gemma":[0.002862326,0.000464578,0.000741543,0.0010602473,0.0009640404,0.0011424191,0.00088660367,0.001081876,0.000250973],"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.000035206376,0.000037513033,0.00019646787,0.00008470325,0.000023691982,0.000030890507,0.000057763922,0.9485367,0.0005963271,0.03620696,0.0005138779,0.013679817],"study_design_scores_gemma":[0.0000128106085,0.000051527884,0.00006472396,0.000019316527,0.000009702202,0.000009234733,0.000031136267,0.9745256,0.00034738844,0.023885012,0.0010371652,0.0000063731227],"about_ca_topic_score_codex":0.004084468,"about_ca_topic_score_gemma":0.0039714435,"teacher_disagreement_score":0.004084468,"about_ca_system_score_codex":0.0011910389,"about_ca_system_score_gemma":0.0025826637,"threshold_uncertainty_score":0.008641601},"labels":[],"label_agreement":null},{"id":"W2194624903","doi":"10.1007/s12351-015-0216-7","title":"Fuzzy chance-constrained geometric programming: the possibility, necessity and credibility approaches","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Credibility; Mathematical optimization; Computational intelligence; Ambiguity; Duality (order theory); Computer science; Credibility theory; Fuzzy logic; Optimization problem; Process (computing); Face (sociological concept); Mathematics; Artificial intelligence","score_opus":0.2686170978067754,"score_gpt":0.3633974369433609,"score_spread":0.09478033913658551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2194624903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007901699,0.0020705,0.974021,0.0023796381,0.00013564194,0.000030883206,0.000073858304,0.00003245753,0.013354283],"genre_scores_gemma":[0.71506584,0.0064020525,0.26293918,0.00054131023,0.001512955,0.00024099315,0.00017230232,0.00012952156,0.012995851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673504,0.0020138717,0.000116625604,0.00029620872,0.0006680873,0.00017005361],"domain_scores_gemma":[0.98429686,0.012764182,0.00092232245,0.00038316086,0.0010707467,0.00056280947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006646699,0.0015621344,0.001866672,0.002814826,0.001189842,0.0043102573,0.0021872115,0.002333054,0.004977785],"category_scores_gemma":[0.022983702,0.00095307804,0.0016987401,0.002770884,0.0054939752,0.0076122535,0.0028503977,0.0040714988,0.00032148894],"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.000019266516,0.000012418903,0.00014557166,0.00008001414,0.000030020734,0.000050690218,0.00007963701,0.041881796,0.00013176624,0.9486063,0.0008272537,0.008135286],"study_design_scores_gemma":[0.0000066434077,0.000018546129,0.00009380924,0.000049194612,0.000014042958,0.000044074935,0.000042106,0.147811,0.00010232163,0.8503231,0.0014769466,0.000018182698],"about_ca_topic_score_codex":0.0020627552,"about_ca_topic_score_gemma":0.001664704,"teacher_disagreement_score":0.006646699,"about_ca_system_score_codex":0.0026521184,"about_ca_system_score_gemma":0.0023169299,"threshold_uncertainty_score":0.03515148},"labels":[],"label_agreement":null},{"id":"W223119275","doi":"10.1023/a:1026102724889","title":"A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Initialization; Mathematical optimization; Heuristic; Integer programming; Theory of computation; Scaling; Mathematics; Integer (computer science); Computer science; Scale (ratio); Algorithm","score_opus":0.20830744040420834,"score_gpt":0.4026867677618781,"score_spread":0.19437932735766977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223119275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114730634,0.0023216952,0.85596156,0.0010005919,0.00032495524,0.00054272055,0.0005888502,0.0029794145,0.021549605],"genre_scores_gemma":[0.32271957,0.00051208556,0.670531,0.00034673588,0.000111649206,0.00056186353,0.00057145447,0.00044447358,0.0042011864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.00047341562,0.000027285618,0.000080095546,0.00012567434,0.00009161298],"domain_scores_gemma":[0.9980478,0.0013596372,0.000099089004,0.00014652159,0.0002639993,0.000082944964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974664,0.00106046,0.0017167977,0.0017666044,0.00085647707,0.0012863446,0.0021484618,0.0022897,0.010903109],"category_scores_gemma":[0.006198181,0.0009658962,0.0010332714,0.002922848,0.00081127323,0.001814754,0.0013531703,0.0015424312,0.0014003769],"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.00032457535,0.00025608455,0.00082020473,0.00014451279,0.000055222627,0.000051845454,0.00011901091,0.8285403,0.0009834782,0.0069543123,0.006870916,0.15487948],"study_design_scores_gemma":[0.00007498864,0.0000817194,0.00010816009,0.00001851031,0.000013338022,0.000011741221,0.00002879977,0.9955011,0.00013529492,0.003403436,0.00061487634,0.000007960608],"about_ca_topic_score_codex":0.006081879,"about_ca_topic_score_gemma":0.0051960703,"teacher_disagreement_score":0.010903109,"about_ca_system_score_codex":0.00073428446,"about_ca_system_score_gemma":0.0016915856,"threshold_uncertainty_score":0.036474586},"labels":[],"label_agreement":null},{"id":"W2249032529","doi":"10.1016/j.automatica.2015.09.013","title":"Local optimization of dynamic programs with guaranteed satisfaction of path constraints","year":2015,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Karush–Kuhn–Tucker conditions; Path (computing); Solver; Mathematical optimization; Mathematics; Bounded function; Convergence (economics); Point (geometry); Interior point method; Computer science","score_opus":0.010686258319215164,"score_gpt":0.21893277117581308,"score_spread":0.20824651285659793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249032529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054124888,0.00018077504,0.93832284,0.00025757198,0.000032255703,0.000047263882,0.00010707532,0.00029588531,0.00663145],"genre_scores_gemma":[0.8469721,0.00024840058,0.14350428,0.00010241679,0.00004392591,0.00029694746,0.00027034586,0.00041623868,0.008145362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.0005222165,0.00003136522,0.0002009894,0.00022295308,0.00016904598],"domain_scores_gemma":[0.9957846,0.0031384558,0.0003776316,0.00024209113,0.00026977822,0.00018743622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020796133,0.0010364875,0.0015480127,0.000794443,0.0005721339,0.0015786241,0.00147814,0.0011827282,0.00435673],"category_scores_gemma":[0.008169236,0.0008100395,0.0009893676,0.0008020587,0.001788781,0.0018567524,0.002735015,0.002046456,0.00046039565],"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.00015684136,0.000058371937,0.00026327677,0.00012745555,0.000045523542,0.00006953451,0.00008920645,0.89115316,0.0016118032,0.093407586,0.0011335748,0.011883627],"study_design_scores_gemma":[0.000020256371,0.00005249175,0.00005743891,0.000009057974,0.0000071607546,0.000010864294,0.000018550641,0.9629884,0.00049374916,0.036032833,0.00030253213,0.0000067508004],"about_ca_topic_score_codex":0.0028193695,"about_ca_topic_score_gemma":0.0031484251,"teacher_disagreement_score":0.00435673,"about_ca_system_score_codex":0.0015792714,"about_ca_system_score_gemma":0.0017567129,"threshold_uncertainty_score":0.014574766},"labels":[],"label_agreement":null},{"id":"W2250241007","doi":"10.3138/infor.52.3.138","title":"A Fuzzy Goal Programming Model for Venture Capital Investment Decision Making","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Venture capital; Cardinality (data modeling); Investment (military); Fuzzy logic; Selection (genetic algorithm); Computer science; Operations research; Process (computing); Capital (architecture); Decision-making; Economics; Business; Actuarial science; Finance; Operations management; Mathematics; Artificial intelligence; Data mining","score_opus":0.03860612207624459,"score_gpt":0.32919156314355497,"score_spread":0.2905854410673104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250241007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009908089,0.00037185237,0.97959465,0.00062905153,0.000046676712,0.00007110151,0.0002136609,0.00009864596,0.009066181],"genre_scores_gemma":[0.65169543,0.0011737135,0.3348,0.00031220634,0.000090316855,0.00077014684,0.00040306977,0.000051244824,0.010703893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990484,0.00046062664,0.000042918484,0.00015719933,0.00018618756,0.0001046708],"domain_scores_gemma":[0.99928975,0.00048635274,0.000061691106,0.00001884516,0.00009436645,0.00004901385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016252843,0.001067036,0.0009812168,0.0007555431,0.00062561827,0.0023691966,0.0015479206,0.0019004667,0.0033122902],"category_scores_gemma":[0.002068854,0.00048138323,0.0011174951,0.0012912595,0.0010056975,0.0014324753,0.0010981278,0.0019151488,0.0004926898],"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.00003448145,0.000040632178,0.00018938194,0.000088624,0.00003514179,0.00013992998,0.0001062227,0.88783735,0.00043479467,0.10039351,0.0008624623,0.009837393],"study_design_scores_gemma":[0.000012469642,0.000026101485,0.000057205587,0.00001676961,0.000009609528,0.000021965176,0.000020401112,0.9615375,0.00010010017,0.03708624,0.0011017679,0.0000098054625],"about_ca_topic_score_codex":0.008420427,"about_ca_topic_score_gemma":0.005601095,"teacher_disagreement_score":0.008420427,"about_ca_system_score_codex":0.0018521405,"about_ca_system_score_gemma":0.0021743865,"threshold_uncertainty_score":0.016742826},"labels":[],"label_agreement":null},{"id":"W2260140128","doi":"10.3138/infor.52.3.97","title":"Modelling Investment Optimization on Smallholder Farms through Multiple Criteria Decision Making and Goal Programming: A Case Study from Ethiopia","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Portfolio; Goal programming; Computer science; Investment (military); Agriculture; Linear programming; Set (abstract data type); Decision maker; Operations research; Time horizon; Mathematical optimization; Economics; Management science; Mathematics; Finance; Geography","score_opus":0.09141171868760253,"score_gpt":0.359710019974783,"score_spread":0.26829830128718046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260140128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.944166,0.00032614704,0.049199224,0.00051029003,0.000010836023,0.00016062273,0.00030521356,0.00003948117,0.005282192],"genre_scores_gemma":[0.97137266,0.000261008,0.026947353,0.000027274724,0.00000554825,0.000090747,0.00009688652,0.000010882119,0.0011877494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00048228633,0.000021149177,0.000056245797,0.00004728852,0.00009003031],"domain_scores_gemma":[0.9958484,0.0036030603,0.0002011028,0.000078956335,0.00012510286,0.000143294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019735198,0.00079334836,0.00062738446,0.0006664774,0.0007855776,0.0018539954,0.0009061124,0.0017193462,0.0017109343],"category_scores_gemma":[0.0030597274,0.00040728183,0.00070512865,0.0012695561,0.0007665196,0.0010266688,0.0008104108,0.00093964924,0.00009953431],"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.00009652646,0.00027048524,0.004897362,0.00006806366,0.00003632046,0.0009422648,0.00019042725,0.9796693,0.0004762177,0.0072427383,0.00027803876,0.0058323103],"study_design_scores_gemma":[0.000055105796,0.00015479303,0.002244595,0.000034678145,0.000025091278,0.00007569753,0.0008542844,0.98932356,0.00073780824,0.0055993553,0.0008704365,0.000024601088],"about_ca_topic_score_codex":0.016920147,"about_ca_topic_score_gemma":0.018917399,"teacher_disagreement_score":0.016920147,"about_ca_system_score_codex":0.0020709431,"about_ca_system_score_gemma":0.0014505782,"threshold_uncertainty_score":0.033643305},"labels":[],"label_agreement":null},{"id":"W2270839823","doi":"10.1007/978-3-319-12307-3_3","title":"Solving the Linear Transportation Problem by Modified Vogel Method","year":2015,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Laurentian University","funders":"","keywords":"Transportation theory; Simplex algorithm; Mathematical optimization; Intuition; Reduction (mathematics); Linear programming; Matrix (chemical analysis); Simplex; Computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.02709272304401239,"score_gpt":0.26491603033691186,"score_spread":0.23782330729289947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270839823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005519387,0.0003811783,0.98817784,0.00017391122,0.000120357305,0.000026848224,0.000050957042,0.00017360633,0.005375832],"genre_scores_gemma":[0.23474123,0.0009118766,0.7211672,0.00021416579,0.00020178738,0.0003476506,0.00033865226,0.00075871043,0.041318808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999767,0.0000828556,0.000009527726,0.00004425274,0.00006289883,0.000033380096],"domain_scores_gemma":[0.9997073,0.00017863973,0.000020610887,0.000025812677,0.000049880946,0.000017732453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941664,0.00072724913,0.0009093899,0.0005871089,0.00035240653,0.0006875595,0.0014757295,0.0010269191,0.0064018373],"category_scores_gemma":[0.0010840694,0.00042112623,0.0011240371,0.00058618124,0.00083643576,0.0010520573,0.0014877872,0.0015470483,0.0012304971],"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.00011696012,0.000085786865,0.00035870366,0.00039592048,0.00010878254,0.00011579234,0.00015609614,0.64092964,0.009011779,0.2240777,0.009303267,0.11533949],"study_design_scores_gemma":[0.000012152961,0.000019814632,0.0000597774,0.000009302558,0.000008326268,0.000017822498,0.00001323173,0.96785074,0.0005802985,0.028153341,0.0032645136,0.0000107995575],"about_ca_topic_score_codex":0.005463613,"about_ca_topic_score_gemma":0.0048676,"teacher_disagreement_score":0.0064018373,"about_ca_system_score_codex":0.0005304466,"about_ca_system_score_gemma":0.00095692463,"threshold_uncertainty_score":0.021416306},"labels":[],"label_agreement":null},{"id":"W2270848256","doi":"10.5267/j.uscm.2015.12.002","title":"Solving a fuzzy multi-objective products and time planning using hybrid meta-heuristic algorithm: Gas refinery case study","year":2016,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Refinery; Meta heuristic; Computer science; Fuzzy logic; Heuristic; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Waste management","score_opus":0.03590131261841701,"score_gpt":0.26714954074713976,"score_spread":0.23124822812872275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270848256","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7447006,0.0010777405,0.23296702,0.00083788077,0.00006236814,0.0003175607,0.00065189466,0.00022338169,0.019161392],"genre_scores_gemma":[0.9319173,0.0003096485,0.06443062,0.000034143468,0.0000122708125,0.00015336314,0.00013944725,0.000016682337,0.0029865762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.00015983358,0.000014867435,0.000042144748,0.000043398508,0.00006434512],"domain_scores_gemma":[0.9993111,0.00049551274,0.000055590488,0.000028740873,0.000063622705,0.00004540622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506909,0.00082122895,0.00083768007,0.000978901,0.00079991174,0.0010978758,0.0009915909,0.002363506,0.0027693573],"category_scores_gemma":[0.001097341,0.00044790423,0.0009063416,0.0012758378,0.0005923581,0.000613783,0.0005365627,0.00068782526,0.000104271094],"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.000046104113,0.000056321453,0.00037095105,0.000047376565,0.000018650126,0.00019851279,0.00002384523,0.9939116,0.0002952314,0.0015697875,0.00018107145,0.0032804618],"study_design_scores_gemma":[0.000017536893,0.000035557263,0.00012921779,0.000004642349,0.000008685755,0.000020435924,0.00003645116,0.9986206,0.0003668223,0.000535056,0.0002203349,0.000004669416],"about_ca_topic_score_codex":0.024177447,"about_ca_topic_score_gemma":0.017925477,"teacher_disagreement_score":0.024177447,"about_ca_system_score_codex":0.0017376487,"about_ca_system_score_gemma":0.0014683763,"threshold_uncertainty_score":0.04807341},"labels":[],"label_agreement":null},{"id":"W2280827137","doi":"","title":"Implementation of a Modified Multi Objective Optimization GA Algorithm in A Stealth Assessment for School Readiness","year":2015,"lang":"en","type":"article","venue":"Global Learn","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Optimization algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.03249517123770223,"score_gpt":0.3514941461909186,"score_spread":0.3189989749532164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280827137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16531119,0.000075126176,0.8215257,0.00023464498,0.00009346171,0.00021159244,0.0000667998,0.00097248267,0.011508965],"genre_scores_gemma":[0.7362437,0.000032079246,0.25914145,0.000073340394,0.000010907545,0.00017654408,0.000078679914,0.000072721996,0.0041705947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997125,0.000085408625,0.000011738082,0.000049822447,0.00009253935,0.00004811365],"domain_scores_gemma":[0.99967515,0.000106728075,0.000030580788,0.000027602686,0.00013750762,0.000022345235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305859,0.00054433855,0.00049294555,0.0006253571,0.000450471,0.0005862036,0.00087886944,0.0010579701,0.0026403354],"category_scores_gemma":[0.0011659848,0.00023900886,0.0004997174,0.0003029867,0.00023933407,0.00041646432,0.0006237318,0.0005315302,0.0003691625],"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.00008836872,0.00016420028,0.0020544825,0.000038706487,0.00004348315,0.00008374501,0.000054218348,0.8902752,0.0071979705,0.0021948372,0.00072777283,0.097077],"study_design_scores_gemma":[0.00000915352,0.00006092825,0.00045193755,0.0000041991884,0.000010518922,0.000011417767,0.000015585192,0.99719524,0.0015518179,0.00029296058,0.00039081342,0.000005423804],"about_ca_topic_score_codex":0.0062016887,"about_ca_topic_score_gemma":0.0063614785,"teacher_disagreement_score":0.0062016887,"about_ca_system_score_codex":0.0004648294,"about_ca_system_score_gemma":0.0010517541,"threshold_uncertainty_score":0.012331188},"labels":[],"label_agreement":null},{"id":"W2313585617","doi":"10.1111/j.1475-3995.2000.tb00181.x","title":"Editorial","year":2000,"lang":"en","type":"editorial","venue":"International Transactions in Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"University of Portsmouth","keywords":"Citation; Computer science; Library science; Humanities; Philosophy","score_opus":0.031106467099299446,"score_gpt":0.37665995854916934,"score_spread":0.3455534914498699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313585617","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043171924,0.004390577,0.00008101811,0.020979568,0.9683939,0.000023281045,0.000054909644,0.000045303717,0.005988275],"genre_scores_gemma":[0.00082900794,0.0042895065,0.00012878452,0.023218151,0.9261215,0.000037859038,0.00009197786,0.000064620894,0.04521862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967494,0.00048518297,0.0003823026,0.00046402172,0.0015935003,0.00032563705],"domain_scores_gemma":[0.9847377,0.0033311222,0.0013987895,0.00071201887,0.0071951486,0.0026252044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003617725,0.0027811113,0.0026575185,0.004321634,0.002562133,0.006796341,0.002355429,0.010162993,0.048819233],"category_scores_gemma":[0.02281928,0.0008741948,0.0015424385,0.0015665926,0.0014812371,0.0032586881,0.0018615786,0.0101177385,0.03368997],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018215052,0.0000058208475,0.000013731908,0.00008402385,0.000006274868,0.00009046903,0.0000054733036,0.000008700209,0.000031780735,0.00012928169,0.9944661,0.0051400634],"study_design_scores_gemma":[0.000028287206,0.000012100024,0.0001294798,0.00019830777,0.00002098007,0.00020701275,0.000020193524,0.000034767556,0.00006218774,0.00040172072,0.99887794,0.000007032437],"about_ca_topic_score_codex":0.0010007847,"about_ca_topic_score_gemma":0.0025274027,"teacher_disagreement_score":0.95118076,"about_ca_system_score_codex":0.0020947214,"about_ca_system_score_gemma":0.002424032,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2315982544","doi":"10.15244/pjoes/28643","title":"A Simulation-Based Nonlinear Goal Programming Model for Groundwater Remediation Systems Design","year":2014,"lang":"en","type":"article","venue":"Polish Journal of Environmental Studies","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Environmental remediation; Groundwater remediation; Groundwater; Goal programming; Environmental science; Nonlinear system; Computer science; Engineering; Geotechnical engineering; Operations research; Ecology; Contamination","score_opus":0.039292019759066266,"score_gpt":0.2671689631769241,"score_spread":0.22787694341785786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315982544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01012927,0.00008921071,0.98608845,0.00015625777,0.000017259206,0.000049202412,0.000057404803,0.00014039902,0.003272648],"genre_scores_gemma":[0.6932451,0.00035777147,0.29986054,0.000115659066,0.00003291056,0.00075972587,0.00021463248,0.000081302,0.005332343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00024559512,0.000014504857,0.000055183253,0.00008028518,0.00004996024],"domain_scores_gemma":[0.99928135,0.0005004491,0.00006698742,0.000017992868,0.00009796683,0.00003536148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011037677,0.0009875863,0.000909897,0.0005030238,0.0004194853,0.000852206,0.0011167187,0.0010079786,0.0018472861],"category_scores_gemma":[0.0017397609,0.0004939973,0.00091128476,0.0005121688,0.00081996527,0.0005763277,0.0009261775,0.001192213,0.000238617],"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.000006552673,0.000005988828,0.000052689655,0.000008388889,0.000004721271,0.00000599588,0.0000066602943,0.99654704,0.00007793036,0.0022505973,0.000045630546,0.0009877403],"study_design_scores_gemma":[0.000002781517,0.0000056586177,0.000010154407,0.0000013883459,0.0000016816059,0.0000012408362,0.0000015868933,0.99892753,0.00003825839,0.00089336385,0.00011522094,0.0000010842476],"about_ca_topic_score_codex":0.009970147,"about_ca_topic_score_gemma":0.007231617,"teacher_disagreement_score":0.009970147,"about_ca_system_score_codex":0.0011473414,"about_ca_system_score_gemma":0.0021054547,"threshold_uncertainty_score":0.019824266},"labels":[],"label_agreement":null},{"id":"W2317651347","doi":"10.5509/2014874809","title":"An Elusive Quest with Mixed Results","year":2014,"lang":"en","type":"article","venue":"Pacific Affairs","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.005566549228692413,"score_gpt":0.19898883943477283,"score_spread":0.19342229020608043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317651347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022759851,0.031523697,0.32512712,0.29463696,0.0058416175,0.000057244382,0.0010388257,0.00038900573,0.3186257],"genre_scores_gemma":[0.641236,0.020983452,0.16565283,0.048192486,0.022302166,0.0005911805,0.0008383264,0.0009804441,0.09922309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99620557,0.0019499778,0.00016045397,0.0004694517,0.001028322,0.00018621296],"domain_scores_gemma":[0.9878889,0.008245638,0.0005236315,0.0014108077,0.0013574645,0.00057356386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071930317,0.0010056884,0.002194079,0.0019591267,0.0047685127,0.009635596,0.0023914876,0.0054474226,0.014257641],"category_scores_gemma":[0.031938963,0.0007854354,0.0011160477,0.0021830632,0.012197297,0.021632023,0.0055696634,0.012534328,0.0022661078],"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.000006841462,0.000006637932,0.00004425991,0.000023853354,0.000007163858,0.000008841216,0.000026937854,0.00017461098,0.000012849659,0.991734,0.005315352,0.0026386203],"study_design_scores_gemma":[0.0000028090567,0.0000016734018,0.000015898824,0.000018687484,0.0000020145808,0.000009670403,0.000013934028,0.00065491284,0.000011804653,0.99584454,0.0034214235,0.0000027040003],"about_ca_topic_score_codex":0.0016821561,"about_ca_topic_score_gemma":0.0018125742,"teacher_disagreement_score":0.014257641,"about_ca_system_score_codex":0.0024457448,"about_ca_system_score_gemma":0.0022324827,"threshold_uncertainty_score":0.04769653},"labels":[],"label_agreement":null},{"id":"W2327057938","doi":"10.1504/ijor.2015.065937","title":"Coping with uncertainties in production planning through fuzzy mathematical programming: application to steel rolling industry","year":2014,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Fuzzy logic; Production planning; Production (economics); Computer science; Fuzzy set; Membership function; Fuzzy number; Linear programming; Bilinear interpolation; Mathematics; Operations research; Economics; Artificial intelligence","score_opus":0.06193963089791538,"score_gpt":0.3851503910772,"score_spread":0.32321076017928463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327057938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17233719,0.00048517325,0.82045513,0.00067068014,0.000037606464,0.00008871927,0.000059713453,0.0001302124,0.0057355645],"genre_scores_gemma":[0.85238206,0.00042513266,0.14538449,0.000045421664,0.000030251467,0.00008874551,0.000039113413,0.000028122568,0.0015766579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999579,0.00022470565,0.00001770848,0.000042788306,0.00008567775,0.000050031565],"domain_scores_gemma":[0.9982436,0.001466124,0.00010309944,0.00003883723,0.00010020969,0.000048194797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016854393,0.00077354995,0.0010802103,0.0005075132,0.0008169961,0.0013524714,0.00080150174,0.0015677185,0.0013656132],"category_scores_gemma":[0.0026832114,0.0003897274,0.0007059486,0.0010942474,0.0007417879,0.0007686569,0.001078915,0.0014058996,0.00011113399],"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.000014283942,0.000018010005,0.000092085334,0.000022630576,0.000005231692,0.000032129672,0.000027190717,0.99422073,0.00020145556,0.0018437953,0.000034622917,0.003487823],"study_design_scores_gemma":[0.0000025409513,0.000013794315,0.00002211978,0.000002216037,0.0000019907689,0.0000052395726,0.000015507989,0.9985065,0.0001560291,0.0011878364,0.00008414499,0.0000021235787],"about_ca_topic_score_codex":0.009466271,"about_ca_topic_score_gemma":0.0050692777,"teacher_disagreement_score":0.009466271,"about_ca_system_score_codex":0.00085388945,"about_ca_system_score_gemma":0.0010905769,"threshold_uncertainty_score":0.018822312},"labels":[],"label_agreement":null},{"id":"W2344254384","doi":"10.3166/jesa.49.31-53","title":"Approches d’optimisation de parcours dans un hypermarché","year":2016,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geology","score_opus":0.018159913038236757,"score_gpt":0.2396864679616077,"score_spread":0.22152655492337095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344254384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033490043,0.0002967686,0.95574474,0.00026414383,0.00013030482,0.00009084682,0.00006473968,0.00050636043,0.009411995],"genre_scores_gemma":[0.59067494,0.000485597,0.38665396,0.0001272704,0.0001218705,0.000300296,0.0001804938,0.00042690884,0.021028642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910516,0.0003375155,0.000036187186,0.0001820756,0.00021657858,0.0001224957],"domain_scores_gemma":[0.99875367,0.000774293,0.000073809744,0.00010782511,0.00019560855,0.00009480207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016462127,0.0015309353,0.0019559304,0.000950841,0.0013312522,0.0029797165,0.0016724253,0.0028556825,0.008099608],"category_scores_gemma":[0.0032086524,0.0008672498,0.001534253,0.0008532945,0.0014471236,0.0018803682,0.0020284487,0.0020059661,0.0013379616],"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.00020743252,0.000055430224,0.00018457403,0.000060605867,0.000037794325,0.00007749037,0.00005547798,0.9665195,0.0020994635,0.008963026,0.0004951347,0.021244124],"study_design_scores_gemma":[0.000023052606,0.00004017571,0.00006642554,0.000007932614,0.0000067075393,0.000010506279,0.000018973427,0.9961373,0.0006007928,0.0023200156,0.0007611598,0.0000069213834],"about_ca_topic_score_codex":0.012410682,"about_ca_topic_score_gemma":0.009278076,"teacher_disagreement_score":0.012410682,"about_ca_system_score_codex":0.0012128546,"about_ca_system_score_gemma":0.0015665442,"threshold_uncertainty_score":0.027095914},"labels":[],"label_agreement":null},{"id":"W2345988899","doi":"10.5539/jmr.v8n3p1","title":"Heuristic Algorithms for Solving Multiobjective Transportation Problems","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Heuristic; Mathematical optimization; Mathematics; Algorithm; Multi-objective optimization; Null-move heuristic; Computer science; Job shop scheduling; Routing (electronic design automation)","score_opus":0.10347043435953183,"score_gpt":0.3701570154086054,"score_spread":0.26668658104907356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345988899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00447531,0.0010293473,0.98995155,0.00014370037,0.00009181242,0.00009636441,0.000056286808,0.00023710291,0.0039184727],"genre_scores_gemma":[0.12312788,0.0014680225,0.87181306,0.00016436221,0.000105584375,0.00048591397,0.00022464254,0.00012361121,0.0024868168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876463,0.0005970528,0.00006606128,0.00012710641,0.00032618621,0.000118911776],"domain_scores_gemma":[0.9985257,0.0010386107,0.00011563099,0.000094461524,0.00017841294,0.000047288297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020070712,0.001689972,0.0012409702,0.0019039814,0.00081805524,0.0016050547,0.0015123276,0.0017921551,0.00316818],"category_scores_gemma":[0.004398693,0.0007214061,0.0013679366,0.002335317,0.0010293409,0.0010960454,0.00086895295,0.00168437,0.00066171255],"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.00004519991,0.000042777152,0.00018632405,0.00019713743,0.00006726338,0.00006121575,0.000053080985,0.9133012,0.00059373665,0.027472857,0.0015615772,0.05641762],"study_design_scores_gemma":[0.000047688565,0.000029209847,0.000048812155,0.00004187598,0.000018357916,0.000029143735,0.000027450058,0.97637606,0.00054015714,0.01966061,0.0031700735,0.00001063027],"about_ca_topic_score_codex":0.0046336753,"about_ca_topic_score_gemma":0.00364716,"teacher_disagreement_score":0.0046336753,"about_ca_system_score_codex":0.0013404845,"about_ca_system_score_gemma":0.0016609677,"threshold_uncertainty_score":0.010614514},"labels":[],"label_agreement":null},{"id":"W2397154059","doi":"10.1080/03155986.2004.11732700","title":"Goal Programming Formulations For A Comparative Analysis Of Scalar Norms And Ordinal Vs. Ratio Data","year":2004,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ambiguity; Computer science; Ordinal data; Metric (unit); Stability (learning theory); Variety (cybernetics); Data mining; Econometrics; Machine learning; Artificial intelligence; Statistics; Mathematics; Engineering","score_opus":0.10783262454389553,"score_gpt":0.38710127594971316,"score_spread":0.27926865140581764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397154059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042700646,0.0005073035,0.99055964,0.0005246407,0.00005443494,0.000072797404,0.000112633585,0.000066744775,0.0038317281],"genre_scores_gemma":[0.20456603,0.001808439,0.7879839,0.000488022,0.00022956851,0.0012858906,0.00052194594,0.00025175686,0.0028644362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98646796,0.01028199,0.00050815224,0.0007019459,0.0017374703,0.0003024386],"domain_scores_gemma":[0.9415529,0.051381685,0.0029521591,0.001135614,0.0025984573,0.000379169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02273824,0.0019933642,0.0012597764,0.0026438197,0.0006495759,0.003429521,0.0016209247,0.0013480746,0.0047139153],"category_scores_gemma":[0.058435243,0.0006053994,0.00199186,0.0033261736,0.002273215,0.004702042,0.001916221,0.0039412486,0.0006186792],"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.00012078094,0.00019421606,0.0014008824,0.00039653,0.00017944824,0.00008305579,0.00033355557,0.33336997,0.00036207115,0.60265034,0.00269435,0.05821478],"study_design_scores_gemma":[0.000018465187,0.00016299568,0.00043730947,0.00010853008,0.000029351158,0.000036745114,0.00010714809,0.69293064,0.00034767837,0.3022512,0.0035353713,0.000034565717],"about_ca_topic_score_codex":0.0029425428,"about_ca_topic_score_gemma":0.002457058,"teacher_disagreement_score":0.02273824,"about_ca_system_score_codex":0.0027068995,"about_ca_system_score_gemma":0.0026809818,"threshold_uncertainty_score":0.12025273},"labels":[],"label_agreement":null},{"id":"W2399843333","doi":"10.1080/03155986.2004.11732710","title":"A Goal Programming Approach For A Multi Period Task Assignment Problem","year":2004,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Goal programming; Task (project management); Period (music); Computer science; Goal setting; Goal orientation; Operations research; Psychology; Mathematics; Engineering; Social psychology; Systems engineering","score_opus":0.061791170494660576,"score_gpt":0.3278699342839413,"score_spread":0.2660787637892807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399843333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034738597,0.00014564524,0.9927476,0.00025345423,0.000022542888,0.000053526674,0.000031763597,0.000060046015,0.0032116189],"genre_scores_gemma":[0.25800353,0.0006704563,0.7332819,0.00023124478,0.00008885462,0.0007438284,0.00014571774,0.00010300153,0.0067314045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863344,0.00080219674,0.00004121791,0.00017663551,0.00022021565,0.00012631783],"domain_scores_gemma":[0.9991757,0.0005692618,0.00006788548,0.000028806566,0.00010319954,0.00005507782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020564867,0.0012592683,0.0009072799,0.00086236745,0.00063597056,0.0015844775,0.0014235569,0.0015666105,0.0044786395],"category_scores_gemma":[0.0019578424,0.00063864887,0.0010947015,0.0011753096,0.0010430898,0.0010611669,0.0011103029,0.0018626356,0.00045907652],"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.00003616377,0.000070738264,0.00013059539,0.00010906472,0.000046176327,0.00008065085,0.000112911,0.902669,0.0007413289,0.07819611,0.0013626481,0.016444609],"study_design_scores_gemma":[0.000015532254,0.000035289082,0.0000453814,0.000017520733,0.000010771382,0.000024902743,0.00002419912,0.9690577,0.00020871921,0.028448218,0.0021048617,0.000007011131],"about_ca_topic_score_codex":0.0038725203,"about_ca_topic_score_gemma":0.003676973,"teacher_disagreement_score":0.0044786395,"about_ca_system_score_codex":0.0016906898,"about_ca_system_score_gemma":0.0022156958,"threshold_uncertainty_score":0.0149825215},"labels":[],"label_agreement":null},{"id":"W2406183637","doi":"10.1080/03155986.2003.11732678","title":"Development Of A Catch Allocation Tool Design For Production Planning At Js Mcmillan Fisheries","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fishing; Profit (economics); Production (economics); Fishery; Product (mathematics); Operations research; Plan (archaeology); Fisheries management; Decision support system; Computer science; Quality (philosophy); Business; Engineering; Economics; Geography; Microeconomics; Mathematics; Data mining","score_opus":0.10151170792959786,"score_gpt":0.32403000083703,"score_spread":0.22251829290743214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406183637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075313943,0.000051941322,0.9816882,0.00010457451,0.000025335334,0.00034225546,0.00031775373,0.008026498,0.0019121444],"genre_scores_gemma":[0.057152487,0.000073856354,0.9395395,0.00006296967,0.000009475293,0.00058596407,0.00064778706,0.0005903247,0.0013376023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876153,0.0003126207,0.00017522273,0.00018223182,0.00046379812,0.000104575294],"domain_scores_gemma":[0.9971455,0.0017356224,0.0001895793,0.00016608543,0.00067103014,0.00009215053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033989004,0.0010387191,0.0007485649,0.0011533019,0.0005719971,0.0017600625,0.0016530213,0.0009914072,0.006532255],"category_scores_gemma":[0.006985159,0.0011274043,0.001016323,0.00085222395,0.00040034155,0.0012190453,0.00072481367,0.0011809196,0.0013092596],"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.00035142692,0.0005505576,0.0049216235,0.00085690647,0.0001749259,0.0010399665,0.0005955276,0.4169461,0.039199557,0.020996332,0.014397005,0.49997008],"study_design_scores_gemma":[0.00014489755,0.00016793398,0.00073102256,0.000113926144,0.000058023314,0.00015810957,0.000073719595,0.958409,0.018544674,0.0036382007,0.017916083,0.000044362954],"about_ca_topic_score_codex":0.005789994,"about_ca_topic_score_gemma":0.0047731176,"teacher_disagreement_score":0.006532255,"about_ca_system_score_codex":0.0009021135,"about_ca_system_score_gemma":0.002714411,"threshold_uncertainty_score":0.021852553},"labels":[],"label_agreement":null},{"id":"W2406724119","doi":"10.1139/cjce-2015-0144","title":"Conflicts resolution based construction temporary facilities layout planning in large-scale construction projects","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sichuan University; National Natural Science Foundation of China","keywords":"Process (computing); Conflict resolution; Scale (ratio); Construction engineering; Resolution (logic); Construction management; Computer science; Operations research; Engineering; Transport engineering; Civil engineering; Artificial intelligence","score_opus":0.013588787148711066,"score_gpt":0.19489455783329587,"score_spread":0.1813057706845848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406724119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031016603,0.00018179025,0.9652407,0.0000995627,0.000015366937,0.0001475183,0.000043738604,0.00009663955,0.00315802],"genre_scores_gemma":[0.6297349,0.00033858293,0.36702928,0.000037017864,0.000013969297,0.00034100015,0.00014752921,0.000047767633,0.0023099857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979942,0.0009853304,0.00008205345,0.00028656682,0.0004168107,0.00023505224],"domain_scores_gemma":[0.99849415,0.0007627192,0.00029502015,0.00008500949,0.00024012089,0.00012296732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021651315,0.0008310438,0.000678667,0.0016431662,0.0010345299,0.0016349537,0.0015891909,0.0010501812,0.002186812],"category_scores_gemma":[0.0032466885,0.00072228623,0.0013518294,0.00208385,0.0010107876,0.001675601,0.0018382322,0.0010015845,0.0001834514],"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.000025409361,0.000038241367,0.0008113842,0.00007282602,0.00002699334,0.00012564658,0.00012714499,0.959525,0.0009701268,0.013047465,0.00030815208,0.024921663],"study_design_scores_gemma":[0.000008106723,0.0000456823,0.0003094194,0.000014869364,0.000017079772,0.00003919667,0.00014116139,0.9914193,0.0007767873,0.006220684,0.000993427,0.000014230632],"about_ca_topic_score_codex":0.013564472,"about_ca_topic_score_gemma":0.012342881,"teacher_disagreement_score":0.013564472,"about_ca_system_score_codex":0.0016877089,"about_ca_system_score_gemma":0.0034584422,"threshold_uncertainty_score":0.026971042},"labels":[],"label_agreement":null},{"id":"W2407438826","doi":"10.1080/03155986.2003.11732666","title":"Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux","year":2003,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Heuristic; Scale (ratio); Computer science; Mathematical optimization; Implementation; Inequality; Point (geometry); Mathematics; Theoretical computer science; Physics; Programming language","score_opus":0.12895941741366448,"score_gpt":0.3682386656143179,"score_spread":0.2392792482006534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407438826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088571785,0.123350315,0.79016393,0.029637247,0.0021430468,0.0000707646,0.00047808464,0.00017207273,0.045127347],"genre_scores_gemma":[0.30380136,0.24818824,0.41405493,0.0057555,0.007734457,0.0005360299,0.0011384304,0.0010716311,0.017719416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98515934,0.006892628,0.00088083255,0.0018036448,0.004539624,0.0007239843],"domain_scores_gemma":[0.91318005,0.07664008,0.0015343116,0.0035916322,0.00453846,0.0005154777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020474678,0.0026290321,0.0028223002,0.0033444674,0.0020041799,0.009908055,0.0047869706,0.0047830194,0.009233541],"category_scores_gemma":[0.07492736,0.0019508564,0.0030691102,0.005457729,0.010283816,0.017296698,0.0034804146,0.014703309,0.0024208874],"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.000055811786,0.00004516019,0.00025267922,0.0008987251,0.000058496105,0.000096675925,0.000263827,0.02328504,0.00020941252,0.90272915,0.0075026127,0.06460238],"study_design_scores_gemma":[0.000017211441,0.000029190776,0.00015295646,0.0006705112,0.0000227477,0.00012667435,0.00017743632,0.039304104,0.0004024854,0.9208175,0.03824572,0.000033431505],"about_ca_topic_score_codex":0.0070166844,"about_ca_topic_score_gemma":0.0034663347,"teacher_disagreement_score":0.020474678,"about_ca_system_score_codex":0.0075371647,"about_ca_system_score_gemma":0.004907736,"threshold_uncertainty_score":0.10828173},"labels":[],"label_agreement":null},{"id":"W2482729627","doi":"10.1016/j.compenvurbsys.2016.07.002","title":"An improved Genetic Algorithm for spatial optimization of multi-objective and multi-site land use allocation","year":2016,"lang":"en","type":"article","venue":"Computers Environment and Urban Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Graduate Research and Innovation Projects of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Natural Science Foundation of China","keywords":"Crossover; Genetic algorithm; Robustness (evolution); Land use; Computer science; Land-use planning; Mathematical optimization; Optimal allocation; Spatial planning; Set (abstract data type); Operations research; Geography; Engineering; Mathematics; Environmental planning; Artificial intelligence; Civil engineering","score_opus":0.011769854788763526,"score_gpt":0.19570478763242072,"score_spread":0.1839349328436572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482729627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021413801,0.00033770467,0.9724663,0.00013998518,0.00015205656,0.00009450765,0.000077371915,0.0004649466,0.004853336],"genre_scores_gemma":[0.23530878,0.00024323333,0.759054,0.00016805627,0.00009054792,0.00041461788,0.00020361571,0.00013755048,0.004379566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00015883349,0.000019729809,0.000067112866,0.00015358903,0.00005258634],"domain_scores_gemma":[0.99934596,0.00035556615,0.000042310763,0.000034996796,0.00019698762,0.000024084233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155286,0.000950576,0.0013846245,0.0011215215,0.00057411246,0.0008523263,0.0019311283,0.0022489703,0.003130891],"category_scores_gemma":[0.0022389211,0.00059758424,0.0011291573,0.0016357803,0.000538903,0.0007580753,0.0008542756,0.0010569732,0.00048721762],"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.000035749592,0.00005121894,0.00028781642,0.0000309559,0.000039800052,0.000036590638,0.000028460665,0.94792306,0.00083345926,0.0027144877,0.00082103,0.047197357],"study_design_scores_gemma":[0.000013438987,0.000014446528,0.0000624566,0.0000027533265,0.000007673444,0.0000065761324,0.0000027853093,0.99912244,0.00010855251,0.00040096024,0.00025526035,0.0000026092696],"about_ca_topic_score_codex":0.01870317,"about_ca_topic_score_gemma":0.015328685,"teacher_disagreement_score":0.01870317,"about_ca_system_score_codex":0.0010485741,"about_ca_system_score_gemma":0.001824646,"threshold_uncertainty_score":0.03718859},"labels":[],"label_agreement":null},{"id":"W2485301704","doi":"10.5539/mas.v10n10p133","title":"An Optimized Mathematical Model for Items Supplies Planning of a Logistic System","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Purchasing; Computer science; Operations research; Minification; Total cost; Function (biology); Mathematical optimization; Operations management; Business; Mathematics; Economics","score_opus":0.04362831973685467,"score_gpt":0.2839014280683566,"score_spread":0.24027310833150195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485301704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014771647,0.0008190153,0.96177673,0.00060439843,0.00010571433,0.00012861662,0.0007373669,0.00023177367,0.020824809],"genre_scores_gemma":[0.6851381,0.0025522022,0.2701868,0.00028725024,0.00019076694,0.0011798613,0.0014005896,0.00025975372,0.038804635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928576,0.0002239768,0.000034467197,0.00014093368,0.00019691771,0.0001180178],"domain_scores_gemma":[0.99923396,0.00042095137,0.00012068633,0.000023418526,0.00016517322,0.000035746605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986186,0.0014418372,0.0014157932,0.001171948,0.00074710365,0.0028806496,0.0015724577,0.0019180094,0.0074638715],"category_scores_gemma":[0.0019795434,0.0010247281,0.0014267626,0.001691754,0.0007251716,0.0015679365,0.0010671375,0.0018843622,0.0010082509],"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.000010777021,0.0000115990315,0.00009611813,0.000041742955,0.000007481616,0.000044566325,0.000012101559,0.99103093,0.00016287,0.0063497205,0.00034248238,0.0018896097],"study_design_scores_gemma":[0.0000051348284,0.000010893751,0.000038448572,0.0000059160498,0.0000059132008,0.000008540897,0.0000070660676,0.9973335,0.00007024434,0.0019664804,0.00054407545,0.0000037649015],"about_ca_topic_score_codex":0.01567156,"about_ca_topic_score_gemma":0.011646148,"teacher_disagreement_score":0.01567156,"about_ca_system_score_codex":0.0022594344,"about_ca_system_score_gemma":0.0032440356,"threshold_uncertainty_score":0.031160653},"labels":[],"label_agreement":null},{"id":"W2488073955","doi":"","title":"EFFICIENT AND LOCAL EFFICIENT SOLUTIONS FOR ASSIGNMENT TYPE PROBLEMS","year":2001,"lang":"en","type":"article","venue":"French digital mathematics library (Numdam)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Type (biology); Linear programming; Assignment problem; Multiobjective programming; Mathematics; Multi-objective optimization","score_opus":0.018577208902918762,"score_gpt":0.2014252444063325,"score_spread":0.18284803550341375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488073955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024440955,0.00025359058,0.9685268,0.00015387397,0.000017940938,0.000052574076,0.000034104865,0.00005386746,0.0064663677],"genre_scores_gemma":[0.46503866,0.0011068833,0.5191518,0.00012915001,0.00010224326,0.0005633264,0.0002782343,0.00021246087,0.013417175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987734,0.0005318379,0.000052508567,0.0001944581,0.0002746072,0.00017317016],"domain_scores_gemma":[0.9985586,0.0009158255,0.00018444232,0.000102496786,0.00015237527,0.00008633351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002071766,0.00076096784,0.00094266987,0.00076946634,0.0006184644,0.0014627052,0.00078025146,0.0010880118,0.0040305536],"category_scores_gemma":[0.00495609,0.00042808458,0.00087205257,0.0008185207,0.001332612,0.0021727753,0.0016820951,0.0016148946,0.00053894613],"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.000075257914,0.00009884469,0.000544823,0.00031367544,0.00005747444,0.00018139485,0.00027021568,0.3041985,0.004505008,0.6544786,0.001544707,0.03373151],"study_design_scores_gemma":[0.00004767766,0.00014721412,0.00034228276,0.00009053499,0.000031838834,0.00017968685,0.00022539758,0.57349116,0.0038823152,0.41485837,0.006682304,0.00002123498],"about_ca_topic_score_codex":0.00030075968,"about_ca_topic_score_gemma":0.00047196573,"teacher_disagreement_score":0.0040305536,"about_ca_system_score_codex":0.0005307111,"about_ca_system_score_gemma":0.00066709256,"threshold_uncertainty_score":0.013483524},"labels":[],"label_agreement":null},{"id":"W2517686855","doi":"","title":"Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms","year":2015,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Metaheuristic; Computer science; Scheduling (production processes); Constraint programming; Goal programming; Stochastic programming; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.029643684499557673,"score_gpt":0.23338476670503885,"score_spread":0.20374108220548118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517686855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109010376,0.0009996116,0.8693267,0.0012420535,0.00011378755,0.00027689862,0.00046133515,0.00039352773,0.018175771],"genre_scores_gemma":[0.79015857,0.00084382884,0.20077734,0.0002253452,0.000066490626,0.00036481456,0.0003777217,0.00008138875,0.007104501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994605,0.00026853243,0.00001844339,0.00006428983,0.00009327355,0.00009491188],"domain_scores_gemma":[0.9990742,0.00064659136,0.00011588335,0.000018237502,0.00008798712,0.000057045407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011949149,0.0011371245,0.0007233825,0.0009611451,0.00063060515,0.0012894664,0.00091634074,0.0010605752,0.0016456838],"category_scores_gemma":[0.0018566188,0.0006156223,0.00093432714,0.0011526622,0.0009440913,0.00051393814,0.0007607663,0.0011337331,0.00015693986],"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.000011713342,0.000010685776,0.000108232656,0.00001108354,0.000007993856,0.000013786114,0.0000071247546,0.9947962,0.00006602332,0.0031042288,0.0001464512,0.0017164266],"study_design_scores_gemma":[0.0000075984085,0.000011366286,0.00006544372,0.000003756287,0.00000426113,0.0000025359946,0.000007631553,0.99808997,0.000049071015,0.0015100106,0.00024588307,0.000002426708],"about_ca_topic_score_codex":0.10372799,"about_ca_topic_score_gemma":0.09100693,"teacher_disagreement_score":0.10372799,"about_ca_system_score_codex":0.0039461358,"about_ca_system_score_gemma":0.00585307,"threshold_uncertainty_score":0.20624846},"labels":[],"label_agreement":null},{"id":"W2522731561","doi":"10.5539/mas.v10n10p289","title":"A Model to Determine Optimal Composition of Production to Obtain Maximum Profit &amp; Reduce Overhead Costs by Linear Programming","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear programming; Production (economics); Profit (economics); Computer science; Overhead (engineering); Production planning; Operations research; Production rate; Dynamic programming; Mathematical optimization; Operations management; Manufacturing engineering; Economics; Microeconomics; Mathematics; Algorithm","score_opus":0.031159433034354454,"score_gpt":0.2744968192462074,"score_spread":0.24333738621185294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522731561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022130359,0.00034759752,0.954914,0.0004656513,0.0000422608,0.0001881674,0.00043519403,0.00043771768,0.021039091],"genre_scores_gemma":[0.78213805,0.0010422574,0.192302,0.0001358677,0.00004888276,0.0012362456,0.0005519697,0.00017731982,0.022367489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.0001513276,0.000023607252,0.00011317948,0.00013052508,0.00009357182],"domain_scores_gemma":[0.99934727,0.00041501084,0.00009205293,0.000017027642,0.00010210468,0.000026491454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082266144,0.001227083,0.00091277284,0.00085653627,0.00069786946,0.0021667308,0.0011313963,0.0012883567,0.00696066],"category_scores_gemma":[0.0013760088,0.0006647415,0.0010414985,0.00094546995,0.0006848025,0.0010345964,0.00073815166,0.0013098165,0.0007543234],"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.000017758703,0.000019114475,0.00012921033,0.000056538,0.0000062064614,0.000041614385,0.000023070625,0.9908659,0.00046701025,0.0051370324,0.00025231604,0.0029842232],"study_design_scores_gemma":[0.000005430363,0.000018455372,0.000040970463,0.0000073968254,0.000005972693,0.0000076135025,0.00000918432,0.9968219,0.00022933382,0.0023820864,0.00046787845,0.000003851644],"about_ca_topic_score_codex":0.01597242,"about_ca_topic_score_gemma":0.009097383,"teacher_disagreement_score":0.01597242,"about_ca_system_score_codex":0.0020149979,"about_ca_system_score_gemma":0.002461905,"threshold_uncertainty_score":0.031758904},"labels":[],"label_agreement":null},{"id":"W2525966964","doi":"10.1080/03155986.2016.1214448","title":"An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Fuel Cycle and Supply Chain; Fundação para a Ciência e a Tecnologia","keywords":"Integer (computer science); Chebyshev filter; Set (abstract data type); Point (geometry); Mathematical optimization; Computer science; Algorithm; Phase (matter); Implementation; Integer programming; Minification; Linear programming; Mathematics; Geometry","score_opus":0.07522440007004182,"score_gpt":0.335503778932631,"score_spread":0.2602793788625892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525966964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026557688,0.000078087156,0.99613523,0.0000322851,0.000009155492,0.00006597067,0.000015910413,0.00010483343,0.0009027361],"genre_scores_gemma":[0.054060757,0.00011114452,0.9440023,0.000067186644,0.000018296616,0.000372265,0.00009520141,0.00008184887,0.0011910321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981578,0.0006385075,0.00007882203,0.00021857726,0.0007987336,0.00010761597],"domain_scores_gemma":[0.9974233,0.0014755692,0.0002216261,0.0002274015,0.0005740764,0.000078030134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025174099,0.0013890028,0.0011179502,0.002053376,0.0008257846,0.001261646,0.0028176995,0.0013151116,0.0035280706],"category_scores_gemma":[0.008261195,0.000778168,0.00078962516,0.001412937,0.0010746297,0.0012632489,0.0023301544,0.0019265972,0.00083211553],"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.00022122792,0.00026785574,0.0008696761,0.0004322185,0.000091606744,0.00011633441,0.00034264286,0.64166623,0.009346504,0.07831577,0.0022144797,0.2661154],"study_design_scores_gemma":[0.000030324005,0.000102223836,0.000096568205,0.000029056624,0.0000071321037,0.000051907973,0.000027867103,0.9857744,0.00202908,0.00993844,0.0018945999,0.000018365638],"about_ca_topic_score_codex":0.0018911337,"about_ca_topic_score_gemma":0.002126538,"teacher_disagreement_score":0.0035280706,"about_ca_system_score_codex":0.00073276134,"about_ca_system_score_gemma":0.0017598965,"threshold_uncertainty_score":0.013313532},"labels":[],"label_agreement":null},{"id":"W2555683065","doi":"10.1139/cjfr-2016-0299","title":"Strategic planning in a forest supply chain: a multigoal and multiproduct approach","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Maximization; Sustainability; Minification; Work (physics); Supply chain; Schedule; Production (economics); Yield (engineering); Forest management; Operations research; Computer science; Environmental economics; Business; Economics; Environmental science; Mathematics; Agroforestry; Ecology; Microeconomics; Engineering","score_opus":0.07447308180755687,"score_gpt":0.30189949200278876,"score_spread":0.2274264101952319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555683065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025938101,0.0006037732,0.95662093,0.00085184415,0.000037688493,0.00015117422,0.00012282925,0.00006715267,0.015606439],"genre_scores_gemma":[0.5612892,0.001363281,0.42648858,0.0002168381,0.000064553475,0.00051398756,0.00017603807,0.00007959751,0.009807965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880576,0.00069329457,0.000036674268,0.00014615775,0.00018702939,0.00013108071],"domain_scores_gemma":[0.9987103,0.0009047888,0.00011284386,0.00003751025,0.00011276769,0.00012184445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018928049,0.001378482,0.0012334449,0.0017431297,0.000894161,0.0024894788,0.0017808658,0.0020005465,0.0044890475],"category_scores_gemma":[0.002444005,0.000992008,0.0015195655,0.0019362569,0.0020781246,0.0020304297,0.0016504562,0.0016137626,0.00033927607],"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.000026373753,0.000052627594,0.0003025368,0.000080704376,0.00004158463,0.00013790606,0.00009290948,0.93930846,0.00026693026,0.053850684,0.00029581136,0.005543463],"study_design_scores_gemma":[0.000015624115,0.000047303787,0.00012543207,0.00002726511,0.000019440244,0.000026212025,0.000073792224,0.9434266,0.00013142472,0.054998208,0.0010967023,0.000011979231],"about_ca_topic_score_codex":0.012336746,"about_ca_topic_score_gemma":0.013026239,"teacher_disagreement_score":0.98766327,"about_ca_system_score_codex":0.003479262,"about_ca_system_score_gemma":0.003011328,"threshold_uncertainty_score":0.025243878},"labels":[],"label_agreement":null},{"id":"W2587219924","doi":"10.4236/jsea.2017.102007","title":"An Evolutionary Firefly Algorithm, Goal Programming Optimization Approach for Setting the Osmotic Dehydration Parameters of Papaya","year":2017,"lang":"en","type":"article","venue":"Journal of Software Engineering and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Firefly algorithm; Converse; Mathematical optimization; Sensitivity (control systems); Key (lock); Metaheuristic; Set (abstract data type); Linear programming; Range (aeronautics); Mathematics; Evolutionary algorithm; Process (computing); Computer science; Optimization problem; Algorithm; Particle swarm optimization; Engineering","score_opus":0.00903675254457508,"score_gpt":0.23456372427101738,"score_spread":0.2255269717264423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587219924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026313782,0.00014798933,0.9695249,0.00012246992,0.000020965943,0.00008253075,0.000030906147,0.00023564968,0.0035208438],"genre_scores_gemma":[0.27442995,0.00018861855,0.72212106,0.00010231822,0.000012069095,0.00033606906,0.000062227446,0.000068774745,0.002678882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983263,0.00006201769,0.0000061686387,0.000031766653,0.000048644506,0.00001878538],"domain_scores_gemma":[0.999775,0.00013591231,0.000030390382,0.000012373854,0.000036907062,0.000009406899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778121,0.0007340001,0.00059373956,0.00055417954,0.0003811222,0.00060105143,0.0009112352,0.00089287077,0.00083270046],"category_scores_gemma":[0.001092828,0.00037624815,0.00065011694,0.00041693344,0.00040720188,0.00051300845,0.0005476792,0.00078413973,0.00014002807],"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.000031281168,0.000055422584,0.00051558565,0.00007717328,0.000029804978,0.000065949025,0.000069274734,0.9480482,0.005148319,0.009382674,0.00044098753,0.03613534],"study_design_scores_gemma":[0.000008869955,0.00004308538,0.0000913391,0.000007258942,0.000008255605,0.000022987415,0.0000140692355,0.99625754,0.0013233322,0.0014975411,0.0007206974,0.000005001102],"about_ca_topic_score_codex":0.0027298685,"about_ca_topic_score_gemma":0.002991523,"teacher_disagreement_score":0.0027298685,"about_ca_system_score_codex":0.0005759197,"about_ca_system_score_gemma":0.0010384565,"threshold_uncertainty_score":0.005428016},"labels":[],"label_agreement":null},{"id":"W2613081544","doi":"","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2004,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Branch and cut; Linear programming; Algorithm; Integer programming; Bilevel optimization; Mathematics; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Exploit; Criss-cross algorithm; Branch and price; Computer science; Linear-fractional programming; Optimization problem","score_opus":0.0112541236968237,"score_gpt":0.23225245431071825,"score_spread":0.22099833061389457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613081544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016485073,0.00016151984,0.9961015,0.00010041015,0.000029315252,0.000039448245,0.000040491752,0.00033467208,0.0015441572],"genre_scores_gemma":[0.036202706,0.00019376144,0.9612182,0.00010593463,0.0000435056,0.00021715822,0.0002422933,0.00019440704,0.0015820481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907506,0.0003050075,0.000049190516,0.00012823631,0.00035271724,0.0000897772],"domain_scores_gemma":[0.99884415,0.0006889036,0.00008564351,0.00008769639,0.00023338648,0.000060211092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015648641,0.0013773699,0.0016560884,0.0012325962,0.00063498603,0.0017206889,0.0017033467,0.0019425156,0.0052772574],"category_scores_gemma":[0.0036664214,0.00080807356,0.0007294689,0.0020326152,0.00076475315,0.002074225,0.0020382158,0.003542465,0.0011164725],"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.00017188898,0.00017719655,0.00040866478,0.00024622653,0.00011018476,0.00012096594,0.0001252845,0.5066144,0.0034649174,0.09219138,0.008080984,0.38828793],"study_design_scores_gemma":[0.000047608624,0.000033266555,0.00005102859,0.000020297772,0.000012570703,0.000039159433,0.0000129101845,0.96679235,0.000832829,0.028316207,0.003831975,0.000009770075],"about_ca_topic_score_codex":0.0023501967,"about_ca_topic_score_gemma":0.0033515925,"teacher_disagreement_score":0.0052772574,"about_ca_system_score_codex":0.001061633,"about_ca_system_score_gemma":0.0017061033,"threshold_uncertainty_score":0.01765412},"labels":[],"label_agreement":null},{"id":"W2618247029","doi":"","title":"Time-Indexed Formulations and the Total Weighted Tardiness Problem","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Mathematical Programming","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Tardiness; Mathematical optimization; Mathematics; Time horizon; Integer programming; Computer science; Job shop scheduling","score_opus":0.005148404545507928,"score_gpt":0.1998810159891852,"score_spread":0.19473261144367726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618247029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075086756,0.0005366267,0.9749963,0.00037034255,0.00009774912,0.00008867075,0.00020180552,0.00013190841,0.016067995],"genre_scores_gemma":[0.17017794,0.00197333,0.7992362,0.00024267317,0.0002857964,0.00049829355,0.00088779116,0.0002811762,0.026416793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903893,0.00035333086,0.000044804623,0.00012310462,0.00033639607,0.00010344593],"domain_scores_gemma":[0.999328,0.00033270416,0.0001090105,0.00005042352,0.00013244827,0.00004740905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874932,0.0012474599,0.0005422049,0.0006755618,0.00045095477,0.0014441347,0.0013019715,0.00075788924,0.007039473],"category_scores_gemma":[0.0020385329,0.00044129623,0.00077362376,0.0013433364,0.00063400884,0.0015349516,0.0006979633,0.001706776,0.0008199715],"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.00011014134,0.00019626092,0.0001587634,0.0002700931,0.000046273537,0.00022161259,0.00015505299,0.4547493,0.005069554,0.43766314,0.008918238,0.09244159],"study_design_scores_gemma":[0.00007008402,0.00015953809,0.00015303903,0.00006364813,0.000027915674,0.00016496997,0.00009198448,0.7381898,0.0025958826,0.23784468,0.020615079,0.000023343822],"about_ca_topic_score_codex":0.002040107,"about_ca_topic_score_gemma":0.0031292585,"teacher_disagreement_score":0.007039473,"about_ca_system_score_codex":0.0011048949,"about_ca_system_score_gemma":0.001607345,"threshold_uncertainty_score":0.023549438},"labels":[],"label_agreement":null},{"id":"W2623014745","doi":"10.1287/trsc.2016.0728","title":"The Value of Flexibility in Robust Location–Transportation Problems","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":46,"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":"Flexibility (engineering); Mathematical optimization; Exploit; Set (abstract data type); Computer science; Facility location problem; Robust optimization; Linear programming; Mathematics; Statistics","score_opus":0.0347453042944062,"score_gpt":0.2828744584522935,"score_spread":0.24812915415788728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623014745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055965506,0.0012685761,0.9327501,0.0017318508,0.000090702124,0.000049755912,0.00014882405,0.00014408298,0.007850644],"genre_scores_gemma":[0.91483384,0.00066433655,0.082658514,0.00015227079,0.00010563627,0.00007697063,0.00008925667,0.0000790541,0.0013401083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965114,0.0023015398,0.000103638755,0.0003340278,0.00046454667,0.00028489696],"domain_scores_gemma":[0.98067963,0.016413162,0.0011112776,0.0010900475,0.0003807112,0.00032515015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051724818,0.0014316508,0.0016484265,0.00074121484,0.0010751099,0.002345116,0.001956582,0.0020589463,0.0020686896],"category_scores_gemma":[0.024356816,0.00096844044,0.0013954452,0.0012455271,0.002696298,0.0037881231,0.002331788,0.0030620482,0.00023505557],"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.000071502356,0.000013721226,0.0002364129,0.00004626985,0.000027071817,0.00008007991,0.000037376958,0.96041673,0.00031860865,0.034153387,0.00026015443,0.0043386864],"study_design_scores_gemma":[0.000014062879,0.00004581252,0.00009113959,0.000020833479,0.000013188875,0.000036062447,0.000026078158,0.9529358,0.00028770018,0.046014734,0.00050126016,0.000013313731],"about_ca_topic_score_codex":0.0024129406,"about_ca_topic_score_gemma":0.0015945088,"teacher_disagreement_score":0.0051724818,"about_ca_system_score_codex":0.0014954936,"about_ca_system_score_gemma":0.00091219984,"threshold_uncertainty_score":0.027355015},"labels":[],"label_agreement":null},{"id":"W2625106248","doi":"","title":"Row-Reduced Column Generation for Degenerate Master Problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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":"Column generation; Degeneracy (biology); Simplex algorithm; Linear programming; Mathematical optimization; Degenerate energy levels; Column (typography); Reduction (mathematics); Mathematics; Simplex; Row; Function (biology); Computer science; Combinatorics","score_opus":0.042709259604935254,"score_gpt":0.21430721584588325,"score_spread":0.17159795624094798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625106248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010327655,0.00013274775,0.9865354,0.00013979274,0.000039512866,0.000095331816,0.00006657468,0.0005330555,0.0021299794],"genre_scores_gemma":[0.15512641,0.00017863723,0.8410036,0.00018128517,0.00004603715,0.0002880482,0.00029957044,0.00039017343,0.0024862837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.0003741206,0.00003484008,0.00009334133,0.00021099689,0.00009158887],"domain_scores_gemma":[0.998139,0.0009564512,0.00012450217,0.0004419219,0.00026696682,0.00007113905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013052603,0.000862572,0.001022341,0.0006956675,0.0005741242,0.0010440741,0.0011032374,0.00073645596,0.0074115614],"category_scores_gemma":[0.003885641,0.00051756913,0.0010121892,0.00086615066,0.00081862556,0.0012709602,0.0015035421,0.0019666718,0.0012653165],"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.00025249994,0.00025566938,0.0008866549,0.0004166637,0.000098450626,0.00029517993,0.00024917783,0.57382286,0.015838234,0.11679275,0.011432913,0.27965888],"study_design_scores_gemma":[0.000037599424,0.00006361108,0.00008917715,0.000018321822,0.000012462433,0.00006615805,0.000028943241,0.9558713,0.004681322,0.035969537,0.0031485006,0.000013129728],"about_ca_topic_score_codex":0.0012175854,"about_ca_topic_score_gemma":0.0022812136,"teacher_disagreement_score":0.0074115614,"about_ca_system_score_codex":0.00048334844,"about_ca_system_score_gemma":0.0010421522,"threshold_uncertainty_score":0.024794161},"labels":[],"label_agreement":null},{"id":"W2735614447","doi":"10.21474/ijar01/4450","title":"TOWARDS ALTERNATIVE IBFS USING GUI TO OBTAIN SOLUTION TO TRANSPORTATION PROBLEM.","year":2017,"lang":"en","type":"article","venue":"International Journal of Advanced Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Transportation theory; Software engineering; Mathematical optimization; Mathematics","score_opus":0.0971918259297353,"score_gpt":0.44589345241379236,"score_spread":0.34870162648405706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735614447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008879262,0.00023256634,0.98059744,0.000111685666,0.000056421373,0.000049192826,0.0001319096,0.0027623824,0.0071792332],"genre_scores_gemma":[0.12123875,0.00028956178,0.87352705,0.00009223309,0.000031642958,0.00019839662,0.0004855263,0.0005383021,0.003598481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997402,0.000104866216,0.000013943558,0.00003203477,0.00006921101,0.00003968561],"domain_scores_gemma":[0.9996524,0.00016470195,0.000016517628,0.00004985243,0.00008965577,0.000026910764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060828804,0.0006913768,0.0006275082,0.00074581895,0.00038436646,0.0010193348,0.0010214336,0.00073474296,0.014610932],"category_scores_gemma":[0.0022668724,0.00024156974,0.00074423105,0.00075498497,0.00023101187,0.0008174186,0.0010177167,0.0010368337,0.0026604396],"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.0006287233,0.0004968891,0.0020289505,0.0006598094,0.00009954912,0.0003689771,0.0003525683,0.2667615,0.023655562,0.06968772,0.02225465,0.6130051],"study_design_scores_gemma":[0.000061974955,0.00006573385,0.00026636536,0.000045247638,0.000015119017,0.000089535395,0.00008947616,0.96639854,0.0037897814,0.017555075,0.011610591,0.000012569633],"about_ca_topic_score_codex":0.0029254812,"about_ca_topic_score_gemma":0.002600297,"teacher_disagreement_score":0.014610932,"about_ca_system_score_codex":0.00026100563,"about_ca_system_score_gemma":0.00053926837,"threshold_uncertainty_score":0.04887849},"labels":[],"label_agreement":null},{"id":"W2743724002","doi":"10.5539/jmr.v9n5p1","title":"A Study on the Minimum and Maximum Sum of C2 Problem in IMO2014","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical induction; Maximum principle; Maximum cut; Set (abstract data type); Sequence (biology); State (computer science); Mathematical optimization; Discrete mathematics; Combinatorics; Applied mathematics; Graph; Computer science; Algorithm; Optimal control","score_opus":0.1382243470362173,"score_gpt":0.39490593583439915,"score_spread":0.2566815887981818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743724002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49958846,0.0023453832,0.37443092,0.0058628516,0.00053699175,0.0002639549,0.0008974787,0.00043535203,0.1156386],"genre_scores_gemma":[0.8791914,0.00084521365,0.09818022,0.00046683586,0.0002856218,0.00023186521,0.00089168886,0.00021748616,0.019689696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981969,0.0006324502,0.00009679441,0.00033625602,0.00041356942,0.00032410334],"domain_scores_gemma":[0.9960978,0.0026316147,0.00025951857,0.0002828491,0.00044350175,0.00028460033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028304025,0.00041395213,0.0008219774,0.0013043421,0.0018615333,0.002508442,0.0013088599,0.001283042,0.0068239295],"category_scores_gemma":[0.009284995,0.0002392987,0.0010734489,0.0020898778,0.0011525495,0.0037180858,0.0013400408,0.0016155251,0.00046035528],"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.00039632447,0.00024620412,0.0054706703,0.00039933744,0.00007229812,0.00052043976,0.0005763738,0.07542602,0.002162052,0.8199565,0.017489312,0.07728452],"study_design_scores_gemma":[0.00005447443,0.00017870935,0.0025995162,0.00008722922,0.0000419078,0.00042227766,0.00054728595,0.4548841,0.0042020255,0.5233872,0.013540092,0.00005515263],"about_ca_topic_score_codex":0.0024706714,"about_ca_topic_score_gemma":0.001970182,"teacher_disagreement_score":0.0068239295,"about_ca_system_score_codex":0.0016024039,"about_ca_system_score_gemma":0.0015241643,"threshold_uncertainty_score":0.02282828},"labels":[],"label_agreement":null},{"id":"W2750313416","doi":"10.1155/2017/2139791","title":"Modified Approach for Optimization of Real Life Transportation Problem in Neutrosophic Environment","year":2017,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Mathematical Programming","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 Manitoba","funders":"","keywords":"Transportation theory; Minification; Transshipment (information security); Computer science; Mathematical optimization; Operations research; Mathematics","score_opus":0.021767164339711438,"score_gpt":0.21945711652749128,"score_spread":0.19768995218777985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750313416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006218503,0.0011126022,0.9838882,0.00044309365,0.00017573638,0.00006458775,0.00006285855,0.00004614725,0.00798823],"genre_scores_gemma":[0.40121594,0.004096064,0.5678086,0.00071851717,0.0005883211,0.00067452434,0.00044374494,0.00021281086,0.024241444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.00028229473,0.000036564437,0.00015788569,0.00020648005,0.000069918715],"domain_scores_gemma":[0.9996939,0.00013102833,0.000025684396,0.000023991388,0.00010217029,0.000023288292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977247,0.0011419365,0.0008683235,0.0010601272,0.0005785914,0.0012303442,0.0016638862,0.0015944784,0.005676135],"category_scores_gemma":[0.0013791807,0.0003384684,0.0017516945,0.0009636663,0.0005698449,0.0015573701,0.0012317683,0.0015148527,0.0005541933],"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.00010390183,0.00013546625,0.00072880054,0.0007506535,0.00017327983,0.00051668147,0.00024467224,0.7147304,0.007107915,0.18674713,0.008995719,0.07976536],"study_design_scores_gemma":[0.00001293983,0.00007119596,0.00018629225,0.000030198516,0.000033569802,0.00009763656,0.00004059708,0.96180356,0.00061163644,0.030649697,0.006446727,0.000015985035],"about_ca_topic_score_codex":0.0030856817,"about_ca_topic_score_gemma":0.003130568,"teacher_disagreement_score":0.005676135,"about_ca_system_score_codex":0.0012228156,"about_ca_system_score_gemma":0.00100579,"threshold_uncertainty_score":0.01898849},"labels":[],"label_agreement":null},{"id":"W2754617386","doi":"10.1109/tfuzz.2017.2751006","title":"A New Possibilistic Optimization Model for Multiple Criteria Assignment Problem","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Optimization problem; Mathematics","score_opus":0.03912850296693645,"score_gpt":0.2756797137835551,"score_spread":0.23655121081661865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754617386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023128628,0.00015925281,0.99407107,0.00017261558,0.000021429778,0.00004182136,0.000051516025,0.000053154006,0.0031162177],"genre_scores_gemma":[0.3877351,0.0009037013,0.6003321,0.00024089155,0.00012960828,0.00078203424,0.00029703302,0.000110151224,0.009469399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968252,0.0013164298,0.00015029174,0.00046197235,0.0010699476,0.0001761276],"domain_scores_gemma":[0.99873775,0.000711129,0.00015359279,0.000089463094,0.00022030735,0.00008782631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028262804,0.0016615576,0.0012346614,0.0014773746,0.0009588046,0.002827544,0.0033021083,0.0022673511,0.0045467527],"category_scores_gemma":[0.0039450885,0.0008066964,0.0017683754,0.0022450662,0.001232786,0.002890172,0.0017373676,0.0032436997,0.00088602817],"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.000051135547,0.00006063226,0.0002124735,0.00018431853,0.00006639531,0.00018456903,0.00017430485,0.8692713,0.0018809277,0.10640682,0.0013385606,0.020168632],"study_design_scores_gemma":[0.0000095302585,0.000027253283,0.00004679113,0.000015339187,0.000011524864,0.000049037713,0.000016412816,0.96789336,0.00021969677,0.029893361,0.0018044529,0.000013265935],"about_ca_topic_score_codex":0.0032783428,"about_ca_topic_score_gemma":0.00260963,"teacher_disagreement_score":0.0045467527,"about_ca_system_score_codex":0.002031912,"about_ca_system_score_gemma":0.0016680547,"threshold_uncertainty_score":0.01521045},"labels":[],"label_agreement":null},{"id":"W27583426","doi":"","title":"Locating Post Offices Using Fuzzy Goal Programming and Geographical Information System (GIS)","year":2011,"lang":"en","type":"article","venue":"Americas Conference on Information Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Megacity; Geographic information system; Fuzzy logic; Computer science; Service (business); Operations research; Order (exchange); Information system; Goal programming; Facility location problem; Geography; Business; Engineering; Artificial intelligence; Marketing; Cartography; Economics","score_opus":0.030570053798958267,"score_gpt":0.23565644987445458,"score_spread":0.2050863960754963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27583426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04271068,0.00027763518,0.9515321,0.00027139887,0.000016808579,0.00008778229,0.00010152369,0.00018202726,0.004820049],"genre_scores_gemma":[0.5750074,0.00039626603,0.42197064,0.000065014465,0.00002050576,0.00020819237,0.00017312773,0.000031315714,0.002127514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992681,0.00033631956,0.00003355438,0.000114676375,0.00015903059,0.000088302564],"domain_scores_gemma":[0.99932957,0.0004407045,0.0000859776,0.000020976786,0.00007853998,0.00004430025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180259,0.00096987066,0.0009353978,0.0011756815,0.0006551529,0.001705561,0.00096424023,0.0010834726,0.0014966049],"category_scores_gemma":[0.0014955935,0.000521035,0.0009896287,0.0013274153,0.0009159685,0.0015516845,0.0012196946,0.0007705662,0.00016735072],"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.000059713926,0.00006491294,0.0009671572,0.000115035094,0.000042046577,0.00010459441,0.000114182454,0.9377752,0.0007479911,0.02900452,0.00061841944,0.030386325],"study_design_scores_gemma":[0.000008920469,0.000041785104,0.0001594024,0.000013191861,0.000012433519,0.000021541602,0.000071498536,0.9855495,0.00036053764,0.013058076,0.0006942099,0.000008864455],"about_ca_topic_score_codex":0.017047234,"about_ca_topic_score_gemma":0.014843331,"teacher_disagreement_score":0.017047234,"about_ca_system_score_codex":0.0019183935,"about_ca_system_score_gemma":0.0021839247,"threshold_uncertainty_score":0.03389603},"labels":[],"label_agreement":null},{"id":"W2770226579","doi":"","title":"A Thermodynamic Investigation of Commercial Kitchen Operations and the Implementation of a Waste Heat Recovery System","year":2017,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"McMaster University","keywords":"Waste heat recovery unit; Waste management; Engineering; Environmental science; Process engineering; Mechanical engineering; Heat exchanger","score_opus":0.009886170478921787,"score_gpt":0.2144405540544898,"score_spread":0.20455438357556802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770226579","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977005,0.000014385688,0.00053997984,0.000011348033,0.0000015934753,0.000024895144,0.00016061096,0.000038364797,0.0015082809],"genre_scores_gemma":[0.99915195,0.000014543471,0.00034133028,0.0000018889007,4.973333e-7,0.0000101379155,0.00009629095,0.0000073114525,0.00037609064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997018,0.000051565163,0.000014345029,0.00004899956,0.00010021854,0.0000830425],"domain_scores_gemma":[0.9995414,0.00018136467,0.00004520288,0.000036147267,0.00016947178,0.000026526053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044457402,0.0003469715,0.00042250747,0.00040527544,0.00052612164,0.00053435506,0.00055688823,0.0003603198,0.0014992023],"category_scores_gemma":[0.000863809,0.00025969968,0.00033076075,0.0006238073,0.00039139594,0.000494426,0.00018488396,0.0002426739,0.00018399481],"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.0026485706,0.0024319966,0.20411354,0.0006354939,0.00019485113,0.002430297,0.0014177777,0.43825632,0.26569107,0.003119098,0.00188061,0.07718034],"study_design_scores_gemma":[0.000095166404,0.002392927,0.35566503,0.000023366234,0.00012400337,0.00027334417,0.0028858099,0.4952651,0.14003418,0.00039071805,0.0027635456,0.00008687166],"about_ca_topic_score_codex":0.06590381,"about_ca_topic_score_gemma":0.07894027,"teacher_disagreement_score":0.06590381,"about_ca_system_score_codex":0.0026050655,"about_ca_system_score_gemma":0.0010917401,"threshold_uncertainty_score":0.1310404},"labels":[],"label_agreement":null},{"id":"W2774074136","doi":"10.1007/bf03398807","title":"Revisiting Dinkelbach-type algorithms for generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Iterated function; Computer science; Type (biology); Mathematical optimization; Algorithm; Fractional programming; Applied mathematics; Mathematics; Nonlinear programming; Nonlinear system","score_opus":0.09134289677039446,"score_gpt":0.3276415467877081,"score_spread":0.23629865001731365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774074136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008386067,0.0006075221,0.97691625,0.00044719162,0.00027375566,0.000055786983,0.000046198293,0.00019662766,0.013070555],"genre_scores_gemma":[0.18391153,0.00097558217,0.799596,0.0006525706,0.00022750336,0.0002061132,0.00014275328,0.00040694283,0.013880967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854654,0.0006700405,0.00008795516,0.00018849623,0.00038408628,0.00012275338],"domain_scores_gemma":[0.99721885,0.0018057841,0.00008575927,0.00039023368,0.00041381625,0.00008564207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035151078,0.001200679,0.0014716247,0.0014839343,0.0011215456,0.0025082415,0.0019758625,0.0018393095,0.008431064],"category_scores_gemma":[0.0139126,0.00053683843,0.0012616531,0.002080315,0.0017273033,0.0037031726,0.0029171824,0.0028371422,0.0013608186],"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.00015488216,0.00010393794,0.00066314073,0.00024511208,0.000060244056,0.00005254625,0.00019628704,0.18164426,0.0015158338,0.609738,0.0043991925,0.20122643],"study_design_scores_gemma":[0.000034209294,0.000052332507,0.00013081486,0.00010808249,0.000018183899,0.000047809743,0.00004868784,0.70006144,0.0013966899,0.2886872,0.009394516,0.000019984956],"about_ca_topic_score_codex":0.0029113921,"about_ca_topic_score_gemma":0.00494731,"teacher_disagreement_score":0.008431064,"about_ca_system_score_codex":0.001705393,"about_ca_system_score_gemma":0.0017780808,"threshold_uncertainty_score":0.02820474},"labels":[],"label_agreement":null},{"id":"W2786155106","doi":"10.1016/j.ejor.2018.01.022","title":"Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Regional Development Fund; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; European Commission","keywords":"Heuristics; Mathematical optimization; Linear programming; Integer programming; Mathematics; Heuristic; Limit (mathematics); Fixed charge; Scaling; Iterative method; Set (abstract data type); Integer (computer science); Algorithm; Computer science","score_opus":0.12431254137681133,"score_gpt":0.3508453785029433,"score_spread":0.22653283712613195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786155106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056036566,0.00012959032,0.9897658,0.00008148215,0.000033003027,0.000042439493,0.000015327209,0.00013163734,0.004196987],"genre_scores_gemma":[0.50846595,0.00045520483,0.4844736,0.00013833692,0.000084635314,0.00040194104,0.00007667646,0.00024364106,0.005659999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.0001839038,0.000015643842,0.00004544812,0.00014031885,0.00003755466],"domain_scores_gemma":[0.99878055,0.0007672912,0.00009819931,0.000065604385,0.0002489308,0.000039337097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012610069,0.0010966099,0.00096062606,0.0008863135,0.00052287604,0.0011107636,0.0013515017,0.0008446975,0.0037150912],"category_scores_gemma":[0.0039068065,0.00066761504,0.00097164,0.00085460936,0.0007681729,0.0011541793,0.0011291035,0.0015503457,0.00046616056],"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.000020875039,0.00003813823,0.00016437509,0.000054790726,0.000015453357,0.00002338647,0.000045431727,0.9568185,0.0010726199,0.020049114,0.0005197343,0.021177523],"study_design_scores_gemma":[0.0000013564196,0.000009132649,0.000012673987,0.0000026506445,0.0000015299261,0.0000029028797,0.0000021613307,0.99741334,0.00008541225,0.0023207155,0.00014649368,0.0000016998587],"about_ca_topic_score_codex":0.0045976196,"about_ca_topic_score_gemma":0.0046917987,"teacher_disagreement_score":0.0045976196,"about_ca_system_score_codex":0.0009864216,"about_ca_system_score_gemma":0.0012977064,"threshold_uncertainty_score":0.012428224},"labels":[],"label_agreement":null},{"id":"W2789391008","doi":"10.5539/jmr.v10n2p77","title":"Efficiency of MOMA-plus Method to Solve Some Fully Fuzzy L-R Triangular Multiobjective Linear Programs","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Multi-objective optimization; Mathematical optimization; Fuzzy logic; Pareto principle; Linear programming; Computer science; Artificial intelligence","score_opus":0.09067810224268658,"score_gpt":0.4141740766849413,"score_spread":0.3234959744422547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789391008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055106347,0.00016028491,0.99041617,0.000061975814,0.000019794117,0.000043258784,0.00002420466,0.00012169935,0.003641918],"genre_scores_gemma":[0.2304677,0.00029117285,0.7652762,0.00011853392,0.00003748778,0.00030764178,0.000117416705,0.00012352878,0.0032603673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953187,0.00018916764,0.00002726414,0.000057268466,0.00015777099,0.000036625857],"domain_scores_gemma":[0.9992995,0.00045661308,0.000039637107,0.000045017987,0.00013525742,0.000023930726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009839156,0.0009143784,0.0007580601,0.0006168495,0.00044856415,0.0008273626,0.000983454,0.0008073078,0.0036986612],"category_scores_gemma":[0.0019768698,0.00035289218,0.0010868266,0.00042302333,0.0003468212,0.00068008556,0.0008827497,0.0010692048,0.0005520507],"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.00010701118,0.00011680929,0.0006882885,0.00047566034,0.000100904996,0.00019272395,0.0001444489,0.804765,0.007386494,0.03318602,0.0018138293,0.15102276],"study_design_scores_gemma":[0.000006592576,0.00003829885,0.00006152941,0.000012255976,0.0000075653847,0.000032266063,0.000015345035,0.9941806,0.00079412636,0.003872127,0.0009742593,0.000005063876],"about_ca_topic_score_codex":0.0022581469,"about_ca_topic_score_gemma":0.0024203542,"teacher_disagreement_score":0.0036986612,"about_ca_system_score_codex":0.00034855073,"about_ca_system_score_gemma":0.00077522,"threshold_uncertainty_score":0.012373209},"labels":[],"label_agreement":null},{"id":"W2804809316","doi":"10.1155/2018/4949565","title":"Decision-Support Framework for Selecting the Optimal Road Toll Collection System","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiple-criteria decision analysis; SWOT analysis; Ranking (information retrieval); Toll; Operations research; Selection (genetic algorithm); Decision support system; Computer science; Decision analysis; Evidential reasoning approach; Management science; Risk analysis (engineering); Transport engineering; Data mining; Engineering; Machine learning; Business decision mapping; Mathematics; Business","score_opus":0.009411637542008968,"score_gpt":0.26692301491793263,"score_spread":0.25751137737592367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804809316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070490222,0.0001611561,0.9873295,0.00029933167,0.000024816047,0.00021162529,0.0001929647,0.00020297746,0.0045287237],"genre_scores_gemma":[0.39803395,0.00037846458,0.59771115,0.0001161378,0.00006859316,0.00091938255,0.00050880393,0.000031749216,0.0022317616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976889,0.0010747636,0.00016611414,0.00024747936,0.0006416336,0.00018105858],"domain_scores_gemma":[0.99842143,0.0008966582,0.000100812686,0.000043463202,0.00045409493,0.00008352678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039093867,0.0015021753,0.0015142376,0.0021893345,0.0010052932,0.0028841938,0.0018476616,0.0017525544,0.004773163],"category_scores_gemma":[0.0045913523,0.00045577704,0.0012154238,0.0015392173,0.0007101227,0.0014064822,0.0014078035,0.0013811423,0.0006154845],"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.00008835238,0.00012367014,0.00049633894,0.00029862643,0.000059898233,0.00039600415,0.00022689738,0.8724174,0.0012287196,0.07363003,0.0016392843,0.04939474],"study_design_scores_gemma":[0.000028759609,0.000042151907,0.000073780146,0.000045269295,0.000020205021,0.00003069393,0.000061218,0.9797932,0.00038043343,0.01778962,0.0017219279,0.000012655296],"about_ca_topic_score_codex":0.008525749,"about_ca_topic_score_gemma":0.007412607,"teacher_disagreement_score":0.008525749,"about_ca_system_score_codex":0.0019938005,"about_ca_system_score_gemma":0.0035011787,"threshold_uncertainty_score":0.020675123},"labels":[],"label_agreement":null},{"id":"W2886657640","doi":"10.5539/jmr.v10n5p60","title":"A New Method for Optimal Solutions of Transportation Problems in LPP","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arithmetic function; Simple (philosophy); Mathematics; Transportation theory; Mathematical optimization; Linear programming; Feature (linguistics); Code (set theory); Algorithm; Computer science; Programming language","score_opus":0.14162479296987449,"score_gpt":0.4299329605513355,"score_spread":0.28830816758146105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886657640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044969245,0.0002918859,0.99652064,0.000107629596,0.00015935957,0.00003251231,0.000035570243,0.0000928744,0.0023098567],"genre_scores_gemma":[0.032559227,0.001101594,0.95651907,0.00020616305,0.0002980737,0.0003717736,0.00018832092,0.00026008268,0.008495702],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992225,0.0002384265,0.00004515981,0.00015681596,0.00028389774,0.00005327031],"domain_scores_gemma":[0.9994294,0.0002402569,0.000030493138,0.000053812164,0.00021761113,0.000028392198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117248,0.0009022356,0.0008906013,0.0013327124,0.0007564696,0.0010139535,0.0012809742,0.0013380259,0.0081716385],"category_scores_gemma":[0.0024994619,0.00048466932,0.0018559351,0.0010680844,0.00074829033,0.001993515,0.0013866667,0.0027027605,0.00153194],"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.00010298209,0.00013019436,0.00068128086,0.0011750717,0.00014294955,0.0002528017,0.00027340133,0.23156086,0.013517719,0.34075162,0.02953656,0.38187456],"study_design_scores_gemma":[0.000048750684,0.000089757945,0.0002032763,0.00010712235,0.00004389719,0.00029446444,0.000038079193,0.8777134,0.003519037,0.05994117,0.05795218,0.000048863232],"about_ca_topic_score_codex":0.002487127,"about_ca_topic_score_gemma":0.0022725794,"teacher_disagreement_score":0.0081716385,"about_ca_system_score_codex":0.0007452701,"about_ca_system_score_gemma":0.001509233,"threshold_uncertainty_score":0.027336895},"labels":[],"label_agreement":null},{"id":"W2890533656","doi":"10.4236/ajor.2018.85019","title":"Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem","year":2018,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Swine Innovation Porc","keywords":"Set (abstract data type); Mathematical optimization; Pareto principle; Solver; Linear programming; Computation; Simple (philosophy); Computer science; Decision maker; Pareto interpolation; Space (punctuation); Mathematics; Algorithm; Operations research; Statistics; Programming language","score_opus":0.04879858949140138,"score_gpt":0.38852608958476437,"score_spread":0.339727500093363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890533656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018308407,0.00007315307,0.97855294,0.000082075974,0.000018187233,0.000053696513,0.00006078603,0.00052055815,0.0023302748],"genre_scores_gemma":[0.17364149,0.000102011145,0.8233493,0.00006711077,0.000018416133,0.00036205293,0.00030911757,0.0003248422,0.0018257422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934286,0.00022997982,0.00003265421,0.00007106216,0.00021691169,0.0001064897],"domain_scores_gemma":[0.998209,0.0011775175,0.00009472733,0.00008128284,0.0003652285,0.00007222858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018231362,0.0015070345,0.0013795584,0.0016192718,0.00092199165,0.0014653731,0.0010390739,0.00117391,0.005012034],"category_scores_gemma":[0.0044399956,0.0006657782,0.0012953349,0.0010352929,0.0007054147,0.0009867859,0.0017346446,0.002162188,0.00092717604],"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.00012174443,0.00014085395,0.00080955576,0.00014202911,0.000050239312,0.00013909882,0.00014272117,0.8711078,0.0036568358,0.032906845,0.0017337159,0.08904856],"study_design_scores_gemma":[0.00001544523,0.000025863152,0.00007843546,0.000009241652,0.0000040787104,0.000013044359,0.00001919689,0.9885867,0.00076402683,0.009989189,0.0004887191,0.0000060924654],"about_ca_topic_score_codex":0.00512906,"about_ca_topic_score_gemma":0.004888615,"teacher_disagreement_score":0.00512906,"about_ca_system_score_codex":0.001023235,"about_ca_system_score_gemma":0.002104301,"threshold_uncertainty_score":0.016766906},"labels":[],"label_agreement":null},{"id":"W2896636203","doi":"10.33423/jabe.v20i6.380","title":"Quality Dollar Cost Averaging Investing Versus Quality Index Investing","year":2018,"lang":"en","type":"article","venue":"Journal of Applied Business and Economics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Liberian dollar; Dividend; Independence (probability theory); Volatility (finance); Index (typography); Quality (philosophy); Economics; Investment (military); Financial independence; Capital (architecture); Business; Finance; Mathematics; Statistics","score_opus":0.05351454684516536,"score_gpt":0.2749090275210119,"score_spread":0.22139448067584652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896636203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57553226,0.001438401,0.3727901,0.00076132786,0.00031133764,0.0002380543,0.00020702931,0.0009462376,0.04777521],"genre_scores_gemma":[0.9636562,0.00020131798,0.03319849,0.00007027561,0.000052152536,0.000026428484,0.00007859283,0.000053487704,0.00266308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986125,0.00027638755,0.000112584836,0.000225106,0.00054937875,0.00022397045],"domain_scores_gemma":[0.9973454,0.00062629237,0.0006369227,0.0006144181,0.00053018023,0.00024687496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021028155,0.00047090836,0.00069526455,0.0006400281,0.00022409778,0.0016650439,0.0009880028,0.00047443237,0.003775096],"category_scores_gemma":[0.007643038,0.00012291872,0.0003370275,0.001039576,0.0005057433,0.0017606163,0.0007157599,0.0005049622,0.00034129684],"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.0023918026,0.00057602103,0.020477116,0.00033087825,0.00022611972,0.00025659672,0.00022049651,0.1677503,0.019298233,0.15180781,0.0039515095,0.632713],"study_design_scores_gemma":[0.0002613962,0.0063976822,0.045693297,0.00009336703,0.0005724952,0.00078325026,0.00033319672,0.796949,0.04190336,0.08602416,0.020858945,0.00012984058],"about_ca_topic_score_codex":0.0007247132,"about_ca_topic_score_gemma":0.00069449213,"teacher_disagreement_score":0.003775096,"about_ca_system_score_codex":0.00082150754,"about_ca_system_score_gemma":0.00047170822,"threshold_uncertainty_score":0.012628913},"labels":[],"label_agreement":null},{"id":"W2912136880","doi":"10.1007/s12351-019-00451-x","title":"A light robust model for aggregate production planning with consideration of environmental impacts of machines","year":2019,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"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":"Aggregate planning; Production (economics); Aggregate (composite); Computer science; Production planning; Environmental pollution; Computational intelligence; Sensitivity (control systems); Variable (mathematics); Product (mathematics); Operations research; Control (management); Function (biology); Risk analysis (engineering); Mathematical optimization; Environmental science; Artificial intelligence; Engineering; Economics; Mathematics; Business; Microeconomics","score_opus":0.05105892803399259,"score_gpt":0.3152119319201446,"score_spread":0.264153003886152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912136880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014299681,0.00020816512,0.97723913,0.00031423094,0.000058957954,0.000050772032,0.00031943695,0.0002884318,0.007221249],"genre_scores_gemma":[0.90416026,0.0004629103,0.07638476,0.00021674701,0.00008713368,0.00028508416,0.00045606028,0.00017832864,0.017768733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00013110494,0.000017566925,0.00012353943,0.00012611752,0.000081537226],"domain_scores_gemma":[0.99938726,0.00028166609,0.00012495281,0.000046235058,0.000109868335,0.000050007846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045096,0.00081650185,0.0015780831,0.0006608791,0.00049060874,0.0018003484,0.0019984818,0.0016509466,0.0052087894],"category_scores_gemma":[0.0021171002,0.0006724304,0.0011239895,0.0008372504,0.0010924242,0.0013539147,0.0014215133,0.0011964656,0.0007045943],"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.000016236912,0.0000065667346,0.000039356768,0.000015160007,0.0000084731255,0.00001523889,0.000006044749,0.99269,0.00035442924,0.0049437336,0.00016220685,0.0017425466],"study_design_scores_gemma":[0.0000033286924,0.000008528152,0.000029115989,0.0000014988748,0.0000036264487,0.0000020770558,0.0000014733082,0.9977456,0.00007094648,0.0019688657,0.00016178518,0.0000030900321],"about_ca_topic_score_codex":0.011516691,"about_ca_topic_score_gemma":0.008130763,"teacher_disagreement_score":0.011516691,"about_ca_system_score_codex":0.0015339216,"about_ca_system_score_gemma":0.0012922882,"threshold_uncertainty_score":0.02289933},"labels":[],"label_agreement":null},{"id":"W2936226829","doi":"10.1111/itor.12694","title":"Special issue on “Transportation and Logistics with Autonomous Technologies”","year":2019,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Norwegian; Citation; Schools of economic thought; Sociology; Library science; Operations research; Computer science; Linguistics; Philosophy; Economics; Mathematics; Neoclassical economics","score_opus":0.034537682451647886,"score_gpt":0.3313023377556271,"score_spread":0.2967646553039792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936226829","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002880791,0.018300932,0.0010933103,0.015018587,0.92982316,0.000071026654,0.0004137829,0.0001200661,0.034871105],"genre_scores_gemma":[0.0017396007,0.01629535,0.0004618171,0.0049087866,0.8887665,0.00007838923,0.00077881373,0.00019475896,0.086775936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975879,0.0003127266,0.00023033649,0.00049702363,0.0010982265,0.0002737067],"domain_scores_gemma":[0.9944153,0.0013441578,0.00055748894,0.00048440424,0.0019375375,0.0012610931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023558864,0.0035283156,0.00347934,0.0070564277,0.0022427891,0.0072795674,0.0028545028,0.005423892,0.105234265],"category_scores_gemma":[0.005209795,0.0006799443,0.002361583,0.0037744343,0.001281546,0.0049587404,0.0031765804,0.003796179,0.039512638],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053795473,0.00003453973,0.00008974933,0.00039530007,0.000025698095,0.00007863632,0.0000091765705,0.00011410625,0.00028296266,0.0025950312,0.97941065,0.016910322],"study_design_scores_gemma":[0.000014552777,0.00004641676,0.00053875,0.0002206136,0.00002739681,0.0001426505,0.000014808393,0.0002597508,0.00014538165,0.0028824892,0.99569595,0.000011269586],"about_ca_topic_score_codex":0.001083963,"about_ca_topic_score_gemma":0.0023749853,"teacher_disagreement_score":0.105234265,"about_ca_system_score_codex":0.0021049709,"about_ca_system_score_gemma":0.0027840252,"threshold_uncertainty_score":0.3520437},"labels":[],"label_agreement":null},{"id":"W2938267440","doi":"10.1287/ijoc.2018.0838","title":"Solving Large Batches of Linear Programs","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical proof; Parametric statistics; Linear programming; Geometric programming; Basis (linear algebra); Computer science; Set (abstract data type); Space (punctuation); Mathematics; Sensitivity (control systems); Mathematical optimization; Algorithm; Geometry","score_opus":0.011727803759225532,"score_gpt":0.23535209128610612,"score_spread":0.2236242875268806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938267440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14447007,0.0006368883,0.8314453,0.002267826,0.00034191937,0.0005439929,0.0011361317,0.0053815763,0.013776297],"genre_scores_gemma":[0.4480601,0.00025614144,0.5410348,0.000680633,0.00020001616,0.000752124,0.0017789917,0.00072706037,0.006510093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981725,0.00048517514,0.00010490247,0.0005684581,0.00042233185,0.0002465774],"domain_scores_gemma":[0.99148715,0.0064728367,0.0004781593,0.0007640235,0.0005210198,0.00027679992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029995835,0.0014045507,0.0018978411,0.00045193272,0.00093723735,0.0018212707,0.0030652522,0.0018667687,0.008562835],"category_scores_gemma":[0.008360917,0.0012232729,0.0016356052,0.0009218503,0.0010772953,0.0021547023,0.0014892132,0.003749157,0.001072575],"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.00035038745,0.00029070865,0.0016783539,0.00024812142,0.00007518417,0.00019647965,0.0000804802,0.92812026,0.0028061273,0.015087112,0.00737769,0.043689113],"study_design_scores_gemma":[0.00004730492,0.00004047065,0.00019707168,0.000006980238,0.000009830176,0.000021759608,0.000030686842,0.9883454,0.00093497307,0.009232355,0.0011257753,0.0000073821407],"about_ca_topic_score_codex":0.007561402,"about_ca_topic_score_gemma":0.010687393,"teacher_disagreement_score":0.008562835,"about_ca_system_score_codex":0.0017035502,"about_ca_system_score_gemma":0.003120514,"threshold_uncertainty_score":0.028645515},"labels":[],"label_agreement":null},{"id":"W2944062520","doi":"10.3233/jifs-181527","title":"Commentary on “A reply to a Note on the paper “A simplified novel technique for solving fully fuzzy linear programming problems””","year":2019,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Optimization and Mathematical Programming","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 Manitoba","funders":"","keywords":"Simplex algorithm; Fuzzy logic; Mathematics; Linear programming; Mathematical theory; Fuzzy set; Applied mathematics; Calculus (dental); Computer science; Mathematical economics; Mathematical optimization; Artificial intelligence","score_opus":0.02530461734579143,"score_gpt":0.26802147681863486,"score_spread":0.24271685947284344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944062520","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055917008,0.0011153824,0.00014398216,0.9584031,0.039658237,0.000008910625,0.00007291486,0.000023621766,0.00051792077],"genre_scores_gemma":[0.00082122127,0.00053341803,0.00014210305,0.9668046,0.030272521,0.000032439897,0.000017188935,0.000030594176,0.0013459212],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98717797,0.0033206118,0.0017445458,0.0022549706,0.0044501447,0.0010518344],"domain_scores_gemma":[0.94967604,0.027560191,0.0031475108,0.0011911474,0.016276568,0.002148591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009928565,0.0017606777,0.0020071408,0.001580821,0.006838986,0.0052951826,0.0066984487,0.064269565,0.00827195],"category_scores_gemma":[0.09063125,0.0014079161,0.003151054,0.0019051597,0.0077334004,0.0071881227,0.0034076092,0.07443459,0.009738186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015441263,0.0000045525035,0.00003892034,0.0000596673,0.000006319953,0.00008652677,0.00016285498,0.00002399517,0.000040504463,0.0015918155,0.9969388,0.0010306847],"study_design_scores_gemma":[0.0000472821,0.00003243753,0.00044954827,0.00062312966,0.000030060553,0.00034117964,0.0007340389,0.00019770591,0.000313159,0.00688582,0.990256,0.00008968297],"about_ca_topic_score_codex":0.022622563,"about_ca_topic_score_gemma":0.020578448,"teacher_disagreement_score":0.064269565,"about_ca_system_score_codex":0.007203207,"about_ca_system_score_gemma":0.011555039,"threshold_uncertainty_score":0.052507937},"labels":[],"label_agreement":null},{"id":"W2952129533","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Business; Transport engineering; Engineering","score_opus":0.05221844124841421,"score_gpt":0.17338697592397498,"score_spread":0.12116853467556077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952129533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019277388,0.0008252284,0.9421571,0.002109261,0.0006395837,0.0003251252,0.000665737,0.0031521774,0.030848445],"genre_scores_gemma":[0.29850727,0.0012450159,0.6747003,0.0015140264,0.00059571647,0.0009753923,0.0028477777,0.0011844191,0.018429955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977902,0.00054551964,0.00013054829,0.00053719943,0.000565023,0.0004314074],"domain_scores_gemma":[0.99573094,0.0018585782,0.0002996392,0.0012717015,0.0005663769,0.00027281969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018707677,0.0018197325,0.0017170649,0.0007918329,0.0011875819,0.0016580636,0.0025138466,0.0018772188,0.028534383],"category_scores_gemma":[0.01344605,0.0005370511,0.0015443086,0.0018302143,0.0018043658,0.0052663297,0.0038158877,0.004682338,0.005564149],"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.0015534936,0.00048419295,0.0012944137,0.0010492919,0.00008546383,0.00030368724,0.00039020236,0.31907305,0.0064910916,0.32418993,0.080021545,0.26506373],"study_design_scores_gemma":[0.00021237393,0.00022476896,0.0003422712,0.000082485705,0.00003970633,0.00016395545,0.00011800296,0.68358874,0.002442717,0.28587756,0.026878815,0.000028564344],"about_ca_topic_score_codex":0.0035558832,"about_ca_topic_score_gemma":0.004622367,"teacher_disagreement_score":0.028534383,"about_ca_system_score_codex":0.001820145,"about_ca_system_score_gemma":0.0028509535,"threshold_uncertainty_score":0.09545702},"labels":[],"label_agreement":null},{"id":"W2952556332","doi":"10.3233/jifs-181541","title":"A novel method for solving the fully neutrosophic linear programming problems: Suggested modifications","year":2019,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Linear programming; Mathematical optimization; Algorithm; Mathematics","score_opus":0.03529797426391277,"score_gpt":0.2852922435176206,"score_spread":0.24999426925370785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952556332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020187425,0.00024347361,0.9942502,0.0001305701,0.00011050652,0.000069506146,0.00004078748,0.00013538792,0.0030008394],"genre_scores_gemma":[0.06604477,0.0005810457,0.92466104,0.00018612052,0.00017611089,0.00038503535,0.00018533887,0.000108389344,0.0076722642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00015441228,0.000059961654,0.00013522261,0.00024514578,0.00005129819],"domain_scores_gemma":[0.9996424,0.00012398025,0.000022051436,0.000032262735,0.00015843395,0.00002081224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074904773,0.0008487259,0.0008843118,0.00086596864,0.0005620571,0.0010598262,0.0013956372,0.0013201206,0.007093828],"category_scores_gemma":[0.0013567468,0.00045376905,0.0016243847,0.00089251436,0.00036022754,0.0011535167,0.0012573658,0.0018007777,0.0018485114],"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.00018987537,0.00026968078,0.00096858124,0.0010769458,0.00017427566,0.0004907392,0.00035005485,0.23742169,0.026931832,0.07149717,0.013358794,0.6472704],"study_design_scores_gemma":[0.000036715646,0.00009439699,0.00023716675,0.000042386506,0.000027340544,0.0002484858,0.000041589203,0.9736258,0.0028567761,0.010738375,0.012023314,0.00002768655],"about_ca_topic_score_codex":0.0023774414,"about_ca_topic_score_gemma":0.0027736945,"teacher_disagreement_score":0.007093828,"about_ca_system_score_codex":0.0003330285,"about_ca_system_score_gemma":0.001201837,"threshold_uncertainty_score":0.023731172},"labels":[],"label_agreement":null},{"id":"W2952728573","doi":"10.48550/arxiv.1208.5172","title":"An iterative scheme for solving the optimal transportation problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Mathematical Programming","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":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Measure (data warehouse); Scheme (mathematics); Mathematical optimization; Transportation theory; Function (biology); Upper and lower bounds; Iterative method; Computer science; Mathematics","score_opus":0.05555063535320044,"score_gpt":0.19627993579545322,"score_spread":0.1407293004422528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952728573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003341455,0.000030134917,0.994915,0.000067989604,0.00001736181,0.00002750213,0.000012426933,0.000057923,0.0015301257],"genre_scores_gemma":[0.19978906,0.0001430947,0.7960412,0.000056996705,0.000023259667,0.00030759617,0.00008572432,0.00007428853,0.0034788284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993031,0.00025648842,0.000037164864,0.0000983812,0.00024473108,0.000060167677],"domain_scores_gemma":[0.99898404,0.0005216531,0.00007823367,0.00015919459,0.00019257277,0.00006431577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017879894,0.0006855263,0.00056140084,0.00055670674,0.0005826601,0.000758768,0.0015691837,0.0017883708,0.0029257482],"category_scores_gemma":[0.005559853,0.00034286646,0.0008533509,0.00065473345,0.0013368266,0.0014909606,0.002313007,0.0018871696,0.0005717253],"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.00006865711,0.00004091126,0.0002721658,0.000066013046,0.000017992383,0.00005688791,0.00013255312,0.77686757,0.0043749935,0.18277144,0.0010771062,0.03425371],"study_design_scores_gemma":[0.000008934314,0.00001841281,0.000015263739,0.000005572017,0.0000025046377,0.000011883931,0.0000058051087,0.98292047,0.000644982,0.015410833,0.0009507734,0.0000046545956],"about_ca_topic_score_codex":0.0032619084,"about_ca_topic_score_gemma":0.0024005612,"teacher_disagreement_score":0.0032619084,"about_ca_system_score_codex":0.001081774,"about_ca_system_score_gemma":0.0014906207,"threshold_uncertainty_score":0.009787619},"labels":[],"label_agreement":null},{"id":"W2955649334","doi":"10.1007/s10479-019-03295-y","title":"Goal programming approach for political districting in Santa Catarina State: Brazil","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Transport Canada","funders":"","keywords":"Contiguity; Legislation; Redistricting; Politics; Context (archaeology); Population; State (computer science); Distribution (mathematics); Public administration; Operations research; Computer science; Political science; Economics; Sociology; Geography; Mathematics; Law; Demography","score_opus":0.11756106179337812,"score_gpt":0.42744367272472567,"score_spread":0.30988261093134756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955649334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7902243,0.0009249787,0.102638796,0.0048799855,0.00008833487,0.00034053775,0.0014115717,0.00012354569,0.09936793],"genre_scores_gemma":[0.9851481,0.00018597215,0.010929341,0.000034240715,0.000009403972,0.000043206448,0.0001554183,0.000017653096,0.0034766712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992424,0.0004301958,0.000021469417,0.00008328995,0.000049780214,0.00017284797],"domain_scores_gemma":[0.999382,0.000349399,0.000063507374,0.00002983331,0.00009595886,0.000079272926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771098,0.00026717238,0.00050016446,0.0009025696,0.001350214,0.003107064,0.00081702915,0.0007468637,0.0032309745],"category_scores_gemma":[0.0028633522,0.0002568734,0.0006040803,0.0015575999,0.0006502117,0.0008117429,0.0009874635,0.0006899833,0.00012269108],"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.000087095425,0.0001631383,0.016394943,0.00018663345,0.00010843988,0.00050263945,0.0016431884,0.4312298,0.00047285657,0.5051786,0.005178168,0.03885457],"study_design_scores_gemma":[0.000041462114,0.000079032696,0.01702736,0.00017427592,0.00010360048,0.00013818056,0.007916724,0.7940691,0.0004993777,0.157362,0.02254995,0.00003893048],"about_ca_topic_score_codex":0.15521695,"about_ca_topic_score_gemma":0.32374328,"teacher_disagreement_score":0.15521695,"about_ca_system_score_codex":0.00498528,"about_ca_system_score_gemma":0.006800671,"threshold_uncertainty_score":0.30862695},"labels":[],"label_agreement":null},{"id":"W2972051872","doi":"10.1007/s00521-019-04466-5","title":"Derivation of personalized numerical scales from distribution linguistic preference relations: an expected consistency-based goal programming approach","year":2019,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Preference; Statement (logic); Computer science; Semantics (computer science); Problem statement; Linguistics; Natural language processing; Mathematics; Artificial intelligence; Management science; Statistics","score_opus":0.01990908669235801,"score_gpt":0.24722783032678733,"score_spread":0.22731874363442933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972051872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006302852,0.000033774402,0.99143994,0.00015326634,0.000011366169,0.000043882526,0.000052613657,0.000096424665,0.0018658364],"genre_scores_gemma":[0.36213723,0.00013814871,0.6338061,0.00018795804,0.000046765756,0.0003702206,0.00030622398,0.00018873472,0.0028186797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679416,0.0015027166,0.00018783376,0.0005913307,0.0007588349,0.00016511805],"domain_scores_gemma":[0.9934024,0.004234357,0.00044376033,0.000655618,0.0010549913,0.00020884364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004353713,0.0008331271,0.0010413696,0.0013141449,0.0005770383,0.0025740478,0.002124025,0.0012009032,0.0047867843],"category_scores_gemma":[0.021321574,0.00093386084,0.0014450483,0.0017182662,0.0011112441,0.0042552375,0.0027714965,0.0030584082,0.00078688754],"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.00015799105,0.00039490702,0.0028490687,0.0003122786,0.00021132034,0.00026657697,0.0010155721,0.18846735,0.003272683,0.621709,0.0040479256,0.17729537],"study_design_scores_gemma":[0.000016987327,0.00005954035,0.00061483815,0.000039442963,0.00003404203,0.000047704514,0.00010111111,0.7770194,0.0008854906,0.21985795,0.0012993347,0.000024151366],"about_ca_topic_score_codex":0.0015605264,"about_ca_topic_score_gemma":0.0018387117,"teacher_disagreement_score":0.0047867843,"about_ca_system_score_codex":0.0012199257,"about_ca_system_score_gemma":0.0015751513,"threshold_uncertainty_score":0.023024917},"labels":[],"label_agreement":null},{"id":"W2988733330","doi":"10.1007/978-3-030-26676-9_7","title":"New Methods for Solving Fully Fuzzy Solid Transportation Problems with LR Fuzzy Parameters","year":2019,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Fuzzy transportation; Fuzzy logic; Mathematical optimization; Computer science; Mathematics; Fuzzy set operations; Fuzzy set; Artificial intelligence","score_opus":0.04444471830262737,"score_gpt":0.3205293188917555,"score_spread":0.27608460058912815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988733330","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014854855,0.00043644052,0.9950256,0.00005083168,0.00009256179,0.000025076068,0.000020565492,0.000067530695,0.0027959056],"genre_scores_gemma":[0.060460173,0.0009228082,0.9258271,0.00009531829,0.00017225216,0.00024834083,0.00010010919,0.00014972236,0.012024171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999648,0.00009578322,0.000024536797,0.000051128736,0.00015990283,0.000020610767],"domain_scores_gemma":[0.9993728,0.0003725733,0.00004379104,0.00005466332,0.00013362718,0.000022533786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011034928,0.0011013398,0.0013860315,0.000867735,0.00045932888,0.0010112354,0.0019795934,0.0013893229,0.004869538],"category_scores_gemma":[0.0023281467,0.00071298226,0.0013215716,0.0010255093,0.000902064,0.0016578372,0.0013943227,0.0022152911,0.00082825474],"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.00007298369,0.000082953185,0.00020633051,0.00049169536,0.00010357614,0.00008023851,0.00017235885,0.6021929,0.0073707514,0.12307672,0.004123892,0.26202554],"study_design_scores_gemma":[0.000007460608,0.00001821726,0.000042729946,0.00001638485,0.000008935073,0.000023338125,0.000009688225,0.9834589,0.00044497589,0.012644116,0.0033152932,0.000010011369],"about_ca_topic_score_codex":0.0026668478,"about_ca_topic_score_gemma":0.004065436,"teacher_disagreement_score":0.004869538,"about_ca_system_score_codex":0.00063360506,"about_ca_system_score_gemma":0.00074449176,"threshold_uncertainty_score":0.016290247},"labels":[],"label_agreement":null},{"id":"W2994661168","doi":"10.35629/9795-05020101","title":"A Simulation-Optimization Algorithm for Generating Sets of Alternatives Using Population-Based Metaheuristic Procedures","year":2019,"lang":"en","type":"article","venue":"Journal of Software Engineering and Simulation","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"York University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Population; Parallel metaheuristic; Algorithm; Mathematics; Meta-optimization; Medicine","score_opus":0.012728386387827409,"score_gpt":0.264325938099421,"score_spread":0.2515975517115936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994661168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002062094,0.00005126498,0.99596953,0.000054165717,0.000011442091,0.000077324505,0.000019868332,0.00013919287,0.0016151646],"genre_scores_gemma":[0.0662536,0.000118578835,0.9318197,0.000051816547,0.000012637461,0.0006740149,0.00008309467,0.00004294313,0.0009436995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993222,0.00037276093,0.000030266674,0.000067721405,0.00016859434,0.000038526523],"domain_scores_gemma":[0.99894613,0.00078187254,0.00006548505,0.000059884504,0.00011506408,0.000031614843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016111442,0.0010672036,0.0008150681,0.0010388131,0.0007177866,0.00078788254,0.0014072097,0.0011861953,0.0033856137],"category_scores_gemma":[0.0034960634,0.0005732999,0.00093477994,0.0010541872,0.0009201338,0.0007716898,0.0011962383,0.0014828941,0.00051195646],"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.000028811004,0.00004086384,0.00029510795,0.000046984413,0.000043221862,0.000045256525,0.000052172523,0.91906935,0.0009520852,0.038997833,0.0007094015,0.03971892],"study_design_scores_gemma":[0.000020267751,0.00001808397,0.00002873574,0.000010365743,0.00000802727,0.000020876309,0.000005618096,0.99093187,0.0004201713,0.007351013,0.0011796667,0.000005199632],"about_ca_topic_score_codex":0.0030122977,"about_ca_topic_score_gemma":0.003991518,"teacher_disagreement_score":0.0033856137,"about_ca_system_score_codex":0.0009460043,"about_ca_system_score_gemma":0.0020635044,"threshold_uncertainty_score":0.011325955},"labels":[],"label_agreement":null},{"id":"W3006806717","doi":"10.1155/2020/7570686","title":"Green and Reliable Freight Routing Problem in the Road-Rail Intermodal Transportation Network with Uncertain Parameters: A Fuzzy Goal Programming Approach","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Ministry of Education of the People's Republic of China; Kungliga Tekniska Högskolan; National Natural Science Foundation of China","keywords":"Mathematical optimization; Routing (electronic design automation); Fuzzy logic; Fuzzy transportation; Fuzzy set; Computer science; Linearization; Operations research; Fuzzy number; Integer programming; Engineering; Nonlinear system; Mathematics","score_opus":0.012931384612039243,"score_gpt":0.21574504847273177,"score_spread":0.20281366386069252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006806717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012102854,0.0004975953,0.9821454,0.00040442523,0.000029814259,0.00006233994,0.00006815122,0.000054827404,0.004634649],"genre_scores_gemma":[0.6540464,0.0018488283,0.3367045,0.00027893615,0.000119821205,0.00059646793,0.0002214451,0.00010411786,0.0060794344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988986,0.0004917102,0.000041127572,0.00019869446,0.00022252425,0.000147271],"domain_scores_gemma":[0.99916136,0.0005554359,0.00009459804,0.00002227921,0.00012463753,0.00004179735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021959946,0.0018373776,0.0018943417,0.0014891019,0.0007710228,0.0022666266,0.0017164472,0.0027692046,0.0017027622],"category_scores_gemma":[0.002163137,0.00089562545,0.0017348512,0.0018907918,0.0011545726,0.0018776631,0.0011768787,0.0019102596,0.0001965039],"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.000017377271,0.000022829427,0.0001545053,0.00006471555,0.000031304156,0.00009027078,0.000041539708,0.9792908,0.0003178098,0.01532135,0.00029044822,0.0043569645],"study_design_scores_gemma":[0.0000044372255,0.00001724295,0.000049653943,0.000012430272,0.000012176128,0.000012258783,0.00002491258,0.9906731,0.00012569404,0.008715012,0.00034693096,0.0000061070295],"about_ca_topic_score_codex":0.010895681,"about_ca_topic_score_gemma":0.007952253,"teacher_disagreement_score":0.010895681,"about_ca_system_score_codex":0.0028713604,"about_ca_system_score_gemma":0.0025407341,"threshold_uncertainty_score":0.0216645},"labels":[],"label_agreement":null},{"id":"W3037228688","doi":"10.1504/ijor.2021.10024058","title":"Computing Pareto set in the criterion space for bicriteria linear programs using a single criterion software","year":2019,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Simple (philosophy); Set (abstract data type); Pareto principle; Mathematical optimization; Solver; Computer science; Linear programming; Space (punctuation); Linear space; Software; Algorithm; Mathematics; Discrete mathematics","score_opus":0.14810578597622853,"score_gpt":0.4278482001933418,"score_spread":0.27974241421711327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037228688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025847211,0.000053286698,0.971217,0.000051502484,0.000008445834,0.000051329982,0.000041401134,0.00031256326,0.002417274],"genre_scores_gemma":[0.23803651,0.00008132058,0.7596869,0.00003568936,0.000008476078,0.0002829837,0.00017889819,0.00023334993,0.0014558538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988355,0.0003366573,0.000060724837,0.0001355172,0.00049950246,0.00013214308],"domain_scores_gemma":[0.99831605,0.0010009528,0.00012001402,0.00010219434,0.00038535573,0.000075559554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022588088,0.0012813666,0.0011294843,0.0024693392,0.0009369119,0.0018507792,0.00082492025,0.0008223848,0.0037439512],"category_scores_gemma":[0.0052795857,0.0004977797,0.0013416947,0.0012793842,0.0010506285,0.0011328242,0.0018588498,0.0016371803,0.0007314584],"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.00013490373,0.00014988039,0.0014192468,0.00021892945,0.00007840947,0.000120267694,0.00027842424,0.7643238,0.00798786,0.10016783,0.0012131927,0.12390728],"study_design_scores_gemma":[0.000016088294,0.00006985877,0.00026480842,0.000027794207,0.0000101410815,0.000036453668,0.00003450038,0.95773464,0.0024128563,0.038495902,0.0008812119,0.000015805159],"about_ca_topic_score_codex":0.0037316883,"about_ca_topic_score_gemma":0.0033061,"teacher_disagreement_score":0.0037439512,"about_ca_system_score_codex":0.0013806033,"about_ca_system_score_gemma":0.002196116,"threshold_uncertainty_score":0.012524724},"labels":[],"label_agreement":null},{"id":"W3046875461","doi":"","title":"Entrepreneur 2019: Application of linear programming to semi-commercial arable and fishery","year":2020,"lang":"en","type":"paratext","venue":"","topic":"Optimization and Mathematical Programming","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":"Fishery; Arable land; Business; Fishing; Agriculture; Ecology; Biology","score_opus":0.00980613457138608,"score_gpt":0.23739455282605776,"score_spread":0.2275884182546717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046875461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01026532,0.000098202276,0.9725176,0.00029900673,0.00007996521,0.00036030417,0.00035499735,0.0017689337,0.0142557565],"genre_scores_gemma":[0.10879897,0.00016491402,0.8734829,0.00012974492,0.000047041296,0.0014379577,0.00046402265,0.0005226252,0.014951853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.00090195896,0.000066646884,0.00016821356,0.00016468918,0.00011841794],"domain_scores_gemma":[0.99707747,0.0023871025,0.00012002527,0.000072053255,0.0002872915,0.000056007237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030858535,0.0009104168,0.000608934,0.0007702624,0.00055178715,0.0012174753,0.0011298567,0.00063930114,0.024960333],"category_scores_gemma":[0.0055430476,0.0006848397,0.0011530283,0.00090984494,0.00038058794,0.0006301017,0.0012803698,0.0019395375,0.002877408],"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.00036925563,0.00057847623,0.0042848648,0.000656221,0.0001891972,0.0005372689,0.0005588615,0.4537366,0.0020013084,0.086229615,0.019778548,0.43107983],"study_design_scores_gemma":[0.000040328767,0.00016653593,0.00046352125,0.000054504642,0.00001496384,0.000050889066,0.00013965368,0.9649031,0.0010476165,0.017729256,0.015371402,0.000018139153],"about_ca_topic_score_codex":0.00546691,"about_ca_topic_score_gemma":0.007653714,"teacher_disagreement_score":0.024960333,"about_ca_system_score_codex":0.0006504017,"about_ca_system_score_gemma":0.002057539,"threshold_uncertainty_score":0.08350062},"labels":[],"label_agreement":null},{"id":"W3047295571","doi":"10.1016/j.jclepro.2020.123566","title":"A stochastic network design problem for hazardous waste management","year":2020,"lang":"en","type":"article","venue":"Journal of Cleaner Production","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Hazardous waste; Time horizon; Stochastic programming; Network planning and design; Population; Flow network; Linear programming; Operations research; Computer science; Engineering; Risk analysis (engineering); Mathematical optimization; Waste management; Business; Mathematics","score_opus":0.027007497033502217,"score_gpt":0.22327363851022056,"score_spread":0.19626614147671834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047295571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025043597,0.00065675884,0.9649558,0.0007766299,0.00013119253,0.00018629014,0.0005877371,0.00013281041,0.0075291996],"genre_scores_gemma":[0.78478277,0.0017847726,0.19695348,0.00032858455,0.00017201621,0.001211956,0.0012300898,0.00013253296,0.013403821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803025,0.0009716523,0.00007587233,0.00040143394,0.00029621008,0.00022454263],"domain_scores_gemma":[0.9974541,0.001806863,0.000321068,0.000042480217,0.00024776612,0.0001277426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022211634,0.001958779,0.0017396674,0.0013007214,0.00089982315,0.0019142065,0.0014652307,0.002641227,0.0045319777],"category_scores_gemma":[0.004458451,0.0010155129,0.0015861018,0.0017414255,0.0012150417,0.0015389791,0.0014113104,0.001848163,0.0003217594],"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.00002296297,0.000015499207,0.00021055504,0.00005679391,0.000028853206,0.00007376213,0.000018407958,0.9879545,0.00020982999,0.00826356,0.00034976052,0.0027956155],"study_design_scores_gemma":[0.000012797991,0.000024075547,0.00008790333,0.0000075914663,0.000013683104,0.000019824543,0.000015361604,0.99168605,0.00009011767,0.0073146815,0.00072184944,0.0000059501713],"about_ca_topic_score_codex":0.009186148,"about_ca_topic_score_gemma":0.009046646,"teacher_disagreement_score":0.009186148,"about_ca_system_score_codex":0.0025328961,"about_ca_system_score_gemma":0.0024389476,"threshold_uncertainty_score":0.018377542},"labels":[],"label_agreement":null},{"id":"W3087366400","doi":"10.1002/cjce.23886","title":"A two‐step coordinated optimization model for a dewatering process","year":2020,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Foundation for Innovative Research Groups of the National Natural Science Foundation of China; National Natural Science Foundation of China","keywords":"Dewatering; Production (economics); Process (computing); Mathematical optimization; Genetic algorithm; Computer science; Filter (signal processing); Process engineering; Engineering; Mathematics; Economics","score_opus":0.015275831380019074,"score_gpt":0.20905668478659445,"score_spread":0.1937808534065754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087366400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05801554,0.0004988193,0.92722464,0.00058130594,0.00010493852,0.0001489058,0.0002301144,0.0003059393,0.01288971],"genre_scores_gemma":[0.9550601,0.00036313984,0.03439177,0.00009202572,0.000020734233,0.00041733566,0.00020993123,0.00005746325,0.009387599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992787,0.00018293997,0.000033265616,0.00021930448,0.00014424123,0.00014152394],"domain_scores_gemma":[0.99922264,0.00040923193,0.0000932302,0.000024273395,0.00020579994,0.000044789365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014958733,0.0014448122,0.0017718761,0.00082281826,0.0009253651,0.0022198323,0.0015484558,0.0023401168,0.0037343607],"category_scores_gemma":[0.001718977,0.0010365043,0.0014200879,0.00082466594,0.001113042,0.0011567236,0.0012756906,0.0016090685,0.00033439143],"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.000013410771,0.000010830172,0.000112546775,0.000012902241,0.0000096174645,0.000023231432,0.000010728944,0.9971522,0.0002470558,0.001304089,0.00007823759,0.0010252355],"study_design_scores_gemma":[0.000004013533,0.0000065216755,0.000036957743,0.0000011432014,0.0000037969883,0.0000013931395,0.0000028646878,0.999549,0.00005672042,0.00027095925,0.00006471365,0.0000019421714],"about_ca_topic_score_codex":0.03940523,"about_ca_topic_score_gemma":0.01324542,"teacher_disagreement_score":0.03940523,"about_ca_system_score_codex":0.0019359039,"about_ca_system_score_gemma":0.0023422283,"threshold_uncertainty_score":0.078351736},"labels":[],"label_agreement":null},{"id":"W3104709940","doi":"10.3390/jrfm13110280","title":"A New Application for the Goal Programming—The Target Decision Rule for Uncertain Problems","year":2020,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Goal programming; Analogy; Decision maker; Computer science; Certainty; Interpretation (philosophy); Domain (mathematical analysis); Order (exchange); Decision rule; Basis (linear algebra); Mathematics; Artificial intelligence; Management science; Operations research; Programming language; Engineering","score_opus":0.01010883456407226,"score_gpt":0.2271718912013876,"score_spread":0.21706305663731532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104709940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015711428,0.00032128004,0.99211603,0.00046057464,0.00008837544,0.000029152994,0.00004326675,0.000044295204,0.0053258063],"genre_scores_gemma":[0.17447215,0.0015899146,0.8164255,0.00064496574,0.0005211658,0.00036798613,0.00018647997,0.00016539451,0.0056264787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969037,0.0013497801,0.00016303976,0.0005348341,0.00093596446,0.00011257895],"domain_scores_gemma":[0.9973623,0.0017085072,0.0001926474,0.00020858161,0.0004246043,0.0001034023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034495003,0.0009601498,0.0012098771,0.0014079557,0.0005832212,0.0025410736,0.0017829312,0.0015087094,0.0025400259],"category_scores_gemma":[0.0074329274,0.00038172925,0.0019323335,0.0017281462,0.0020826606,0.0027889435,0.0022503876,0.0044050855,0.0008371383],"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.000041967163,0.000046779503,0.0003837421,0.00026201826,0.000066693916,0.00018843621,0.00022588248,0.08856594,0.0018997291,0.8231518,0.0035010043,0.08166596],"study_design_scores_gemma":[0.00001957267,0.000108170316,0.00020800423,0.00015247404,0.00003202944,0.00025966112,0.000052844895,0.52381086,0.00145926,0.45498604,0.018869052,0.00004210142],"about_ca_topic_score_codex":0.0011912913,"about_ca_topic_score_gemma":0.0006968171,"teacher_disagreement_score":0.0034495003,"about_ca_system_score_codex":0.0009381889,"about_ca_system_score_gemma":0.0011588173,"threshold_uncertainty_score":0.018242896},"labels":[],"label_agreement":null},{"id":"W3115020944","doi":"10.1287/trsc.2020.1022","title":"Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; Université du Québec à Montréal","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Decomposition; Network planning and design; Computer science; Stochastic programming; Class (philosophy); Dual (grammatical number); Decomposition method (queueing theory); Relaxation (psychology); Process (computing); Mathematics","score_opus":0.07043514893512383,"score_gpt":0.32223355932867853,"score_spread":0.2517984103935547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115020944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047703748,0.000076008924,0.9986405,0.00003566988,0.000009695389,0.000023045894,0.000025540881,0.000054587745,0.0006579552],"genre_scores_gemma":[0.04641907,0.00075863523,0.95010334,0.00008840374,0.000052439664,0.00033089737,0.00021139513,0.00015220937,0.0018836602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992101,0.0003562115,0.00004061765,0.000108822635,0.00022668454,0.00005751386],"domain_scores_gemma":[0.9990159,0.00053874124,0.00011244775,0.0001241126,0.00015620582,0.000052479507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026134131,0.0017731182,0.0010736382,0.0012497326,0.0005117235,0.0010993639,0.0009701484,0.0009995159,0.004839054],"category_scores_gemma":[0.0031978153,0.00090907677,0.002051539,0.0016536084,0.0009107301,0.0010425578,0.0013719617,0.0021864646,0.0008827493],"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.000028474638,0.000035823025,0.00027632658,0.00014620986,0.000053089567,0.00005045804,0.000059170372,0.852577,0.002795701,0.08662682,0.0016000725,0.055750888],"study_design_scores_gemma":[0.000012423062,0.00003055937,0.000058194888,0.00003191214,0.000009445588,0.000043885764,0.000011247967,0.9391889,0.0008380223,0.05541819,0.004348156,0.000009034265],"about_ca_topic_score_codex":0.0020105804,"about_ca_topic_score_gemma":0.002155139,"teacher_disagreement_score":0.004839054,"about_ca_system_score_codex":0.00083304854,"about_ca_system_score_gemma":0.001831464,"threshold_uncertainty_score":0.016188264},"labels":[],"label_agreement":null},{"id":"W3120798890","doi":"","title":"Estimating Technical Efficiency and Bootstrapping Malmquist Indices: Analysis of Malaysian Preschool Sector.","year":2016,"lang":"en","type":"article","venue":"Early childhood education","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bootstrapping (finance); Malmquist index; Econometrics; Economics; Statistics; Mathematics; Macroeconomics; Productivity; Total factor productivity","score_opus":0.005866134191896754,"score_gpt":0.22349340283050073,"score_spread":0.217627268638604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120798890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885875,0.00035198225,0.008350861,0.00010131492,0.0000036530023,0.000019961339,0.00023628131,0.000018124896,0.0023301998],"genre_scores_gemma":[0.9953011,0.000102891456,0.0035771104,0.0000061909795,0.0000015822425,0.000010925838,0.0002931334,0.0000069895887,0.0007001738],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895513,0.0005407253,0.00004128359,0.00010044488,0.00018125432,0.00018108811],"domain_scores_gemma":[0.99029934,0.006983604,0.0010097439,0.0006014043,0.00089064176,0.00021539096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038584487,0.00032838352,0.000351835,0.0013998982,0.00032697804,0.0008103094,0.0007420697,0.00041458497,0.0016657541],"category_scores_gemma":[0.015057733,0.00019019865,0.00033633565,0.0014813845,0.00048756797,0.0009569055,0.0006781123,0.0005810889,0.000313827],"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.00042883307,0.00022043037,0.7384494,0.0002097638,0.00015735625,0.00061085547,0.0015389408,0.09415933,0.0017853319,0.023916582,0.0020075229,0.13651566],"study_design_scores_gemma":[0.000014910107,0.00021272356,0.76019627,0.00013100033,0.00006249947,0.0001969288,0.004033044,0.21608819,0.004863423,0.010995671,0.0031657065,0.000039608523],"about_ca_topic_score_codex":0.022045178,"about_ca_topic_score_gemma":0.019461975,"teacher_disagreement_score":0.022045178,"about_ca_system_score_codex":0.0013603644,"about_ca_system_score_gemma":0.001504417,"threshold_uncertainty_score":0.043833673},"labels":[],"label_agreement":null},{"id":"W3134091450","doi":"10.1007/s12652-021-02975-7","title":"Interactive multilevel programming approaches in neutrosophic environments","year":2021,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Fuzzy logic; Computational intelligence; Measure (data warehouse); Set (abstract data type); Mathematical optimization; Artificial intelligence; Data mining; Mathematics","score_opus":0.06276874478871781,"score_gpt":0.265828406481373,"score_spread":0.2030596616926552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134091450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017160341,0.00014886982,0.97194606,0.00028920526,0.00003984417,0.000031798947,0.000046893223,0.000075910786,0.010260979],"genre_scores_gemma":[0.39115104,0.0003294921,0.6000836,0.00011935143,0.00009441556,0.00020628607,0.00011767757,0.00012662691,0.007771559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.00036687043,0.000029042258,0.00008274578,0.00017583642,0.00007590363],"domain_scores_gemma":[0.99865544,0.0009068157,0.00006458973,0.00013911151,0.0001303087,0.0001036239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012033468,0.00044274025,0.0006246319,0.00074641017,0.0009184058,0.0021228772,0.0016767795,0.0007802344,0.010001051],"category_scores_gemma":[0.0030615474,0.00044546783,0.000973599,0.0009086897,0.0008916478,0.0024195632,0.002926515,0.0020125369,0.00062804105],"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.000069302194,0.0001160217,0.0005167373,0.00013379996,0.000058723752,0.000110061046,0.00045982577,0.11634969,0.0021605487,0.8332444,0.0015505082,0.04523043],"study_design_scores_gemma":[0.000016588167,0.000042488227,0.00019869147,0.00002841054,0.000023884475,0.000029277297,0.00017416484,0.61986434,0.00085601566,0.37459308,0.0041594706,0.000013605161],"about_ca_topic_score_codex":0.0014006463,"about_ca_topic_score_gemma":0.00279365,"teacher_disagreement_score":0.010001051,"about_ca_system_score_codex":0.000686578,"about_ca_system_score_gemma":0.0005653967,"threshold_uncertainty_score":0.033456862},"labels":[],"label_agreement":null},{"id":"W3140227716","doi":"10.1007/978-3-642-11474-8_11","title":"Chance Constrained Programming","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":175,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decision maker; Computer science; Constraint (computer-aided design); Constraint programming; Mathematical optimization; Stochastic programming; Mathematical economics; Operations research; Mathematics","score_opus":0.011685107020817279,"score_gpt":0.20469234023917043,"score_spread":0.19300723321835317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140227716","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001129901,0.014611012,0.18769534,0.0023311838,0.0013940339,0.000042631695,0.00029335296,0.0003251314,0.79217744],"genre_scores_gemma":[0.0483823,0.022540374,0.06276891,0.0013339511,0.0019061895,0.00019426143,0.0006878081,0.0006945255,0.86149174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996644,0.00007291331,0.000009909142,0.000055157445,0.00017284298,0.000024800665],"domain_scores_gemma":[0.99978644,0.00010589516,0.000012684977,0.00002953886,0.000047067297,0.00001838356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038756995,0.001322232,0.00089341716,0.00079855527,0.0005774477,0.0021023434,0.00090723066,0.00093601836,0.035781782],"category_scores_gemma":[0.0010780293,0.00046142287,0.0005230742,0.001531835,0.0010975045,0.0019010729,0.0009111167,0.0025847931,0.0105899805],"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.000012489766,0.00003364059,0.000059648457,0.0001403394,0.000015782509,0.00004212431,0.000045105382,0.013668154,0.00038157808,0.67257875,0.16781326,0.14520909],"study_design_scores_gemma":[0.000005242002,0.000012887462,0.00015398691,0.00017237019,0.000009303795,0.00009128287,0.000024328394,0.01760101,0.0003953691,0.5725165,0.4089995,0.000018235345],"about_ca_topic_score_codex":0.0017417478,"about_ca_topic_score_gemma":0.003173351,"teacher_disagreement_score":0.035781782,"about_ca_system_score_codex":0.001396387,"about_ca_system_score_gemma":0.0011494785,"threshold_uncertainty_score":0.11970192},"labels":[],"label_agreement":null},{"id":"W3157126773","doi":"10.1111/itor.12989","title":"An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process","year":2021,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Mathematical Programming","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":"Kwantlen Polytechnic University; University of British Columbia","funders":"","keywords":"Mathematical optimization; Markov decision process; Computer science; Pareto principle; Constraint (computer-aided design); Scheduling (production processes); Markov process; Selection (genetic algorithm); Class (philosophy); Mathematics; Artificial intelligence","score_opus":0.05930180064658388,"score_gpt":0.45211477209029133,"score_spread":0.39281297144370747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157126773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002695758,0.000075874035,0.9960794,0.000052000607,0.000021368744,0.00003860335,0.000026654006,0.00005640356,0.0009540567],"genre_scores_gemma":[0.2981395,0.00033729282,0.69701433,0.00012717835,0.00007081661,0.00062372343,0.00019510773,0.00011342696,0.0033785768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920505,0.00032314824,0.0000398919,0.000102121994,0.00025813628,0.00007161919],"domain_scores_gemma":[0.99774075,0.0015879516,0.00014530697,0.000061857485,0.00037661986,0.00008752253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021625864,0.00094699586,0.0011775072,0.0008113852,0.0005217529,0.00094418804,0.0014875847,0.0010896199,0.0039628875],"category_scores_gemma":[0.003292707,0.00059272576,0.0011321473,0.0010549644,0.0007127139,0.00086450396,0.0010954614,0.0015448263,0.00036055138],"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.000038283935,0.000020728681,0.00013988292,0.00006146909,0.000027163846,0.000058905403,0.00001966719,0.9690878,0.00082378334,0.009620579,0.0003555796,0.01974626],"study_design_scores_gemma":[0.000003979526,0.0000063963844,0.000012396345,0.0000038690805,0.0000017139116,0.0000036867125,0.0000011985508,0.998806,0.00011109061,0.00083291146,0.0002146351,0.0000020418547],"about_ca_topic_score_codex":0.011969289,"about_ca_topic_score_gemma":0.0063417065,"teacher_disagreement_score":0.011969289,"about_ca_system_score_codex":0.0010670339,"about_ca_system_score_gemma":0.002324373,"threshold_uncertainty_score":0.02379924},"labels":[],"label_agreement":null},{"id":"W3159678997","doi":"10.18280/mmep.080203","title":"A Multi-Objective Risk Return Trade off Models for Banks: Fuzzy Programming Approach","year":2021,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Kalyani; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Liquidity risk; Market liquidity; Business; Interest rate risk; Fuzzy logic; Liquidity crisis; Interest rate; Economics; Actuarial science; Computer science; Finance","score_opus":0.029274081314496325,"score_gpt":0.21818791871341683,"score_spread":0.1889138373989205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159678997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01911388,0.0013459579,0.9675509,0.0008828906,0.000075049415,0.000074412055,0.00014184932,0.00008171717,0.010733262],"genre_scores_gemma":[0.8425616,0.0027265898,0.13608657,0.00031125537,0.00015137467,0.0005972744,0.00024076001,0.00006918194,0.017255526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995229,0.00021275964,0.000019044743,0.000074342635,0.00009813491,0.000072784394],"domain_scores_gemma":[0.9992767,0.0004549501,0.00008028899,0.000017368764,0.00012974512,0.0000409459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964383,0.0012159437,0.0013567887,0.0008063156,0.00070814625,0.002240868,0.0015422594,0.0026907057,0.0038063235],"category_scores_gemma":[0.0016724238,0.0007139508,0.0014888969,0.0009973381,0.0007684386,0.001285598,0.0010674406,0.0022376901,0.0003270479],"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.000015908927,0.000024480907,0.00017420769,0.00004463731,0.000020152813,0.00006147289,0.00003514797,0.9832913,0.0002200407,0.012614594,0.00035801218,0.0031401],"study_design_scores_gemma":[0.00000332071,0.000012735447,0.00003617385,0.000008785108,0.0000057691113,0.000007405857,0.0000091581305,0.9956956,0.0000406117,0.003918793,0.0002577689,0.0000039389342],"about_ca_topic_score_codex":0.012643608,"about_ca_topic_score_gemma":0.006866008,"teacher_disagreement_score":0.012643608,"about_ca_system_score_codex":0.001616706,"about_ca_system_score_gemma":0.0017652762,"threshold_uncertainty_score":0.025140047},"labels":[],"label_agreement":null},{"id":"W3181866333","doi":"10.1016/j.agsy.2021.103208","title":"Operations research for environmental assessment of crop-livestock production systems","year":2021,"lang":"en","type":"article","venue":"Agricultural Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Sustainability; Life-cycle assessment; Computer science; Livestock; Agriculture; Production (economics); Strengths and weaknesses; Benchmarking; Decision support system; Decision tree; Data envelopment analysis; Management science; Environmental economics; Environmental resource management; Operations research; Business; Economics; Engineering; Mathematics; Artificial intelligence","score_opus":0.045861096815315104,"score_gpt":0.3107810420867116,"score_spread":0.2649199452713965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181866333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12825708,0.010027902,0.8048558,0.0038569015,0.0003907285,0.0004864594,0.0011396577,0.00024933132,0.05073615],"genre_scores_gemma":[0.8988658,0.007698611,0.08159985,0.00018274343,0.0003054746,0.00046195986,0.00076158345,0.00014416888,0.009979737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527454,0.003448219,0.00013155902,0.00021193048,0.0006491793,0.0002844299],"domain_scores_gemma":[0.9926543,0.006150433,0.00027558033,0.00017939707,0.0005700461,0.0001702714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006096675,0.0014577834,0.0018692636,0.0023044345,0.0007954301,0.0040624426,0.0010140139,0.0010232159,0.0063479682],"category_scores_gemma":[0.011359503,0.00053557195,0.0014206127,0.003254749,0.001001209,0.0032961315,0.0011519311,0.0015412376,0.00039911742],"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.00019345517,0.00021047519,0.0017724066,0.00023228108,0.00015585277,0.000062083935,0.000040544684,0.88672346,0.0007258005,0.059723865,0.001992377,0.048167404],"study_design_scores_gemma":[0.000016870763,0.00012814316,0.0008167611,0.000043287168,0.00004527013,0.00001941324,0.00010693965,0.94956326,0.00059792516,0.046638932,0.002005508,0.000017753535],"about_ca_topic_score_codex":0.014929831,"about_ca_topic_score_gemma":0.0109285675,"teacher_disagreement_score":0.014929831,"about_ca_system_score_codex":0.0030189583,"about_ca_system_score_gemma":0.0057350327,"threshold_uncertainty_score":0.032242715},"labels":[],"label_agreement":null},{"id":"W3192147792","doi":"10.5267/j.dsl.2021.7.002","title":"A mixed-integer linear programming model for the selective full-truckload multi-depot vehicle routing problem with time windows","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Truck; Vehicle routing problem; Integer programming; Mathematical optimization; Computer science; Context (archaeology); Linear programming; Profit (economics); Set (abstract data type); Operations research; Routing (electronic design automation); Transport engineering; Mathematics; Engineering; Automotive engineering; Economics","score_opus":0.024612636865152672,"score_gpt":0.2633155510898738,"score_spread":0.23870291422472115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192147792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030658992,0.001177802,0.9502656,0.00080697675,0.00016253348,0.00024348634,0.00090484094,0.00028435775,0.015495358],"genre_scores_gemma":[0.6331876,0.0020774142,0.33720037,0.0003608184,0.00021674462,0.0012151339,0.0012517036,0.00017848099,0.024311708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880636,0.0005415549,0.00004890229,0.00023353082,0.00017802895,0.00019162461],"domain_scores_gemma":[0.99912053,0.0005694301,0.00012421192,0.000027581058,0.00009632714,0.00006188433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001580481,0.0018604402,0.0014388629,0.0008547377,0.0005558947,0.0028272495,0.0019087918,0.0021049099,0.0053470335],"category_scores_gemma":[0.0017879128,0.00092414644,0.0014999871,0.0015425892,0.00067088957,0.0016303996,0.0009992588,0.0023529092,0.00081164896],"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.00004916244,0.0000628805,0.0001885826,0.00009396611,0.000028959157,0.00011681442,0.00003062406,0.97862166,0.00043397848,0.0144393565,0.00085894694,0.0050751185],"study_design_scores_gemma":[0.000010461337,0.000030851417,0.00004526991,0.000008081536,0.000008499478,0.000015330372,0.00001631376,0.99618196,0.00009646185,0.0027208498,0.0008611263,0.0000047109165],"about_ca_topic_score_codex":0.008321388,"about_ca_topic_score_gemma":0.008847781,"teacher_disagreement_score":0.008321388,"about_ca_system_score_codex":0.0018193844,"about_ca_system_score_gemma":0.0024887458,"threshold_uncertainty_score":0.017887652},"labels":[],"label_agreement":null},{"id":"W3192861312","doi":"10.1155/2021/9994853","title":"Optimization Model for Integrated Municipal Solid Waste System Using Stochastic Chance-Constraint Programming under Uncertainty: A Case Study in Qazvin, Iran","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Municipal solid waste; Mathematical optimization; Stochastic programming; Pareto principle; Reliability (semiconductor); Operations research; Environmental pollution; Computer science; Waste disposal; Engineering; Waste management; Environmental science; Mathematics","score_opus":0.038339066551994726,"score_gpt":0.3009948872528982,"score_spread":0.2626558207009035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192861312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4944971,0.0014797734,0.4701859,0.0016023712,0.00014255107,0.00038420674,0.0012602069,0.00024950528,0.030198399],"genre_scores_gemma":[0.978725,0.00043964313,0.015691409,0.000057743884,0.000022929864,0.00022415949,0.00023593668,0.000023218636,0.0045798565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993338,0.00026054098,0.000025811301,0.0000930391,0.00011432051,0.00017243042],"domain_scores_gemma":[0.9988188,0.0007593247,0.00016835569,0.000020218054,0.00017626001,0.000057091664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011159033,0.0012005091,0.0012890097,0.0007810218,0.0010053181,0.0019952252,0.0011983088,0.0022457563,0.0029370459],"category_scores_gemma":[0.0016273056,0.0006507111,0.0014030228,0.0012611853,0.00080127275,0.00072272,0.0009408309,0.0014674168,0.00013439375],"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.000015281297,0.00001672929,0.00030379,0.000025118838,0.000011259098,0.00012244098,0.000012273121,0.9971077,0.00012904784,0.0013918903,0.00012244414,0.00074205594],"study_design_scores_gemma":[0.0000073148904,0.000021449136,0.00016377188,0.000003440178,0.0000082512515,0.000011852366,0.000027885288,0.99908423,0.000069942136,0.00047510987,0.00012288966,0.000003805258],"about_ca_topic_score_codex":0.04585749,"about_ca_topic_score_gemma":0.029497346,"teacher_disagreement_score":0.04585749,"about_ca_system_score_codex":0.0019921304,"about_ca_system_score_gemma":0.0026418904,"threshold_uncertainty_score":0.09118116},"labels":[],"label_agreement":null},{"id":"W3193442282","doi":"10.1002/cjce.24298","title":"A two‐layer chance‐constrained optimization model for a thickening‐dewatering process with uncertain variables","year":2021,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Monte Carlo method; Optimization problem; Process optimization; Computer science; Process (computing); Control theory (sociology); Engineering; Mathematics; Statistics","score_opus":0.01595565825402903,"score_gpt":0.2189171203586657,"score_spread":0.20296146210463667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193442282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079700366,0.0008215441,0.90797484,0.00074009266,0.00011425475,0.00015563575,0.00042518452,0.00020900581,0.009859004],"genre_scores_gemma":[0.9511753,0.0005382174,0.037782837,0.00014383794,0.000047777525,0.00047047823,0.00033682358,0.00005251205,0.009452173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988657,0.0003844799,0.00005509782,0.000269863,0.00021865114,0.00020614867],"domain_scores_gemma":[0.99819994,0.0011505221,0.00024315465,0.000032859673,0.00028532554,0.000088229295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020718242,0.0018368084,0.0021568008,0.00088051945,0.00089821784,0.002667156,0.0017240626,0.0027299307,0.0038398323],"category_scores_gemma":[0.0028063022,0.001518524,0.0020423546,0.00092380575,0.001298238,0.0014145303,0.0013995869,0.0020940397,0.00029438347],"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.000014750634,0.0000067476412,0.00011210872,0.000014184843,0.000010888122,0.00002196761,0.0000060343505,0.9980938,0.00011815366,0.0010207149,0.00005005537,0.00053062267],"study_design_scores_gemma":[0.0000057536267,0.0000071848563,0.000054711683,0.0000020258376,0.000004880256,0.0000018704854,0.0000029044675,0.999498,0.000046779176,0.0003279015,0.00004472986,0.000003270299],"about_ca_topic_score_codex":0.03554939,"about_ca_topic_score_gemma":0.010912889,"teacher_disagreement_score":0.03554939,"about_ca_system_score_codex":0.0018673411,"about_ca_system_score_gemma":0.0027409105,"threshold_uncertainty_score":0.07068497},"labels":[],"label_agreement":null},{"id":"W3195931591","doi":"10.2139/ssrn.3813822","title":"Target-oriented Robust Location-transportation Problem with Service-level Measure","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Measure (data warehouse); Computer science; Transport engineering; Business; Engineering; Data mining","score_opus":0.01046493887560354,"score_gpt":0.1933830260038875,"score_spread":0.18291808712828395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195931591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022279732,0.00024571613,0.9701312,0.0008161244,0.00006493565,0.00009752905,0.00050750776,0.0002316325,0.0056256354],"genre_scores_gemma":[0.86445946,0.0006521685,0.11364698,0.00031793385,0.00017644103,0.00046548372,0.0011259315,0.00035137375,0.018804342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973605,0.0010660681,0.000101660866,0.000662195,0.00045665074,0.00035288782],"domain_scores_gemma":[0.9969752,0.0013861369,0.0005813803,0.00017672942,0.00057834823,0.00030220498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037745168,0.002569461,0.0034804957,0.0017347594,0.0006234789,0.0038670553,0.0035630711,0.0041234144,0.004774846],"category_scores_gemma":[0.007974139,0.0010971136,0.0019063825,0.0026759238,0.0018367575,0.0031974532,0.0034429647,0.001946835,0.0010533123],"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.0002479499,0.000081261154,0.0004837063,0.00023797585,0.0001469901,0.00021502853,0.0000597369,0.9028688,0.0016961463,0.083370015,0.0019187944,0.008673624],"study_design_scores_gemma":[0.000029525892,0.00009900273,0.00017619664,0.000012925739,0.000034214427,0.00005051027,0.000026758576,0.9756402,0.00055552664,0.022706144,0.000648922,0.000020068446],"about_ca_topic_score_codex":0.0065912576,"about_ca_topic_score_gemma":0.0025391974,"teacher_disagreement_score":0.0065912576,"about_ca_system_score_codex":0.0034743424,"about_ca_system_score_gemma":0.0026448811,"threshold_uncertainty_score":0.025208235},"labels":[],"label_agreement":null},{"id":"W3199848312","doi":"","title":"On the approximation of separable non-convex optimization programs to an arbitrary numerical precision","year":2021,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fondation Mathématique Jacques Hadamard","keywords":"Solver; Mathematical optimization; Mathematics; Convergence (economics); Computer science; Applied mathematics","score_opus":0.014169942672300257,"score_gpt":0.22581024265843938,"score_spread":0.21164029998613912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199848312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01673126,0.00034891546,0.9781206,0.00022595127,0.000045564106,0.00005126869,0.000041720876,0.0004001068,0.0040345816],"genre_scores_gemma":[0.3293469,0.00070560124,0.6648787,0.00019715734,0.00007485162,0.00029591078,0.00019332369,0.00026590083,0.004041635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990606,0.00030457112,0.000045319743,0.000105478335,0.0003875873,0.00009642108],"domain_scores_gemma":[0.99622476,0.0027675268,0.00025099458,0.00037192216,0.0003117645,0.000073111805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021886847,0.0013601163,0.001108114,0.0005884842,0.000491641,0.0013630607,0.0011600096,0.001017487,0.0019936706],"category_scores_gemma":[0.010652466,0.0005099273,0.0009825455,0.0008446404,0.0016370128,0.0011538821,0.001698555,0.0028136254,0.000625243],"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.00008060253,0.000033130007,0.0003656191,0.00011377114,0.000021432876,0.000057191523,0.000071861876,0.9556867,0.001827991,0.01808989,0.000524876,0.023126993],"study_design_scores_gemma":[0.0000048364955,0.000012484581,0.000029691217,0.000009218951,0.0000019922575,0.0000063893385,0.0000058191845,0.9959984,0.000359179,0.0031858007,0.00038441343,0.0000018296215],"about_ca_topic_score_codex":0.0065033543,"about_ca_topic_score_gemma":0.0046314653,"teacher_disagreement_score":0.0065033543,"about_ca_system_score_codex":0.0010670983,"about_ca_system_score_gemma":0.0016675752,"threshold_uncertainty_score":0.012930989},"labels":[],"label_agreement":null},{"id":"W3200566607","doi":"10.1016/j.trb.2021.08.010","title":"Target-oriented robust location–transportation problem with service-level measure","year":2021,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Profit (economics); Measure (data warehouse); Operations research; Quadratic equation; Affine transformation; Mathematics; Data mining; Economics","score_opus":0.3869647240031798,"score_gpt":0.39254138874970707,"score_spread":0.005576664746527238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200566607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016657664,0.00016018373,0.9782111,0.00054923416,0.000042531658,0.00007168821,0.0002749348,0.00015267325,0.0038799413],"genre_scores_gemma":[0.8193383,0.00053302007,0.1624418,0.0003284311,0.00017943738,0.0004247868,0.0010421049,0.0003856814,0.015326304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967937,0.0013499896,0.00013117505,0.00086598337,0.0005116038,0.00034761513],"domain_scores_gemma":[0.99678445,0.0015374869,0.0006078852,0.00021464116,0.0005882051,0.0002673059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004516187,0.0021403774,0.0029621825,0.0016459227,0.0005701385,0.0034378604,0.0034710784,0.0037046983,0.004020847],"category_scores_gemma":[0.008891079,0.0011845056,0.0022405311,0.0021931336,0.0019528023,0.0033080336,0.0034244088,0.0018637459,0.00077217864],"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.00019695099,0.000086422275,0.00046629217,0.00021264511,0.00017609274,0.0001896362,0.00006334425,0.8844491,0.0020763124,0.10169087,0.001536212,0.008856066],"study_design_scores_gemma":[0.000029052173,0.00009427287,0.00019165038,0.000011373208,0.0000405473,0.000047609698,0.000027394444,0.96980894,0.0007544891,0.028228827,0.00074500206,0.000020748617],"about_ca_topic_score_codex":0.006491541,"about_ca_topic_score_gemma":0.0021911978,"teacher_disagreement_score":0.006491541,"about_ca_system_score_codex":0.0033231573,"about_ca_system_score_gemma":0.002489384,"threshold_uncertainty_score":0.02411127},"labels":[],"label_agreement":null},{"id":"W3210181913","doi":"10.3390/jrfm14110519","title":"A Neutrosophic Fuzzy Optimisation Model for Optimal Sustainable Closed-Loop Supply Chain Network during COVID-19","year":2021,"lang":"en","type":"article","venue":"Journal of risk and financial management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fuzzy logic; Supply chain; Computer science; Supply chain network; Operations research; Transmission (telecommunications); Mathematical optimization; Supply chain management; Business; Engineering; Artificial intelligence; Mathematics","score_opus":0.009570188888174623,"score_gpt":0.22475847817449235,"score_spread":0.21518828928631772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210181913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04704561,0.00056638004,0.93733215,0.00052936684,0.000080900376,0.000107493724,0.00022292066,0.00011716381,0.013998049],"genre_scores_gemma":[0.94377327,0.00056668976,0.047580417,0.000091134556,0.000030082982,0.0003314823,0.00018217378,0.000028087257,0.007416614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951625,0.00016142859,0.000020249543,0.00012076453,0.000091673435,0.00008967459],"domain_scores_gemma":[0.99954,0.00024548947,0.00007479528,0.000011872109,0.00009548679,0.000032433658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009147012,0.0010654138,0.0011673839,0.00066815,0.0007544093,0.0019836181,0.0010709704,0.002107983,0.0030339153],"category_scores_gemma":[0.0013791595,0.00058686384,0.0009645292,0.00079214835,0.00090798386,0.0011684435,0.000959586,0.0014741396,0.00021940711],"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.000016931097,0.000011066779,0.00012923015,0.00003328989,0.000012673371,0.000051480838,0.000027273063,0.99229854,0.00032604852,0.0056253923,0.00014791534,0.0013201473],"study_design_scores_gemma":[0.0000061968785,0.000018812154,0.000053152646,0.000006171842,0.0000056779536,0.000006795355,0.000015707308,0.9969318,0.00008321695,0.002629002,0.00023839863,0.000004979807],"about_ca_topic_score_codex":0.016263448,"about_ca_topic_score_gemma":0.0071530766,"teacher_disagreement_score":0.016263448,"about_ca_system_score_codex":0.001597672,"about_ca_system_score_gemma":0.0023079212,"threshold_uncertainty_score":0.032337606},"labels":[],"label_agreement":null},{"id":"W3213824768","doi":"10.5267/j.uscm.2021.9.004","title":"Contribution of robust optimization on handling agricultural processed products supply chain problem during Covid-19 pandemic","year":2021,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Padjadjaran","keywords":"Robust optimization; Supply chain; Agriculture; Linear programming; Social distance; Computer science; Pandemic; Mathematical optimization; Environmental economics; Coronavirus disease 2019 (COVID-19); Operations research; Business; Economics; Mathematics; Marketing; Geography","score_opus":0.016977448448530597,"score_gpt":0.23293531743460197,"score_spread":0.21595786898607136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213824768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030271642,0.0018885089,0.9555588,0.0017019118,0.00017061239,0.000077461606,0.0001647801,0.00009461947,0.010071596],"genre_scores_gemma":[0.895846,0.002650082,0.09680755,0.00037460463,0.00039795708,0.00014690266,0.00028685032,0.00012440376,0.0033657106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877423,0.0006309034,0.000048048187,0.00023373499,0.00019418713,0.00011877442],"domain_scores_gemma":[0.9976235,0.0016124804,0.00031680617,0.00008955234,0.00026737453,0.00009026367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022584845,0.0013773725,0.001482004,0.00068054756,0.00048968813,0.0020211,0.00093135104,0.0015444381,0.0023941717],"category_scores_gemma":[0.005976748,0.00051325565,0.0014544583,0.0006626709,0.00082557136,0.0017291799,0.0014290995,0.0017244205,0.00017251958],"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.000038669587,0.000024260598,0.00032994206,0.000113732254,0.000048051472,0.000093450515,0.000028696102,0.97753453,0.0004500092,0.0138298,0.0006181569,0.006890688],"study_design_scores_gemma":[0.000004040287,0.000030626736,0.00008675659,0.000011811443,0.000009979601,0.000013690947,0.000020857076,0.98972636,0.00012893563,0.009461206,0.0004994705,0.000006296583],"about_ca_topic_score_codex":0.006005599,"about_ca_topic_score_gemma":0.0017249705,"teacher_disagreement_score":0.006005599,"about_ca_system_score_codex":0.00094829773,"about_ca_system_score_gemma":0.0017021456,"threshold_uncertainty_score":0.011944115},"labels":[],"label_agreement":null},{"id":"W381406155","doi":"10.1023/a:1018935031580","title":"Scheduling the flying squad nurses of a hospital using a multi-objective programming model","year":2000,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Programming language","score_opus":0.20011221527984288,"score_gpt":0.44096406525828014,"score_spread":0.24085184997843725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W381406155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5178296,0.00087813794,0.46465188,0.0022429687,0.00038505808,0.00049615884,0.0005362111,0.00018547467,0.012794458],"genre_scores_gemma":[0.9464295,0.0005215193,0.04538381,0.0001430294,0.00013837445,0.00027652402,0.0002605369,0.00005478181,0.006791953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00028369465,0.000023317474,0.00010897527,0.00007145403,0.00019883503],"domain_scores_gemma":[0.99882215,0.0006440969,0.00013959153,0.000024073217,0.000087848144,0.0002822041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369613,0.0014629561,0.0020304632,0.0008818472,0.0013273414,0.0022867532,0.002150009,0.0030539264,0.0044759633],"category_scores_gemma":[0.002104264,0.001342397,0.0014944638,0.0011349028,0.0009151506,0.0016051511,0.0013354727,0.001896624,0.0003025618],"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.00009375038,0.00005500431,0.0003302951,0.000030690986,0.000028546478,0.000089134315,0.00002824804,0.99594265,0.0002356529,0.0011936205,0.0002541429,0.0017182162],"study_design_scores_gemma":[0.000019113522,0.000054064803,0.00012909537,0.0000033033284,0.000011399499,0.000008386399,0.000039851315,0.99904376,0.00005133541,0.0005383952,0.00009513994,0.0000061415394],"about_ca_topic_score_codex":0.035654876,"about_ca_topic_score_gemma":0.023525862,"teacher_disagreement_score":0.035654876,"about_ca_system_score_codex":0.0023683985,"about_ca_system_score_gemma":0.002915355,"threshold_uncertainty_score":0.07089466},"labels":[],"label_agreement":null},{"id":"W4200384955","doi":"10.18280/mmep.080603","title":"Stochastic Multi-Objective Programming Problem: A Two-Phase Weighted Coefficient Approach","year":2021,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Stochastic programming; Linear programming; Mathematics; Random variable; Computer science; Statistics","score_opus":0.024102404491334495,"score_gpt":0.2394865567359958,"score_spread":0.21538415224466131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200384955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00251957,0.00014959155,0.9952962,0.00012414959,0.000029776667,0.000055703083,0.000016029304,0.000019235733,0.0017897373],"genre_scores_gemma":[0.3776413,0.0013825444,0.6103503,0.00024747016,0.00026719374,0.00086632796,0.00023854643,0.00015782392,0.008848415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822,0.00087677006,0.00005344431,0.00017277194,0.0005447401,0.00013217556],"domain_scores_gemma":[0.99865353,0.00087011437,0.00009180358,0.000046565157,0.00027239858,0.00006565149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026140274,0.0012199954,0.0014155816,0.0010181715,0.0003822666,0.0012468855,0.0016720544,0.0015015418,0.0033902053],"category_scores_gemma":[0.004132494,0.0006696743,0.0010286483,0.001337994,0.00077071873,0.0017841128,0.0019532924,0.0020293032,0.00051761256],"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.000039377188,0.000053744167,0.00018845667,0.00019516383,0.000042525233,0.00008572827,0.000051152037,0.91127884,0.0016796663,0.057132028,0.0010945537,0.02815877],"study_design_scores_gemma":[0.000010725793,0.000031729116,0.000039342245,0.000013090695,0.0000087036915,0.000015152822,0.000007672423,0.9897406,0.00029483702,0.00885252,0.0009792825,0.0000063795],"about_ca_topic_score_codex":0.0020036031,"about_ca_topic_score_gemma":0.0017989401,"teacher_disagreement_score":0.0033902053,"about_ca_system_score_codex":0.00082975917,"about_ca_system_score_gemma":0.0014352158,"threshold_uncertainty_score":0.013824403},"labels":[],"label_agreement":null},{"id":"W4206262260","doi":"10.3390/math10020283","title":"Transformation and Linearization Techniques in Optimization: A State-of-the-Art Survey","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":229,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal; Dalhousie University","funders":"","keywords":"Linearization; Transformation (genetics); Mathematical optimization; Optimization problem; Multiplication (music); Mathematics; Computer science; Piecewise linear function; Nonlinear system","score_opus":0.012969401093111307,"score_gpt":0.21966500171240808,"score_spread":0.20669560061929676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206262260","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025557808,0.48835605,0.4886547,0.0014548969,0.0005878727,0.00006339916,0.00014874164,0.0004861434,0.01769248],"genre_scores_gemma":[0.06076215,0.7797697,0.1508252,0.0006414155,0.0017099103,0.0001716227,0.0005131409,0.00043407187,0.005172797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988142,0.00030737012,0.00013910723,0.00025770304,0.00041429707,0.00006724817],"domain_scores_gemma":[0.9976031,0.0018144073,0.00012450061,0.00016064443,0.00027045808,0.000026909333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180803,0.0020124193,0.0019409843,0.0022599022,0.00053841394,0.0023795438,0.0015363861,0.0012667382,0.005638844],"category_scores_gemma":[0.004035298,0.00096582953,0.0021399346,0.0064854696,0.0012906878,0.0036575033,0.0012924197,0.0024509728,0.0028375539],"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.00006682075,0.0001231037,0.0007732895,0.011025609,0.00015901825,0.00017893521,0.00031550933,0.04911633,0.002251238,0.10962136,0.015355467,0.81101334],"study_design_scores_gemma":[0.000040745323,0.00039513365,0.002109375,0.004836701,0.00036056413,0.0015389925,0.0005639489,0.23312666,0.0070540626,0.1797526,0.56994104,0.0002801353],"about_ca_topic_score_codex":0.002310652,"about_ca_topic_score_gemma":0.0013344556,"teacher_disagreement_score":0.005638844,"about_ca_system_score_codex":0.0008395647,"about_ca_system_score_gemma":0.0012514443,"threshold_uncertainty_score":0.018863797},"labels":[],"label_agreement":null},{"id":"W4206573161","doi":"10.3233/jifs-212909","title":"Mehar approach to solve fuzzy linear fractional minimal cost flow problems","year":2022,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Optimization and Mathematical Programming","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 Manitoba","funders":"","keywords":"Fuzzy logic; Mathematics; Fuzzy number; Mathematical optimization; Minimum-cost flow problem; Linear programming; Flow (mathematics); Fractional programming; Computer science; Fuzzy set; Flow network; Nonlinear programming; Nonlinear system; Artificial intelligence","score_opus":0.033001413822481375,"score_gpt":0.25258896620584487,"score_spread":0.2195875523833635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206573161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003590007,0.0006146357,0.98796135,0.00023788358,0.000058409125,0.000038694576,0.000025685376,0.000046347748,0.0074270065],"genre_scores_gemma":[0.339329,0.0019770986,0.6414922,0.00035810174,0.00021315656,0.00035066373,0.00013861105,0.00012580627,0.016015375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994947,0.0001750768,0.00002575688,0.00008470651,0.0001669338,0.000052910604],"domain_scores_gemma":[0.9996283,0.00022518396,0.000028823022,0.000018217328,0.000088039866,0.000011338385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011229818,0.000993582,0.0013289878,0.0011758797,0.0008204557,0.0010831893,0.0012721338,0.0014372201,0.0052530775],"category_scores_gemma":[0.0014560367,0.00041675146,0.001306534,0.0010007642,0.00072290975,0.0013443289,0.0011989155,0.0023376355,0.00047493257],"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.0000679018,0.0000840342,0.00029157265,0.00064509467,0.00009042368,0.00024912896,0.00023863371,0.6368852,0.005780169,0.26047653,0.0033779824,0.09181332],"study_design_scores_gemma":[0.000009380896,0.000045501412,0.000058414884,0.000023314838,0.000017100254,0.00005756176,0.00003452785,0.95663804,0.0010291218,0.038341377,0.0037330415,0.00001262482],"about_ca_topic_score_codex":0.0022040356,"about_ca_topic_score_gemma":0.0022981644,"teacher_disagreement_score":0.0052530775,"about_ca_system_score_codex":0.0007768525,"about_ca_system_score_gemma":0.0009015645,"threshold_uncertainty_score":0.017573297},"labels":[],"label_agreement":null},{"id":"W4206915070","doi":"10.5539/mas.v16n1p30","title":"New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems","year":2022,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Rajarata University of Sri Lanka","keywords":"Maximum flow problem; Minimum-cost flow problem; Flow network; Out-of-kilter algorithm; Multi-commodity flow problem; Computer science; Mathematical optimization; Flow (mathematics); Heuristic; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.01929774037166811,"score_gpt":0.21547171086062333,"score_spread":0.1961739704889552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206915070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008459527,0.00043192078,0.9918513,0.0002728401,0.00008395523,0.00003021123,0.00002317626,0.000043722448,0.006416967],"genre_scores_gemma":[0.039061565,0.0015950315,0.9525392,0.00022035789,0.00023844508,0.00026403234,0.00008500237,0.0000947414,0.0059015523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00029952868,0.000046296023,0.0001967248,0.00031865755,0.0000557093],"domain_scores_gemma":[0.9995185,0.0002713839,0.00004619811,0.000040884785,0.000101752754,0.000021251099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483312,0.0013352565,0.0008244963,0.0020934,0.00075107586,0.0014638556,0.0015280545,0.0015785821,0.0053441175],"category_scores_gemma":[0.0029717868,0.0006577502,0.0015929199,0.0018452948,0.0014502448,0.0029572505,0.0014225033,0.0029836686,0.0008119224],"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.00003159807,0.00007710033,0.00026279618,0.00034166715,0.000057333054,0.0001281412,0.00018552433,0.31809354,0.0029764175,0.58095366,0.006792926,0.090099275],"study_design_scores_gemma":[0.000023899765,0.000058282527,0.00012684836,0.00008450816,0.000024839266,0.00017607605,0.000052246258,0.7672326,0.0015284336,0.20123559,0.029432897,0.000023822826],"about_ca_topic_score_codex":0.0019322314,"about_ca_topic_score_gemma":0.002375817,"teacher_disagreement_score":0.0053441175,"about_ca_system_score_codex":0.0015702298,"about_ca_system_score_gemma":0.0018963108,"threshold_uncertainty_score":0.017877877},"labels":[],"label_agreement":null},{"id":"W4211146157","doi":"10.1017/cbo9781107282094.003","title":"Solving linear programs","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Focus (optics); Reading (process); Selection (genetic algorithm); Point (geometry); Section (typography); Computer science; Mathematics education; Range (aeronautics); Linear algebra; Engineering; Mathematics; Artificial intelligence","score_opus":0.023670972194085354,"score_gpt":0.19271296849255318,"score_spread":0.16904199629846783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211146157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026449952,0.010057324,0.7166076,0.003104374,0.00066479313,0.00018341652,0.0009252031,0.0017337933,0.26407853],"genre_scores_gemma":[0.07660636,0.027089082,0.6093526,0.0019381903,0.0012443226,0.0008830791,0.003623614,0.0015197768,0.277743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903893,0.000236153,0.000049873754,0.00015934248,0.00044593724,0.00006978765],"domain_scores_gemma":[0.99951696,0.00031872117,0.00002656733,0.000049172115,0.00007305616,0.000015546708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079797336,0.0014119382,0.0007301651,0.0005963225,0.0007626801,0.003059845,0.0012610843,0.0010958858,0.044507414],"category_scores_gemma":[0.0024158843,0.00060940225,0.0010127564,0.0013435903,0.0011643143,0.0025057935,0.0019296098,0.0028965783,0.015158251],"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.000016341113,0.000059748683,0.00017162248,0.00086581236,0.000039293784,0.00012688305,0.00028905572,0.019285006,0.001454109,0.63197905,0.10186933,0.24384387],"study_design_scores_gemma":[0.000019557148,0.00004679389,0.00016736487,0.00038973647,0.000017366112,0.0002945325,0.000124403,0.035101607,0.001610217,0.4207948,0.54141456,0.00001910072],"about_ca_topic_score_codex":0.0007811498,"about_ca_topic_score_gemma":0.0011223818,"teacher_disagreement_score":0.044507414,"about_ca_system_score_codex":0.0009062911,"about_ca_system_score_gemma":0.0012852657,"threshold_uncertainty_score":0.1488921},"labels":[],"label_agreement":null},{"id":"W4212892245","doi":"10.23952/jano.1.2019.3.04","title":"Solving bilevel problems with polyhedral constraint set","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Computer science; Mathematics; Optimization problem; Geometry","score_opus":0.007189926153251263,"score_gpt":0.19216286614363703,"score_spread":0.18497293999038578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212892245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010452744,0.00023317499,0.9859928,0.0002277587,0.000030786774,0.000039390703,0.000046162768,0.000097282755,0.0028799018],"genre_scores_gemma":[0.39268208,0.0009857793,0.59853446,0.0002953185,0.00009860881,0.000431877,0.0004230793,0.00030533547,0.0062435153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868304,0.0005092264,0.00006848984,0.00022705965,0.00032747423,0.00018475615],"domain_scores_gemma":[0.99667263,0.0026233979,0.00017696903,0.00016918758,0.0002402023,0.00011757365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021916337,0.001239254,0.0020045014,0.0007234642,0.0006532469,0.003276002,0.0013631528,0.0021449681,0.0050551826],"category_scores_gemma":[0.009234932,0.0009222008,0.0013006985,0.0014282207,0.0019153877,0.0027348083,0.0031556438,0.003800201,0.00059826893],"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.000051007402,0.000060051672,0.0003587688,0.00025122124,0.000044344113,0.00008722581,0.00010001614,0.88723224,0.0007550749,0.08749824,0.0007194668,0.022842351],"study_design_scores_gemma":[0.000015491927,0.00004450815,0.00004376666,0.00003519135,0.0000067416845,0.00003139691,0.000045349345,0.9137351,0.0006128313,0.08419066,0.0012283364,0.0000106482585],"about_ca_topic_score_codex":0.002039081,"about_ca_topic_score_gemma":0.0018694574,"teacher_disagreement_score":0.0050551826,"about_ca_system_score_codex":0.0009026272,"about_ca_system_score_gemma":0.0014910756,"threshold_uncertainty_score":0.016911268},"labels":[],"label_agreement":null},{"id":"W4226080534","doi":"10.21203/rs.3.rs-1499946/v1","title":"Mehar approach to solve neutrosophic linear programming problems using possibilistic mean","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decision maker; Linear programming; Mathematical optimization; Computer science; Mathematics; Operations research","score_opus":0.14082245928453252,"score_gpt":0.3880737058554663,"score_spread":0.24725124657093378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226080534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048674894,0.0007586997,0.98948634,0.00035501973,0.00006279374,0.00006782975,0.000027157103,0.00004657618,0.004328116],"genre_scores_gemma":[0.21285681,0.0012418788,0.77833664,0.0003847805,0.000248452,0.00050725,0.000114646704,0.00009989617,0.006209667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979907,0.00086137204,0.00010839347,0.0003192318,0.00057378976,0.00014652062],"domain_scores_gemma":[0.99784756,0.0016440171,0.00007390309,0.000058782054,0.0003238932,0.000051930812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033320752,0.0011056488,0.0017772118,0.0023564391,0.0011946367,0.0018319564,0.002042448,0.0021315527,0.005668846],"category_scores_gemma":[0.0046495213,0.00076614314,0.002640584,0.0019051116,0.0012254828,0.0020484875,0.0024524773,0.003708838,0.000553001],"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.00012321213,0.00019429304,0.00068757735,0.0008978867,0.00030441393,0.00020044573,0.000435329,0.5757186,0.0042357445,0.2943318,0.0030686015,0.11980209],"study_design_scores_gemma":[0.000011518451,0.000059664893,0.00008784443,0.000029599143,0.000029887731,0.000029379558,0.000037586986,0.94044733,0.0006482773,0.05662556,0.0019766928,0.000016753958],"about_ca_topic_score_codex":0.002807175,"about_ca_topic_score_gemma":0.0032699334,"teacher_disagreement_score":0.005668846,"about_ca_system_score_codex":0.0016241611,"about_ca_system_score_gemma":0.0017298079,"threshold_uncertainty_score":0.018964171},"labels":[],"label_agreement":null},{"id":"W4231104372","doi":"10.1090/stml/080/14","title":"Linear programming","year":2016,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.012866221153574865,"score_gpt":0.23109158227397755,"score_spread":0.2182253611204027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231104372","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012894502,0.010449494,0.23958203,0.002311847,0.0017235796,0.000051808278,0.00073941116,0.0011580104,0.7426944],"genre_scores_gemma":[0.025367817,0.011555116,0.05656041,0.001016567,0.0016012026,0.00016929982,0.0012133621,0.00087785494,0.9016384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993766,0.00009152759,0.000022870225,0.000114863964,0.0003553394,0.000038773927],"domain_scores_gemma":[0.9997062,0.000097265154,0.000016837621,0.00006187729,0.00009726989,0.000020599431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042550432,0.0014357235,0.0008735246,0.0010189596,0.00059912313,0.0027610406,0.00095803477,0.00079420727,0.08419893],"category_scores_gemma":[0.0012727221,0.0005526727,0.0006676895,0.0016788146,0.0009056609,0.0019453558,0.0015671387,0.0029060373,0.05214095],"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.00002185236,0.00007043958,0.00011933788,0.0003620361,0.000032767537,0.00005392072,0.000080712096,0.008707267,0.0015753496,0.27987388,0.29745144,0.41165102],"study_design_scores_gemma":[0.0000103656785,0.000032320742,0.0002797849,0.00022728094,0.000017788883,0.00017558305,0.000048580296,0.020343544,0.0017481871,0.22702694,0.7500666,0.000023135235],"about_ca_topic_score_codex":0.00078672334,"about_ca_topic_score_gemma":0.001423704,"teacher_disagreement_score":0.08419893,"about_ca_system_score_codex":0.0010012377,"about_ca_system_score_gemma":0.0009791721,"threshold_uncertainty_score":0.28167343},"labels":[],"label_agreement":null},{"id":"W4233677790","doi":"10.1007/978-1-4614-0577-1_3","title":"Multiperiod Problems","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.027581027859793116,"score_gpt":0.18775659554684365,"score_spread":0.16017556768705055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233677790","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030431852,0.013376524,0.062015202,0.0031822063,0.000954154,0.00004959108,0.0002132224,0.00013111382,0.9170347],"genre_scores_gemma":[0.09028263,0.020997955,0.028153723,0.0011288152,0.0012099234,0.00017802225,0.00046307803,0.00023622181,0.85734963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977106,0.000065166045,0.00000926066,0.000038150003,0.00008511576,0.000031274438],"domain_scores_gemma":[0.99985564,0.000062764244,0.000015177783,0.000029888211,0.000021264572,0.000015345451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042207292,0.00095885526,0.00050674216,0.0005670178,0.00058253703,0.0020563302,0.0007974819,0.0012287573,0.036137767],"category_scores_gemma":[0.00078553683,0.0004044701,0.00047548022,0.0010915925,0.0006823299,0.0022143787,0.0007685965,0.0020917014,0.006777376],"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.000027624565,0.0000806612,0.00007959536,0.0001501882,0.00001638394,0.00006523278,0.00006719234,0.009266547,0.00051252823,0.7686404,0.111059375,0.11003425],"study_design_scores_gemma":[0.000012456523,0.000028733828,0.00025850313,0.00015496666,0.00001010312,0.00013997935,0.00006612857,0.008738416,0.00037309586,0.56262195,0.42758587,0.000009879091],"about_ca_topic_score_codex":0.00070294476,"about_ca_topic_score_gemma":0.0011503509,"teacher_disagreement_score":0.036137767,"about_ca_system_score_codex":0.0013506872,"about_ca_system_score_gemma":0.0008663867,"threshold_uncertainty_score":0.12089282},"labels":[],"label_agreement":null},{"id":"W4239181871","doi":"10.23952/jano.2.2020.3.08","title":"A multi-view on the CQ algorithm for split feasibility problems: From optimization lens","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Lens (geology); Optimization algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics; Optics; Physics","score_opus":0.039975166744278846,"score_gpt":0.24303638211610884,"score_spread":0.20306121537183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239181871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049449375,0.00038858652,0.99681723,0.00053445634,0.00009670516,0.000014229175,0.000014953218,0.000031242882,0.0016080863],"genre_scores_gemma":[0.05061867,0.0020908578,0.93903995,0.0010855133,0.00081307156,0.00022803668,0.000102026715,0.00034958601,0.005672351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780935,0.001099768,0.00010059957,0.00030582762,0.0005743112,0.00011011401],"domain_scores_gemma":[0.99697495,0.0017840236,0.00019854307,0.0003281664,0.00055247056,0.00016171914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556743,0.001739159,0.0013677523,0.001831599,0.00082299864,0.0022194677,0.001979617,0.0022387463,0.005845597],"category_scores_gemma":[0.010573167,0.0008276078,0.0019264229,0.0017482508,0.003423316,0.005543447,0.0042581502,0.0073023387,0.001292708],"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.0000513578,0.00003238543,0.00019194184,0.00015513535,0.000035082885,0.00007556534,0.00015801238,0.06364745,0.0021636274,0.8799271,0.0070124967,0.04654992],"study_design_scores_gemma":[0.000028768318,0.00008426885,0.00012884388,0.00009239064,0.000020342424,0.00013987739,0.000053326567,0.63960165,0.001661794,0.33842424,0.019716542,0.00004790787],"about_ca_topic_score_codex":0.002232401,"about_ca_topic_score_gemma":0.0015267965,"teacher_disagreement_score":0.005845597,"about_ca_system_score_codex":0.0013748562,"about_ca_system_score_gemma":0.0016779094,"threshold_uncertainty_score":0.024098635},"labels":[],"label_agreement":null},{"id":"W4281555956","doi":"","title":"A stochastic production-distribution problem with a choice of transportation lead time","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Mathematical Programming","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":"Production (economics); Distribution (mathematics); Computer science; Lead (geology); Mathematical optimization; Mathematics; Economics; Geology; Microeconomics","score_opus":0.01028203721408631,"score_gpt":0.21079417490003977,"score_spread":0.20051213768595347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281555956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20158122,0.0024296183,0.7395605,0.012157433,0.00064134673,0.000544523,0.0037538044,0.0005500203,0.038781606],"genre_scores_gemma":[0.9000778,0.0012844577,0.05781113,0.00035478512,0.00043190914,0.0005182623,0.0008305552,0.0002065559,0.03848452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969207,0.0015074636,0.0001436346,0.00075255387,0.00029702208,0.00037869503],"domain_scores_gemma":[0.9844959,0.012935449,0.0008240177,0.0002991922,0.00044732585,0.000998137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378743,0.0022935201,0.004827492,0.0022370822,0.0014866429,0.006205408,0.0034482153,0.0090051945,0.013689614],"category_scores_gemma":[0.014181529,0.002806605,0.0028850287,0.0040012337,0.0032828487,0.003916118,0.0026586826,0.0039579836,0.001123564],"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.0005517684,0.0002377392,0.00079880847,0.0004443936,0.00013204156,0.0008406253,0.0001069092,0.8990613,0.0015505056,0.08657421,0.0026577744,0.0070439493],"study_design_scores_gemma":[0.0002105216,0.00016159534,0.00048095355,0.000052558375,0.000077901466,0.00016381341,0.00007543927,0.92261493,0.000493462,0.07414799,0.0014573606,0.00006339218],"about_ca_topic_score_codex":0.0058252704,"about_ca_topic_score_gemma":0.003341233,"teacher_disagreement_score":0.013689614,"about_ca_system_score_codex":0.004649709,"about_ca_system_score_gemma":0.002695252,"threshold_uncertainty_score":0.045796275},"labels":[],"label_agreement":null},{"id":"W4284879750","doi":"10.1007/s00500-022-07242-1","title":"Mehar approach to solve neutrosophic linear programming problems using possibilistic mean","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decision maker; Linear programming; Mathematical optimization; Computer science; Mathematics; Operations research","score_opus":0.033560888133010836,"score_gpt":0.252161515888293,"score_spread":0.21860062775528216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284879750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046465807,0.00042169067,0.9907815,0.00018168439,0.00007270145,0.000026196967,0.000027366928,0.0000519896,0.0037901613],"genre_scores_gemma":[0.29789263,0.00088974973,0.6867116,0.00034417503,0.00024504258,0.00030584334,0.00011398576,0.00012984242,0.01336724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922717,0.00031612444,0.0000359803,0.00008099066,0.0002806911,0.000059127535],"domain_scores_gemma":[0.9991998,0.00053868163,0.000033546294,0.000042319345,0.00016147016,0.000024121668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233882,0.00057871465,0.0012955847,0.0012054864,0.0008727243,0.0012135162,0.0014408536,0.0013832927,0.00506275],"category_scores_gemma":[0.0022659095,0.0005261981,0.0013917409,0.0012311379,0.0006282808,0.0013804198,0.0014640843,0.0020890117,0.0007202822],"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.00013449165,0.00022026495,0.0003862019,0.00059704756,0.00025446905,0.00015675247,0.00019146752,0.46458295,0.009739951,0.37422007,0.00348556,0.14603072],"study_design_scores_gemma":[0.000008078894,0.000052584484,0.000069058406,0.000015439697,0.000023336737,0.00003276861,0.000021295344,0.9371357,0.0010844806,0.059646226,0.001896833,0.000014129334],"about_ca_topic_score_codex":0.001100591,"about_ca_topic_score_gemma":0.001967445,"teacher_disagreement_score":0.00506275,"about_ca_system_score_codex":0.00056208536,"about_ca_system_score_gemma":0.0007857172,"threshold_uncertainty_score":0.0169366},"labels":[],"label_agreement":null},{"id":"W4292696703","doi":"10.19044/esj.2022.v8n0p181","title":"A Goal Programming Model for Dispatching Trucks in an Underground Gold Mine","year":2022,"lang":"en","type":"article","venue":"European Scientific Journal ESJ","topic":"Optimization and Mathematical Programming","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":"Lakehead University","funders":"","keywords":"Truck; Flexibility (engineering); Goal programming; Underground mining (soft rock); Operations research; Programming paradigm; Computer science; Gold mining; Engineering; Coal mining; Waste management; Economics","score_opus":0.031034356539463903,"score_gpt":0.2600064596675246,"score_spread":0.2289721031280607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292696703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095419526,0.00040572908,0.8697138,0.0011794723,0.000081168335,0.00023735629,0.0006926051,0.00025194383,0.032018416],"genre_scores_gemma":[0.82876545,0.0007994057,0.15273657,0.00018294765,0.000040450235,0.0005977692,0.00044057198,0.000059401376,0.01637746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938333,0.00031719616,0.000023412915,0.000090623005,0.00008918298,0.00009612569],"domain_scores_gemma":[0.99916387,0.00058767863,0.00007078843,0.000015791133,0.00010150782,0.00006044015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779576,0.0010444053,0.0007656888,0.00052612793,0.0007882723,0.0020242648,0.0013043613,0.0016527175,0.0030561322],"category_scores_gemma":[0.0016490465,0.0005758571,0.00089298823,0.0010908886,0.0009842864,0.00099009,0.0009054133,0.0014379518,0.00035113134],"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.000029401905,0.00002812493,0.00014792803,0.00003679499,0.000009825767,0.000084644584,0.000050911403,0.983182,0.00024629253,0.014085122,0.0002782815,0.001820695],"study_design_scores_gemma":[0.000016885491,0.00002781739,0.000078413366,0.000008210384,0.000006481812,0.000010349395,0.000044967084,0.9945939,0.00008331964,0.0045641772,0.00055954704,0.000005935805],"about_ca_topic_score_codex":0.04575798,"about_ca_topic_score_gemma":0.032046422,"teacher_disagreement_score":0.04575798,"about_ca_system_score_codex":0.0024565554,"about_ca_system_score_gemma":0.0034089307,"threshold_uncertainty_score":0.09098327},"labels":[],"label_agreement":null},{"id":"W4293458129","doi":"10.19044/esipreprint.8.2022.p181","title":"A Goal Programming Model for Dispatching Trucks in an Underground Gold Mine","year":2022,"lang":"en","type":"article","venue":"European Scientific Journal ESJ","topic":"Optimization and Mathematical Programming","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":"Lakehead University","funders":"","keywords":"Truck; Flexibility (engineering); Underground mining (soft rock); Goal programming; Gold mining; Operations research; Programming paradigm; Engineering; Computer science; Mining engineering; Transport engineering; Coal mining; Waste management; Economics; Automotive engineering","score_opus":0.031034356539463903,"score_gpt":0.2600064596675246,"score_spread":0.2289721031280607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293458129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095419526,0.00040572908,0.8697138,0.0011794723,0.000081168335,0.00023735629,0.0006926051,0.00025194383,0.032018416],"genre_scores_gemma":[0.82876545,0.0007994057,0.15273657,0.00018294765,0.000040450235,0.0005977692,0.00044057198,0.000059401376,0.01637746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938333,0.00031719616,0.000023412915,0.000090623005,0.00008918298,0.00009612569],"domain_scores_gemma":[0.99916387,0.00058767863,0.00007078843,0.000015791133,0.00010150782,0.00006044015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779576,0.0010444053,0.0007656888,0.00052612793,0.0007882723,0.0020242648,0.0013043613,0.0016527175,0.0030561322],"category_scores_gemma":[0.0016490465,0.0005758571,0.00089298823,0.0010908886,0.0009842864,0.00099009,0.0009054133,0.0014379518,0.00035113134],"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.000029401905,0.00002812493,0.00014792803,0.00003679499,0.000009825767,0.000084644584,0.000050911403,0.983182,0.00024629253,0.014085122,0.0002782815,0.001820695],"study_design_scores_gemma":[0.000016885491,0.00002781739,0.000078413366,0.000008210384,0.000006481812,0.000010349395,0.000044967084,0.9945939,0.00008331964,0.0045641772,0.00055954704,0.000005935805],"about_ca_topic_score_codex":0.04575798,"about_ca_topic_score_gemma":0.032046422,"teacher_disagreement_score":0.04575798,"about_ca_system_score_codex":0.0024565554,"about_ca_system_score_gemma":0.0034089307,"threshold_uncertainty_score":0.09098327},"labels":[],"label_agreement":null},{"id":"W4296870219","doi":"10.1007/978-3-031-12616-1_6","title":"Solving Problems with More Than One Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Constraint (computer-aided design); Calculus (dental); Applied mathematics; Mathematical optimization; Algebra over a field; Pure mathematics; Geometry; Medicine; Orthodontics","score_opus":0.01771667953531084,"score_gpt":0.2129451409049437,"score_spread":0.19522846136963287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296870219","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009197867,0.0025965248,0.7793774,0.0011908959,0.0007028196,0.00014517437,0.00053383986,0.00038962212,0.20586587],"genre_scores_gemma":[0.11284849,0.004445394,0.7519456,0.000958044,0.0009154047,0.00046152694,0.0019506223,0.00077402964,0.12570092],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926287,0.00013520358,0.000042629144,0.00021986097,0.00024625513,0.00009324621],"domain_scores_gemma":[0.99910647,0.0005856495,0.000051721647,0.00016133055,0.00006491718,0.000029915673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077594427,0.0016849379,0.0014298563,0.0005176249,0.00072041986,0.002191517,0.0020606038,0.0015823866,0.024338363],"category_scores_gemma":[0.00276778,0.00065062515,0.0016256929,0.0018198825,0.0009378729,0.0031574534,0.0025337744,0.0031784005,0.0047489866],"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.00008202918,0.00018135412,0.000480175,0.0024707806,0.00023251768,0.00059935334,0.00023222358,0.16428341,0.005890147,0.3260316,0.05527772,0.4442387],"study_design_scores_gemma":[0.00006467167,0.00010319436,0.0004696436,0.0003854492,0.00012780896,0.0006115204,0.00016325548,0.27844265,0.005026159,0.5345104,0.18003602,0.000059260834],"about_ca_topic_score_codex":0.00085984723,"about_ca_topic_score_gemma":0.0014031176,"teacher_disagreement_score":0.024338363,"about_ca_system_score_codex":0.0003667491,"about_ca_system_score_gemma":0.000661951,"threshold_uncertainty_score":0.081419945},"labels":[],"label_agreement":null},{"id":"W4297836588","doi":"10.48550/arxiv.1305.5610","title":"Integrating tabu search and VLSN search to develop enhanced algorithms:\\n A case study using bipartite boolean quadratic programs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Generalization; Guided Local Search; Quadratic equation; Benchmark (surveying); Heuristic; Computer science; Mathematical optimization; Search algorithm; Bipartite graph; Hill climbing; Algorithm; Quadratic programming; Mathematics; Theoretical computer science","score_opus":0.1277943539698882,"score_gpt":0.24703315292513642,"score_spread":0.11923879895524822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297836588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18761368,0.0016475781,0.7886384,0.000892426,0.00010475296,0.0002464672,0.00014642093,0.0015597721,0.019150488],"genre_scores_gemma":[0.39593193,0.0003962723,0.6005313,0.0002004722,0.00003540705,0.00015427217,0.00023857167,0.00018392681,0.0023277318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00063183234,0.00003207844,0.00009647263,0.00022821364,0.00009255236],"domain_scores_gemma":[0.99812585,0.0012687705,0.00008584784,0.0002613841,0.00018811072,0.000070080256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020196126,0.000659339,0.00085057016,0.00094289216,0.0004597858,0.00095295726,0.0014505417,0.0010536003,0.002849426],"category_scores_gemma":[0.005603815,0.00030196583,0.0005634621,0.0018986687,0.00054294313,0.001274784,0.0011465772,0.0009519867,0.0004398658],"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.0001683711,0.00047429427,0.0020029594,0.00022096174,0.000076523014,0.00011080116,0.00010268642,0.75104654,0.00242006,0.031195018,0.003641586,0.2085402],"study_design_scores_gemma":[0.000021519912,0.00005928949,0.00012356343,0.000011416262,0.000008539009,0.000024140885,0.000020428926,0.9942835,0.0005808966,0.0036125719,0.0012505311,0.0000034809134],"about_ca_topic_score_codex":0.004329376,"about_ca_topic_score_gemma":0.0079817735,"teacher_disagreement_score":0.004329376,"about_ca_system_score_codex":0.0008658028,"about_ca_system_score_gemma":0.0013007493,"threshold_uncertainty_score":0.010680854},"labels":[],"label_agreement":null},{"id":"W4303986377","doi":"10.1111/itor.13188","title":"Preface to the Special Issue on Developments in Metaheuristics","year":2022,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Mathematical Programming","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":"Metaheuristic; Computer science; Operations research; Management science; Artificial intelligence; Engineering","score_opus":0.06975319769106123,"score_gpt":0.38050630152011944,"score_spread":0.3107531038290582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303986377","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003352239,0.021552753,0.004496891,0.028337542,0.8927612,0.00020084211,0.0007046047,0.0006090967,0.051001865],"genre_scores_gemma":[0.0027184682,0.029920168,0.003407324,0.012815211,0.7318282,0.0002672154,0.0021704836,0.0014084062,0.21546452],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997498,0.00029511144,0.00023962389,0.00042308273,0.0013396781,0.00020454486],"domain_scores_gemma":[0.9872816,0.0033057646,0.0006365016,0.0007742609,0.0056668124,0.0023350862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025047269,0.002097557,0.0025529223,0.0035832704,0.002032332,0.008815337,0.0021577494,0.003096507,0.151603],"category_scores_gemma":[0.013955606,0.0006987053,0.001953164,0.0031396376,0.0009358819,0.004653979,0.0025776129,0.00781628,0.10022704],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014353809,0.000028057146,0.000033802284,0.00017856306,0.0000068150266,0.000030970685,0.000028174534,0.000103183454,0.00014023518,0.0010796449,0.9724171,0.025939077],"study_design_scores_gemma":[0.000006924928,0.000034498633,0.00019477915,0.00027131394,0.0000071924196,0.0000984313,0.000035818375,0.0001406265,0.00007240391,0.0016138521,0.9975138,0.000010328195],"about_ca_topic_score_codex":0.0010423185,"about_ca_topic_score_gemma":0.0015584581,"teacher_disagreement_score":0.151603,"about_ca_system_score_codex":0.0023434253,"about_ca_system_score_gemma":0.0027771497,"threshold_uncertainty_score":0.5071626},"labels":[],"label_agreement":null},{"id":"W4307536930","doi":"10.48550/arxiv.2210.15409","title":"Constrained Differential Dynamic Programming: A primal-dual augmented Lagrangian approach","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Mathematical Programming","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":"Willow Biosciences (Canada)","funders":"","keywords":"Augmented Lagrangian method; Mathematical optimization; Solver; Optimal control; Lagrangian relaxation; Dynamic programming; Optimization problem; Trajectory optimization; Nonlinear programming; Computer science; Mathematics; Nonlinear system","score_opus":0.03669263410485704,"score_gpt":0.18071600376036198,"score_spread":0.14402336965550494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307536930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022592116,0.00016803756,0.9940671,0.00018702373,0.000023025153,0.000019319481,0.000025065821,0.000045121833,0.00320609],"genre_scores_gemma":[0.34981152,0.0007530873,0.6412813,0.00021685906,0.000094245865,0.00030535078,0.00018342596,0.00013213944,0.007222024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996253,0.00016333043,0.000015114753,0.00005425701,0.000104936495,0.000036901434],"domain_scores_gemma":[0.9996062,0.00021954671,0.000041213698,0.000031688178,0.00007011516,0.000031340063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085857284,0.00090614165,0.00080419396,0.00053848734,0.00042717205,0.0013010876,0.00081762613,0.0009304796,0.0026674173],"category_scores_gemma":[0.0014587542,0.00043414274,0.00057038886,0.00070440996,0.0011623717,0.0009324641,0.0016983593,0.0016196388,0.00046015801],"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.00002884594,0.00004160904,0.00028718208,0.00010208601,0.000025897112,0.00009234821,0.00007504234,0.78736323,0.0013565916,0.17726922,0.0018719,0.03148613],"study_design_scores_gemma":[0.000005496214,0.000011273412,0.000024845955,0.000008684559,0.0000034332554,0.000013749442,0.0000073601354,0.97591984,0.00024374491,0.022066293,0.0016916741,0.0000035698642],"about_ca_topic_score_codex":0.0021140531,"about_ca_topic_score_gemma":0.0021896553,"teacher_disagreement_score":0.0026674173,"about_ca_system_score_codex":0.00090258376,"about_ca_system_score_gemma":0.0014480664,"threshold_uncertainty_score":0.008923411},"labels":[],"label_agreement":null},{"id":"W4308531534","doi":"10.1007/s40313-022-00964-5","title":"A Note on “A New Ranking Approach for Solving Fully Fuzzy Transportation Problem in Intuitionistic Fuzzy Environment”","year":2022,"lang":"en","type":"article","venue":"Journal of Control Automation and Electrical Systems","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"University of Manitoba","funders":"","keywords":"Mathematics; Ranking (information retrieval); Fuzzy number; Fuzzy logic; Fuzzy set operations; Mathematical optimization; Fuzzy set; Algebra over a field; Computer science; Artificial intelligence; Pure mathematics","score_opus":0.007466345645980507,"score_gpt":0.20386185221830666,"score_spread":0.19639550657232616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308531534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002238133,0.0012232873,0.9831871,0.002734764,0.0029238383,0.00009821804,0.00012135632,0.00016853139,0.007304885],"genre_scores_gemma":[0.0715156,0.0024415385,0.8997369,0.002703082,0.0037036126,0.00026056502,0.00037633747,0.00024646145,0.019015806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845505,0.00056581694,0.00013569559,0.00026346504,0.0004763566,0.00010360686],"domain_scores_gemma":[0.9988481,0.00045959314,0.000046273926,0.00013991665,0.00043862424,0.000067384884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070968,0.0010506411,0.0012319225,0.0010997149,0.0012346925,0.0017850668,0.0027448027,0.0017816578,0.008667656],"category_scores_gemma":[0.004473801,0.00045055238,0.0026607458,0.0017630141,0.0016680905,0.004386731,0.0015008672,0.0033629173,0.0017501944],"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.00026512487,0.00018198468,0.0006696595,0.00096988585,0.0003805508,0.00068977656,0.00032255246,0.093473256,0.008975271,0.63661027,0.09688127,0.16058041],"study_design_scores_gemma":[0.000062346495,0.00028834282,0.00082597265,0.00010372435,0.00014855305,0.00034112373,0.00011383506,0.4894287,0.003941756,0.41772065,0.08684111,0.00018399602],"about_ca_topic_score_codex":0.0058344705,"about_ca_topic_score_gemma":0.009142538,"teacher_disagreement_score":0.008667656,"about_ca_system_score_codex":0.0010612407,"about_ca_system_score_gemma":0.0014671659,"threshold_uncertainty_score":0.02899617},"labels":[],"label_agreement":null},{"id":"W4310533879","doi":"10.19044/esj.2022.v18n36p1","title":"A Goal Programming Model for Dispatching Trucks in an Underground Gold Mine","year":2022,"lang":"en","type":"article","venue":"European Scientific Journal ESJ","topic":"Optimization and Mathematical Programming","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":"Lakehead University","funders":"","keywords":"Truck; Flexibility (engineering); Operations research; Underground mining (soft rock); Goal programming; Computer science; Programming paradigm; Transport engineering; Engineering; Waste management; Coal mining; Economics","score_opus":0.031034356539463903,"score_gpt":0.2600064596675246,"score_spread":0.2289721031280607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310533879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08823739,0.0004176668,0.87586814,0.0012206692,0.000085673135,0.00023218429,0.00069343677,0.00025985087,0.032984965],"genre_scores_gemma":[0.82435375,0.00083514256,0.15622902,0.00019665233,0.000043712418,0.0005995093,0.0004591911,0.000062963714,0.01722005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999368,0.0003192227,0.000024711895,0.000096009506,0.00009404339,0.000098148805],"domain_scores_gemma":[0.99921286,0.00054118765,0.000068230125,0.000015747,0.00010196349,0.000059943693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265396,0.0010521024,0.0007798125,0.00053585717,0.0008093787,0.0020318918,0.0013349787,0.0016913925,0.003112683],"category_scores_gemma":[0.0016048852,0.00059205247,0.00090634456,0.0010975484,0.0009873351,0.0010326407,0.00092722906,0.001462055,0.00037260805],"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.000030862975,0.000028968123,0.00014675649,0.00003904676,0.000010276308,0.000092481736,0.00005371291,0.98135114,0.00026959513,0.01576867,0.00030646095,0.0019021146],"study_design_scores_gemma":[0.000017122835,0.000027054342,0.00007311161,0.000008037703,0.0000063353036,0.0000106392645,0.0000423119,0.9945504,0.000082954066,0.0045838337,0.0005922111,0.0000060011716],"about_ca_topic_score_codex":0.04508868,"about_ca_topic_score_gemma":0.03120568,"teacher_disagreement_score":0.04508868,"about_ca_system_score_codex":0.0024191814,"about_ca_system_score_gemma":0.00343812,"threshold_uncertainty_score":0.08965248},"labels":[],"label_agreement":null},{"id":"W4311904686","doi":"10.5540/03.2022.009.01.0297","title":"Resolução de problemas de otimização com restrições de igualdade e desigualdade utilizando a Inicialização Global Topográfica","year":2022,"lang":"pt","type":"article","venue":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics","topic":"Optimization and Mathematical Programming","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":"Discovery Air (Canada)","funders":"","keywords":"Physics; Humanities; Mathematics; Philosophy","score_opus":0.02174058757971176,"score_gpt":0.2547258001903118,"score_spread":0.23298521261060007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311904686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028439987,0.0015698924,0.9558223,0.00068534195,0.0001427486,0.00007031946,0.00017690385,0.00031939836,0.012773108],"genre_scores_gemma":[0.52534974,0.003566759,0.454345,0.0003642621,0.00018864426,0.00028139295,0.000499539,0.0004793039,0.014925407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901104,0.00029544465,0.00005886833,0.0002586442,0.00025871946,0.000117325806],"domain_scores_gemma":[0.9980837,0.0010508929,0.00017511047,0.00033690553,0.00027595158,0.00007743967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590445,0.0015091915,0.001565935,0.00095531135,0.00096675754,0.002868267,0.0013654603,0.0013451017,0.006227061],"category_scores_gemma":[0.005924247,0.0006206976,0.0014324329,0.0011383904,0.0014936201,0.0030883704,0.002523148,0.0019466949,0.00082698505],"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.00021526778,0.000109783636,0.003593906,0.0013025684,0.00022107156,0.00032159037,0.0006750135,0.57676136,0.013504875,0.22716802,0.00505849,0.17106797],"study_design_scores_gemma":[0.0000517894,0.00020457672,0.0017040322,0.00019395494,0.0001541867,0.00040681253,0.00070728344,0.7363639,0.008202731,0.22344698,0.028497247,0.00006645143],"about_ca_topic_score_codex":0.005848269,"about_ca_topic_score_gemma":0.0062874793,"teacher_disagreement_score":0.006227061,"about_ca_system_score_codex":0.0012641829,"about_ca_system_score_gemma":0.0020674556,"threshold_uncertainty_score":0.020831525},"labels":[],"label_agreement":null},{"id":"W4315752436","doi":"10.1016/j.procs.2022.12.325","title":"ANFIS Model for Cost Analysis in a Dual Source Multi-Destination System","year":2023,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Optimization and Mathematical Programming","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":"Memorial University of Newfoundland","funders":"University of Johannesburg","keywords":"Computer science; Dual (grammatical number); Focus (optics); Product (mathematics); Mathematical optimization; Face (sociological concept); Operations research; Algorithm","score_opus":0.03316031751886156,"score_gpt":0.26871931573658003,"score_spread":0.23555899821771847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315752436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25089943,0.0011586776,0.7180908,0.0007418203,0.00016601509,0.00015746935,0.00052503275,0.00060724927,0.027653527],"genre_scores_gemma":[0.9868196,0.00020977833,0.007813875,0.0000280197,0.000014627083,0.00010029085,0.00009488367,0.00001278535,0.004906043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976224,0.000059173413,0.000016467631,0.00005292285,0.00007304225,0.000036109665],"domain_scores_gemma":[0.9997389,0.0001508353,0.000036113437,0.000007649251,0.00005552467,0.000011024758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043243973,0.0007518854,0.0007722619,0.00048613167,0.00039227394,0.0012454997,0.00071804726,0.0012233771,0.0026939604],"category_scores_gemma":[0.00067295576,0.00037038678,0.0006051989,0.00036641344,0.00035603347,0.00055524096,0.0004207805,0.00092658657,0.00019454287],"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.00003147245,0.000010643179,0.00023589349,0.000023134511,0.0000123820555,0.00006351543,0.00001783761,0.9953881,0.00041271237,0.0009715989,0.00011341351,0.0027193595],"study_design_scores_gemma":[0.0000022198196,0.000006581865,0.00006242919,0.0000019447293,0.0000027067388,0.0000033605754,0.000004605969,0.99962914,0.00006553164,0.00015477033,0.000065314205,0.0000013403481],"about_ca_topic_score_codex":0.01887611,"about_ca_topic_score_gemma":0.010976807,"teacher_disagreement_score":0.01887611,"about_ca_system_score_codex":0.00088096416,"about_ca_system_score_gemma":0.0007678838,"threshold_uncertainty_score":0.03753245},"labels":[],"label_agreement":null},{"id":"W4320039432","doi":"10.1007/s10107-023-01930-y","title":"A novel reformulation for the single-sink fixed-charge transportation problem","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Transportation theory; Fixed charge; Leverage (statistics); Mathematical optimization; Knapsack problem; Mathematics; Linear programming; Integer programming; Heuristic; Algorithm","score_opus":0.03791356835714092,"score_gpt":0.25676339012631094,"score_spread":0.21884982176917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320039432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004408226,0.00074238505,0.955849,0.002167442,0.00044957254,0.0001092103,0.00049377396,0.00009949724,0.03568093],"genre_scores_gemma":[0.3851128,0.003787068,0.52307993,0.0021494995,0.0017759696,0.00081816193,0.0015661403,0.00051531533,0.08119511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.00027526752,0.000028034876,0.0001761702,0.00021932492,0.000090458765],"domain_scores_gemma":[0.9993667,0.00028752632,0.00005723706,0.00006776137,0.00017624153,0.00004460059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014623933,0.0012661495,0.00124685,0.00076287816,0.00067033264,0.0023031214,0.0025983083,0.0021515735,0.013614597],"category_scores_gemma":[0.0036053823,0.00047532097,0.0014092207,0.00139468,0.0010678555,0.0039848806,0.0016290272,0.0027814726,0.002014765],"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.000046021058,0.000099221455,0.00015449968,0.00024836787,0.000029907515,0.00014935329,0.00006536746,0.1699051,0.0009700701,0.7756407,0.026023585,0.026667811],"study_design_scores_gemma":[0.00003565738,0.000050576124,0.00013597726,0.00006245914,0.000023957276,0.00015597601,0.000049540882,0.6866498,0.0004273301,0.29332837,0.01905906,0.000021231082],"about_ca_topic_score_codex":0.003277391,"about_ca_topic_score_gemma":0.0036347723,"teacher_disagreement_score":0.013614597,"about_ca_system_score_codex":0.0017915597,"about_ca_system_score_gemma":0.0021682046,"threshold_uncertainty_score":0.04554534},"labels":[],"label_agreement":null},{"id":"W4321089801","doi":"10.21203/rs.3.rs-2525294/v1","title":"A note on “An algorithmic approach to solve unbalanced triangular fuzzy transportation problems”","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fuzzy logic; Fuzzy transportation; Fuzzy set operations; Fuzzy number; Mathematical optimization; Point (geometry); Transportation theory; Mathematics; Computer science; Fuzzy set; Defuzzification; Artificial intelligence","score_opus":0.08824923857840812,"score_gpt":0.3712656601399721,"score_spread":0.283016421561564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321089801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016263127,0.0008769568,0.9848817,0.0026079423,0.0008846916,0.000087180466,0.00005047139,0.00009912012,0.008885538],"genre_scores_gemma":[0.035726614,0.0018710705,0.9525181,0.0012312229,0.0010291049,0.0002674655,0.00017238925,0.0001356643,0.007048371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983997,0.0006482113,0.00011830468,0.00025792155,0.00049915625,0.00007675683],"domain_scores_gemma":[0.99827266,0.0010156494,0.00007086262,0.00021248944,0.00037632466,0.00005208172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003015183,0.0011492562,0.0006841436,0.0012778158,0.0010398652,0.0016478029,0.0022339192,0.0017305574,0.008311839],"category_scores_gemma":[0.0069502164,0.00049692066,0.0020717878,0.0017535099,0.0020259416,0.0036986081,0.0018425243,0.0037393617,0.001999087],"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.00014226956,0.00014256484,0.00045758698,0.0005094737,0.000103708124,0.00042488452,0.00039039005,0.123380706,0.0031509763,0.6768102,0.037677143,0.15681008],"study_design_scores_gemma":[0.000060351147,0.00012201187,0.00029987926,0.000171542,0.000044498618,0.00028303417,0.00013636146,0.43096018,0.0022482045,0.4529673,0.1126381,0.000068549394],"about_ca_topic_score_codex":0.002878359,"about_ca_topic_score_gemma":0.0033733388,"teacher_disagreement_score":0.008311839,"about_ca_system_score_codex":0.0010863722,"about_ca_system_score_gemma":0.0014326158,"threshold_uncertainty_score":0.027805865},"labels":[],"label_agreement":null},{"id":"W4322747773","doi":"10.1007/978-3-031-23876-5_7","title":"Using Goal Programming to Locate a New Fire Hall","year":2023,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Aeronautics; Architectural engineering; Engineering","score_opus":0.1356848343971156,"score_gpt":0.41841664377551013,"score_spread":0.28273180937839454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322747773","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011378265,0.00024750046,0.92758894,0.00087297685,0.00014970801,0.00004095917,0.00007258445,0.00090934365,0.058739737],"genre_scores_gemma":[0.23435265,0.00042648453,0.7237275,0.00018640865,0.000040224448,0.00007859764,0.00021528472,0.000571458,0.040401284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996656,0.00012462315,0.000011985801,0.000069705675,0.00007004086,0.000057949575],"domain_scores_gemma":[0.99966943,0.00015449166,0.000023991557,0.000048684597,0.000056803856,0.000046660745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000714794,0.0007381105,0.00061769056,0.00081870717,0.0013661569,0.0037509205,0.0014882599,0.001684245,0.012592879],"category_scores_gemma":[0.0018275862,0.00061842863,0.0009093073,0.00080188864,0.0011619134,0.0036666894,0.002192635,0.0017625786,0.0025583617],"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.00022116302,0.00014804598,0.0008928826,0.00016792388,0.0000474616,0.00041680402,0.00080042204,0.2253952,0.0037088096,0.50995755,0.018374857,0.23986891],"study_design_scores_gemma":[0.00003846486,0.00007643466,0.00022903213,0.00009083353,0.000035295016,0.00015234227,0.0008228817,0.5837892,0.0032217891,0.36890015,0.042597454,0.0000460947],"about_ca_topic_score_codex":0.004883637,"about_ca_topic_score_gemma":0.0071863676,"teacher_disagreement_score":0.012592879,"about_ca_system_score_codex":0.0010586632,"about_ca_system_score_gemma":0.001474706,"threshold_uncertainty_score":0.04212737},"labels":[],"label_agreement":null},{"id":"W4322761032","doi":"10.18280/mmep.100122","title":"Fixed Charge Solid Transportation Problem Based on Carbon Emission with Budget Constraints in Uncertain Environment (UFSTPCEBC)","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Carbon fibers; Fixed charge; Charge (physics); Environmental science; Mathematical optimization; Computer science; Physics; Mathematics; Chemical physics; Algorithm","score_opus":0.01516157294511676,"score_gpt":0.19856249082451238,"score_spread":0.1834009178793956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322761032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11213953,0.0013664275,0.862578,0.0015520086,0.00017362444,0.00036706383,0.0011735874,0.0002222375,0.020427559],"genre_scores_gemma":[0.90496314,0.00093250995,0.08091017,0.00015239512,0.000072325616,0.0004294984,0.0008368498,0.00009348014,0.011609709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867815,0.00037341772,0.00006905605,0.00030250443,0.00024680723,0.00033005583],"domain_scores_gemma":[0.9986688,0.0007625711,0.00018878595,0.00004170887,0.0001949156,0.00014324747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013545036,0.0015567829,0.0019815774,0.0010346994,0.0009428329,0.002714526,0.0020014122,0.002757823,0.0048386636],"category_scores_gemma":[0.0022401018,0.0008192378,0.0016553955,0.0019512837,0.0009627715,0.0023024948,0.0015869915,0.0017729586,0.0002819437],"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.000061418825,0.000027786497,0.0003573174,0.00011533263,0.00003762038,0.00024970574,0.000038219336,0.9768386,0.00042315785,0.015492612,0.0009634924,0.0053948043],"study_design_scores_gemma":[0.00001730656,0.00003537643,0.00017944314,0.000017083365,0.00001645483,0.000053591826,0.00003184214,0.9909671,0.00020403911,0.0077677662,0.0006968099,0.000013149097],"about_ca_topic_score_codex":0.022151018,"about_ca_topic_score_gemma":0.010475565,"teacher_disagreement_score":0.022151018,"about_ca_system_score_codex":0.0031397764,"about_ca_system_score_gemma":0.0024025948,"threshold_uncertainty_score":0.044044197},"labels":[],"label_agreement":null},{"id":"W4324269802","doi":"10.1007/978-981-19-6406-0_11","title":"A Fuzzy Logic-Based Approach to Solve Interval Multi-objective Non-linear Transportation Problem: Suggested Modifications","year":2022,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interval (graph theory); Fuzzy logic; Transportation theory; Mathematical optimization; Computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03340645949066068,"score_gpt":0.2589579112234587,"score_spread":0.225551451732798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324269802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020098672,0.0003851999,0.9848408,0.00024955266,0.00019600207,0.000059341823,0.000052472362,0.00010453613,0.012102131],"genre_scores_gemma":[0.16598171,0.0010617635,0.80782235,0.00034860746,0.00023066015,0.00033282285,0.00017204047,0.00011461502,0.023935404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974173,0.00006170211,0.000016617101,0.000052171796,0.00010932533,0.00001853425],"domain_scores_gemma":[0.9998281,0.00005700505,0.000009530852,0.0000128064885,0.000084970736,0.0000075739435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064270326,0.0006074087,0.0007253655,0.00067085767,0.0005262749,0.0012028104,0.00144175,0.0012235665,0.012200901],"category_scores_gemma":[0.0010261622,0.0002787646,0.0010819894,0.0010050213,0.0004184284,0.0010137763,0.0005773363,0.0013848295,0.002060053],"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.000098088596,0.00022293691,0.00022314473,0.0004819625,0.000089807596,0.00018346013,0.000112321504,0.5857932,0.00876662,0.1097407,0.009191063,0.2850967],"study_design_scores_gemma":[0.000016048869,0.000056100638,0.00012318579,0.00003585684,0.000022212229,0.00004902592,0.000020556436,0.9683344,0.00109327,0.024369674,0.005865631,0.000014083395],"about_ca_topic_score_codex":0.005454368,"about_ca_topic_score_gemma":0.0070781475,"teacher_disagreement_score":0.012200901,"about_ca_system_score_codex":0.0008393087,"about_ca_system_score_gemma":0.0010742152,"threshold_uncertainty_score":0.04081607},"labels":[],"label_agreement":null},{"id":"W4360978753","doi":"10.1007/s10878-023-01002-z","title":"An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Augmented Lagrangian method; Theory of computation; Mathematical optimization; Nonlinear system; Computer science; Nonlinear programming; Lagrange multiplier; Minification; Scale (ratio); Lagrangian relaxation; Mathematics; Algorithm","score_opus":0.011695456112597062,"score_gpt":0.2239217104963334,"score_spread":0.21222625438373632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360978753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013866339,0.00052322133,0.9787586,0.00032452992,0.00011886948,0.00007789156,0.00014587503,0.00014009349,0.006044583],"genre_scores_gemma":[0.6330602,0.0008060489,0.3535166,0.0002596066,0.000216908,0.00067175576,0.0004911901,0.00020898644,0.010768699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.00017656077,0.000017385553,0.00004040898,0.00009545163,0.000047314843],"domain_scores_gemma":[0.9988294,0.00074390095,0.0000967613,0.000059509017,0.00020452548,0.00006575091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014157575,0.0012772182,0.0017398322,0.0008380609,0.0006394553,0.0015233555,0.001680905,0.0016234593,0.003547951],"category_scores_gemma":[0.0029910125,0.0011075421,0.0012802065,0.0011078238,0.00088551163,0.0014688008,0.0017347472,0.002025688,0.00044419826],"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.000008241872,0.000015800124,0.000064594446,0.000026602604,0.000015254942,0.000029450948,0.000010499557,0.99161506,0.00010569718,0.005089036,0.00033369893,0.0026860929],"study_design_scores_gemma":[0.0000022987,0.0000036063923,0.000010803974,0.0000020311413,0.0000015892108,0.0000015509538,0.0000022017866,0.9988086,0.000014019166,0.0010510772,0.000100881705,0.0000013310797],"about_ca_topic_score_codex":0.012978381,"about_ca_topic_score_gemma":0.014341343,"teacher_disagreement_score":0.012978381,"about_ca_system_score_codex":0.0008072551,"about_ca_system_score_gemma":0.0020225854,"threshold_uncertainty_score":0.025805652},"labels":[],"label_agreement":null},{"id":"W4366808570","doi":"10.5267/j.jpm.2023.3.001","title":"Credibility based chance constrained programming for parallel machine scheduling under linear deterioration and learning effects with considering setup times dependent on past sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Mathematical optimization; Job shop scheduling; Fuzzy logic; Pareto optimal; Computer science; Scheduling (production processes); Heuristic; Constraint (computer-aided design); Constraint programming; Pareto principle; Multi-objective optimization; Mathematics; Artificial intelligence","score_opus":0.022471793127047307,"score_gpt":0.2742429177143532,"score_spread":0.2517711245873059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366808570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032145035,0.00060472736,0.9628105,0.0004798925,0.000072962575,0.00007665089,0.00008100504,0.00009097701,0.0036382824],"genre_scores_gemma":[0.90272593,0.0007811066,0.09129647,0.00009977827,0.0001000483,0.00023589795,0.00013953383,0.00006538534,0.0045557874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900335,0.00043323182,0.00003920556,0.00014218617,0.000246589,0.0001354211],"domain_scores_gemma":[0.996108,0.0030537578,0.00036540016,0.0000538547,0.00027955108,0.00013947015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024802855,0.0012926352,0.0016861879,0.0010024622,0.0005578046,0.0015501812,0.0012234232,0.0014223407,0.001686766],"category_scores_gemma":[0.0063367533,0.0008696147,0.0011703522,0.001310421,0.0011206949,0.0012458658,0.0011190093,0.001845901,0.00013690144],"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.000019141511,0.000006004756,0.000102164755,0.00002511803,0.000010696083,0.00003794464,0.000011784098,0.9947402,0.00013014626,0.0029545682,0.00009237125,0.0018699544],"study_design_scores_gemma":[0.0000020364755,0.0000073445203,0.00002816984,0.0000029316968,0.0000017525206,0.0000035082062,0.000002546563,0.9986754,0.000038088758,0.0011963982,0.000039764356,0.0000020054763],"about_ca_topic_score_codex":0.011271259,"about_ca_topic_score_gemma":0.0059007583,"teacher_disagreement_score":0.011271259,"about_ca_system_score_codex":0.001824157,"about_ca_system_score_gemma":0.002463477,"threshold_uncertainty_score":0.022411346},"labels":[],"label_agreement":null},{"id":"W4380486067","doi":"10.1007/978-3-031-30337-1_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Management science; Engineering","score_opus":0.04378420860433334,"score_gpt":0.2769502726568363,"score_spread":0.23316606405250295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380486067","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041040312,0.0024648092,0.005790816,0.0029466036,0.0039558555,0.00014311695,0.0022318817,0.00082171237,0.9812347],"genre_scores_gemma":[0.0014225537,0.0014628299,0.0017904466,0.0010944769,0.00060377485,0.000080524806,0.0015603392,0.00021976994,0.9917653],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993944,0.00006353117,0.000021105896,0.00012069053,0.00033421145,0.00006603967],"domain_scores_gemma":[0.99915326,0.00014455416,0.00003102244,0.00012883621,0.00039285986,0.00014950693],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063008786,0.0008003062,0.00051778747,0.001532701,0.0013656047,0.003931439,0.001572784,0.001729994,0.5884601],"category_scores_gemma":[0.0025407318,0.0003036709,0.0004811977,0.0015236433,0.00059601996,0.0027620764,0.0022163033,0.0016908,0.47835115],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024758248,0.00003500007,0.00009203745,0.00015391354,0.0000020669124,0.0000505192,0.00014209042,0.0001545547,0.00037502014,0.049659412,0.780502,0.16880867],"study_design_scores_gemma":[0.0000016225074,0.000005394388,0.00005447895,0.00005199082,6.876887e-7,0.000027283868,0.000032843873,0.000025924419,0.00006695468,0.0048174807,0.9949132,0.0000021549308],"about_ca_topic_score_codex":0.0021535656,"about_ca_topic_score_gemma":0.0032988677,"teacher_disagreement_score":0.5884601,"about_ca_system_score_codex":0.0012060904,"about_ca_system_score_gemma":0.0018374335,"threshold_uncertainty_score":0.5870117},"labels":[],"label_agreement":null},{"id":"W4380486168","doi":"10.1007/978-3-031-30337-1_4","title":"Mehar Method-III to Find All More-for-Less Solutions of Symmetric Intuitionistic Fuzzy Transportation Problems with Mixed Constraints","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Fuzzy number; Fuzzy logic; Transportation theory; Mathematical optimization; Fuzzy set operations; Discrete mathematics; Algebra over a field; Applied mathematics; Fuzzy set; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.08852911648091881,"score_gpt":0.31171080202478174,"score_spread":0.22318168554386292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380486168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031172957,0.0003579738,0.9862578,0.00021272732,0.00021988225,0.000100099816,0.000104310326,0.0003059475,0.0093239155],"genre_scores_gemma":[0.04413917,0.00027685286,0.9394677,0.0002812902,0.000087698965,0.00033835217,0.00020958186,0.00031598104,0.014883373],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995048,0.0001725328,0.000027666549,0.00008708345,0.0001487374,0.00005919441],"domain_scores_gemma":[0.9993349,0.0004118925,0.000028196455,0.00006120665,0.00013764408,0.00002621055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015733556,0.0012023281,0.0015740492,0.0012221436,0.0007401018,0.0010285656,0.0022731882,0.0018890972,0.01375887],"category_scores_gemma":[0.0025652167,0.0006919529,0.001910155,0.0010531854,0.0008972321,0.0014129747,0.0021861244,0.0032605676,0.0023260235],"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.0002600617,0.00024918467,0.0002990226,0.0008809746,0.0003084584,0.00015264243,0.00024260857,0.2877112,0.010264987,0.3064093,0.020532256,0.3726893],"study_design_scores_gemma":[0.000040420706,0.00012103239,0.00012086191,0.00006398972,0.00004796687,0.00008586337,0.000051502968,0.91662806,0.0036587815,0.0685536,0.0105987545,0.00002920346],"about_ca_topic_score_codex":0.001939436,"about_ca_topic_score_gemma":0.002576413,"teacher_disagreement_score":0.01375887,"about_ca_system_score_codex":0.00061101036,"about_ca_system_score_gemma":0.0012844384,"threshold_uncertainty_score":0.046028018},"labels":[],"label_agreement":null},{"id":"W4380486174","doi":"10.1007/978-3-031-30337-1_3","title":"Mehar Method-II to Find All More-For-Less Solutions of Symmetric Fuzzy Transportation Problems with Mixed Constraints","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fuzzy logic; Transportation theory; Mathematical optimization; Mathematics; Fuzzy transportation; Variable (mathematics); Fuzzy number; Fuzzy set; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.09174104285345736,"score_gpt":0.3115398983233454,"score_spread":0.21979885546988803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380486174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003173218,0.00050259125,0.98597854,0.00023511157,0.00025122694,0.00008988983,0.00009797227,0.00024613368,0.009425281],"genre_scores_gemma":[0.044617925,0.00043465762,0.93514544,0.00031650643,0.00012273603,0.0003340611,0.00020597922,0.000313056,0.018509664],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995523,0.00016776328,0.00002447217,0.00007498661,0.00013148415,0.00004906003],"domain_scores_gemma":[0.9993857,0.00038860296,0.000026433241,0.00005485495,0.000119881435,0.000024512585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014032252,0.0012066409,0.0014975001,0.0011843481,0.00068236503,0.00093298574,0.0020391683,0.0017921892,0.011624296],"category_scores_gemma":[0.0024500287,0.0006700331,0.0017174876,0.0010352057,0.00087209744,0.0014343726,0.0020620937,0.0032603275,0.0021654356],"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.0002274266,0.0002252809,0.00027809406,0.00079109054,0.00026646358,0.0001456237,0.00021789252,0.28104144,0.010030732,0.30570075,0.02006974,0.38100547],"study_design_scores_gemma":[0.000032929478,0.000119041724,0.00011758911,0.00005461334,0.00004105224,0.00009194227,0.000045039407,0.91777676,0.0034164428,0.06738758,0.01089043,0.000026633734],"about_ca_topic_score_codex":0.0016746385,"about_ca_topic_score_gemma":0.0023039442,"teacher_disagreement_score":0.011624296,"about_ca_system_score_codex":0.0005589446,"about_ca_system_score_gemma":0.0011160164,"threshold_uncertainty_score":0.038887203},"labels":[],"label_agreement":null},{"id":"W4380519660","doi":"10.1007/978-3-031-30337-1_5","title":"Mehar Method-IV to Find All More-For-Less Solutions of Symmetric Intuitionistic Fuzzy Linear Fractional Transportation Problems with Mixed Constraints","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Applied mathematics; Fuzzy logic; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.0935773476194735,"score_gpt":0.32199276111957253,"score_spread":0.22841541350009903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380519660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005132499,0.0003841614,0.9837202,0.00024921,0.00020894822,0.00008259803,0.0000811191,0.00026769546,0.009873578],"genre_scores_gemma":[0.08474613,0.000348194,0.8971902,0.00033506303,0.00010592372,0.0003334731,0.00019662945,0.00033673004,0.016407665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996327,0.00013733731,0.000019020405,0.00006577706,0.00009591101,0.0000491195],"domain_scores_gemma":[0.99935144,0.00043524502,0.00002802163,0.000046031288,0.00011580047,0.000023436874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014660822,0.0011348482,0.001495849,0.0011233441,0.00071665127,0.0009549178,0.0018147228,0.0017865151,0.010849723],"category_scores_gemma":[0.0025061867,0.0006069703,0.0016140776,0.00091536995,0.0009335868,0.0012867881,0.0019462863,0.0029069327,0.0014011293],"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.00029318128,0.00024455573,0.00030008407,0.00087831763,0.000242385,0.00014858582,0.00027798643,0.37936124,0.010091713,0.2816852,0.015879096,0.31059766],"study_design_scores_gemma":[0.000028923403,0.00010151981,0.00008292951,0.00004928776,0.00003529738,0.000054803968,0.00004779599,0.9416704,0.0026824526,0.04941304,0.0058132866,0.000020190077],"about_ca_topic_score_codex":0.002025714,"about_ca_topic_score_gemma":0.002524011,"teacher_disagreement_score":0.010849723,"about_ca_system_score_codex":0.00061448687,"about_ca_system_score_gemma":0.0012222804,"threshold_uncertainty_score":0.03629589},"labels":[],"label_agreement":null},{"id":"W4380519670","doi":"10.1007/978-3-031-30337-1_2","title":"Mehar Method-I to Find All More-For-Less Solutions of Symmetric Fuzzy Balanced Transportation Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fuzzy logic; Transportation theory; Mathematics; Mathematical optimization; Fuzzy transportation; Fuzzy number; Applied mathematics; Fuzzy set; Computer science; Artificial intelligence","score_opus":0.10417114160114994,"score_gpt":0.3306300957529654,"score_spread":0.2264589541518155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380519670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048543075,0.0005671086,0.981516,0.00035102788,0.00025471213,0.000080470236,0.00009058416,0.00019376182,0.01209195],"genre_scores_gemma":[0.09618874,0.0008036515,0.87135494,0.0004225145,0.00018118486,0.0003933644,0.00023001409,0.00032185984,0.030103754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.00013315081,0.000017675795,0.0000699446,0.000113354625,0.00004802626],"domain_scores_gemma":[0.99958223,0.00023004763,0.00002565915,0.000043240663,0.00009615188,0.00002271775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013069907,0.0010783076,0.0013147327,0.001180494,0.0007050024,0.00091237074,0.0015639018,0.001425112,0.010082127],"category_scores_gemma":[0.0022368417,0.00052093965,0.001476317,0.0009799391,0.00096499163,0.0015116862,0.0018971729,0.0025453265,0.0017517079],"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.00021078772,0.00016220215,0.000291391,0.00061528315,0.00017790907,0.0000941524,0.00019932995,0.23856059,0.009597946,0.4429021,0.016615687,0.2905728],"study_design_scores_gemma":[0.000036450932,0.00014562378,0.00013962241,0.00005893032,0.000043185206,0.0000796944,0.000057607765,0.8454674,0.0033710992,0.13808885,0.01248581,0.000025731544],"about_ca_topic_score_codex":0.0015387784,"about_ca_topic_score_gemma":0.0017624317,"teacher_disagreement_score":0.010082127,"about_ca_system_score_codex":0.0006356079,"about_ca_system_score_gemma":0.0009688631,"threshold_uncertainty_score":0.033728063},"labels":[],"label_agreement":null},{"id":"W4380519743","doi":"10.1007/978-3-031-30337-1","title":"More-for-Less Solutions in Fuzzy Transportation Problems","year":2023,"lang":"en","type":"book","venue":"Studies in fuzziness and soft computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fuzzy logic; Fuzzy transportation; Computer science; Transportation theory; Operations research; Fuzzy control system; Engineering; Mathematics; Artificial intelligence; Mathematical optimization; Fuzzy set operations","score_opus":0.07585036192058145,"score_gpt":0.3010582730100483,"score_spread":0.22520791108946683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380519743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011865315,0.010902669,0.8606851,0.0069509754,0.0014326505,0.00005957448,0.00012227306,0.00028985357,0.10769151],"genre_scores_gemma":[0.29870662,0.016751643,0.53842545,0.002994363,0.0025007916,0.00018497679,0.0004048229,0.00043320731,0.13959813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996456,0.000118044074,0.000021614642,0.000056522425,0.00012979352,0.00002851158],"domain_scores_gemma":[0.9995278,0.00025694032,0.00002419902,0.000100705576,0.00006377362,0.00002665324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088647194,0.0009826336,0.0009181485,0.00069860846,0.0007049096,0.0014990816,0.0011429307,0.0014396268,0.016326929],"category_scores_gemma":[0.002935898,0.00035407196,0.0010216185,0.0012827427,0.0014406061,0.003924676,0.0011752028,0.002761252,0.0017505093],"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.000046042314,0.00005643741,0.000103554514,0.00025879164,0.000041539948,0.0000566624,0.00015893576,0.06372921,0.0016999516,0.7443646,0.021243991,0.16824016],"study_design_scores_gemma":[0.000016722743,0.000040487896,0.0001012561,0.000084472194,0.000018180986,0.00008339456,0.00006650291,0.08382791,0.0005454528,0.87959,0.03561244,0.000013221588],"about_ca_topic_score_codex":0.0011364288,"about_ca_topic_score_gemma":0.0015791382,"teacher_disagreement_score":0.016326929,"about_ca_system_score_codex":0.00084875827,"about_ca_system_score_gemma":0.00056302774,"threshold_uncertainty_score":0.054619014},"labels":[],"label_agreement":null},{"id":"W4381885510","doi":"10.1016/j.eswa.2023.120899","title":"Developing a fuzzy optimized model for selecting a maintenance strategy in the paper industry: An integrated FGP-ANP-FMEA approach","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Failure mode and effects analysis; Risk analysis (engineering); Preventive maintenance; Fuzzy logic; Predictive maintenance; Reliability engineering; Proactive maintenance; Optimal maintenance; Operations research; Business; Engineering; Artificial intelligence","score_opus":0.05490420174599783,"score_gpt":0.29411638113663324,"score_spread":0.2392121793906354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381885510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017148077,0.00019991492,0.97623867,0.00013199892,0.000031497544,0.00007649032,0.00009417501,0.00020688641,0.0058723283],"genre_scores_gemma":[0.7233408,0.00041965215,0.2680795,0.00013367977,0.00004849078,0.00049197016,0.00024986817,0.000100838486,0.0071352194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997631,0.00006501946,0.0000127047415,0.00004850396,0.000072074516,0.000038554987],"domain_scores_gemma":[0.99962986,0.0002063607,0.00003626023,0.000015892794,0.000096855554,0.00001475793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008097459,0.0008913849,0.0012337986,0.0010654061,0.0005974914,0.0013426623,0.0013721812,0.0019241257,0.0028122251],"category_scores_gemma":[0.0013848421,0.000644094,0.0013316434,0.00086251734,0.00041267122,0.000920614,0.00070036063,0.00087862456,0.00037460934],"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.000006909094,0.000011177739,0.00010946965,0.000021240632,0.00001235393,0.00002267257,0.000009369504,0.9925647,0.000342518,0.0012768802,0.00012212942,0.00550051],"study_design_scores_gemma":[0.0000015940489,0.0000053174704,0.00003219424,0.0000026769328,0.0000045138686,0.0000038062092,0.000003307441,0.9992625,0.00009261049,0.00050162233,0.00008829163,0.0000015511364],"about_ca_topic_score_codex":0.027406082,"about_ca_topic_score_gemma":0.017278204,"teacher_disagreement_score":0.027406082,"about_ca_system_score_codex":0.0011873308,"about_ca_system_score_gemma":0.0016871964,"threshold_uncertainty_score":0.05449313},"labels":[],"label_agreement":null},{"id":"W4383110686","doi":"10.37278/insearch.v21i2.552","title":"Penjadwalan Housekeepers Hotel Pada Era Pandemi COVID-19 dengan Pendekatan Goal Programming","year":2023,"lang":"id","type":"article","venue":"In Search","topic":"Optimization and Mathematical Programming","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":"Hotel Dieu Hospital","funders":"","keywords":"Humanities; Philosophy","score_opus":0.05682866554647322,"score_gpt":0.3333757203942045,"score_spread":0.2765470548477313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383110686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42635348,0.0019404222,0.17955339,0.0056892596,0.0004117711,0.0011552162,0.003565992,0.0023617402,0.37896872],"genre_scores_gemma":[0.7137672,0.0014686851,0.12101415,0.0006483212,0.000036153706,0.00084014726,0.002521757,0.00034058123,0.15936305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894136,0.00033388156,0.00005514531,0.00020309891,0.0002749855,0.00019159075],"domain_scores_gemma":[0.99877185,0.00033754366,0.00012388258,0.00009352467,0.00036381814,0.00030938245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010851125,0.00067162566,0.00036430501,0.00043007222,0.0011743875,0.0029134857,0.00090109813,0.000571652,0.015668252],"category_scores_gemma":[0.0011543697,0.0003493082,0.00065553293,0.0006662164,0.0005603296,0.001362518,0.0017915104,0.0015186266,0.0037439973],"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.0022361148,0.004681306,0.037547257,0.0032054305,0.00037788422,0.0013058725,0.008304036,0.05888547,0.028723424,0.13191222,0.08454023,0.63828087],"study_design_scores_gemma":[0.0004249156,0.0028283691,0.0618773,0.0009285154,0.00043532837,0.0006577137,0.025755307,0.12431805,0.035126053,0.062365465,0.6850268,0.0002560992],"about_ca_topic_score_codex":0.009822943,"about_ca_topic_score_gemma":0.028532969,"teacher_disagreement_score":0.015668252,"about_ca_system_score_codex":0.001966213,"about_ca_system_score_gemma":0.0039632563,"threshold_uncertainty_score":0.05241549},"labels":[],"label_agreement":null},{"id":"W4383621633","doi":"10.1007/s13198-023-02010-2","title":"A method to solve Pythagorean fuzzy transportation problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Systems Assurance Engineering and Management","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Pythagorean theorem; Fuzzy logic; Transportation theory; Product (mathematics); Fuzzy transportation; Mathematics; Computer science; Fuzzy set; Mathematical optimization; Operations research; Fuzzy number; Artificial intelligence","score_opus":0.009992202908025945,"score_gpt":0.24629236472761198,"score_spread":0.23630016181958605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383621633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037785287,0.00015554878,0.993856,0.00006675558,0.00007936399,0.00003485832,0.000023309683,0.00006279897,0.001942684],"genre_scores_gemma":[0.13058425,0.0004512314,0.8615942,0.000085943575,0.00008845769,0.00024918807,0.00009595876,0.000097373726,0.0067533907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998005,0.00006171668,0.000012119056,0.0000334964,0.0000730295,0.000019029929],"domain_scores_gemma":[0.9996903,0.00017076125,0.000015685802,0.000022646742,0.00008301295,0.00001757687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008305724,0.0006058834,0.0008796385,0.00087641925,0.0008578668,0.0006872231,0.0011331587,0.0009910096,0.003568379],"category_scores_gemma":[0.0014449649,0.000362176,0.0011225824,0.0008427688,0.00053735526,0.0008732553,0.0010418667,0.0015234845,0.00046634505],"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.00012460006,0.00015023447,0.0007728258,0.0004127362,0.00014266108,0.00020173212,0.00021730938,0.55699104,0.010041938,0.15525804,0.004074928,0.27161193],"study_design_scores_gemma":[0.000017773162,0.00003431995,0.00009869852,0.000013707891,0.000014506502,0.000041262876,0.000016827065,0.97889555,0.0007637376,0.016462928,0.0036300083,0.0000106956495],"about_ca_topic_score_codex":0.00505034,"about_ca_topic_score_gemma":0.0048818714,"teacher_disagreement_score":0.00505034,"about_ca_system_score_codex":0.000503757,"about_ca_system_score_gemma":0.0011977433,"threshold_uncertainty_score":0.011937439},"labels":[],"label_agreement":null},{"id":"W4385483004","doi":"10.3390/math11153383","title":"An Investigation of Linear Diophantine Fuzzy Nonlinear Fractional Programming Problems","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Diophantine equation; Fractional programming; Mathematics; Nonlinear programming; Mathematical optimization; Fuzzy logic; Linear-fractional programming; Fuzzy set; Linear programming; Degree (music); Fuzzy number; Nonlinear system; Set (abstract data type); Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.025302934982939822,"score_gpt":0.2637586048968325,"score_spread":0.2384556699138927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385483004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030022593,0.0017897396,0.93319786,0.0007768719,0.000056666002,0.00006417837,0.000035062294,0.000030165429,0.034026876],"genre_scores_gemma":[0.7429435,0.0024634178,0.2420202,0.00021232091,0.00013455994,0.00016972685,0.000055409404,0.000038616025,0.011962214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.0002245945,0.00001913218,0.00007649377,0.00016885015,0.000049767845],"domain_scores_gemma":[0.99914014,0.00067619025,0.0000610153,0.00002505771,0.000074785465,0.000022819506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013946241,0.0005972002,0.00064462,0.0006095059,0.00066796,0.0013892225,0.00080964743,0.001113688,0.0024113227],"category_scores_gemma":[0.00284922,0.00030445217,0.0007602702,0.00092740665,0.0011405993,0.001370377,0.0010246636,0.001595818,0.00016591075],"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.000085063344,0.00009599412,0.00069836114,0.00043303857,0.000040059145,0.00039424602,0.00040920146,0.5099426,0.0035993096,0.4449742,0.0009984814,0.038329408],"study_design_scores_gemma":[0.000008618141,0.000049752198,0.00022168727,0.000031489504,0.000009643753,0.00008519657,0.000073853094,0.92214763,0.0008105999,0.07392014,0.0026308962,0.000010635713],"about_ca_topic_score_codex":0.0025411318,"about_ca_topic_score_gemma":0.0014617731,"teacher_disagreement_score":0.0025411318,"about_ca_system_score_codex":0.0011248919,"about_ca_system_score_gemma":0.00081398105,"threshold_uncertainty_score":0.008161664},"labels":[],"label_agreement":null},{"id":"W4386129051","doi":"10.46254/in02.20220030","title":"The Integrated Combined Compromise Solution Method and Distance-Based MCDM Model with Application","year":2022,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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 Manitoba","funders":"","keywords":"Multiple-criteria decision analysis; Closeness; Mathematical optimization; Compromise; Computer science; Variance (accounting); Fuzzy logic; Mathematics; Artificial intelligence","score_opus":0.008651163309683596,"score_gpt":0.2201563115818744,"score_spread":0.2115051482721908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386129051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050043208,0.0002847547,0.98865217,0.00016264495,0.000035709956,0.000063765176,0.000030312598,0.00007147527,0.0056947656],"genre_scores_gemma":[0.3307254,0.00072745694,0.66187066,0.00009294272,0.000053395117,0.00035460384,0.000092613045,0.000057633104,0.0060252077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691784,0.001275844,0.00011915838,0.00032296436,0.0012584969,0.000105619525],"domain_scores_gemma":[0.999067,0.0004643016,0.000064563246,0.00007151457,0.00028975806,0.0000429025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023605735,0.00095341366,0.0011410265,0.0025957825,0.0009253267,0.0016887801,0.0016102438,0.001747953,0.004491556],"category_scores_gemma":[0.0041934373,0.00053116755,0.0015678343,0.0031135,0.00092115137,0.0022495964,0.0019247193,0.0012038173,0.0004944849],"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.0001270202,0.000092676055,0.00088104024,0.00042160365,0.00016759314,0.00019215912,0.00035421658,0.67427266,0.0037103016,0.1302018,0.0024895738,0.18708928],"study_design_scores_gemma":[0.000019787889,0.00006682943,0.0001788032,0.000046425084,0.000035654906,0.000105254425,0.000048661885,0.97031635,0.0009961103,0.023623625,0.004538377,0.000024117631],"about_ca_topic_score_codex":0.0029043823,"about_ca_topic_score_gemma":0.0028568818,"teacher_disagreement_score":0.004491556,"about_ca_system_score_codex":0.0015345657,"about_ca_system_score_gemma":0.0012845559,"threshold_uncertainty_score":0.0150257945},"labels":[],"label_agreement":null},{"id":"W4386246550","doi":"10.18280/mmep.100445","title":"Application of a Modified Gauss Elimination Technique for Separable Fuzzy Nonlinear Programming Problems","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Separable space; Fuzzy logic; Gauss; Nonlinear system; Nonlinear programming; Mathematics; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.023771462264889808,"score_gpt":0.23836023626193079,"score_spread":0.214588773997041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386246550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015713645,0.000077457975,0.9969982,0.00003156237,0.000015965055,0.000013538826,0.0000059469094,0.000029404557,0.0012565012],"genre_scores_gemma":[0.14044769,0.0006230767,0.8545527,0.00007172881,0.00007958365,0.0001248571,0.00006456002,0.000077486075,0.003958239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995865,0.00013961193,0.00001666705,0.00004009382,0.00018872207,0.000028327364],"domain_scores_gemma":[0.9996865,0.00016391468,0.000030165535,0.000029396244,0.00007741652,0.00001264418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007143438,0.00068246387,0.0006378775,0.0005889789,0.00039913243,0.0005261415,0.00079936424,0.00058105483,0.0018511446],"category_scores_gemma":[0.0011254519,0.0002904415,0.0007956806,0.00061517925,0.00051430124,0.0007027659,0.0009784941,0.0012663262,0.0005445731],"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.000105782776,0.00010813396,0.00056171353,0.00045002397,0.00013546983,0.0003882795,0.00034136773,0.494461,0.024746606,0.2156815,0.003314785,0.2597054],"study_design_scores_gemma":[0.00000682856,0.000039708648,0.00007044922,0.000013874022,0.000011294764,0.00008602192,0.000017542421,0.9795583,0.0027288299,0.011942687,0.0055148513,0.000009609411],"about_ca_topic_score_codex":0.0015297557,"about_ca_topic_score_gemma":0.0017600082,"teacher_disagreement_score":0.0018511446,"about_ca_system_score_codex":0.00030664363,"about_ca_system_score_gemma":0.0007868632,"threshold_uncertainty_score":0.006192684},"labels":[],"label_agreement":null},{"id":"W4387544842","doi":"10.2139/ssrn.4598689","title":"Problemiterative Matheuristic for the Biomedical Sample Transportation Problem","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Sample (material); Business; Computer science; Chemistry; Chromatography","score_opus":0.01848583465514994,"score_gpt":0.25979674619971643,"score_spread":0.2413109115445665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387544842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021260672,0.00036082763,0.9886642,0.0021222618,0.000191866,0.00011589305,0.00024868286,0.00010828381,0.0060619353],"genre_scores_gemma":[0.11919923,0.001039221,0.83996207,0.0014879483,0.00089514453,0.0013025892,0.0014540124,0.00086032023,0.033799466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769956,0.0010123367,0.00012300289,0.00044282884,0.00049857906,0.00022369015],"domain_scores_gemma":[0.9948716,0.0036477542,0.0002211941,0.00042337575,0.0006523708,0.00018366847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050140843,0.0021372237,0.0017370493,0.0017788156,0.001470686,0.0031049647,0.0035543155,0.0036813796,0.02152785],"category_scores_gemma":[0.014831656,0.0007413713,0.0028183104,0.001281092,0.0022693013,0.0042872755,0.0068459143,0.0057681086,0.0024389592],"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.00014559226,0.00019123183,0.00081483484,0.0008041464,0.00010674026,0.00025683737,0.00027940905,0.22529179,0.0016761274,0.67124087,0.024755895,0.07443645],"study_design_scores_gemma":[0.000022080643,0.00003209285,0.00013199555,0.000054285105,0.000025271993,0.000079690886,0.000051440875,0.6532996,0.0006962642,0.3371263,0.008464561,0.000016337333],"about_ca_topic_score_codex":0.004866297,"about_ca_topic_score_gemma":0.005792451,"teacher_disagreement_score":0.02152785,"about_ca_system_score_codex":0.0031752007,"about_ca_system_score_gemma":0.0033393071,"threshold_uncertainty_score":0.07201785},"labels":[],"label_agreement":null},{"id":"W4388660517","doi":"10.3390/axioms12111048","title":"Multi-Objective Non-Linear Programming Problems in Linear Diophantine Fuzzy Environment","year":2023,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Diophantine equation; Mathematical optimization; Linear programming; Mathematics; Linear-fractional programming; Fuzzy logic; Nonlinear programming; Nonlinear system; Computer science; Discrete mathematics; Artificial intelligence","score_opus":0.018929520212169537,"score_gpt":0.24766774846455866,"score_spread":0.22873822825238913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388660517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013391412,0.0012398699,0.9761322,0.00037788262,0.00004579561,0.00005376568,0.00006533172,0.0000333953,0.008660274],"genre_scores_gemma":[0.5925391,0.0027470426,0.39250037,0.00019998991,0.00008562273,0.00037105574,0.00014565027,0.000058850386,0.011352354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936265,0.0002691065,0.000032905602,0.00011756617,0.00016695457,0.000050907875],"domain_scores_gemma":[0.9994281,0.0004352244,0.000049882427,0.000013041804,0.000057458747,0.00001625077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402658,0.00083625724,0.0010331298,0.00040436254,0.00060995575,0.0011145931,0.00078308984,0.0009858574,0.0023667137],"category_scores_gemma":[0.0014922766,0.00041291834,0.00075894594,0.0010672112,0.0009194205,0.00090536114,0.0008580888,0.0016415985,0.00024467846],"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.000028139144,0.000034558998,0.00025389745,0.00026483723,0.00003432117,0.00019279154,0.00014027167,0.9117623,0.0015016218,0.06820932,0.00079847407,0.016779523],"study_design_scores_gemma":[0.000009867325,0.00003428384,0.0001000215,0.000017718974,0.000008603241,0.00003749798,0.000036330428,0.9687339,0.00040419993,0.029539084,0.001069609,0.000008818903],"about_ca_topic_score_codex":0.0052797985,"about_ca_topic_score_gemma":0.0048221117,"teacher_disagreement_score":0.0052797985,"about_ca_system_score_codex":0.0011562443,"about_ca_system_score_gemma":0.00118006,"threshold_uncertainty_score":0.010498166},"labels":[],"label_agreement":null},{"id":"W4390095668","doi":"10.59254/sbpo-2018-85285","title":"Meta-heurística híbrida aplicada ao Problema das Sequências Justas Ponderadas","year":2018,"lang":"pt","type":"article","venue":"Anais do Simpósio Brasileiro de Pesquisa Operacional","topic":"Optimization and Mathematical Programming","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":"Computer science","score_opus":0.06508167927139824,"score_gpt":0.32079279767299956,"score_spread":0.2557111184016013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390095668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040973995,0.0010222804,0.9495832,0.0002741778,0.00009353925,0.00019427772,0.00009693494,0.0003153249,0.007446347],"genre_scores_gemma":[0.5031148,0.0010680186,0.4871681,0.00013522018,0.00007661026,0.00045232289,0.00020297675,0.00011426637,0.0076676854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994319,0.00020087711,0.00003255795,0.000111607646,0.00012684138,0.00009623034],"domain_scores_gemma":[0.99915946,0.0005377642,0.00008381913,0.000070682014,0.00010384758,0.000044415207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788608,0.0011599793,0.001154595,0.0012022359,0.00075277186,0.0014961539,0.0013905871,0.0014039937,0.0025660184],"category_scores_gemma":[0.002854576,0.0005041382,0.0012486011,0.001213603,0.00079567265,0.0011331263,0.00078253704,0.0012370375,0.00029119343],"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.00007442301,0.00010615407,0.00049765914,0.00017441629,0.00007904417,0.000096169184,0.00011597739,0.9122396,0.0025673024,0.02489443,0.0008923924,0.05826247],"study_design_scores_gemma":[0.000022342889,0.000064089225,0.000116963354,0.000029566228,0.00003634985,0.000048970447,0.00004278609,0.98127395,0.0014260127,0.014343297,0.00258702,0.000008541221],"about_ca_topic_score_codex":0.0043665054,"about_ca_topic_score_gemma":0.0049567176,"teacher_disagreement_score":0.0043665054,"about_ca_system_score_codex":0.0012384481,"about_ca_system_score_gemma":0.0020094602,"threshold_uncertainty_score":0.008985639},"labels":[],"label_agreement":null},{"id":"W4390670687","doi":"10.28924/2291-8639-22-2024-11","title":"New Approach to Solving Fuzzy Multiobjective Linear Fractional Optimization Problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Fuzzy logic; Parametric statistics; Fuzzy number; Fractional programming; Fuzzy set; Nonlinear programming; Nonlinear system; Computer science; Artificial intelligence; Statistics","score_opus":0.011678148226831954,"score_gpt":0.2756985981748825,"score_spread":0.2640204499480506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390670687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009203474,0.00027441056,0.9966731,0.000043230473,0.00003413852,0.000024728695,0.000006740968,0.000024948635,0.001998188],"genre_scores_gemma":[0.08187767,0.0009831617,0.9132865,0.00010415267,0.00010939262,0.00031091116,0.000051912724,0.000058190137,0.003218113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992149,0.0002756156,0.000048221547,0.00010476934,0.00031568191,0.000040787945],"domain_scores_gemma":[0.99955493,0.0002557584,0.000030121064,0.000030132154,0.000113520895,0.000015442118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016809826,0.0012449981,0.0011173493,0.0013037688,0.00062483666,0.0012235495,0.0014582034,0.0014864561,0.0023048304],"category_scores_gemma":[0.0019299366,0.00046470025,0.0015777872,0.0011202947,0.0007721153,0.0011091031,0.0012782582,0.0020255183,0.00050568307],"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.00005039584,0.00007529733,0.00031750966,0.0006183965,0.00012975307,0.0001862406,0.000262496,0.73103076,0.0072436873,0.13018043,0.0013573057,0.12854771],"study_design_scores_gemma":[0.000012076199,0.000042637977,0.000049792925,0.00003377477,0.000017625462,0.00005813039,0.000019268855,0.97429794,0.0010412851,0.01921679,0.005197828,0.000012914595],"about_ca_topic_score_codex":0.0017034399,"about_ca_topic_score_gemma":0.001668231,"teacher_disagreement_score":0.0023048304,"about_ca_system_score_codex":0.0007213809,"about_ca_system_score_gemma":0.00094598805,"threshold_uncertainty_score":0.008890033},"labels":[],"label_agreement":null},{"id":"W4390842838","doi":"10.1504/wrstsd.2024.136010","title":"Optimal value determination using traditional and newly developed method based on using initial basic feasible solution of a transportation problem using northwest and Russell method","year":2024,"lang":"en","type":"article","venue":"World Review of Science Technology and Sustainable Development","topic":"Optimization and Mathematical Programming","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":"Dalhousie University","funders":"","keywords":"Value (mathematics); Mathematical optimization; Computer science; Mathematics; Machine learning","score_opus":0.03183875111031938,"score_gpt":0.3175507197879726,"score_spread":0.28571196867765325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390842838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026113929,0.00018947516,0.9926536,0.000050978942,0.00003465102,0.000051151244,0.000025180561,0.00007481138,0.004308821],"genre_scores_gemma":[0.10800065,0.00083001045,0.8842991,0.00005664551,0.00003193666,0.0003749619,0.00013771496,0.00014194862,0.006127171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989391,0.00040871315,0.00006322318,0.00019042124,0.00033212552,0.0000664426],"domain_scores_gemma":[0.9990717,0.00047763367,0.00006431412,0.00004915227,0.00031138663,0.000025732283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001740561,0.0009615719,0.0010013373,0.0015201587,0.0006967125,0.0012800833,0.001413019,0.0012147091,0.0045753215],"category_scores_gemma":[0.0030672944,0.0005567215,0.0013889108,0.0016066626,0.00095891923,0.0015316899,0.0008658251,0.0015467951,0.00084500946],"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.000114798946,0.00010378948,0.0011193241,0.00083165005,0.0000792342,0.00023538912,0.00028571524,0.7047735,0.009085655,0.093612224,0.0036784238,0.18608037],"study_design_scores_gemma":[0.000023048566,0.0000947873,0.00026983727,0.000050843562,0.000019348312,0.00011616053,0.00006789957,0.97319746,0.003972885,0.014228995,0.007918017,0.000040735602],"about_ca_topic_score_codex":0.0043153046,"about_ca_topic_score_gemma":0.003478791,"teacher_disagreement_score":0.0045753215,"about_ca_system_score_codex":0.00079663313,"about_ca_system_score_gemma":0.0020536156,"threshold_uncertainty_score":0.015305936},"labels":[],"label_agreement":null},{"id":"W4391531701","doi":"10.28924/2291-8639-22-2024-26","title":"Single-Valued Neutrosophic Ideal Approximation Spaces","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Majmaah University","keywords":"Mathematics; Ideal (ethics); Pure mathematics; Calculus (dental); Mathematical economics; Epistemology; Medicine; Orthodontics; Philosophy","score_opus":0.012100444504641797,"score_gpt":0.26832263493364267,"score_spread":0.25622219042900085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391531701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027663413,0.0007723017,0.9627106,0.00017482578,0.00011007066,0.000038465783,0.00007894111,0.000118531774,0.008332754],"genre_scores_gemma":[0.620545,0.0013785291,0.37198308,0.00013363501,0.00015660869,0.00013821643,0.00035103114,0.000050994517,0.0052629085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793506,0.00039587117,0.00017115405,0.00045834266,0.0008915966,0.00014790369],"domain_scores_gemma":[0.9988788,0.00028093543,0.00013657766,0.00016356917,0.000432246,0.000107935535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017863928,0.0005839262,0.0007069774,0.001381072,0.00061281654,0.0020428377,0.0010695797,0.00050409924,0.0018308617],"category_scores_gemma":[0.0031892965,0.00020692559,0.0011371429,0.0012183377,0.0015646345,0.0030786053,0.001530315,0.0016136481,0.0004573508],"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.00010677383,0.000050226816,0.0010965101,0.00030935096,0.00010005346,0.00026019698,0.0007579175,0.03451644,0.008240038,0.88297224,0.0012185402,0.07037175],"study_design_scores_gemma":[0.000022234031,0.00017651674,0.00085301243,0.00011135415,0.00007195148,0.0006946419,0.00049003586,0.362902,0.00946138,0.6012678,0.023877032,0.000072097784],"about_ca_topic_score_codex":0.00076558045,"about_ca_topic_score_gemma":0.00041033403,"teacher_disagreement_score":0.0020428377,"about_ca_system_score_codex":0.00082698785,"about_ca_system_score_gemma":0.000695764,"threshold_uncertainty_score":0.009447455},"labels":[],"label_agreement":null},{"id":"W4391890089","doi":"10.1007/978-3-031-49295-2_8","title":"MATLAB Codes of Metaheuristics Methods","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadore College","funders":"","keywords":"Metaheuristic; MATLAB; Computer science; Algorithm; Programming language","score_opus":0.027378496765449314,"score_gpt":0.2993723518208891,"score_spread":0.2719938550554398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391890089","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007518542,0.0017455937,0.8804784,0.00036117822,0.0005487226,0.00011120039,0.0028615056,0.015007708,0.09813379],"genre_scores_gemma":[0.020503357,0.0027034502,0.8333959,0.000507346,0.00020513238,0.0008820052,0.005165082,0.011754294,0.12488345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994312,0.00010121208,0.000041751897,0.00006330526,0.00032076877,0.000041833322],"domain_scores_gemma":[0.9988574,0.00051632454,0.000056696903,0.0001362994,0.00040173484,0.00003154599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047941355,0.0012229921,0.0007576899,0.001128717,0.0003749543,0.0016133201,0.0022678012,0.0014358262,0.15522622],"category_scores_gemma":[0.0035254396,0.0006632478,0.0006493249,0.0019046703,0.00037747395,0.0013478243,0.0010043584,0.0017647343,0.093910985],"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.00006911998,0.00009511833,0.00021400522,0.0010177033,0.000039989278,0.00011801136,0.000108962115,0.08188652,0.003697353,0.095964596,0.27319875,0.5435898],"study_design_scores_gemma":[0.000070417496,0.000045349974,0.00035645967,0.00036207,0.000028479959,0.00037183662,0.000048873713,0.33825687,0.01041479,0.07383923,0.5761446,0.00006103757],"about_ca_topic_score_codex":0.0022358492,"about_ca_topic_score_gemma":0.0035247544,"teacher_disagreement_score":0.15522622,"about_ca_system_score_codex":0.0005666818,"about_ca_system_score_gemma":0.0009405324,"threshold_uncertainty_score":0.5192834},"labels":[],"label_agreement":null},{"id":"W4392191459","doi":"10.18280/mmep.110228","title":"Transportation of Materials Under Fuzzy Environment Using Expected Monetary Value Strategy","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fuzzy transportation; Mathematical optimization; Travelling salesman problem; Fuzzy number; Fuzzy logic; Transportation theory; Computer science; Ranking (information retrieval); Fuzzy set operations; Fuzzy set; Set (abstract data type); Representation (politics); Value (mathematics); Mathematics; Artificial intelligence; Machine learning","score_opus":0.02677653344588662,"score_gpt":0.20830485493736997,"score_spread":0.18152832149148335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392191459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051796816,0.0007627738,0.9299944,0.000698728,0.00008383693,0.000082348066,0.000055957684,0.00007001191,0.016455162],"genre_scores_gemma":[0.92474276,0.00088202656,0.063926555,0.00007275977,0.000049827686,0.00015336345,0.000056175835,0.00002602234,0.01009056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937135,0.00027415133,0.00003261098,0.00008334291,0.00015911879,0.000079332734],"domain_scores_gemma":[0.999673,0.00012792036,0.00006146091,0.000019080691,0.000085515436,0.000032909607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012101802,0.0007871002,0.0008610233,0.0011034901,0.0008088891,0.0022888843,0.0010413458,0.0011787192,0.0020825546],"category_scores_gemma":[0.0014912048,0.00030846894,0.0011277082,0.0009123538,0.0010585604,0.0027441331,0.0011111811,0.00071895693,0.00019075406],"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.000052300602,0.000034685723,0.00036477656,0.00011684403,0.00004533364,0.0002703443,0.00008225153,0.8014164,0.0021979695,0.18226801,0.0007417875,0.0124094],"study_design_scores_gemma":[0.000010588712,0.00004693802,0.000098910285,0.000012958501,0.000011863286,0.000038156304,0.000050287512,0.95461535,0.00042467212,0.044018913,0.00065701717,0.000014234953],"about_ca_topic_score_codex":0.0042022937,"about_ca_topic_score_gemma":0.002424288,"teacher_disagreement_score":0.0042022937,"about_ca_system_score_codex":0.0024013207,"about_ca_system_score_gemma":0.0010012954,"threshold_uncertainty_score":0.017422915},"labels":[],"label_agreement":null},{"id":"W4395452180","doi":"10.1007/s10479-024-05903-y","title":"Multi-item order quantity optimization through stochastic goal programing","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Qatar University","keywords":"Order (exchange); Computer science; Stochastic optimization; Stochastic programming; Mathematical optimization; Mathematics; Economics","score_opus":0.23686216625472759,"score_gpt":0.4645346067948513,"score_spread":0.22767244054012373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395452180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016459858,0.000107704305,0.98053,0.00020745586,0.000016880098,0.00008290194,0.000038532504,0.00008139195,0.002475199],"genre_scores_gemma":[0.6928164,0.00028359826,0.30304998,0.00017260556,0.000042853455,0.00045513237,0.00018743037,0.000101878766,0.0028901473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755245,0.0012648151,0.00010150158,0.00027391737,0.00057353696,0.00023378414],"domain_scores_gemma":[0.9964759,0.0023571828,0.00034002413,0.00011449267,0.0005140859,0.00019831918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042198435,0.0014240552,0.0014758642,0.001097135,0.0004911757,0.0016487082,0.0011538513,0.0010888984,0.0020448917],"category_scores_gemma":[0.0068548387,0.0005829967,0.0010140395,0.0012351372,0.0012695519,0.0013489358,0.0022098213,0.0017869873,0.00019857007],"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.000035367182,0.000058493082,0.00040125696,0.000062288964,0.000033248354,0.000044012144,0.000049608407,0.9634321,0.00050199137,0.025209783,0.0003848281,0.009787023],"study_design_scores_gemma":[0.000005797565,0.00003561469,0.000049259103,0.000007778699,0.000004943339,0.0000048598167,0.000011675228,0.9898803,0.00015856573,0.009606947,0.000230591,0.000003614841],"about_ca_topic_score_codex":0.0038077575,"about_ca_topic_score_gemma":0.0024690856,"teacher_disagreement_score":0.0042198435,"about_ca_system_score_codex":0.0013998996,"about_ca_system_score_gemma":0.0021561503,"threshold_uncertainty_score":0.022316933},"labels":[],"label_agreement":null},{"id":"W4396620742","doi":"10.2139/ssrn.4815864","title":"Multi-Objective Frequentistic Model Averaging with an Application to Economic Growth","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Economic model; Economics; Econometrics; Growth model; Computer science; Mathematical economics; Macroeconomics","score_opus":0.007867524894305682,"score_gpt":0.24069813255578137,"score_spread":0.2328306076614757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396620742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016979184,0.0005739894,0.9798212,0.00029435937,0.00008681022,0.000028142545,0.00006105189,0.00010241209,0.002052759],"genre_scores_gemma":[0.7375576,0.0015139089,0.2541174,0.0001978563,0.00036536457,0.00027911417,0.00026276548,0.00030783657,0.0053983093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837315,0.0010151822,0.00007737729,0.00019769858,0.00023696583,0.00009959774],"domain_scores_gemma":[0.9900771,0.007830879,0.0006346994,0.00045129508,0.0007759417,0.00023012601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006097429,0.0013445927,0.003221288,0.0012600122,0.00086767925,0.0015691962,0.0019466191,0.0017513977,0.0019019754],"category_scores_gemma":[0.016355164,0.0008083008,0.0025506855,0.002031973,0.0012765098,0.0020648048,0.002158197,0.00222082,0.0001825157],"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.000028066806,0.000034297416,0.00029453723,0.000086837405,0.000117784264,0.000082498125,0.000046657293,0.93293476,0.00029846872,0.055091016,0.0005653138,0.010419764],"study_design_scores_gemma":[0.0000016429302,0.000009508555,0.000045119396,0.00000281696,0.000008824068,0.000007762891,0.0000036861445,0.9810059,0.000047912643,0.018737221,0.0001244872,0.000005139538],"about_ca_topic_score_codex":0.0058656246,"about_ca_topic_score_gemma":0.0046208296,"teacher_disagreement_score":0.006097429,"about_ca_system_score_codex":0.0012168839,"about_ca_system_score_gemma":0.0012831202,"threshold_uncertainty_score":0.03224671},"labels":[],"label_agreement":null},{"id":"W4396721056","doi":"10.1016/j.cie.2024.110196","title":"Iterative matheuristic for the biomedical sample transportation problem","year":2024,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; HEC Montréal; Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Sample (material); Computer science; Transport engineering; Operations research; Mathematical optimization; Engineering; Mathematics; Chemistry; Chromatography","score_opus":0.025151116018447047,"score_gpt":0.2328359100456205,"score_spread":0.20768479402717344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396721056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008249054,0.00033235824,0.9837309,0.00045971147,0.00006482077,0.00017363888,0.00014878687,0.0002652676,0.0065753707],"genre_scores_gemma":[0.16304585,0.00058789615,0.8289199,0.00039208474,0.000112435766,0.0007780359,0.0005372624,0.00022519678,0.0054013296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986475,0.00057799893,0.000065592656,0.00023334344,0.00030433547,0.00017123362],"domain_scores_gemma":[0.99737644,0.0019791557,0.00019342738,0.0001105862,0.00024622618,0.00009409688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026306754,0.0021760706,0.0013742959,0.0012684405,0.00079563475,0.0016838657,0.002271333,0.0018709245,0.00622402],"category_scores_gemma":[0.0052765515,0.0007271255,0.0022151035,0.0010148088,0.0013344989,0.0019270234,0.0019566333,0.0029502204,0.0010458436],"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.00008866925,0.00009232603,0.00042903196,0.0002384318,0.000050169707,0.00011139587,0.00010041958,0.93499565,0.00085288,0.034692176,0.0027283847,0.025620405],"study_design_scores_gemma":[0.000021053125,0.000038547314,0.000052871805,0.000017672026,0.000010823204,0.000032526405,0.00002610753,0.98246187,0.0003253266,0.015123935,0.0018814108,0.000007960812],"about_ca_topic_score_codex":0.0062110294,"about_ca_topic_score_gemma":0.0067467373,"teacher_disagreement_score":0.00622402,"about_ca_system_score_codex":0.0017677618,"about_ca_system_score_gemma":0.0024966625,"threshold_uncertainty_score":0.020821393},"labels":[],"label_agreement":null},{"id":"W4399398532","doi":"10.46254/an14.20240232","title":"Goal Programming Model for Sustainability and Circular Economy Evaluation","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Sustainability; Circular economy; Computer science","score_opus":0.020450278632781538,"score_gpt":0.28493437295055807,"score_spread":0.26448409431777653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399398532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011386636,0.0005627944,0.9636519,0.0010564917,0.00010743035,0.0002100149,0.00028528678,0.00017458982,0.022564882],"genre_scores_gemma":[0.50228316,0.0017531577,0.47508022,0.000531328,0.00013169477,0.001810792,0.00070962677,0.00015016066,0.017549878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752337,0.001643157,0.00007413868,0.00022310423,0.00028385044,0.0002524428],"domain_scores_gemma":[0.99643505,0.0027445036,0.00019981802,0.00006779935,0.00042973857,0.00012314119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003932522,0.0016397162,0.00118447,0.0011007132,0.0007375955,0.0026487366,0.0015502173,0.0017450731,0.005495776],"category_scores_gemma":[0.0058799367,0.00058794854,0.0016065188,0.0015985697,0.0012960192,0.001591785,0.0015514835,0.0028004968,0.0006488613],"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.00004901364,0.00007633684,0.00036867487,0.00012161342,0.00004539402,0.00009661539,0.00009339998,0.88446975,0.00014771479,0.10291965,0.001429182,0.010182591],"study_design_scores_gemma":[0.000013280074,0.000036551653,0.0000710477,0.000029504015,0.000012188143,0.00001368079,0.000047532973,0.9643792,0.0000911647,0.033195876,0.0021013813,0.000008551224],"about_ca_topic_score_codex":0.0107989125,"about_ca_topic_score_gemma":0.008432911,"teacher_disagreement_score":0.0107989125,"about_ca_system_score_codex":0.0028599002,"about_ca_system_score_gemma":0.0040895687,"threshold_uncertainty_score":0.021472096},"labels":[],"label_agreement":null},{"id":"W4400821237","doi":"10.28924/2291-8639-22-2024-117","title":"Prediction of Stochastic Transportation Problem with Fixed Charge in Multi-Objective Rough Interval Environment","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fixed charge; Mathematical optimization; Interval (graph theory); Probabilistic logic; Mathematics; Transportation theory; Constraint (computer-aided design); Weibull distribution; Stochastic programming; Operator (biology); Fuzzy logic; Linear programming; Computer science; Statistics; Artificial intelligence","score_opus":0.011288998990371786,"score_gpt":0.23730941928522958,"score_spread":0.2260204202948578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400821237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14898008,0.00038175646,0.84687144,0.00050995563,0.000050066956,0.000076877215,0.00015298107,0.000098695535,0.0028781719],"genre_scores_gemma":[0.9670702,0.00033387993,0.031103808,0.000034147823,0.000032337386,0.00010241645,0.00013242228,0.00001798743,0.0011727099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942183,0.00022836402,0.000020759066,0.00011882061,0.00011129679,0.00009897488],"domain_scores_gemma":[0.9985543,0.00102545,0.0001833834,0.000025462605,0.00014386422,0.00006744979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016482726,0.0008931958,0.0010852385,0.0006090744,0.0004708082,0.0012432815,0.000933212,0.0011919446,0.0012341447],"category_scores_gemma":[0.0026881911,0.00041373813,0.0012485356,0.0006930425,0.0006873777,0.0009835693,0.0007057119,0.0012022771,0.000054100678],"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.000010723896,0.000005209058,0.00025482252,0.000015926482,0.000009066859,0.00003699414,0.000010600748,0.9964616,0.00007241354,0.002043263,0.00009247385,0.0009869607],"study_design_scores_gemma":[0.0000016661842,0.00000683707,0.00007068928,0.0000016485418,0.0000023085447,0.0000035218598,0.0000058928445,0.9987507,0.000031247888,0.0010979318,0.000025565876,0.000001921246],"about_ca_topic_score_codex":0.015884783,"about_ca_topic_score_gemma":0.006405095,"teacher_disagreement_score":0.015884783,"about_ca_system_score_codex":0.0012146606,"about_ca_system_score_gemma":0.0011654394,"threshold_uncertainty_score":0.03158468},"labels":[],"label_agreement":null},{"id":"W4402842213","doi":"10.5267/j.dsl.2024.7.004","title":"Financial optimization modeling on asset liability management with weighted goal programming","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Kementerian Pendidikan, Kebudayaan, Riset, dan Teknologi","keywords":"Asset management; Liability; Business; Finance; Goal programming; Actuarial science; Asset (computer security); Financial management; Computer science; Operations research; Mathematics","score_opus":0.01019774755117064,"score_gpt":0.24986888764094092,"score_spread":0.23967114008977028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402842213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03897135,0.000634615,0.94414604,0.0005903937,0.00006852594,0.00015902049,0.0002856495,0.00020228383,0.014942213],"genre_scores_gemma":[0.73455703,0.0010303374,0.25360778,0.000270157,0.0000591502,0.0007939027,0.0005016909,0.00014284819,0.00903729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988261,0.0005866939,0.000043556804,0.0001548538,0.00022107044,0.00016762286],"domain_scores_gemma":[0.99855787,0.000977102,0.00014585335,0.00003298337,0.00022773985,0.000058524307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025123965,0.001595571,0.0011196529,0.0011988294,0.00053103844,0.0020290117,0.0011832543,0.001501986,0.0032437025],"category_scores_gemma":[0.0035456761,0.0007025218,0.0013241387,0.0013055308,0.0009213445,0.0010431916,0.0015286069,0.001546907,0.0003225521],"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.00001110457,0.00001666874,0.00018637997,0.000026974085,0.000014774082,0.00003372285,0.000014207568,0.99237484,0.00010160234,0.0044218157,0.00016230621,0.0026356245],"study_design_scores_gemma":[0.000003635515,0.000012637747,0.00006209789,0.000007861877,0.0000054192888,0.000005305396,0.000009519778,0.9961428,0.000070861366,0.003409466,0.00026724723,0.0000030568945],"about_ca_topic_score_codex":0.013056656,"about_ca_topic_score_gemma":0.007872366,"teacher_disagreement_score":0.013056656,"about_ca_system_score_codex":0.0015146427,"about_ca_system_score_gemma":0.002251754,"threshold_uncertainty_score":0.02596134},"labels":[],"label_agreement":null},{"id":"W4404131643","doi":"10.1137/1.9781611978162.appc","title":"Appendix C: Mathematical Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Mathematical Programming","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":"Appendix; Computer science; Biology; Paleontology","score_opus":0.0414711881697485,"score_gpt":0.2370834395002066,"score_spread":0.19561225133045812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404131643","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012994419,0.010907685,0.33579376,0.012292343,0.007651919,0.0007427391,0.08232087,0.0054830033,0.54350823],"genre_scores_gemma":[0.030775117,0.018841414,0.3177631,0.011448899,0.0050343676,0.0036450548,0.08051969,0.0076969867,0.52427536],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909484,0.00022070287,0.00006476689,0.00017677981,0.00039331446,0.00004962527],"domain_scores_gemma":[0.9966388,0.0015256971,0.00015224544,0.00037126255,0.0012233643,0.00008870984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011428833,0.0019226265,0.0011451854,0.0014884617,0.00086252525,0.0021342237,0.0012601544,0.0014608831,0.40550804],"category_scores_gemma":[0.010330477,0.0006113528,0.00096045533,0.0021315687,0.0006460684,0.0025973606,0.0015049865,0.0036233447,0.20692514],"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.000017262406,0.000045171062,0.00011827523,0.00056499196,0.000010770207,0.00009352532,0.000057996476,0.002153141,0.00023539049,0.14477442,0.8064972,0.045431912],"study_design_scores_gemma":[0.000010918792,0.000012121357,0.00019361073,0.00023565111,0.00000519748,0.00021254836,0.000023270175,0.002682572,0.00022193772,0.09170145,0.9046825,0.000018275476],"about_ca_topic_score_codex":0.0029087618,"about_ca_topic_score_gemma":0.0033588107,"teacher_disagreement_score":0.40550804,"about_ca_system_score_codex":0.0018189377,"about_ca_system_score_gemma":0.002341442,"threshold_uncertainty_score":0.8479706},"labels":[],"label_agreement":null},{"id":"W4406195342","doi":"10.1016/j.trpro.2024.12.046","title":"A multi-objective optimization model of a closed-loop supply chain for supplier selection and order allocation under uncertainty: A case study of retail stores for protein products","year":2025,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Supply chain; Selection (genetic algorithm); Order (exchange); Supply chain management; Closed loop; Loop (graph theory); Computer science; Business; Operations research; Reliability engineering; Engineering; Marketing; Control engineering; Mathematics; Artificial intelligence","score_opus":0.05669124496196061,"score_gpt":0.3399467096532582,"score_spread":0.2832554646912976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406195342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20164272,0.0012365547,0.770838,0.0008801697,0.00011741102,0.00032180393,0.00066359533,0.00028827754,0.024011398],"genre_scores_gemma":[0.9685254,0.00044713225,0.02276434,0.00005717853,0.000021044438,0.00030586423,0.00018430247,0.000023897079,0.007670823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935347,0.00022595165,0.00002888807,0.00015901444,0.000112070826,0.00012057261],"domain_scores_gemma":[0.9991386,0.00049917767,0.00013256771,0.000019297458,0.00015635318,0.00005393238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011897031,0.0013556521,0.001505145,0.0009922826,0.0011693648,0.0026278682,0.0016218409,0.0031193958,0.0047116494],"category_scores_gemma":[0.0014957843,0.0008413654,0.0013405649,0.0012828894,0.0010990896,0.0012588833,0.0011339249,0.0015252511,0.000323205],"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.000026646332,0.000020223111,0.00023948881,0.000033294804,0.00001722114,0.00012371062,0.000030870808,0.9962077,0.00029204477,0.0017996966,0.00010155866,0.0011076143],"study_design_scores_gemma":[0.000009212928,0.000028249826,0.000105548956,0.0000046521996,0.000009819117,0.000009796053,0.000022087264,0.99883264,0.00006932877,0.0007854485,0.0001176644,0.0000055328433],"about_ca_topic_score_codex":0.02580367,"about_ca_topic_score_gemma":0.014655684,"teacher_disagreement_score":0.02580367,"about_ca_system_score_codex":0.0019724409,"about_ca_system_score_gemma":0.0021815265,"threshold_uncertainty_score":0.051306963},"labels":[],"label_agreement":null},{"id":"W4408768689","doi":"10.23952/asvao.7.2025.2.04","title":"($\\epsilon$-)efficiency in multicriteria fractional optimization","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Applied mathematics","score_opus":0.007701793028205242,"score_gpt":0.2458815444683947,"score_spread":0.23817975144018944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408768689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024776218,0.0008668578,0.96204454,0.0006520503,0.000066610904,0.000029807403,0.00009765888,0.000056510056,0.011409698],"genre_scores_gemma":[0.7914859,0.0021060575,0.19367974,0.00031360015,0.00017497542,0.00029785078,0.00020620132,0.00016881937,0.011566841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987935,0.00053896557,0.00009316439,0.00014974743,0.00031234667,0.00011241511],"domain_scores_gemma":[0.99782526,0.0014083887,0.00022998605,0.00021091488,0.00028051843,0.00004501352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042161206,0.00091940124,0.00097224384,0.0009666898,0.0004214556,0.0018482931,0.0006695218,0.0006671501,0.0019682138],"category_scores_gemma":[0.007197903,0.00033637462,0.0006823923,0.0008668235,0.0023236324,0.0023227956,0.0016139637,0.0012146593,0.0004641396],"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.00005768663,0.000023985729,0.0004701199,0.0001775464,0.000030259422,0.0000897795,0.0001263855,0.16955101,0.0028377138,0.7946716,0.0012236023,0.0307403],"study_design_scores_gemma":[0.00000889772,0.000049180897,0.00026706595,0.000045026678,0.000007671851,0.0000627424,0.000038650087,0.6215075,0.0022920622,0.37318608,0.0025184846,0.000016663986],"about_ca_topic_score_codex":0.00079778524,"about_ca_topic_score_gemma":0.00041050639,"teacher_disagreement_score":0.0042161206,"about_ca_system_score_codex":0.00084934634,"about_ca_system_score_gemma":0.000616501,"threshold_uncertainty_score":0.022297263},"labels":[],"label_agreement":null},{"id":"W4408768741","doi":"10.23952/asvao.7.2025.2.07","title":"Sequential approximate weak optimality conditions for robust multiobjective fractional optimization problems","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Mathematics; Applied mathematics; Multi-objective optimization; Computer science","score_opus":0.01676966989721251,"score_gpt":0.2641749552608463,"score_spread":0.24740528536363376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408768741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013974124,0.0004604256,0.9761747,0.00035127424,0.0001790436,0.00010932907,0.000119544784,0.00008322331,0.008548322],"genre_scores_gemma":[0.6550231,0.0017531038,0.32336986,0.00048184983,0.0006510713,0.0011988811,0.0006695854,0.0005995323,0.016252981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977181,0.0011437011,0.0001401064,0.0002371351,0.0005923305,0.00016867806],"domain_scores_gemma":[0.99008757,0.0073630605,0.000714166,0.0003771892,0.0012416185,0.00021638493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008048447,0.0028488312,0.0025491249,0.0023802558,0.0008676147,0.0026419782,0.0016251558,0.0021157325,0.006538029],"category_scores_gemma":[0.021117542,0.0011293606,0.001832901,0.001447903,0.0024583687,0.0036374603,0.0029719353,0.0028241244,0.00072583876],"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.0006834226,0.0001403181,0.00041562453,0.00071540906,0.00016092691,0.0002805475,0.0002684348,0.67439955,0.012370814,0.27072874,0.0030650382,0.036771186],"study_design_scores_gemma":[0.000029651523,0.00013624216,0.00011047863,0.00004061786,0.000020998305,0.000026886635,0.000029852723,0.937545,0.0018727799,0.05887193,0.0012997963,0.000015810465],"about_ca_topic_score_codex":0.0018124327,"about_ca_topic_score_gemma":0.0013629969,"teacher_disagreement_score":0.008048447,"about_ca_system_score_codex":0.0014369135,"about_ca_system_score_gemma":0.0018793527,"threshold_uncertainty_score":0.04256475},"labels":[],"label_agreement":null},{"id":"W4409361355","doi":"10.1609/aaai.v39i27.35016","title":"Constraint Optimisation Approaches for Designing Group-Living Captive Breeding Programmes","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Group (periodic table); Constraint (computer-aided design); Computer science; Engineering; Chemistry; Mechanical engineering","score_opus":0.10264776827526068,"score_gpt":0.28391618218217407,"score_spread":0.1812684139069134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0126666585,0.00067706755,0.9772922,0.0004090544,0.000052924766,0.00023605998,0.00040901444,0.00026877978,0.007988214],"genre_scores_gemma":[0.20293522,0.0009264184,0.78990024,0.00034541337,0.00006454082,0.0011203957,0.0009147429,0.00038694183,0.0034061696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983157,0.0009044339,0.0000780957,0.00027844857,0.00027894322,0.00014445584],"domain_scores_gemma":[0.994873,0.0041557928,0.00028554475,0.00015557984,0.0003802178,0.00014977757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025982216,0.0021894823,0.0010403199,0.0011839996,0.00074266957,0.0019791534,0.0024770845,0.0017393501,0.0058853803],"category_scores_gemma":[0.007915323,0.0010742069,0.0014011667,0.0017441564,0.0013019156,0.0013339925,0.0017523182,0.002166667,0.0005439812],"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.000016067159,0.00003148135,0.00045654742,0.00013796515,0.00004421548,0.00009123646,0.00006285583,0.9750949,0.0004101082,0.009479051,0.0008632404,0.013312353],"study_design_scores_gemma":[0.000016041211,0.000028831282,0.00015626557,0.00003794973,0.000016934027,0.0000273381,0.000080116544,0.9838119,0.00027270903,0.012175874,0.003366454,0.000009496131],"about_ca_topic_score_codex":0.01203086,"about_ca_topic_score_gemma":0.013057905,"teacher_disagreement_score":0.01203086,"about_ca_system_score_codex":0.001411748,"about_ca_system_score_gemma":0.0018374188,"threshold_uncertainty_score":0.023921669},"labels":[],"label_agreement":null},{"id":"W4409587611","doi":"10.1007/978-3-658-47462-1_13","title":"Quarter Management as a Method for Promoting Lively Quarter Development","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Mathematical Programming","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":"Quarter (Canadian coin); History; Archaeology","score_opus":0.01307713450703968,"score_gpt":0.25565281295074566,"score_spread":0.24257567844370598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409587611","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009517267,0.0034075787,0.12259491,0.0056980797,0.0009889245,0.000096434494,0.000074747426,0.0005748134,0.8570473],"genre_scores_gemma":[0.16529576,0.0035315966,0.077664725,0.00079463696,0.00034406202,0.00011695883,0.00008331699,0.00029475574,0.7518742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966574,0.00010274988,0.000008979195,0.000032065363,0.0001562487,0.00003433854],"domain_scores_gemma":[0.99974245,0.0000871044,0.000034913588,0.00003647033,0.00005668705,0.00004236535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006022241,0.0002989877,0.00017398984,0.0006199051,0.00079454447,0.0025482993,0.00064130547,0.0006338354,0.022029234],"category_scores_gemma":[0.0011245699,0.00018836303,0.00018809598,0.00089906255,0.00061888207,0.001750037,0.001005039,0.0012556697,0.0028704216],"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.000024462493,0.00009394475,0.00039429817,0.00010141153,0.0000048765114,0.000074740026,0.0005192931,0.0041619986,0.001559696,0.63691825,0.09277614,0.26337105],"study_design_scores_gemma":[0.0000112430025,0.000080099744,0.0014836153,0.00016293867,0.000009630682,0.0002050612,0.00091062207,0.017678764,0.002763535,0.21211004,0.76456296,0.000021528127],"about_ca_topic_score_codex":0.0011019522,"about_ca_topic_score_gemma":0.0039810785,"teacher_disagreement_score":0.022029234,"about_ca_system_score_codex":0.0010667975,"about_ca_system_score_gemma":0.0015851507,"threshold_uncertainty_score":0.07369506},"labels":[],"label_agreement":null},{"id":"W4409889871","doi":"10.1080/03155986.2025.2492739","title":"Investigation of a multi-objective fixed charge transportation problem with quantity dependent transportation cost and discount policy <i>via</i> metaheuristics","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metaheuristic; Transportation theory; Fixed charge; Mathematical optimization; Fixed cost; Computer science; Economics; Microeconomics; Mathematics; Chemistry","score_opus":0.03550530152760662,"score_gpt":0.30948186449868015,"score_spread":0.27397656297107353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409889871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24789804,0.0036398028,0.7202393,0.0021892313,0.00035781835,0.00032477456,0.0006817296,0.00029043053,0.024378937],"genre_scores_gemma":[0.8781014,0.001019784,0.11384442,0.00033797833,0.0001132375,0.00026728562,0.00027590303,0.00007724756,0.0059628086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943095,0.00025582084,0.000021800022,0.00009423597,0.00006958943,0.00012759177],"domain_scores_gemma":[0.99801505,0.0014399614,0.0002475336,0.00004564271,0.00013708003,0.000114745104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017136339,0.001485805,0.0017675615,0.001055729,0.00047722092,0.0020375757,0.0017980362,0.0030767752,0.0030876305],"category_scores_gemma":[0.0028337475,0.0007943223,0.0018183128,0.0012480613,0.00086851045,0.0011625256,0.0009222689,0.0018869163,0.00014934728],"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.000028833983,0.000041112253,0.00022032883,0.00006064679,0.00003791124,0.000061641214,0.000010353935,0.9945141,0.00014049432,0.0025980575,0.00027779303,0.0020087855],"study_design_scores_gemma":[0.0000091039765,0.00002770421,0.000071121976,0.000010116354,0.000011660366,0.0000076154984,0.000014617747,0.9990144,0.00005343586,0.00062618114,0.0001512295,0.0000027530498],"about_ca_topic_score_codex":0.01593739,"about_ca_topic_score_gemma":0.006774056,"teacher_disagreement_score":0.01593739,"about_ca_system_score_codex":0.001693892,"about_ca_system_score_gemma":0.0018236404,"threshold_uncertainty_score":0.031689227},"labels":[],"label_agreement":null},{"id":"W4410395635","doi":"10.1287/ijoc.2024.0847","title":"Solving Two-Stage Programs with Endogenous Uncertainty via Random Variable Transformation","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Transformation (genetics); Stage (stratigraphy); Variable (mathematics); Mathematical optimization; Computer science; Mathematics; Random variable; Statistics","score_opus":0.013117761027357658,"score_gpt":0.22978674724366924,"score_spread":0.2166689862163116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410395635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043555233,0.0000835688,0.99408084,0.00013382724,0.000012687213,0.000036742596,0.000033023352,0.00008961725,0.0011741406],"genre_scores_gemma":[0.42620635,0.000461968,0.5664039,0.00021798602,0.000074432486,0.0006349786,0.00026711312,0.00021087326,0.0055223648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981775,0.00085202575,0.000063759544,0.00035310147,0.00035424353,0.0001992886],"domain_scores_gemma":[0.9944998,0.0045318957,0.0003703248,0.0001662322,0.00032843364,0.00010333687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905501,0.0012328529,0.0013737248,0.00071848225,0.00044679575,0.001333664,0.0013497048,0.0013146682,0.0036468685],"category_scores_gemma":[0.006169363,0.0007008901,0.0019980548,0.00096664473,0.0013524462,0.0015170671,0.0016671212,0.002825406,0.0003414065],"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.00002683742,0.000036293095,0.00023244211,0.00006594004,0.000025676673,0.000051927007,0.000038025297,0.95956486,0.0005188006,0.027055819,0.00043620155,0.011947182],"study_design_scores_gemma":[0.000006230994,0.000013990581,0.000026839341,0.0000043252353,0.000004482332,0.000006535116,0.000005279393,0.99054235,0.000248281,0.008863068,0.00027504985,0.0000034401435],"about_ca_topic_score_codex":0.004279716,"about_ca_topic_score_gemma":0.0032884628,"teacher_disagreement_score":0.004279716,"about_ca_system_score_codex":0.0014894253,"about_ca_system_score_gemma":0.0022266803,"threshold_uncertainty_score":0.015365958},"labels":[],"label_agreement":null},{"id":"W4411325846","doi":"10.18280/mmep.120533","title":"Enhancing Strategic Management Through Linear Programming: A Comparative Study Involving Doolittle’s and Simplex Methods","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simplex algorithm; Linear programming; Simplex; Computer science; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.06705940661398704,"score_gpt":0.32169063291800426,"score_spread":0.25463122630401724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411325846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083664164,0.0058715004,0.84173095,0.0011268368,0.000085365886,0.00027510387,0.000065593515,0.0001350134,0.06704542],"genre_scores_gemma":[0.66050434,0.0060649267,0.32886368,0.00017260206,0.000049752834,0.00026534754,0.00006056857,0.000086407315,0.003932335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939004,0.0045092506,0.00010260624,0.0001739399,0.0010933002,0.00022045468],"domain_scores_gemma":[0.98701745,0.011210823,0.0003501116,0.00026783303,0.0009716769,0.00018206265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005999963,0.00092959614,0.0010097725,0.0023242636,0.00060099154,0.0027494403,0.0009974474,0.001077673,0.0029247093],"category_scores_gemma":[0.011686134,0.0003225807,0.0007705615,0.003487096,0.0010217801,0.0025980277,0.001567629,0.0014129471,0.00035613973],"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.0002996248,0.00036193305,0.0014132468,0.00081443903,0.00012006848,0.00008022035,0.0006043166,0.6057575,0.0007650582,0.13994135,0.0012608006,0.24858142],"study_design_scores_gemma":[0.00002530904,0.00035859126,0.0003991859,0.000116482006,0.000035538047,0.00003791049,0.00047266448,0.96915644,0.000983903,0.023667222,0.0047137057,0.000033166136],"about_ca_topic_score_codex":0.0055256006,"about_ca_topic_score_gemma":0.0058106915,"teacher_disagreement_score":0.005999963,"about_ca_system_score_codex":0.0025049532,"about_ca_system_score_gemma":0.0023132171,"threshold_uncertainty_score":0.031731248},"labels":[],"label_agreement":null},{"id":"W4412319399","doi":"","title":"Iterated local search and record-to-record travel applied to the fixed charge transportation problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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":"Toronto Metropolitan University","funders":"","keywords":"Fixed charge; Iterated function; Charge (physics); Iterated local search; Computer science; Geography; Mathematics; Local search (optimization); Physics; Algorithm; Chemical physics; Quantum mechanics","score_opus":0.024962579303539616,"score_gpt":0.215158200266429,"score_spread":0.1901956209628894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412319399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101659335,0.0010462111,0.88501674,0.00040287033,0.00006487504,0.00019123121,0.000108131106,0.00061851647,0.010892079],"genre_scores_gemma":[0.64243674,0.000618013,0.35265893,0.00012154772,0.00005349928,0.00038565573,0.00017652346,0.00013465696,0.003414348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916553,0.000485274,0.000028999439,0.00008534227,0.00014513888,0.00008974535],"domain_scores_gemma":[0.9982089,0.0012929847,0.00018733591,0.000111250054,0.00012538767,0.00007419125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010798336,0.0007796279,0.0013174936,0.0008026085,0.0005192959,0.0007528422,0.0017796931,0.0011061882,0.002439356],"category_scores_gemma":[0.0036743903,0.00035633738,0.0009614542,0.0014051741,0.00073395605,0.0009929447,0.00089963234,0.00094117963,0.00032171217],"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.00010234102,0.00011337478,0.00038657332,0.00013443317,0.00005736991,0.00011234326,0.00009646304,0.946379,0.0011435922,0.012006131,0.0012408545,0.038227472],"study_design_scores_gemma":[0.00003770014,0.00008542452,0.000106017396,0.00000968013,0.000023937446,0.000034805074,0.00002108992,0.9951839,0.0006309695,0.0032698945,0.00058748183,0.000009024698],"about_ca_topic_score_codex":0.0060949214,"about_ca_topic_score_gemma":0.0046427404,"teacher_disagreement_score":0.0060949214,"about_ca_system_score_codex":0.00090304145,"about_ca_system_score_gemma":0.0010772044,"threshold_uncertainty_score":0.012118936},"labels":[],"label_agreement":null},{"id":"W4412767618","doi":"10.23952/jano.7.2025.2.05","title":"Sequential approximate solutions for robust fractional optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Applied mathematics; Mathematics; Computer science","score_opus":0.018128478474513612,"score_gpt":0.23547929365608897,"score_spread":0.21735081518157534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018095134,0.00009916298,0.9784279,0.000116796524,0.000017974453,0.000025973515,0.000024157142,0.00003097487,0.0031619582],"genre_scores_gemma":[0.73889846,0.00046220885,0.25485328,0.00012940224,0.00006767688,0.00025623792,0.00013438184,0.0000907885,0.005107623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922276,0.00030517246,0.00005242029,0.00009160379,0.0002717508,0.00005639156],"domain_scores_gemma":[0.99858034,0.0008224549,0.00023302308,0.00011146512,0.00021260542,0.00004008128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018779151,0.0007346334,0.0008298797,0.0005758936,0.00036301618,0.0008208878,0.00046911646,0.0007385594,0.0027675668],"category_scores_gemma":[0.0053883004,0.00034295226,0.0006286372,0.00053045695,0.0011999798,0.0013446292,0.0013536059,0.00092141517,0.00029637304],"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.00011151584,0.000040264295,0.00047319103,0.00016913081,0.000039246857,0.00015514647,0.00012419485,0.5192259,0.012056872,0.43777236,0.0007169229,0.029115321],"study_design_scores_gemma":[0.000011333286,0.00006667209,0.0000872943,0.000013284661,0.0000053661724,0.000030970616,0.00001690424,0.91904014,0.0027933978,0.07666702,0.0012616366,0.0000060018324],"about_ca_topic_score_codex":0.0008754728,"about_ca_topic_score_gemma":0.00082332024,"teacher_disagreement_score":0.0027675668,"about_ca_system_score_codex":0.0006786553,"about_ca_system_score_gemma":0.0008763324,"threshold_uncertainty_score":0.009931505},"labels":[],"label_agreement":null},{"id":"W4413391696","doi":"10.1134/s199508022560623x","title":"A Comprehensive Study of Mellin’s Transformation on Diverse Fuzzy Numbers with Applications of Optimizing Production Planning","year":2025,"lang":"en","type":"article","venue":"Lobachevskii Journal of Mathematics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Transformation (genetics); Fuzzy logic; Production (economics); Algebra over a field; Arithmetic; Production planning; Pure mathematics; Artificial intelligence; Computer science","score_opus":0.021695922100418267,"score_gpt":0.2717170929021405,"score_spread":0.25002117080172226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413391696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015260218,0.005250122,0.95191866,0.0007234024,0.00024748643,0.000041467625,0.00004376727,0.00004582197,0.026469015],"genre_scores_gemma":[0.5751306,0.009730257,0.40071368,0.0002978181,0.0004923986,0.00010134626,0.00010010776,0.00006361204,0.01337017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956924,0.00015094092,0.000030151932,0.000075856755,0.0001512467,0.000022570868],"domain_scores_gemma":[0.99966276,0.00018531593,0.000030401116,0.000028981349,0.000080513346,0.000011968451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007970595,0.0004999881,0.00039124,0.00084737845,0.00055095286,0.0008835109,0.00034665325,0.00039039037,0.0014817662],"category_scores_gemma":[0.0019161399,0.00016031362,0.0006268014,0.001362241,0.0010086044,0.0016674855,0.00046470357,0.0011055566,0.00028423517],"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.000045882138,0.000033501216,0.0006079767,0.0003054259,0.00003108991,0.00024246085,0.00039903124,0.073389694,0.006572244,0.6886084,0.0024143592,0.22734997],"study_design_scores_gemma":[0.000008423177,0.00014719107,0.0012695484,0.000114006834,0.000034954108,0.00050725957,0.00020071899,0.39972612,0.008745418,0.522749,0.06643217,0.000065133136],"about_ca_topic_score_codex":0.0014880331,"about_ca_topic_score_gemma":0.00095660693,"teacher_disagreement_score":0.0014880331,"about_ca_system_score_codex":0.0007357124,"about_ca_system_score_gemma":0.00054735405,"threshold_uncertainty_score":0.005338013},"labels":[],"label_agreement":null},{"id":"W4413872449","doi":"10.5267/j.ijiec.2025.6.011","title":"Sugar beet transportation problem under growers’ equity regulations: Metaheuristic approach","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metaheuristic; Sugar beet; Equity (law); Sugar; Business; Economics; Chemistry; Mathematical optimization; Mathematics; Biochemistry; Agronomy; Biology","score_opus":0.03607868472909945,"score_gpt":0.28366096579137917,"score_spread":0.24758228106227972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1442136,0.0025959746,0.8328093,0.0012449869,0.0001496464,0.00035619366,0.0004969392,0.00026149346,0.017871795],"genre_scores_gemma":[0.7650666,0.0017059532,0.2245417,0.00032997943,0.00013489624,0.0005154904,0.000615054,0.00008792996,0.007002367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958557,0.00016914276,0.000015348243,0.00007692616,0.000055714732,0.00009727383],"domain_scores_gemma":[0.99941266,0.0003787939,0.00009225195,0.000019859765,0.000049213708,0.000047288206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009124429,0.0012825778,0.0013276872,0.0009302913,0.0004310491,0.0014935597,0.0014121864,0.001925531,0.002042683],"category_scores_gemma":[0.0014450351,0.0005610216,0.001280865,0.0013605477,0.00053571694,0.0008504546,0.0008243462,0.001089689,0.0001487393],"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.00002783557,0.000036299894,0.000276053,0.000048391204,0.000028373996,0.00008262168,0.00001788611,0.99007237,0.00025834364,0.0042645084,0.00037582897,0.0045114383],"study_design_scores_gemma":[0.00001449887,0.000025195342,0.00009111213,0.000013323894,0.000013587292,0.000016925598,0.000030839667,0.9962882,0.00011498107,0.0029511694,0.00043617992,0.0000040319733],"about_ca_topic_score_codex":0.007887856,"about_ca_topic_score_gemma":0.0053458186,"teacher_disagreement_score":0.007887856,"about_ca_system_score_codex":0.0012536854,"about_ca_system_score_gemma":0.001503001,"threshold_uncertainty_score":0.01568389},"labels":[],"label_agreement":null},{"id":"W4414748284","doi":"10.1038/s41598-025-17604-y","title":"An integrated TOPSIS and ARAS method multi-criteria decision-making approach for optimizing investment portfolios using goal programming and genetic algorithm model","year":2025,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sharpe ratio; TOPSIS; Portfolio; Efficient frontier; Portfolio optimization; Asset allocation; Probabilistic logic; Project portfolio management; Investment strategy; Genetic algorithm","score_opus":0.025719695037178827,"score_gpt":0.3299792510054088,"score_spread":0.30425955596823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414748284","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037543057,0.0002116754,0.9915193,0.0001443962,0.000028544775,0.00012550649,0.000057399553,0.0003220872,0.0038367922],"genre_scores_gemma":[0.20618503,0.00039134585,0.78966534,0.00011387717,0.000040042258,0.0005715836,0.00020972961,0.00007665253,0.0027464232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697256,0.0013216048,0.00018312976,0.00033957418,0.001055697,0.00012734166],"domain_scores_gemma":[0.9988411,0.00054991397,0.00011959806,0.00006737439,0.0003723687,0.000049781862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00324175,0.0017243475,0.001466004,0.002781524,0.0007076946,0.0025143165,0.0017663176,0.0010335787,0.003688063],"category_scores_gemma":[0.0029719593,0.00064950256,0.0023709056,0.0024348393,0.00060472323,0.0012817852,0.0015334418,0.0015399605,0.00077774393],"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.00008602047,0.00015009863,0.0012493037,0.0005330774,0.00045818093,0.00023233457,0.00027935038,0.69337136,0.0042069573,0.044953905,0.0026442793,0.25183517],"study_design_scores_gemma":[0.00001618908,0.00010132738,0.00024285879,0.000043422508,0.000054818687,0.00005869549,0.000054938482,0.9808998,0.0008881305,0.014977503,0.0026382108,0.000024190404],"about_ca_topic_score_codex":0.005069429,"about_ca_topic_score_gemma":0.0049048425,"teacher_disagreement_score":0.005069429,"about_ca_system_score_codex":0.0013743436,"about_ca_system_score_gemma":0.0024663247,"threshold_uncertainty_score":0.017144203},"labels":[],"label_agreement":null},{"id":"W4415046543","doi":"10.32920/30329818.v1","title":"Mathematics for Public and Occupational Health Professionals: 2nd Edition","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Mathematical Programming","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":"Public health; Metropolitan area; Occupational safety and health; Key (lock); Health professionals","score_opus":0.0610590105641526,"score_gpt":0.3461992853952491,"score_spread":0.2851402748310965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415046543","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031247244,0.11572549,0.0856598,0.02349372,0.017815227,0.00015380887,0.0058527715,0.0033407118,0.7448338],"genre_scores_gemma":[0.043865215,0.08282096,0.05249177,0.004553564,0.0095274765,0.00048578845,0.006183946,0.002873562,0.79719776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943155,0.00009221745,0.00005122835,0.00009582223,0.0002855147,0.000043661337],"domain_scores_gemma":[0.9988966,0.0004006546,0.00007661157,0.00015819125,0.00038947363,0.00007847467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074468896,0.0014588222,0.001021132,0.0020938343,0.0006141002,0.003659478,0.0008574966,0.0009140382,0.084319964],"category_scores_gemma":[0.0036368836,0.0005688841,0.0006994921,0.0023240014,0.0013333338,0.003357483,0.0013264398,0.0031137278,0.055701286],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020056703,0.00003160542,0.00017626441,0.00042416173,0.000009060599,0.00006299952,0.00037649224,0.0008126649,0.00072008005,0.13365552,0.69448215,0.16922891],"study_design_scores_gemma":[0.0000039987076,0.000010657446,0.00040612274,0.00019373295,0.0000033393221,0.0001396639,0.00007146952,0.00032839912,0.00012487017,0.06632499,0.9323848,0.000008016525],"about_ca_topic_score_codex":0.0014084163,"about_ca_topic_score_gemma":0.0014073149,"teacher_disagreement_score":0.084319964,"about_ca_system_score_codex":0.0013886569,"about_ca_system_score_gemma":0.0015785896,"threshold_uncertainty_score":0.2820784},"labels":[],"label_agreement":null},{"id":"W4415046600","doi":"10.32920/30329818","title":"Mathematics for Public and Occupational Health Professionals: 2nd Edition","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Mathematical Programming","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":"Public health; Metropolitan area; Occupational safety and health; Key (lock); Health professionals","score_opus":0.0610590105641526,"score_gpt":0.3461992853952491,"score_spread":0.2851402748310965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415046600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031247244,0.11572549,0.0856598,0.02349372,0.017815227,0.00015380887,0.0058527715,0.0033407118,0.7448338],"genre_scores_gemma":[0.043865215,0.08282096,0.05249177,0.004553564,0.0095274765,0.00048578845,0.006183946,0.002873562,0.79719776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943155,0.00009221745,0.00005122835,0.00009582223,0.0002855147,0.000043661337],"domain_scores_gemma":[0.9988966,0.0004006546,0.00007661157,0.00015819125,0.00038947363,0.00007847467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074468896,0.0014588222,0.001021132,0.0020938343,0.0006141002,0.003659478,0.0008574966,0.0009140382,0.084319964],"category_scores_gemma":[0.0036368836,0.0005688841,0.0006994921,0.0023240014,0.0013333338,0.003357483,0.0013264398,0.0031137278,0.055701286],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020056703,0.00003160542,0.00017626441,0.00042416173,0.000009060599,0.00006299952,0.00037649224,0.0008126649,0.00072008005,0.13365552,0.69448215,0.16922891],"study_design_scores_gemma":[0.0000039987076,0.000010657446,0.00040612274,0.00019373295,0.0000033393221,0.0001396639,0.00007146952,0.00032839912,0.00012487017,0.06632499,0.9323848,0.000008016525],"about_ca_topic_score_codex":0.0014084163,"about_ca_topic_score_gemma":0.0014073149,"teacher_disagreement_score":0.084319964,"about_ca_system_score_codex":0.0013886569,"about_ca_system_score_gemma":0.0015785896,"threshold_uncertainty_score":0.2820784},"labels":[],"label_agreement":null},{"id":"W4415305391","doi":"10.1016/j.nlp.2025.100185","title":"OPT2CODE: A retrieval-augmented framework for solving linear programming problems","year":2025,"lang":"en","type":"article","venue":"Natural Language Processing Journal","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Executable; Solver; Code generation; Domain (mathematical analysis); Benchmark (surveying); Code (set theory); Linear programming; Integer programming","score_opus":0.00951167119287442,"score_gpt":0.2937268453066785,"score_spread":0.28421517411380404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415305391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036419027,0.0008542587,0.8427414,0.0009306631,0.00020339187,0.00035681034,0.004854557,0.13802145,0.008395522],"genre_scores_gemma":[0.037548613,0.00049248105,0.9209999,0.000721056,0.00006467966,0.0008170121,0.017892739,0.01694902,0.0045144423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976102,0.0008321226,0.00022498089,0.00036913034,0.0007804748,0.00018298633],"domain_scores_gemma":[0.9965,0.0018647249,0.00022158783,0.00079376664,0.0005204135,0.000099486846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025028046,0.0026353372,0.00086970505,0.001972244,0.0007859452,0.002589012,0.0037307825,0.0021973094,0.021086885],"category_scores_gemma":[0.012895295,0.0012964599,0.003004036,0.0019552547,0.0014652,0.0033021683,0.0035894713,0.0036763547,0.012815162],"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.0004130868,0.0003823355,0.0025167717,0.0026819783,0.00016664052,0.00047616014,0.00054448814,0.1691707,0.0102682365,0.078553446,0.3006889,0.43413737],"study_design_scores_gemma":[0.0003793737,0.00016442577,0.00044116488,0.0002334616,0.00004105955,0.00030987535,0.000114059854,0.7660335,0.0112209255,0.06189004,0.15908025,0.00009187772],"about_ca_topic_score_codex":0.007243221,"about_ca_topic_score_gemma":0.01604936,"teacher_disagreement_score":0.021086885,"about_ca_system_score_codex":0.0016671997,"about_ca_system_score_gemma":0.004083002,"threshold_uncertainty_score":0.07054263},"labels":[],"label_agreement":null},{"id":"W4415471266","doi":"10.1080/03155986.2025.2567173","title":"Fair cost savings allocation in two-stage fixed-cost transportation problem","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cost allocation; Production (economics); Quality (philosophy); Work (physics)","score_opus":0.03189441970223946,"score_gpt":0.34143389214367287,"score_spread":0.3095394724414334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415471266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13058771,0.00052359235,0.8565465,0.00093440484,0.00011494269,0.00035572407,0.00064181886,0.00020601359,0.010089244],"genre_scores_gemma":[0.8519077,0.00031459602,0.14167857,0.00017939661,0.00005501267,0.00041710283,0.0005302069,0.00010091579,0.0048164595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792695,0.00095916475,0.00007038575,0.00041035545,0.00023440112,0.00039872937],"domain_scores_gemma":[0.99697065,0.001981176,0.00024021912,0.00022030338,0.00028083095,0.0003068502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003183187,0.0013199445,0.0015919656,0.0008801813,0.000767631,0.0019659942,0.0024928784,0.0018630525,0.0045360667],"category_scores_gemma":[0.005721576,0.00050734467,0.0014313161,0.0012464776,0.0012128795,0.0028403427,0.0013935202,0.0015141404,0.00026244344],"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.00019653125,0.00011492903,0.0006991321,0.00013204706,0.00006645071,0.00014233481,0.00007875053,0.9338313,0.0007188027,0.048867952,0.0018859239,0.013265899],"study_design_scores_gemma":[0.000027045227,0.000051137897,0.0001825775,0.000012414511,0.00001775028,0.0000305799,0.00003898158,0.9736883,0.00030160387,0.024861312,0.0007788587,0.000009552574],"about_ca_topic_score_codex":0.00819917,"about_ca_topic_score_gemma":0.005388231,"teacher_disagreement_score":0.00819917,"about_ca_system_score_codex":0.0029412517,"about_ca_system_score_gemma":0.0027415832,"threshold_uncertainty_score":0.02134037},"labels":[],"label_agreement":null},{"id":"W4416045513","doi":"10.11591/ijece.v15i6.pp5708-5716","title":"Computational modelling under uncertainty: statistical mean approach to optimize fuzzy multi-objective linear programming problem with trapezoidal numbers","year":2025,"lang":"","type":"article","venue":"International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering","topic":"Optimization and Mathematical Programming","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":"Algoma University","funders":"","keywords":"Fuzzy logic; Robustness (evolution); Ranking (information retrieval); Linear programming; Fuzzy number; Software; Statistical model","score_opus":0.007173021181386305,"score_gpt":0.23749753314871916,"score_spread":0.23032451196733286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416045513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025177451,0.00020034541,0.9955023,0.00010586499,0.000022805561,0.00001329392,0.000010223781,0.000031323278,0.0015961647],"genre_scores_gemma":[0.45380864,0.0009967317,0.5424186,0.0001722841,0.00010792672,0.00027168222,0.00006865711,0.00008799553,0.0020674258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988545,0.00060518034,0.000046018053,0.0001101037,0.00032987684,0.000054376727],"domain_scores_gemma":[0.9986304,0.0009901093,0.0001227767,0.00006324657,0.00016213556,0.0000314093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021713285,0.001040555,0.0012266611,0.0007689082,0.00051358895,0.0015941535,0.001126969,0.00096378464,0.0011086299],"category_scores_gemma":[0.0036821684,0.00052200234,0.0013128895,0.001068176,0.00087994954,0.0013867478,0.0011071671,0.0015393815,0.0001936357],"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.000012037306,0.000008471702,0.000112456866,0.000059098635,0.000031146617,0.000027963857,0.000032684333,0.95515317,0.00042372834,0.032750804,0.0002635168,0.011124888],"study_design_scores_gemma":[0.0000016383863,0.000011957489,0.000017311253,0.000007287069,0.0000043223977,0.0000061364094,0.0000061470105,0.98883384,0.00012771635,0.010654811,0.00032493524,0.0000038123314],"about_ca_topic_score_codex":0.0023385754,"about_ca_topic_score_gemma":0.002359278,"teacher_disagreement_score":0.0023385754,"about_ca_system_score_codex":0.00086749566,"about_ca_system_score_gemma":0.0014562919,"threshold_uncertainty_score":0.011483192},"labels":[],"label_agreement":null},{"id":"W6912433229","doi":"10.5281/zenodo.3951375","title":"Optimized Capacity Management Drives Financial Clusters Approach to Linear Programming","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Mathematical Programming","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":"Linear programming; Variety (cybernetics); Cluster analysis; Financial management; Resource (disambiguation); Joint (building); Capital (architecture); Working capital","score_opus":0.04029277569668747,"score_gpt":0.2227012467252502,"score_spread":0.18240847102856275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912433229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007788524,0.00029109415,0.97803485,0.00056231493,0.00004568119,0.0000465708,0.00010979614,0.00010015346,0.013020952],"genre_scores_gemma":[0.6209575,0.0012244331,0.34764948,0.00040010663,0.00020719694,0.0007303772,0.00039945738,0.00033006267,0.028101418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999231,0.00038498163,0.000017957882,0.00012032844,0.00015456078,0.000091053735],"domain_scores_gemma":[0.99900717,0.0007245895,0.00007307915,0.0000334309,0.00012825019,0.000033495493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153525,0.0012511594,0.0009790788,0.00072851893,0.0005844112,0.0017535682,0.0012831923,0.001130872,0.0040129493],"category_scores_gemma":[0.0025291713,0.00075526634,0.0009471334,0.0010947739,0.001060271,0.0012335735,0.0012808442,0.0021437919,0.0004404408],"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.000008430168,0.00001767173,0.00011033462,0.000034781093,0.000013113429,0.00002010282,0.000021737678,0.9551236,0.0001229703,0.039220233,0.0006971873,0.0046098744],"study_design_scores_gemma":[0.0000020099137,0.0000063251714,0.000022873728,0.00000459142,0.0000022190397,0.0000037153634,0.000009972514,0.98416096,0.00007322357,0.0151651325,0.00054587336,0.0000031693805],"about_ca_topic_score_codex":0.009683793,"about_ca_topic_score_gemma":0.006902812,"teacher_disagreement_score":0.009683793,"about_ca_system_score_codex":0.0018937789,"about_ca_system_score_gemma":0.0018181526,"threshold_uncertainty_score":0.019254863},"labels":[],"label_agreement":null},{"id":"W6924753322","doi":"10.15468/dl.mgazbm","title":"Occurrence Download","year":2024,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Optimization and Mathematical Programming","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":"Download; Matching (statistics); Range (aeronautics); Biodiversity; Data set","score_opus":0.011186326228513996,"score_gpt":0.20789230451682578,"score_spread":0.19670597828831177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924753322","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049943,0.00003060712,0.00006983006,0.000044012842,0.000012960056,0.00000636105,0.99832934,0.000635696,0.0008212791],"genre_scores_gemma":[0.00020905668,0.000037566577,0.0003161259,0.00005087617,0.0000036912154,0.000049193026,0.99857545,0.00021882809,0.0005390507],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989981,0.00013268416,0.00011417306,0.00034295584,0.00025145672,0.00016068324],"domain_scores_gemma":[0.997928,0.0005644902,0.00016116025,0.00057164335,0.00054944056,0.00022519125],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093918835,0.0020484126,0.0015504557,0.0041598827,0.0010503097,0.0026500116,0.003011782,0.0022448099,0.15591948],"category_scores_gemma":[0.006039788,0.000919001,0.0012722331,0.008357245,0.00046291237,0.0023658087,0.002631022,0.0021456787,0.22703354],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027171473,0.000011730231,0.00034170126,0.00042128435,0.000012297925,0.000013454164,0.000018586588,0.00015552611,0.00009803775,0.00041720975,0.9970318,0.0014512273],"study_design_scores_gemma":[0.00008171317,0.0000079145775,0.0014663659,0.00017331062,0.000012293916,0.0000371827,0.00007276049,0.00026049078,0.00021821872,0.001086158,0.99656516,0.00001851563],"about_ca_topic_score_codex":0.024515914,"about_ca_topic_score_gemma":0.04219558,"teacher_disagreement_score":0.8440805,"about_ca_system_score_codex":0.0018137178,"about_ca_system_score_gemma":0.0023707377,"threshold_uncertainty_score":0.52160263},"labels":[],"label_agreement":null},{"id":"W6944928001","doi":"10.21348/p.1970.0007","title":"PROGRESS REPORT FOR NORSAR PHASE 3 COVERING 3rd QUARTER 1970* STATUS PER 30 SEPTEMBER 1970","year":2023,"lang":"en","type":"article","venue":"NORSAR","topic":"Optimization and Mathematical Programming","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":"Quarter (Canadian coin); Phase (matter); Period (music); Work (physics)","score_opus":0.021376047137532606,"score_gpt":0.3021821305721034,"score_spread":0.2808060834345708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944928001","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014618433,0.0150552085,0.0046236855,0.0059740427,0.023156276,0.00085934374,0.037099443,0.0029461675,0.89566743],"genre_scores_gemma":[0.010384762,0.004396012,0.0012510194,0.00026528418,0.0012716978,0.00013975815,0.009168305,0.00056579977,0.97255725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991985,0.000080036094,0.00003132319,0.000087890796,0.00038458948,0.00021760692],"domain_scores_gemma":[0.9981554,0.00019076024,0.00009380879,0.00014287444,0.00096027774,0.00045694062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017545884,0.0013254117,0.0013480546,0.0027883216,0.0016330641,0.0029736934,0.0014416827,0.0013582736,0.27026564],"category_scores_gemma":[0.0016035135,0.00038313837,0.00075757445,0.002201999,0.00050856476,0.0014952972,0.0013014545,0.0012231913,0.15270932],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013757813,0.00019707748,0.00083857076,0.00044007727,0.000020015876,0.00009967419,0.00006522309,0.0006559077,0.0017726811,0.0038251663,0.9119427,0.07876706],"study_design_scores_gemma":[0.00007031321,0.00025853212,0.002976708,0.000078033874,0.000020791604,0.000049530343,0.000067436406,0.00033057018,0.0020819134,0.0006027774,0.9934534,0.000010043975],"about_ca_topic_score_codex":0.016786026,"about_ca_topic_score_gemma":0.026737565,"teacher_disagreement_score":0.27026564,"about_ca_system_score_codex":0.0016680873,"about_ca_system_score_gemma":0.0069137258,"threshold_uncertainty_score":0.9041286},"labels":[],"label_agreement":null},{"id":"W6968941111","doi":"10.5281/zenodo.3264656","title":"Know Your Enemy: The Risk of Unauthorized Access in Smartphones by Insiders","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nucleofection; TSG101; Gestational period; Hyporeflexia; Diafiltration; Proteogenomics; Dysgeusia; Tubulopathy; Articular cartilage damage","score_opus":0.026220971247054154,"score_gpt":0.24131211029173555,"score_spread":0.21509113904468138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968941111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98827374,0.00030566668,0.0071981107,0.0012233701,0.000014032107,0.000018389881,0.000035697107,0.000011910792,0.0029189668],"genre_scores_gemma":[0.9993068,0.00008912743,0.0003968365,0.00004625625,0.0000071540976,0.0000027455403,0.0000075800363,0.0000014553683,0.00014199069],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99681866,0.0021605287,0.000110638255,0.0001983872,0.00049631036,0.00021544856],"domain_scores_gemma":[0.96162015,0.025290659,0.009241933,0.002128315,0.0010727436,0.00064624636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824515,0.00029542457,0.00031940936,0.00055844185,0.0005448023,0.0012571729,0.00034005486,0.00091639446,0.0014159908],"category_scores_gemma":[0.026386095,0.0002329912,0.00037123324,0.00029326015,0.0012578795,0.0020475453,0.0014459491,0.0010946128,0.00016249993],"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.00087021,0.00035698366,0.8793238,0.00023080403,0.00030378948,0.0028946288,0.013575842,0.021981,0.00452962,0.013172532,0.001973973,0.06078685],"study_design_scores_gemma":[0.000050262148,0.0017076316,0.7221286,0.00042756696,0.00060143665,0.011912224,0.036987018,0.18459176,0.0073317653,0.027006699,0.0069838404,0.0002711671],"about_ca_topic_score_codex":0.0016983423,"about_ca_topic_score_gemma":0.0012216228,"teacher_disagreement_score":0.002824515,"about_ca_system_score_codex":0.00038602093,"about_ca_system_score_gemma":0.00026097774,"threshold_uncertainty_score":0.014937639},"labels":[],"label_agreement":null},{"id":"W6991091283","doi":"","title":"Examining the relationship between motivation and the physical activity behaviour of Canadian youth with physical disabilities","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","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":"Physical activity; Action (physics); Qualitative research; Motor activity","score_opus":0.07339739516167143,"score_gpt":0.2422343964326275,"score_spread":0.16883700127095608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991091283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99768853,0.00022343014,0.000040688137,0.00037992434,0.000008131793,0.00001297671,0.0002931407,0.0000015755182,0.0013516352],"genre_scores_gemma":[0.9984043,0.00026846668,0.000118899945,0.000051313757,0.0000043917885,0.000015921461,0.0002564851,0.0000019630843,0.0008782178],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998569,0.00014140645,0.000047419733,0.00012299226,0.0003782427,0.0007410461],"domain_scores_gemma":[0.99582577,0.00058342784,0.0006782885,0.000081207334,0.0016164461,0.0012148055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020455876,0.00040743014,0.00052909076,0.0015479686,0.0037784493,0.0023395247,0.0014076513,0.0008414994,0.0023300692],"category_scores_gemma":[0.0075087827,0.00035887465,0.00097333,0.0033362443,0.001024486,0.0004890556,0.0013400179,0.0018732741,0.0001722096],"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.000055245444,0.00019615091,0.990191,0.000020754616,0.000039781633,0.00003644654,0.002967271,0.00021667744,0.00004813523,0.00042801502,0.00059710484,0.0052034585],"study_design_scores_gemma":[0.000004109429,0.000028875127,0.9932546,0.000030397887,0.000026039077,0.0000116947895,0.0054093027,0.0004146685,0.000025810903,0.000059711914,0.00072570774,0.000009032561],"about_ca_topic_score_codex":0.99494725,"about_ca_topic_score_gemma":0.9961565,"teacher_disagreement_score":0.03448945,"about_ca_system_score_codex":0.03448945,"about_ca_system_score_gemma":0.056204084,"threshold_uncertainty_score":0.25023967},"labels":[],"label_agreement":null},{"id":"W7006961595","doi":"","title":"What Happened to Jodi Henrickson? (BC)","year":2019,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Optimization and Mathematical Programming","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":"Cash; Homicide; Popular culture","score_opus":0.005378458706926196,"score_gpt":0.18200135132152157,"score_spread":0.17662289261459538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006961595","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01597002,0.0064432225,0.00024597542,0.24330066,0.025748018,0.00020265287,0.0033857268,0.0003190072,0.7043848],"genre_scores_gemma":[0.035953514,0.0031738516,0.00014808176,0.054271642,0.0014609097,0.000101404126,0.00095358404,0.00018906793,0.90374804],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996087,0.00003656149,0.000011674013,0.000063582745,0.000090523616,0.00018892038],"domain_scores_gemma":[0.9990969,0.000028905259,0.000033720622,0.000017064336,0.00025497237,0.0005684747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027687842,0.00039171806,0.0003184671,0.00045940554,0.0074469065,0.0029224604,0.000728639,0.0030174633,0.19575189],"category_scores_gemma":[0.0018149647,0.00029812724,0.00019721623,0.00051482755,0.0005490941,0.0017004552,0.0021184667,0.0046880036,0.042939186],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001248501,0.0000123523905,0.0006414285,0.0000217714,0.0000011934345,0.00054474926,0.00062598067,0.0000054192424,0.00004369082,0.00040077738,0.99063194,0.0070581464],"study_design_scores_gemma":[0.0000053010954,0.00001320988,0.0036584344,0.00015526163,0.0000026530247,0.0005996546,0.005429365,0.000018195973,0.00010351132,0.00019904834,0.9898073,0.0000080171885],"about_ca_topic_score_codex":0.21041512,"about_ca_topic_score_gemma":0.46601105,"teacher_disagreement_score":0.7895849,"about_ca_system_score_codex":0.005296139,"about_ca_system_score_gemma":0.0037483147,"threshold_uncertainty_score":0.6548553},"labels":[],"label_agreement":null},{"id":"W7036884093","doi":"","title":"DeKalb News Update – October 2024 (Voting in the Nov. 5 General Election)","year":2024,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Optimization and Mathematical Programming","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":"Voting; Event (particle physics); Quarter (Canadian coin); Block (permutation group theory); Channel (broadcasting); Commission","score_opus":0.01005876488084718,"score_gpt":0.23755008986810505,"score_spread":0.22749132498725788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036884093","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019120678,0.0008347324,0.0007438154,0.0031515018,0.0032056842,0.000107930384,0.013779937,0.0007999541,0.97546434],"genre_scores_gemma":[0.0045341393,0.00033594863,0.00044374392,0.00048314597,0.0002329593,0.000056655717,0.0054043275,0.00041087283,0.9880982],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996655,0.000034197226,0.000008908212,0.000043017135,0.00017064776,0.00007764958],"domain_scores_gemma":[0.99960715,0.000044657296,0.000019728193,0.00002772036,0.00018520263,0.00011548278],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054753514,0.00043769873,0.00028039806,0.0007040986,0.0013600003,0.0026968457,0.00063748827,0.0010392799,0.40069243],"category_scores_gemma":[0.0014919093,0.0002782712,0.00022321621,0.00063591445,0.00018967634,0.00085086236,0.00096517865,0.001474166,0.27681595],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019639478,0.000010861039,0.000079504236,0.000018888828,5.7835763e-7,0.0000172127,0.000013469275,0.00003613631,0.00009123973,0.001197258,0.9857497,0.012765431],"study_design_scores_gemma":[0.000004680422,0.0000061137484,0.0007333935,0.000018866256,6.3496543e-7,0.000009987814,0.00002758881,0.00006255292,0.000079314545,0.00018448642,0.9988697,0.0000025766844],"about_ca_topic_score_codex":0.027735002,"about_ca_topic_score_gemma":0.09115792,"teacher_disagreement_score":0.59930754,"about_ca_system_score_codex":0.0015123197,"about_ca_system_score_gemma":0.0013388648,"threshold_uncertainty_score":0.8548395},"labels":[],"label_agreement":null},{"id":"W7084128316","doi":"10.7758/bwmi8829.7504","title":"Chapter 3. Fiscal Subordination Fallout: Prince George’s County’s Fiscal Year 2018 Budget Deliberations and Allocations","year":2025,"lang":"en","type":"book-chapter","venue":"Russell Sage Foundation eBooks","topic":"Optimization and Mathematical Programming","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":"Fiscal year; Subordination (linguistics); Fiscal policy; Government (linguistics); Period (music)","score_opus":0.01053902369598495,"score_gpt":0.2199390761062182,"score_spread":0.20940005241023327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084128316","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003617621,0.014629865,0.0008062833,0.060404018,0.010682574,0.00008455963,0.0008051611,0.00020219115,0.90876776],"genre_scores_gemma":[0.014986872,0.004251333,0.0005334604,0.0067631407,0.0011527773,0.00008656844,0.00040790788,0.00018219628,0.9716358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926597,0.00011380228,0.000029385503,0.000067292516,0.00030843992,0.00021509855],"domain_scores_gemma":[0.9995221,0.00010862473,0.000038076323,0.000017198405,0.00016113775,0.00015283651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011796982,0.00057880575,0.00038904973,0.0010777921,0.0083059855,0.008268383,0.0010486661,0.003728931,0.06954252],"category_scores_gemma":[0.0026192276,0.00037663733,0.00038518186,0.0016364518,0.0009747326,0.0027240496,0.0022112832,0.0057396977,0.01407681],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070583724,0.000013724584,0.000090674046,0.000033403692,9.789217e-7,0.000039849678,0.0009184123,0.00006379242,0.000027897906,0.047760982,0.9338479,0.017195262],"study_design_scores_gemma":[0.0000011030878,0.0000027081994,0.00024520291,0.000093097726,7.346398e-7,0.000013643179,0.0006256476,0.000016536183,0.00002130822,0.002429867,0.9965467,0.0000035192325],"about_ca_topic_score_codex":0.09864488,"about_ca_topic_score_gemma":0.28881356,"teacher_disagreement_score":0.09864488,"about_ca_system_score_codex":0.008480787,"about_ca_system_score_gemma":0.013130363,"threshold_uncertainty_score":0.23264295},"labels":[],"label_agreement":null},{"id":"W7130696075","doi":"10.47749/t/unicamp.2025.1507167","title":"Multi-objective production strategy optimization methodology under uncertainties","year":2025,"lang":"","type":"dissertation","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Estadual de Campinas; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Energi Simulation","keywords":"Production (economics); Process (computing); Minification; Production planning; Work (physics)","score_opus":0.08312374647339024,"score_gpt":0.34062049195330757,"score_spread":0.2574967454799173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130696075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018328428,0.0012646784,0.9731827,0.00028222584,0.00004894295,0.00013842057,0.00012868154,0.0001642525,0.0064616897],"genre_scores_gemma":[0.76399845,0.0015084171,0.22788824,0.00020199748,0.000067976755,0.00080931094,0.00035254646,0.00012740477,0.005045742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999403,0.00024440148,0.000030814717,0.00008144125,0.00015925651,0.000080993785],"domain_scores_gemma":[0.99870837,0.00091078697,0.00012448175,0.00003515548,0.00017610946,0.00004508327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022109929,0.0015678438,0.0013563766,0.00101527,0.00037940175,0.0016176483,0.0011787057,0.0014999427,0.0023127405],"category_scores_gemma":[0.0025374684,0.00079780386,0.0013627172,0.00088325376,0.00074422365,0.00072256575,0.0013416193,0.0014035546,0.00026302531],"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.000007972884,0.000005864143,0.000098857534,0.000037467093,0.000017468654,0.000021579697,0.0000075144217,0.995385,0.00017092115,0.0015764415,0.00006157516,0.002609401],"study_design_scores_gemma":[0.0000033276,0.0000120515,0.000039630868,0.000008124334,0.0000050262183,0.0000037272257,0.000004017379,0.99864405,0.000094718824,0.00097639544,0.00020667334,0.0000021790097],"about_ca_topic_score_codex":0.0059584216,"about_ca_topic_score_gemma":0.0027378039,"teacher_disagreement_score":0.0059584216,"about_ca_system_score_codex":0.0010183587,"about_ca_system_score_gemma":0.001721372,"threshold_uncertainty_score":0.011847436},"labels":[],"label_agreement":null},{"id":"W75241701","doi":"10.1023/a:1013138919445","title":"A Comprehensive Input Format for Stochastic Linear Programs","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Theory of computation; Range (aeronautics); Computer science; Mathematical economics; Mathematical optimization; Mathematics; Applied mathematics; Algorithm; Engineering","score_opus":0.32938202019815765,"score_gpt":0.45775449056652306,"score_spread":0.1283724703683654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75241701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021212918,0.00027189808,0.94152063,0.00085897243,0.00039544943,0.00026093828,0.018054573,0.023220021,0.013296144],"genre_scores_gemma":[0.057573598,0.001253226,0.8742293,0.00054783694,0.00036262063,0.0019804013,0.031658173,0.0105558215,0.021839041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723023,0.00078191824,0.00045272068,0.00026683466,0.0010337363,0.00023457546],"domain_scores_gemma":[0.9914077,0.0042125816,0.0002833827,0.0016338665,0.002301904,0.00016056659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002941035,0.0022070769,0.0013996897,0.0021207824,0.0010295489,0.004614274,0.0024710489,0.0019584014,0.08332255],"category_scores_gemma":[0.021740796,0.0012154678,0.0015160395,0.003510644,0.0005701323,0.0050157593,0.0029378876,0.003259807,0.02717921],"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.0010508824,0.00037282892,0.00083288806,0.0014511023,0.00007483792,0.00060813886,0.00033527205,0.07722991,0.006278973,0.19609231,0.26936415,0.44630873],"study_design_scores_gemma":[0.00027020223,0.00021679394,0.00046456564,0.00066088187,0.00006831932,0.00049821584,0.00014553149,0.42155522,0.02761376,0.2303661,0.3179728,0.00016762398],"about_ca_topic_score_codex":0.0015308907,"about_ca_topic_score_gemma":0.0021763379,"teacher_disagreement_score":0.08332255,"about_ca_system_score_codex":0.0010372843,"about_ca_system_score_gemma":0.0019245921,"threshold_uncertainty_score":0.27874172},"labels":[],"label_agreement":null},{"id":"W847996784","doi":"10.5267/j.dsl.2015.5.004","title":"Vendor selection and order allocation using an integrated fuzzy mathematical programming model","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Purchasing; Computer science; Fuzzy logic; Quality (philosophy); Selection (genetic algorithm); Operations research; Order (exchange); Supply chain; Context (archaeology); Vendor; Supply chain management; Service (business); Supplier relationship management; Production (economics); Delivery Performance; Operations management; Business; Process management; Marketing; Engineering; Economics; Microeconomics","score_opus":0.05476178526326572,"score_gpt":0.3092761112894087,"score_spread":0.254514326026143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847996784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032025162,0.00027640382,0.956695,0.0003427821,0.000040605897,0.00017656542,0.00018419595,0.00012922988,0.010130025],"genre_scores_gemma":[0.6798745,0.0008474599,0.30651984,0.000105481915,0.000048706173,0.000643473,0.00024517457,0.00005753874,0.0116578275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991026,0.00036170962,0.00004596,0.00013613382,0.00024041551,0.00011317449],"domain_scores_gemma":[0.99926347,0.00043151688,0.000099632285,0.000024461975,0.00013747341,0.00004352513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015193607,0.0010562123,0.0013868607,0.0015506854,0.0009824974,0.0028128123,0.002149394,0.0019371981,0.0042853584],"category_scores_gemma":[0.001898414,0.001005084,0.0015664643,0.002224861,0.00072302413,0.0019287686,0.0008874189,0.0011571049,0.0005542738],"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.000028539971,0.000037456924,0.00017357721,0.00002792661,0.000017106397,0.00005203499,0.000036696587,0.9832419,0.00036384424,0.011051975,0.00020333566,0.0047657005],"study_design_scores_gemma":[0.000007895181,0.00001532032,0.000032211425,0.0000040201994,0.0000074797204,0.000008726327,0.0000082330225,0.9978509,0.000093316434,0.0017474262,0.0002199126,0.0000046245036],"about_ca_topic_score_codex":0.012477008,"about_ca_topic_score_gemma":0.0117558185,"teacher_disagreement_score":0.012477008,"about_ca_system_score_codex":0.0024860494,"about_ca_system_score_gemma":0.0028702563,"threshold_uncertainty_score":0.024808764},"labels":[],"label_agreement":null},{"id":"W90079504","doi":"10.1080/03155986.2005.11732719","title":"Modeling and Analysis of Multicommodity Network Flows Via Goal Programming","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multi-commodity flow problem; Flow network; Mathematical optimization; Linear programming; Lagrangian relaxation; Minimum-cost flow problem; Robustness (evolution); Computer science; Relaxation (psychology); Mathematics","score_opus":0.03883840468365876,"score_gpt":0.3158162269583731,"score_spread":0.27697782227471435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90079504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038823534,0.00023232886,0.99216276,0.00024001623,0.00001643608,0.00003219606,0.00004902688,0.00010544929,0.0032794164],"genre_scores_gemma":[0.40297952,0.0023241306,0.5877211,0.0001593723,0.00011417949,0.00048716555,0.00029177644,0.00018118348,0.0057414975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864715,0.0006731799,0.000039875897,0.0001693778,0.0003458749,0.00012463114],"domain_scores_gemma":[0.9985232,0.0010526252,0.00017754108,0.00007946174,0.00013150294,0.00003565491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021248672,0.0012837444,0.0007046823,0.0009847756,0.0005721047,0.0020365694,0.0013975432,0.0011307084,0.0018863973],"category_scores_gemma":[0.004229687,0.00070276693,0.0009759064,0.001162942,0.0012416572,0.0027446826,0.000998899,0.0016839026,0.0004447667],"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.000011558299,0.000023384438,0.00021313848,0.00006009921,0.000018215658,0.000042919397,0.000047757105,0.8428807,0.00027326914,0.14718342,0.0004686657,0.008776867],"study_design_scores_gemma":[0.0000028843317,0.0000074770714,0.000046568424,0.000014337773,0.0000062376116,0.000010483818,0.000012212197,0.93382835,0.00020470166,0.064058654,0.0018035638,0.000004544429],"about_ca_topic_score_codex":0.004475198,"about_ca_topic_score_gemma":0.0026070944,"teacher_disagreement_score":0.004475198,"about_ca_system_score_codex":0.0016197014,"about_ca_system_score_gemma":0.0018808382,"threshold_uncertainty_score":0.011751771},"labels":[],"label_agreement":null}]}