{"meta":{"query_hash":"9e7598844cdb","filters":{"venue":"International Journal of Industrial Engineering Computations"},"cohort_total":437,"direct_labels_cover":0,"predictions_cover":437,"exported":437,"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/9e7598844cdb","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Industrial+Engineering+Computations"},"results":[{"id":"W141464852","doi":"10.5267/j.ijiec.2011.03.004","title":"A deterministic model for deteriorating items with displayed inventory level dependent demand rate incorporating marketing decisions with transportation cost","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":33,"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":"Economics; Microeconomics; Inventory cost; Operations research; Econometrics; Business; Marketing; Mathematics; Supply chain","score_opus":0.09218942205854888,"score_gpt":0.25232475121514236,"score_spread":0.16013532915659348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141464852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29945123,0.0000068601353,0.6992897,0.00009249598,0.00063194166,0.00036417728,0.000020851203,0.000033885284,0.00010887435],"genre_scores_gemma":[0.9805734,0.0000014639185,0.018325826,0.0001193013,0.0008051734,0.000048520964,0.000060690436,0.000041427214,0.000024176983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984455,0.000018419369,0.00071434875,0.00018759602,0.00043729323,0.00019683946],"domain_scores_gemma":[0.9980436,0.00025429047,0.00082102173,0.00008798378,0.00075076125,0.000042349657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008632135,0.00021132143,0.00023373778,0.0005421556,0.0001426363,0.00025750563,0.0003357704,0.00006312217,0.000014393134],"category_scores_gemma":[0.00039195878,0.00017855663,0.000089230816,0.00022930038,0.000033502438,0.0009640607,0.000030529587,0.00022068612,0.0000018459962],"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.0009393339,0.00011457838,0.0062382417,0.000035214664,0.0002941143,0.000077848,0.0004110609,0.98433524,0.00033167197,0.001923613,0.00014697974,0.0051520844],"study_design_scores_gemma":[0.0030102306,0.000089272784,0.002407861,0.0007414399,0.00016207474,0.000022007645,0.0003776562,0.9923183,0.00007045118,0.00031495112,0.00022819958,0.00025755772],"about_ca_topic_score_codex":0.000044189856,"about_ca_topic_score_gemma":0.0001239405,"teacher_disagreement_score":0.6811222,"about_ca_system_score_codex":0.00011029474,"about_ca_system_score_gemma":0.00011435047,"threshold_uncertainty_score":0.7281328},"labels":[],"label_agreement":null},{"id":"W1688302353","doi":"10.5267/j.ijiec.2015.8.002","title":"Competitive location: a state-of-art review","year":2015,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Management, Economics, and Public Policy","field":"Business, Management and Accounting","cited_by":42,"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":"State (computer science); Business; Computer science; Algorithm","score_opus":0.08192466022912889,"score_gpt":0.3182820415164016,"score_spread":0.2363573812872727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1688302353","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018008618,0.9793488,0.004873624,0.0009843546,0.005721651,0.00052082696,0.0000654786,0.000040206796,0.008443298],"genre_scores_gemma":[0.00007325714,0.9922827,0.00035861175,0.00034712855,0.006412296,0.000015310277,0.00028158614,0.000049249327,0.00017984408],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976894,0.000023551367,0.0015445631,0.00015288878,0.00043351928,0.00015602261],"domain_scores_gemma":[0.9956784,0.0001635014,0.0023280233,0.00014601713,0.0016464354,0.00003759069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008973112,0.00026201425,0.0011005192,0.0011643686,0.000023712435,0.00019844461,0.00082165055,0.000096403295,0.00011832727],"category_scores_gemma":[0.0007768662,0.00025619735,0.00036735236,0.0005649328,0.000031843967,0.0007042793,0.00016780372,0.00043381643,0.00014506541],"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.000009752555,0.00010124065,0.000004324572,0.0070602912,0.0012127765,0.000026390398,0.000018461153,0.016397845,1.8281026e-8,0.04256668,0.094632685,0.83796954],"study_design_scores_gemma":[0.00040399402,0.00001229136,0.0000018610942,0.022773506,0.00038390406,0.000034269447,0.0000063012826,0.0010410158,2.8649973e-8,0.00026019616,0.9748897,0.00019294096],"about_ca_topic_score_codex":0.000033281856,"about_ca_topic_score_gemma":0.0000036469348,"teacher_disagreement_score":0.880257,"about_ca_system_score_codex":0.0002341403,"about_ca_system_score_gemma":0.0005505323,"threshold_uncertainty_score":0.99998903},"labels":[],"label_agreement":null},{"id":"W1694601577","doi":"10.5267/j.ijiec.2015.6.004","title":"GRASP to minimize total weighted tardiness in a permutation flow shop environment","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"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; GRASP; Permutation (music); Flow shop scheduling; Computer science; Flow (mathematics); Sorting; Mathematics; Mathematical optimization; Operations management; Engineering; Algorithm; Job shop scheduling; Schedule","score_opus":0.026024120551180797,"score_gpt":0.2406440146705312,"score_spread":0.2146198941193504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1694601577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19685546,0.000065789165,0.79790246,0.0006341217,0.004255269,0.00011540106,0.000018420911,0.00007356891,0.00007954166],"genre_scores_gemma":[0.8156247,0.00000847706,0.18324307,0.000025613857,0.0010008258,0.000010118617,0.00003634176,0.00003241723,0.000018430488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.000022081427,0.00056806405,0.00010064146,0.00047374633,0.00014766454],"domain_scores_gemma":[0.9992984,0.00010147715,0.00007869768,0.000065590095,0.00025940302,0.00019641634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026201192,0.00014449276,0.0001978478,0.0006458514,0.000014044196,0.00007655697,0.00021560554,0.000092415656,0.000027212618],"category_scores_gemma":[0.0002510105,0.00015545847,0.00007128712,0.00029818076,0.000009165445,0.00022025021,0.000027298507,0.00028534987,0.000021416363],"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.00003071406,0.000037028036,0.00024168754,0.0000015918289,0.00007732415,0.000038121267,0.00052467245,0.992769,0.00008778131,0.000050165818,0.00031941288,0.005822524],"study_design_scores_gemma":[0.0018744495,0.00004401644,0.0005637274,0.00008865913,0.00001373898,0.000096975295,0.000181664,0.9962476,0.00022951886,0.00004623892,0.00045390832,0.00015950893],"about_ca_topic_score_codex":0.000006079687,"about_ca_topic_score_gemma":6.035959e-7,"teacher_disagreement_score":0.6187693,"about_ca_system_score_codex":0.00038738395,"about_ca_system_score_gemma":0.0000831795,"threshold_uncertainty_score":0.63394123},"labels":[],"label_agreement":null},{"id":"W1696028247","doi":"10.5267/j.ijiec.2015.8.003","title":"A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"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":"Vehicle routing problem; Pareto principle; Ant colony optimization algorithms; Mathematical optimization; Depot; ANT; Computer science; Algorithm; Multi-objective optimization; Mathematics; Engineering; Routing (electronic design automation); Computer network","score_opus":0.05743903590744473,"score_gpt":0.3045569092903155,"score_spread":0.24711787338287075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696028247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009242821,0.00009946244,0.9877009,0.00044122117,0.0019250261,0.00040135067,0.000042475567,0.0001323727,0.000014385791],"genre_scores_gemma":[0.3211373,0.0000068137156,0.6778805,0.000024432298,0.00083491905,0.000030057774,0.00001034879,0.00005493192,0.000020679141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857074,0.000053864842,0.0005610356,0.00013427768,0.0004442983,0.00023577812],"domain_scores_gemma":[0.99749774,0.0007636035,0.00025826946,0.00010103875,0.0012304834,0.00014886289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086526177,0.0001997526,0.00024820335,0.00023272105,0.00008254,0.00016508714,0.00041701013,0.00010995302,0.0000027296824],"category_scores_gemma":[0.00065371004,0.00015846394,0.00010575303,0.0003185481,0.000033490815,0.00028278088,0.00004201734,0.00047373123,0.000002303822],"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.000029911607,0.000047156118,0.00035409734,0.0000033983326,0.00040554453,0.000014336723,0.000696438,0.98100084,0.00021725653,0.000052072148,0.00030045855,0.016878515],"study_design_scores_gemma":[0.00408634,0.00013081558,0.00032259966,0.00015410919,0.00006283701,0.00013710994,0.00039706405,0.9928158,0.00051558623,0.000011906653,0.0011823266,0.00018349274],"about_ca_topic_score_codex":0.000020185467,"about_ca_topic_score_gemma":0.0000062157196,"teacher_disagreement_score":0.3118945,"about_ca_system_score_codex":0.0003822008,"about_ca_system_score_gemma":0.00022419018,"threshold_uncertainty_score":0.6461972},"labels":[],"label_agreement":null},{"id":"W1723345372","doi":"10.5267/j.ijiec.2015.7.003","title":"Multi-objective optimization of surface roughness, cutting forces, productivity and Power consumption when turning of Inconel 718","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Additive Manufacturing Materials and Processes","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":"Indian National Science Academy","keywords":"Inconel; Surface roughness; Materials science; Carbide; Surface finish; Response surface methodology; Mechanical engineering; Metallurgy; Composite material; Engineering; Mathematics","score_opus":0.03395247119394403,"score_gpt":0.2576528264090358,"score_spread":0.22370035521509177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1723345372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731065,0.00015569162,0.3254408,0.00003317839,0.0011096257,0.000073049065,0.00003581653,0.000025720226,0.00001963446],"genre_scores_gemma":[0.9668962,0.000018606976,0.03283175,0.0000016044914,0.00021613683,0.0000011560277,0.000013262952,0.000018221166,0.0000030772235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990401,0.000029303437,0.00050261023,0.00008430792,0.0002564361,0.00008723167],"domain_scores_gemma":[0.99866605,0.00017798298,0.0003466257,0.00004611749,0.00070645614,0.00005674412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003448286,0.00012018954,0.00024041792,0.00018870507,0.000018351267,0.000037936767,0.00012776653,0.00007440481,0.000011947826],"category_scores_gemma":[0.000544062,0.000121821446,0.00003971387,0.000079386184,0.000037770635,0.0004007821,0.00003864857,0.00017905192,3.3320052e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003947598,0.000027831584,0.0011922056,0.000034747627,0.0001559286,0.000002657898,0.0009204113,0.99254084,0.004370869,0.00004649396,0.000043690336,0.0006248233],"study_design_scores_gemma":[0.0035795353,0.00021290345,0.0052080825,0.0009763951,0.00009098292,0.0001228271,0.0004197529,0.8845074,0.10398997,0.00023215107,0.00029839066,0.00036161175],"about_ca_topic_score_codex":0.000021773345,"about_ca_topic_score_gemma":0.0000010451021,"teacher_disagreement_score":0.29378968,"about_ca_system_score_codex":0.00008757687,"about_ca_system_score_gemma":0.00007479031,"threshold_uncertainty_score":0.49677345},"labels":[],"label_agreement":null},{"id":"W1974762386","doi":"10.5267/j.ijiec.2010.07.002","title":"Adjusted permutation method for multiple attribute decision making with meta-heuristic solution approaches","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Permutation (music); Heuristic; Meta heuristic; Mathematical optimization; Mathematics; Computer science; Algorithm; Data mining","score_opus":0.3602411809738339,"score_gpt":0.42686041763592053,"score_spread":0.06661923666208663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974762386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073680304,0.000034338336,0.92030305,0.00087609835,0.0046002604,0.00034408053,0.00010354679,0.000040342453,0.000017971177],"genre_scores_gemma":[0.59789354,5.6223325e-7,0.40122512,0.000026882342,0.0007857547,0.00001722355,0.000015334534,0.000022700597,0.000012878324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952537,0.00015086267,0.0017171083,0.00039905182,0.0022125624,0.00026671548],"domain_scores_gemma":[0.98238313,0.012614665,0.0012916346,0.00028728697,0.0032668249,0.00015647699],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0043939613,0.00027340057,0.0006045947,0.0014255454,0.00017058576,0.0006861695,0.0011521847,0.00020449278,0.00011021259],"category_scores_gemma":[0.024851147,0.00020154075,0.00043962672,0.00071183225,0.000045609486,0.0007987715,0.000119431905,0.00069146487,0.00001058132],"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.00042060704,0.000093847644,0.00062582764,0.0000024929698,0.0006724834,0.00002413537,0.00023761905,0.86683434,0.002062048,0.0016479839,0.0009673343,0.12641129],"study_design_scores_gemma":[0.002859288,0.00014479228,0.0026838253,0.00010917501,0.00036024937,0.000438866,0.00015071362,0.98544896,0.0004132105,0.0031180086,0.0040272465,0.00024564937],"about_ca_topic_score_codex":0.000009799211,"about_ca_topic_score_gemma":0.000027326007,"teacher_disagreement_score":0.52421325,"about_ca_system_score_codex":0.00013536756,"about_ca_system_score_gemma":0.00025376037,"threshold_uncertainty_score":0.983363},"labels":[],"label_agreement":null},{"id":"W1977904072","doi":"10.5267/j.ijiec.2010.05.001","title":"Fuzzy production planning models for an unreliable production system with fuzzy production rate and stochastic/fuzzy demand rate","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Jadavpur University","keywords":"Production (economics); Fuzzy logic; Production planning; Production rate; Production system (computer science); Computer science; Mathematical optimization; Economics; Engineering; Mathematics; Microeconomics; Industrial engineering; Artificial intelligence","score_opus":0.03675250528896728,"score_gpt":0.2458263994276557,"score_spread":0.2090738941386884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977904072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7905149,0.000042484375,0.1850754,0.002688124,0.020136395,0.0010403533,0.0000058535575,0.00017613698,0.00032036222],"genre_scores_gemma":[0.9869953,0.0000024146138,0.0020755832,0.000042835534,0.010672005,0.00004157057,0.000042235468,0.000039108178,0.0000889385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861324,0.000019259509,0.0005179033,0.00030372984,0.00034749266,0.00019835647],"domain_scores_gemma":[0.99815845,0.00005764201,0.0005310134,0.00012960777,0.001083476,0.000039820134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011989316,0.00020750926,0.00022060546,0.0006952167,0.00019377701,0.0003996328,0.00021375107,0.00008426578,0.000002218606],"category_scores_gemma":[0.0005165436,0.00018962221,0.00005527123,0.0002866141,0.00003910645,0.0023648867,0.000046469577,0.0003639,0.0000022449667],"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.0002700978,0.00007689234,0.00013246789,0.00006875593,0.00016240183,0.0000070213064,0.00010661633,0.9808637,0.0026398145,0.012365126,0.0019392825,0.0013678053],"study_design_scores_gemma":[0.0034423731,0.0002548013,0.00081550394,0.0014214313,0.00036324817,0.0004077335,0.0013798396,0.9808381,0.0009805374,0.004916462,0.0045042057,0.0006757429],"about_ca_topic_score_codex":0.000048941878,"about_ca_topic_score_gemma":0.00001340009,"teacher_disagreement_score":0.19648041,"about_ca_system_score_codex":0.0000996374,"about_ca_system_score_gemma":0.00006828517,"threshold_uncertainty_score":0.7732569},"labels":[],"label_agreement":null},{"id":"W1979254423","doi":"10.5267/j.ijiec.2011.08.019","title":"A scheme for functional tolerancing: A product family in 3D CAD system","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Geometric dimensioning and tolerancing; Mass customization; Component (thermodynamics); CAD; Graph; Functional requirement; Engineering drawing; Computer science; Dimensioning; MATLAB; Scheme (mathematics); Personalization; Product design; Product (mathematics); Engineering; Reliability engineering; Manufacturing engineering; Software engineering; Mathematics","score_opus":0.047163166951910016,"score_gpt":0.2285721657130509,"score_spread":0.18140899876114086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979254423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19110678,0.00018166662,0.80258435,0.00005991091,0.005332177,0.00022330815,0.000021265965,0.0001265167,0.00036404072],"genre_scores_gemma":[0.97093505,0.000007135946,0.028084764,0.000009152376,0.0008978856,0.000019058281,0.0000134055845,0.000025708076,0.000007859768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989903,0.0000075548332,0.0005311275,0.00009541831,0.00023844189,0.00013717866],"domain_scores_gemma":[0.99936754,0.000066040455,0.00011734426,0.000054683216,0.0003387476,0.000055664757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020685719,0.00012514112,0.0001756557,0.00045498498,0.000022707593,0.000041991458,0.00018952698,0.00007073564,0.000009778251],"category_scores_gemma":[0.00010498441,0.00012999855,0.00007522506,0.00015561134,0.000007792506,0.00024453152,0.000013575061,0.00023937991,0.0000018423323],"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.000055138014,0.000028618699,0.00028109585,0.000032333275,0.00010098804,0.000011853037,0.00023389792,0.99484843,0.00025910162,0.0007161971,0.00027461533,0.0031577384],"study_design_scores_gemma":[0.0019515638,0.000055284403,0.003632198,0.0003813944,0.000021370835,0.00009841706,0.00008698669,0.99016786,0.0016585304,0.000043495536,0.0017069159,0.00019601373],"about_ca_topic_score_codex":0.000014859336,"about_ca_topic_score_gemma":0.0000016000367,"teacher_disagreement_score":0.77982825,"about_ca_system_score_codex":0.00021550422,"about_ca_system_score_gemma":0.000076963675,"threshold_uncertainty_score":0.5301187},"labels":[],"label_agreement":null},{"id":"W1987542505","doi":"10.5267/j.ijiec.2014.2.002","title":"A deterministic inventory model for deteriorating items with selling price dependent demand and three-parameter Weibull distributed deterioration","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Weibull distribution; Econometrics; Operations research; Economics; Computer science; Statistics; Engineering; Mathematics","score_opus":0.03314536466120089,"score_gpt":0.23560606081141794,"score_spread":0.20246069615021706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987542505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2907758,0.000013229775,0.70806646,0.00023249061,0.0006639497,0.00019110262,0.000005981301,0.00002776938,0.0000232392],"genre_scores_gemma":[0.9910109,0.0000018431388,0.0071941707,0.00017067899,0.0015309115,0.000020207091,0.000037160844,0.00002580601,0.00000833234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987919,0.000010164659,0.00052406994,0.00016184982,0.00034324534,0.00016877882],"domain_scores_gemma":[0.9987508,0.00018357339,0.0004908713,0.00007385955,0.0004670652,0.000033839144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978053,0.00016904267,0.00020605276,0.00037370043,0.00009976873,0.0004681601,0.00022697636,0.0000648968,0.000005111844],"category_scores_gemma":[0.00041629278,0.00015413022,0.00006681653,0.00012899126,0.000025661606,0.00069843454,0.00006381715,0.0001671507,0.0000016367886],"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.0001349661,0.000048422426,0.002576186,0.00004842776,0.0001553092,0.00000863415,0.00008571425,0.9890593,0.00046733636,0.0021717013,0.00016422053,0.005079768],"study_design_scores_gemma":[0.0016514509,0.00007440844,0.00026502993,0.00021039882,0.00008583984,0.000020898135,0.000038144735,0.9949193,0.000033078817,0.0009704602,0.0015573204,0.00017368689],"about_ca_topic_score_codex":0.000012289345,"about_ca_topic_score_gemma":0.000016185082,"teacher_disagreement_score":0.70087224,"about_ca_system_score_codex":0.00008693043,"about_ca_system_score_gemma":0.00003872434,"threshold_uncertainty_score":0.6285248},"labels":[],"label_agreement":null},{"id":"W1987999292","doi":"10.5267/j.ijiec.2011.09.001","title":"Multi products single machine EPQ model with immediate rework process","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":71,"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":"Rework; Economic production quantity; Convexity; Mathematical optimization; Production (economics); Total cost; Computer science; Process (computing); Function (biology); Product (mathematics); Operations research; Operations management; Reliability engineering; Mathematics; Economics; Engineering; Microeconomics","score_opus":0.06685742624931847,"score_gpt":0.23981745620261066,"score_spread":0.17296002995329218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987999292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4104908,0.0001563865,0.5659511,0.0072615356,0.0102216145,0.00082079467,0.000020002853,0.00031313425,0.004764643],"genre_scores_gemma":[0.98875284,0.0000022208199,0.008744546,0.00027825305,0.002095687,0.000006438435,0.000018540215,0.0000288571,0.00007260612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.0000047896337,0.00041341016,0.00013419114,0.00042835082,0.00015321843],"domain_scores_gemma":[0.99873835,0.00002216578,0.00038072333,0.000083931314,0.00075117766,0.000023630826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023653085,0.00014846638,0.00015672839,0.0005101838,0.000045547942,0.00013558891,0.00040792304,0.000048081285,0.00005188133],"category_scores_gemma":[0.00022060056,0.00012660082,0.0000572934,0.00031955933,0.000024383995,0.0008600183,0.00006277407,0.00025381587,0.000014454647],"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.00019004713,0.0004421247,0.002173083,0.00003230343,0.0003033855,0.000079741716,0.0003539711,0.9883863,0.0002414278,0.0029809675,0.0021162543,0.0027004203],"study_design_scores_gemma":[0.0030762947,0.00007832363,0.000801816,0.00037752264,0.00010771523,0.000038304865,0.00017326915,0.9879245,0.0005286433,0.00060837605,0.005957489,0.00032773602],"about_ca_topic_score_codex":0.000031796804,"about_ca_topic_score_gemma":0.000004020585,"teacher_disagreement_score":0.57826203,"about_ca_system_score_codex":0.00007136694,"about_ca_system_score_gemma":0.000057360077,"threshold_uncertainty_score":0.5162632},"labels":[],"label_agreement":null},{"id":"W1996871104","doi":"10.5267/j.ijiec.2011.03.005","title":"Optimal ordering and pricing policy for price sensitive stock–dependent demand under progressive payment scheme","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"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":"Payment; Stock (firearms); Stock price; Scheme (mathematics); Economics; Microeconomics; Monetary economics; Business; Econometrics; Finance; Mathematics; Series (stratigraphy); Engineering; Biology","score_opus":0.045253753357146854,"score_gpt":0.26609426870234654,"score_spread":0.2208405153451997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996871104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49312645,0.000073805386,0.5013716,0.0018190622,0.0022779724,0.00057387486,0.000007555931,0.00006309205,0.00068655575],"genre_scores_gemma":[0.9872053,0.000005027825,0.009520082,0.0002781176,0.0029138462,0.00001513281,0.000009842241,0.000022864773,0.000029740144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989588,0.000006839515,0.0004081827,0.0001357087,0.00031405935,0.00017640114],"domain_scores_gemma":[0.99893075,0.00007735426,0.00037475437,0.00005318664,0.00053383206,0.000030117437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032001172,0.0001444995,0.00016474065,0.000609655,0.00007925251,0.00018909757,0.0001942316,0.000053489926,0.000024060017],"category_scores_gemma":[0.00024362294,0.00013935255,0.00007547336,0.00017286542,0.000023968294,0.00060172356,0.0001367881,0.00017046228,0.000002429178],"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.0005135629,0.0004585041,0.0027456132,0.000114180526,0.0018664503,0.0001650505,0.0015239202,0.8692934,0.0011693924,0.10478662,0.0016281047,0.015735216],"study_design_scores_gemma":[0.00994207,0.00029866945,0.0078026024,0.001103611,0.00028982043,0.00022040277,0.0026094585,0.95804435,0.0019378717,0.0022107374,0.014627433,0.0009129921],"about_ca_topic_score_codex":0.00005812768,"about_ca_topic_score_gemma":0.0000014526014,"teacher_disagreement_score":0.49407887,"about_ca_system_score_codex":0.0001446693,"about_ca_system_score_gemma":0.0000617487,"threshold_uncertainty_score":0.56826323},"labels":[],"label_agreement":null},{"id":"W2000642578","doi":"10.5267/j.ijiec.2012.08.004","title":"Reliability prediction for the vehicles equipped with advanced driver assistance systems (ADAS) and passive safety systems (PSS)","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Advanced driver assistance systems; Active safety; Reliability (semiconductor); Automotive engineering; Warning system; Crash; Lane departure warning system; System safety; Vehicle safety; Engineering; Transport engineering; Computer science; Reliability engineering; Telecommunications","score_opus":0.01226791066436055,"score_gpt":0.22370961725035057,"score_spread":0.21144170658599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000642578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2907941,0.0010338493,0.70226866,0.00034265936,0.0048326114,0.00041519274,0.000112262154,0.00016424374,0.000036406716],"genre_scores_gemma":[0.9976547,0.00007637862,0.0014097391,0.0000051696547,0.00078171666,0.000031329622,0.000008916769,0.00002120598,0.000010866241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899477,0.00002122579,0.00048266942,0.00008460671,0.0002376293,0.000179104],"domain_scores_gemma":[0.99871445,0.0005909861,0.00018648355,0.00009650172,0.00034072294,0.00007085857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033278426,0.00013570077,0.00019695789,0.00012269944,0.00009680758,0.000054909233,0.00020793102,0.00013376203,0.0000013837774],"category_scores_gemma":[0.00015790174,0.000100915466,0.000052594034,0.00011313636,0.000051153533,0.0003866864,0.000021831782,0.0003753163,6.8349664e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009354954,0.00001985551,0.0012447891,0.000015521511,0.0002917627,0.0000020928771,0.00011981627,0.9891724,0.00028177773,0.0029644696,0.00020504661,0.0055889026],"study_design_scores_gemma":[0.0020729343,0.00013360607,0.017195448,0.00030754812,0.0001050687,0.00022071558,0.0003434114,0.9647022,0.00019509699,0.000033694974,0.014504424,0.000185854],"about_ca_topic_score_codex":0.000006286111,"about_ca_topic_score_gemma":8.0363435e-7,"teacher_disagreement_score":0.7068606,"about_ca_system_score_codex":0.00024923575,"about_ca_system_score_gemma":0.00004591153,"threshold_uncertainty_score":0.41152135},"labels":[],"label_agreement":null},{"id":"W2008691051","doi":"10.5267/j.ijiec.2014.12.002","title":"A heuristic algorithm for scheduling in a flow shop environment to minimize makespa","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Heuristic; Job shop scheduling; Algorithm; Operations research; Engineering; Mathematics; Embedded system","score_opus":0.03752176381798682,"score_gpt":0.2616996035474349,"score_spread":0.22417783972944805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008691051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00938143,0.00009486441,0.9862467,0.000443182,0.0035503162,0.00016453341,0.000036453694,0.000056749675,0.000025782078],"genre_scores_gemma":[0.08831647,0.000009713785,0.9102932,0.000038018243,0.0012441209,0.000022310142,0.000023217952,0.000038067952,0.000014862265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874866,0.000014654045,0.0005882733,0.000107975,0.0003643664,0.00017606365],"domain_scores_gemma":[0.99916965,0.00020708427,0.000081120736,0.000067664645,0.0002661029,0.00020839692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003598907,0.00014590379,0.00021586446,0.00057609513,0.000015853067,0.00008021809,0.00026234917,0.00009170984,0.000010384775],"category_scores_gemma":[0.0004977925,0.00016245169,0.0000857101,0.0002094809,0.000008529188,0.00013414855,0.000025839949,0.00026229807,0.000010074234],"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.000021299762,0.00003503064,0.000042283733,0.000002202051,0.00008038955,0.000020730671,0.00026527874,0.9660969,0.000026821495,0.00003823277,0.0002256729,0.033145152],"study_design_scores_gemma":[0.002297939,0.00006130167,0.000035440302,0.000121481695,0.000015992935,0.00005102315,0.00013711366,0.9956121,0.00012419377,0.00006562625,0.0013235039,0.0001542874],"about_ca_topic_score_codex":0.0000027473977,"about_ca_topic_score_gemma":4.019812e-7,"teacher_disagreement_score":0.07893504,"about_ca_system_score_codex":0.0003489224,"about_ca_system_score_gemma":0.00009693964,"threshold_uncertainty_score":0.6624587},"labels":[],"label_agreement":null},{"id":"W2012973940","doi":"10.5267/j.ijiec.2010.04.004","title":"Artificial Bee colony for resource constrained project scheduling problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"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":"Artificial bee colony algorithm; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Engineering; Mathematics","score_opus":0.13026074314852312,"score_gpt":0.38163602182613965,"score_spread":0.25137527867761655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012973940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33567291,0.000024433133,0.64733285,0.009068237,0.0070085614,0.0004203413,0.00011566476,0.00008199896,0.00027497852],"genre_scores_gemma":[0.82876146,6.1684284e-7,0.16817626,0.000056901597,0.0029037357,0.000011617153,0.000012356311,0.00001737044,0.00005969096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715775,0.000052966716,0.0012571028,0.0002151277,0.0010777012,0.00023933625],"domain_scores_gemma":[0.9940462,0.0029480457,0.00066016294,0.0001291204,0.002083642,0.00013280495],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0031875481,0.00014547718,0.00028638417,0.0010036312,0.000148253,0.00047505007,0.0008801034,0.00016778393,0.000041137813],"category_scores_gemma":[0.014725283,0.00012804256,0.00027413957,0.00060686417,0.00007807377,0.00029511497,0.000056653225,0.00073059544,0.000013013138],"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.00015463034,0.00015879073,0.0002855672,0.0000018957744,0.00025832775,0.000015512247,0.00047936628,0.9303149,0.011947666,0.022989323,0.0040058596,0.029388137],"study_design_scores_gemma":[0.003614469,0.00043601348,0.0002829865,0.00021773748,0.00014797434,0.00061421463,0.00087024504,0.8462711,0.004146438,0.024221648,0.11863241,0.00054475944],"about_ca_topic_score_codex":0.000012609881,"about_ca_topic_score_gemma":0.000007769978,"teacher_disagreement_score":0.4930885,"about_ca_system_score_codex":0.000060650604,"about_ca_system_score_gemma":0.0007105437,"threshold_uncertainty_score":0.9935741},"labels":[],"label_agreement":null},{"id":"W2021649182","doi":"10.5267/j.ijiec.2010.08.007","title":"Hat and squeeze functions, a way for making precise algorithms","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Algorithms and Data Compression","field":"Computer Science","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":"Algorithm; Computer science; Mathematical optimization; Mathematics","score_opus":0.0587628926795012,"score_gpt":0.27735918316057284,"score_spread":0.21859629048107165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021649182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039338055,0.00010304507,0.99126244,0.0005450396,0.003923461,0.00011335046,0.000024564833,0.000044209843,0.00005010684],"genre_scores_gemma":[0.4449399,0.000019922265,0.5531676,0.000097202894,0.0017013773,0.000013462178,0.000012072455,0.000017626413,0.000030856212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900264,0.000017933915,0.00041251455,0.00014973075,0.0002877435,0.0001294477],"domain_scores_gemma":[0.99890363,0.0002081477,0.00023787565,0.000111630296,0.00045428792,0.00008444511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028127438,0.000111844434,0.0001463718,0.00033064332,0.00007263106,0.0001709025,0.00058371696,0.00007065002,0.000008288334],"category_scores_gemma":[0.0002077812,0.00010252938,0.0000835766,0.00014065501,0.000017004284,0.0007897531,0.00015286112,0.00020277848,0.0000017119423],"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.00017771724,0.00032681093,0.000566423,0.000015178077,0.0005761171,0.000102435566,0.0017511033,0.09144341,0.00047418353,0.028489554,0.013491706,0.86258537],"study_design_scores_gemma":[0.0022482295,0.00028445444,0.001111247,0.00031471762,0.00003419296,0.0003896935,0.0000564696,0.9682441,0.00047993165,0.0023893258,0.024197448,0.000250201],"about_ca_topic_score_codex":0.000009193669,"about_ca_topic_score_gemma":4.7258965e-7,"teacher_disagreement_score":0.87680066,"about_ca_system_score_codex":0.000060483693,"about_ca_system_score_gemma":0.00006577402,"threshold_uncertainty_score":0.41810268},"labels":[],"label_agreement":null},{"id":"W2021941000","doi":"10.5267/j.ijiec.2012.05.008","title":"Developing a univariate approach to phase-I monitoring of fuzzy quality profiles","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":15,"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":"Univariate; Fuzzy logic; Quality (philosophy); Phase (matter); Computer science; Statistics; Data mining; Environmental science; Mathematics; Multivariate statistics; Artificial intelligence; Chemistry; Physics","score_opus":0.1683734026444329,"score_gpt":0.38122564009484994,"score_spread":0.21285223745041704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021941000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33065882,0.000029302168,0.66660213,0.00015936699,0.002127219,0.0001468775,0.000019482875,0.000023065708,0.000233736],"genre_scores_gemma":[0.7845299,0.000001923315,0.21403302,0.0000040948457,0.0013967934,0.000004007247,0.0000054832603,0.000014565997,0.00001019231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984493,0.000052367377,0.0008337412,0.000068239446,0.00045444342,0.00014190421],"domain_scores_gemma":[0.99833965,0.00032544538,0.0004951908,0.00007267382,0.00066549843,0.00010155413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079615245,0.00010851965,0.0002514177,0.00036305326,0.000029081022,0.000037868653,0.00024828862,0.00007699492,0.0000029367234],"category_scores_gemma":[0.0010952384,0.000103226,0.00008877942,0.00025919458,0.000008384381,0.0002887066,0.000043049255,0.00018095497,9.3399024e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009884293,0.00056049804,0.0032470177,0.0000739283,0.0005651102,0.000002684166,0.0029713502,0.7594435,0.0020443674,0.22647072,0.00039832052,0.00412363],"study_design_scores_gemma":[0.09002234,0.0031328264,0.068723336,0.02583463,0.0019422838,0.0025751367,0.023136292,0.55090016,0.1385471,0.06296598,0.023304738,0.008915204],"about_ca_topic_score_codex":0.000014316574,"about_ca_topic_score_gemma":8.31081e-8,"teacher_disagreement_score":0.4538711,"about_ca_system_score_codex":0.0001938615,"about_ca_system_score_gemma":0.00012429274,"threshold_uncertainty_score":0.4209434},"labels":[],"label_agreement":null},{"id":"W2025619912","doi":"10.5267/j.ijiec.2013.06.004","title":"Strength improvement of fibre cement product","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Innovative concrete reinforcement materials","field":"Engineering","cited_by":15,"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":"Cement; Product (mathematics); Materials science; Composite material; Pulp and paper industry; Engineering; Mathematics","score_opus":0.01941560769902262,"score_gpt":0.23911602365316653,"score_spread":0.2197004159541439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025619912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9498781,0.000049377624,0.043682475,0.00028285524,0.0051798807,0.0002840777,0.000027135171,0.000062667714,0.00055342726],"genre_scores_gemma":[0.9967899,0.000013273527,0.0023488076,0.000012255018,0.000769025,0.000009580301,0.000017082222,0.000019909208,0.00002019832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985919,0.000008043749,0.0008072806,0.00006500007,0.00039445978,0.00013330327],"domain_scores_gemma":[0.9988083,0.00007185681,0.0002469917,0.000080458965,0.000741278,0.00005107292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017647828,0.00012944019,0.00020003176,0.0003511143,0.000012560407,0.000060385133,0.00028457568,0.000045242385,0.00024615746],"category_scores_gemma":[0.00014600782,0.00012720247,0.00007518663,0.00016552019,0.000016197859,0.00030484764,0.00003997492,0.00017333378,0.000010236065],"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.000009013,0.000019044464,0.00007943962,0.00002056679,0.00044587845,0.0000036666083,0.000099834484,0.81749666,0.1594058,0.0010708015,0.0026655237,0.018683784],"study_design_scores_gemma":[0.00442026,0.0006140101,0.0015051562,0.00079626206,0.000085482694,0.00006914885,0.00018971141,0.19777255,0.7807045,0.0003101333,0.012910342,0.00062242604],"about_ca_topic_score_codex":0.000013882406,"about_ca_topic_score_gemma":1.6057051e-7,"teacher_disagreement_score":0.62129873,"about_ca_system_score_codex":0.00014097196,"about_ca_system_score_gemma":0.000059809034,"threshold_uncertainty_score":0.51871663},"labels":[],"label_agreement":null},{"id":"W2026267944","doi":"10.5267/j.ijiec.2012.03.007","title":"An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":504,"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":"Benchmark (surveying); Computer science; Population; Algorithm; Mathematical optimization; Optimization algorithm; Population-based incremental learning; Range (aeronautics); Optimization problem; Process (computing); Artificial intelligence; Machine learning; Mathematics; Genetic algorithm; Engineering","score_opus":0.04507322606150652,"score_gpt":0.31449062254271937,"score_spread":0.2694173964812128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026267944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007667584,0.000030807187,0.99619246,0.0009056603,0.0022045034,0.00036352014,0.000033106797,0.00014779698,0.000045498884],"genre_scores_gemma":[0.120334275,0.0000057516004,0.8779535,0.000079691126,0.0013498167,0.000020876436,0.00020772335,0.00003389295,0.0000144542255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974361,0.00017157543,0.00091909943,0.00022552763,0.00087042054,0.0003772458],"domain_scores_gemma":[0.9963553,0.00071751326,0.00061896787,0.0001808814,0.0018041158,0.0003232328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648801,0.00021981401,0.00029074488,0.0008225393,0.00021854397,0.0005707341,0.0010316483,0.00013814529,0.000065286215],"category_scores_gemma":[0.0015934017,0.0002345563,0.00014564971,0.0003709825,0.00004453252,0.0015158178,0.00007255416,0.0005608593,0.0000023273194],"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.000009588666,0.00021338972,0.000052492738,0.000005585669,0.00010039111,0.0000037970206,0.00017269686,0.96738034,0.00006277186,0.0020644502,0.00022000335,0.029714514],"study_design_scores_gemma":[0.0020291996,0.00023156899,0.000037123606,0.00008329688,0.00002342051,0.00008611727,0.000027066726,0.9956849,0.000071431285,0.00002902793,0.0014755785,0.00022124377],"about_ca_topic_score_codex":0.000011077676,"about_ca_topic_score_gemma":1.7100808e-7,"teacher_disagreement_score":0.1202576,"about_ca_system_score_codex":0.0002596777,"about_ca_system_score_gemma":0.0003557541,"threshold_uncertainty_score":0.9564928},"labels":[],"label_agreement":null},{"id":"W2031832347","doi":"10.5267/j.ijiec.2010.03.007","title":"Supplier selection and order lot sizing using dynamic programming","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Sizing; Selection (genetic algorithm); Order (exchange); Build to order; Mathematical optimization; Dynamic programming; Computer science; Operations research; Engineering; Production (economics); Mathematics; Business; Economics; Microeconomics; Artificial intelligence; Chemistry","score_opus":0.014687791942530764,"score_gpt":0.2585349283688055,"score_spread":0.24384713642627473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031832347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25486517,0.000028055787,0.7425966,0.000050085968,0.002310274,0.000053635766,0.0000038796743,0.00007771744,0.0000145372815],"genre_scores_gemma":[0.8366333,0.0000121467565,0.16285273,0.0000040569835,0.00046304343,0.0000012918985,0.0000073513515,0.000022876624,0.00000316078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930525,0.000005691282,0.00031260768,0.000074786105,0.00018051207,0.000121144],"domain_scores_gemma":[0.9994277,0.000093082584,0.000096096206,0.000037327278,0.00028006578,0.000065743436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011692141,0.000111754234,0.00011681223,0.00029229283,0.000045870867,0.000099472665,0.00011140663,0.00009358584,0.000011733343],"category_scores_gemma":[0.00020426765,0.00011998103,0.00003303757,0.00014467162,0.000016362268,0.00023526189,0.000018521298,0.000497579,7.701452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000474085,0.000011187779,0.00008219047,0.000004163915,0.00006254974,0.0000052036603,0.000062494706,0.97612214,0.0047930926,0.00028836314,0.000009850738,0.01855405],"study_design_scores_gemma":[0.0004910567,0.000021688775,0.00022565277,0.0000451706,0.000023998495,0.00019346895,0.000023267574,0.99605,0.00085521385,0.00014039398,0.0018040921,0.00012602583],"about_ca_topic_score_codex":0.000005727545,"about_ca_topic_score_gemma":0.0000051725315,"teacher_disagreement_score":0.58176816,"about_ca_system_score_codex":0.000085999774,"about_ca_system_score_gemma":0.000039344573,"threshold_uncertainty_score":0.48926842},"labels":[],"label_agreement":null},{"id":"W2034920365","doi":"10.5267/j.ijiec.2013.02.003","title":"A novel approach for solving a capacitated location allocation problem","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Location-allocation; Mathematical optimization; Computer science; Facility location problem; Operations research; Mathematics","score_opus":0.0480077909143698,"score_gpt":0.2402955237274377,"score_spread":0.1922877328130679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034920365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022330988,0.000016250424,0.9719215,0.003125272,0.001649759,0.000542084,0.000003854657,0.00006439182,0.00034588375],"genre_scores_gemma":[0.96110666,0.0000018202659,0.036634807,0.00023733907,0.0017630972,0.000075216005,0.00011604909,0.000018890005,0.000046150413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987453,0.0000034632924,0.0006150065,0.0001302098,0.00035944607,0.00014655983],"domain_scores_gemma":[0.9973864,0.000049352988,0.00026265375,0.00007541888,0.0022047297,0.000021436179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695943,0.00012795861,0.00014217167,0.0005688047,0.00006388846,0.0003116654,0.00033214779,0.000063762236,0.000047675458],"category_scores_gemma":[0.0004900156,0.00012870898,0.00009419272,0.00039279676,0.000016049316,0.0012374802,0.000041934367,0.00015109318,0.000026179554],"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.000017565859,0.0001531317,0.00011569843,0.000040614035,0.00014800834,2.830656e-7,0.00011028571,0.9763831,0.0017007501,0.01130212,0.003948407,0.006080043],"study_design_scores_gemma":[0.0013227478,0.000017794631,0.0007886423,0.000083607105,0.000041878946,0.0000071227214,0.00028256077,0.9920568,0.000051606603,0.00046220733,0.004730703,0.00015434218],"about_ca_topic_score_codex":0.00039842946,"about_ca_topic_score_gemma":0.0000064220208,"teacher_disagreement_score":0.93877566,"about_ca_system_score_codex":0.000118695505,"about_ca_system_score_gemma":0.00006014134,"threshold_uncertainty_score":0.52486},"labels":[],"label_agreement":null},{"id":"W2036750826","doi":"10.5267/j.ijiec.2013.10.001","title":"A literature review on inventory modeling with reliability consideration","year":2013,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"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":"Reliability (semiconductor); Reliability engineering; Computer science; Engineering; Physics","score_opus":0.07487904659952839,"score_gpt":0.28810564091789664,"score_spread":0.21322659431836827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036750826","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024956958,0.98683167,0.0068939314,0.0010265504,0.0037025628,0.0009002816,0.000009269183,0.00006584598,0.000544932],"genre_scores_gemma":[0.00016731968,0.9929221,0.00041637899,0.000694189,0.005437614,0.000055269407,0.00020241505,0.000060338436,0.000044327262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770397,0.000036453846,0.0011343142,0.0002344752,0.0007244513,0.00016635573],"domain_scores_gemma":[0.9974994,0.00011545641,0.0010360909,0.00018707149,0.0011291216,0.00003287363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005496231,0.00037120286,0.00084656687,0.0010062249,0.000056932684,0.0005307055,0.00051956833,0.00017499842,0.000101220656],"category_scores_gemma":[0.0006121619,0.0002759817,0.00038692012,0.00049369055,0.000020056525,0.0008956589,0.00009174979,0.0008482423,0.00006369343],"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.00004358002,0.00030967488,0.000010564043,0.019022226,0.0014718894,0.00027949238,0.000040100327,0.49497274,1.5533266e-7,0.016360225,0.060230985,0.40725836],"study_design_scores_gemma":[0.00046010592,0.000033435783,1.5245496e-7,0.12754714,0.00043537733,0.00006678809,0.0000062756217,0.061967086,4.3653966e-8,0.00011963085,0.80910003,0.0002639462],"about_ca_topic_score_codex":0.000014336276,"about_ca_topic_score_gemma":8.591062e-7,"teacher_disagreement_score":0.74886906,"about_ca_system_score_codex":0.0002860206,"about_ca_system_score_gemma":0.0001761397,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W2041879434","doi":"10.5267/j.ijiec.2013.03.006","title":"Project selection problem under uncertainty: An application of utility theory and chance constrained programming to a real case","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Selection (genetic algorithm); Mathematical optimization; Computer science; Operations research; Expected utility hypothesis; Management science; Engineering; Artificial intelligence; Economics; Mathematical economics; Mathematics","score_opus":0.06433651472861027,"score_gpt":0.3669836832637936,"score_spread":0.30264716853518336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041879434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44449645,0.0000063167777,0.5545136,0.00034876983,0.00023291926,0.00033831902,0.000009106097,0.000016304968,0.00003825816],"genre_scores_gemma":[0.9711333,0.000008334204,0.028517751,0.000019168097,0.00026703847,0.000022494844,0.000008407287,0.000008339757,0.000015172159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815816,0.0001378212,0.0008270706,0.00017686967,0.00058665965,0.00011342282],"domain_scores_gemma":[0.99685377,0.0006044389,0.00052841543,0.00009209486,0.0018115485,0.000109713474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447026,0.0001049718,0.00019650467,0.00060969585,0.000058966027,0.00019030177,0.0002441695,0.0000807642,0.000015935984],"category_scores_gemma":[0.0008760741,0.00008869829,0.000055612352,0.0006078027,0.000043689175,0.0005409919,0.000034893666,0.00017738264,0.0000018679755],"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.00007530012,0.0000700398,0.001421168,0.0000014262097,0.000056539186,0.0000072205808,0.0006739369,0.7419145,0.000501048,0.0062219505,0.000093858805,0.24896298],"study_design_scores_gemma":[0.0011771977,0.00040903772,0.0029737777,0.000071403185,0.00003549788,0.0012453025,0.0015846243,0.9811788,0.00023644044,0.009792698,0.0011021462,0.00019303964],"about_ca_topic_score_codex":0.0005081901,"about_ca_topic_score_gemma":0.000035452802,"teacher_disagreement_score":0.52663684,"about_ca_system_score_codex":0.00006661624,"about_ca_system_score_gemma":0.00019972467,"threshold_uncertainty_score":0.3617011},"labels":[],"label_agreement":null},{"id":"W2043806944","doi":"10.5267/j.ijiec.2014.9.001","title":"Two-warehouse inventory model for deteriorating items with price-sensitive demand and partially backlogged shortages under inflationary conditions","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"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 Delhi; University Grants Commission","keywords":"Economic shortage; Warehouse; Economics; Econometrics; Business; Marketing","score_opus":0.035211270507663796,"score_gpt":0.2526546762344597,"score_spread":0.2174434057267959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043806944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3163462,0.000012824047,0.6810846,0.0011592652,0.0008088637,0.00025768141,0.000010001879,0.000049206286,0.0002713967],"genre_scores_gemma":[0.9938248,0.000002159013,0.0036702468,0.00046968515,0.0019105157,0.00001572283,0.000050817496,0.000025192174,0.000030889994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989764,0.0000134390675,0.00043443227,0.00013396738,0.0003019811,0.0001397456],"domain_scores_gemma":[0.9987783,0.00019576347,0.0003631733,0.00006020317,0.00057093607,0.000031644387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039746685,0.00014374324,0.00017510218,0.00042401443,0.00011451237,0.00025564127,0.00015250826,0.000049412036,0.000010196796],"category_scores_gemma":[0.00023554848,0.00013482198,0.00006537327,0.00012674273,0.000039740622,0.000807931,0.000058393824,0.00015751077,0.0000020788261],"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.00005827722,0.00003636047,0.0018393794,0.000013205392,0.00017826798,0.0000051142924,0.000096698976,0.97779346,0.00027388934,0.018526485,0.00064641156,0.00053247175],"study_design_scores_gemma":[0.0020081352,0.00004366239,0.0012768365,0.00016532795,0.00007337243,0.000014467408,0.00016088937,0.99304765,0.000036409867,0.0013259641,0.001685944,0.00016131133],"about_ca_topic_score_codex":0.000012837926,"about_ca_topic_score_gemma":0.000017018434,"teacher_disagreement_score":0.67747855,"about_ca_system_score_codex":0.00006652978,"about_ca_system_score_gemma":0.000055124685,"threshold_uncertainty_score":0.54978806},"labels":[],"label_agreement":null},{"id":"W2045902051","doi":"10.5267/j.ijiec.2011.08.015","title":"Modeling a four-layer location-routing problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Transshipment (information security); Integer programming; Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Product (mathematics); Layer (electronics); Operations research; Distribution (mathematics); Supply chain; Computer network; Engineering; Mathematics; Business","score_opus":0.09533972141092655,"score_gpt":0.28932847398911915,"score_spread":0.1939887525781926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045902051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050156537,0.00005019675,0.946441,0.00014604979,0.0024286625,0.00009440904,0.000004224138,0.00018713184,0.00049179705],"genre_scores_gemma":[0.7927297,0.000009432767,0.20651044,0.000015201784,0.0006813063,0.0000037485272,0.0000041003477,0.000039285664,0.000006801004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.000034996203,0.00071650674,0.00010457409,0.0003959602,0.00019216423],"domain_scores_gemma":[0.9986443,0.000125499,0.00015445297,0.000095680036,0.00086830324,0.00011175301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285617,0.00016675693,0.00020364019,0.0004736443,0.000039846134,0.00007825258,0.00041245334,0.00011864933,0.000035715268],"category_scores_gemma":[0.00038523605,0.00018148737,0.000103471306,0.00037421816,0.000012858824,0.00038788587,0.000037705442,0.0004580816,0.000009101637],"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.000010082631,0.000021846296,0.00021406588,0.00000538359,0.00019115467,0.000017604194,0.00077107485,0.9922208,0.00028923134,0.0008735552,0.00009587681,0.005289291],"study_design_scores_gemma":[0.00069236674,0.000028285454,0.00007871183,0.00019989855,0.0000301877,0.00014776026,0.00008467523,0.9976625,0.00056093826,0.0002038101,0.00014327459,0.00016763485],"about_ca_topic_score_codex":0.000013202345,"about_ca_topic_score_gemma":8.1336987e-7,"teacher_disagreement_score":0.74257314,"about_ca_system_score_codex":0.000189947,"about_ca_system_score_gemma":0.00010650223,"threshold_uncertainty_score":0.740084},"labels":[],"label_agreement":null},{"id":"W2049125983","doi":"10.5267/j.ijiec.2013.09.004","title":"Optimization of multi-response dynamic systems using principal component analysis (PCA)-based utility theory approach","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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":"Principal component analysis; Component (thermodynamics); Computer science; Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Physics; Control (management)","score_opus":0.1604123791344658,"score_gpt":0.4085364242494176,"score_spread":0.2481240451149518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049125983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26609582,0.000057907404,0.73248214,0.00005106774,0.0010451449,0.00020844769,0.000029203393,0.0000148836825,0.000015407899],"genre_scores_gemma":[0.70104903,4.7010352e-7,0.29883355,0.0000073784254,0.000071345494,0.000004717084,0.00001004704,0.0000114016875,0.000012048491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530464,0.0009946004,0.0017055488,0.00023866973,0.0015910912,0.00016545998],"domain_scores_gemma":[0.9934976,0.0028596302,0.0011886385,0.00023852444,0.0020657508,0.00014985137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005011392,0.00018579653,0.0005281783,0.0018092456,0.00005750479,0.0002892025,0.00089385937,0.00013098515,0.00012814483],"category_scores_gemma":[0.0039190715,0.00015845065,0.00037303288,0.0012310932,0.00008284751,0.00047484625,0.00007452257,0.00030298255,0.000003927765],"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.0002717982,0.00023864918,0.00081296946,0.0000022762877,0.0005480626,0.000004371013,0.00015074236,0.9918551,0.0048274864,0.00019108116,0.000009948187,0.0010875448],"study_design_scores_gemma":[0.0011789463,0.00006938538,0.003950595,0.0000444194,0.00012337332,0.000025675534,0.00035994904,0.99360925,0.00045351082,0.000042087115,0.000015900805,0.00012689005],"about_ca_topic_score_codex":0.00006928895,"about_ca_topic_score_gemma":2.492965e-7,"teacher_disagreement_score":0.4349532,"about_ca_system_score_codex":0.00031011453,"about_ca_system_score_gemma":0.00026560272,"threshold_uncertainty_score":0.646143},"labels":[],"label_agreement":null},{"id":"W2051723428","doi":"10.5267/j.ijiec.2013.02.002","title":"An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Imperialist competitive algorithm; Mathematical optimization; Computer science; Scheduling (production processes); Load balancing (electrical power); Job shop scheduling; Algorithm; Mathematics; Optimization problem; Multi-swarm optimization; Schedule","score_opus":0.01238465732272886,"score_gpt":0.243074439820891,"score_spread":0.23068978249816213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051723428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018095938,0.00007933675,0.97914755,0.0002653829,0.0017158365,0.00039587542,0.0000588621,0.00015636993,0.00008482393],"genre_scores_gemma":[0.4094534,0.000009864401,0.5892723,0.00003055922,0.0010718821,0.000040364703,0.00007373242,0.0000420417,0.000005868756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861616,0.000027850649,0.0005937102,0.00014948414,0.0004125711,0.00020025304],"domain_scores_gemma":[0.9975826,0.00025624988,0.00020934708,0.000080894184,0.0017231806,0.00014768398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025641153,0.00021451742,0.00027145608,0.00031403557,0.00008341143,0.0003358357,0.00022760162,0.00011352802,0.00003719095],"category_scores_gemma":[0.00015109361,0.00020187232,0.00008751731,0.00019733791,0.00002878703,0.0006688487,0.000013206178,0.00034931037,0.0000045121683],"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.00002466282,0.000045180797,0.000070542046,0.000005345805,0.00030218947,0.000007748336,0.00036529225,0.9877825,0.00051622116,0.00064696604,0.00007337219,0.010159986],"study_design_scores_gemma":[0.0027023812,0.0002079665,0.000095666655,0.00018411336,0.00003872239,0.00014488323,0.00026999682,0.9952145,0.0005815864,0.00017823337,0.0001508748,0.00023105743],"about_ca_topic_score_codex":0.000057847643,"about_ca_topic_score_gemma":0.000007745276,"teacher_disagreement_score":0.39135745,"about_ca_system_score_codex":0.00031560124,"about_ca_system_score_gemma":0.00022279834,"threshold_uncertainty_score":0.82321143},"labels":[],"label_agreement":null},{"id":"W2052531878","doi":"10.5267/j.ijiec.2014.3.001","title":"Manufacturer's pricing strategies in cooperative and non-cooperative advertising supply chain under retail competition","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Competition (biology); Supply chain; Business; Industrial organization; Pricing strategies; Advertising; Marketing","score_opus":0.017912665171850212,"score_gpt":0.23248416483856205,"score_spread":0.21457149966671182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052531878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7563296,0.000039821138,0.23594365,0.0033184777,0.0022431775,0.0002438499,0.000003191501,0.000038447408,0.0018398147],"genre_scores_gemma":[0.9975731,0.000007715739,0.00043199724,0.0004252402,0.0014932046,0.0000040379755,0.000023054046,0.000015713691,0.000025959642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892634,0.00002147887,0.000465882,0.0001353332,0.0003080494,0.00014289086],"domain_scores_gemma":[0.9992325,0.00012430456,0.00023838494,0.000052332973,0.00033232933,0.00002015327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041329674,0.00015278741,0.00020831078,0.0006460131,0.00006678268,0.00044186632,0.00019517542,0.00006293789,0.00006262469],"category_scores_gemma":[0.00016418114,0.00014600788,0.00004932626,0.00022008049,0.00003226978,0.0012013904,0.00007499602,0.00030325842,0.0000059223503],"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.00003596305,0.00004598819,0.001199775,0.00001250768,0.00008771004,0.000016230497,0.00023660126,0.9511477,0.00035926249,0.043889336,0.00026366726,0.0027052832],"study_design_scores_gemma":[0.0050625294,0.00011365732,0.022869825,0.0011221094,0.00006260409,0.00003583617,0.0032049015,0.95484394,0.00038922534,0.0023970136,0.009423383,0.0004749584],"about_ca_topic_score_codex":0.0001314686,"about_ca_topic_score_gemma":0.000045297125,"teacher_disagreement_score":0.2412435,"about_ca_system_score_codex":0.00012574988,"about_ca_system_score_gemma":0.00004372332,"threshold_uncertainty_score":0.5954029},"labels":[],"label_agreement":null},{"id":"W2061936903","doi":"10.5267/j.ijiec.2014.2.001","title":"A supplement to an EOQ model with imperfect quality items, inspection errors, shortage backordering, and sales return","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Economic shortage; Economic order quantity; Imperfect; Quality (philosophy); Operations management; Computer science; Operations research; Business; Economics; Marketing; Engineering; Supply chain","score_opus":0.040115127414961864,"score_gpt":0.2770246153179087,"score_spread":0.2369094879029468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061936903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74745107,0.000009867507,0.24789806,0.0028290178,0.0012518616,0.00020899849,0.000008693234,0.00008630291,0.0002561639],"genre_scores_gemma":[0.9937206,0.0000027545098,0.0037212505,0.00038231842,0.0020731753,0.0000074676304,0.000048041922,0.000022673263,0.000021704467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987486,0.00001665616,0.00046743904,0.00016578658,0.00045257492,0.00014895335],"domain_scores_gemma":[0.99919444,0.000051975745,0.00025528343,0.00009657598,0.0003535523,0.000048158578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064505753,0.00015399582,0.00018638808,0.00054818287,0.000079491365,0.0003151126,0.0002504663,0.000046968573,0.00002786164],"category_scores_gemma":[0.00018113329,0.00014019555,0.000051603143,0.00019315787,0.00001915594,0.0008024607,0.000089934656,0.00020282359,0.0000045272673],"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.00012215898,0.00009972612,0.006182147,0.000019977566,0.00015599217,0.000007746456,0.00020239636,0.96795535,0.00044737663,0.018238071,0.003388471,0.0031805863],"study_design_scores_gemma":[0.0017780868,0.0001565828,0.0035857647,0.00016892781,0.000054969438,0.00001808015,0.00033866116,0.96077025,0.00006178422,0.0003789443,0.032407913,0.0002800306],"about_ca_topic_score_codex":0.00014664266,"about_ca_topic_score_gemma":0.00009009176,"teacher_disagreement_score":0.24626957,"about_ca_system_score_codex":0.00010197271,"about_ca_system_score_gemma":0.000029817536,"threshold_uncertainty_score":0.5717009},"labels":[],"label_agreement":null},{"id":"W2062006607","doi":"10.5267/j.ijiec.2011.04.003","title":"A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Simulated annealing; Computer science; Scheduling (production processes); Due date; Mathematical optimization; Single-machine scheduling; Operations research; Heuristic; Operations management; Finished good; Job shop scheduling; Supply chain; Schedule; Production (economics); Mathematics; Business; Economics; Algorithm; Microeconomics","score_opus":0.037038459307314336,"score_gpt":0.23073734263687243,"score_spread":0.1936988833295581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062006607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042792488,0.000034883324,0.9557776,0.000061508275,0.0007311991,0.00019505453,0.000022087474,0.00019749551,0.000187705],"genre_scores_gemma":[0.4862706,0.000002727181,0.5133464,0.0000076758415,0.00030847394,0.000014821722,0.000008467581,0.000032987165,0.0000078719895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874717,0.000010750191,0.0006164529,0.00010588434,0.000342209,0.00017750461],"domain_scores_gemma":[0.998755,0.00014089627,0.0001641148,0.00007827361,0.0007365999,0.00012515488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023962339,0.00017661738,0.00025412499,0.0003640164,0.000040999366,0.000073920724,0.00029345302,0.00011787039,0.000012162217],"category_scores_gemma":[0.00007142694,0.00015907055,0.00011615778,0.00018442445,0.000017109307,0.00024323407,0.000017516297,0.00029702467,0.000004132204],"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.000066323075,0.00004128384,0.000026322365,0.000028725557,0.0003785669,0.000015826805,0.0006390784,0.9947235,0.00007284768,0.0028771823,0.000057711593,0.001072658],"study_design_scores_gemma":[0.001634816,0.00006950698,0.000008938729,0.00043945477,0.000073136835,0.00012393086,0.00017849871,0.9965727,0.00041518794,0.00029347118,0.000018016488,0.0001723589],"about_ca_topic_score_codex":0.0000023470125,"about_ca_topic_score_gemma":4.6305993e-7,"teacher_disagreement_score":0.4434781,"about_ca_system_score_codex":0.00018220139,"about_ca_system_score_gemma":0.0001245903,"threshold_uncertainty_score":0.64867085},"labels":[],"label_agreement":null},{"id":"W2062048695","doi":"10.5267/j.ijiec.2010.01.008","title":"The challenges of knowledge management portals application and implementation:An Iranian organizations case study","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Knowledge Management and Sharing","field":"Social Sciences","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":"Knowledge management; Business; Success factors; Computer science; Business administration","score_opus":0.036564689666399974,"score_gpt":0.3529851284442554,"score_spread":0.3164204387778554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062048695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853332,0.00012697815,0.008484121,0.0010260508,0.0023551339,0.00055425765,0.0000053871486,0.000034750457,0.0020800957],"genre_scores_gemma":[0.99858505,0.000047707133,0.0006123262,0.0000028494746,0.0007058462,0.000009078357,0.000003173577,0.000009208358,0.000024738718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9990303,0.000056721707,0.00043221467,0.000092037124,0.00029129625,0.00009740948],"domain_scores_gemma":[0.99872994,0.00017325915,0.0002482168,0.00008646044,0.0006884845,0.00007364043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000939303,0.000072985,0.00009878398,0.00024074609,0.00028170616,0.00012549534,0.00032455678,0.000039589147,0.000015815798],"category_scores_gemma":[0.000118126576,0.00006546304,0.000030098023,0.0002564912,0.000049812003,0.00026245575,0.00006467513,0.00017709323,0.0000012131205],"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.000017973776,0.0005725516,0.014550213,0.000010568147,0.0007495442,0.00016773382,0.04779517,0.0049783015,0.00019621114,0.6544175,0.00019894206,0.27634525],"study_design_scores_gemma":[0.012655146,0.0009866384,0.06034692,0.00022520892,0.0009982513,0.0010857217,0.78567415,0.03304278,0.000345828,0.0058034686,0.097602196,0.0012336762],"about_ca_topic_score_codex":0.0001177111,"about_ca_topic_score_gemma":0.0022078159,"teacher_disagreement_score":0.737879,"about_ca_system_score_codex":0.000038743074,"about_ca_system_score_gemma":0.00007851952,"threshold_uncertainty_score":0.26695052},"labels":[],"label_agreement":null},{"id":"W2064028888","doi":"10.5267/j.ijiec.2012.03.004","title":"Evolutionary approaches for scheduling a flexible manufacturing system with automated guided vehicles and robots","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Robot; Scheduling (production processes); Automated guided vehicle; Flexible manufacturing system; Computer science; Manufacturing engineering; Job shop scheduling; Engineering; Systems engineering; Embedded system; Artificial intelligence; Operations management","score_opus":0.04984062304677636,"score_gpt":0.256247388944878,"score_spread":0.2064067658981016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064028888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17446758,0.00033391215,0.822664,0.00012370746,0.001750704,0.00014152066,0.000015374784,0.00045828542,0.00004488607],"genre_scores_gemma":[0.76110786,0.000005667552,0.23795147,0.0000048379466,0.00087262824,0.000009388234,0.00001610636,0.000027732269,0.000004274574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990672,0.000012521053,0.00040705307,0.00007776175,0.0002493264,0.00018615155],"domain_scores_gemma":[0.9993226,0.000167344,0.0001237074,0.00005216976,0.00020814457,0.00012604939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023702958,0.00014457578,0.00018070583,0.00033402318,0.00006003491,0.00008477898,0.0001445794,0.000091865986,0.0000019395304],"category_scores_gemma":[0.00007394469,0.00013531387,0.000056227596,0.00011306011,0.000016674454,0.00037140644,0.00001859133,0.00020036288,0.0000011810455],"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.000020319076,0.00001930774,0.0002639693,0.000025454661,0.0002537519,0.0000028323182,0.00013894131,0.9963676,0.00005487347,0.0008089607,0.00011797575,0.0019260397],"study_design_scores_gemma":[0.0011930367,0.000031000935,0.0006717773,0.00026848726,0.00004029901,0.00035672405,0.00020006234,0.99588233,0.0010679525,0.000007440265,0.00013394328,0.00014695393],"about_ca_topic_score_codex":0.000002651249,"about_ca_topic_score_gemma":8.9717176e-8,"teacher_disagreement_score":0.5866403,"about_ca_system_score_codex":0.00018018488,"about_ca_system_score_gemma":0.00004527122,"threshold_uncertainty_score":0.5517939},"labels":[],"label_agreement":null},{"id":"W2073730750","doi":"10.5267/j.ijiec.2014.7.003","title":"A production inventory model with flexible manufacturing, random machine breakdown and stochastic repair time","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Time horizon; Production (economics); Profit (economics); Mathematical optimization; Stochastic process; Stock (firearms); Reliability (semiconductor); Function (biology); Computer science; Probability density function; Lead time; Reliability engineering; Operations research; Mathematics; Economics; Engineering; Operations management; Statistics; Microeconomics","score_opus":0.016604036988227867,"score_gpt":0.21121788892089507,"score_spread":0.1946138519326672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073730750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40861982,0.00007156388,0.58087325,0.0046425895,0.0034640746,0.0004907158,0.000005411064,0.00032263825,0.0015099155],"genre_scores_gemma":[0.99551916,0.000002037009,0.0013314529,0.00021238194,0.0025922335,0.000006045485,0.0000180856,0.0000237073,0.00029487212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.000009531638,0.0003477407,0.00013919146,0.00038255262,0.00012049208],"domain_scores_gemma":[0.9993308,0.000045554818,0.00028003368,0.000079127516,0.00023835778,0.000026118048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042902955,0.00013894353,0.00017484192,0.00054511905,0.00006206888,0.00015690434,0.00018169788,0.000041908235,0.000036779944],"category_scores_gemma":[0.00020747192,0.00012034774,0.00007212606,0.00010813443,0.00002828348,0.00064344815,0.00006969574,0.00020650293,0.000011582854],"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.00014948293,0.000050570983,0.00018610849,0.000014728947,0.00016721612,0.0000047500116,0.000034450095,0.9919827,0.000059339716,0.002051124,0.0029103197,0.0023892173],"study_design_scores_gemma":[0.002324073,0.000035043846,0.00019929901,0.00018313079,0.00007601937,0.00003934085,0.000016788159,0.9887842,0.000050524373,0.000603806,0.007545105,0.00014265049],"about_ca_topic_score_codex":0.000029387462,"about_ca_topic_score_gemma":0.0000019667013,"teacher_disagreement_score":0.58689934,"about_ca_system_score_codex":0.00006773182,"about_ca_system_score_gemma":0.000027020084,"threshold_uncertainty_score":0.4907638},"labels":[],"label_agreement":null},{"id":"W2076465973","doi":"10.5267/j.ijiec.2014.7.006","title":"A production inventory model with exponential demand rate and reverse logistics","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Finished good; Supply chain; Profit (economics); Economic order quantity; Production (economics); Imperfect; Inventory control; Production schedule; Operations research; Computer science; Reverse logistics; Holding cost; Idle; Raw material; Schedule; Operations management; Business; Economics; Microeconomics; Engineering; Marketing","score_opus":0.03566176938265155,"score_gpt":0.22568727866937835,"score_spread":0.1900255092867268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076465973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2715136,0.000021484831,0.72042733,0.0034645787,0.0037887678,0.0001750138,0.0000018521939,0.000055671928,0.000551675],"genre_scores_gemma":[0.99493545,0.000005549045,0.0014488378,0.00026581154,0.0032486317,0.0000029645691,0.000009513359,0.000014254249,0.00006896031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992248,0.000010478619,0.00029219245,0.000105385225,0.0002723148,0.00009484759],"domain_scores_gemma":[0.9992747,0.000033223187,0.00026585112,0.000057295438,0.0003492997,0.000019672974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045042188,0.00010236667,0.000121219666,0.0003873584,0.000049495713,0.00016673726,0.00015592076,0.000038089107,0.000012469653],"category_scores_gemma":[0.00036189597,0.000091619295,0.00003850162,0.00012045823,0.0000318781,0.000575158,0.000057448407,0.00016385794,0.00000423371],"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.00006557175,0.000040066185,0.00062899495,0.000013234296,0.00009602134,0.000011627069,0.00003774304,0.98379207,0.00016264955,0.00959864,0.004374364,0.0011789997],"study_design_scores_gemma":[0.0013127576,0.00003211543,0.00032800093,0.00016104878,0.00007389737,0.00002132789,0.00005721316,0.98060876,0.000040302126,0.0011296639,0.0160995,0.00013538712],"about_ca_topic_score_codex":0.000015929445,"about_ca_topic_score_gemma":0.0000024364074,"teacher_disagreement_score":0.7234219,"about_ca_system_score_codex":0.000048793354,"about_ca_system_score_gemma":0.000026204878,"threshold_uncertainty_score":0.37361264},"labels":[],"label_agreement":null},{"id":"W2086936050","doi":"10.5267/j.ijiec.2013.11.003","title":"Inventory control with deteriorating items: A state-of-the-art literature review","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":21,"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":"State (computer science); Control (management); Inventory control; Operations management; Reliability engineering; Operations research; Computer science; Business; Engineering; Artificial intelligence; Algorithm","score_opus":0.010144483491290211,"score_gpt":0.22339317047987609,"score_spread":0.21324868698858587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086936050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007379375,0.001012594,0.98938847,0.00027322923,0.0016606959,0.00013098928,0.000016460825,0.00004768846,0.00009050121],"genre_scores_gemma":[0.98974675,0.00029991523,0.009437657,0.000074139454,0.00038761902,0.0000041153407,0.000009653317,0.000023939383,0.000016228141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909467,0.000027694361,0.00045112078,0.00005745502,0.000279367,0.000089706766],"domain_scores_gemma":[0.999102,0.00013655581,0.00024134199,0.00008211017,0.00039142155,0.000046573878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019249212,0.00011163201,0.00019151159,0.00013868732,0.000022409673,0.000039177452,0.00023442428,0.00003970157,0.0000032325036],"category_scores_gemma":[0.0003661826,0.000084135245,0.00007407252,0.0001694022,0.00001984527,0.00016405183,0.000014184834,0.0003218924,8.3933077e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010337725,0.00000856867,0.00007689947,0.00006246311,0.00009256324,0.000004168215,0.00005104163,0.9945044,0.00012517102,0.00011581458,0.0004103548,0.004538223],"study_design_scores_gemma":[0.002299781,0.00016013795,0.0002886773,0.011158879,0.000101563266,0.00022547299,0.0000075695575,0.9723546,0.0014267026,0.00027804862,0.011424791,0.00027376768],"about_ca_topic_score_codex":5.943848e-7,"about_ca_topic_score_gemma":7.6213e-7,"teacher_disagreement_score":0.98236734,"about_ca_system_score_codex":0.000069542315,"about_ca_system_score_gemma":0.000035867182,"threshold_uncertainty_score":0.34309357},"labels":[],"label_agreement":null},{"id":"W2089504200","doi":"10.5267/j.ijiec.2011.11.002","title":"Risk mitigation in the implementation of AMTs: A guiding framework for future","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","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":"Risk analysis (engineering); Computer science; Environmental science; Engineering; Environmental planning; Systems engineering; Business","score_opus":0.02696221522909507,"score_gpt":0.29860766239423625,"score_spread":0.27164544716514116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089504200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77900785,0.00010505142,0.21341686,0.0029152392,0.0041610156,0.00032233843,0.000011387819,0.000011989669,0.000048268645],"genre_scores_gemma":[0.98829174,0.000016799058,0.004833581,0.00015055027,0.0066677094,0.000012248619,0.000018286904,0.000008161255,8.97838e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989999,0.000013035526,0.0004664804,0.00005346491,0.00034139917,0.00012575576],"domain_scores_gemma":[0.99887013,0.00026471852,0.00052454276,0.00005327196,0.00027863975,0.0000086776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008308384,0.00007768242,0.000107241176,0.00043625938,0.00004484954,0.000089538466,0.00029793975,0.000049588103,0.000020361182],"category_scores_gemma":[0.00033023616,0.000060087026,0.000092864524,0.00030538614,0.0000107146525,0.000708419,0.00002842308,0.00014227782,0.0000016809013],"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.00011291335,0.0003204071,0.22100028,0.000055303437,0.00039907364,0.0000067088636,0.0038813464,0.38995868,0.00017485014,0.29892525,0.0057673384,0.07939784],"study_design_scores_gemma":[0.0135578355,0.00030051285,0.5295242,0.0015951956,0.0008688107,0.000071553244,0.09409546,0.15342383,0.0013478505,0.0455705,0.15845144,0.0011927969],"about_ca_topic_score_codex":0.00008270935,"about_ca_topic_score_gemma":0.0000070722317,"teacher_disagreement_score":0.30852392,"about_ca_system_score_codex":0.000052283136,"about_ca_system_score_gemma":0.000022925491,"threshold_uncertainty_score":0.24502778},"labels":[],"label_agreement":null},{"id":"W2094252454","doi":"10.5267/j.ijiec.2012.09.001","title":"Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":125,"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":"Optimization algorithm; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04034164815511341,"score_gpt":0.3085967055323746,"score_spread":0.2682550573772612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094252454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002367377,0.000033588367,0.9953801,0.0002244772,0.0015503053,0.00031712366,0.000023350422,0.00006234439,0.000041322353],"genre_scores_gemma":[0.31994724,0.0000044418366,0.6794152,0.00001479815,0.00050149416,0.000012492224,0.00007792852,0.000015257723,0.000011135184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977511,0.00013447778,0.0009086219,0.00017162299,0.0007641667,0.00026997694],"domain_scores_gemma":[0.9963758,0.0006228059,0.00075573917,0.0001399692,0.00190767,0.00019804452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039573,0.00018109496,0.0003289684,0.00072620605,0.00013481721,0.00019991856,0.00078321894,0.00010651479,0.000024306657],"category_scores_gemma":[0.00082261395,0.00018729262,0.00011462534,0.00037553426,0.000047912992,0.0014683482,0.00006768893,0.00046035036,8.87216e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001846227,0.00020133278,0.00007528658,0.000010107544,0.00010791798,0.0000012254158,0.00036710425,0.9812203,0.000045931465,0.00062468956,0.000041664396,0.017285978],"study_design_scores_gemma":[0.0017152794,0.00037781274,0.00004605858,0.00014401432,0.000022501445,0.000047641744,0.00003665722,0.9965947,0.00061624654,0.000009766061,0.00022455501,0.00016472259],"about_ca_topic_score_codex":0.000008386523,"about_ca_topic_score_gemma":1.6448037e-7,"teacher_disagreement_score":0.31757987,"about_ca_system_score_codex":0.00018116846,"about_ca_system_score_gemma":0.00036291755,"threshold_uncertainty_score":0.76375717},"labels":[],"label_agreement":null},{"id":"W2095179834","doi":"10.5267/j.ijiec.2015.1.002","title":"Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Tardiness; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Operations management; Operations research; Engineering; Mathematics; Schedule","score_opus":0.02387084335700035,"score_gpt":0.25752550882264397,"score_spread":0.23365466546564362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095179834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4002816,0.000031848824,0.5961957,0.0005250992,0.0027525097,0.00006508783,0.000019354338,0.00007054459,0.00005824998],"genre_scores_gemma":[0.8682018,0.0000078507,0.13102914,0.000042188924,0.00066129945,0.000003302945,0.000006681171,0.000025911444,0.000021854372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998915,0.0000211038,0.00040715223,0.00011714135,0.00036462693,0.00017497472],"domain_scores_gemma":[0.9987862,0.00016724129,0.00010705955,0.00006649045,0.0005907068,0.00028231405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027532293,0.0001652644,0.00023467757,0.00038023395,0.000028218288,0.00012903592,0.00018568963,0.00010809005,0.000013851507],"category_scores_gemma":[0.00040370272,0.00016883563,0.000066023786,0.00025876542,0.000032840617,0.00025241374,0.00004146201,0.00036108732,0.000006931898],"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.00002804744,0.00002941488,0.000101991514,0.0000024758174,0.00018527887,0.000025758958,0.0002215968,0.989761,0.00029718154,0.00015363579,0.00012939633,0.009064219],"study_design_scores_gemma":[0.0023523844,0.000043790988,0.0011006367,0.00021717993,0.000027883312,0.0002738373,0.0001298416,0.9947977,0.0005700096,0.000103059894,0.00015921718,0.00022444449],"about_ca_topic_score_codex":0.0000057805664,"about_ca_topic_score_gemma":3.7765966e-7,"teacher_disagreement_score":0.46792018,"about_ca_system_score_codex":0.00018389306,"about_ca_system_score_gemma":0.00011918327,"threshold_uncertainty_score":0.6884917},"labels":[],"label_agreement":null},{"id":"W2097927160","doi":"10.5267/j.ijiec.2013.06.005","title":"Two-warehouse production policy for different demands under volume flexibility","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Flexibility (engineering); Warehouse; Holding cost; Operations research; Volume (thermodynamics); Production (economics); Stock (firearms); Mathematical optimization; Carrying cost; Function (biology); Computer science; Operations management; Economics; Total cost; Microeconomics; Mathematics; Business; Engineering; Marketing","score_opus":0.04805879213032813,"score_gpt":0.27407375148010044,"score_spread":0.2260149593497723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097927160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7468266,0.00002929033,0.21554495,0.02484546,0.011285172,0.00081668654,0.000007893066,0.00014662796,0.0004973388],"genre_scores_gemma":[0.9878112,0.0000020334687,0.0007148222,0.00041084632,0.010786222,0.000029282903,0.000027584536,0.000022309792,0.00019568416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988453,0.0000075971852,0.0004980165,0.00013653187,0.00035145745,0.00016112089],"domain_scores_gemma":[0.99852103,0.00006248481,0.00031555278,0.00009419221,0.0009807401,0.000026002223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025427662,0.00013823126,0.00016579044,0.0006555261,0.000067448615,0.0003179417,0.00030963396,0.00004795185,0.00011792997],"category_scores_gemma":[0.00067851646,0.00012550643,0.00013277517,0.00025314157,0.000021131516,0.00091751193,0.00007775358,0.00016837522,0.000029360695],"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.00004584237,0.0001861965,0.0020182214,0.000023020488,0.0002620847,0.000002083076,0.000042102645,0.94062686,0.00034185508,0.023009399,0.023159795,0.010282559],"study_design_scores_gemma":[0.007733849,0.00015475448,0.026744138,0.0004455292,0.00022299678,0.000041406194,0.0005960668,0.8414906,0.000588877,0.025226235,0.09594956,0.00080595375],"about_ca_topic_score_codex":0.00016464686,"about_ca_topic_score_gemma":0.0000055225546,"teacher_disagreement_score":0.24098463,"about_ca_system_score_codex":0.00021673641,"about_ca_system_score_gemma":0.000052390227,"threshold_uncertainty_score":0.51180035},"labels":[],"label_agreement":null},{"id":"W2099507590","doi":"10.5267/j.ijiec.2014.11.002","title":"A De Novo programming approach for a robust closed-loop supply chain network design under uncertainty: An M/M/1 queueing model","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":21,"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":"Queueing theory; Mathematical optimization; Computer science; Programming paradigm; Nonlinear programming; Linear programming; Supply chain network; Robust optimization; Fuzzy logic; Layered queueing network; Integer programming; Supply chain; Operations research; Nonlinear system; Supply chain management; Mathematics; Computer network; Artificial intelligence","score_opus":0.081387449982893,"score_gpt":0.26877113448624557,"score_spread":0.18738368450335258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099507590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011808824,0.00003718098,0.98499405,0.0012661335,0.0010918474,0.0006065953,0.0000035994672,0.00010429746,0.00008747155],"genre_scores_gemma":[0.6054621,0.0000012974078,0.38669872,0.0004801177,0.007060621,0.00007452368,0.00008451016,0.00006834616,0.00006977119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813795,0.000029942476,0.00061623746,0.00021164009,0.0005741338,0.00043009166],"domain_scores_gemma":[0.9978833,0.00018336384,0.00044206672,0.00011929981,0.0012933045,0.00007866589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019149598,0.00022890576,0.00026608433,0.00067926385,0.00010833701,0.0007424828,0.0006321932,0.00011991076,0.0000055353157],"category_scores_gemma":[0.00066541426,0.00023871873,0.00013911008,0.0004721881,0.000025858059,0.0011069961,0.00012298296,0.00033879638,0.0000014050592],"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.00018794744,0.0001336648,0.0001792277,0.000020171172,0.00022399049,0.000028384397,0.00014225618,0.97261864,0.000010424507,0.016176894,0.0023660318,0.007912339],"study_design_scores_gemma":[0.0025713672,0.000059922848,0.000018643526,0.000103378195,0.000092515846,0.000032688065,0.0010239162,0.9895175,0.0000026963303,0.003792964,0.0025481172,0.0002362768],"about_ca_topic_score_codex":0.00011977425,"about_ca_topic_score_gemma":0.0000049060886,"teacher_disagreement_score":0.59829533,"about_ca_system_score_codex":0.00057178416,"about_ca_system_score_gemma":0.00038627902,"threshold_uncertainty_score":0.97346675},"labels":[],"label_agreement":null},{"id":"W2099721629","doi":"10.5267/j.ijiec.2010.06.003","title":"A variable neighborhood descent based heuristic to solve the capacitated location-routing problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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":"Variable neighborhood search; Descent (aeronautics); Heuristic; Variable (mathematics); Mathematical optimization; Computer science; Routing (electronic design automation); Facility location problem; Vehicle routing problem; Mathematics; Metaheuristic; Geography; Computer network","score_opus":0.022228937370306505,"score_gpt":0.25980138173700446,"score_spread":0.23757244436669794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099721629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016012449,0.000012548055,0.9774641,0.0017053747,0.004277058,0.00021048285,0.000014748699,0.0001474766,0.00015578131],"genre_scores_gemma":[0.71020365,7.189173e-7,0.28883994,0.00007856542,0.00081830355,0.000009374977,0.000009414821,0.00003564868,0.000004411482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985087,0.000034464007,0.00064730545,0.000117215444,0.00046739724,0.00022494401],"domain_scores_gemma":[0.9977637,0.00066278444,0.00018706522,0.00014674816,0.0010844684,0.00015521239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008065647,0.00017858788,0.00018987492,0.00037535702,0.00008214615,0.00020700002,0.0005473654,0.00011518714,0.000037595186],"category_scores_gemma":[0.0016759429,0.0001594667,0.000078292855,0.0007022089,0.000022461336,0.00018147155,0.000035004246,0.0008505664,0.00001004303],"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.000010491054,0.000030261903,0.00016913621,0.0000057472184,0.00012293455,0.0000059541635,0.00028204452,0.98864156,0.003499489,0.003856248,0.0005646588,0.002811493],"study_design_scores_gemma":[0.0007970838,0.000036924284,0.00028903017,0.00017220424,0.000036635636,0.00007184739,0.00005169167,0.9957208,0.0009429706,0.00020474485,0.0015048815,0.00017116078],"about_ca_topic_score_codex":0.000011138159,"about_ca_topic_score_gemma":0.000002366575,"teacher_disagreement_score":0.69419116,"about_ca_system_score_codex":0.00017069634,"about_ca_system_score_gemma":0.00024577722,"threshold_uncertainty_score":0.6502863},"labels":[],"label_agreement":null},{"id":"W2100319281","doi":"10.5267/j.ijiec.2013.01.005","title":"Computer aided FEA simulation of EN45A parabolic leaf spring","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Mechanical Engineering and Vibrations Research","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":"Leaf spring; Workbench; Finite element method; Spring (device); Displacement (psychology); Structural engineering; Engineering; Discretization; Mechanical engineering; Mathematics; Mathematical analysis","score_opus":0.040058373388247595,"score_gpt":0.2888875495843976,"score_spread":0.24882917619615003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100319281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2426694,0.000059192986,0.7550571,0.00010434286,0.0018316713,0.00012418603,0.0000072349794,0.00008732749,0.000059550373],"genre_scores_gemma":[0.9877784,0.00001800501,0.011147392,0.000009430973,0.0009932801,0.000006530317,0.000006871693,0.00003078567,0.000009268435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984481,0.000022331187,0.0007573476,0.0000926677,0.0004949167,0.00018464698],"domain_scores_gemma":[0.99862635,0.00039174967,0.00013239164,0.00011440605,0.0006023071,0.00013277763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020436684,0.00015128513,0.00025735534,0.0005664137,0.00002457119,0.00009168805,0.00037059907,0.00011779111,0.000087267785],"category_scores_gemma":[0.00020496068,0.00015403224,0.00013515282,0.00029956936,0.000018030687,0.00038791992,0.000042101696,0.00042993916,0.000022704482],"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.000006024527,0.00002986836,0.00006924948,0.00001025836,0.00016952112,0.000004565352,0.00006927484,0.9780394,0.0040317182,0.0006265738,0.00021486555,0.016728701],"study_design_scores_gemma":[0.00072392914,0.000062120474,0.00076573086,0.00014969647,0.000012474204,0.000017959064,0.000013697021,0.99423337,0.0030599546,0.00008340765,0.0007489139,0.00012876504],"about_ca_topic_score_codex":0.000024526531,"about_ca_topic_score_gemma":4.57728e-7,"teacher_disagreement_score":0.745109,"about_ca_system_score_codex":0.00010853645,"about_ca_system_score_gemma":0.00005514457,"threshold_uncertainty_score":0.62812525},"labels":[],"label_agreement":null},{"id":"W2100803993","doi":"10.5267/j.ijiec.2010.07.001","title":"Supply chain coordination for a deteriorating product under stock-dependent consumption rate and unreliable production process","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Supply chain; Stock (firearms); Production (economics); Consumption (sociology); Product (mathematics); Process (computing); Business; Industrial organization; Computer science; Economics; Microeconomics; Engineering; Mathematics; Marketing","score_opus":0.03461427994584808,"score_gpt":0.2676561236673826,"score_spread":0.23304184372153453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100803993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94000345,0.000022802784,0.045880552,0.0049227844,0.008500564,0.00056313345,0.000005492791,0.00005901849,0.00004220485],"genre_scores_gemma":[0.9942726,0.0000032123305,0.0010787691,0.00013124384,0.0043597086,0.00003380667,0.00003076781,0.000021853104,0.000068054884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989325,0.000008990486,0.00044831441,0.00017567993,0.00029540213,0.00013914726],"domain_scores_gemma":[0.99851733,0.0000844961,0.0004368221,0.00006786434,0.0008725147,0.000020943382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081419357,0.00013523639,0.00014684998,0.00052962045,0.000109054454,0.00034868214,0.00018867175,0.000057152225,0.000028512926],"category_scores_gemma":[0.00083296705,0.00013519816,0.000053161693,0.00016038735,0.000027353057,0.0010719773,0.0000458658,0.00026858307,0.0000036133326],"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.00038950786,0.000362479,0.018023165,0.00026845068,0.0004923861,0.000014901915,0.00033282264,0.8589142,0.051680684,0.02675077,0.005564866,0.03720574],"study_design_scores_gemma":[0.008097763,0.00017696667,0.012947845,0.0008755631,0.00031449643,0.0001614129,0.00073808944,0.9388263,0.006729513,0.0062867166,0.023928765,0.00091651845],"about_ca_topic_score_codex":0.000023826626,"about_ca_topic_score_gemma":0.0000156356,"teacher_disagreement_score":0.079912126,"about_ca_system_score_codex":0.000063317246,"about_ca_system_score_gemma":0.000049811337,"threshold_uncertainty_score":0.5513221},"labels":[],"label_agreement":null},{"id":"W2103221059","doi":"10.5267/j.ijiec.2011.04.002","title":"Optimal production strategy for deteriorating items with varying demand pattern under inflation","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Production (economics); Economic shortage; Cash flow; Mathematical optimization; Time value of money; Inflation (cosmology); Economics; Discounted cash flow; Operations research; Sensitivity (control systems); Value (mathematics); Function (biology); Econometrics; Computer science; Microeconomics; Mathematics; Statistics; Engineering","score_opus":0.07408715524230598,"score_gpt":0.2529849515047224,"score_spread":0.17889779626241642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103221059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39183962,0.000011907888,0.6046283,0.00040842328,0.0024657561,0.0002562411,0.0000020907348,0.000046097426,0.0003415252],"genre_scores_gemma":[0.9930771,0.0000011785954,0.003346908,0.000096808646,0.0034061975,0.000012313495,0.000021586866,0.000021820893,0.000016084108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903595,0.0000062440186,0.00042683055,0.00011905666,0.00028426424,0.0001276753],"domain_scores_gemma":[0.9988872,0.00004106986,0.00042614626,0.00005585354,0.0005736593,0.000016061367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003057297,0.00012300209,0.00012770717,0.00043717553,0.000071912924,0.00021174784,0.0001962342,0.00004734641,0.000036949183],"category_scores_gemma":[0.00010796763,0.00011177088,0.000065051725,0.00016827068,0.000015424317,0.0011366432,0.0000350684,0.00014718242,0.0000038229227],"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.000097610595,0.0000555375,0.0017127135,0.000017042254,0.00018388403,0.000011212186,0.00013248902,0.9866611,0.00034692214,0.0012745883,0.00030480346,0.009202109],"study_design_scores_gemma":[0.004769049,0.00028079058,0.005522355,0.0007342283,0.0002390181,0.00010760303,0.0007900715,0.98019993,0.0012024892,0.0009561027,0.004626446,0.00057189545],"about_ca_topic_score_codex":0.000041703035,"about_ca_topic_score_gemma":0.0000041985627,"teacher_disagreement_score":0.6012814,"about_ca_system_score_codex":0.00007253962,"about_ca_system_score_gemma":0.000036733025,"threshold_uncertainty_score":0.45578843},"labels":[],"label_agreement":null},{"id":"W2103594559","doi":"10.5267/j.ijiec.2013.04.002","title":"Optimization of multiple performance characteristics in turning using Taguchi’s quality loss function: An experimental investigation","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","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":"Taguchi methods; Quality (philosophy); Function (biology); Computer science; Engineering; Control theory (sociology); Statistics; Mathematics; Artificial intelligence; Biology; Physics","score_opus":0.03909334774248556,"score_gpt":0.2811338005585801,"score_spread":0.24204045281609454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103594559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6288416,0.000027385038,0.3700987,0.000013435854,0.00091306376,0.00006702253,0.000004538198,0.000027482027,0.000006778512],"genre_scores_gemma":[0.9622203,0.000014971158,0.037393752,0.000008549051,0.00028820313,0.0000044895137,0.000046215027,0.00002245933,0.0000010720134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987471,0.00002407562,0.00077254104,0.000084033236,0.0002646547,0.00010755659],"domain_scores_gemma":[0.99904275,0.000091705566,0.00032063582,0.000059141912,0.0004206274,0.0000651451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017794853,0.00012367546,0.0001966943,0.00034658093,0.000028931434,0.000056426947,0.000159293,0.00008476666,0.000025687516],"category_scores_gemma":[0.00017131522,0.00013745093,0.00004068833,0.00022739262,0.000021414582,0.0010717735,0.000018217708,0.00025380097,6.516897e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024208,0.00003447306,0.010096342,0.0000141569135,0.000032124583,0.0000012214872,0.00030392103,0.98184824,0.0057267337,0.0000644402,0.000003024557,0.0018510948],"study_design_scores_gemma":[0.0008636406,0.00007057985,0.0077839107,0.00018475404,0.0000090966505,0.00001915352,0.00010625402,0.9876518,0.003156612,0.000022366177,0.000008442716,0.00012335053],"about_ca_topic_score_codex":0.000024167444,"about_ca_topic_score_gemma":8.1697584e-7,"teacher_disagreement_score":0.3333787,"about_ca_system_score_codex":0.00016689027,"about_ca_system_score_gemma":0.000057885984,"threshold_uncertainty_score":0.5605086},"labels":[],"label_agreement":null},{"id":"W2103831927","doi":"10.5267/j.ijiec.2014.10.002","title":"Intermodal network expansion in a competitive environment with uncertain demands","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","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":"Computer science; Mathematical optimization; Business; Industrial organization; Mathematics","score_opus":0.029521733447821018,"score_gpt":0.23267064300764614,"score_spread":0.20314890955982512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103831927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20864607,0.00023055136,0.78489584,0.0004243733,0.0037826702,0.00019136225,0.000022306636,0.00009684033,0.0017099831],"genre_scores_gemma":[0.9918002,0.000015714311,0.007314839,0.000016155713,0.0008045885,0.0000034247516,0.000015878904,0.00001787388,0.000011315941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990455,0.000015900754,0.00040895786,0.00006761937,0.00032439863,0.00013765645],"domain_scores_gemma":[0.99951845,0.00010261259,0.00008817617,0.00005048168,0.00013303652,0.000107254054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023165917,0.00011657983,0.00017379507,0.0002058766,0.00001046885,0.000043484884,0.00017397311,0.000063292166,0.000024322553],"category_scores_gemma":[0.000067074885,0.00010553299,0.000038536073,0.00010885598,0.00002103765,0.00012434045,0.0000272812,0.00032780427,0.0000029176358],"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.000042111253,0.000028217668,0.0012026707,0.0000020419043,0.00008217681,0.00017158664,0.00020063028,0.9936094,0.000011632662,0.0010562274,0.00071885576,0.0028744254],"study_design_scores_gemma":[0.0034187152,0.00028291118,0.0020883726,0.00051541073,0.000031807653,0.00035869738,0.00024734435,0.9816906,0.00008076443,0.00055385055,0.010445854,0.00028568093],"about_ca_topic_score_codex":0.000017761831,"about_ca_topic_score_gemma":0.0000062926047,"teacher_disagreement_score":0.78315413,"about_ca_system_score_codex":0.0002632214,"about_ca_system_score_gemma":0.00007631274,"threshold_uncertainty_score":0.43035105},"labels":[],"label_agreement":null},{"id":"W2105350070","doi":"10.5267/j.ijiec.2011.02.001","title":"A hybrid multiple attribute decision making method for solving problems of industrial environment","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Industrial Technology and Control Systems","field":"Engineering","cited_by":35,"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":"Computer science; Mathematical optimization; Industrial engineering; Management science; Mathematics; Engineering","score_opus":0.053570758993873896,"score_gpt":0.26296312679764106,"score_spread":0.20939236780376716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105350070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08377022,0.00012420944,0.9108936,0.00005405058,0.0045516873,0.00039414706,0.00008894363,0.00008369872,0.00003943734],"genre_scores_gemma":[0.95340276,0.000012085051,0.04534487,0.0000055245773,0.0011587228,0.000025781163,0.000010515563,0.00003665877,0.0000030824046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980613,0.00002838383,0.001151343,0.0001401863,0.0003798987,0.00023890169],"domain_scores_gemma":[0.99831533,0.0007584931,0.00044203238,0.0001268336,0.0002860279,0.000071275106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078254583,0.00020619894,0.0004204993,0.0005653998,0.000048846654,0.000033071126,0.00051865506,0.00028548398,0.000028125003],"category_scores_gemma":[0.0007740724,0.00021102464,0.00024001588,0.00013732031,0.000026319773,0.00022599632,0.000055221357,0.00057402154,0.0000026364964],"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.00018031997,0.000070449765,0.0006794345,0.00001002504,0.00064103893,0.000017286196,0.00020808971,0.9299444,0.002399129,0.00066324807,0.0006427192,0.06454387],"study_design_scores_gemma":[0.009510386,0.00048274512,0.00021435601,0.0016022092,0.00019988052,0.00030377563,0.0001309203,0.9621349,0.017102398,0.0017515981,0.006081979,0.00048483352],"about_ca_topic_score_codex":0.000015479154,"about_ca_topic_score_gemma":0.0000013455372,"teacher_disagreement_score":0.86963254,"about_ca_system_score_codex":0.00022055898,"about_ca_system_score_gemma":0.00007964778,"threshold_uncertainty_score":0.86053354},"labels":[],"label_agreement":null},{"id":"W2108691025","doi":"10.5267/j.ijiec.2012.01.005","title":"An EPQ model under two levels of trade credit and limited storage space","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Trade credit; Purchasing; Economic order quantity; Order (exchange); Microeconomics; Space (punctuation); Business; Holding cost; Production (economics); Operations research; Economics; Computer science; Supply chain; Operations management; Finance; Marketing; Mathematics","score_opus":0.06959457356969304,"score_gpt":0.27675279690622306,"score_spread":0.20715822333653003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108691025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70371723,0.00009073891,0.28956717,0.0023897225,0.003353829,0.00014092545,0.000017788647,0.000046277073,0.00067635276],"genre_scores_gemma":[0.9948547,0.0000025076324,0.0017130164,0.00019251597,0.0031949442,0.0000012910006,0.000010005955,0.000016354072,0.000014678819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905646,0.00000888577,0.00037250525,0.00007268792,0.0003564297,0.00013302165],"domain_scores_gemma":[0.9993417,0.000077200624,0.00029865824,0.000065695895,0.00018020823,0.000036533464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481515,0.000109061686,0.00015212363,0.00050453376,0.00003237102,0.000107704895,0.00022902037,0.000046906596,0.00004463005],"category_scores_gemma":[0.0001294992,0.00010845316,0.00006371751,0.00016092416,0.000022977854,0.0012493549,0.00005358035,0.00018057876,0.0000019511556],"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.000022495078,0.00012035236,0.0010407182,0.000008967596,0.00013118408,0.0000035015978,0.00011668332,0.9601585,0.0010731135,0.03451422,0.001499357,0.0013108744],"study_design_scores_gemma":[0.0017110503,0.000026501244,0.0071516763,0.00010738064,0.00007417878,0.000015028396,0.00023655099,0.9861293,0.00014435072,0.00086161826,0.0033832516,0.00015914526],"about_ca_topic_score_codex":0.000021327865,"about_ca_topic_score_gemma":9.486877e-7,"teacher_disagreement_score":0.2911375,"about_ca_system_score_codex":0.00005878889,"about_ca_system_score_gemma":0.000026424763,"threshold_uncertainty_score":0.44225916},"labels":[],"label_agreement":null},{"id":"W2109346100","doi":"10.5267/j.ijiec.2012.10.001","title":"Differential evolution algorithm for multi-commodity and multi-level of service hub covering location problem","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Punctuality; Commodity; Service (business); Computer science; Reliability (semiconductor); Quality of service; Operations research; Mathematical optimization; Economics; Business; Mathematics; Computer network; Engineering; Marketing; Transport engineering; Finance","score_opus":0.11017214759722337,"score_gpt":0.3225071914205642,"score_spread":0.21233504382334084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109346100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043059744,0.000093622315,0.95429236,0.000102727936,0.0021045431,0.00018878731,0.00010130581,0.00005448549,0.0000024318028],"genre_scores_gemma":[0.52815753,0.0000056991344,0.47129536,0.000004921008,0.00048353153,0.000006147154,0.000021994976,0.000021716902,0.0000030841425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888724,0.000033404176,0.00056956615,0.00007971866,0.00025803363,0.00017202318],"domain_scores_gemma":[0.99851793,0.00022167507,0.0002547319,0.00006332517,0.0008401159,0.000102240636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037152722,0.00014679212,0.00022351512,0.00031845208,0.000038000013,0.000040906205,0.00018911787,0.0001237556,0.000004458239],"category_scores_gemma":[0.00024780008,0.0001628306,0.00006949574,0.00022572411,0.000017391734,0.0004254752,0.00003970509,0.0002457167,6.3727214e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001085282,0.000084799925,0.0005757615,0.00003494686,0.00018255437,3.3363946e-7,0.00034356138,0.9687114,0.0020917743,0.00024115658,0.000040687963,0.027682202],"study_design_scores_gemma":[0.0021482878,0.000027516398,0.004398513,0.0001776576,0.00004925443,0.0000362107,0.00005250427,0.9908442,0.00202092,0.000015933807,0.00009128486,0.00013769865],"about_ca_topic_score_codex":0.000015840253,"about_ca_topic_score_gemma":0.000002168864,"teacher_disagreement_score":0.4850978,"about_ca_system_score_codex":0.00021058119,"about_ca_system_score_gemma":0.000056337765,"threshold_uncertainty_score":0.66400397},"labels":[],"label_agreement":null},{"id":"W2110261626","doi":"10.5267/j.ijiec.2011.01.003","title":"A Simulated Annealing method to solve a generalized maximal covering location problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Simulated annealing; Mathematical optimization; Annealing (glass); Computer science; Mathematics; Algorithm; Applied mathematics; Materials science; Composite material","score_opus":0.06949013712490167,"score_gpt":0.28125840689848364,"score_spread":0.21176826977358199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110261626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08659697,0.00001583601,0.9089632,0.0012856686,0.002257794,0.00024085025,0.0000036034112,0.000084643754,0.0005514193],"genre_scores_gemma":[0.9169935,0.0000018781243,0.080985144,0.0004590632,0.0014853327,0.0000067333717,0.000022814842,0.00002273625,0.00002281363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856484,0.000009781523,0.00068535534,0.00014954271,0.0004212793,0.00016921439],"domain_scores_gemma":[0.9984882,0.000033834105,0.00021885829,0.00008728331,0.001134336,0.00003748004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058519223,0.00014750862,0.0001827643,0.0007768936,0.000055608405,0.00016299404,0.00038778115,0.000061825995,0.0001565385],"category_scores_gemma":[0.00029168627,0.00015396692,0.000101351354,0.0005881202,0.000008349819,0.00071268843,0.00010701071,0.00018996034,0.000056520243],"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.00009233169,0.000067617555,0.0002870448,0.000014338064,0.00016942673,0.000012107455,0.00032017307,0.9807643,0.00031251463,0.010102133,0.00065481494,0.0072031687],"study_design_scores_gemma":[0.0017885045,0.000044729823,0.0018547552,0.00022368712,0.0000851033,0.00001590056,0.00019936202,0.97652876,0.00028424148,0.0009957005,0.017682737,0.0002965214],"about_ca_topic_score_codex":0.0006681864,"about_ca_topic_score_gemma":0.000014148085,"teacher_disagreement_score":0.83039653,"about_ca_system_score_codex":0.00011854616,"about_ca_system_score_gemma":0.000055495002,"threshold_uncertainty_score":0.6278589},"labels":[],"label_agreement":null},{"id":"W2111786992","doi":"10.5267/j.ijiec.2012.01.003","title":"Weighted Euclidean distance based approach as a multiple attribute decision making method for plant or facility layout design selection","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":57,"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); Computer science; Set (abstract data type); Quality (philosophy); Euclidean distance; Task (project management); Facility location problem; Operations research; Competitive advantage; Page layout; Service (business); Customer satisfaction; Industrial engineering; Engineering; Systems engineering; Artificial intelligence; Marketing; Business","score_opus":0.06691424449070113,"score_gpt":0.31004646710160283,"score_spread":0.2431322226109017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111786992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026360215,0.000039382863,0.99447507,0.00003230619,0.0022830188,0.0002486693,0.00014631159,0.00012945649,0.000009766129],"genre_scores_gemma":[0.5331874,0.0000025847376,0.46622697,0.000010583727,0.0004791289,0.000011492793,0.00006181795,0.000016488775,0.000003544309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874955,0.000040022274,0.0005480065,0.00011541641,0.00031792783,0.00022909128],"domain_scores_gemma":[0.9977956,0.0015101144,0.00019129975,0.00006816742,0.00033205943,0.00010275427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464048,0.00017925429,0.00022558858,0.00030941988,0.00007325144,0.00007402792,0.00017662602,0.00012586711,0.000010104038],"category_scores_gemma":[0.0011307709,0.00016400735,0.0001025023,0.00018623634,0.000010172071,0.00031058598,0.00001582108,0.00031006846,0.0000017847963],"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.00030891277,0.00006043996,0.00019481321,0.000012516467,0.00012405886,0.0000031317988,0.00008355483,0.9913514,0.000072259754,0.00015597329,0.000465898,0.007167026],"study_design_scores_gemma":[0.0013832621,0.00006859557,0.00015438866,0.00011917699,0.000040832834,0.000090012894,0.0000208824,0.9940028,0.0012120573,0.00013189025,0.0026008978,0.00017520452],"about_ca_topic_score_codex":0.0000031698619,"about_ca_topic_score_gemma":8.9869474e-7,"teacher_disagreement_score":0.5305514,"about_ca_system_score_codex":0.00033631083,"about_ca_system_score_gemma":0.000072157745,"threshold_uncertainty_score":0.66880256},"labels":[],"label_agreement":null},{"id":"W2112179347","doi":"10.5267/j.ijiec.2011.05.002","title":"A comparative study on the ranking performance of some multi-criteria decision-making methods for industrial robot selection","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":121,"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; Ranking (information retrieval); TOPSIS; Robot; Selection (genetic algorithm); Industrial robot; Production (economics); Industrial production; Rank (graph theory); Computer science; Set (abstract data type); Operations research; Range (aeronautics); Engineering; Artificial intelligence; Mathematics","score_opus":0.43056819319393175,"score_gpt":0.5038414020667886,"score_spread":0.07327320887285688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112179347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48878142,0.000014565471,0.5062217,0.00008237817,0.00441525,0.00044165636,0.000014273854,0.0000147230785,0.000014044277],"genre_scores_gemma":[0.83896977,0.0000011933525,0.16004534,0.000032879096,0.0009013046,0.000020452226,0.0000012084984,0.000020663778,0.0000071648883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949762,0.0005350259,0.002301501,0.00033417903,0.0016109049,0.00024216068],"domain_scores_gemma":[0.9828322,0.012638242,0.0016273359,0.0002686353,0.0025423304,0.000091244896],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007299322,0.00026753053,0.0006712349,0.0014864595,0.0001982393,0.00031516294,0.0016657682,0.00015509086,0.00014167507],"category_scores_gemma":[0.013935276,0.00018852085,0.00032202728,0.00087637623,0.00006293291,0.00073006115,0.00018008631,0.0006727329,0.0000074017075],"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.0028806431,0.0012394735,0.0053944145,0.0000030727663,0.0009458478,0.000015456075,0.009933136,0.7446572,0.004616692,0.0017462985,0.0011038021,0.22746398],"study_design_scores_gemma":[0.006305638,0.001234243,0.012205619,0.000743001,0.00009955736,0.00008761766,0.0021867466,0.9698212,0.0038752027,0.0024746684,0.0006377283,0.00032875876],"about_ca_topic_score_codex":0.000009061775,"about_ca_topic_score_gemma":0.000002147828,"teacher_disagreement_score":0.35018837,"about_ca_system_score_codex":0.00018732523,"about_ca_system_score_gemma":0.00023721992,"threshold_uncertainty_score":0.99437076},"labels":[],"label_agreement":null},{"id":"W2112832837","doi":"10.5267/j.ijiec.2011.06.003","title":"Coordinating a two-echelon supply chain under inflation and time value of money","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University Grants Commission","keywords":"Inflation (cosmology); Time value of money; Supply chain; Economics; Value (mathematics); Money supply; Monetary economics; Operations management; Microeconomics; Business; Mathematics; Monetary policy; Finance; Statistics; Physics; Marketing","score_opus":0.03253675728831176,"score_gpt":0.2352679041417434,"score_spread":0.20273114685343163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112832837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93381035,0.000055272943,0.058876052,0.0011355045,0.0022316026,0.00022559146,0.000006185641,0.000057083387,0.0036023804],"genre_scores_gemma":[0.99681616,0.000002753077,0.0019085138,0.00012235715,0.0010886807,0.0000022090126,0.000012057857,0.00001518699,0.000032060165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989823,0.0000109987695,0.00049791596,0.0000886121,0.00031843028,0.00010175887],"domain_scores_gemma":[0.9990067,0.000080626334,0.00045076045,0.0000537189,0.000389799,0.000018409142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042927812,0.00010872869,0.00016186165,0.00062573724,0.000035264322,0.00008053099,0.00021384883,0.000048742244,0.00010254762],"category_scores_gemma":[0.00022755504,0.00011038439,0.000068864785,0.00021337745,0.000025371173,0.00065210427,0.00009338655,0.00016443615,0.000008319435],"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.00016515997,0.0002580624,0.014093953,0.000050526094,0.0006939683,0.000038961694,0.00070947444,0.7244656,0.0033023793,0.23585731,0.0020394423,0.018325167],"study_design_scores_gemma":[0.004311179,0.00009218842,0.017640747,0.00058304996,0.00014829966,0.000037088404,0.0004494592,0.9655165,0.0008398023,0.006903255,0.0031352947,0.00034315552],"about_ca_topic_score_codex":0.00014998745,"about_ca_topic_score_gemma":0.0000013659665,"teacher_disagreement_score":0.24105088,"about_ca_system_score_codex":0.000056313744,"about_ca_system_score_gemma":0.000027417449,"threshold_uncertainty_score":0.4501345},"labels":[],"label_agreement":null},{"id":"W2114094150","doi":"10.5267/j.ijiec.2010.02.005","title":"A particle swarm approach to solve environmental/economic dispatch problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Power System Optimization","field":"Engineering","cited_by":29,"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":"Particle swarm optimization; Economic dispatch; Mathematical optimization; Computer science; Engineering; Mathematics; Physics; Electric power system","score_opus":0.01064840458373698,"score_gpt":0.2078199654378175,"score_spread":0.19717156085408052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114094150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37618995,0.00003120313,0.61866623,0.000255913,0.0041064974,0.00019641823,0.000022542667,0.000100731675,0.00043048427],"genre_scores_gemma":[0.9669822,0.0000057480715,0.03203819,0.000014334914,0.00088733627,0.000012798284,0.000014057686,0.000033183303,0.000012182877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989364,0.000007602259,0.00052064884,0.000102322316,0.0002615326,0.00017149044],"domain_scores_gemma":[0.999514,0.000077142664,0.00010518627,0.00009176285,0.00005967103,0.00015225139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020632308,0.00013467224,0.00016404956,0.00024282675,0.000023355973,0.00009766591,0.000342213,0.000091122914,0.000020700845],"category_scores_gemma":[0.000053212494,0.00014499595,0.00007878272,0.00012402583,0.000010077985,0.00025294712,0.000030137131,0.00040405543,0.00003720394],"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.000007653875,0.000045746718,0.0003424072,0.0000025621514,0.00012866019,0.000004000181,0.0002845646,0.9901145,0.005070559,0.00071106694,0.0007780076,0.0025102666],"study_design_scores_gemma":[0.0009856147,0.000060402857,0.00045154535,0.000042892963,0.000025376781,0.00019647808,0.000040334868,0.9891131,0.004629487,0.000057062607,0.004175508,0.00022221236],"about_ca_topic_score_codex":0.0000058259393,"about_ca_topic_score_gemma":0.0000017187747,"teacher_disagreement_score":0.5907922,"about_ca_system_score_codex":0.00024389774,"about_ca_system_score_gemma":0.000053603464,"threshold_uncertainty_score":0.59127635},"labels":[],"label_agreement":null},{"id":"W2114494960","doi":"10.5267/j.ijiec.2014.7.004","title":"A simulation study on the performance of the sign test, Mann-Whitney test, Hodges-Lehmann estimator and control charts for Normal and Weibull data","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Sign test; Weibull distribution; Test (biology); Estimator; Statistics; Mann–Whitney U test; Mathematics; Econometrics; Wilcoxon signed-rank test","score_opus":0.12047031021484612,"score_gpt":0.38401193599347166,"score_spread":0.26354162577862555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114494960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39591578,0.000015374904,0.60124946,0.0014020033,0.00091913936,0.0003480364,0.00012864929,0.000008370728,0.000013215543],"genre_scores_gemma":[0.9970233,8.9307116e-7,0.0023802456,0.000032504362,0.0005332026,0.0000057473717,0.0000017328349,0.000009542852,0.000012864158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981852,0.00006270866,0.00066229457,0.00016943188,0.0008149432,0.00010540349],"domain_scores_gemma":[0.9767905,0.021693593,0.00050088536,0.00020792289,0.0007450314,0.000062103616],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0016938219,0.00011102367,0.00020222101,0.00015702196,0.00014007122,0.00014805744,0.0007705805,0.000038660586,0.000003720727],"category_scores_gemma":[0.032270607,0.000066760564,0.00003377767,0.0001672869,0.00006267986,0.00035612163,0.0001343031,0.00025557162,8.0662323e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006303993,0.00008707875,0.017095271,0.0000029518121,0.000044702418,9.744966e-7,0.00012743268,0.970288,0.00011076505,0.00050013966,0.00012407209,0.011555595],"study_design_scores_gemma":[0.001395873,0.00042079412,0.03105678,0.00009326177,0.000030811985,0.000011294355,0.00008876714,0.9657061,0.00008149628,0.00070479093,0.0003419036,0.00006809701],"about_ca_topic_score_codex":0.0000017846436,"about_ca_topic_score_gemma":4.31416e-7,"teacher_disagreement_score":0.6011075,"about_ca_system_score_codex":0.000028149823,"about_ca_system_score_gemma":0.000056576355,"threshold_uncertainty_score":0.975881},"labels":[],"label_agreement":null},{"id":"W2116009168","doi":"10.5267/j.ijiec.2010.03.005","title":"A new mathematical model for the job shop scheduling problem with uncertain processing times","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Job shop scheduling; Mathematical optimization; Scheduling (production processes); Flow shop scheduling; Computer science; Job shop; Operations research; Industrial engineering; Engineering; Mathematics; Schedule","score_opus":0.02836308810103123,"score_gpt":0.26949974974184054,"score_spread":0.24113666164080932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116009168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040484774,0.000054366712,0.9937001,0.0010218247,0.0007917653,0.00016169314,0.0000064888027,0.00009835763,0.00011694713],"genre_scores_gemma":[0.2988939,0.0000035750752,0.6998813,0.000016952063,0.0010857934,0.0000103599195,0.000004543073,0.000034146502,0.000069410846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990114,0.0000045086695,0.00041934906,0.00008142105,0.00033588748,0.00014744527],"domain_scores_gemma":[0.9989296,0.00031233174,0.000117482086,0.00007145203,0.00046726278,0.00010183354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026162816,0.00014008439,0.0001551931,0.00018769754,0.000068473026,0.00020409284,0.00035093134,0.0000937524,0.000022146143],"category_scores_gemma":[0.000219264,0.00010133171,0.000080099264,0.00017559108,0.000019741825,0.00022144195,0.000015715514,0.00053278747,0.0000018569729],"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.000019347612,0.000011930533,0.000012404565,0.00000803895,0.00013984114,0.000002516084,0.0002918237,0.9795937,0.00016991599,0.0023518458,0.00022542792,0.017173229],"study_design_scores_gemma":[0.000984891,0.000025246132,0.0000055921773,0.00015495386,0.0000483372,0.00012153338,0.000064180866,0.99743736,0.00016243872,0.0006980499,0.00017645076,0.00012097772],"about_ca_topic_score_codex":0.0000016219425,"about_ca_topic_score_gemma":0.0000016245855,"teacher_disagreement_score":0.29484543,"about_ca_system_score_codex":0.000051007573,"about_ca_system_score_gemma":0.0002589809,"threshold_uncertainty_score":0.4132187},"labels":[],"label_agreement":null},{"id":"W2116119084","doi":"10.5267/j.ijiec.2010.07.007","title":"An EOQ model with time dependent Weibull deterioration and ramp type demand","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"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":"Weibull distribution; Economic order quantity; Sensitivity (control systems); Order (exchange); Production (economics); Operations research; Reliability engineering; Economics; Econometrics; Computer science; Mathematics; Engineering; Statistics; Microeconomics; Business","score_opus":0.018553732116109504,"score_gpt":0.23045813401213844,"score_spread":0.21190440189602894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116119084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9202575,0.0000089642235,0.07676382,0.00084845035,0.001657307,0.00011656331,0.000002590732,0.000042690597,0.00030210175],"genre_scores_gemma":[0.9950911,0.0000019306945,0.0028431627,0.00017055152,0.0018177285,0.0000019029196,0.000019983181,0.000016050646,0.0000376028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.0000047658277,0.00026614277,0.00009888769,0.00030983723,0.00009283547],"domain_scores_gemma":[0.99924743,0.000027759652,0.0002033505,0.000067036315,0.00042736292,0.000027052894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026508022,0.00010367334,0.00011074342,0.00034830556,0.00004966233,0.00034947376,0.0002134442,0.000055085548,0.00006172797],"category_scores_gemma":[0.00008602501,0.000091474445,0.000026591508,0.00011690877,0.000019410872,0.0009499853,0.000041760934,0.00023585849,0.0000119606675],"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.00011917737,0.000089548,0.0014886374,0.0000070628525,0.00012425148,0.00002757639,0.000060391434,0.97761536,0.010677018,0.004548924,0.0009113088,0.004330768],"study_design_scores_gemma":[0.0011973663,0.000058396447,0.0005399916,0.000049362283,0.000046640034,0.00003902514,0.000033372566,0.99407136,0.00013990077,0.00045491403,0.0032293603,0.00014029653],"about_ca_topic_score_codex":0.000016174934,"about_ca_topic_score_gemma":0.00000975284,"teacher_disagreement_score":0.07483358,"about_ca_system_score_codex":0.000027400409,"about_ca_system_score_gemma":0.000040765473,"threshold_uncertainty_score":0.37302196},"labels":[],"label_agreement":null},{"id":"W2116121037","doi":"10.5267/j.ijiec.2014.8.004","title":"Web service and dynamic pricing competition","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"Competition (biology); Dynamic pricing; Service (business); Business; Industrial organization; Web service; Computer science; Marketing; World Wide Web; Biology","score_opus":0.014123369957358505,"score_gpt":0.20527186266809688,"score_spread":0.1911484927107384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116121037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97068304,0.000007360085,0.024910927,0.0011037125,0.0017720679,0.00003818556,0.0000019146612,0.000027222946,0.0014555814],"genre_scores_gemma":[0.9975294,0.000002283384,0.00066983805,0.0003647821,0.0014046081,5.147981e-7,0.000014853344,0.000009546778,0.0000041731123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994595,6.948517e-7,0.00028173343,0.000058228015,0.00012679363,0.000073072144],"domain_scores_gemma":[0.9994185,0.00006619439,0.00021455946,0.000030407991,0.00025676424,0.000013594869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017658377,0.00007065497,0.00010426549,0.00028852388,0.00003043835,0.00044028708,0.00014252265,0.000035888563,0.000013151417],"category_scores_gemma":[0.00013768414,0.00006996556,0.000035282097,0.000106864485,0.0000073603765,0.0016337959,0.000050316834,0.00012777818,0.000016139313],"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.000035262172,0.000053104846,0.0011708505,0.000023288978,0.00013337955,0.000007783334,0.00003421332,0.81127036,0.0004312987,0.15391268,0.0003354018,0.032592382],"study_design_scores_gemma":[0.0010769654,0.000013514175,0.0015076968,0.00014125768,0.000019388064,0.000042753458,0.000063966334,0.979361,0.000006497181,0.0035891386,0.0140646715,0.00011314966],"about_ca_topic_score_codex":0.0000199026,"about_ca_topic_score_gemma":0.000009266645,"teacher_disagreement_score":0.16809064,"about_ca_system_score_codex":0.00003989457,"about_ca_system_score_gemma":0.00001802495,"threshold_uncertainty_score":0.42456985},"labels":[],"label_agreement":null},{"id":"W2117780200","doi":"10.5267/j.ijiec.2014.9.002","title":"Application of imperialist competitive optimization algorithm in power industry","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Power System Optimization and Stability","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":"Imperialist competitive algorithm; Power (physics); Optimization algorithm; Mathematical optimization; Computer science; Algorithm; Engineering; Mathematics; Optimization problem; Multi-swarm optimization; Physics","score_opus":0.008893969175361824,"score_gpt":0.23590280080614306,"score_spread":0.22700883163078123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117780200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015698738,0.00002421957,0.9811281,0.0001147008,0.0022671653,0.00011978133,0.00003147817,0.000044386274,0.0005714048],"genre_scores_gemma":[0.97811854,0.000005945993,0.021596447,0.000011399925,0.0002152014,0.0000051429715,0.000025939733,0.000018949277,0.0000024413746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998623,0.000048077112,0.00081225287,0.00008905324,0.00031844177,0.000109163906],"domain_scores_gemma":[0.9989594,0.0001686864,0.00022812493,0.00009188571,0.00048270106,0.00006920719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040807595,0.0001231935,0.00025279104,0.0004578299,0.000013555597,0.000037302536,0.0002593839,0.00019115194,0.000036666945],"category_scores_gemma":[0.00027238383,0.00013487389,0.00007604576,0.00032364143,0.000024680037,0.0002263679,0.000021107571,0.00038884752,0.0000014559473],"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.0000102526365,0.0000430001,0.0007494723,0.0000051769453,0.000055502765,0.0000016627397,0.0001588318,0.9939163,0.00016841725,0.0018521093,0.000056477198,0.0029828479],"study_design_scores_gemma":[0.0011151278,0.00004168924,0.00097327685,0.00010439488,0.000008692629,0.000022396736,0.00007777886,0.9957773,0.00037747028,0.00003877156,0.0013506567,0.00011244853],"about_ca_topic_score_codex":0.000013550743,"about_ca_topic_score_gemma":0.0000018506616,"teacher_disagreement_score":0.9624198,"about_ca_system_score_codex":0.00018566697,"about_ca_system_score_gemma":0.000055518438,"threshold_uncertainty_score":0.5499998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26962623,0.00016689177,0.7291292,0.000012815683,0.0006381038,0.00033546553,0.000013800747,0.00006644402,0.000011042533],"genre_scores_gemma":[0.9765605,0.0000041632725,0.023063987,0.000005079684,0.00030511638,0.00002411329,0.000007566815,0.00002692017,0.0000025723166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851894,0.00012556289,0.00059682707,0.00012463491,0.00046900625,0.00016503819],"domain_scores_gemma":[0.99820703,0.00035351756,0.00016916818,0.000073268755,0.001040156,0.00015686778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018703679,0.000176899,0.00033066637,0.0004933684,0.00005739309,0.00012752587,0.00014602323,0.000066801804,0.000002322073],"category_scores_gemma":[0.00059328374,0.0001665633,0.000100844736,0.00035946033,0.00002422691,0.00027069828,0.000030322539,0.00022587206,4.827031e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009207524,0.00006454151,0.0002946114,0.000021699027,0.0013114155,0.000092889415,0.0017102422,0.9931838,0.0000823859,0.0011034402,0.000016362663,0.002026569],"study_design_scores_gemma":[0.002274912,0.00018927752,0.000043688313,0.00026343565,0.00041918163,0.0007786644,0.0040850095,0.9915472,0.00011063461,0.00008815908,0.000028813241,0.00017101302],"about_ca_topic_score_codex":0.000004963955,"about_ca_topic_score_gemma":9.713895e-7,"teacher_disagreement_score":0.7069343,"about_ca_system_score_codex":0.0005223043,"about_ca_system_score_gemma":0.00013865886,"threshold_uncertainty_score":0.67922544},"labels":[],"label_agreement":null},{"id":"W2118574528","doi":"10.5267/j.ijiec.2014.4.003","title":"Game-theoretic analysis of supply chain coordination under advertising and price dependent demand","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Supply chain; Supply and demand; Microeconomics; Coordination game; Industrial organization; Economics; Game theory; Business; Advertising; Marketing","score_opus":0.014173591029721195,"score_gpt":0.22943161988936828,"score_spread":0.2152580288596471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118574528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5935736,0.000045253848,0.40339062,0.0011891746,0.0011996846,0.0000988342,0.000003382068,0.000022210246,0.00047727596],"genre_scores_gemma":[0.9986257,0.0000070760348,0.00033767478,0.00016363611,0.0008076992,0.0000017520922,0.000023084089,0.000011461792,0.000021912923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988369,0.000018393801,0.00050915586,0.000107404,0.000422423,0.00010571907],"domain_scores_gemma":[0.998861,0.00017057112,0.00044837748,0.000065808745,0.000433465,0.000020782476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063578185,0.000108470726,0.00022693553,0.0013505542,0.000033353965,0.00014504445,0.00022035066,0.000050783845,0.00005646788],"category_scores_gemma":[0.00030684884,0.00010725456,0.00010961383,0.000494321,0.000029756255,0.00045118586,0.00007736399,0.00013725714,0.0000019059597],"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.00003191478,0.000060631013,0.008428365,0.00002013408,0.0009040052,0.0000043072537,0.000076401055,0.91927344,0.0002692621,0.06615906,0.00019120277,0.00458126],"study_design_scores_gemma":[0.0015631028,0.000032096,0.019466516,0.00018280106,0.0006139779,0.000008025183,0.00013728974,0.9730354,0.000109336965,0.002069097,0.0026235345,0.00015880803],"about_ca_topic_score_codex":0.00004213692,"about_ca_topic_score_gemma":0.000004871015,"teacher_disagreement_score":0.40505213,"about_ca_system_score_codex":0.00007205834,"about_ca_system_score_gemma":0.000017390272,"threshold_uncertainty_score":0.43737137},"labels":[],"label_agreement":null},{"id":"W2120131607","doi":"10.5267/j.ijiec.2013.10.003","title":"An economic production model for time dependent demand with rework and multiple production setups","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"University Grants Commission","keywords":"Rework; Production (economics); Production model; Computer science; Economics; Microeconomics; Embedded system","score_opus":0.01545120035900783,"score_gpt":0.23046000507990005,"score_spread":0.21500880472089223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120131607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2551377,0.000016989858,0.74285626,0.00023901142,0.0015452125,0.000117720934,0.000009399583,0.000071683324,0.0000060195857],"genre_scores_gemma":[0.90693927,0.0000093187155,0.09134659,0.000006703618,0.0016187219,0.000005805371,0.00002547764,0.000027655706,0.000020437416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993178,0.00001323468,0.00030480282,0.00011932031,0.0001506961,0.000094120966],"domain_scores_gemma":[0.9994338,0.00008023531,0.000106168416,0.000068509245,0.0002359603,0.000075299824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030308764,0.000109005116,0.00013357274,0.0002201123,0.000045878198,0.00007828769,0.000114505194,0.00006706742,0.0000024601136],"category_scores_gemma":[0.00019672129,0.00010659039,0.000030525778,0.000053682194,0.000013374268,0.00033879082,0.0000068734726,0.00016352779,0.0000014727538],"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.000043254404,0.000017825905,0.00012636672,0.000004507982,0.00009390719,4.525867e-7,0.00013908964,0.9955985,0.00055181625,0.000058446818,0.000114830465,0.003251005],"study_design_scores_gemma":[0.0008203957,0.00007761225,0.000053466403,0.00007180161,0.000029322187,0.00008676498,0.000017938371,0.997297,0.0012730409,0.00008083295,0.00007475624,0.000117102914],"about_ca_topic_score_codex":0.0000014848172,"about_ca_topic_score_gemma":0.00000201023,"teacher_disagreement_score":0.6518016,"about_ca_system_score_codex":0.00010751248,"about_ca_system_score_gemma":0.000041948657,"threshold_uncertainty_score":0.434663},"labels":[],"label_agreement":null},{"id":"W2122051472","doi":"10.5267/j.ijiec.2011.08.0013","title":"Energy market and reserve market modeling in simultaneous and serial implementation methods with the aim of reducing electricity costs","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Power System Optimization","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":"Electricity market; Electricity; Environmental economics; Economics; Business; Natural resource economics; Industrial organization; Microeconomics; Computer science; Engineering; Electrical engineering","score_opus":0.02610183908415872,"score_gpt":0.27454089517092556,"score_spread":0.24843905608676684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122051472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21969627,0.00020293749,0.7792807,0.00006227892,0.00044726752,0.00011181644,0.000006813541,0.000020604744,0.00017125918],"genre_scores_gemma":[0.9807444,0.00007426576,0.01900216,0.000004649575,0.00014339502,0.0000045814054,0.000003393991,0.000019639381,0.0000035184223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989336,0.00010012344,0.0005210203,0.00009108671,0.00022584021,0.00012832093],"domain_scores_gemma":[0.9988793,0.00055621756,0.00018034963,0.000057641235,0.00027878705,0.000047686724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646186,0.000119393604,0.00019020011,0.000408307,0.000024884072,0.00004013208,0.0001586798,0.00006885237,0.000013382785],"category_scores_gemma":[0.000199292,0.000101560945,0.000026662443,0.00030350368,0.000015203495,0.00019004474,0.000025994537,0.00022685117,2.5376012e-8],"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.00013228945,0.000010979385,0.00018571444,0.0000072231896,0.00014975671,0.000011787384,0.00048314157,0.9828883,0.0005010511,0.00014936565,0.00007279026,0.015407598],"study_design_scores_gemma":[0.0010706275,0.00009999905,0.00012818401,0.00012680973,0.000027907303,0.0001126768,0.000139571,0.9969262,0.001198693,0.000047694837,0.00002839128,0.000093231094],"about_ca_topic_score_codex":0.00034264725,"about_ca_topic_score_gemma":0.00004370421,"teacher_disagreement_score":0.76104814,"about_ca_system_score_codex":0.00016195557,"about_ca_system_score_gemma":0.00006269947,"threshold_uncertainty_score":0.41415352},"labels":[],"label_agreement":null},{"id":"W2123938741","doi":"10.5267/j.ijiec.2011.07.002","title":"Virtual cellular manufacturing system based on resource element approach and analyzing its performance over different basic layouts","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Universiti Putra Malaysia","keywords":"Cellular manufacturing; Resource (disambiguation); Computer science; Element (criminal law); Engineering drawing; Manufacturing engineering; Engineering; Industrial engineering","score_opus":0.024648842374924436,"score_gpt":0.2064402503189615,"score_spread":0.18179140794403706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123938741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34684178,0.000027988104,0.65180624,0.000009922636,0.0008248265,0.00008164573,0.000010675067,0.00009132356,0.00030563175],"genre_scores_gemma":[0.9942863,0.000010381952,0.0052243355,0.000008837797,0.00040554279,0.000004488895,0.000020976853,0.000031099935,0.000008040861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989183,0.000019653171,0.00044574557,0.00012486223,0.00033100304,0.0001604335],"domain_scores_gemma":[0.9994813,0.00010042892,0.00014777438,0.00008485086,0.000087150824,0.000098491706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015553666,0.00018920124,0.00019848577,0.00042412075,0.000052501906,0.000062419014,0.00020229677,0.00008099822,0.000009681918],"category_scores_gemma":[0.00003971705,0.0001792801,0.00006398315,0.00006700653,0.000012846843,0.0001689725,0.000028491882,0.00037146415,0.0000012831191],"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.000039075036,0.00003493562,0.00013577791,0.000024789546,0.00010308454,0.000012520617,0.00013154802,0.9963629,0.00009290399,0.00041258076,0.00002710947,0.0026227664],"study_design_scores_gemma":[0.00097438885,0.00010607714,0.0010945366,0.00025411564,0.00003584778,0.00001840615,0.000058470294,0.9853681,0.011752367,0.000005263559,0.00016188761,0.00017059414],"about_ca_topic_score_codex":0.0000016498469,"about_ca_topic_score_gemma":1.0140634e-7,"teacher_disagreement_score":0.6474445,"about_ca_system_score_codex":0.00023222488,"about_ca_system_score_gemma":0.000015730475,"threshold_uncertainty_score":0.73108304},"labels":[],"label_agreement":null},{"id":"W2125742178","doi":"10.5267/j.ijiec.2012.02.004","title":"Planning Annuaulised hours when spike in demand exists","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Spike (software development); Computer science; Statistics; Mathematics; Operations management; Economics","score_opus":0.03311799355206232,"score_gpt":0.276242064354215,"score_spread":0.24312407080215268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125742178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88128304,0.00016719462,0.11323396,0.0008380982,0.0036631846,0.000085754284,0.000003238187,0.000054630687,0.00067091594],"genre_scores_gemma":[0.993064,0.0000013414572,0.0021487316,0.0001546124,0.004587705,0.0000019569331,0.000011045122,0.000017896007,0.000012702102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989006,0.0000126759405,0.00048333738,0.00007814884,0.00033494705,0.00019028997],"domain_scores_gemma":[0.99908674,0.0001661934,0.0003772385,0.000060530077,0.00028181061,0.000027479637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060829625,0.000119953795,0.00018764928,0.00091312034,0.000034241904,0.00012724144,0.00031401246,0.000064711734,0.00004840349],"category_scores_gemma":[0.0007266277,0.00012238408,0.00009767698,0.00030528163,0.000015793757,0.0015817521,0.000063775515,0.00032007488,0.000015385285],"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.000053474327,0.000070419395,0.032266192,0.0000038851085,0.000111628084,0.000041570347,0.00022356801,0.95962596,0.00012677429,0.0048579103,0.000510913,0.0021077327],"study_design_scores_gemma":[0.019193161,0.0001170496,0.13456735,0.0042219986,0.0007333781,0.00049667334,0.002456873,0.7051289,0.00075131597,0.029424155,0.10038897,0.0025201694],"about_ca_topic_score_codex":0.000024187832,"about_ca_topic_score_gemma":0.0000016034668,"teacher_disagreement_score":0.25449702,"about_ca_system_score_codex":0.000115178584,"about_ca_system_score_gemma":0.000026020673,"threshold_uncertainty_score":0.49906778},"labels":[],"label_agreement":null},{"id":"W2128116160","doi":"10.5267/j.ijiec.2014.3.004","title":"Numeric treatment of nonlinear second order multi-point boundary value problems using ANN, GAs and sequential quadratic programming technique","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Differential Equations and Numerical Methods","field":"Mathematics","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":"Nonlinear system; Boundary value problem; Sequential quadratic programming; Quadratic equation; Mathematics; Mathematical optimization; Quadratic programming; Point (geometry); Applied mathematics; Value (mathematics); Nonlinear programming; Multi point; Order (exchange); Mathematical analysis; Physics; Geometry; Statistics","score_opus":0.08883671467027836,"score_gpt":0.3593825305863058,"score_spread":0.27054581591602744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128116160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15362576,0.000039563,0.8452111,0.000107532585,0.0006928076,0.00027420628,0.000015395912,0.000023021259,0.000010642673],"genre_scores_gemma":[0.37788063,0.0000064725095,0.62166053,0.000004952016,0.00039821616,0.000010473608,0.000007767003,0.000023161752,0.000007790249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985029,0.00011867031,0.00082733727,0.0001144324,0.00029269492,0.0001439464],"domain_scores_gemma":[0.998253,0.00050317537,0.00054218736,0.000090518384,0.0005155126,0.00009562228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045020066,0.00017386948,0.00037412436,0.00034916858,0.00005849039,0.00009719079,0.00015465326,0.000098807235,0.000029097188],"category_scores_gemma":[0.0007443581,0.0001524085,0.00012785429,0.00023842302,0.000054655935,0.000181498,0.000035924673,0.00019574082,3.9093143e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023659294,0.003718613,0.0010533079,0.00028690466,0.0027108046,0.000044076998,0.0040948614,0.55243164,0.06017543,0.014080014,0.000067726156,0.36110002],"study_design_scores_gemma":[0.0030678713,0.0008105889,0.00008042948,0.00054173096,0.00021088024,0.00029577283,0.00011780898,0.9812844,0.005302226,0.005735296,0.0022695498,0.0002834584],"about_ca_topic_score_codex":0.000041993426,"about_ca_topic_score_gemma":0.000003312905,"teacher_disagreement_score":0.42885274,"about_ca_system_score_codex":0.00015036052,"about_ca_system_score_gemma":0.00015354424,"threshold_uncertainty_score":0.62150383},"labels":[],"label_agreement":null},{"id":"W2129945282","doi":"10.5267/j.ijiec.2011.03.006","title":"Anthropometric evaluations and assessment of school furniture design in Nigeria: A case study of secondary schools in rural area of Odeda, Nigeria","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Ergonomics and Musculoskeletal Disorders","field":"Psychology","cited_by":21,"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":"Anthropometry; Rural area; Southeastern Nigeria; Medicine; Socioeconomics; Sociology","score_opus":0.08010320645109525,"score_gpt":0.3711633306781533,"score_spread":0.29106012422705807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129945282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856414,0.00013749754,0.01277599,0.000040663188,0.0009048298,0.00033837662,0.000027794824,0.0000037004756,0.00012974186],"genre_scores_gemma":[0.9960529,0.000017457149,0.00383644,0.000003218984,0.000057987345,0.000012425087,0.0000042844904,0.000012493659,0.000002792348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99826807,0.00015199755,0.0010998043,0.00010906346,0.0002598957,0.000111191075],"domain_scores_gemma":[0.9985383,0.00029817698,0.00057544647,0.000099002515,0.0004220866,0.000066957524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931756,0.0001220736,0.00036064882,0.0016887474,0.0000149741045,0.000013190048,0.00020578061,0.000104913925,0.00015162252],"category_scores_gemma":[0.00035537453,0.00012531526,0.00007798545,0.0005364713,0.000036850754,0.00017739816,0.00004276551,0.00055572076,3.2369869e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000554485,0.0055214935,0.42745247,0.000034483073,0.0017781582,0.0006449575,0.013072349,0.5292376,0.0020114905,0.0016007145,0.00018723274,0.017904524],"study_design_scores_gemma":[0.017189484,0.0029198367,0.9131787,0.0005671507,0.000115488256,0.0007024221,0.045870237,0.018375836,0.00016730068,0.00056815275,0.0000108971135,0.00033452487],"about_ca_topic_score_codex":0.00086034916,"about_ca_topic_score_gemma":0.00017264104,"teacher_disagreement_score":0.5108618,"about_ca_system_score_codex":0.00010728553,"about_ca_system_score_gemma":0.00034869992,"threshold_uncertainty_score":0.5110208},"labels":[],"label_agreement":null},{"id":"W2132366614","doi":"10.5267/j.ijiec.2012.03.002","title":"A parallel machine extension to aversion dynamics scheduling","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Carnegie Mellon University","keywords":"Extension (predicate logic); Scheduling (production processes); Computer science; Mathematical optimization; Mathematics; Programming language","score_opus":0.022583107963247875,"score_gpt":0.2563867569650616,"score_spread":0.23380364900181372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132366614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08471055,0.00016642094,0.9074904,0.00048574415,0.006842876,0.00007243478,0.000014773335,0.00011880164,0.00009799914],"genre_scores_gemma":[0.7818931,0.000018835806,0.21666661,0.000044770713,0.0013083657,0.0000018198751,0.000024190727,0.000028388784,0.000013977184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891174,0.000013872376,0.00044353437,0.00006886,0.0003702378,0.00019173836],"domain_scores_gemma":[0.99917006,0.00011359697,0.00008918969,0.00007374402,0.00033096186,0.00022244826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027614296,0.00013561193,0.00016311515,0.00048578408,0.000036532598,0.00006299776,0.0002414693,0.000093879025,0.000029035104],"category_scores_gemma":[0.00029141997,0.0001402677,0.00009228271,0.00026287296,0.0000071024633,0.00030594773,0.00003681791,0.00034536197,0.000026429683],"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.000017062397,0.000032544234,0.000361857,0.0000022535605,0.000095756164,0.000006979926,0.00016584268,0.99239635,0.0001519717,0.00049350376,0.00022468608,0.006051163],"study_design_scores_gemma":[0.0007312509,0.000030168341,0.00030765642,0.00011775911,0.000020369935,0.00011486735,0.00007074808,0.9973785,0.00019168813,0.000021235135,0.00086923665,0.00014646957],"about_ca_topic_score_codex":0.000004297504,"about_ca_topic_score_gemma":5.379806e-7,"teacher_disagreement_score":0.6971825,"about_ca_system_score_codex":0.00026600843,"about_ca_system_score_gemma":0.000031659132,"threshold_uncertainty_score":0.5719951},"labels":[],"label_agreement":null},{"id":"W2133898577","doi":"10.5267/j.ijiec.2012.03.001","title":"A MOORA based fuzzy multi-criteria decision making approach for supply chain strategy selection","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":94,"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":"Supply chain; Fuzzy logic; Selection (genetic algorithm); Decision-making models; Computer science; Multiple-criteria decision analysis; Operations research; Mathematical optimization; Operations management; Mathematics; Engineering; Business; Artificial intelligence; Marketing","score_opus":0.19528734980773046,"score_gpt":0.42431736159426153,"score_spread":0.22903001178653107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133898577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08653972,0.00007899959,0.9071726,0.0002133588,0.0054767495,0.0003291092,0.00009739421,0.000044969747,0.00004706675],"genre_scores_gemma":[0.68727076,0.0000010239582,0.31064928,0.000060578248,0.0019394733,0.00001451602,0.000016404198,0.000029554774,0.00001839555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520993,0.000179761,0.0018755817,0.00032335697,0.0019958084,0.00041553858],"domain_scores_gemma":[0.99253374,0.0037097347,0.0009740303,0.0002120074,0.0023283674,0.00024210016],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044589834,0.00028030874,0.0004712482,0.001867142,0.00015125671,0.00080472254,0.001168186,0.00022597956,0.00014880816],"category_scores_gemma":[0.009325568,0.0002463666,0.00037646602,0.0008429413,0.000034091678,0.0011627465,0.00011030119,0.00048704585,0.000012257417],"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.00031385742,0.0002907022,0.0023594892,0.0000031947461,0.000097989774,0.000005967694,0.00021396481,0.9042883,0.0016572268,0.0007763522,0.0027367007,0.087256245],"study_design_scores_gemma":[0.0032612912,0.0001209212,0.0046432614,0.00019495463,0.000032533764,0.00017417701,0.00019616178,0.9871621,0.00028420653,0.00073399,0.0029395719,0.0002568317],"about_ca_topic_score_codex":0.0000066275356,"about_ca_topic_score_gemma":0.0000015124236,"teacher_disagreement_score":0.6007311,"about_ca_system_score_codex":0.0003301924,"about_ca_system_score_gemma":0.00026434826,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W2134349376","doi":"10.5267/j.ijiec.2012.10.005","title":"Three stage supply chain model with two warehouse, imperfect production, variable demand rate and inflation","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Production (economics); Economics; Supply chain; Inflation (cosmology); Variable (mathematics); Imperfect; Stage (stratigraphy); Warehouse; Econometrics; Microeconomics; Operations management; Business; Mathematics","score_opus":0.026748714793270206,"score_gpt":0.23187674799699767,"score_spread":0.20512803320372747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134349376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5554236,0.00007597276,0.43952706,0.0016350035,0.0026330645,0.00028006133,0.0000059151403,0.000071394104,0.00034790087],"genre_scores_gemma":[0.99249554,0.000005354757,0.003276319,0.00015677034,0.003944837,0.0000080361615,0.000019480402,0.000024976078,0.000068686466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900836,0.000009168416,0.0003660831,0.0001114296,0.00032684315,0.00017809383],"domain_scores_gemma":[0.99911517,0.000057760208,0.00030634998,0.000074198964,0.00041354392,0.000032952124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074200385,0.0001434841,0.0001502636,0.0004941634,0.00008164343,0.00022217305,0.00016706822,0.000042682612,0.000039010705],"category_scores_gemma":[0.0002232162,0.00012617184,0.000038606562,0.00025054783,0.000022676912,0.0016881932,0.00006976894,0.00021277212,0.000005143386],"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.00006460131,0.00005622638,0.011870618,0.000014883155,0.00015679862,0.000004580098,0.00008206991,0.9681894,0.00023437726,0.01664615,0.0016001051,0.0010801924],"study_design_scores_gemma":[0.0025065579,0.00003719674,0.004689416,0.00022244286,0.00010858642,0.000042796808,0.00009841786,0.9790756,0.00015551917,0.00095161394,0.011837641,0.00027417735],"about_ca_topic_score_codex":0.00006460795,"about_ca_topic_score_gemma":0.000010411472,"teacher_disagreement_score":0.43707192,"about_ca_system_score_codex":0.00008594196,"about_ca_system_score_gemma":0.000046533383,"threshold_uncertainty_score":0.51451385},"labels":[],"label_agreement":null},{"id":"W2135683075","doi":"10.5267/j.ijiec.2013.04.003","title":"Application of desirability function for optimizing the performance characteristics of carbonitrided bushes","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":33,"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":"Response surface methodology; Function (biology); Variable (mathematics); Product (mathematics); Mathematical optimization; Hardness; Surface (topology); Materials science; Computer science; Process engineering; Mathematics; Statistics; Composite material; Engineering","score_opus":0.11648766625191335,"score_gpt":0.3698494016880249,"score_spread":0.2533617354361115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135683075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47686303,0.00001705132,0.5218862,0.00017142821,0.00083623943,0.00019866467,0.000009024811,0.0000043970767,0.000013972328],"genre_scores_gemma":[0.9384704,0.000003231207,0.061163455,0.000011443961,0.00031623087,0.000016888187,0.000003866309,0.000007966268,0.000006485578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775255,0.00008054062,0.0012186843,0.00010823945,0.00075168436,0.000088308225],"domain_scores_gemma":[0.99404037,0.002384183,0.0010449764,0.00014840628,0.002337718,0.000044347842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018881517,0.00009157026,0.00025797103,0.00028918276,0.000040120136,0.00007557871,0.00060748146,0.00006476491,0.00001759307],"category_scores_gemma":[0.0028782403,0.00006570921,0.00015252779,0.00031952257,0.00006202488,0.00035810392,0.000045911092,0.00016785433,0.0000019921517],"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.00018359118,0.00010894349,0.0063741473,0.000007963679,0.00015639632,2.2180974e-7,0.00028883552,0.8060001,0.07588068,0.0013476124,0.00013937271,0.10951213],"study_design_scores_gemma":[0.0010344418,0.0003509828,0.041677624,0.000079894526,0.00004621177,0.000018311512,0.00028126466,0.920156,0.034469083,0.0014387391,0.0003351512,0.00011227063],"about_ca_topic_score_codex":0.000020917318,"about_ca_topic_score_gemma":1.4779253e-7,"teacher_disagreement_score":0.46160743,"about_ca_system_score_codex":0.00007728515,"about_ca_system_score_gemma":0.00010562716,"threshold_uncertainty_score":0.34457302},"labels":[],"label_agreement":null},{"id":"W2135895503","doi":"10.5267/j.ijiec.2015.4.004","title":"Statistical analysis of AISI304 austenitic stainless steel machining using Ti(C, N)/Al2O3/TiN CVD coated carbide tool","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","field":"Engineering","cited_by":22,"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":"Université de Tunis; Centre National de la Recherche Scientifique; Indian National Science Academy","keywords":"Metallurgy; Materials science; Machining; Carbide; Tin; Austenitic stainless steel; Austenite; Corrosion; Microstructure","score_opus":0.04571724950232368,"score_gpt":0.30381918063144114,"score_spread":0.25810193112911745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135895503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40281487,0.000059457925,0.5959109,0.000023118762,0.0009771998,0.000049996597,0.00007934068,0.000044696484,0.000040405517],"genre_scores_gemma":[0.9629881,0.000006937982,0.0365738,0.000008882652,0.000292676,0.0000016134869,0.000089194145,0.000033042932,0.0000057503034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827015,0.000032797063,0.00086325896,0.000111239344,0.0005438881,0.00017863687],"domain_scores_gemma":[0.9982452,0.00032000517,0.00029856796,0.00008506742,0.0009159893,0.00013521044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003150271,0.0001739769,0.000396919,0.0008855252,0.000029873907,0.00007444865,0.00026842966,0.00010119841,0.000021631877],"category_scores_gemma":[0.00067022775,0.00018520781,0.000116776595,0.00070638274,0.000027633341,0.00030320586,0.000039999584,0.00038133914,9.909262e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038972576,0.000029649638,0.0011764859,0.000011476816,0.0011253507,0.000039994105,0.00029012587,0.9939007,0.00062990416,0.00084593496,0.00004462655,0.0018667715],"study_design_scores_gemma":[0.0011135563,0.000055924316,0.00062366575,0.00012347077,0.00047746298,0.000051572097,0.00016772107,0.9965253,0.00048197428,0.00007224664,0.0001341953,0.0001729461],"about_ca_topic_score_codex":0.00003238155,"about_ca_topic_score_gemma":0.0000028174702,"teacher_disagreement_score":0.5601732,"about_ca_system_score_codex":0.00028124722,"about_ca_system_score_gemma":0.00019244094,"threshold_uncertainty_score":0.7552556},"labels":[],"label_agreement":null},{"id":"W2136617612","doi":"10.5267/j.ijiec.2011.09.005","title":"Part grouping and tool loading in versatile multi-tool machining centers","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Machining; Manufacturing engineering; Engineering drawing; Computer science; Mechanical engineering; Engineering","score_opus":0.03735266321827026,"score_gpt":0.23437341010568272,"score_spread":0.19702074688741245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136617612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6654131,0.00014058713,0.33062595,0.00004602648,0.0033525429,0.00010956411,0.000010181647,0.00009363761,0.00020840489],"genre_scores_gemma":[0.9862367,0.000026107373,0.013432215,0.000012326975,0.00025876946,0.000002797386,0.000006194688,0.000020591482,0.000004279401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.000011101677,0.0004607011,0.000081634484,0.00017324886,0.00013192972],"domain_scores_gemma":[0.9996551,0.00007043796,0.00010274288,0.000040906416,0.00008469624,0.000046107594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018664832,0.00011682975,0.00014369478,0.00039879236,0.000023695726,0.00006406217,0.00015740948,0.00006824433,0.000031271422],"category_scores_gemma":[0.0001175468,0.00012747395,0.00004298352,0.000106300104,0.000010606523,0.00035815462,0.000021338248,0.00030369282,0.0000014206684],"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.000015514353,0.000020903948,0.002979215,0.000010773661,0.00006634248,0.000025852287,0.0008997817,0.9893027,0.00007726578,0.00017134665,0.000042043408,0.006388289],"study_design_scores_gemma":[0.0017137381,0.000031658914,0.006626995,0.0003564987,0.000017151438,0.00006332217,0.0000980134,0.989615,0.00081163266,0.000038369442,0.00043752964,0.0001900549],"about_ca_topic_score_codex":0.000017507386,"about_ca_topic_score_gemma":0.0000020818327,"teacher_disagreement_score":0.32082364,"about_ca_system_score_codex":0.00010941402,"about_ca_system_score_gemma":0.000021709206,"threshold_uncertainty_score":0.5198237},"labels":[],"label_agreement":null},{"id":"W2136621681","doi":"10.5267/j.ijiec.2012.08.001","title":"Scheduling trucks in cross docking systems with temporary storage and dock repeat truck holding pattern using GRASP method","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"DOCK; Truck; GRASP; Scheduling (production processes); Docking (animal); Engineering; Computer science; Automotive engineering; Operations management; Marine engineering","score_opus":0.03809228432954519,"score_gpt":0.297082773844029,"score_spread":0.2589904895144838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136621681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3900567,0.0002303664,0.6081686,0.000010543683,0.0014107052,0.000061267165,0.000005734037,0.000042309355,0.000013743467],"genre_scores_gemma":[0.9431827,0.000017596736,0.055875164,0.000004732999,0.00086855725,0.0000025991503,0.000008326473,0.000038457092,0.0000018758534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987833,0.000034899418,0.0005665695,0.00010735123,0.00028813427,0.00021976439],"domain_scores_gemma":[0.9992151,0.0002373581,0.0002124071,0.000070799855,0.00015482005,0.00010946678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042829243,0.00017793293,0.00024645988,0.00050949486,0.00004863498,0.00016480361,0.0001495322,0.00010584897,0.000002290041],"category_scores_gemma":[0.00013935435,0.00017371304,0.00004155056,0.00017283337,0.000017398617,0.00068114814,0.000032358585,0.00048158306,2.8072577e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016285487,0.000015164276,0.012573993,0.000019192743,0.00009760124,0.000033585227,0.0002515127,0.9846951,0.00015542404,0.00011887652,0.0000028121244,0.0020204524],"study_design_scores_gemma":[0.0011089602,0.000025687566,0.0022292635,0.0004590905,0.000024790474,0.00043779958,0.0001311662,0.9949813,0.00031523334,0.00003362247,0.000054759144,0.00019834952],"about_ca_topic_score_codex":0.00003978421,"about_ca_topic_score_gemma":9.224982e-7,"teacher_disagreement_score":0.553126,"about_ca_system_score_codex":0.0002601025,"about_ca_system_score_gemma":0.000033627377,"threshold_uncertainty_score":0.7083812},"labels":[],"label_agreement":null},{"id":"W2138597324","doi":"10.5267/j.ijiec.2014.1.003","title":"Modified economic order quantity (EOQ) model for items with imperfect quality: Game-theoretical approaches","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Economic order quantity; Imperfect; Order (exchange); Quality (philosophy); Operations research; Economics; Computer science; Operations management; Mathematical economics; Mathematics; Business; Marketing","score_opus":0.08209046224751043,"score_gpt":0.26987935600982643,"score_spread":0.187788893762316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138597324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20438775,0.0000067356327,0.7919285,0.0014340269,0.0013815428,0.0001933282,0.000007230589,0.000040662526,0.00062016706],"genre_scores_gemma":[0.9938827,0.0000013225266,0.0028492552,0.00018008582,0.002986028,0.000014510295,0.000031453103,0.000026306587,0.000028347564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888384,0.000012877666,0.00050454505,0.00014672919,0.00029200994,0.000159965],"domain_scores_gemma":[0.99905705,0.00016718732,0.00033588137,0.00009175326,0.00032177512,0.000026369797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007402616,0.00014995123,0.00022938864,0.00039141308,0.00004951095,0.0002889829,0.0003481946,0.00006703505,0.000028947876],"category_scores_gemma":[0.0003478759,0.00013196832,0.0001213086,0.00010750891,0.00004692303,0.00053923234,0.000059368267,0.00018773272,0.000008238612],"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.00007147459,0.000038555103,0.00019756849,0.000010920905,0.00012267586,9.4030753e-7,0.000023588953,0.64105177,0.000013420124,0.3566319,0.00048768608,0.0013494854],"study_design_scores_gemma":[0.0019778013,0.000037644757,0.00011524689,0.00005868492,0.000052611278,0.000006042763,0.00004176854,0.99063045,0.0000139662325,0.0038621037,0.0030421235,0.00016153348],"about_ca_topic_score_codex":0.000029133858,"about_ca_topic_score_gemma":0.000006577738,"teacher_disagreement_score":0.78949493,"about_ca_system_score_codex":0.00010887849,"about_ca_system_score_gemma":0.00006146165,"threshold_uncertainty_score":0.5381512},"labels":[],"label_agreement":null},{"id":"W2139709018","doi":"10.5267/j.ijiec.2014.4.002","title":"A response surface methodology and desirability approach for predictive modeling and optimization of cutting temperature in machining hardened steel","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","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":"Kalinga Institute of Industrial Technology","keywords":"Response surface methodology; Machining; Carbide; Degree (music); Process (computing); Design of experiments; Materials science; Mathematics; Mechanical engineering; Metallurgy; Engineering; Statistics; Computer science; Physics","score_opus":0.045459844305185744,"score_gpt":0.2905666867195009,"score_spread":0.24510684241431518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139709018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31312004,0.00008495895,0.6864364,0.00004430084,0.00019642214,0.00008601353,0.000008779126,0.000017903672,0.000005173075],"genre_scores_gemma":[0.6059119,0.000016578822,0.39398438,0.000003522397,0.0000617249,0.0000021544581,0.000007630633,0.000011572451,5.300271e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00008091298,0.00045364286,0.000102394246,0.000122008685,0.000088759036],"domain_scores_gemma":[0.9986667,0.0008303915,0.00013642946,0.000037461046,0.0002892495,0.0000397739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010554126,0.00010175692,0.00022015451,0.00022565838,0.000027163427,0.000032579155,0.000088921326,0.000100666395,4.303522e-7],"category_scores_gemma":[0.001542534,0.000106727166,0.000030724583,0.000116647134,0.000016443948,0.00021194287,0.000021191416,0.00023539983,6.159409e-9],"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.0002771084,0.00001298051,0.00031377043,0.000027269212,0.00005214424,3.8393895e-7,0.00047942193,0.9961235,0.0010692836,0.00015104462,0.0000012175574,0.0014918902],"study_design_scores_gemma":[0.0012420977,0.00008944029,0.00015049378,0.00012305517,0.000018305262,0.00002348142,0.00012718825,0.9976667,0.00034580348,0.00012866734,0.0000052631676,0.000079462276],"about_ca_topic_score_codex":0.0000031610075,"about_ca_topic_score_gemma":2.954743e-7,"teacher_disagreement_score":0.29279187,"about_ca_system_score_codex":0.000057449608,"about_ca_system_score_gemma":0.000033723038,"threshold_uncertainty_score":0.43522075},"labels":[],"label_agreement":null},{"id":"W2140441806","doi":"10.5267/j.ijiec.2011.09.007","title":"Multiple criteria inventory classification using fuzzy analytic hierarchy process","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":46,"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":"Analytic hierarchy process; Fuzzy logic; Analytic network process; Process (computing); Computer science; Hierarchy; Reliability engineering; Data mining; Mathematics; Operations research; Artificial intelligence; Engineering; Economics","score_opus":0.41533767895052937,"score_gpt":0.4431844964219827,"score_spread":0.027846817471453345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140441806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874522,0.000040497394,0.30604807,0.00022307073,0.0057736384,0.00013810358,0.000022894174,0.000036561338,0.0002649758],"genre_scores_gemma":[0.9773152,0.0000022897686,0.021475177,0.000049652906,0.0011001533,0.0000030463934,0.000005666833,0.000024913947,0.000023905553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546325,0.00016362843,0.0018593537,0.00029637048,0.0019944238,0.0002229845],"domain_scores_gemma":[0.9946505,0.00097121653,0.0011414571,0.00026448775,0.0027633295,0.00020902077],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002199986,0.00020001455,0.0003766091,0.0019553874,0.00009487489,0.0003980232,0.001373163,0.00014361847,0.00028952525],"category_scores_gemma":[0.008957681,0.00017862859,0.00024478367,0.0008691204,0.00006373321,0.0010345199,0.000120468496,0.00045794417,0.000032698725],"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.00066429755,0.0006704499,0.042308442,0.000011467721,0.0006315155,0.00040592547,0.0066243648,0.86660147,0.014149449,0.0036810806,0.0029872668,0.061264277],"study_design_scores_gemma":[0.0016889523,0.000074875206,0.008770783,0.00020935836,0.000042249005,0.00031797896,0.00069212174,0.9799561,0.0005671213,0.006284004,0.001149788,0.00024667318],"about_ca_topic_score_codex":0.000021043486,"about_ca_topic_score_gemma":0.0000025251418,"teacher_disagreement_score":0.289863,"about_ca_system_score_codex":0.00025490357,"about_ca_system_score_gemma":0.0003324799,"threshold_uncertainty_score":0.9993903},"labels":[],"label_agreement":null},{"id":"W2140515139","doi":"10.5267/j.ijiec.2013.01.003","title":"A fuzzy simulated evolution algorithm for integrated manufacturing system design","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Fuzzy logic; Algorithm; Computer science; Mathematical optimization; Engineering; Mathematics; Artificial intelligence","score_opus":0.02219647045780247,"score_gpt":0.23636735790707983,"score_spread":0.21417088744927737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140515139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004843644,0.000046608082,0.99107784,0.000047816775,0.0033432613,0.00031417655,0.000027443919,0.00025613848,0.000043091197],"genre_scores_gemma":[0.7916798,0.00000530126,0.20755889,0.000004580784,0.0006550909,0.00001378652,0.00003586314,0.00003526529,0.0000114058175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889046,0.00001891272,0.0005702737,0.00009853488,0.00024048435,0.00018136152],"domain_scores_gemma":[0.99876684,0.00031700722,0.00016667637,0.00006984358,0.000587267,0.0000923734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016445716,0.00017406278,0.0002066252,0.0004234594,0.00004747276,0.00011662346,0.00024451572,0.00012796947,0.0000080999025],"category_scores_gemma":[0.00015695833,0.00017274545,0.000098860364,0.000113655835,0.000014360565,0.00035206866,0.00001563244,0.00028880846,0.0000078769945],"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.000009667144,0.000014136431,0.0000020409127,0.000008985099,0.00018197912,0.0000055178725,0.000033786833,0.973566,0.00022834147,0.00035046125,0.00047260275,0.02512649],"study_design_scores_gemma":[0.0011054714,0.000059920007,0.00003792294,0.00016673851,0.00003190761,0.000058492886,0.0000707751,0.9936951,0.0036538276,0.0005774455,0.00037989338,0.00016249518],"about_ca_topic_score_codex":0.000016943912,"about_ca_topic_score_gemma":1.570515e-7,"teacher_disagreement_score":0.7868362,"about_ca_system_score_codex":0.00055243995,"about_ca_system_score_gemma":0.000053695163,"threshold_uncertainty_score":0.7044355},"labels":[],"label_agreement":null},{"id":"W2140803050","doi":"10.5267/j.ijiec.2013.03.003","title":"Modeling quality control data using mixture of parametrical distributions","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","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":"Quality (philosophy); Control (management); Computer science; Control theory (sociology); Econometrics; Environmental science; Statistics; Mathematics; Artificial intelligence; Physics","score_opus":0.10879204527241201,"score_gpt":0.3538619163339961,"score_spread":0.2450698710615841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140803050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024881873,0.00009283968,0.972026,0.0011111213,0.0016712471,0.000106362444,0.000074669624,0.000022798096,0.000013112898],"genre_scores_gemma":[0.62154573,0.0000034078184,0.37808508,0.000023185377,0.0003256344,9.051503e-7,0.000009966664,0.0000049395185,0.0000011690538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981632,0.00011058134,0.00087775127,0.00017003111,0.00052673725,0.00015166543],"domain_scores_gemma":[0.9975621,0.00054887054,0.0003669749,0.00031564027,0.001082029,0.00012439785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718871,0.00012126193,0.00028998996,0.0003471999,0.00004121895,0.00015732682,0.0016175536,0.000111582856,0.0000088749275],"category_scores_gemma":[0.0014146477,0.00011049163,0.00012214153,0.00040900943,0.00002224316,0.00090771983,0.0002059123,0.00040352877,0.0000013862788],"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.000008968017,0.00009742362,0.00011439263,0.0000034463988,0.00022460481,0.000007368902,0.00006048732,0.94010735,0.0012160318,0.033705324,0.00025970553,0.024194872],"study_design_scores_gemma":[0.0008433287,0.000028027118,0.00013429234,0.00007688773,0.000024125702,0.0000739947,0.0000059600343,0.99407077,0.00012698598,0.0044341995,0.00007968209,0.000101744416],"about_ca_topic_score_codex":0.00011145937,"about_ca_topic_score_gemma":4.6994475e-7,"teacher_disagreement_score":0.59666383,"about_ca_system_score_codex":0.000092992515,"about_ca_system_score_gemma":0.00023417918,"threshold_uncertainty_score":0.45057178},"labels":[],"label_agreement":null},{"id":"W2140856687","doi":"10.5267/j.ijiec.2010.04.003","title":"Box-Cox Test: the theoretical justification and US-China empirical study","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Fiscal Policy and Economic Growth","field":"Economics, Econometrics and Finance","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":"Test (biology); China; Empirical research; Econometrics; Mathematics; Economics; Statistics; Political science; Geology; Law","score_opus":0.03792341100418427,"score_gpt":0.27127601697286297,"score_spread":0.23335260596867868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140856687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813752,0.000025440357,0.007235165,0.0076525067,0.0024979366,0.00011905043,0.000037563903,0.000014366351,0.00104273],"genre_scores_gemma":[0.9979579,0.0000029481341,0.0005385398,0.00010146892,0.0013688279,0.0000037802427,0.000003103279,0.00001136968,0.000012051575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990525,0.000011574916,0.0006355525,0.0001230938,0.00006734143,0.00010991749],"domain_scores_gemma":[0.9990705,0.00039145068,0.0002840374,0.0001008613,0.00007639921,0.000076725206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501383,0.00009429051,0.00017705634,0.00022385186,0.00006971257,0.00014986932,0.0003330282,0.000081962644,0.000058286667],"category_scores_gemma":[0.0012960552,0.000081084174,0.00007117257,0.000103249215,0.000081951664,0.00017941867,0.000050261955,0.00057952164,0.00002069108],"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.00005056143,0.0005499164,0.28004882,0.0000036212766,0.00033594915,0.000017949258,0.0018704198,0.021507887,0.000119049204,0.6904702,0.0022119535,0.0028136545],"study_design_scores_gemma":[0.0038783348,0.00048510957,0.64478713,0.0000417979,0.00006141204,0.00041235134,0.0002846274,0.18961202,0.00011626018,0.14560558,0.014254862,0.00046053217],"about_ca_topic_score_codex":0.00001823782,"about_ca_topic_score_gemma":0.0000026872485,"teacher_disagreement_score":0.54486465,"about_ca_system_score_codex":0.000042584146,"about_ca_system_score_gemma":0.000030853153,"threshold_uncertainty_score":0.33065164},"labels":[],"label_agreement":null},{"id":"W2140917754","doi":"10.5267/j.ijiec.2011.04.004","title":"Pricing for freight carriers in a competitive environment: A game theory approach","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Profit (economics); Game theory; Industrial organization; Competition (biology); Microeconomics; Business; Economics","score_opus":0.03866667599235438,"score_gpt":0.25701314171378237,"score_spread":0.218346465721428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140917754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026348086,0.000041321575,0.9680463,0.00015558512,0.001131651,0.00021735688,0.00002437261,0.0000301099,0.0040052338],"genre_scores_gemma":[0.97111684,0.000023501563,0.028395208,0.000020849679,0.00037095384,0.000008483434,0.00002144554,0.000009502803,0.00003324072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991379,0.000054152,0.0003456665,0.00007889054,0.00026843246,0.000114967166],"domain_scores_gemma":[0.99925226,0.00032182757,0.00019276518,0.000028811915,0.00013984628,0.00006447658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005928641,0.00006827202,0.00011370023,0.00032331262,0.000051224928,0.000032097374,0.00019828847,0.00007481021,0.000032504544],"category_scores_gemma":[0.00035897337,0.000072688184,0.00006907681,0.00013187871,0.0000421139,0.00021380953,0.000005238413,0.0001743261,8.6193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113310285,0.00010058578,0.0021217598,0.0000026957987,0.000116563955,0.000012194221,0.030531602,0.834663,0.0000132701225,0.128969,0.000038788014,0.003317288],"study_design_scores_gemma":[0.03769203,0.0013482162,0.06505364,0.002497069,0.0006871002,0.00016751038,0.09575553,0.602798,0.0013500123,0.038863145,0.1508299,0.0029578668],"about_ca_topic_score_codex":0.000067504865,"about_ca_topic_score_gemma":0.0000076073925,"teacher_disagreement_score":0.9447687,"about_ca_system_score_codex":0.00015021313,"about_ca_system_score_gemma":0.00014485164,"threshold_uncertainty_score":0.2964138},"labels":[],"label_agreement":null},{"id":"W2141796681","doi":"10.5267/j.ijiec.2012.02.002","title":"Performance analysis of supply chains under customer demand information sharing using role play game","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Institute of Technology Calicut","keywords":"Supply chain; Business; Information sharing; Industrial organization; Microeconomics; Supply and demand; Computer science; Operations management; Economics; Marketing","score_opus":0.03179285317235216,"score_gpt":0.2477927912498987,"score_spread":0.21599993807754653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141796681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9513127,0.000031765725,0.04574127,0.00014647387,0.0020013512,0.000088587396,0.000006916416,0.000022740842,0.000648151],"genre_scores_gemma":[0.9978428,0.000005761547,0.0003952207,0.00013629164,0.0015492575,0.000001850942,0.00004628122,0.000010456258,0.000012096602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986268,0.000005826372,0.0006453931,0.00006265446,0.00048434403,0.00017497984],"domain_scores_gemma":[0.99882704,0.000047723897,0.00058217975,0.00007832657,0.00043692472,0.00002780375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048169825,0.00012241835,0.00022288287,0.0019225687,0.000043370597,0.00014313703,0.0003166083,0.000060178547,0.00012818578],"category_scores_gemma":[0.00009647677,0.00012154894,0.00016156044,0.0007536711,0.000017713659,0.0027627796,0.00010760628,0.00017527143,0.000013135928],"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.000021880136,0.000050597428,0.05235314,0.000011230692,0.0008546633,7.2238237e-7,0.0002204286,0.9395414,0.00015121572,0.00536597,0.00013921114,0.0012895594],"study_design_scores_gemma":[0.00074755197,0.000008914843,0.036340915,0.000105446874,0.00047158703,0.000005912616,0.0002719557,0.95633477,0.000092147326,0.000024987194,0.005457048,0.00013873963],"about_ca_topic_score_codex":0.00006929565,"about_ca_topic_score_gemma":0.0000015056861,"teacher_disagreement_score":0.04653004,"about_ca_system_score_codex":0.00013859758,"about_ca_system_score_gemma":0.000026532723,"threshold_uncertainty_score":0.49566218},"labels":[],"label_agreement":null},{"id":"W2143083947","doi":"10.5267/j.ijiec.2013.09.007","title":"A multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":51,"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; Optimization algorithm; Computer science; Algorithm; Mathematics","score_opus":0.016273509657610593,"score_gpt":0.2571568847819251,"score_spread":0.2408833751243145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143083947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010760265,0.00002384248,0.99685436,0.00088034663,0.0011861529,0.0007656698,0.000020529522,0.0001456234,0.000015847785],"genre_scores_gemma":[0.045059424,0.000006178419,0.95436245,0.00008423054,0.0003168904,0.00006665496,0.00004964452,0.00003253722,0.000021959013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823874,0.000097944394,0.0007633625,0.00030861437,0.00034849282,0.00024287145],"domain_scores_gemma":[0.9962386,0.00066932,0.0006882396,0.00010967384,0.002122954,0.00017122531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046392652,0.00025375572,0.0002959562,0.00067056774,0.00017443394,0.00043802988,0.00048415182,0.00014828941,0.000015982914],"category_scores_gemma":[0.0014784121,0.00026167693,0.00012325593,0.00030763503,0.000062790685,0.0013827898,0.00008258328,0.0005172911,8.873732e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008025976,0.00009604024,0.000017504577,0.000004011218,0.00013164198,0.000003164435,0.00022406859,0.95015985,0.00026308047,0.00023262708,0.00001868026,0.048841313],"study_design_scores_gemma":[0.00486374,0.00023964356,0.000029176415,0.00011775455,0.00002248813,0.00009008733,0.00008474,0.9940206,0.00014032607,0.00005917231,0.00008451166,0.00024778207],"about_ca_topic_score_codex":0.000024110821,"about_ca_topic_score_gemma":5.1025614e-7,"teacher_disagreement_score":0.048593532,"about_ca_system_score_codex":0.00024244306,"about_ca_system_score_gemma":0.0003046695,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W2143664202","doi":"10.5267/j.ijiec.2014.11.001","title":"Response surface and artificial neural network prediction model and optimization for surface roughness in machining","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","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":"Response surface methodology; Surface roughness; Artificial neural network; Machining; Parametric statistics; Parametric model; Materials science; Coefficient of determination; Design of experiments; Mathematics; Biological system; Computer science; Statistics; Artificial intelligence; Composite material; Metallurgy","score_opus":0.03944196855066009,"score_gpt":0.2795422055519603,"score_spread":0.2401002370013002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143664202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3789283,0.00016500594,0.6197354,0.00019487986,0.0008408348,0.000079850026,0.000015396072,0.000036637386,0.000003687745],"genre_scores_gemma":[0.8726315,0.00003586695,0.12700205,0.000010366384,0.00027381047,0.000002026395,0.000019264024,0.000022849672,0.0000022807026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991822,0.000023010924,0.0004135388,0.00009110885,0.0001699331,0.000120156474],"domain_scores_gemma":[0.9992904,0.00023580075,0.00010723197,0.00003215208,0.00025452542,0.00007986252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049214595,0.0001098743,0.00014959209,0.0001283631,0.00003295103,0.00008554615,0.00008254011,0.00008212767,6.478484e-7],"category_scores_gemma":[0.00029620947,0.00012247806,0.000022978573,0.00014798838,0.000013023433,0.000423667,0.000021384796,0.00020912146,5.7060987e-8],"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.00029358332,0.000009781544,0.0002890649,0.0000048131396,0.000028136648,0.0000027599972,0.00032743142,0.99647564,0.00009288638,0.00019868091,0.000065430635,0.002211795],"study_design_scores_gemma":[0.0011813506,0.00006515591,0.00010658525,0.00008439282,0.00001130045,0.000030522016,0.000060452596,0.997923,0.000029319992,0.00034296128,0.000067857145,0.00009707904],"about_ca_topic_score_codex":0.0000029550795,"about_ca_topic_score_gemma":0.000001637795,"teacher_disagreement_score":0.4937032,"about_ca_system_score_codex":0.00010336063,"about_ca_system_score_gemma":0.000062751285,"threshold_uncertainty_score":0.499451},"labels":[],"label_agreement":null},{"id":"W2146762073","doi":"10.5267/j.ijiec.2012.02.005","title":"Optimal pricing and inventory policies for non-instantaneous deteriorating items with permissible delay in payment: Fuzzy expected value model","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Fuzzy logic; Payment; Mathematical optimization; Differentiable function; Value (mathematics); Interest rate; Holding cost; Fuzzy number; Economics; Function (biology); Econometrics; Computer science; Mathematics; Fuzzy set; Statistics; Finance","score_opus":0.03260618444261155,"score_gpt":0.25277399176436655,"score_spread":0.220167807321755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146762073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92697287,0.00006813256,0.07102687,0.0003930565,0.00093214266,0.00025412402,0.0000037055688,0.000028387758,0.0003207153],"genre_scores_gemma":[0.992462,0.0000050856747,0.0056357537,0.00015182376,0.0016774813,0.000014265827,0.0000118392245,0.000024111629,0.00001767667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989382,0.000006167027,0.00044343775,0.00009831214,0.00029331798,0.00022056975],"domain_scores_gemma":[0.9993341,0.00007134401,0.00029185967,0.000049098486,0.00021957049,0.000034033474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032380695,0.00014352181,0.00017766278,0.0006553207,0.000065142754,0.00020780545,0.00017875586,0.00005070949,0.0000047402496],"category_scores_gemma":[0.00012579675,0.00013149517,0.00005257462,0.0002054449,0.000019375482,0.0009379236,0.00006918692,0.00017255396,8.320207e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008750523,0.000078215344,0.005797422,0.000028825223,0.000099874494,0.000016860813,0.0006591834,0.9872475,0.00053928903,0.004095582,0.00023013796,0.0011195554],"study_design_scores_gemma":[0.0019618683,0.00004563357,0.0005742143,0.0003542259,0.000040132338,0.0000523557,0.00069147535,0.9942282,0.00007024632,0.000090325775,0.0017063167,0.0001849962],"about_ca_topic_score_codex":0.00006504464,"about_ca_topic_score_gemma":0.0000061352325,"teacher_disagreement_score":0.0654891,"about_ca_system_score_codex":0.0001514047,"about_ca_system_score_gemma":0.00004620433,"threshold_uncertainty_score":0.53622174},"labels":[],"label_agreement":null},{"id":"W2146831876","doi":"10.5267/j.ijiec.2014.4.004","title":"An investigation on research and development cost reduction and channel strategies in competing supply chains","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","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":"Reduction (mathematics); Channel (broadcasting); Supply chain; Cost reduction; Business; Industrial organization; Computer science; Telecommunications; Mathematics; Marketing","score_opus":0.1644099758398469,"score_gpt":0.3361305177890728,"score_spread":0.17172054194922592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146831876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793066,0.000014432673,0.018267471,0.001233284,0.0009817705,0.00010240894,0.000001665671,0.000017817836,0.00007454731],"genre_scores_gemma":[0.9974742,0.000006979903,0.00087975786,0.000037601065,0.0015536526,0.0000039468296,0.00003233282,0.000008911173,0.0000026137623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908036,0.000017783952,0.00033191577,0.00011996346,0.00033426445,0.0001157034],"domain_scores_gemma":[0.9992036,0.000119753844,0.000151215,0.000044718414,0.0004583982,0.000022319064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782462,0.000085825275,0.00010534333,0.00083858235,0.00008370384,0.0004318199,0.00017102173,0.000057378966,0.000005661363],"category_scores_gemma":[0.00022110078,0.00008440249,0.000009146477,0.00023079591,0.000053939348,0.0010841305,0.0000490455,0.0003143369,0.000002802141],"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.00017089334,0.00021965375,0.011614849,0.000054865006,0.000068809684,0.000016914984,0.0013176446,0.7778055,0.002370675,0.10189798,0.00031171448,0.10415049],"study_design_scores_gemma":[0.0029808574,0.00021465277,0.07954454,0.002029541,0.000017486384,0.00014352567,0.003841141,0.89140207,0.0014111543,0.0070621413,0.010813296,0.0005396151],"about_ca_topic_score_codex":0.000098983604,"about_ca_topic_score_gemma":0.000022095172,"teacher_disagreement_score":0.11359654,"about_ca_system_score_codex":0.00005938243,"about_ca_system_score_gemma":0.00006326421,"threshold_uncertainty_score":0.41640493},"labels":[],"label_agreement":null},{"id":"W2147371001","doi":"10.5267/j.ijiec.2013.05.004","title":"A centralized reverse channel structure with flexible manufacturing under the stock out situation","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":21,"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":"Remanufacturing; Supply chain; Economic shortage; Stock (firearms); Time horizon; Production (economics); Holding cost; Flexibility (engineering); Profit (economics); Mathematical optimization; Production planning; Computer science; Industrial organization; Manufacturing engineering; Operations research; Operations management; Business; Economics; Microeconomics; Engineering; Mathematics; Mechanical engineering","score_opus":0.0218984460610633,"score_gpt":0.2295042089705589,"score_spread":0.2076057629094956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147371001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.692398,0.00004059649,0.2766921,0.02413879,0.0051824576,0.000984458,0.000007636755,0.00014732046,0.00040862575],"genre_scores_gemma":[0.99562997,0.000002168559,0.0008362126,0.0006434806,0.0026862402,0.00001070144,0.000023281927,0.000025291867,0.00014262967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871594,0.000011879827,0.00038433372,0.00011759478,0.0005683364,0.00020192894],"domain_scores_gemma":[0.9987159,0.00010247496,0.00040029705,0.00010550981,0.0006543736,0.000021459746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020094965,0.00016130855,0.00015051253,0.00047026714,0.000101670994,0.0005522451,0.00044914556,0.000057835976,0.0002185239],"category_scores_gemma":[0.000111940324,0.00011501561,0.0000718923,0.0002056941,0.000023904933,0.0011476427,0.000095016505,0.00032808725,0.00002344657],"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.00004082003,0.000027662576,0.00016971477,0.000011042208,0.00025571432,0.000015384143,0.000113878385,0.9882954,0.00008489617,0.0029055872,0.005674363,0.00240556],"study_design_scores_gemma":[0.016243964,0.0001690822,0.02669988,0.0011105555,0.00066030095,0.00021082403,0.009346935,0.81598306,0.0016243045,0.022684474,0.10372255,0.0015440941],"about_ca_topic_score_codex":0.00020513574,"about_ca_topic_score_gemma":0.000009927697,"teacher_disagreement_score":0.30323195,"about_ca_system_score_codex":0.00018892088,"about_ca_system_score_gemma":0.000054775443,"threshold_uncertainty_score":0.53253126},"labels":[],"label_agreement":null},{"id":"W2148122553","doi":"10.5267/j.ijiec.2012.05.002","title":"Towards a synergy between project and supply chain management","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Construction Project Management and Performance","field":"Decision Sciences","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":"Supply chain; Supply chain management; Business; Process management; Supply chain risk management; Operations management; Project management; Environmental resource management; Industrial organization; Engineering; Systems engineering; Environmental science; Service management; Marketing","score_opus":0.09451826418339683,"score_gpt":0.3539001833903768,"score_spread":0.25938191920698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148122553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8298012,0.00014059921,0.15713166,0.002458497,0.007425248,0.0002559428,0.000028951214,0.000044698514,0.0027131808],"genre_scores_gemma":[0.9919532,0.000030310357,0.006178674,0.000031344058,0.0016263552,0.000003475682,0.000004409533,0.0000073343117,0.00016487666],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998079,0.000044199478,0.00066509715,0.00010358391,0.0009515799,0.00015654326],"domain_scores_gemma":[0.99886715,0.00030767065,0.00031319808,0.000085933476,0.0003368062,0.0000892442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014446025,0.00010334405,0.00017744067,0.0011068158,0.000051653813,0.00022385949,0.00044277965,0.000043809232,0.000051100975],"category_scores_gemma":[0.00043030066,0.00008549211,0.00008287775,0.00046877284,0.000027626373,0.0006639933,0.00014268949,0.00020181615,0.000010338234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050122584,0.000059786358,0.05916582,0.0000053910344,0.000532383,0.00001858591,0.00080552633,0.021905448,0.000023007646,0.019850073,0.0059423205,0.89164156],"study_design_scores_gemma":[0.006306995,0.00033846035,0.3064869,0.00046404425,0.00025525605,0.000718135,0.0020185094,0.056876708,0.00041462295,0.0038864135,0.6213764,0.0008575632],"about_ca_topic_score_codex":0.000014032394,"about_ca_topic_score_gemma":5.6002966e-7,"teacher_disagreement_score":0.89078397,"about_ca_system_score_codex":0.00006733841,"about_ca_system_score_gemma":0.000054319695,"threshold_uncertainty_score":0.3486267},"labels":[],"label_agreement":null},{"id":"W2151596035","doi":"10.5267/j.ijiec.2010.08.001","title":"Retailer’s inventory policy for deteriorating items under partial trade credit policy","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Trade credit; Economics; Business; Finance","score_opus":0.04700383319569546,"score_gpt":0.2818037631409623,"score_spread":0.23479992994526683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151596035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68170196,0.000055081477,0.20361146,0.066118576,0.044000916,0.0011381527,0.000055239852,0.0003381012,0.0029805363],"genre_scores_gemma":[0.9584836,0.0000019152883,0.0010344363,0.0009675584,0.039384887,0.000014933443,0.00003332831,0.0000335805,0.000045776633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855113,0.000008031783,0.0006389148,0.00013762302,0.00043475928,0.00022952467],"domain_scores_gemma":[0.998943,0.00011178654,0.0004775215,0.00009958805,0.00032419484,0.000043911758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044495147,0.00016704849,0.00019491508,0.0011334573,0.000096846765,0.00041403243,0.0004835639,0.00010846477,0.000058521786],"category_scores_gemma":[0.0010580767,0.00017002183,0.00019704193,0.00035300126,0.000036035268,0.0008426555,0.00008753153,0.00039540706,0.00000951536],"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.0002096635,0.00033091803,0.0026733514,0.00007387534,0.0007919995,0.00004181213,0.000301603,0.5548389,0.011344189,0.37112576,0.03396443,0.024303488],"study_design_scores_gemma":[0.0045327544,0.00008638946,0.0014690959,0.00021253045,0.00010650446,0.000052207914,0.00027479287,0.43560708,0.0005069934,0.0047810087,0.55187273,0.00049790245],"about_ca_topic_score_codex":0.00012401177,"about_ca_topic_score_gemma":0.000010794477,"teacher_disagreement_score":0.51790833,"about_ca_system_score_codex":0.00014511662,"about_ca_system_score_gemma":0.0002094363,"threshold_uncertainty_score":0.69332886},"labels":[],"label_agreement":null},{"id":"W2152119697","doi":"10.5267/j.ijiec.2010.05.002","title":"An inventory model for deteriorating items with varying demand pattern and unknown time horizon","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Horizon; Time horizon; Economics; Econometrics; Operations management; Computer science; Operations research; Mathematics; Finance","score_opus":0.024821111720016907,"score_gpt":0.23877757910448863,"score_spread":0.21395646738447172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152119697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65806735,0.000008855705,0.33968008,0.00047422588,0.0014202459,0.00017663666,0.0000044016642,0.000041324078,0.00012690897],"genre_scores_gemma":[0.99333054,9.644675e-7,0.003408182,0.0001493692,0.00303232,0.000008616208,0.000024574441,0.000025299663,0.000020129482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.0000047726644,0.000343903,0.00012255987,0.00026209414,0.0001285507],"domain_scores_gemma":[0.99917954,0.000057737623,0.00029011196,0.000066871005,0.0003739892,0.0000317224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035312623,0.00012741482,0.00014426628,0.00038833244,0.00007893556,0.0003776403,0.0002441617,0.00005902002,0.000017273545],"category_scores_gemma":[0.000108136606,0.000116074036,0.00004977752,0.00009651696,0.000022133992,0.0010154227,0.000045999648,0.00023548871,0.0000022073923],"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.00008627531,0.00009933583,0.0023412483,0.00003036676,0.0001959744,0.000017676217,0.00016115267,0.9574905,0.0081768,0.0031829092,0.00066590455,0.027551863],"study_design_scores_gemma":[0.0013234616,0.00006524057,0.00008458994,0.000099723424,0.000043225617,0.000016314143,0.000021203146,0.9950612,0.00006787288,0.00025647,0.0028230394,0.00013764198],"about_ca_topic_score_codex":0.000016814272,"about_ca_topic_score_gemma":0.00000764052,"teacher_disagreement_score":0.33627188,"about_ca_system_score_codex":0.00003067664,"about_ca_system_score_gemma":0.000036772773,"threshold_uncertainty_score":0.4733362},"labels":[],"label_agreement":null},{"id":"W2153650307","doi":"10.5267/j.ijiec.2010.03.001","title":"A Portfolio Selection Using Fuzzy Analytic Hierarchy Process: A Case Study of Iranian pharmaceutical industry","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Analytic hierarchy process; Selection (genetic algorithm); Portfolio; Fuzzy logic; Pharmaceutical industry; Business; Analytic network process; Process (computing); Computer science; Manufacturing engineering; Mathematical optimization; Mathematics; Engineering; Operations research; Economics; Artificial intelligence; Financial economics; Pharmacology; Medicine","score_opus":0.21256274235994413,"score_gpt":0.4761484495239577,"score_spread":0.2635857071640135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153650307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96008,0.000008399416,0.035789434,0.00014328728,0.0036870618,0.00021957871,0.000014011663,0.000022365393,0.000035803037],"genre_scores_gemma":[0.9928697,3.9207762e-7,0.0057953205,0.000022942775,0.0012747879,0.0000025803392,9.872546e-7,0.000022180087,0.000011120484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500203,0.00014732806,0.0020586804,0.000285384,0.0022930817,0.00021350557],"domain_scores_gemma":[0.9942087,0.001235638,0.0011402471,0.00019317424,0.0029789864,0.00024323915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024861803,0.00020285192,0.00045831248,0.0023587286,0.0001037144,0.00035062313,0.0008311747,0.00025993178,0.00024040266],"category_scores_gemma":[0.0060155108,0.00017926861,0.00018804372,0.0015464887,0.00005345741,0.00067762955,0.00011665036,0.001800544,0.0000038697567],"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.00015158507,0.0006860997,0.019602204,0.0000030536362,0.00030885177,0.002222782,0.0015607446,0.94853336,0.0056632627,0.00013421045,0.00014710035,0.020986747],"study_design_scores_gemma":[0.0047004535,0.00031435234,0.0018549684,0.0001415941,0.00014846123,0.022874938,0.004418293,0.96346444,0.0005996469,0.0007476768,0.0004542828,0.00028087772],"about_ca_topic_score_codex":0.00007859,"about_ca_topic_score_gemma":0.000022661503,"teacher_disagreement_score":0.032789633,"about_ca_system_score_codex":0.00012043255,"about_ca_system_score_gemma":0.000477748,"threshold_uncertainty_score":0.7822568},"labels":[],"label_agreement":null},{"id":"W2154430520","doi":"10.5267/j.ijiec.2012.05.006","title":"Introducing mass balancing theorem for network flow maximization","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Search Problems","field":"Computer Science","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":"Leverhulme Trust","keywords":"Maximization; Flow (mathematics); Flow network; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Geometry","score_opus":0.025559305693846873,"score_gpt":0.2647144740999841,"score_spread":0.23915516840613724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154430520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006461262,0.00007011861,0.99078727,0.0016516559,0.0065670228,0.00014225018,0.000004836551,0.000056143486,0.00007454967],"genre_scores_gemma":[0.3345004,0.0000104749,0.6609801,0.000108094704,0.0043416386,0.0000068362424,0.000016457563,0.000015298909,0.000020658852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986991,0.000045496214,0.0005009588,0.00010508437,0.00039130216,0.00025800776],"domain_scores_gemma":[0.9983937,0.00037850544,0.00026981995,0.00010553887,0.00071892445,0.00013350745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874431,0.00010754006,0.00015297811,0.00027965775,0.00007791866,0.00025598955,0.00059249904,0.0000707095,0.000014392249],"category_scores_gemma":[0.000660163,0.000104795276,0.000103965955,0.0003083531,0.000010641988,0.0009376916,0.00006405501,0.00023273956,0.0000036778358],"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.000010900305,0.000026193393,0.00035959182,0.0000023135171,0.00007899798,0.0000014075652,0.00022818962,0.94601333,0.000110107685,0.039702892,0.0014857195,0.011980361],"study_design_scores_gemma":[0.00086114416,0.00004669213,0.00011104235,0.00007817797,0.000009711639,0.00004745731,0.000014521519,0.9923503,0.00016924254,0.0012346422,0.004968259,0.00010881713],"about_ca_topic_score_codex":0.0000013509298,"about_ca_topic_score_gemma":1.3955503e-7,"teacher_disagreement_score":0.3338543,"about_ca_system_score_codex":0.0001419998,"about_ca_system_score_gemma":0.000118536205,"threshold_uncertainty_score":0.4273427},"labels":[],"label_agreement":null},{"id":"W2159274580","doi":"10.5267/j.ijiec.2015.3.002","title":"Machining parameter optimization in turning process for sustainable manufacturing","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","field":"Engineering","cited_by":14,"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":"Machining; Manufacturing engineering; Process (computing); Process variable; Mechanical engineering; Process optimization; Process engineering; Engineering; Computer science","score_opus":0.028258910727770713,"score_gpt":0.28664428207193676,"score_spread":0.25838537134416606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159274580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06865917,0.00009422675,0.92965674,0.00008920257,0.0011529473,0.0001454158,0.0000037163336,0.00007604044,0.0001225188],"genre_scores_gemma":[0.951584,0.000010326584,0.047834255,0.000013839438,0.00046847135,0.000013924185,0.000027023943,0.000036110276,0.000012072897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896723,0.000010021451,0.0004958493,0.00008940348,0.00024784854,0.00018966215],"domain_scores_gemma":[0.99899566,0.00019908386,0.00015266042,0.00004331875,0.0005228815,0.00008641805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030239168,0.00013015971,0.00017631709,0.00048207847,0.000026359015,0.000105821025,0.00021718763,0.00008265711,0.0000040087157],"category_scores_gemma":[0.00081383565,0.00013979452,0.000053112548,0.00017745592,0.00000773843,0.0006858178,0.00001864609,0.000290028,3.7930158e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041932417,0.000016335578,0.00011701242,0.000019415573,0.000048073314,0.000017839786,0.0004085792,0.9963069,0.000010782114,0.00019434902,0.00006150674,0.002757259],"study_design_scores_gemma":[0.0016906017,0.000054946122,0.00002329746,0.00014305372,0.000013400008,0.000041011237,0.00036870418,0.995619,0.0007903917,0.00054288766,0.000572094,0.00014064078],"about_ca_topic_score_codex":0.0000038768712,"about_ca_topic_score_gemma":5.694378e-7,"teacher_disagreement_score":0.8829248,"about_ca_system_score_codex":0.00025301115,"about_ca_system_score_gemma":0.00009612979,"threshold_uncertainty_score":0.5700655},"labels":[],"label_agreement":null},{"id":"W2162288265","doi":"10.5267/j.ijiec.2010.06.001","title":"Stochastic integrated vendor–buyer model with unstable lead time and setup cost","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of Delhi","keywords":"Vendor; Lead time; Reputation; Computer science; Operations research; Business; Operations management; Economics; Marketing; Engineering","score_opus":0.02204544551007336,"score_gpt":0.2230154353290099,"score_spread":0.20096998981893652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162288265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5702679,0.00002792092,0.4184831,0.0038317563,0.00471486,0.00046040516,0.000031980977,0.00013860593,0.0020434333],"genre_scores_gemma":[0.99610513,9.662529e-7,0.0019783624,0.00020218513,0.0014891415,0.0000047636163,0.00003730644,0.000022310434,0.0001598453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999135,0.000003833344,0.00029908906,0.000104435654,0.00032614954,0.00013149413],"domain_scores_gemma":[0.99918693,0.00006357441,0.0002171376,0.00006329385,0.0004428334,0.000026220028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024026334,0.00013011227,0.00014864394,0.000468344,0.00005154086,0.00028422603,0.00024215707,0.000055547807,0.00009492498],"category_scores_gemma":[0.00017854487,0.00011208647,0.000043375294,0.00019281826,0.00003441719,0.00068580796,0.00006305034,0.0004005694,0.000021502769],"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.0000636703,0.000054039978,0.00016757805,0.000004671582,0.00013824824,0.000020256204,0.000029101398,0.9862506,0.00079307554,0.0056189876,0.003459928,0.0033998687],"study_design_scores_gemma":[0.001430342,0.00002000546,0.00010257267,0.00011014535,0.000048956048,0.00003544673,0.000040332503,0.98564345,0.000033535554,0.00024186153,0.012158374,0.00013500116],"about_ca_topic_score_codex":0.000047514044,"about_ca_topic_score_gemma":0.000010293671,"teacher_disagreement_score":0.4258372,"about_ca_system_score_codex":0.00004625449,"about_ca_system_score_gemma":0.000077267774,"threshold_uncertainty_score":0.45707533},"labels":[],"label_agreement":null},{"id":"W2162860386","doi":"10.5267/j.ijiec.2011.06.008","title":"A fast-response production-inventory model for deteriorating seasonal products with learning in set-ups","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Production (economics); Set (abstract data type); Operations management; Computer science; Operations research; Econometrics; Business; Economics; Mathematics; Microeconomics","score_opus":0.06275616712622542,"score_gpt":0.24591593999445735,"score_spread":0.18315977286823193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162860386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8845047,0.000020727113,0.11082508,0.0016270925,0.0023612885,0.0004247261,0.00000317168,0.000073710056,0.00015950488],"genre_scores_gemma":[0.9920318,0.0000010290554,0.005799744,0.00009568871,0.001876276,0.0000260024,0.000012052715,0.000028280492,0.00012909627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988199,0.000016719358,0.00045526613,0.00016741062,0.00036429655,0.00017639196],"domain_scores_gemma":[0.9987964,0.00005746962,0.00038363904,0.00006572629,0.0006766298,0.000020112375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007831889,0.0001463288,0.00016599335,0.00071770337,0.00006461564,0.00013296702,0.00027282504,0.000047156023,0.000017565204],"category_scores_gemma":[0.0008807496,0.0001388792,0.000067876324,0.00030916097,0.000023572651,0.0009206994,0.000057651392,0.00028212444,0.000004085088],"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.0008533392,0.000100774545,0.0050512473,0.000025193067,0.000115187606,0.000025551752,0.0006461532,0.98805475,0.00035583478,0.0012232049,0.0006098092,0.0029389362],"study_design_scores_gemma":[0.0018061346,0.00008042377,0.0014381128,0.00031553322,0.000040090366,0.00002435695,0.00044207033,0.9922868,0.00013390715,0.00021558268,0.0030165385,0.00020047619],"about_ca_topic_score_codex":0.000022556058,"about_ca_topic_score_gemma":0.000008782591,"teacher_disagreement_score":0.10752713,"about_ca_system_score_codex":0.00014244927,"about_ca_system_score_gemma":0.0001441451,"threshold_uncertainty_score":0.566333},"labels":[],"label_agreement":null},{"id":"W2163947109","doi":"10.5267/j.ijiec.2010.01.007","title":"A robust multi-objective production planning","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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":"Production planning; Production (economics); Computer science; Environmental science; Mathematical optimization; Economics; Mathematics; Microeconomics","score_opus":0.039483052832837116,"score_gpt":0.2661522685904813,"score_spread":0.22666921575764418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163947109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25151077,0.000049027243,0.7291127,0.00023248118,0.018739786,0.00007762369,0.000007409887,0.00018233899,0.00008786699],"genre_scores_gemma":[0.8153693,0.0000063215234,0.18209815,0.000010329996,0.0024585694,0.0000032884764,0.000009750898,0.000027912569,0.000016386386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.000009456488,0.0003928165,0.00008414987,0.0002767671,0.00011551392],"domain_scores_gemma":[0.99915314,0.00008828353,0.0001122876,0.0000648469,0.00049857015,0.00008284813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021170675,0.000117144045,0.00013231147,0.0004195832,0.000036741036,0.00008560407,0.00022776876,0.00010688479,0.000022238673],"category_scores_gemma":[0.00045002752,0.00012262064,0.000075791046,0.00021634996,0.000016844753,0.0002682877,0.000015385089,0.00070397055,0.0000060398415],"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.0000077724935,0.000028032951,0.0002502091,0.000001734528,0.00012982605,0.0000144430605,0.00021612097,0.9941573,0.0017692046,0.00009731042,0.00030116076,0.0030268498],"study_design_scores_gemma":[0.00084614777,0.000022451532,0.0006471872,0.000089897316,0.00001908874,0.00023973768,0.00012105098,0.99479216,0.0024335177,0.000015320631,0.0006293649,0.00014406047],"about_ca_topic_score_codex":0.0000025704294,"about_ca_topic_score_gemma":9.942263e-7,"teacher_disagreement_score":0.5638585,"about_ca_system_score_codex":0.00007429345,"about_ca_system_score_gemma":0.00006144043,"threshold_uncertainty_score":0.5000324},"labels":[],"label_agreement":null},{"id":"W2165106335","doi":"10.5267/j.ijiec.2014.10.004","title":"New methods for solving a vertex p-center problem with uncertain demand-weighted distance: A real case study","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Center (category theory); Vertex (graph theory); Mathematical optimization; Mathematics; Combinatorics; Computer science; Graph","score_opus":0.07283068814756592,"score_gpt":0.3337968013540784,"score_spread":0.2609661132065125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165106335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07754576,0.000021130008,0.91845393,0.0010748005,0.0021354163,0.0004931042,0.000004089226,0.00005360599,0.00021815322],"genre_scores_gemma":[0.9220243,0.0000020835303,0.07609261,0.00009069599,0.0016259612,0.00002380867,0.000025977117,0.00002449086,0.000090074944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987515,0.000016611106,0.0005604436,0.00014872418,0.00036892807,0.0001537496],"domain_scores_gemma":[0.9985131,0.00008917057,0.00022381975,0.000086430206,0.0010344663,0.000052987787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079963,0.00015061657,0.00020022813,0.00041650046,0.000065861204,0.00025299686,0.0002735022,0.000041740357,0.000021770693],"category_scores_gemma":[0.0002442283,0.00012936423,0.00007966406,0.00033291755,0.00001044261,0.00066417054,0.00006400204,0.00016879948,0.0000041988237],"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.0004809426,0.0005538833,0.0050560907,0.00003579347,0.00090580375,0.0004138062,0.0012322102,0.92268467,0.000020877109,0.008911377,0.011003655,0.048700895],"study_design_scores_gemma":[0.0113337375,0.00026305238,0.00025952506,0.00023545187,0.00023557796,0.0003491307,0.0031666048,0.93893343,0.000009898355,0.0010118557,0.043830976,0.0003707454],"about_ca_topic_score_codex":0.0010329102,"about_ca_topic_score_gemma":0.00017153364,"teacher_disagreement_score":0.84447855,"about_ca_system_score_codex":0.00016397676,"about_ca_system_score_gemma":0.00015551577,"threshold_uncertainty_score":0.52753204},"labels":[],"label_agreement":null},{"id":"W2169219108","doi":"10.5267/j.ijiec.2012.011.002","title":"Optimization of process parameters for friction Stir welding of dissimilar Aluminum alloys (AA2024 -T6 and AA6351-T6) by using Taguchi method","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Welding Techniques Analysis","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":"Osmania University; Indian Institute of Technology Madras","keywords":"Taguchi methods; Friction stir welding; Aluminium; Metallurgy; Materials science; Welding; Process (computing); Composite material; Computer science","score_opus":0.025428755182499912,"score_gpt":0.30185971853395865,"score_spread":0.2764309633514587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169219108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15297171,0.00006179513,0.8461109,0.000090686786,0.0005032795,0.00017395656,0.00003832759,0.000043406995,0.0000059619088],"genre_scores_gemma":[0.60560906,0.000027276485,0.39421916,0.0000033827775,0.00008964169,0.000008158572,0.000016247574,0.000025315117,0.0000017774756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877423,0.000018550369,0.000708148,0.000104266815,0.0002753488,0.00011947304],"domain_scores_gemma":[0.9986303,0.00028386604,0.00037406306,0.000066309905,0.0005806191,0.000064837644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021679228,0.00014518833,0.00029412413,0.00047073542,0.000028354933,0.000042111147,0.00020012594,0.00010883693,0.000010745626],"category_scores_gemma":[0.00029222056,0.00015429666,0.000113330745,0.00026237353,0.000021524356,0.00041875738,0.000023826968,0.00020376703,7.049579e-8],"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.000011192555,0.000021319536,0.00010184727,0.00002973454,0.00031401566,5.233492e-7,0.00013211014,0.98779225,0.008010562,0.00007753307,0.00022900784,0.0032798743],"study_design_scores_gemma":[0.0005069375,0.00006167268,0.000019135165,0.0002356132,0.00010804119,0.000020890517,0.000107341744,0.9789083,0.019444574,0.00039791333,0.00006730368,0.00012228207],"about_ca_topic_score_codex":0.000030369785,"about_ca_topic_score_gemma":2.6725507e-7,"teacher_disagreement_score":0.45263734,"about_ca_system_score_codex":0.00012238405,"about_ca_system_score_gemma":0.00003246119,"threshold_uncertainty_score":0.6292035},"labels":[],"label_agreement":null},{"id":"W2169602694","doi":"10.5267/j.ijiec.2013.08.002","title":"Optimal trade-credit policy for perishable items deeming imperfect production and stock dependent demand","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Working Capital and Financial Performance","field":"Business, Management and Accounting","cited_by":19,"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":"Council of Scientific and Industrial Research, India","keywords":"Imperfect; Stock (firearms); Economics; Production (economics); Business; Monetary economics; Microeconomics; Engineering","score_opus":0.01742681777307952,"score_gpt":0.23080665008429643,"score_spread":0.2133798323112169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169602694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96295315,0.0000988073,0.029916814,0.0029945218,0.0036273887,0.0002863108,0.0000043766336,0.000035793895,0.00008280978],"genre_scores_gemma":[0.98558277,0.000009284688,0.001510724,0.00007246348,0.0127492985,0.000016090065,0.000009039604,0.000016250226,0.000034104913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914175,0.0000029023754,0.00036235608,0.00010992849,0.00023336356,0.00014970094],"domain_scores_gemma":[0.99930745,0.0000615223,0.00025488433,0.000040778497,0.00031357066,0.00002180743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022421207,0.00011375196,0.0001459009,0.0004120394,0.00009989005,0.00034961227,0.00017098393,0.00006412398,0.000011016701],"category_scores_gemma":[0.00054566946,0.000108049615,0.000070224705,0.0001761356,0.000018327011,0.0011738722,0.000045582838,0.00019400926,0.0000047278],"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.00012059026,0.00011904593,0.0067755855,0.00006170662,0.00024105207,0.000009224051,0.00031198192,0.9302369,0.00273496,0.003978048,0.009304259,0.0461067],"study_design_scores_gemma":[0.004139836,0.00025012827,0.0318111,0.000995092,0.00015286358,0.00037651838,0.00035095535,0.92550164,0.00085813383,0.0014818752,0.033296764,0.0007851072],"about_ca_topic_score_codex":0.000086040636,"about_ca_topic_score_gemma":0.0000019316249,"teacher_disagreement_score":0.04532159,"about_ca_system_score_codex":0.00007407297,"about_ca_system_score_gemma":0.000052576404,"threshold_uncertainty_score":0.44061357},"labels":[],"label_agreement":null},{"id":"W2169626364","doi":"10.5267/j.ijiec.2011.06.005","title":"An integrated TSP-GA with EOL cost model for selecting the best EOL option","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Reliability engineering; Computer science; Mathematical optimization; Process engineering; Operations management; Operations research; Engineering; Mathematics","score_opus":0.048373285037110324,"score_gpt":0.2581820452712173,"score_spread":0.20980876023410697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169626364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05346124,0.000018871317,0.9452498,0.00006950086,0.00082757504,0.00020949547,0.00001918465,0.00008201488,0.00006229687],"genre_scores_gemma":[0.947217,0.000010820615,0.052180804,0.000015343801,0.0004729862,0.00002307246,0.00003020535,0.000035181518,0.0000146266875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991356,0.0000112234975,0.00038656415,0.000089087596,0.00023544466,0.00014204846],"domain_scores_gemma":[0.9990064,0.00008970449,0.00015320099,0.00007259545,0.00060662196,0.000071468414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002030498,0.00014414369,0.00013583619,0.00023241459,0.00007251,0.00011206772,0.0003244962,0.000082937775,0.000010773201],"category_scores_gemma":[0.00008408245,0.000109345696,0.000057154946,0.0001517492,0.000015826201,0.00039919204,0.0000100144525,0.00033240078,0.0000010738589],"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.000057229474,0.00003754635,0.000060999242,0.0000060235543,0.0001379862,0.0000021795279,0.0006535853,0.9896619,0.00010927088,0.0004630587,0.000056132863,0.008754139],"study_design_scores_gemma":[0.000818612,0.000118439035,0.000055832657,0.00012014014,0.00004441516,0.000054537515,0.00014080179,0.996642,0.0014211874,0.00010260223,0.00035238406,0.00012905283],"about_ca_topic_score_codex":0.0000151314,"about_ca_topic_score_gemma":0.0000064940737,"teacher_disagreement_score":0.89375573,"about_ca_system_score_codex":0.0001226067,"about_ca_system_score_gemma":0.00008857512,"threshold_uncertainty_score":0.4458988},"labels":[],"label_agreement":null},{"id":"W2169983487","doi":"10.5267/j.ijiec.2014.12.001","title":"An inventory model for perishable items with quadratic trapezoidal type demand under partial backlogging","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Piecewise; Economic shortage; Sensitivity (control systems); Quadratic equation; Mathematical optimization; Constant (computer programming); Holding cost; Function (biology); Inventory control; Inventory management; Mathematics; Quadratic model; Quadratic function; Computer science; Mathematical economics; Economics; Operations research; Operations management; Statistics; Engineering","score_opus":0.08343883455896235,"score_gpt":0.27650894270519183,"score_spread":0.1930701081462295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169983487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28236037,0.000045271798,0.7123674,0.0011143616,0.0034809057,0.00025635635,0.0000043093096,0.00006554698,0.0003054546],"genre_scores_gemma":[0.9936826,0.0000011063703,0.002382794,0.00033721246,0.0034640664,0.000008636672,0.000037758193,0.000026680038,0.00005911337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989096,0.000008975338,0.00038821215,0.00012043354,0.0004133416,0.0001594691],"domain_scores_gemma":[0.99884343,0.000040679115,0.00026246876,0.00007530634,0.00072762434,0.000050487764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044832917,0.00013303747,0.00016560203,0.00039467172,0.000056240853,0.0003308358,0.0003087953,0.00005582481,0.000020264077],"category_scores_gemma":[0.00013025553,0.000120813405,0.00006688354,0.00017806311,0.00002163768,0.0011342553,0.000031208736,0.00016074146,0.000006038838],"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.00015664056,0.000088609275,0.0005432953,0.000009049469,0.00014208294,0.000007735089,0.00013899071,0.9870027,0.00008373752,0.0072918613,0.004090708,0.00044460286],"study_design_scores_gemma":[0.0021305503,0.00009429664,0.000039036295,0.000079756246,0.000062221465,0.000010795465,0.00031539646,0.9869147,0.00002380256,0.0008606049,0.009322784,0.00014603988],"about_ca_topic_score_codex":0.000025791984,"about_ca_topic_score_gemma":0.000007744868,"teacher_disagreement_score":0.71132225,"about_ca_system_score_codex":0.00011890373,"about_ca_system_score_gemma":0.00014459436,"threshold_uncertainty_score":0.4926628},"labels":[],"label_agreement":null},{"id":"W2170176569","doi":"10.5267/j.ijiec.2013.11.002","title":"Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Railway Systems and Energy Efficiency","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":"Tardiness; Train; Scheduling (production processes); Schedule; Computer science; Real-time computing; Benchmark (surveying); Mathematical optimization; Algorithm; Job shop scheduling; Mathematics","score_opus":0.008309986096417513,"score_gpt":0.20757572844642955,"score_spread":0.19926574235001204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170176569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33365571,0.00013775262,0.6629136,0.0011546235,0.0017032361,0.00011942737,0.00001664362,0.00006283969,0.0002361483],"genre_scores_gemma":[0.9849508,0.0000034553696,0.013463299,0.000043141845,0.0014704936,0.0000054222437,0.0000047483395,0.000024718765,0.000033939577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990527,0.000024523933,0.00035651767,0.00008819014,0.0003199897,0.00015805227],"domain_scores_gemma":[0.9991871,0.0002379734,0.00007515505,0.000067367495,0.0002235457,0.00020883724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036946769,0.0001470187,0.00020936801,0.00021505693,0.00005417323,0.00014598087,0.00020859185,0.00006615738,0.000014540391],"category_scores_gemma":[0.000307453,0.00010516241,0.00005896924,0.00020073388,0.00001982736,0.00014488412,0.000016466152,0.0002595662,0.0000018823384],"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.000016186288,0.000011465816,0.000016663846,0.0000025996849,0.00014468214,0.000011719019,0.00020100301,0.97946113,0.0004201044,0.0006847911,0.00025584642,0.018773787],"study_design_scores_gemma":[0.0013327952,0.000103781604,0.00026231265,0.00015440756,0.000030039682,0.00040238604,0.000111461624,0.99204355,0.00018335257,0.000045081455,0.005181713,0.00014910514],"about_ca_topic_score_codex":0.000019926434,"about_ca_topic_score_gemma":0.0000029876865,"teacher_disagreement_score":0.65129507,"about_ca_system_score_codex":0.000059201087,"about_ca_system_score_gemma":0.00006754642,"threshold_uncertainty_score":0.4288399},"labels":[],"label_agreement":null},{"id":"W2200893885","doi":"10.5267/j.ijiec.2015.10.001","title":"A hybrid algorithm for stochastic single-source capacitated facility location problem with service level requirements","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Facility location problem; Mathematical optimization; Genetic algorithm; Computer science; Supply chain; Location model; Ant colony optimization algorithms; Service (business); Set (abstract data type); Service level; Heuristic; 1-center problem; Operations research; Mathematics; Economics; Business","score_opus":0.11988408301805317,"score_gpt":0.2641297721996615,"score_spread":0.14424568918160832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200893885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041402854,0.000011697446,0.9544606,0.0019957991,0.0015926333,0.00037308037,0.00004045421,0.00006505384,0.000057831774],"genre_scores_gemma":[0.98365325,3.4494957e-7,0.014402968,0.0003288942,0.0012563778,0.000029075514,0.00023768599,0.000021147838,0.00007026579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984337,0.000009877059,0.00060097507,0.00016076618,0.0006228448,0.00017181507],"domain_scores_gemma":[0.9961936,0.00004874698,0.00029252254,0.00009375767,0.003325901,0.000045511864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053085154,0.00016504982,0.00017983676,0.00044984373,0.000060937582,0.00021441074,0.00033806014,0.000043542193,0.000015712008],"category_scores_gemma":[0.0003849832,0.00015738407,0.000059520124,0.00037271436,0.000019825866,0.0009025836,0.00005479733,0.00016195243,0.0000256198],"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.00009097313,0.00015272241,0.00004840393,0.000024210623,0.00019714532,0.0000031383875,0.000118369,0.97073877,0.0000455833,0.00038038002,0.0019021155,0.026298182],"study_design_scores_gemma":[0.0035645019,0.000094626346,0.00013614916,0.00020560705,0.00009759311,0.000021641034,0.00033419044,0.9795411,0.000051798852,0.00038535334,0.015325028,0.00024236526],"about_ca_topic_score_codex":0.00031493,"about_ca_topic_score_gemma":0.000038015103,"teacher_disagreement_score":0.9422504,"about_ca_system_score_codex":0.0002507028,"about_ca_system_score_gemma":0.00013376438,"threshold_uncertainty_score":0.6417936},"labels":[],"label_agreement":null},{"id":"W2214231849","doi":"10.5267/j.ijiec.2015.9.004","title":"M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Job shop scheduling; Simulated annealing; Learning effect; Computer science; Mathematical optimization; Scheduling (production processes); Sequence (biology); Integer programming; Artificial intelligence; Algorithm; Mathematics; Schedule","score_opus":0.02869135250695101,"score_gpt":0.24544416302020294,"score_spread":0.21675281051325193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214231849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719077,0.00016492607,0.918635,0.000789367,0.002746843,0.000124567,0.000011651052,0.0001533985,0.00018348974],"genre_scores_gemma":[0.905623,0.000014846784,0.09330856,0.00005948411,0.0008624834,0.0000064205083,0.000022410917,0.00003696632,0.00006583432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.000033286153,0.00038221505,0.00011241853,0.00045400692,0.000142734],"domain_scores_gemma":[0.9987966,0.000186171,0.000108799264,0.00006928127,0.0006611146,0.00017807151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037999716,0.00015737169,0.00016402265,0.00028738833,0.00006234618,0.00018710105,0.00021973664,0.000075537726,0.000015860252],"category_scores_gemma":[0.00053485355,0.00012356702,0.00004006593,0.00026844183,0.000018810513,0.00022078273,0.0000308597,0.0005131305,0.000012891469],"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.000076231314,0.000010947137,0.000336055,0.000002316755,0.00018344051,0.000013847228,0.0002950466,0.9945392,0.00015092015,0.00009965374,0.000082558494,0.0042097573],"study_design_scores_gemma":[0.0012886511,0.00011197229,0.0001829845,0.00012369287,0.00004358993,0.00019371019,0.00026643445,0.9964923,0.00011794334,0.000020199866,0.0010073857,0.00015109681],"about_ca_topic_score_codex":0.000013167888,"about_ca_topic_score_gemma":0.0000015032199,"teacher_disagreement_score":0.8284322,"about_ca_system_score_codex":0.00013673566,"about_ca_system_score_gemma":0.00010568485,"threshold_uncertainty_score":0.5038917},"labels":[],"label_agreement":null},{"id":"W2231774221","doi":"10.5267/j.ijiec.2015.9.002","title":"Surface roughness evaluation of various cutting materials in hard turning of AISI H11","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Surface Polishing Techniques","field":"Engineering","cited_by":25,"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":"Surface roughness; Siege; Metallurgy; Surface finish; Die (integrated circuit); Mechanical engineering; Engineering drawing; Materials science; Engineering; Composite material; Geography","score_opus":0.07652694173634579,"score_gpt":0.3258597004251905,"score_spread":0.24933275868884475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231774221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89471936,0.0001402617,0.10273266,0.000060652616,0.0020663228,0.00012833373,0.00002858389,0.00005928769,0.00006455757],"genre_scores_gemma":[0.96194124,0.000008092638,0.03777144,0.000002445358,0.00023297318,0.000002488633,0.000012232515,0.000027629108,0.0000014480323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789053,0.0000777111,0.0010047668,0.000082147635,0.00080756383,0.00013726186],"domain_scores_gemma":[0.9979094,0.00024508566,0.00041586196,0.00009245904,0.0012735571,0.00006363567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017166369,0.00013729504,0.000335722,0.00042415306,0.000008748488,0.000036227262,0.00034721004,0.00011465744,0.000008484031],"category_scores_gemma":[0.0014682802,0.00015317085,0.00006202873,0.00028176446,0.000020322868,0.00043884505,0.000044957855,0.00031468077,4.456393e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025965768,0.000026832906,0.00059296045,0.0000103285065,0.00009057614,0.000005595781,0.0006732976,0.95991933,0.03685221,0.00020737904,0.000112222515,0.0014833034],"study_design_scores_gemma":[0.0031947503,0.000102942206,0.0014792315,0.0011381649,0.00007767559,0.00006873801,0.00026910263,0.7649301,0.22720459,0.0010413169,0.00021705136,0.00027630702],"about_ca_topic_score_codex":0.000065313725,"about_ca_topic_score_gemma":0.000002789423,"teacher_disagreement_score":0.1949892,"about_ca_system_score_codex":0.00042050047,"about_ca_system_score_gemma":0.00019269154,"threshold_uncertainty_score":0.6246126},"labels":[],"label_agreement":null},{"id":"W2233388212","doi":"10.5267/j.ijiec.2015.10.004","title":"Analysis of surface roughness and cutting force during turning of Ti6Al4V ELI in dry environment","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","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":"Surface roughness; Metallurgy; Mechanical engineering; Surface finish; Materials science; Engineering; Composite material","score_opus":0.016777873710895213,"score_gpt":0.24810574344433164,"score_spread":0.23132786973343644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233388212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7310228,0.00019646768,0.26841825,0.000019863028,0.00027163434,0.000030195606,0.000007404992,0.000011097252,0.000022275952],"genre_scores_gemma":[0.98539704,0.00005640749,0.014440982,0.0000011849907,0.00007862455,5.9988645e-7,0.000008866416,0.000012905469,0.0000033860692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990192,0.000011498462,0.0005646526,0.00006552802,0.00025536233,0.000083759805],"domain_scores_gemma":[0.99937946,0.00012994237,0.00023672244,0.00004343386,0.00015890687,0.000051557698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021157568,0.00008914713,0.00024653896,0.00048625277,0.0000107004735,0.000015491056,0.00012425194,0.0000537091,0.0000033589808],"category_scores_gemma":[0.00017504342,0.00009722379,0.000055814573,0.00033699605,0.000015211383,0.00022371029,0.000031784424,0.00018959273,1.0235086e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019370347,0.000015682768,0.008993547,0.00001348891,0.00030997628,0.0000047654207,0.0006078879,0.9874383,0.0013432781,0.00006370839,0.0000011131823,0.0011888746],"study_design_scores_gemma":[0.00093352713,0.000026870957,0.0047441404,0.00016577083,0.00009251001,0.0000071455206,0.00019105674,0.9916627,0.002039042,0.00003284588,0.000020396712,0.000084004685],"about_ca_topic_score_codex":0.0000121984285,"about_ca_topic_score_gemma":0.0000012796993,"teacher_disagreement_score":0.25437424,"about_ca_system_score_codex":0.00010830387,"about_ca_system_score_gemma":0.000029315926,"threshold_uncertainty_score":0.39646712},"labels":[],"label_agreement":null},{"id":"W2254843561","doi":"10.5267/j.ijiec.2015.11.003","title":"Meta-hierarchical-heuristic-mathematical- model of loading problems in flexible manufacturing system for development of an intelligent approach","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Engineering Technology and Methodologies","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":"Heuristic; Meta heuristic; Development (topology); Computer science; Metamodeling; Engineering; Mathematical optimization; Industrial engineering; Manufacturing engineering; Artificial intelligence; Mathematics; Algorithm; Software engineering","score_opus":0.2788035469193164,"score_gpt":0.3294782138593703,"score_spread":0.0506746669400539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254843561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15933733,0.00009798324,0.8397993,0.000012910336,0.00043183603,0.00016034895,0.00001230009,0.00008974143,0.000058290618],"genre_scores_gemma":[0.60261,0.0000025280947,0.39729553,5.3573444e-7,0.000050131915,0.000017690423,0.0000054033458,0.000015859405,0.0000023203063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841326,0.000023228095,0.0010349235,0.000095235,0.00028078622,0.00015258536],"domain_scores_gemma":[0.99906945,0.00028793482,0.00020642787,0.000099524405,0.00025630987,0.000080378224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010847629,0.00015515753,0.0004842387,0.00068810105,0.000012107457,0.000014646766,0.00040628703,0.00014656641,9.553418e-7],"category_scores_gemma":[0.00041899836,0.00014322596,0.000118491946,0.00013319633,0.000026027663,0.00014785367,0.00004319904,0.00032698378,2.6713434e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021084257,0.00006426852,0.0000050674057,0.00015876254,0.00071929756,0.0000016352589,0.00068471435,0.98947716,0.0020313093,0.0040758415,0.0000075052244,0.00275335],"study_design_scores_gemma":[0.00065498136,0.00005265487,0.000007204012,0.00025294218,0.000106141226,0.000031286218,0.00016218476,0.9013133,0.09548421,0.0017820994,0.000039900522,0.00011309461],"about_ca_topic_score_codex":0.0000017249428,"about_ca_topic_score_gemma":3.2743685e-7,"teacher_disagreement_score":0.44327268,"about_ca_system_score_codex":0.00019003585,"about_ca_system_score_gemma":0.00010896651,"threshold_uncertainty_score":0.5840585},"labels":[],"label_agreement":null},{"id":"W2297558499","doi":"","title":"Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighte","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"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":"Job shop; Scheduling (production processes); Production (economics); Computer science; Job shop scheduling; Operations research; Operations management; Flow shop scheduling; Manufacturing engineering; Industrial engineering; Engineering; Economics; Microeconomics; Schedule","score_opus":0.027735369555964774,"score_gpt":0.23720485666102678,"score_spread":0.209469487105062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297558499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36803705,0.000066855384,0.6302381,0.00067859754,0.0006820915,0.00021305014,0.0000047634403,0.0000665941,0.000012895794],"genre_scores_gemma":[0.7865836,0.000019962197,0.21281447,0.00002052484,0.00047684892,0.0000221057,0.000005903335,0.00003666189,0.000019924571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.000039612583,0.0003782963,0.00018376012,0.00033849015,0.00015868562],"domain_scores_gemma":[0.99890286,0.00015333394,0.00015228392,0.00010168503,0.0005536426,0.00013617282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037762098,0.00018740587,0.0001998817,0.00028529376,0.000111502595,0.00021419236,0.00019043185,0.000059767128,0.0000035529442],"category_scores_gemma":[0.00017822115,0.000119062155,0.000018240773,0.00027657847,0.000025457133,0.00056211813,0.000028069144,0.00024175116,0.000002013147],"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.00006967935,0.000011697917,0.00012819025,0.000009300253,0.00013472945,0.0000060836637,0.00082124124,0.98815626,0.005685074,0.00089580216,0.000026480133,0.004055463],"study_design_scores_gemma":[0.0014139969,0.00031284755,0.000072353454,0.0014060002,0.000050067774,0.0003316544,0.001055266,0.9895742,0.005322098,0.00004031467,0.0001609656,0.00026023883],"about_ca_topic_score_codex":0.0000126335835,"about_ca_topic_score_gemma":0.000011527761,"teacher_disagreement_score":0.41854656,"about_ca_system_score_codex":0.00013015239,"about_ca_system_score_gemma":0.00006885346,"threshold_uncertainty_score":0.4855214},"labels":[],"label_agreement":null},{"id":"W2315705625","doi":"10.5267/j.ijiec.2011.10.002","title":"A note on models for a family of products with shelf life, and production and shortage costs in emerging markets (Short Communication)","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Global trade and economics","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Economic shortage; Production (economics); Business; Emerging markets; Shelf life; Natural resource economics; Environmental economics; Economics; Operations management; Industrial organization; Microeconomics; Engineering; Finance","score_opus":0.09006714294370444,"score_gpt":0.23950649930652637,"score_spread":0.14943935636282193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315705625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97922283,0.00029385244,0.018426504,0.00085972744,0.0004911262,0.00021916995,0.00004478373,0.000006442665,0.00043558757],"genre_scores_gemma":[0.9888417,0.00015145386,0.010852095,0.000024249457,0.00010417726,0.0000066114817,0.0000054002394,0.000010089555,0.000004216335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923456,0.000006373123,0.00052119745,0.00011920212,0.000040571904,0.000078117526],"domain_scores_gemma":[0.99944013,0.00006810874,0.00024046696,0.00007299854,0.00013544754,0.000042821343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003576811,0.00007850919,0.00019730424,0.00035458166,0.000020674746,0.000025191248,0.0001279909,0.00004629892,0.000001703075],"category_scores_gemma":[0.00027218967,0.00008606587,0.00002623111,0.000099497986,0.000024140323,0.00030268106,0.000021051175,0.00014482811,2.7715794e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009493581,0.00039995232,0.042167258,0.00004909442,0.0005433357,0.000008787375,0.002598404,0.8052848,0.000101816346,0.13775146,0.000324313,0.009821401],"study_design_scores_gemma":[0.007358575,0.0011571287,0.2389913,0.0016381303,0.00007781264,0.00020466848,0.0008120057,0.7265262,0.0007778605,0.019095544,0.002426544,0.00093419844],"about_ca_topic_score_codex":0.0000404049,"about_ca_topic_score_gemma":0.000008115625,"teacher_disagreement_score":0.19682404,"about_ca_system_score_codex":0.000073945004,"about_ca_system_score_gemma":0.00003529048,"threshold_uncertainty_score":0.35096642},"labels":[],"label_agreement":null},{"id":"W2413168774","doi":"10.5267/j.ijiec.2016.2.003","title":"Multi-item economic production quantity model for imperfect items with multiple production setups and rework under the effect of preservation technology and learning environment","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":29,"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":"Rework; Production (economics); Imperfect; Production model; Economic production quantity; Computer science; Manufacturing engineering; Industrial engineering; Operations management; Reliability engineering; Process engineering; Engineering; Economics; Microeconomics","score_opus":0.024299627604848256,"score_gpt":0.22550158288743388,"score_spread":0.20120195528258564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413168774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8348636,0.000029293698,0.1614949,0.0026979959,0.00058625644,0.00030709087,0.0000018076943,0.000017107039,0.0000019502784],"genre_scores_gemma":[0.9982483,0.000015446942,0.00094284123,0.0000088318775,0.0007053301,0.000020319161,0.0000047195713,0.000011836058,0.000042423355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993996,0.000014138614,0.00025804018,0.00012344583,0.00013007858,0.000074693504],"domain_scores_gemma":[0.99933594,0.00018174679,0.00031562598,0.000056472698,0.00010243001,0.000007787787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005371489,0.00009025228,0.0001181933,0.0003486177,0.00007922611,0.00005092633,0.00010109768,0.000044971817,0.0000021429116],"category_scores_gemma":[0.00045624055,0.000056811135,0.00003062157,0.00007951529,0.000047060763,0.00058227294,0.000051077943,0.00012465539,5.64459e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014908252,0.000017675802,0.028359232,0.00002345602,0.00013386914,3.3907415e-7,0.000034320827,0.96291804,0.0026018263,0.0009486375,0.00010838106,0.0047051194],"study_design_scores_gemma":[0.0019483934,0.00013822714,0.004201574,0.00022124912,0.000073888725,0.000014201571,0.00009035809,0.9907337,0.0010617443,0.00016473798,0.001251663,0.00010028242],"about_ca_topic_score_codex":0.00001801534,"about_ca_topic_score_gemma":0.000006701969,"teacher_disagreement_score":0.16338466,"about_ca_system_score_codex":0.000076986995,"about_ca_system_score_gemma":0.0000122139945,"threshold_uncertainty_score":0.23166908},"labels":[],"label_agreement":null},{"id":"W2415635022","doi":"10.5267/j.ijiec.2016.2.004","title":"A hybrid algorithm for unrelated parallel machines scheduling","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Tardiness; Simulated annealing; Mathematical optimization; Job shop scheduling; Genetic algorithm; Computer science; Scheduling (production processes); Hybrid algorithm (constraint satisfaction); Algorithm; Due date; Mathematics; Schedule","score_opus":0.021446033199704947,"score_gpt":0.2565881444881143,"score_spread":0.23514211128840934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415635022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012219761,0.00012601372,0.9815621,0.00059191964,0.0051445346,0.00010351078,0.00006568891,0.00016075619,0.00002575442],"genre_scores_gemma":[0.277395,0.00005951978,0.7200668,0.00003056916,0.002304805,0.000012718174,0.000026172,0.000059407506,0.000045044144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988719,0.000012053416,0.0005708371,0.0000959712,0.0002815556,0.00016763886],"domain_scores_gemma":[0.998746,0.00038753173,0.00013922993,0.00006673429,0.00055245275,0.00010809831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022540866,0.00015401862,0.00019601575,0.00038940398,0.000036250327,0.0000726505,0.00029722395,0.00008568676,0.000028790339],"category_scores_gemma":[0.00037731044,0.00012470609,0.00015023783,0.0001236387,0.000016509135,0.00025590058,0.00001787804,0.00020083385,0.0000075053695],"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.000011789825,0.000017509383,0.000023192346,0.000001942767,0.00025176085,0.000011190845,0.000027139695,0.86051834,0.00026208608,0.00027204253,0.00030588015,0.13829713],"study_design_scores_gemma":[0.002540166,0.00004639954,0.000023810855,0.00020488776,0.000029412276,0.00013084807,0.0000094647785,0.99436617,0.0007268831,0.0003053386,0.0014539241,0.00016270757],"about_ca_topic_score_codex":0.0000015143007,"about_ca_topic_score_gemma":1.2091704e-7,"teacher_disagreement_score":0.26517525,"about_ca_system_score_codex":0.00013951086,"about_ca_system_score_gemma":0.00006623013,"threshold_uncertainty_score":0.5085367},"labels":[],"label_agreement":null},{"id":"W2419593711","doi":"10.5267/j.ijiec.2016.5.001","title":"Buffer clustering policy for sequential production lines with deterministic processing times","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"Buffer (optical fiber); Cluster analysis; Production (economics); Computer science; Production line; Engineering; Economics; Artificial intelligence; Microeconomics","score_opus":0.0223025067243894,"score_gpt":0.2737521965807724,"score_spread":0.251449689856383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419593711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036020715,0.00002796054,0.96052164,0.00092801504,0.0021345438,0.00017179357,0.00001637455,0.00013466565,0.00004428207],"genre_scores_gemma":[0.96709704,0.0000100991465,0.02856557,0.000009724838,0.0041964212,0.000013410306,0.000013748721,0.00004901002,0.000044955665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898505,0.000009872292,0.0004640402,0.00010892683,0.00027114595,0.00016096441],"domain_scores_gemma":[0.99890774,0.0001317132,0.00018026463,0.00006458799,0.0006501554,0.00006555787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015255499,0.00015246891,0.00017890183,0.0004515045,0.000043309614,0.00008581473,0.00019550478,0.00007608987,0.000004559426],"category_scores_gemma":[0.00052050035,0.000115928546,0.00006382632,0.00018222517,0.000019866735,0.0004242474,0.000018037987,0.00012306168,0.000001598761],"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.00005856365,0.00001576032,0.00009856085,0.000017551096,0.000114851704,0.000005892618,0.000090845744,0.9673062,0.008538677,0.00010736474,0.0001553496,0.023490356],"study_design_scores_gemma":[0.0023108074,0.00017504471,0.00026362226,0.0011247761,0.000072318784,0.0004048033,0.000027463804,0.98765755,0.0054613366,0.00012072059,0.002081074,0.0003005076],"about_ca_topic_score_codex":0.0000024149688,"about_ca_topic_score_gemma":0.0000024637457,"teacher_disagreement_score":0.93195605,"about_ca_system_score_codex":0.00026438996,"about_ca_system_score_gemma":0.00018539478,"threshold_uncertainty_score":0.47274292},"labels":[],"label_agreement":null},{"id":"W2551080769","doi":"10.5267/j.ijiec.2016.11.002","title":"Comments on “A note on multi-objective improved teaching-learning based optimization algorithm (MO-ITLBO)”","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Optimization algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.019908308112149244,"score_gpt":0.2859615023326546,"score_spread":0.2660531942205054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551080769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020275987,0.000004832842,0.9946507,0.0017042813,0.0029900118,0.00021595207,0.000024321445,0.0001492754,0.00005781773],"genre_scores_gemma":[0.21029507,0.0000064404758,0.78854495,0.00030764635,0.0007056625,0.000012652904,0.00001329087,0.00004241556,0.00007185517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978723,0.00016955912,0.0006727462,0.00032950536,0.00070382276,0.0002520633],"domain_scores_gemma":[0.99691296,0.0011057525,0.0006569385,0.00016899155,0.0009885045,0.00016687738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048395488,0.00027456775,0.00026768373,0.0008718377,0.00015837041,0.00018493325,0.00086067314,0.00013988037,0.000013823709],"category_scores_gemma":[0.001910367,0.0002263762,0.00016282746,0.00030426562,0.00003177403,0.0007670604,0.0001041252,0.0007577509,0.000014406121],"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.00004507327,0.00022305475,0.000023007822,7.2014916e-7,0.000096335905,0.000019710182,0.00011347784,0.8883471,0.00026372235,0.00060665637,0.000054142787,0.110207036],"study_design_scores_gemma":[0.0050140424,0.00046849542,0.00011360168,0.0003015621,0.00001130341,0.000031183088,0.000014191302,0.99174464,0.001246027,0.000046294714,0.0007647029,0.00024396855],"about_ca_topic_score_codex":0.000007302473,"about_ca_topic_score_gemma":2.798233e-7,"teacher_disagreement_score":0.21009232,"about_ca_system_score_codex":0.00077641674,"about_ca_system_score_gemma":0.00018724248,"threshold_uncertainty_score":0.9231354},"labels":[],"label_agreement":null},{"id":"W2551278857","doi":"10.5267/j.ijiec.2016.11.001","title":"An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"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; Heuristic; Computer science; Location-allocation; Operations research; Mathematics","score_opus":0.030409962314109914,"score_gpt":0.27314246992123786,"score_spread":0.24273250760712795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551278857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004534056,0.0000582918,0.9860659,0.0072542904,0.0016565543,0.00031775664,0.000019750947,0.000075184005,0.000018170307],"genre_scores_gemma":[0.97957164,0.000011411795,0.018968605,0.00009318183,0.001245578,0.000037282243,0.000011729715,0.000016465594,0.00004410638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984842,0.00005771044,0.00054263574,0.00020069725,0.00047154372,0.00024322573],"domain_scores_gemma":[0.9967741,0.0010818864,0.00027868518,0.00019203774,0.0015579066,0.00011539184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244593,0.00014068204,0.0001514059,0.00023276806,0.00019932185,0.00024764222,0.00091042643,0.00008543331,0.0000068467257],"category_scores_gemma":[0.00032054857,0.00009866935,0.00010108373,0.0003106503,0.000029066954,0.0008747018,0.00005939623,0.00024530725,0.000006697303],"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.000045057754,0.00011226221,0.00013698296,0.0000017961108,0.00012303963,0.000002150418,0.00022437843,0.8158987,0.0003491929,0.13813984,0.00036113703,0.04460544],"study_design_scores_gemma":[0.0021110189,0.00022676798,0.0006477833,0.00018553702,0.000027381484,0.000038577728,0.00010678368,0.99351513,0.000097903816,0.0020726463,0.0008341481,0.00013632818],"about_ca_topic_score_codex":0.00001000052,"about_ca_topic_score_gemma":0.000008754042,"teacher_disagreement_score":0.9750376,"about_ca_system_score_codex":0.00021985323,"about_ca_system_score_gemma":0.0003624213,"threshold_uncertainty_score":0.40236193},"labels":[],"label_agreement":null},{"id":"W2552106277","doi":"10.5267/j.ijiec.2016.9.003","title":"A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":24,"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":"Sizing; Mixing (physics); Mathematical optimization; Product (mathematics); Computer science; Engineering; Mathematics; Physics; Chemistry","score_opus":0.04302502552774477,"score_gpt":0.2458466746777528,"score_spread":0.20282164915000805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552106277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147595545,0.000136928,0.97673243,0.0073290174,0.0006722471,0.00027797229,0.000005397673,0.000028123804,0.000058353664],"genre_scores_gemma":[0.99458516,0.0000066977523,0.0034615896,0.00017249143,0.0016631548,0.000019029443,0.0000022947193,0.000019533727,0.00007007271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991176,0.0000040954164,0.0003831027,0.000105944906,0.00025681322,0.00013242837],"domain_scores_gemma":[0.99903125,0.0003935584,0.00023283227,0.000056224206,0.0002689512,0.000017186394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045963158,0.0001083893,0.00013127868,0.00019902879,0.00008351077,0.00022242918,0.00021600138,0.000028331828,0.000013342943],"category_scores_gemma":[0.00058354717,0.000069662856,0.0000637991,0.00007637573,0.000032018845,0.00049535057,0.00008286763,0.000102964594,0.0000026984187],"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.00005818073,0.000060580784,0.00013600112,0.00004391052,0.00035837767,0.0000045406314,0.00014236891,0.93583065,0.0015261999,0.031452637,0.009777937,0.020608598],"study_design_scores_gemma":[0.001327707,0.0000107734295,0.000015847223,0.00040333337,0.00006959026,0.000021372225,0.00006572895,0.98947644,0.000055042077,0.004484547,0.003957945,0.00011166149],"about_ca_topic_score_codex":0.0000044651597,"about_ca_topic_score_gemma":7.666878e-7,"teacher_disagreement_score":0.97982556,"about_ca_system_score_codex":0.00005291474,"about_ca_system_score_gemma":0.000027581988,"threshold_uncertainty_score":0.28407687},"labels":[],"label_agreement":null},{"id":"W2552199749","doi":"10.5267/j.ijiec.2016.9.002","title":"Comparison of optimization techniques for MRR and surface roughness in wire EDM process for gear cutting","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Machining and Optimization Techniques","field":"Engineering","cited_by":14,"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":"Surface roughness; Process (computing); Mechanical engineering; Surface finish; Engineering drawing; Engineering; Manufacturing engineering; Materials science; Computer science; Composite material","score_opus":0.03076498141360536,"score_gpt":0.3331648657013378,"score_spread":0.30239988428773246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552199749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038931355,0.00006923349,0.9600549,0.00017850212,0.0003997067,0.00022994346,0.000030309084,0.000090675174,0.000015382695],"genre_scores_gemma":[0.822532,0.00002986541,0.17721444,0.0000032331704,0.00017017355,0.000014657134,0.00000898583,0.000023181523,0.0000034367688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910915,0.00000842103,0.0005668929,0.000077571895,0.00013897281,0.00009898401],"domain_scores_gemma":[0.99883974,0.000406751,0.00021592094,0.00003826531,0.00046581423,0.000033495166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021936552,0.0001019931,0.00022112051,0.0002569671,0.000021147249,0.000021584505,0.00014371375,0.0000884532,0.0000016846689],"category_scores_gemma":[0.0004176866,0.0000916355,0.00004711489,0.00011664635,0.000017387458,0.00027810177,0.000011956619,0.00010742424,2.9711272e-8],"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.00003675304,0.00002253341,0.0006493456,0.000025790867,0.00003824734,3.677418e-7,0.00015889804,0.98293877,0.0011238288,0.0003631504,0.000054373173,0.014587936],"study_design_scores_gemma":[0.0011028657,0.00010200248,0.000029850684,0.0005943819,0.000013752974,0.0000071312543,0.00006167228,0.9704348,0.026935162,0.0003227457,0.00027935512,0.00011626998],"about_ca_topic_score_codex":0.0000012684084,"about_ca_topic_score_gemma":3.9808526e-7,"teacher_disagreement_score":0.7836007,"about_ca_system_score_codex":0.0000818813,"about_ca_system_score_gemma":0.00003696097,"threshold_uncertainty_score":0.3736787},"labels":[],"label_agreement":null},{"id":"W2556437849","doi":"10.5267/j.ijiec.2016.10.001","title":"Green open location-routing problem considering economic and environmental costs","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":27,"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":"Universidad Tecnológica de Pereira; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Routing (electronic design automation); Computer science; Mathematical optimization; Environmental economics; Natural resource economics; Business; Economics; Environmental science; Computer network; Mathematics","score_opus":0.029644109991011264,"score_gpt":0.2704808512720371,"score_spread":0.2408367412810258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556437849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2751777,0.000109009954,0.71979135,0.0017451389,0.0024015529,0.00028207345,0.000062216895,0.00012888537,0.0003020619],"genre_scores_gemma":[0.95994896,0.000035904595,0.039428476,0.000018010194,0.0005012367,0.00000450439,0.0000061864625,0.000032965025,0.000023733766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990253,0.000032152617,0.0005204027,0.00011033093,0.00017461443,0.00013723571],"domain_scores_gemma":[0.99917996,0.00038936734,0.00018338213,0.00007246442,0.000072503084,0.00010229728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041105782,0.00013397775,0.0001872269,0.0002309322,0.000041908046,0.00014523092,0.0003605361,0.000075742995,0.000032726224],"category_scores_gemma":[0.00013224139,0.0001228669,0.000039383172,0.000057915197,0.00002991353,0.0005254354,0.00011394375,0.00017278633,0.000007065967],"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.000009966119,0.000010423814,0.0017868272,0.0000031172474,0.00017913239,0.000009284983,0.00010366444,0.9352859,0.0020681068,0.0008612682,0.00022124175,0.059461042],"study_design_scores_gemma":[0.0047721476,0.00008829533,0.0016921012,0.0008542522,0.000056254376,0.00060257455,0.00016314411,0.9801846,0.0051132105,0.00031644187,0.0056521595,0.0005048315],"about_ca_topic_score_codex":0.000019133675,"about_ca_topic_score_gemma":0.0000023842051,"teacher_disagreement_score":0.6847713,"about_ca_system_score_codex":0.00048367507,"about_ca_system_score_gemma":0.00007680706,"threshold_uncertainty_score":0.50103664},"labels":[],"label_agreement":null},{"id":"W2574022949","doi":"10.5267/j.ijiec.2017.1.002","title":"Performance analysis and optimization for CSDGB filling system of a beverage plant using particle swarm optimization","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":26,"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":"Particle swarm optimization; Multi-swarm optimization; System optimization; Metaheuristic; Engineering; Computer science; Process engineering; Mathematics; Mathematical optimization","score_opus":0.03270159134072847,"score_gpt":0.2566373087910626,"score_spread":0.22393571745033414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574022949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16270474,0.00002427238,0.8363281,0.000017494494,0.0007532618,0.000082978855,0.000048628834,0.00003157606,0.000008953426],"genre_scores_gemma":[0.80234563,0.000038653707,0.19736293,0.0000011458106,0.00020399665,0.0000023471316,0.000029920362,0.0000140891025,0.0000013064581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916303,0.000007758946,0.00046804515,0.000079930745,0.00017990026,0.00010133901],"domain_scores_gemma":[0.9990222,0.00011461466,0.00037198944,0.000092658905,0.00034699007,0.00005156437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018014922,0.000104784405,0.00021643906,0.000293615,0.000109598295,0.000100808604,0.00018414031,0.00006909999,0.0000025689517],"category_scores_gemma":[0.00020632111,0.000111144785,0.00007492991,0.000097767916,0.000021536414,0.00035679407,0.00002332897,0.00010765637,5.7658173e-8],"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.0000285032,0.000010739328,0.00054145994,0.000030768668,0.00039024887,0.00000208277,0.000072676725,0.99796367,0.0000901156,0.0001241063,0.0000032422408,0.0007423783],"study_design_scores_gemma":[0.0007667531,0.000033680386,0.00025714637,0.00015579564,0.00018675865,0.000018472594,0.000028269576,0.99598813,0.0024547132,0.0000044852923,0.000007906337,0.00009787675],"about_ca_topic_score_codex":0.000008743462,"about_ca_topic_score_gemma":5.557622e-7,"teacher_disagreement_score":0.63964087,"about_ca_system_score_codex":0.000108778855,"about_ca_system_score_gemma":0.000026479618,"threshold_uncertainty_score":0.4532353},"labels":[],"label_agreement":null},{"id":"W2591585664","doi":"10.5267/j.ijiec.2017.3.005","title":"Heterogeneous workers with learning ability assignment in a cellular manufacturing system","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":14,"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":"Cellular manufacturing; Computer science; Manufacturing engineering; Biochemical engineering; Engineering","score_opus":0.017941796179355218,"score_gpt":0.2320141976009827,"score_spread":0.2140724014216275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591585664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3183665,0.000025775296,0.67987317,0.000053256295,0.001385606,0.00008031247,0.0000033111983,0.00007823944,0.00013380982],"genre_scores_gemma":[0.9931593,0.0000068708105,0.0064359196,0.0000015016112,0.00035537922,0.0000042533143,0.0000054818306,0.000025107958,0.0000061831392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990351,0.000017485037,0.0004044689,0.00009998216,0.00029099899,0.00015194726],"domain_scores_gemma":[0.9993772,0.00009731368,0.00022694284,0.00012267042,0.000105430525,0.00007045789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002030624,0.00014115155,0.00018806345,0.00023592672,0.00008191689,0.00016761602,0.00033673455,0.00007650255,0.000004433463],"category_scores_gemma":[0.00011847254,0.00013523719,0.000055369637,0.00003271216,0.000023831579,0.000238346,0.000034355828,0.0004603031,0.0000016867298],"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.000029616935,0.000014606828,0.0013134021,0.000012218757,0.00010076466,0.00013184725,0.000071062444,0.99498445,0.00012040319,0.000052432748,0.000007079891,0.003162113],"study_design_scores_gemma":[0.002097722,0.00009900484,0.002860312,0.00069942273,0.00003225827,0.00015336984,0.00013182231,0.982201,0.010954798,0.0000505447,0.00043320452,0.0002865532],"about_ca_topic_score_codex":0.0000207108,"about_ca_topic_score_gemma":0.00000332618,"teacher_disagreement_score":0.6747928,"about_ca_system_score_codex":0.00043440837,"about_ca_system_score_gemma":0.00003874658,"threshold_uncertainty_score":0.55148125},"labels":[],"label_agreement":null},{"id":"W2617172242","doi":"10.5267/j.ijiec.2017.4.003","title":"Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":45,"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":"Khon Kaen University","keywords":"Genetic algorithm; Computer science; Mathematical optimization; Hybrid algorithm (constraint satisfaction); Routing (electronic design automation); Mathematics; Stochastic programming; Computer network; Constraint programming","score_opus":0.03138886939449034,"score_gpt":0.2702509467311442,"score_spread":0.23886207733665385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617172242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19799095,0.00002963617,0.79880697,0.00032665645,0.0023859313,0.00038542657,0.00000935161,0.000040788404,0.000024280389],"genre_scores_gemma":[0.95218164,0.0000041339827,0.04530114,0.000037923983,0.002403382,0.000016854532,0.000020371357,0.000023586312,0.000010970354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872214,0.00000867742,0.0005793088,0.00018579047,0.00030503204,0.00019903625],"domain_scores_gemma":[0.99823165,0.000052171123,0.00052212994,0.000107543245,0.0010568638,0.000029623805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044352037,0.00016744673,0.00019456625,0.00040493245,0.00038434274,0.000837524,0.00032652135,0.000039743612,0.0000039240094],"category_scores_gemma":[0.00066324696,0.00017933283,0.000096701166,0.0000969492,0.00003872402,0.0011514399,0.00015527046,0.00020100402,0.000002229816],"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.00003079698,0.00010995808,0.002995865,0.00005142809,0.0002753614,0.000012601815,0.00010895933,0.8522228,0.00015790173,0.0008478559,0.000112238755,0.14307421],"study_design_scores_gemma":[0.0017541106,0.000026483704,0.0024286301,0.00024528702,0.000088617955,0.00004290184,0.00013276328,0.9937912,0.000060755265,0.00018629151,0.0010592296,0.0001836876],"about_ca_topic_score_codex":0.00046433142,"about_ca_topic_score_gemma":0.000022081495,"teacher_disagreement_score":0.7541907,"about_ca_system_score_codex":0.00015080729,"about_ca_system_score_gemma":0.00007625316,"threshold_uncertainty_score":0.80762637},"labels":[],"label_agreement":null},{"id":"W2618435777","doi":"10.5267/j.ijiec.2017.5.003","title":"An overview on robust design hybrid metamodeling: Advanced methodology in process optimization under uncertainty","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":57,"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":"Metamodeling; Robust optimization; Computer science; Context (archaeology); Probabilistic logic; Taguchi methods; Process (computing); Engineering optimization; Engineering design process; Mathematical optimization; Industrial engineering; Optimization problem; Management science; Engineering; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.24396224974893743,"score_gpt":0.40273723422049573,"score_spread":0.1587749844715583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618435777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026579935,0.000054348155,0.9937932,0.0009737632,0.0022372203,0.00020529756,0.0000062807417,0.000053179116,0.000018732666],"genre_scores_gemma":[0.3230501,0.000044556877,0.67653143,0.00008608026,0.00024839627,0.00000946443,0.000007945513,0.000018261559,0.0000037328793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998112,0.00019648681,0.0006809203,0.00029423786,0.000514945,0.00020140808],"domain_scores_gemma":[0.9971249,0.00053010037,0.0007800043,0.00032698194,0.0011163966,0.00012162877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008971613,0.00020172665,0.00031987127,0.0006429392,0.00013762804,0.00033361994,0.0016605627,0.00009126648,0.000008952243],"category_scores_gemma":[0.0016158163,0.00020304503,0.00008873296,0.0002144393,0.00003561699,0.0018786619,0.00008713044,0.00046526483,0.0000016280442],"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.000057765097,0.00011984086,0.000016579917,0.0000017706158,0.00006664949,0.000038849015,0.00012484066,0.9821305,0.000054647502,0.0031311421,0.00000617413,0.014251187],"study_design_scores_gemma":[0.002045341,0.00016855967,0.000113729824,0.00014978358,0.000010920736,0.00007948564,0.000035494017,0.9948051,0.00054913433,0.0018359962,0.000020843863,0.00018560953],"about_ca_topic_score_codex":0.000012613096,"about_ca_topic_score_gemma":0.0000017838978,"teacher_disagreement_score":0.3203921,"about_ca_system_score_codex":0.00032583036,"about_ca_system_score_gemma":0.0002975121,"threshold_uncertainty_score":0.82799363},"labels":[],"label_agreement":null},{"id":"W2618548267","doi":"10.5267/j.ijiec.2017.4.004","title":"Modelling and analysis of tool wear and surface roughness in hard turning of AISI D2 steel using response surface methodology","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","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":"Cooperative Research Facility Center, Toyohashi University of Technology; National Institute of Technology Srinagar","keywords":"Surface roughness; Response surface methodology; Metallurgy; Materials science; Surface (topology); Surface finish; Tool wear; Tool steel; Mechanical engineering; Engineering; Composite material; Mathematics; Machining; Statistics; Geometry","score_opus":0.08965173629967446,"score_gpt":0.33443333782079404,"score_spread":0.24478160152111958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618548267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54160225,0.00012280334,0.45797956,0.000029191087,0.00022292249,0.000024623614,0.000011112957,0.0000056548574,0.0000018679124],"genre_scores_gemma":[0.8464193,0.0000727438,0.15344964,0.0000011887182,0.000039890485,1.8731843e-7,0.0000028873862,0.000012331221,0.000001850022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990383,0.000048387268,0.0005542816,0.000088699606,0.00017956262,0.00009081929],"domain_scores_gemma":[0.99860334,0.00063813827,0.00038056093,0.00007976262,0.00026325148,0.000034955774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006910478,0.000103034494,0.00035304888,0.000403561,0.000038217204,0.000051514697,0.00017612665,0.000084891944,0.0000018182734],"category_scores_gemma":[0.00058790646,0.000112217844,0.000056409237,0.0001921546,0.000035090645,0.00035678755,0.00004727897,0.00023760601,1.557828e-8],"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.00013181582,0.000008493566,0.002886727,0.000014760031,0.0003838488,0.000005553008,0.00065856276,0.9851838,0.010065444,0.00013589393,4.0668579e-7,0.0005247407],"study_design_scores_gemma":[0.00072307454,0.000027261238,0.0022618212,0.00019295578,0.0001303286,0.0000141214605,0.000106155785,0.9943343,0.0020677254,0.00004350612,0.000010121417,0.0000886452],"about_ca_topic_score_codex":0.000041699946,"about_ca_topic_score_gemma":0.0000021061078,"teacher_disagreement_score":0.30481702,"about_ca_system_score_codex":0.000054555578,"about_ca_system_score_gemma":0.000045445806,"threshold_uncertainty_score":0.45761108},"labels":[],"label_agreement":null},{"id":"W2738321081","doi":"10.5267/j.ijiec.2017.5.004","title":"Dynamic capacitated maximal covering location problem by considering dynamic capacity","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Mathematical optimization; Dynamic programming; Dynamic positioning; Mathematics; Computer science; Engineering; Marine engineering","score_opus":0.03426209804656438,"score_gpt":0.2505338671746325,"score_spread":0.21627176912806811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738321081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7508609,0.000065691114,0.23476316,0.006373049,0.006583085,0.0003266682,0.000028837943,0.00012888927,0.0008696909],"genre_scores_gemma":[0.9969835,0.000012803379,0.0023607176,0.00011500163,0.00038748316,0.0000067632404,0.00004656812,0.000021836384,0.00006531291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984708,0.000008675525,0.0006607236,0.00016957721,0.0004958303,0.00019440033],"domain_scores_gemma":[0.99832135,0.00003759838,0.0005161562,0.00018493725,0.0009083983,0.000031550735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004222334,0.00018085816,0.00020635832,0.00042033923,0.000246668,0.0007023406,0.0006625348,0.000081038976,0.000066189124],"category_scores_gemma":[0.00069499994,0.00019727326,0.000101494436,0.0001546407,0.000057668065,0.0016438535,0.00013562129,0.00032209067,0.00004259181],"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.00004813567,0.00011990575,0.0013702681,0.000051393465,0.00032210973,0.000019071664,0.000101099904,0.97997785,0.0019302574,0.0042291046,0.0025513652,0.009279437],"study_design_scores_gemma":[0.0019387745,0.000023771574,0.0054468117,0.00039329784,0.00007526176,0.000028539866,0.00012671156,0.971374,0.000092398455,0.0008816138,0.019267278,0.00035158728],"about_ca_topic_score_codex":0.0005576511,"about_ca_topic_score_gemma":0.00009214934,"teacher_disagreement_score":0.24612258,"about_ca_system_score_codex":0.00024301429,"about_ca_system_score_gemma":0.000059880243,"threshold_uncertainty_score":0.804457},"labels":[],"label_agreement":null},{"id":"W2739349198","doi":"10.5267/j.ijiec.2017.6.002","title":"Parameters optimization of fabric finishing system of a textile industry using teaching–learning-based optimization algorithm","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Textile materials and evaluations","field":"Materials Science","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":"Textile; Optimization algorithm; Textile industry; Computer science; System optimization; Algorithm; Engineering; Engineering drawing; Manufacturing engineering; Mathematical optimization; Mathematics; Materials science; Composite material","score_opus":0.043755583429384654,"score_gpt":0.2995344251059588,"score_spread":0.25577884167657416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739349198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34049577,0.000009225013,0.6569903,0.000087987944,0.002200024,0.000103484614,0.000057600868,0.000024014334,0.000031638778],"genre_scores_gemma":[0.8008335,0.0000012763094,0.19877438,0.0000043508912,0.00034107862,0.0000025665802,0.000019131297,0.0000201169,0.0000035853664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783266,0.00013966019,0.001071128,0.0001464916,0.0006577243,0.00015233229],"domain_scores_gemma":[0.9963737,0.00025188108,0.0021640423,0.00018245201,0.00094718486,0.00008072333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011102785,0.00015710355,0.0003662552,0.00043199805,0.0002066946,0.00028022868,0.00064013037,0.00021289173,0.00008527948],"category_scores_gemma":[0.0017735125,0.00016095444,0.00013636255,0.000101047204,0.00007131289,0.000591204,0.0000848045,0.000433013,0.0000011694834],"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.00003294638,0.000069063746,0.00024922067,0.000019576872,0.00006631566,0.0000053293065,0.00013831256,0.9904109,0.0074669705,0.0001238422,0.000017391827,0.0014001245],"study_design_scores_gemma":[0.0011860224,0.000107210915,0.00019183532,0.00071704696,0.00008108233,0.0000411558,0.00015312924,0.9884461,0.0089228405,0.000008109773,0.00001899857,0.00012645159],"about_ca_topic_score_codex":0.00014943497,"about_ca_topic_score_gemma":4.3574767e-7,"teacher_disagreement_score":0.46033776,"about_ca_system_score_codex":0.00019493987,"about_ca_system_score_gemma":0.00032383346,"threshold_uncertainty_score":0.6563532},"labels":[],"label_agreement":null},{"id":"W2761926950","doi":"10.5267/j.ijiec.2017.7.002","title":"Optimal appointment scheduling with a stochastic server: Simulation based K-steps look-ahead selection method","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Selection (genetic algorithm); Scheduling (production processes); Computer science; Mathematical optimization; Operations research; Engineering; Mathematics; Artificial intelligence","score_opus":0.0919858346742386,"score_gpt":0.42276674632160244,"score_spread":0.33078091164736384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761926950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1399276,0.000010994504,0.8547694,0.0026395868,0.0021698747,0.0003812065,0.000015250773,0.00004920096,0.000036902424],"genre_scores_gemma":[0.78471696,0.0000016203724,0.21348688,0.00008926324,0.0015951524,0.000020157924,0.000031212196,0.000029159633,0.000029573566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778324,0.00019370459,0.00093464495,0.00019514069,0.0006327021,0.0002605751],"domain_scores_gemma":[0.9954272,0.000943112,0.0010264375,0.00018543616,0.0022441964,0.00017360941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779822,0.00018949687,0.0002939673,0.00045021472,0.0009083445,0.00019245896,0.00038177735,0.00021561282,0.00008049839],"category_scores_gemma":[0.0019100561,0.00017135465,0.00009801268,0.00015745447,0.000025838825,0.00059370056,0.000049948227,0.0009243392,0.000011791781],"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.00015033405,0.00006458852,0.0013888788,0.000013008545,0.00014348107,0.00000799574,0.00029637705,0.99422294,0.000072723546,0.0006796024,0.000032056167,0.0029279909],"study_design_scores_gemma":[0.0029072212,0.00021773214,0.0012136939,0.00072142115,0.000057855264,0.000017347178,0.00018716716,0.99412125,0.00003864234,0.000023879225,0.00033522112,0.00015857001],"about_ca_topic_score_codex":0.000115792165,"about_ca_topic_score_gemma":0.00002572761,"teacher_disagreement_score":0.6447894,"about_ca_system_score_codex":0.0005184026,"about_ca_system_score_gemma":0.0011748958,"threshold_uncertainty_score":0.69876397},"labels":[],"label_agreement":null},{"id":"W2762168899","doi":"10.5267/j.ijiec.2017.8.001","title":"A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Ant colony optimization algorithms; Scheduling (production processes); Cluster analysis; Computer science; ANT; Mathematical optimization; Operations research; Ant colony; Metaheuristic; Routing (electronic design automation); Job shop scheduling; Engineering; Computer network; Artificial intelligence; Mathematics","score_opus":0.02157573194048319,"score_gpt":0.25644686180839416,"score_spread":0.23487112986791098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762168899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024150502,0.00012319189,0.97467273,0.00006716864,0.0006932865,0.00017250274,0.000012953441,0.000047700654,0.00005998465],"genre_scores_gemma":[0.6705137,0.000041962423,0.3290974,0.000003646514,0.0003046707,0.000008469448,0.000012142741,0.00001668523,0.000001359943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923843,0.000008082383,0.00039038074,0.000105791136,0.00013490127,0.00012241548],"domain_scores_gemma":[0.9994014,0.00009995515,0.00021286804,0.00006402425,0.0001657516,0.00005598913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022933478,0.00012050568,0.00018113865,0.00020990813,0.000109129585,0.00025764908,0.000171436,0.000064987784,3.8948514e-7],"category_scores_gemma":[0.00012475163,0.00012821828,0.000027358965,0.000025005795,0.000019461071,0.00038109705,0.000048389942,0.00018167123,3.4442802e-8],"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.0000224225,0.000009977409,0.00012970522,0.000057951547,0.00005601536,0.0000066935777,0.00020657029,0.99716294,0.000058030117,0.00032196354,0.000003608239,0.0019641512],"study_design_scores_gemma":[0.0012371986,0.000025065621,0.00009769776,0.00040603685,0.000013540128,0.00008919951,0.00013466319,0.997698,0.00011721988,0.00002809854,0.00003682469,0.00011646314],"about_ca_topic_score_codex":0.000019106117,"about_ca_topic_score_gemma":0.0000013161408,"teacher_disagreement_score":0.64636314,"about_ca_system_score_codex":0.00012331926,"about_ca_system_score_gemma":0.000020344141,"threshold_uncertainty_score":0.522859},"labels":[],"label_agreement":null},{"id":"W2764221425","doi":"10.5267/j.ijiec.2017.8.005","title":"A two-agent scheduling problem in a two-machine flowshop","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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":"Job shop scheduling; Scheduling (production processes); Mathematical optimization; Computer science; Mathematics; Schedule","score_opus":0.028881694552218486,"score_gpt":0.2932678206633897,"score_spread":0.2643861261111712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764221425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26668796,0.00029360113,0.7211453,0.0011423553,0.009304117,0.00021261204,0.000027540398,0.00018242717,0.0010041186],"genre_scores_gemma":[0.8457567,0.000023088345,0.15309162,0.000015849733,0.0010582685,0.00000480053,0.000009274873,0.000029892873,0.000010454636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986743,0.000016900323,0.0006436394,0.00011049636,0.00037395195,0.0001807371],"domain_scores_gemma":[0.99910754,0.00010702575,0.00022214538,0.00015234236,0.00029992856,0.00011101953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039066703,0.00016223264,0.00022713865,0.00051467656,0.000077064076,0.00029420643,0.0006045779,0.00006199073,0.000026728696],"category_scores_gemma":[0.00043088786,0.00017140867,0.00010664616,0.00012715068,0.000021090213,0.00040815567,0.000056292585,0.00056395575,0.00000881796],"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.000014170869,0.000035704597,0.0009086083,0.0000037048137,0.00012616748,0.00006548436,0.0001539349,0.9895041,0.00021440188,0.0004942023,0.000028360375,0.008451132],"study_design_scores_gemma":[0.0030143503,0.000020304118,0.00039891043,0.00028577563,0.000016000939,0.00009683435,0.000036832454,0.995303,0.00028990387,0.00011919333,0.00025590727,0.00016298817],"about_ca_topic_score_codex":0.000047231766,"about_ca_topic_score_gemma":0.000014065633,"teacher_disagreement_score":0.5790688,"about_ca_system_score_codex":0.00020954627,"about_ca_system_score_gemma":0.00008593255,"threshold_uncertainty_score":0.69898427},"labels":[],"label_agreement":null},{"id":"W2803643688","doi":"10.5267/j.ijiec.2017.11.003","title":"Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Particle swarm optimization; Mathematical optimization; Quadratic equation; Algorithm; Swarm behaviour; Multi-swarm optimization; Metaheuristic; Mathematics; Computer science; Geometry","score_opus":0.03778892034218184,"score_gpt":0.26920484845268217,"score_spread":0.23141592811050032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803643688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005969674,0.000021477765,0.9922285,0.000051733306,0.00148014,0.00015453265,0.000016946124,0.000050170816,0.000026844284],"genre_scores_gemma":[0.5536806,0.0000050138374,0.44588444,0.0000037633909,0.00037357947,0.000008979933,0.000021845472,0.000016078366,0.0000056773956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989155,0.00000782771,0.00062638323,0.0000741333,0.00025452458,0.000121661746],"domain_scores_gemma":[0.9991205,0.00010576114,0.00019979053,0.00005494955,0.0004599306,0.00005907269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018092222,0.00011069064,0.00015751946,0.00015932099,0.00004296932,0.000037307535,0.00016857484,0.000061082705,0.0000070688397],"category_scores_gemma":[0.000120262266,0.00011092112,0.00005422311,0.000103143844,0.000023418348,0.00016754477,0.000017349628,0.00010866926,8.031799e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011439544,0.000029561366,0.0000026351067,0.000008493394,0.00014537608,6.9472463e-7,0.00034610333,0.9822054,0.0003765727,0.0002887047,0.000049782386,0.016535236],"study_design_scores_gemma":[0.00093239185,0.00007704958,0.000012662169,0.0001080162,0.00002272829,0.0000064572155,0.000031454794,0.9797615,0.018311184,0.00012479402,0.00050513254,0.00010665457],"about_ca_topic_score_codex":0.0000012423455,"about_ca_topic_score_gemma":5.7596657e-7,"teacher_disagreement_score":0.54771096,"about_ca_system_score_codex":0.00014779145,"about_ca_system_score_gemma":0.00006642473,"threshold_uncertainty_score":0.4523232},"labels":[],"label_agreement":null},{"id":"W2803652912","doi":"10.5267/j.ijiec.2017.10.001","title":"Machining performance of aluminium matrix composite and use of WPCA based Taguchi technique for multiple response optimization","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Machining and Optimization Techniques","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":"Taguchi methods; Materials science; Machining; Tungsten carbide; Surface roughness; Composite number; Silicon carbide; Aluminium; Metallurgy; Carbide; Composite material","score_opus":0.021072324195141615,"score_gpt":0.27528264529497143,"score_spread":0.25421032109982983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803652912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17971909,0.000020687616,0.81952775,0.000032626045,0.00042427087,0.00015552831,0.000056857974,0.000056734436,0.0000064646897],"genre_scores_gemma":[0.63991,0.0000102083895,0.35994127,0.000004587401,0.00009217912,0.000006398444,0.000014210205,0.000018445575,0.0000027037656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.000027119246,0.0005937165,0.00007452131,0.00018688543,0.0000905177],"domain_scores_gemma":[0.9982937,0.0006433299,0.0002898057,0.000069954476,0.00065748446,0.000045700646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033264176,0.00011636351,0.00021171768,0.0005141431,0.000034008197,0.00002640562,0.00015144046,0.000091813556,0.0000039922074],"category_scores_gemma":[0.0004833643,0.00012526555,0.000064553395,0.0001607144,0.000049312297,0.00027969922,0.000021110769,0.00016605642,7.536057e-8],"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.00041668798,0.000021516744,0.00054846855,0.000020588512,0.0000669252,7.355168e-7,0.000079455654,0.973345,0.024413459,0.000054601947,0.000054970074,0.0009775879],"study_design_scores_gemma":[0.00087720767,0.0002746903,0.00023617517,0.00031282654,0.000021238933,0.00002063002,0.0000073371402,0.89445734,0.10348888,0.000008567472,0.00020143703,0.00009366623],"about_ca_topic_score_codex":0.00000299104,"about_ca_topic_score_gemma":2.4283278e-7,"teacher_disagreement_score":0.4601909,"about_ca_system_score_codex":0.00005447345,"about_ca_system_score_gemma":0.00005297959,"threshold_uncertainty_score":0.51081806},"labels":[],"label_agreement":null},{"id":"W2804558154","doi":"10.5267/j.ijiec.2017.12.001","title":"Modelling and solving a bi-objective intermodal transport problem of agricultural products","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Urban and Freight Transport Logistics","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":"Agriculture; Business; Agricultural engineering; Computer science; Environmental economics; Transport engineering; Engineering; Mathematical optimization; Economics; Mathematics; Geography","score_opus":0.03235735448123322,"score_gpt":0.2136285733123037,"score_spread":0.18127121883107047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804558154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51207507,0.00011706836,0.48550463,0.000090235146,0.001726235,0.000102761565,0.00003010824,0.000055235476,0.00029862573],"genre_scores_gemma":[0.97837293,0.00002218114,0.020291127,0.0000037531115,0.0012735173,0.0000014759682,0.000010178866,0.000017253198,0.0000075864295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.0000068948007,0.00053367636,0.000088244684,0.00024973578,0.00012218973],"domain_scores_gemma":[0.99905,0.000060451017,0.00012388975,0.000043951604,0.00065800786,0.00006369108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001271991,0.00013161542,0.00020321702,0.0002616512,0.00002413873,0.000024345409,0.00017895916,0.00007719272,0.000006134278],"category_scores_gemma":[0.000029317906,0.00011852791,0.00006501391,0.00017962276,0.00006072166,0.00021391161,0.00001030964,0.0002807643,7.2259627e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021692102,0.0000265488,0.00030405226,0.000017561895,0.0002574634,0.000010515828,0.00085131126,0.99447507,0.0022308442,0.0008584907,0.00013724602,0.00080921757],"study_design_scores_gemma":[0.00210813,0.00035823786,0.004424194,0.0008172424,0.00015569925,0.00029077468,0.00018143925,0.97669995,0.01280532,0.00040948903,0.0013319794,0.00041751913],"about_ca_topic_score_codex":0.000013438764,"about_ca_topic_score_gemma":0.0000021634926,"teacher_disagreement_score":0.46629784,"about_ca_system_score_codex":0.00006896645,"about_ca_system_score_gemma":0.000050826144,"threshold_uncertainty_score":0.4833428},"labels":[],"label_agreement":null},{"id":"W2804797752","doi":"10.5267/j.ijiec.2017.10.002","title":"Integrated planning of electric vehicles routing and charging stations location considering transportation networks and power distribution systems","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":21,"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":"Routing (electronic design automation); Distribution (mathematics); Transport engineering; Power (physics); Vehicle routing problem; Computer science; Electric vehicle; Automotive engineering; Engineering; Computer network; Mathematics","score_opus":0.011026224531558205,"score_gpt":0.22148227064846762,"score_spread":0.2104560461169094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804797752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5829336,0.00042840512,0.41591102,0.000032507945,0.0005735105,0.000061672465,0.000017799877,0.000033999884,0.0000074636905],"genre_scores_gemma":[0.9986038,0.000043972366,0.00091668515,0.0000050080184,0.00036414585,0.000001926734,0.000046093624,0.000017467666,8.9375067e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989871,0.00001883073,0.0005717807,0.00008662527,0.00019907039,0.00013658454],"domain_scores_gemma":[0.99891144,0.00016985321,0.00021929799,0.0000388518,0.0005968624,0.00006370941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002015644,0.00012600952,0.00018720842,0.00027184447,0.000059289265,0.00008397461,0.000087763074,0.0001000212,0.0000024744747],"category_scores_gemma":[0.00012822846,0.00013029133,0.000029784782,0.00035720918,0.000030752024,0.00028801957,0.000006919087,0.0003060885,1.4553203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017754339,0.000007192995,0.0025348684,0.000011678487,0.00014763267,0.0000044253434,0.00041479472,0.9860315,0.0040929504,0.0015185422,0.00009940988,0.0051192497],"study_design_scores_gemma":[0.0006234716,0.000100369274,0.012268893,0.00041097053,0.00003786781,0.00009022237,0.00023555207,0.9843628,0.0014814802,0.000057923506,0.00020716764,0.00012328314],"about_ca_topic_score_codex":0.00002128926,"about_ca_topic_score_gemma":0.000001042519,"teacher_disagreement_score":0.4156702,"about_ca_system_score_codex":0.000102679456,"about_ca_system_score_gemma":0.000052375155,"threshold_uncertainty_score":0.5313126},"labels":[],"label_agreement":null},{"id":"W2805011532","doi":"10.5267/j.ijiec.2017.11.002","title":"Experimental investigation on hard turning using mixed ceramic insert under accelerated cooling environment","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced machining processes and optimization","field":"Engineering","cited_by":26,"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":"Kalinga Institute of Industrial Technology","keywords":"Materials science; Coolant; Machining; Tool wear; Abrasion (mechanical); Metallurgy; Insert (composites); Brittleness; Ceramic; Surface roughness; Heat generation; Chip formation; Composite material; Cutting tool; Mechanical engineering; Engineering","score_opus":0.06748438687173858,"score_gpt":0.28256221509417995,"score_spread":0.21507782822244137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805011532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.583127,0.000048936014,0.41433775,0.000059268114,0.0022661304,0.000056251185,0.000004619304,0.00006587088,0.000034155164],"genre_scores_gemma":[0.9804144,0.000011491514,0.018271541,0.000047884918,0.0011874842,0.000002202982,0.000022654063,0.00003668381,0.0000056596514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989484,0.000016723123,0.00046245658,0.00010867493,0.00032311806,0.00014064391],"domain_scores_gemma":[0.9994001,0.00008483839,0.00017381986,0.00005970461,0.00019835026,0.00008317915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114712115,0.00015962054,0.00015145872,0.00033131742,0.00007516639,0.00010334488,0.00018902241,0.00009070309,0.00005631674],"category_scores_gemma":[0.00007293793,0.00017165205,0.00005565399,0.0001629937,0.000030312687,0.0002896062,0.00002529504,0.00031978704,0.000006899461],"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.000034874163,0.000020725724,0.000044462544,0.0000022375875,0.00010137945,0.000004784904,0.00021938195,0.97072524,0.027199421,0.00016532156,0.00007393867,0.001408262],"study_design_scores_gemma":[0.00093883136,0.00011800246,0.00029120911,0.00019688734,0.000017985201,0.000048193735,0.000098353565,0.94004244,0.05764253,0.000053379594,0.00038280018,0.00016936613],"about_ca_topic_score_codex":0.000005304987,"about_ca_topic_score_gemma":2.9681158e-7,"teacher_disagreement_score":0.3972874,"about_ca_system_score_codex":0.00031821063,"about_ca_system_score_gemma":0.000057115758,"threshold_uncertainty_score":0.69997674},"labels":[],"label_agreement":null},{"id":"W2810331770","doi":"10.5267/j.ijiec.2018.5.003","title":"Developing a versatile simulation, scheduling and economic model framework for bioenergy production systems","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Biofuel production and bioconversion","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":"Biorefinery; Supply chain; Refinery; Scheduling (production processes); Bioenergy; Computer science; Engineering; Renewable energy; Biofuel; Operations management; Environmental engineering","score_opus":0.049065499743352226,"score_gpt":0.2829517126763334,"score_spread":0.23388621293298117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810331770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.129091,0.00008857134,0.8611897,0.00053810596,0.008900593,0.00010896209,0.000011767179,0.00006384906,0.00000741968],"genre_scores_gemma":[0.93626326,0.000025848602,0.05995267,0.000012569561,0.0037090236,0.0000037827167,0.000008427762,0.000017858498,0.0000065594936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992976,0.000007146128,0.00036763007,0.00010216282,0.00012655112,0.00009888277],"domain_scores_gemma":[0.9993192,0.000097652686,0.000117871445,0.000049791386,0.00036492632,0.000050536048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018635756,0.00009993578,0.00012166007,0.00028424567,0.000057294597,0.000088068,0.000114297676,0.00010509422,0.0000032623948],"category_scores_gemma":[0.00020655876,0.00010532253,0.00004328197,0.000076212316,0.000025166471,0.00025991705,0.000016979682,0.00014807595,0.0000023836699],"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.000023246717,0.0000047774724,0.00002359215,0.000014430935,0.00010620672,3.418552e-7,0.0001147572,0.9934211,0.00060501584,0.0038607523,0.00019077935,0.001635024],"study_design_scores_gemma":[0.00039844535,0.000036674017,0.0000148321615,0.00013312581,0.000016154934,0.000025870439,0.00006171768,0.99281466,0.0022794232,0.00067997706,0.0034292846,0.000109831184],"about_ca_topic_score_codex":0.000004071212,"about_ca_topic_score_gemma":3.1608255e-7,"teacher_disagreement_score":0.80717224,"about_ca_system_score_codex":0.00022963996,"about_ca_system_score_gemma":0.0000803412,"threshold_uncertainty_score":0.4294928},"labels":[],"label_agreement":null},{"id":"W2810356407","doi":"10.5267/j.ijiec.2018.5.001","title":"An integrated production-inventory model for deteriorating items to evaluate JIT purchasing alliances","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Quality and Supply Management","field":"Business, Management and Accounting","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":"Purchasing; Production (economics); Business; Integrated production; Production model; Operations management; Manufacturing engineering; Operations research; Marketing; Engineering; Economics; Microeconomics","score_opus":0.08827041447850326,"score_gpt":0.32342114896756546,"score_spread":0.2351507344890622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810356407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2511023,0.0000074195323,0.74121666,0.0028814974,0.004406272,0.00026820874,0.000006685925,0.000055311488,0.000055632478],"genre_scores_gemma":[0.9714463,8.8902163e-7,0.019428447,0.0003957618,0.008607234,0.00001694826,0.000029068877,0.000023284128,0.000052090134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986405,0.000013445417,0.00057410117,0.00017051116,0.0004326822,0.00016877803],"domain_scores_gemma":[0.9979264,0.000048968843,0.00032825014,0.000092854854,0.0015701841,0.000033343666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009526665,0.00013591952,0.00016761498,0.00056701456,0.00013200394,0.0004581566,0.000421154,0.000051362807,0.00002305002],"category_scores_gemma":[0.0008596709,0.0001339014,0.00008748754,0.00029468024,0.00002835981,0.001236003,0.000054030865,0.00013177887,0.000014147965],"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.000101143574,0.00006197294,0.00018502136,0.00001152343,0.00010734782,0.000002609437,0.00026008903,0.97756416,0.0011530081,0.0022875275,0.0019771066,0.016288523],"study_design_scores_gemma":[0.0006074806,0.000067540976,0.000069211914,0.00020925138,0.00003992952,0.0000051103216,0.00020546728,0.97941256,0.00014080886,0.00083625707,0.018257588,0.00014878342],"about_ca_topic_score_codex":0.000044102464,"about_ca_topic_score_gemma":0.000025967569,"teacher_disagreement_score":0.7217882,"about_ca_system_score_codex":0.0001210413,"about_ca_system_score_gemma":0.00008576596,"threshold_uncertainty_score":0.54603404},"labels":[],"label_agreement":null},{"id":"W2810629198","doi":"10.5267/j.ijiec.2018.2.001","title":"Trade-off in robustness, cost and performance by a multi-objective robust production optimization method","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":14,"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":"Robustness (evolution); Robust optimization; Mathematical optimization; Multi-objective optimization; Computer science; Reliability engineering; Production (economics); Engineering; Economics; Mathematics; Microeconomics; Biology","score_opus":0.11246284113617322,"score_gpt":0.3936420668807403,"score_spread":0.2811792257445671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810629198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10197046,0.000091600654,0.89431435,0.0007771495,0.0025788276,0.0002051204,0.000010119798,0.00001647676,0.000035879617],"genre_scores_gemma":[0.55450207,0.000022451715,0.444781,0.000025009816,0.00061438093,0.00000490117,0.0000047090684,0.000014415077,0.00003106202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976263,0.00022481545,0.00089188,0.00025919915,0.0008423928,0.00015542236],"domain_scores_gemma":[0.9979368,0.0006664991,0.00045375066,0.00009998609,0.000745095,0.000097902564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528698,0.00014904074,0.00026052105,0.00078437483,0.00007041736,0.00021486497,0.0004243856,0.000110925255,0.00003825338],"category_scores_gemma":[0.0034622843,0.00013506539,0.00006057931,0.00072878343,0.00007565058,0.0009169425,0.000064525426,0.00035980495,0.0000024398103],"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.000109602595,0.00008518948,0.00075722084,7.334578e-7,0.000037963135,0.000004320552,0.00046667742,0.9458471,0.0011632114,0.000032419874,0.0005460407,0.05094954],"study_design_scores_gemma":[0.0012836443,0.00019060884,0.0018418975,0.000089330635,0.000010138107,0.00016609252,0.0002954128,0.9913653,0.0042057973,0.000021754417,0.00039958293,0.00013039898],"about_ca_topic_score_codex":0.000011237666,"about_ca_topic_score_gemma":0.0000019834192,"teacher_disagreement_score":0.4525316,"about_ca_system_score_codex":0.00024517346,"about_ca_system_score_gemma":0.00012213342,"threshold_uncertainty_score":0.55078065},"labels":[],"label_agreement":null},{"id":"W2811356407","doi":"10.5267/j.ijiec.2018.2.002","title":"Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":25,"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":"European Regional Development Fund; Région Normandie","keywords":"Ant colony optimization algorithms; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Metaheuristic; Computer science; ANT; Optimization algorithm; Algorithm; Engineering; Mathematics; Schedule","score_opus":0.0377641593824354,"score_gpt":0.2843181667272819,"score_spread":0.24655400734484648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811356407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043907153,0.000052353127,0.99561536,0.00050972507,0.0030114604,0.00021634367,0.00004011888,0.00006568508,0.00004986969],"genre_scores_gemma":[0.7290756,0.000006813674,0.26812005,0.000039397946,0.0026748152,0.000010006667,0.000037713206,0.000026682681,0.000008932213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989775,0.000013540486,0.0005062438,0.00007681173,0.00028907286,0.00013684551],"domain_scores_gemma":[0.99787235,0.000933402,0.00015989316,0.000066637665,0.00091179734,0.000055888024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036372498,0.000121095545,0.00013972334,0.0002081111,0.00008049807,0.00012140827,0.00023760882,0.00008969534,0.00004855098],"category_scores_gemma":[0.00042935187,0.00010228703,0.00008836842,0.00016639485,0.000033363078,0.00014171122,0.000013586284,0.00021468967,0.0000013713689],"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.000015497446,0.000020226833,0.000015380563,0.000004660095,0.00012621818,0.000003989544,0.000070531634,0.97407186,0.000023186803,0.0001513907,0.00025234112,0.025244698],"study_design_scores_gemma":[0.00095498835,0.00009245915,0.00002076721,0.000094539566,0.00004491174,0.000011959277,0.000023471317,0.99437433,0.00010142817,0.00006466808,0.0041079093,0.0001085746],"about_ca_topic_score_codex":0.000010057075,"about_ca_topic_score_gemma":0.0000013943146,"teacher_disagreement_score":0.7286365,"about_ca_system_score_codex":0.0001410286,"about_ca_system_score_gemma":0.00010074401,"threshold_uncertainty_score":0.4171144},"labels":[],"label_agreement":null},{"id":"W2898620776","doi":"10.5267/j.ijiec.2018.6.004","title":"A flexible mathematical model for the planning and designing of a sporting fixture by considering the assignment of referees","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Universidad del Valle","keywords":"Fixture; Operations research; Computer science; Engineering; Industrial engineering; Engineering drawing; Manufacturing engineering; Mechanical engineering","score_opus":0.10113893447632104,"score_gpt":0.2843911741552307,"score_spread":0.18325223967890963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898620776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839584,0.00034380172,0.8803326,0.0005129765,0.00023877241,0.000073513234,0.000034619803,0.0000028501709,0.000065051594],"genre_scores_gemma":[0.9937431,0.000013893031,0.005966128,0.000022101109,0.00022070405,0.0000023117072,0.0000015754356,0.000006855113,0.000023321278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917936,0.0000022107015,0.00062395335,0.00005436549,0.00007118459,0.00006893778],"domain_scores_gemma":[0.9988484,0.00031201553,0.00061107875,0.00005048136,0.0001572341,0.000020789554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841924,0.00005682113,0.0001662746,0.00010062801,0.000049930262,0.00003386747,0.00015808633,0.000035986133,0.000012291095],"category_scores_gemma":[0.0002564128,0.000041020885,0.00005863212,0.00005981446,0.000044574568,0.00007516299,0.000025116877,0.00011993321,2.0652261e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021963537,0.000016855825,0.002044368,0.000007796773,0.0001805754,4.5948735e-7,0.0008653278,0.97212094,0.00017032557,0.023504883,0.00047387276,0.0005926534],"study_design_scores_gemma":[0.00036897534,0.000048103702,0.00025872863,0.00013663326,0.000015848464,0.0000128222155,0.000115590825,0.99465925,0.0006323095,0.0030920575,0.0006154166,0.000044272376],"about_ca_topic_score_codex":0.0000082886045,"about_ca_topic_score_gemma":2.9725157e-7,"teacher_disagreement_score":0.87534726,"about_ca_system_score_codex":0.000023009266,"about_ca_system_score_gemma":0.000029708488,"threshold_uncertainty_score":0.16727832},"labels":[],"label_agreement":null},{"id":"W2898990208","doi":"10.5267/j.ijiec.2018.8.002","title":"Evolution of clustering techniques in designing cellular manufacturing systems: A state-of-art review","year":2018,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Cellular manufacturing; Cluster analysis; State (computer science); Computer science; State of art; Cell formation; Manufacturing engineering; Industrial engineering; Engineering; Artificial intelligence; Mathematical optimization; Mathematics; Data science; Algorithm","score_opus":0.03962178307189382,"score_gpt":0.2906939294035031,"score_spread":0.25107214633160924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898990208","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008820943,0.4680757,0.53025305,0.000003086545,0.0013141341,0.00024704693,0.000027348182,0.00004155351,0.000029256196],"genre_scores_gemma":[0.0043026065,0.97754467,0.017427562,0.0000013758876,0.000568193,0.000019708341,0.000053452783,0.00007461567,0.000007847986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"systematic_review","domain_scores_codex":[0.99725795,0.00006726756,0.0019640848,0.00013969884,0.00039801773,0.00017297023],"domain_scores_gemma":[0.99809927,0.0003122012,0.0010239345,0.00014275336,0.00036404337,0.000057809466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005494334,0.00030307262,0.001151684,0.0011657879,0.000014428311,0.000029452973,0.00045058495,0.00019071964,0.000004591223],"category_scores_gemma":[0.00025441035,0.00030387688,0.00026121017,0.00027158027,0.000030197058,0.00020105597,0.00005910241,0.000585538,0.0000019247834],"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.0000045340735,0.000017777684,7.1872836e-7,0.0062799277,0.0002017769,0.000016312713,0.00002157587,0.9471957,0.00000895567,0.000023291734,0.00017971138,0.04604972],"study_design_scores_gemma":[0.0010655785,0.00024374336,0.0000028941577,0.49198383,0.00089890725,0.0003681353,0.00003157009,0.2692027,0.0023009693,0.00014616986,0.2326299,0.0011256103],"about_ca_topic_score_codex":0.000009068959,"about_ca_topic_score_gemma":9.84903e-7,"teacher_disagreement_score":0.677993,"about_ca_system_score_codex":0.00064428186,"about_ca_system_score_gemma":0.000165014,"threshold_uncertainty_score":0.99994135},"labels":[],"label_agreement":null},{"id":"W2899058700","doi":"10.5267/j.ijiec.2018.6.006","title":"Multi-objective facility layout problems using BBO, NSBBO and NSGA-II metaheuristic algorithms","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Metaheuristic; Algorithm; Computer science; Mathematical optimization; Mathematics","score_opus":0.047526262076356206,"score_gpt":0.27936654677503703,"score_spread":0.23184028469868082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899058700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087866165,0.000092919516,0.90930134,0.000035176618,0.002439505,0.00009559685,0.000057802918,0.00008812005,0.000023390201],"genre_scores_gemma":[0.9009416,0.000014739692,0.09820767,0.000008405179,0.000780992,0.000002036882,0.00001450556,0.000019236139,0.000010820878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.000019903824,0.00046387795,0.0001223441,0.00025199258,0.00015474272],"domain_scores_gemma":[0.9990491,0.00012938115,0.00014491819,0.00007027532,0.00051120826,0.00009510694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020422114,0.00016411074,0.00020395298,0.00030442455,0.00009271112,0.00007010087,0.00017343093,0.000096336844,0.000011821011],"category_scores_gemma":[0.0003939633,0.00016677483,0.00005897919,0.00013638497,0.000058215268,0.00025669744,0.00005231534,0.00033289465,0.0000022885831],"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.000010252558,0.000027661119,0.00008829015,0.0000061292153,0.0001931382,0.000008042663,0.0003915788,0.9956768,0.0004116134,0.000056195917,0.00003906913,0.0030912145],"study_design_scores_gemma":[0.0009676849,0.00008916412,0.00048087802,0.00009160791,0.000048555106,0.00011003043,0.00004666907,0.99645174,0.00077791704,0.00013095544,0.00063478545,0.00017002452],"about_ca_topic_score_codex":0.000019903777,"about_ca_topic_score_gemma":0.0000028333188,"teacher_disagreement_score":0.8130754,"about_ca_system_score_codex":0.00017727348,"about_ca_system_score_gemma":0.000046279805,"threshold_uncertainty_score":0.680088},"labels":[],"label_agreement":null},{"id":"W2899182135","doi":"10.5267/j.ijiec.2018.6.003","title":"A mixed integer linear programming formulation for the vehicle routing problem with backhauls","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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":"Vehicle routing problem; Integer programming; Mathematical optimization; Linear programming; Mathematics; Integer (computer science); Computer science; Routing (electronic design automation); Computer network","score_opus":0.04464265567407138,"score_gpt":0.29323809542789636,"score_spread":0.24859543975382498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899182135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029353146,0.000025341747,0.9677071,0.00067126146,0.0017556906,0.00031707156,0.000008014926,0.0001250795,0.00003731929],"genre_scores_gemma":[0.738929,0.0000025123177,0.25914618,0.000017043036,0.0018313163,0.000015692292,0.000008378766,0.000038917962,0.00001097199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.00002616177,0.0005192869,0.00009960331,0.00034748434,0.0002008922],"domain_scores_gemma":[0.9978769,0.0006544142,0.0002242676,0.00009149034,0.0010870903,0.000065842294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879057,0.00015205995,0.00016893234,0.00022789152,0.00011113553,0.00014414453,0.00033741968,0.00008925386,0.000008292741],"category_scores_gemma":[0.00043038206,0.00011629904,0.00009546364,0.00032919532,0.000027017297,0.00030827807,0.00002816895,0.00032442345,0.0000026022128],"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.00004656894,0.000015724143,0.00023186044,0.000005716347,0.00025944915,0.0000019807096,0.00035879685,0.9707519,0.00033066073,0.0012302365,0.00022693616,0.026540216],"study_design_scores_gemma":[0.0013217086,0.00015565647,0.00016285205,0.00019337887,0.000052097443,0.0000617981,0.00011174239,0.9905387,0.0012511387,0.000045092307,0.0059696618,0.00013614999],"about_ca_topic_score_codex":0.000004291573,"about_ca_topic_score_gemma":0.0000030762808,"teacher_disagreement_score":0.70957583,"about_ca_system_score_codex":0.0001572093,"about_ca_system_score_gemma":0.00008334155,"threshold_uncertainty_score":0.4742537},"labels":[],"label_agreement":null},{"id":"W2899284147","doi":"10.5267/j.ijiec.2018.8.001","title":"The storage location assignment problem: A literature review","year":2018,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":109,"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":"Computer science; Mathematical optimization; Process engineering; Engineering; Mathematics","score_opus":0.035065555950184936,"score_gpt":0.29845667358308414,"score_spread":0.2633911176328992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899284147","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3888872e-8,0.71020734,0.2858804,0.000071455266,0.0034457254,0.00025428145,0.00002438377,0.000059974656,0.000056379413],"genre_scores_gemma":[0.000024157707,0.99293214,0.004627641,0.000013021446,0.0021466806,0.000029764842,0.0001241633,0.00005739537,0.000045064106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981049,0.000055303306,0.0010856817,0.00012625779,0.00045592734,0.00017197894],"domain_scores_gemma":[0.99805313,0.0004126839,0.00055927085,0.00016512125,0.0007274546,0.000082322025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043577302,0.00030250294,0.00057102705,0.00029686527,0.00007589944,0.00021275696,0.00062813744,0.00020892348,0.000005840666],"category_scores_gemma":[0.0004642616,0.00021787199,0.0002626332,0.0003908987,0.00003011081,0.00018100212,0.000044464345,0.0008362872,0.000011125693],"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.0000017583956,0.000010313391,2.0671902e-8,0.0016983245,0.0003483474,0.000018060962,0.000018962848,0.72562075,4.5494573e-8,0.00022348136,0.008646528,0.26341337],"study_design_scores_gemma":[0.00016904381,0.000033962588,1.0104489e-7,0.07259111,0.00025663254,0.00022994277,0.0000020629602,0.013318045,9.2286547e-7,0.0000756277,0.91312706,0.00019549552],"about_ca_topic_score_codex":4.039179e-7,"about_ca_topic_score_gemma":2.760342e-7,"teacher_disagreement_score":0.9044805,"about_ca_system_score_codex":0.00046819277,"about_ca_system_score_gemma":0.00018371048,"threshold_uncertainty_score":0.88845617},"labels":[],"label_agreement":null},{"id":"W2899438958","doi":"10.5267/j.ijiec.2018.10.001","title":"Minimizing makespan in a three-stage hybrid flow shop with dedicated machines","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Job shop scheduling; Stage (stratigraphy); Flow shop scheduling; Mathematical optimization; Flow (mathematics); Computer science; Mathematics; Biology; Embedded system; Routing (electronic design automation)","score_opus":0.02285885950258093,"score_gpt":0.24948091263391609,"score_spread":0.22662205313133515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899438958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1403659,0.000031199,0.85763294,0.00015210066,0.0015015268,0.000070560534,0.000019401497,0.00009378104,0.00013260225],"genre_scores_gemma":[0.9413681,0.000008334234,0.05764465,0.000013254192,0.00089998246,0.000002996845,0.000021112506,0.000030715542,0.000010821355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990303,0.0000099996405,0.0004299111,0.00009428282,0.00027782598,0.00015768774],"domain_scores_gemma":[0.9993453,0.00012565248,0.00011619128,0.00007094024,0.0002691915,0.000072723735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013381126,0.00014650251,0.00017459357,0.0004893307,0.00003519366,0.00008247679,0.00023959894,0.00005837852,0.000028240745],"category_scores_gemma":[0.0001750857,0.00013698633,0.0000417612,0.0001974883,0.000044000375,0.00020973074,0.000021016249,0.0003506853,0.0000034926106],"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.000047325226,0.00002129519,0.0004100645,0.000004301341,0.00009435718,0.000067372166,0.00010519443,0.9924381,0.0000928594,0.00014270244,0.00009279283,0.0064836317],"study_design_scores_gemma":[0.001257716,0.00008516462,0.0004893927,0.00018174229,0.000014698555,0.00010018739,0.00001992506,0.9956742,0.0009993832,0.00012504787,0.0009030508,0.00014950625],"about_ca_topic_score_codex":0.000011237899,"about_ca_topic_score_gemma":0.000023633253,"teacher_disagreement_score":0.8010022,"about_ca_system_score_codex":0.00014940555,"about_ca_system_score_gemma":0.00006203646,"threshold_uncertainty_score":0.5586141},"labels":[],"label_agreement":null},{"id":"W2918790554","doi":"10.5267/j.ijiec.2018.11.001","title":"Satisfying multiproduct demand with a FPR-based inventory system featuring expedited rate and scraps","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Ministry of Science and Technology, Taiwan","keywords":"Operations management; Environmental science; Economics; Process engineering; Operations research; Business; Computer science; Engineering","score_opus":0.02037145112245555,"score_gpt":0.21209444753951723,"score_spread":0.19172299641706167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918790554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757697,0.0000819292,0.018321915,0.001144692,0.003971798,0.00029130303,0.0000025864447,0.000085966276,0.0003301105],"genre_scores_gemma":[0.9965145,0.0000016843802,0.0008467099,0.00015072386,0.0024101266,0.0000052785163,0.000014805584,0.000024102783,0.00003205123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891615,0.000015101714,0.00038214377,0.00015621302,0.0003871122,0.00014329577],"domain_scores_gemma":[0.9989951,0.000084187894,0.00036504437,0.000086237545,0.00044252386,0.000026893016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045954535,0.0001533578,0.00019429688,0.00072248396,0.000055572502,0.00029870446,0.00022413216,0.000049932638,0.000025717241],"category_scores_gemma":[0.00013863543,0.00013670283,0.000054841814,0.00027290513,0.000019675641,0.0007067482,0.0000643403,0.00023061891,0.000012288722],"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.00019594387,0.000065082735,0.038306586,0.00015356492,0.0003696836,0.00009291829,0.00009999445,0.95315975,0.00071055413,0.0031730032,0.0018474341,0.0018254605],"study_design_scores_gemma":[0.00898158,0.00010500183,0.0120789325,0.0023539094,0.00015226341,0.00006999606,0.0008275483,0.95544326,0.00036994697,0.000046419285,0.019058948,0.00051219645],"about_ca_topic_score_codex":0.00004744477,"about_ca_topic_score_gemma":0.0000027664453,"teacher_disagreement_score":0.026227655,"about_ca_system_score_codex":0.00012561849,"about_ca_system_score_gemma":0.000049681625,"threshold_uncertainty_score":0.5574579},"labels":[],"label_agreement":null},{"id":"W2918898236","doi":"10.5267/j.ijiec.2019.2.003","title":"Firefly algorithm based upon slicing structure encoding for unequal facility layout problem","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Slicing; Firefly algorithm; Encoding (memory); Computer science; Algorithm; Firefly protocol; Computer graphics (images); Artificial intelligence; Biology","score_opus":0.020378569268112337,"score_gpt":0.2504671967299053,"score_spread":0.23008862746179298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918898236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037083734,0.000022561682,0.95905066,0.00011604188,0.0031570913,0.00020679811,0.00021312897,0.00010788637,0.000042098425],"genre_scores_gemma":[0.89110595,0.000002309604,0.10820506,0.000015134133,0.00053495064,0.0000036946847,0.00010354421,0.000021757018,0.0000075770085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893,0.000011818228,0.0004926697,0.000113059825,0.00028498544,0.0001675144],"domain_scores_gemma":[0.9990625,0.00028831288,0.00015835857,0.00007640174,0.00034477632,0.000069686954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016512262,0.00015962175,0.00020764732,0.00027925824,0.0000335226,0.00007752386,0.00023214222,0.000118107804,0.000025381287],"category_scores_gemma":[0.00015428179,0.00016392246,0.000103036735,0.00010768716,0.000008200741,0.00022513983,0.000016619,0.0003460921,0.00000264001],"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.00001838656,0.00001232999,0.000065716944,0.000018646695,0.000095372634,0.0000033395627,0.00011285988,0.9903407,0.00057730323,0.00016103951,0.00008437562,0.008509902],"study_design_scores_gemma":[0.0013329535,0.000070005684,0.000052789463,0.000120238685,0.00002165585,0.0000129119,0.000036953545,0.99420273,0.0021811656,0.00023267954,0.0015705081,0.00016543134],"about_ca_topic_score_codex":0.0000047136928,"about_ca_topic_score_gemma":9.4378515e-7,"teacher_disagreement_score":0.85402226,"about_ca_system_score_codex":0.00022814599,"about_ca_system_score_gemma":0.000067635854,"threshold_uncertainty_score":0.66845644},"labels":[],"label_agreement":null},{"id":"W2919318685","doi":"10.5267/j.ijiec.2019.2.002","title":"A hybrid algorithm for the multi-depot vehicle scheduling problem arising in public transportation","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Universidad Tecnológica de Pereira; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Depot; Scheduling (production processes); Computer science; Job shop scheduling; Mathematical optimization; Algorithm; Mathematics; Computer network; Routing (electronic design automation); Political science","score_opus":0.02972385463932972,"score_gpt":0.2536289453968471,"score_spread":0.22390509075751738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919318685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03716214,0.00008716809,0.960299,0.00023818522,0.0018999564,0.00022350307,0.000024554218,0.000055821783,0.000009650601],"genre_scores_gemma":[0.8170493,0.000022785522,0.18254241,0.000010284744,0.00030928035,0.000009726751,0.000027539685,0.00002311275,0.0000055089627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990849,0.000008586459,0.00047140804,0.00008332874,0.00020665652,0.0001451366],"domain_scores_gemma":[0.99920845,0.00032296285,0.00012773061,0.000057057605,0.00024283951,0.000040974173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022407025,0.00010953893,0.00013936633,0.0002752785,0.000032143922,0.00009109979,0.00022193989,0.00005638063,0.0000054229117],"category_scores_gemma":[0.000108611835,0.000099645215,0.00007606666,0.00011858492,0.000009925985,0.00029013676,0.0000065980485,0.00033215235,0.0000017234706],"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.0000071227555,0.000022831735,0.00013132571,0.0000062464383,0.00008137223,0.0000045810148,0.00009577847,0.96659005,0.00017782197,0.00038927663,0.000016147418,0.032477435],"study_design_scores_gemma":[0.0015457355,0.00002673189,0.00032124104,0.000098135606,0.000014498052,0.000014162754,0.000051235307,0.9960948,0.0006963125,0.00022682795,0.00080707826,0.00010322537],"about_ca_topic_score_codex":0.0000075814046,"about_ca_topic_score_gemma":0.0000028664024,"teacher_disagreement_score":0.7798872,"about_ca_system_score_codex":0.00015228533,"about_ca_system_score_gemma":0.000050179875,"threshold_uncertainty_score":0.4063414},"labels":[],"label_agreement":null},{"id":"W2920093561","doi":"10.5267/j.ijiec.2019.2.001","title":"Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Universidad de La Sabana; Universidad de Navarra","keywords":"Tardiness; Scheduling (production processes); Computer science; Due date; Mathematical optimization; Job shop scheduling; Mathematics; Schedule","score_opus":0.011875914427762547,"score_gpt":0.24421337612736793,"score_spread":0.2323374616996054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920093561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67908615,0.00008866562,0.3196532,0.000011098389,0.00093802164,0.00016559925,0.000010947109,0.000035850062,0.000010425059],"genre_scores_gemma":[0.9713751,0.0000049558025,0.028379178,0.0000019117606,0.00019804123,0.0000046894647,0.0000056156086,0.000028751858,0.0000017498762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989409,0.000040201634,0.0004458455,0.00010486802,0.0003643703,0.00010385082],"domain_scores_gemma":[0.9986167,0.00036463933,0.00016342936,0.000076954886,0.0007067376,0.00007152722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193883,0.00014836865,0.00028323274,0.00036627863,0.000023513272,0.00006725552,0.00015397563,0.00006316415,0.0000065260965],"category_scores_gemma":[0.00016218188,0.00013338054,0.000048121045,0.00023942614,0.000015572432,0.00023622345,0.000030781048,0.00031899448,5.9902345e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086075335,0.000065485816,0.0064176773,0.00003350052,0.00035167803,0.00026194163,0.00018248042,0.9897386,0.00027756623,0.000059129543,7.0883345e-7,0.0025251503],"study_design_scores_gemma":[0.0041485433,0.00022088231,0.000694927,0.00037971776,0.000057777917,0.0018916647,0.00074090075,0.9914088,0.00029208063,0.000004572119,0.000004910411,0.000155187],"about_ca_topic_score_codex":0.00008372771,"about_ca_topic_score_gemma":0.0000035440871,"teacher_disagreement_score":0.29228893,"about_ca_system_score_codex":0.00012463144,"about_ca_system_score_gemma":0.00007699434,"threshold_uncertainty_score":0.5439101},"labels":[],"label_agreement":null},{"id":"W2920519397","doi":"10.5267/j.ijiec.2019.1.001","title":"Consolidation centers in city logistics: A cooperative approach based on the location routing problem","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":64,"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":"Consolidation (business); City logistics; Vehicle routing problem; Computer science; Routing (electronic design automation); Transport engineering; Operations research; Operations management; Business; Engineering; Computer network; Finance","score_opus":0.047161253585701904,"score_gpt":0.22988904340124955,"score_spread":0.18272778981554766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920519397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04119734,0.00001766038,0.9543928,0.0005773356,0.0019128178,0.0002976423,0.000025490908,0.000054833534,0.0015241163],"genre_scores_gemma":[0.9963206,0.0000035757423,0.0032189018,0.000083892875,0.00030324882,0.0000057053558,0.00004107204,0.000016302858,0.000006698593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989517,0.000027516013,0.00049563224,0.00008724811,0.00031292965,0.00012497244],"domain_scores_gemma":[0.9990581,0.0003172049,0.00011617455,0.000076155055,0.00039208354,0.00004023106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031859853,0.0001264654,0.00015366777,0.000278341,0.000020388432,0.000070075796,0.00024880777,0.00007877283,0.000024300422],"category_scores_gemma":[0.00022305842,0.00010448271,0.000053783235,0.00026936867,0.000023701648,0.000118802214,0.00000805085,0.00047638436,0.0000063540165],"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.00002299842,0.000052638552,0.0013598448,0.0000064852757,0.000057305617,0.000007986617,0.00016796442,0.99283683,0.00008455971,0.004845773,0.00027625434,0.00028136632],"study_design_scores_gemma":[0.0009766663,0.000052421907,0.0008086374,0.00020317452,0.000011423558,0.000010415129,0.00008243609,0.9971607,0.00016498977,0.00005109317,0.00037262667,0.000105463],"about_ca_topic_score_codex":0.000009158967,"about_ca_topic_score_gemma":0.0000018066421,"teacher_disagreement_score":0.95512325,"about_ca_system_score_codex":0.00025245312,"about_ca_system_score_gemma":0.00009154671,"threshold_uncertainty_score":0.42606813},"labels":[],"label_agreement":null},{"id":"W2944037143","doi":"10.5267/j.ijiec.2019.3.001","title":"Mathematical modelling and optimization of surface quality and productivity in turning process of AISI 12L14 free-cutting Steel","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Engineering Technology and Methodologies","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":"Université de Tunis El Manar; Université de Tunis","keywords":"Productivity; Process (computing); Quality (philosophy); Manufacturing engineering; Mechanical engineering; Engineering; Metallurgy; Materials science; Computer science; Economics; Economic growth","score_opus":0.06821550798499196,"score_gpt":0.31535636480046697,"score_spread":0.247140856815475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944037143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5932359,0.00010061719,0.40627772,0.000056012963,0.0002262502,0.000059789014,0.0000040053633,0.000025864494,0.0000138254045],"genre_scores_gemma":[0.8680742,0.000023692926,0.13184458,7.5014344e-7,0.000041935782,8.5807574e-7,0.0000013337672,0.000011451873,0.0000011898508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902934,0.000028845223,0.00058220467,0.00008425865,0.0001854957,0.00008985504],"domain_scores_gemma":[0.9990307,0.00047269536,0.00019193778,0.00007583843,0.00020280339,0.000026009502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075388624,0.000099411685,0.00029337817,0.0002826831,0.000008123532,0.000012201087,0.00016601571,0.00011761893,0.0000022062425],"category_scores_gemma":[0.0009345069,0.000102905404,0.000031125463,0.00016385004,0.000031088177,0.00021296764,0.000043067244,0.00034902204,4.9188618e-8],"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.000017198772,0.000019757576,0.0018744112,0.000115525174,0.00007189832,0.0000014083084,0.0003443821,0.99098724,0.004793599,0.0011249996,0.0000010490443,0.0006485495],"study_design_scores_gemma":[0.0006869861,0.000036418165,0.0006796506,0.0004332405,0.00001247492,0.00003076735,0.00013314093,0.9877275,0.009478616,0.0006919262,0.0000026453606,0.00008658392],"about_ca_topic_score_codex":0.0000043058735,"about_ca_topic_score_gemma":2.3353464e-7,"teacher_disagreement_score":0.2748383,"about_ca_system_score_codex":0.00003448176,"about_ca_system_score_gemma":0.000027145798,"threshold_uncertainty_score":0.41963607},"labels":[],"label_agreement":null},{"id":"W2944050487","doi":"10.5267/j.ijiec.2019.4.002","title":"A modified sailfish optimizer to solve dynamic berth allocation problem in conventional container terminal","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":19,"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":"Terminal (telecommunication); Container (type theory); Mathematical optimization; Computer science; Operations research; Engineering; Mathematics; Computer network","score_opus":0.01613858595115813,"score_gpt":0.24364920276993712,"score_spread":0.227510616818779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944050487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3310171,0.00004825302,0.6619447,0.00097600755,0.0042218836,0.0004351625,0.000050435836,0.00008243781,0.0012240361],"genre_scores_gemma":[0.98055404,0.0000070332812,0.018904181,0.00004901479,0.000312441,0.000010005959,0.00005095249,0.000025677447,0.00008666936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.000010349584,0.0006727082,0.00011157135,0.00036918125,0.00017238286],"domain_scores_gemma":[0.9992467,0.00013020454,0.00011722912,0.00007345456,0.0003295545,0.00010283596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024734114,0.00014801424,0.00022742528,0.00053382816,0.000013403331,0.000084953004,0.00026476674,0.00010060818,0.00012750443],"category_scores_gemma":[0.00009820708,0.0001573179,0.00009183268,0.00018270423,0.000010961123,0.00020321063,0.000032867985,0.0003654219,0.000017293569],"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.000038537226,0.000046970483,0.0004856599,0.000008908076,0.00010803949,0.000041608455,0.00009759195,0.9923984,0.00030351587,0.0020380027,0.00055631506,0.0038764512],"study_design_scores_gemma":[0.002330108,0.00009673063,0.0031902916,0.0003015075,0.000021114234,0.00015574152,0.000039566676,0.9902226,0.00006549364,0.0002777371,0.003064139,0.0002350071],"about_ca_topic_score_codex":0.000025870648,"about_ca_topic_score_gemma":0.000009382892,"teacher_disagreement_score":0.6495369,"about_ca_system_score_codex":0.00029669827,"about_ca_system_score_gemma":0.0001001654,"threshold_uncertainty_score":0.6415238},"labels":[],"label_agreement":null},{"id":"W2944070497","doi":"10.5267/j.ijiec.2019.4.001","title":"Determining rotation cycle and distribution frequency for a vendor-buyer integrated multi-item system considering an external provider and rework","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Ministry of Science and Technology, Taiwan; Association of Arab Universities","keywords":"Rework; Vendor; Distribution (mathematics); Rotation (mathematics); Reliability engineering; Business; Operations management; Computer science; Engineering; Marketing; Mathematics; Embedded system","score_opus":0.030008854329838044,"score_gpt":0.24862654984655103,"score_spread":0.21861769551671298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944070497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.807737,0.00004567827,0.18965176,0.0001970808,0.0019604734,0.00032127462,0.000013286122,0.000048508493,0.000024936418],"genre_scores_gemma":[0.9923772,0.0000022655706,0.0063636433,0.00006427675,0.0010973908,0.000013980838,0.000054257187,0.000018885545,0.000008056539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990395,0.0000123157115,0.0004507945,0.00015049153,0.00021844766,0.00012847695],"domain_scores_gemma":[0.99903905,0.0001317776,0.00034872832,0.00005709949,0.00039465557,0.000028690896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003463116,0.0001319905,0.00017156285,0.0002844117,0.00006708257,0.00038549045,0.0001365645,0.000063456326,0.000009404863],"category_scores_gemma":[0.0002874917,0.00013044832,0.000051485946,0.00011318982,0.000017303599,0.0010784178,0.00005087018,0.00016862252,0.0000025504946],"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.00049375586,0.0003730699,0.15385,0.0007470989,0.0010003189,0.00019051175,0.0010143522,0.63701737,0.008092425,0.08565052,0.00066476414,0.110905826],"study_design_scores_gemma":[0.002982082,0.00006787708,0.006126553,0.00087606284,0.00006383145,0.000082001585,0.00076466816,0.9867095,0.00007212378,0.00029411484,0.0017644338,0.00019679281],"about_ca_topic_score_codex":0.000051844625,"about_ca_topic_score_gemma":0.000004292835,"teacher_disagreement_score":0.3496921,"about_ca_system_score_codex":0.00012615685,"about_ca_system_score_gemma":0.00003337496,"threshold_uncertainty_score":0.53195274},"labels":[],"label_agreement":null},{"id":"W2944209481","doi":"10.5267/j.ijiec.2019.3.003","title":"Flexible job-shop scheduling with learning and forgetting effect by Multi-Agent System","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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":"Forgetting; Job shop; Computer science; Scheduling (production processes); Job shop scheduling; Industrial engineering; Operations management; Operations research; Flow shop scheduling; Engineering; Psychology; Operating system; Cognitive psychology; Schedule","score_opus":0.01152798882352392,"score_gpt":0.23971536870080842,"score_spread":0.2281873798772845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944209481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4146434,0.0002483273,0.58282393,0.000055055454,0.0018367566,0.00011310814,0.0000047726817,0.00018920828,0.00008544634],"genre_scores_gemma":[0.9370653,0.000014517336,0.062438726,0.000005614764,0.00037133327,0.0000035809642,0.000012219164,0.000041541356,0.000047138485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989708,0.000026583626,0.0004059865,0.0001102771,0.00032909657,0.00015724354],"domain_scores_gemma":[0.99922633,0.00024129626,0.00014152616,0.000047854326,0.0002391593,0.00010383863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031651492,0.00016434604,0.00022874499,0.0002904077,0.000047319416,0.00014702383,0.00015795103,0.00009217732,0.000007871395],"category_scores_gemma":[0.00012582415,0.00015094613,0.00005811427,0.00018072975,0.000010573553,0.00022137059,0.000024568086,0.00050564145,0.000007663571],"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.000018582205,0.000008232606,0.0038740907,0.000026027672,0.00021965872,0.000010566849,0.00010220176,0.99149877,0.0009107431,0.0000696309,0.000022068543,0.0032394172],"study_design_scores_gemma":[0.0021134212,0.000117793126,0.000088616165,0.00051470706,0.000030982654,0.00016845463,0.00019740785,0.99444944,0.0017920756,5.807309e-7,0.00036419177,0.00016235559],"about_ca_topic_score_codex":0.0000035104422,"about_ca_topic_score_gemma":1.4956156e-7,"teacher_disagreement_score":0.5224219,"about_ca_system_score_codex":0.00016090013,"about_ca_system_score_gemma":0.00003500455,"threshold_uncertainty_score":0.61554044},"labels":[],"label_agreement":null},{"id":"W2944371224","doi":"10.5267/j.ijiec.2019.3.002","title":"Optimal placement of freight electric vehicles charging stations and their impact on the power distribution network","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","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":"Driving range; Range (aeronautics); Electric vehicle; Routing (electronic design automation); Battery (electricity); Flow network; Power (physics); Grid; Energy consumption; Linear programming; Computer science; Shortest path problem; Mathematical optimization; Automotive engineering; Operations research; Engineering; Electrical engineering; Computer network; Mathematics","score_opus":0.007883218977784871,"score_gpt":0.21636833235274006,"score_spread":0.20848511337495518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944371224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94439596,0.00018350851,0.054200925,0.00024154616,0.00072299835,0.00011971666,0.00005615355,0.000023281562,0.000055902947],"genre_scores_gemma":[0.99918765,0.000033599175,0.0003713363,0.000015228254,0.00035059886,0.0000018967728,0.000020892434,0.000015397614,0.0000034127675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991387,0.000020942916,0.0003818233,0.00006672112,0.00023765434,0.00015416137],"domain_scores_gemma":[0.9991426,0.00038661552,0.00015413537,0.00006719891,0.00019845199,0.000051034152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021156829,0.00014007805,0.00017577183,0.00015197997,0.000037003058,0.00005487465,0.00019217192,0.00006590011,0.000048963982],"category_scores_gemma":[0.000059425227,0.00009173329,0.00009859913,0.00026269606,0.000010654615,0.00013058809,0.000018257275,0.00040218607,0.0000018349193],"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.000029637224,0.000013322712,0.0006082896,0.0000024442363,0.0002801713,0.0000013485302,0.00012696514,0.9911451,0.0024388114,0.002446517,0.0013127956,0.0015946262],"study_design_scores_gemma":[0.0010071244,0.0003594271,0.010578259,0.00020661144,0.000024587525,0.00007227257,0.00010102088,0.98161566,0.0045172093,0.00030455124,0.0010432724,0.00017002174],"about_ca_topic_score_codex":0.000003164583,"about_ca_topic_score_gemma":1.0976891e-7,"teacher_disagreement_score":0.05479167,"about_ca_system_score_codex":0.00016020631,"about_ca_system_score_gemma":0.000055377528,"threshold_uncertainty_score":0.3740775},"labels":[],"label_agreement":null},{"id":"W2944426182","doi":"10.5267/j.ijiec.2019.5.001","title":"Facility layout problem: Bibliometric and benchmarking analysis","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Benchmarking; Computer science; Bibliometrics; Data mining; Business","score_opus":0.01963884390115852,"score_gpt":0.24651468508812588,"score_spread":0.22687584118696735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944426182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25510827,0.00010291543,0.74306613,0.00004946415,0.0013498763,0.000068835165,0.000027268848,0.00006345895,0.00016378623],"genre_scores_gemma":[0.9818063,0.000039721093,0.01787292,0.0000064121464,0.00022637386,0.0000011085821,0.000028357857,0.000008728555,0.0000101257265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991442,0.000009790612,0.0003810742,0.00008649577,0.00027224512,0.00010617434],"domain_scores_gemma":[0.99934864,0.00017895119,0.00011139124,0.000060547907,0.00023391313,0.000066559536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018581458,0.00010459189,0.00019675905,0.0075853844,0.000018388504,0.00008914695,0.00014981633,0.00006909294,0.00003605476],"category_scores_gemma":[0.0001002253,0.00010648952,0.00008135434,0.0039164335,0.000010371409,0.00022676111,0.000025965712,0.000252457,0.0000038400617],"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.000005551643,0.000009916878,0.0048563653,0.0000066476555,0.0004850898,0.0000042550982,0.00004751209,0.98475087,0.000044346423,0.00014704284,0.000064518936,0.009577895],"study_design_scores_gemma":[0.0006968592,0.00004971467,0.010916866,0.00004427649,0.00013215726,0.000028536084,0.00001982914,0.9863559,0.00012950748,0.00013376024,0.0013323216,0.00016029552],"about_ca_topic_score_codex":0.000006308239,"about_ca_topic_score_gemma":7.6193317e-7,"teacher_disagreement_score":0.726698,"about_ca_system_score_codex":0.000091158894,"about_ca_system_score_gemma":0.000020442894,"threshold_uncertainty_score":0.67683595},"labels":[],"label_agreement":null},{"id":"W2958866644","doi":"10.5267/j.ijiec.2019.6.001","title":"The electric vehicle routing problem with backhauls","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Backhaul (telecommunications); Vehicle routing problem; Computer science; Initialization; Mathematical optimization; Electric vehicle; Linear programming; Routing (electronic design automation); Computer network; Mathematics; Algorithm","score_opus":0.015070319391829097,"score_gpt":0.24871662331391664,"score_spread":0.23364630392208754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958866644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324508,0.00016071298,0.46104416,0.0012167749,0.003667344,0.0003045023,0.0000049616733,0.00022910749,0.00092162355],"genre_scores_gemma":[0.97680223,0.00002016107,0.022494344,0.000016483044,0.00057177385,0.0000032948424,0.000002857148,0.000039332368,0.000049498853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987884,0.00003772297,0.00044983617,0.00008267926,0.00044288853,0.00019848235],"domain_scores_gemma":[0.9986549,0.0005465703,0.00018209279,0.000097453536,0.00045030663,0.00006868946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352607,0.0001324867,0.00015818034,0.0002154277,0.00005968171,0.00018349443,0.00041365568,0.000070608665,0.000013592191],"category_scores_gemma":[0.0001696683,0.00010116381,0.00007090132,0.00040170297,0.000011576761,0.00024007521,0.000025377589,0.0004904245,0.000014360769],"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.000018668241,0.000009032716,0.001161407,0.0000026718901,0.00018779095,0.000006607889,0.000084506726,0.9866899,0.0015928696,0.0009607766,0.00024741268,0.009038305],"study_design_scores_gemma":[0.0011717756,0.00008882398,0.0006314038,0.00014214427,0.000020597532,0.00013244199,0.00005609574,0.9928231,0.0010773733,0.00005474849,0.003651248,0.00015021511],"about_ca_topic_score_codex":0.0000023964092,"about_ca_topic_score_gemma":5.2664956e-7,"teacher_disagreement_score":0.44435143,"about_ca_system_score_codex":0.00018421568,"about_ca_system_score_gemma":0.00009919347,"threshold_uncertainty_score":0.41253406},"labels":[],"label_agreement":null},{"id":"W2961079568","doi":"10.5267/j.ijiec.2019.6.002","title":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":327,"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":"Benchmark (surveying); Algorithm; Simple (philosophy); Dimension (graph theory); Mathematical optimization; Computer science; Optimization problem; Optimization algorithm; Continuous optimization; Process (computing); Mathematics; Multi-swarm optimization","score_opus":0.06204859873689692,"score_gpt":0.3061649612971565,"score_spread":0.24411636256025956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961079568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011773179,0.0000950155,0.9922504,0.001253837,0.0044537177,0.0005889991,0.000033893546,0.00009175763,0.000055099066],"genre_scores_gemma":[0.055511273,0.000034708817,0.942699,0.00008959315,0.0014070233,0.000038332775,0.000069899834,0.000053440806,0.00009673591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970833,0.000050262344,0.0010430315,0.00032850908,0.0011491424,0.0003457554],"domain_scores_gemma":[0.9957309,0.0008254338,0.00059100374,0.00027769295,0.0023811744,0.00019381914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011566376,0.00023596948,0.00039574495,0.00092134025,0.00009448045,0.0005909222,0.0016583508,0.00014794017,0.00006421501],"category_scores_gemma":[0.0009965538,0.00023488763,0.00023829321,0.0006794871,0.000025688398,0.0011172182,0.00022546775,0.00045155088,0.000013240688],"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.000013977408,0.000075851014,0.000097817676,0.0000103047205,0.00027480655,0.000009834542,0.00011038955,0.9702231,0.00011184957,0.0033124166,0.000537629,0.025222005],"study_design_scores_gemma":[0.0022460092,0.0001678234,0.000058975333,0.000103196035,0.000025192769,0.000091272486,0.000025829804,0.9934305,0.0002753388,0.0006954426,0.0026528237,0.00022757398],"about_ca_topic_score_codex":0.000024321942,"about_ca_topic_score_gemma":0.0000012367225,"teacher_disagreement_score":0.054333955,"about_ca_system_score_codex":0.000256272,"about_ca_system_score_gemma":0.00043991243,"threshold_uncertainty_score":0.95784396},"labels":[],"label_agreement":null},{"id":"W2983508682","doi":"10.5267/j.ijiec.2019.8.002","title":"Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Vehicle routing problem; Heuristic; Mathematical optimization; Routing (electronic design automation); Computer science; Mathematics; Computer network","score_opus":0.022856149020045954,"score_gpt":0.2474910729177424,"score_spread":0.22463492389769643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983508682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1635073,0.000012987701,0.83474594,0.00012911775,0.0012261688,0.0001549948,0.000013294849,0.00006437839,0.00014581704],"genre_scores_gemma":[0.94882447,0.0000023949945,0.05071032,0.000026944857,0.00039601728,0.0000022491506,0.0000057973125,0.000026761749,0.000005063494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907964,0.0000089928735,0.0003662762,0.00009085524,0.00028745967,0.00016679555],"domain_scores_gemma":[0.99925154,0.00020908097,0.00013122086,0.00007627849,0.00025862828,0.0000732363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016279789,0.00013141036,0.00015927607,0.00018507056,0.000045415527,0.00010363282,0.00024761973,0.000036624002,0.00001512873],"category_scores_gemma":[0.00012861073,0.000105909865,0.000047052992,0.0001463631,0.000020671783,0.00016490258,0.000027435673,0.00033997453,0.0000064748665],"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.00001955851,0.000008785861,0.00014448569,0.000004838097,0.00011832287,0.000016645152,0.00013067,0.995734,0.0010545944,0.00066633127,0.000055602395,0.0020461907],"study_design_scores_gemma":[0.00090552034,0.00006438328,0.00012264705,0.00032381163,0.000027075015,0.00020288775,0.000078442026,0.99600345,0.0017193526,0.00011517044,0.00027736498,0.00015988205],"about_ca_topic_score_codex":0.000004760079,"about_ca_topic_score_gemma":4.2343973e-7,"teacher_disagreement_score":0.7853171,"about_ca_system_score_codex":0.00019322702,"about_ca_system_score_gemma":0.00006223515,"threshold_uncertainty_score":0.4318879},"labels":[],"label_agreement":null},{"id":"W2988095056","doi":"10.5267/j.ijiec.2019.9.001","title":"A new distribution-free generally weighted moving average monitoring scheme for detecting unknown shifts in the process location","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Fault Detection and Control Systems","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":"University of South Africa","keywords":"Nonparametric statistics; Percentile; Parametric statistics; Standard deviation; Wilcoxon signed-rank test; Stability (learning theory); Mathematics; Statistic; Statistics; Moving average; Algorithm; Computer science; Mann–Whitney U test","score_opus":0.01405055229044986,"score_gpt":0.2504313607029734,"score_spread":0.23638080841252354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988095056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53344035,0.00011719836,0.46101892,0.00030876062,0.0046753446,0.00031356327,0.000012304114,0.000071241964,0.000042329273],"genre_scores_gemma":[0.99580574,0.000003976827,0.002164469,0.000009543366,0.0019430077,0.000020110981,0.000013513649,0.000023102286,0.000016545704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987013,0.000024310342,0.0005947853,0.00010276077,0.00040471193,0.00017217707],"domain_scores_gemma":[0.9990164,0.00029750413,0.00016356635,0.00011025265,0.0003533024,0.00005894149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988826,0.00014314069,0.00018114399,0.00025372254,0.00004248547,0.00016334967,0.00050351134,0.00010187433,0.0000061133132],"category_scores_gemma":[0.00037091516,0.0001295714,0.00009796898,0.0003740846,0.000004370776,0.00032004583,0.00001652621,0.0004027042,0.0000033239091],"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.000028721373,0.000012931118,0.0005301757,0.000016789865,0.00010039778,0.000004317035,0.00034827774,0.9905862,0.0018127288,0.00045272807,0.00013684436,0.005969852],"study_design_scores_gemma":[0.0028204846,0.000060122442,0.0011574357,0.00038060604,0.000014903939,0.000050508075,0.0001936468,0.9916221,0.0010686234,0.00018521513,0.0022792267,0.00016716422],"about_ca_topic_score_codex":0.00002223812,"about_ca_topic_score_gemma":0.0000061014694,"teacher_disagreement_score":0.4623654,"about_ca_system_score_codex":0.0002659497,"about_ca_system_score_gemma":0.00012409237,"threshold_uncertainty_score":0.5283769},"labels":[],"label_agreement":null},{"id":"W3013005898","doi":"10.5267/j.ijiec.2019.11.003","title":"An online real-time matheuristic algorithm for dispatch and relocation of ambulances","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Pontificia Universidad Javeriana","keywords":"Relocation; Computer science; Queue; Heuristic; Operations research; Maximization; Minification; Real-time computing; Queueing theory; Mathematical optimization; Computer network; Engineering; Artificial intelligence; Mathematics","score_opus":0.04769789076219444,"score_gpt":0.26969849153365955,"score_spread":0.2220006007714651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013005898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36821416,0.000030967927,0.6244023,0.0056254487,0.0013066155,0.00024381817,0.000064885324,0.000055313863,0.00005653566],"genre_scores_gemma":[0.976494,0.000025985568,0.020792628,0.00018756246,0.0023404262,0.000003882136,0.00012921839,0.00001415682,0.000012127691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991899,0.0000050483995,0.0004314653,0.00008826328,0.00022037151,0.00006492493],"domain_scores_gemma":[0.9991479,0.00004885836,0.00020058393,0.000042991025,0.00053749385,0.000022179864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017087451,0.000077358374,0.00013985581,0.00018175443,0.00002636942,0.00006696467,0.00019748366,0.00003205158,0.000026367827],"category_scores_gemma":[0.00025893218,0.000077164594,0.00004814239,0.00015523015,0.0000152049915,0.00042479695,0.000028836293,0.000074995434,0.0000029396112],"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.00009417939,0.00023355031,0.0008800433,0.00007751886,0.00022465248,0.000004339493,0.00023931486,0.87097263,0.0013957047,0.006329139,0.0021606954,0.11738824],"study_design_scores_gemma":[0.0007217219,0.00005122975,0.0022898642,0.000053979264,0.000040747746,0.0000016821884,0.00009758758,0.99371254,0.000030183712,0.00022849886,0.0026953411,0.000076590564],"about_ca_topic_score_codex":0.00011266567,"about_ca_topic_score_gemma":0.0000039006127,"teacher_disagreement_score":0.6082799,"about_ca_system_score_codex":0.000019497826,"about_ca_system_score_gemma":0.00002480357,"threshold_uncertainty_score":0.31466806},"labels":[],"label_agreement":null},{"id":"W3013316588","doi":"10.5267/j.ijiec.2020.1.001","title":"A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"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":"Tabu search; Mathematical optimization; Single-machine scheduling; Job shop scheduling; Scheduling (production processes); Computer science; Guided Local Search; Algorithm; Engineering; Mathematics; Schedule","score_opus":0.04924084801278942,"score_gpt":0.2716585936891527,"score_spread":0.22241774567636327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013316588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011267615,0.0002401922,0.98492414,0.0015044922,0.0015687016,0.00023286136,0.00008101628,0.000165315,0.000015660607],"genre_scores_gemma":[0.51816076,0.00002247613,0.48002627,0.0000517068,0.0016585059,0.000009700875,0.000021230879,0.00004703268,0.0000022994561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873394,0.0000151872855,0.0005600014,0.00012796547,0.0003520928,0.00021084165],"domain_scores_gemma":[0.99879056,0.00038733144,0.00014466813,0.00006867197,0.00049715966,0.000111620335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021287371,0.00017814139,0.0002216154,0.0003803376,0.00009642233,0.00013835526,0.0004613139,0.0001345349,0.000012479454],"category_scores_gemma":[0.00023939759,0.00015822619,0.00013159624,0.00033530244,0.000032227625,0.00020370333,0.00005144665,0.00061914796,0.0000019297831],"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.000014269979,0.000017470531,0.0000030306949,0.000004980584,0.00032980644,0.000009873574,0.00019328401,0.9097775,0.00052653614,0.00014080321,0.000030751995,0.08895165],"study_design_scores_gemma":[0.0012726783,0.000069793095,0.0000028183738,0.00010777227,0.000050320148,0.00008320799,0.00017940885,0.9889731,0.008529859,0.00005441635,0.0005262098,0.00015046317],"about_ca_topic_score_codex":0.0000039258275,"about_ca_topic_score_gemma":2.4395777e-7,"teacher_disagreement_score":0.50689316,"about_ca_system_score_codex":0.00017223948,"about_ca_system_score_gemma":0.000087372566,"threshold_uncertainty_score":0.6452277},"labels":[],"label_agreement":null},{"id":"W3013516278","doi":"10.5267/j.ijiec.2019.12.001","title":"A discrete Jaya algorithm for permutation flow-shop scheduling problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Flow shop scheduling; Job shop scheduling; Permutation (music); Mathematical optimization; Scheduling (production processes); Computer science; Discrete manufacturing; Algorithm; Mathematics; Economics; Computer network; Production (economics); Microeconomics; Physics","score_opus":0.027726077165255044,"score_gpt":0.2597911209544966,"score_spread":0.23206504378924153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013516278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035082279,0.00010349402,0.9916953,0.0017550514,0.0024568958,0.00018631504,0.00007191401,0.00018228826,0.000040556974],"genre_scores_gemma":[0.1906047,0.000019757343,0.8062127,0.00008317837,0.002918767,0.0000145434715,0.00008669429,0.000054193286,0.0000054232255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998661,0.000014238059,0.00065438676,0.0001250947,0.0003727067,0.00017258992],"domain_scores_gemma":[0.99878824,0.00019544573,0.0001601562,0.000051161802,0.0006266693,0.00017835137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018503606,0.00017454836,0.0002288616,0.00025348025,0.000044853303,0.00015318643,0.00030982884,0.000113841015,0.000021068134],"category_scores_gemma":[0.00033183352,0.00018562032,0.00016756965,0.0002719579,0.000013924142,0.00032948094,0.000022664197,0.0003623168,0.0000066451903],"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.000015078312,0.00001321986,0.000012394473,0.000009206911,0.00022047153,0.000008852575,0.00056591386,0.9509862,0.00019423166,0.0001250219,0.00024370471,0.047605705],"study_design_scores_gemma":[0.0016940496,0.00008336786,0.00000834707,0.000111767156,0.000042806136,0.000041502422,0.0001786653,0.9959653,0.00051101076,0.00007395401,0.0011076478,0.00018160502],"about_ca_topic_score_codex":0.0000010679058,"about_ca_topic_score_gemma":1.276956e-7,"teacher_disagreement_score":0.18709646,"about_ca_system_score_codex":0.00011815425,"about_ca_system_score_gemma":0.000094995965,"threshold_uncertainty_score":0.7569377},"labels":[],"label_agreement":null},{"id":"W3014027498","doi":"10.5267/j.ijiec.2020.1.004","title":"A vendor-buyer coordinated system featuring an unreliable machine, scrap, outsourcing, and multiple shipments","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Scrap; Vendor; Outsourcing; Business; Industrial organization; Manufacturing engineering; Operations management; Insourcing; Computer science; Operations research; Engineering; Marketing; Mechanical engineering","score_opus":0.02401030255287726,"score_gpt":0.2322073217741267,"score_spread":0.20819701922124945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014027498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22157378,0.00036439757,0.772216,0.00061285996,0.0044251424,0.00016966897,0.00008273655,0.00045861703,0.00009679468],"genre_scores_gemma":[0.9763599,0.000010929852,0.0227089,0.000035131874,0.00080732943,0.0000018430184,0.0000323006,0.00003884778,0.0000047995463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894106,0.000022587185,0.00046552304,0.00012018149,0.00030226386,0.00014838522],"domain_scores_gemma":[0.9991563,0.00011376529,0.00012881697,0.000057245255,0.00031198593,0.00023189189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015784585,0.00016201353,0.00021554789,0.0002548286,0.000051073075,0.00016342702,0.00025222893,0.00009842541,0.000010324949],"category_scores_gemma":[0.00029784782,0.00017138547,0.000055870354,0.00025557977,0.000012211547,0.00031211684,0.00003412761,0.00042608954,0.0000034831291],"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.00002246947,0.000016324522,0.0010954762,0.000014170398,0.00017871195,0.000036271744,0.00034260948,0.99607486,0.00031309307,0.00007781151,0.00015659803,0.0016716359],"study_design_scores_gemma":[0.0017987774,0.00006258332,0.00033185782,0.0001908155,0.000029460625,0.000102331236,0.00018930597,0.99617326,0.00059260067,0.0000027146896,0.0003812959,0.00014502187],"about_ca_topic_score_codex":0.000013621714,"about_ca_topic_score_gemma":5.31638e-7,"teacher_disagreement_score":0.75478613,"about_ca_system_score_codex":0.0001238029,"about_ca_system_score_gemma":0.000042926793,"threshold_uncertainty_score":0.6988897},"labels":[],"label_agreement":null},{"id":"W3037143117","doi":"10.5267/j.ijiec.2020.6.003","title":"Parameter tuning of the HCSCROCFO-3Opt algorithm for solving the capacitated vehicle routing problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Vehicle routing problem; Mathematical optimization; Computer science; Routing (electronic design automation); Algorithm; Mathematics; Embedded system","score_opus":0.04260207365858089,"score_gpt":0.2687201777290583,"score_spread":0.22611810407047744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037143117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03872062,0.000047353085,0.95673454,0.0025926284,0.0015504566,0.00022874081,0.000029134788,0.000071714676,0.000024823194],"genre_scores_gemma":[0.8119837,0.000003920653,0.18712412,0.00007760652,0.0007594802,0.0000065244035,0.0000042875113,0.000036514048,0.000003863044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986448,0.00004930052,0.0006744053,0.000091711394,0.0003699702,0.00016978505],"domain_scores_gemma":[0.9980195,0.0009396952,0.0003280774,0.0000861885,0.0005565584,0.00006997553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053271203,0.00014130662,0.0002108427,0.00010926993,0.00008047726,0.000093634444,0.0005754229,0.00008456938,0.0000056758513],"category_scores_gemma":[0.001198842,0.00010607605,0.00018800961,0.0003772742,0.00003438938,0.00018896333,0.000059455288,0.0004952207,6.4411785e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007438426,0.000008619947,0.0001285213,0.000007835578,0.00021603615,0.0000013906725,0.0010622118,0.9751918,0.0033808548,0.000174356,0.0002984024,0.01952258],"study_design_scores_gemma":[0.0008607841,0.000038833958,0.00011307766,0.00016863577,0.0000442672,0.000023603845,0.00017943207,0.9938284,0.004005125,0.00006343353,0.0005711623,0.0001032581],"about_ca_topic_score_codex":0.000004444076,"about_ca_topic_score_gemma":2.7725085e-7,"teacher_disagreement_score":0.7732631,"about_ca_system_score_codex":0.000098860095,"about_ca_system_score_gemma":0.00008475602,"threshold_uncertainty_score":0.43256557},"labels":[],"label_agreement":null},{"id":"W3037315850","doi":"10.5267/j.ijiec.2020.6.001","title":"A postponement model for multi-item replenishment decision considering overtime, commonality, and quality reassurance","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"Ministry of Science and Technology, Taiwan","keywords":"Postponement; Overtime; Quality (philosophy); Operations management; Operations research; Computer science; Business; Economics; Engineering; Labour economics","score_opus":0.12477739380853041,"score_gpt":0.30566032524250536,"score_spread":0.18088293143397494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037315850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24858639,0.00005581364,0.74438775,0.0056992457,0.0009309998,0.000247662,0.000015575686,0.0000471546,0.000029440873],"genre_scores_gemma":[0.9601522,0.0000069380685,0.037951656,0.00075099873,0.0010815514,0.000006364919,0.000028237415,0.000015329471,0.000006705144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987153,0.000006861998,0.0006520785,0.00014959589,0.00036798508,0.00010819413],"domain_scores_gemma":[0.9986845,0.00017636007,0.0004097257,0.000051093713,0.0006464536,0.000031846048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045767514,0.00012030768,0.00019756764,0.00017030184,0.00006853007,0.00021156082,0.0001977531,0.000049217648,0.000007996843],"category_scores_gemma":[0.001557195,0.00012175941,0.000073967785,0.00014069116,0.0000139324275,0.000611952,0.00010420489,0.00014460363,0.0000020261696],"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.00054787594,0.000114631985,0.009341645,0.000054985943,0.0002675201,0.000008584877,0.00032199227,0.9566386,0.0013481344,0.011633635,0.0030245138,0.01669793],"study_design_scores_gemma":[0.00262096,0.000013745193,0.0035222867,0.00013620895,0.000032344527,0.000006479842,0.000037957445,0.98953414,0.00013357126,0.0004399301,0.0033752855,0.00014707776],"about_ca_topic_score_codex":0.000017570053,"about_ca_topic_score_gemma":0.000003749497,"teacher_disagreement_score":0.71156585,"about_ca_system_score_codex":0.00006671403,"about_ca_system_score_gemma":0.000064990454,"threshold_uncertainty_score":0.49652046},"labels":[],"label_agreement":null},{"id":"W3098409340","doi":"10.5267/j.ijiec.2020.10.002","title":"Monitoring fuzzy linear quality profiles: A comparative study","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Fuzzy logic; Ambiguity; Vagueness; Statistic; Quality (philosophy); Computer science; Process (computing); Data mining; Product (mathematics); Statistical process control; Mathematics; Machine learning; Statistics; Artificial intelligence","score_opus":0.3795396119972876,"score_gpt":0.49533953306176887,"score_spread":0.11579992106448128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098409340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46290058,0.0000419535,0.53266907,0.0010361737,0.0029860616,0.00019186421,0.000028693372,0.00004416411,0.00010142465],"genre_scores_gemma":[0.9785662,0.0000015021614,0.018026287,0.00002256552,0.003352559,0.0000047514736,0.0000014280708,0.000012635295,0.000012017907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957197,0.00015373656,0.0015344379,0.00024860466,0.0021805423,0.0001630201],"domain_scores_gemma":[0.99417067,0.0025347983,0.00074397604,0.00011450963,0.0021786871,0.00025738153],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0011248776,0.00016556948,0.00044930942,0.00030755982,0.0000760616,0.00023147342,0.0010254832,0.00006005836,0.000024955742],"category_scores_gemma":[0.012019274,0.00014248752,0.00012693276,0.0006571093,0.000035437464,0.0005854655,0.0001422447,0.0006415646,0.0000359585],"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.00014909993,0.00015891042,0.016366864,0.0000019571755,0.00019167316,0.00007271418,0.003271233,0.9677389,0.00042602018,0.00059354596,0.0002012287,0.010827837],"study_design_scores_gemma":[0.021883287,0.0041690264,0.1203533,0.0010006716,0.00027684472,0.00021083865,0.053649224,0.76267034,0.009990367,0.013956857,0.009593034,0.002246239],"about_ca_topic_score_codex":0.0000068274867,"about_ca_topic_score_gemma":3.2855195e-7,"teacher_disagreement_score":0.51566565,"about_ca_system_score_codex":0.00013348412,"about_ca_system_score_gemma":0.0001684037,"threshold_uncertainty_score":0.9963029},"labels":[],"label_agreement":null},{"id":"W3100238673","doi":"10.5267/j.ijiec.2020.9.001","title":"Application of nature inspired algorithms for multi-objective inventory control scenarios","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Control Systems Optimization","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":"Particle swarm optimization; Mathematical optimization; Computer science; Algorithm; Inventory control; Taguchi methods; Heuristic; Holding cost; Mathematics; Operations research; Machine learning","score_opus":0.02257845695324645,"score_gpt":0.26777744488888966,"score_spread":0.2451989879356432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100238673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038151918,0.0001968949,0.99341875,0.00037634847,0.0015840053,0.00040975297,0.0001087871,0.000079656005,0.000010632845],"genre_scores_gemma":[0.96966785,0.0000056396043,0.029024981,0.000052866326,0.0011582474,0.000026840069,0.000027898326,0.000034232125,0.0000014196136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988279,0.000017265807,0.00066292356,0.0001017931,0.00027898338,0.00011116855],"domain_scores_gemma":[0.99852884,0.00016340191,0.00032443143,0.000058598554,0.0008290379,0.0000956903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013436288,0.00013780437,0.00027797476,0.00022792355,0.000020822312,0.000024966796,0.0002805862,0.00017210435,0.0000018800457],"category_scores_gemma":[0.0005327628,0.00015032837,0.00013792147,0.0001998204,0.000014919655,0.00024914878,0.000012921031,0.00037523822,8.597175e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006627342,0.000025359457,0.00019648376,0.00001630162,0.000341337,0.0000021946382,0.00020419525,0.98943335,0.0039038246,0.0005510935,0.00010451978,0.0051550516],"study_design_scores_gemma":[0.004008665,0.00008424632,0.00015621918,0.00007576196,0.000041719562,0.000011034076,0.00004070584,0.9933963,0.00092964055,0.000039138242,0.001101021,0.00011554732],"about_ca_topic_score_codex":0.0000036064523,"about_ca_topic_score_gemma":6.6064746e-7,"teacher_disagreement_score":0.9658527,"about_ca_system_score_codex":0.00017220837,"about_ca_system_score_gemma":0.000069264854,"threshold_uncertainty_score":0.6130213},"labels":[],"label_agreement":null},{"id":"W3100936058","doi":"10.5267/j.ijiec.2020.9.002","title":"The capacitated maximal covering location problem with heterogeneous facilities and vehicles and different setup costs: An effective heuristic approach","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"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; Heuristic; Genetic algorithm; Constructive; Integer programming; Set (abstract data type); Computer science; Facility location problem; Linear programming; Mathematics; Process (computing)","score_opus":0.02410708849223421,"score_gpt":0.2112294501919565,"score_spread":0.1871223616997223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100936058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9263345,0.00009888852,0.0710959,0.0017385047,0.00032335086,0.00029150117,0.000009664855,0.000043212698,0.00006450476],"genre_scores_gemma":[0.9990978,0.000014763198,0.00038088215,0.00010339993,0.00035370645,0.0000123509,0.00002169544,0.0000100913485,0.0000052952564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999186,0.000016663435,0.0002959961,0.00012486875,0.00027572384,0.00010077447],"domain_scores_gemma":[0.9993572,0.00007497662,0.000120174554,0.00004412335,0.000369729,0.00003376433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016188802,0.00012295874,0.0001244647,0.00011757897,0.000120822464,0.00036568166,0.0001520499,0.000030512487,0.0000034038283],"category_scores_gemma":[0.00016564778,0.00009069859,0.000023391909,0.00014081088,0.000050242234,0.00046580797,0.000057713874,0.00017202749,0.000001368317],"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.00021553747,0.000058688747,0.0018861853,0.00007641831,0.00026983637,0.000007961604,0.0005116661,0.97242546,0.0001127441,0.0053623435,0.00012325389,0.018949885],"study_design_scores_gemma":[0.0014728076,0.00014602441,0.0070583387,0.00010737785,0.00006588598,0.000033102002,0.0010687568,0.9866886,0.00003683968,0.00020297426,0.0029262167,0.00019305004],"about_ca_topic_score_codex":0.00013071235,"about_ca_topic_score_gemma":0.000019779049,"teacher_disagreement_score":0.072763346,"about_ca_system_score_codex":0.00006234292,"about_ca_system_score_gemma":0.000014930847,"threshold_uncertainty_score":0.3698581},"labels":[],"label_agreement":null},{"id":"W3101200922","doi":"10.5267/j.ijiec.2020.10.001","title":"A chaotic-based improved many-objective Jaya algorithm for many-objective optimization problems","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Benchmark (surveying); Algorithm; Sorting; Mathematical optimization; Convergence (economics); Chaotic; Computer science; Local optimum; Tournament selection; Premature convergence; Evolutionary algorithm; Selection (genetic algorithm); Mathematics; Artificial intelligence; Particle swarm optimization","score_opus":0.02531355818343585,"score_gpt":0.2650028868976819,"score_spread":0.23968932871424609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101200922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009212041,0.000038770926,0.99313354,0.0032350083,0.002477165,0.000740668,0.00007600667,0.00017758156,0.000029145927],"genre_scores_gemma":[0.04970952,0.000008895489,0.9482287,0.0004432202,0.0014316596,0.0000610525,0.00004787789,0.000053493863,0.000015552998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976936,0.00006720777,0.0008976916,0.00041886524,0.00061626575,0.0003063702],"domain_scores_gemma":[0.9956793,0.0005265531,0.00079226797,0.00016023515,0.0025815386,0.00026005914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031120202,0.0003136289,0.00039590755,0.0005798322,0.00012419357,0.0003015703,0.0010607225,0.00016319127,0.000013050875],"category_scores_gemma":[0.0010420227,0.00033254456,0.00026322177,0.00076409423,0.000041883868,0.0011125067,0.00013695522,0.0005166368,0.0000040666137],"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.000046356312,0.00011312908,0.000009013909,0.0000064626765,0.0002495629,0.000017770737,0.00059627916,0.96839553,0.00021393369,0.0011789008,0.000115183444,0.02905788],"study_design_scores_gemma":[0.0045106346,0.000459416,0.00003638401,0.0001080668,0.00003642832,0.00005440245,0.00007033403,0.99256563,0.0010680347,0.00017844519,0.00060142094,0.00031077195],"about_ca_topic_score_codex":0.000009911049,"about_ca_topic_score_gemma":4.0465017e-7,"teacher_disagreement_score":0.049617402,"about_ca_system_score_codex":0.00045796213,"about_ca_system_score_gemma":0.00048685062,"threshold_uncertainty_score":0.9999127},"labels":[],"label_agreement":null},{"id":"W3101637431","doi":"10.5267/j.ijiec.2020.10.004","title":"A novel modeling approach for a capacitated (S,T) inventory system with backlog under stochastic discrete demand and lead time","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":14,"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":"Lead time; Inventory theory; Computer science; Set (abstract data type); Discrete time and continuous time; Mathematical optimization; Operations research; Stochastic modelling; Inventory control; Operations management; Engineering; Mathematics; Statistics","score_opus":0.053580623804232244,"score_gpt":0.22523174476506316,"score_spread":0.1716511209608309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101637431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029722402,0.000026267431,0.9682616,0.0011798599,0.00038194112,0.0002469193,0.000008645448,0.000049346676,0.00012302135],"genre_scores_gemma":[0.9910938,4.180793e-7,0.006664689,0.00026554806,0.0018897052,0.0000109052,0.000038680017,0.000026178208,0.000010062432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990535,0.000005650973,0.00037055317,0.00014003961,0.00030138943,0.00012886609],"domain_scores_gemma":[0.99927795,0.00005173096,0.00023410094,0.000040927873,0.00035891653,0.000036392084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022560007,0.00014078736,0.00019724914,0.00028272258,0.00005846173,0.00022331066,0.0002059361,0.00004829956,0.000005018713],"category_scores_gemma":[0.00011716537,0.00012409882,0.000066905064,0.00017100862,0.000021504373,0.0004952654,0.00005627794,0.00017122796,0.0000027999886],"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.00011858223,0.000026877058,0.000025663612,0.000052699692,0.00022713814,0.0000031980503,0.00010022145,0.9917738,0.00024627923,0.0069642477,0.00036293984,0.00009839146],"study_design_scores_gemma":[0.0023099293,0.000043757394,0.000012020976,0.00019108214,0.00008933609,0.000022664883,0.0004413674,0.99652606,0.00000321799,0.000047848087,0.00017822575,0.00013451297],"about_ca_topic_score_codex":0.000022424223,"about_ca_topic_score_gemma":6.2688906e-7,"teacher_disagreement_score":0.9615969,"about_ca_system_score_codex":0.00009306747,"about_ca_system_score_gemma":0.00003681472,"threshold_uncertainty_score":0.5060603},"labels":[],"label_agreement":null},{"id":"W3102154833","doi":"10.5267/j.ijiec.2020.10.003","title":"Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Backhaul (telecommunications); Vehicle routing problem; FIFO (computing and electronics); Variable neighborhood search; Heuristic; FIFO and LIFO accounting; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Reduction (mathematics); Algorithm; Null-move heuristic; Mathematics; Metaheuristic; Computer network","score_opus":0.0249850087606199,"score_gpt":0.25282262619365276,"score_spread":0.22783761743303285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102154833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02195103,0.00007497468,0.97553015,0.0010537854,0.00039672334,0.00028356112,0.000050731345,0.00023040688,0.00042862247],"genre_scores_gemma":[0.7301196,0.000017780936,0.26847705,0.00005927934,0.0011397733,0.000008314057,0.000033500684,0.00010579284,0.00003894303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976226,0.000110429595,0.00067302695,0.00027534727,0.00093828334,0.00038031227],"domain_scores_gemma":[0.99807495,0.00046451524,0.00016254275,0.00012685689,0.0008362119,0.00033493782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007345418,0.0003037851,0.0004010526,0.00031017858,0.000113159724,0.0003643786,0.0004250872,0.00016046781,0.00010227487],"category_scores_gemma":[0.00021111415,0.0002841827,0.000051446907,0.0006940467,0.000046243415,0.0005333889,0.000100092344,0.0010214436,0.0000144728365],"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.000089836176,0.000046529378,0.0007970918,0.00003710047,0.0004985695,0.00006449199,0.000416092,0.9931691,0.0009933778,0.00077574165,0.000114366434,0.0029976715],"study_design_scores_gemma":[0.0027714043,0.00032223362,0.00020654152,0.00038738188,0.000087387,0.00035462287,0.0001242762,0.9948034,0.00040745083,0.000036672034,0.00019127183,0.0003073444],"about_ca_topic_score_codex":0.000015697111,"about_ca_topic_score_gemma":3.7042042e-7,"teacher_disagreement_score":0.70816857,"about_ca_system_score_codex":0.00024447334,"about_ca_system_score_gemma":0.000311226,"threshold_uncertainty_score":0.999961},"labels":[],"label_agreement":null},{"id":"W3103000967","doi":"10.5267/j.ijiec.2020.8.001","title":"Iterated local search multi-objective methodology for the green vehicle routing problem considering workload equity with a private fleet and a common carrier","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Iterated local search; Metaheuristic; Mathematical optimization; Vehicle routing problem; Workload; Computer science; Neighbourhood (mathematics); Local search (optimization); Operations research; Process (computing); Equity (law); Routing (electronic design automation); Mathematics","score_opus":0.09937757166704175,"score_gpt":0.31393845699907,"score_spread":0.21456088533202827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103000967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1019211,0.000054530912,0.8864067,0.01067099,0.00034172725,0.0005254458,0.000007510637,0.000046672452,0.000025296435],"genre_scores_gemma":[0.98142004,0.0000018599994,0.016613636,0.00057609455,0.0013320427,0.000017978724,0.000006673187,0.000024704657,0.0000069925413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988712,0.00003660525,0.00040569197,0.00015581005,0.00031678524,0.00021390876],"domain_scores_gemma":[0.9981793,0.0007642375,0.0002735647,0.000056976893,0.00069262733,0.000033253058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008386268,0.00014605635,0.00022204936,0.00023701238,0.00013764936,0.000341725,0.00032492788,0.000056317163,0.0000069374973],"category_scores_gemma":[0.00052699225,0.000114339346,0.000060609153,0.00035111207,0.00006218843,0.00045697196,0.00031109332,0.0003860457,8.356391e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031005417,0.000025159427,0.0027161583,0.00004326915,0.00052305945,0.00005840245,0.00078322313,0.96434516,0.00015738989,0.004010295,0.00007868899,0.026949149],"study_design_scores_gemma":[0.0035793697,0.00007360766,0.00119208,0.00019453412,0.00011082355,0.0000269602,0.0018920406,0.99004406,0.000097467404,0.00039777643,0.002234722,0.00015658449],"about_ca_topic_score_codex":0.00034680887,"about_ca_topic_score_gemma":0.000025457708,"teacher_disagreement_score":0.8794989,"about_ca_system_score_codex":0.000121558965,"about_ca_system_score_gemma":0.00007602104,"threshold_uncertainty_score":0.4662623},"labels":[],"label_agreement":null},{"id":"W3104932000","doi":"10.5267/j.ijiec.2020.7.001","title":"Solving the one-warehouse N-retailers problem with stochastic demand: An inter-ratio policies approach","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Heuristic; Mathematical optimization; Supply chain; Computer science; Set (abstract data type); Integer (computer science); Function (biology); Product (mathematics); Extension (predicate logic); Monte Carlo method; Operations research; Holding cost; Random variable; Mathematics; Marketing; Business; Statistics","score_opus":0.055217430401488736,"score_gpt":0.2349433980588372,"score_spread":0.17972596765734847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104932000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06979719,0.000022628645,0.9150094,0.0129122585,0.001046672,0.00036540124,0.0000048440193,0.00012163981,0.0007199681],"genre_scores_gemma":[0.9930162,0.0000010873199,0.0017209477,0.001149597,0.004043011,0.000009616077,0.000020599693,0.000027734743,0.000011252046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875385,0.000015144807,0.0004347537,0.00013301476,0.00050614146,0.00015708816],"domain_scores_gemma":[0.9990164,0.00007144208,0.00035681485,0.00008420023,0.00043230306,0.00003880978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028404497,0.00015476289,0.00017325317,0.00029732872,0.000101389,0.00056375377,0.00059660926,0.00004324836,0.000037485883],"category_scores_gemma":[0.00019492862,0.00011568092,0.000080713966,0.00030981677,0.00003931696,0.0010395652,0.000111429945,0.0003463771,0.000008079541],"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.00006118146,0.000075993165,0.0003153858,0.000012956404,0.00026683198,0.000007811561,0.0006852526,0.98602563,0.00004823033,0.009542494,0.0017301387,0.0012281223],"study_design_scores_gemma":[0.0016374885,0.00011602773,0.00038579022,0.00018390371,0.0001310936,0.00002264822,0.0014125155,0.98817843,0.00001704644,0.0002240832,0.0074528297,0.0002381203],"about_ca_topic_score_codex":0.000061141094,"about_ca_topic_score_gemma":0.000005108505,"teacher_disagreement_score":0.92321897,"about_ca_system_score_codex":0.00007070121,"about_ca_system_score_gemma":0.00005391478,"threshold_uncertainty_score":0.54362905},"labels":[],"label_agreement":null},{"id":"W3106220855","doi":"10.5267/j.ijiec.2020.9.003","title":"A multi-item batch fabrication problem featuring delayed product differentiation, outsourcing, and quality assurance","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Ministry of Science and Technology, Taiwan","keywords":"Postponement; Outsourcing; Quality (philosophy); Quality assurance; Computer science; Production (economics); Product (mathematics); Order (exchange); Operations research; Operations management; Batch production; Manufacturing engineering; Reliability engineering; Service (business); Business; Engineering; Economics; Marketing","score_opus":0.03349649967408552,"score_gpt":0.25563891462479804,"score_spread":0.22214241495071252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106220855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16965303,0.00021792881,0.82771045,0.0011329551,0.0009492931,0.0001529844,0.000017294735,0.00014507156,0.000020988375],"genre_scores_gemma":[0.9707411,0.000058256246,0.028289156,0.00002731245,0.00081659347,0.0000059610543,0.000026962838,0.00002696303,0.000007680511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987814,0.000024046667,0.00060378807,0.000143076,0.00032193738,0.00012578926],"domain_scores_gemma":[0.9988885,0.00012917865,0.00024014115,0.000058503563,0.0005647973,0.000118895434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017086368,0.00015756584,0.00020888675,0.0001747225,0.000045242283,0.00014727289,0.0002143692,0.00007028812,0.000008892889],"category_scores_gemma":[0.0005784965,0.00016174724,0.000055279124,0.00020503317,0.000011290966,0.00035226002,0.000032021366,0.00033420752,0.0000016779966],"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.000020348103,0.000020888816,0.002510823,0.000041961324,0.00016213085,0.0000023494636,0.0005737938,0.98968196,0.0014120557,0.00005526993,0.0002370363,0.0052813785],"study_design_scores_gemma":[0.0015068733,0.000043079173,0.026919095,0.00016050134,0.000039488714,0.000021667205,0.000039543655,0.96638536,0.0036945299,0.000018305282,0.0009316355,0.00023994083],"about_ca_topic_score_codex":0.000010627147,"about_ca_topic_score_gemma":0.0000019767829,"teacher_disagreement_score":0.8010881,"about_ca_system_score_codex":0.00008766321,"about_ca_system_score_gemma":0.000044971024,"threshold_uncertainty_score":0.6595861},"labels":[],"label_agreement":null},{"id":"W3122553722","doi":"10.5267/j.ijiec.2020.12.001","title":"A hybrid meta-heuristics approach for supplier selection and order allocation problem for supplying risks of recyclable raw materials","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Mathematical optimization; Selection (genetic algorithm); Benchmark (surveying); Heuristics; Raw material; Particle swarm optimization; Computer science; Integer programming; Order (exchange); Heuristic; Operations research; Engineering; Mathematics; Economics; Artificial intelligence","score_opus":0.06656340473342157,"score_gpt":0.2836388790201672,"score_spread":0.21707547428674565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122553722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022388319,0.000054564724,0.97526,0.00070862134,0.0008228648,0.00061694573,0.000043562985,0.000024797399,0.00008030783],"genre_scores_gemma":[0.8330171,0.000009363834,0.16438185,0.0000832726,0.0018703334,0.00011164742,0.00040575885,0.000037854294,0.00008281651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987107,0.000013974532,0.000653842,0.00016721223,0.00029201238,0.00016223875],"domain_scores_gemma":[0.9966971,0.00023014173,0.0005450349,0.000063391824,0.0024478284,0.00001644654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071299,0.00014757461,0.0003237454,0.00047024732,0.000077940815,0.00028562668,0.00017853722,0.00006192547,0.000031818112],"category_scores_gemma":[0.00088582997,0.00014871979,0.00011723336,0.00026117061,0.000014787147,0.00050296605,0.000072590585,0.00011785135,3.1245128e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119442775,0.00013338648,0.00008453469,0.00023269752,0.0013628342,0.0000032799642,0.000036718302,0.9727567,0.0022991076,0.018379886,0.0030243974,0.0015670471],"study_design_scores_gemma":[0.0049007596,0.000073757634,0.00013253783,0.000120422694,0.0018433552,0.00007286922,0.00045059837,0.952861,0.007901683,0.005968005,0.025303382,0.00037159625],"about_ca_topic_score_codex":0.00006754601,"about_ca_topic_score_gemma":0.0000015128743,"teacher_disagreement_score":0.81087816,"about_ca_system_score_codex":0.00009723237,"about_ca_system_score_gemma":0.000107260574,"threshold_uncertainty_score":0.6064617},"labels":[],"label_agreement":null},{"id":"W3124204803","doi":"10.5267/j.ijiec.2021.1.001","title":"A delayed differentiation multiproduct model with the outsourcing of common parts, overtime strategy for end products, and quality reassurance","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Ministry of Science and Technology, Taiwan","keywords":"Outsourcing; Quality (philosophy); Production (economics); Computer science; Overtime; Product (mathematics); Reduction (mathematics); Operations research; Risk analysis (engineering); Operations management; Reliability engineering; Engineering; Economics; Business; Microeconomics; Marketing","score_opus":0.041567213662970594,"score_gpt":0.26329551698178366,"score_spread":0.22172830331881307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124204803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5815311,0.00014747503,0.4085204,0.008739432,0.00057835976,0.00037224908,0.000020726595,0.000022904636,0.00006736837],"genre_scores_gemma":[0.9969022,0.0000041465287,0.0020188803,0.000075116994,0.00088693463,0.000009221545,0.00004042172,0.000014633867,0.000048420454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989169,0.000017651426,0.0004464585,0.00013499345,0.00036775574,0.000116231175],"domain_scores_gemma":[0.9978173,0.0001997975,0.00050908787,0.00010256851,0.001360066,0.000011186927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059378,0.00011281035,0.00019278319,0.00018057704,0.000066197084,0.0001827503,0.00018752216,0.000034598484,0.000005009588],"category_scores_gemma":[0.00053217245,0.00008883312,0.000054621465,0.00022160691,0.00002702419,0.00046224406,0.00006507268,0.00015968754,2.2351401e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013340848,0.0000738627,0.0012004497,0.000056916848,0.00025905654,0.000005424994,0.00009817135,0.9832195,0.00048747947,0.010995777,0.00036367454,0.003106252],"study_design_scores_gemma":[0.0022717034,0.00003185769,0.0065597724,0.00016214197,0.00014556982,0.000013338602,0.00061535864,0.9868453,0.00065352966,0.0006693931,0.0018689075,0.00016309599],"about_ca_topic_score_codex":0.000091493974,"about_ca_topic_score_gemma":0.000021836937,"teacher_disagreement_score":0.41537112,"about_ca_system_score_codex":0.00005059135,"about_ca_system_score_gemma":0.0000905359,"threshold_uncertainty_score":0.36225092},"labels":[],"label_agreement":null},{"id":"W3124663948","doi":"10.5267/j.ijiec.2020.11.002","title":"Optimizing large scale bin packing problem with hybrid harmony search algorithm","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","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":"Harmony search; Bin packing problem; Mathematical optimization; Computer science; Initialization; Local search (optimization); Algorithm; Benchmark (surveying); Mathematics; Bin","score_opus":0.022741068882713565,"score_gpt":0.24794244359205095,"score_spread":0.22520137470933738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124663948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019178474,0.00019642968,0.97747463,0.00054237264,0.0018672388,0.00009777927,0.0000562767,0.00015233931,0.000434438],"genre_scores_gemma":[0.6519127,0.000081605416,0.3464967,0.00006877977,0.0011772437,0.0000058373466,0.00009790476,0.00008320253,0.00007603848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985124,0.000031862335,0.00052759016,0.00013373974,0.00054110587,0.0002533113],"domain_scores_gemma":[0.9986703,0.00012300462,0.00011160959,0.00009539391,0.00085987366,0.00013984558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028588178,0.00017746656,0.00023120752,0.00038589071,0.0000636164,0.0002542584,0.00026299368,0.000075879485,0.00008256973],"category_scores_gemma":[0.000050788592,0.00017823088,0.00010195681,0.00038724917,0.00001677075,0.00035467604,0.000047853086,0.0005810307,0.000008062001],"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.0000086936225,0.000049543833,0.000120169665,0.000009634515,0.00027060267,0.00016496763,0.00044267735,0.98820174,0.00051928114,0.0001487452,0.0006822017,0.009381742],"study_design_scores_gemma":[0.0020583763,0.00005580395,0.00005657142,0.00047793053,0.00003586154,0.0007327671,0.00017271155,0.98274666,0.0061039417,0.000034633136,0.0072766053,0.0002481386],"about_ca_topic_score_codex":0.000003655787,"about_ca_topic_score_gemma":0.0000019699994,"teacher_disagreement_score":0.63273424,"about_ca_system_score_codex":0.00017273714,"about_ca_system_score_gemma":0.00018478329,"threshold_uncertainty_score":0.7268045},"labels":[],"label_agreement":null},{"id":"W3125320960","doi":"10.5267/j.ijiec.2020.12.002","title":"An evolutionary algorithm for joint bi-criteria location-scheduling problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Executor; Solver; Mathematical optimization; Computer science; Schedule; Scheduling (production processes); Task (project management); Set (abstract data type); Heuristic; Algorithm; Mathematics; Engineering","score_opus":0.029288235596784666,"score_gpt":0.27443763283938566,"score_spread":0.24514939724260099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125320960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019058113,0.00018618218,0.9940409,0.0002358283,0.0033264193,0.00010068984,0.000053889507,0.0001172156,0.000033051034],"genre_scores_gemma":[0.38126498,0.000029141318,0.6170704,0.000017052525,0.0014168381,0.00000950912,0.00015355965,0.000030000283,0.0000085608635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891865,0.000016648264,0.0005497482,0.000117107134,0.00025015374,0.00014766559],"domain_scores_gemma":[0.99833167,0.00013247269,0.00013178577,0.000089384266,0.0012159416,0.00009872988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015797594,0.00013802468,0.00017871155,0.00026209623,0.000049753173,0.00010591909,0.00018732814,0.000098528326,0.00001785499],"category_scores_gemma":[0.00021805303,0.00015775295,0.00008663937,0.0001795569,0.000014318907,0.00037195656,0.000017393324,0.00024664946,0.0000018174412],"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.00000586189,0.00004844477,0.000005743259,0.000010502124,0.0001298247,0.000015397178,0.00009503364,0.97217494,0.0008816113,0.00058233476,0.0003099303,0.025740365],"study_design_scores_gemma":[0.00086127006,0.00005288852,0.00006720743,0.00013489593,0.000028584154,0.0001346605,0.00007252012,0.99279076,0.003104725,0.0010721333,0.0015210446,0.00015930308],"about_ca_topic_score_codex":0.0000020571865,"about_ca_topic_score_gemma":3.5218955e-7,"teacher_disagreement_score":0.37935916,"about_ca_system_score_codex":0.00020508359,"about_ca_system_score_gemma":0.00015392635,"threshold_uncertainty_score":0.64329785},"labels":[],"label_agreement":null},{"id":"W3125430804","doi":"10.5267/j.ijiec.2020.11.001","title":"Designing optimal route for the distribution chain of a rural LPG delivery system","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Context (archaeology); Vehicle routing problem; Benchmark (surveying); Computer science; Constraint (computer-aided design); Mathematical optimization; Pickup; Homogeneous; Integer programming; Liquefied petroleum gas; Linear programming; Routing (electronic design automation); Simulation; Algorithm; Mathematics; Engineering; Artificial intelligence; Embedded system; Mechanical engineering","score_opus":0.02889744660939638,"score_gpt":0.26814512367465065,"score_spread":0.23924767706525427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125430804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063586235,0.00022307938,0.9328544,0.00026468784,0.0027877255,0.00011149703,0.00010080864,0.00006237537,0.000009151794],"genre_scores_gemma":[0.9167734,0.000019605044,0.08230586,0.0000057997045,0.000800012,0.000007561174,0.000056379275,0.000024099394,0.0000073238507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988484,0.000047490867,0.0005913028,0.000058315658,0.00031802958,0.00013646981],"domain_scores_gemma":[0.9977174,0.0009232401,0.00021905775,0.00008298992,0.0010041095,0.00005319261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056470936,0.00011815447,0.0002079054,0.00013074775,0.000054694938,0.00007548852,0.00027414397,0.000087536275,0.0000045058678],"category_scores_gemma":[0.0005938287,0.00010948903,0.0001706809,0.0002543601,0.000017484792,0.00016454486,0.00003226558,0.00025701636,5.59144e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838223,0.000012506569,0.00007962471,0.000016062711,0.00033374352,0.000008368191,0.00013632397,0.98941,0.003218984,0.0011483995,0.00023234359,0.0053817946],"study_design_scores_gemma":[0.0009831185,0.000029849145,0.00015483802,0.00031146785,0.000072532464,0.00016899055,0.00050628185,0.9889794,0.008027498,0.000007631222,0.00066049246,0.000097903154],"about_ca_topic_score_codex":0.000004108491,"about_ca_topic_score_gemma":2.78892e-7,"teacher_disagreement_score":0.85318714,"about_ca_system_score_codex":0.0002708161,"about_ca_system_score_gemma":0.00014498034,"threshold_uncertainty_score":0.4464833},"labels":[],"label_agreement":null},{"id":"W3125828786","doi":"10.5267/j.ijiec.2020.11.003","title":"A specialized genetic algorithm for the fuel consumption heterogeneous fleet vehicle routing problem with bidimensional packing constraints","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Universidad Tecnológica de Pereira","keywords":"Vehicle routing problem; Benchmark (surveying); Fuel efficiency; GRASP; Genetic algorithm; Routing (electronic design automation); Computer science; Set (abstract data type); Mathematical optimization; Reduction (mathematics); Consumption (sociology); Engineering; Automotive engineering; Mathematics; Embedded system","score_opus":0.03647383700614815,"score_gpt":0.28103662421572534,"score_spread":0.2445627872095772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125828786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02702936,0.00028879932,0.9694237,0.0003918974,0.002489129,0.00021933243,0.000048901973,0.000089293564,0.000019569829],"genre_scores_gemma":[0.47020507,0.000055226046,0.52824706,0.00004819057,0.001337263,0.0000148087665,0.000026721771,0.00005409217,0.000011587748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998558,0.000058613943,0.00058408413,0.00013955227,0.0004478824,0.00021185877],"domain_scores_gemma":[0.99783057,0.0008727938,0.00022514211,0.00009898698,0.000884255,0.0000882695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004020663,0.00017780758,0.00023069438,0.0001779459,0.00009277261,0.00018220018,0.00023962486,0.00009796551,0.000044421566],"category_scores_gemma":[0.00025627852,0.00015392993,0.00013213606,0.00022403184,0.00005170692,0.00014191697,0.000035915215,0.00034409988,0.0000024509059],"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.00001762976,0.000022908745,0.00017301065,0.00000687132,0.00046029326,0.000059841015,0.00012514804,0.92960775,0.00082280394,0.00018130495,0.00010891608,0.06841353],"study_design_scores_gemma":[0.0023868107,0.000048465023,0.00036353548,0.00023803356,0.00008808732,0.0009290512,0.000049429076,0.99277145,0.0016870885,0.000063485764,0.001195049,0.0001795064],"about_ca_topic_score_codex":0.000001844685,"about_ca_topic_score_gemma":0.0000014207901,"teacher_disagreement_score":0.4431757,"about_ca_system_score_codex":0.0001829888,"about_ca_system_score_gemma":0.00019490124,"threshold_uncertainty_score":0.627708},"labels":[],"label_agreement":null},{"id":"W3126036933","doi":"10.5267/j.ijiec.2011.03.002","title":"The impact of Weibull data and autocorrelation on the performance of the Shewhart and exponentially weighted moving average control charts","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Autocorrelation; Weibull distribution; Control chart; Statistics; Moving average; EWMA chart; Mathematics; Exponential growth; Exponential distribution; Shewhart individuals control chart; Computer science; Process (computing)","score_opus":0.10590614714053395,"score_gpt":0.3491178405993385,"score_spread":0.24321169345880453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126036933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8561178,0.000047903515,0.14230765,0.00037658852,0.00090387976,0.00013760223,0.000055486245,0.00000402737,0.00004908106],"genre_scores_gemma":[0.9989333,0.00001347404,0.00086128653,0.0000054330703,0.00016820134,0.0000019878114,9.345872e-7,0.0000056356967,0.000009707821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983648,0.00007698625,0.0006586199,0.00010351834,0.0007118721,0.000084216976],"domain_scores_gemma":[0.99558496,0.0030135438,0.00063542975,0.00019280125,0.0005311418,0.00004210761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214262,0.000083904604,0.00014629232,0.000120049546,0.00012039639,0.00008106792,0.0008127821,0.000037066508,0.000016244747],"category_scores_gemma":[0.0033674713,0.000040259023,0.000051041992,0.00016609115,0.00009891163,0.00034890644,0.00014405251,0.00029261835,5.8971904e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052664074,0.000100946585,0.031133154,0.0000049864548,0.00047694703,0.00000644777,0.0014719673,0.88943434,0.001614715,0.012268464,0.00037302924,0.06258837],"study_design_scores_gemma":[0.00076706737,0.00014467693,0.06770692,0.00015848088,0.000020087191,0.000029476112,0.000076919445,0.92816573,0.00053414976,0.002234182,0.000104009625,0.00005830711],"about_ca_topic_score_codex":0.000013180995,"about_ca_topic_score_gemma":6.233308e-7,"teacher_disagreement_score":0.14281556,"about_ca_system_score_codex":0.00003456362,"about_ca_system_score_gemma":0.00009521989,"threshold_uncertainty_score":0.4031421},"labels":[],"label_agreement":null},{"id":"W3153206778","doi":"10.5267/j.ijiec.2021.1.002","title":"Incorporating batching decisions and operational constraints into the scheduling problem of multisite manufacturing environments","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Agencia Nacional de Promoción Científica y Tecnológica; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Universidad Tecnológica Nacional","keywords":"Scheduling (production processes); Standardization; Computer science; Integer programming; Operations research; Production (economics); Batch production; Production planning; Mathematical optimization; Operations management; Engineering; Economics; Mathematics; Microeconomics","score_opus":0.018480571582055762,"score_gpt":0.24428876316960832,"score_spread":0.22580819158755255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153206778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20235133,0.00014821602,0.7964904,0.0002102989,0.0006587131,0.000061834464,0.000011122784,0.000020257612,0.00004786404],"genre_scores_gemma":[0.81356543,0.00007151568,0.18607648,0.000013183539,0.00023278336,0.000001994452,0.00001955141,0.000014979839,0.0000040645814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988853,0.000024870613,0.0005744739,0.00009619641,0.00032173144,0.00009744543],"domain_scores_gemma":[0.9990148,0.0005050727,0.0001871808,0.00006877282,0.00016336318,0.0000608175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002237805,0.00012343632,0.00016476827,0.0001615919,0.00008413811,0.00008334816,0.00017537811,0.00006858899,0.00001124088],"category_scores_gemma":[0.00034275604,0.000111059446,0.000056587185,0.0000805746,0.00005752766,0.00024332134,0.000066519264,0.00036387672,7.3164335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005197695,0.000015810865,0.00017116373,0.00000475575,0.0001350512,0.00001767832,0.0003308063,0.9737477,0.002655237,0.0011124054,0.000009093984,0.02179513],"study_design_scores_gemma":[0.001652936,0.0000399721,0.0013165183,0.00059927057,0.00006206277,0.00032134246,0.00050198333,0.9465526,0.045445886,0.002479926,0.0007522099,0.00027529703],"about_ca_topic_score_codex":0.000005506678,"about_ca_topic_score_gemma":0.0000022008774,"teacher_disagreement_score":0.6112141,"about_ca_system_score_codex":0.00008976258,"about_ca_system_score_gemma":0.000057127898,"threshold_uncertainty_score":0.4528873},"labels":[],"label_agreement":null},{"id":"W3153775560","doi":"10.5267/j.ijiec.2021.1.003","title":"An approach for the pallet-building problem and subsequent loading in a heterogeneous fleet of vehicles with practical constraints","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","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":"Pallet; Truck; Metaheuristic; GRASP; Computer science; Stability (learning theory); Work (physics); Mathematical optimization; Operations research; Algorithm; Engineering; Mathematics; Automotive engineering; Machine learning","score_opus":0.04002140191278727,"score_gpt":0.28316838333605665,"score_spread":0.24314698142326938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153775560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11152898,0.0001379608,0.88744104,0.00035543108,0.0003095542,0.00015183352,0.000015680449,0.000022149778,0.00003736851],"genre_scores_gemma":[0.87212896,0.000022867618,0.12767641,0.000010458664,0.00012963651,0.0000064662067,0.000009181126,0.000015021116,0.0000010038242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.000022326589,0.00037773972,0.0000775935,0.00019180968,0.000100293146],"domain_scores_gemma":[0.9991592,0.00033151964,0.00010855604,0.000050873336,0.00029825512,0.00005155064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025695647,0.00008979744,0.00014803826,0.0001549915,0.000023920085,0.000081839295,0.00011217047,0.000057812427,0.0000048349675],"category_scores_gemma":[0.000110845314,0.00007399454,0.00003864549,0.00014218007,0.00003537729,0.00014834433,0.00001275374,0.00022456973,4.8952494e-8],"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.000025304189,0.000043204276,0.00044406674,0.000016371776,0.00017658278,0.000019709578,0.00024302721,0.99258757,0.0019800868,0.0018360112,0.00001611022,0.0026119591],"study_design_scores_gemma":[0.001335317,0.00006417302,0.00012394201,0.00018152948,0.000028546367,0.00054863543,0.00014666689,0.9951301,0.0021359331,0.00007773353,0.00013558238,0.00009181878],"about_ca_topic_score_codex":0.000002954018,"about_ca_topic_score_gemma":0.0000019287404,"teacher_disagreement_score":0.7606,"about_ca_system_score_codex":0.000056692807,"about_ca_system_score_gemma":0.00009875625,"threshold_uncertainty_score":0.30174097},"labels":[],"label_agreement":null},{"id":"W3153956244","doi":"10.5267/j.ijiec.2021.1.004","title":"A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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":"Heuristics; Flow shop scheduling; Computer science; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Sequence (biology); Heuristic; Due date; Blocking (statistics); Schedule; Mathematics","score_opus":0.044840478383690145,"score_gpt":0.2850856912536375,"score_spread":0.24024521286994732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153956244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011470909,0.00021981154,0.9859252,0.0004252664,0.0014971319,0.00023549552,0.00010927206,0.000040675448,0.000076220334],"genre_scores_gemma":[0.64152783,0.000014467975,0.3578916,0.0000119168135,0.00044266367,0.000016270818,0.00006587024,0.000022587308,0.000006773796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.000038996895,0.0005648997,0.00010165134,0.0008145835,0.00011738762],"domain_scores_gemma":[0.99575895,0.0007244836,0.00023271258,0.00007327111,0.0031574962,0.000053090545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005087847,0.00013535791,0.00019652594,0.00018333895,0.00005923323,0.00008823062,0.00021366862,0.00007325054,0.000034352157],"category_scores_gemma":[0.00041712442,0.00011334643,0.00009345279,0.00022956716,0.000041748608,0.00014416645,0.000020058378,0.00026365704,7.110249e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029062994,0.000029112367,0.00008206011,0.000008585831,0.00063769217,0.0000076129863,0.00025223862,0.98956364,0.00004609031,0.0010435474,0.00011460061,0.008185779],"study_design_scores_gemma":[0.0022105833,0.000045873177,0.00005408815,0.00018441115,0.00018055103,0.0002620665,0.00025689663,0.9955254,0.00036445967,0.00071270374,0.000086627406,0.00011633926],"about_ca_topic_score_codex":0.000002099501,"about_ca_topic_score_gemma":0.0000015497297,"teacher_disagreement_score":0.630057,"about_ca_system_score_codex":0.000178078,"about_ca_system_score_gemma":0.00048546988,"threshold_uncertainty_score":0.46221334},"labels":[],"label_agreement":null},{"id":"W3153993802","doi":"10.5267/j.ijiec.2021.2.001","title":"GRASP with ALNS for solving the location routing problem of infectious waste collection in the Northeast of Thailand","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Greedy randomized adaptive search procedure; GRASP; Vehicle routing problem; Heuristic; Greedy algorithm; Mathematical optimization; Computer science; Incineration; Routing (electronic design automation); Operations research; Mathematics; Operations management; Engineering; Waste management","score_opus":0.02365954347988628,"score_gpt":0.23135291246155384,"score_spread":0.20769336898166757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153993802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7410872,0.000041034382,0.25285795,0.004127707,0.0011113435,0.00040560437,0.0000041328894,0.000012638309,0.00035241357],"genre_scores_gemma":[0.99893004,0.000004265688,0.00052526745,0.000051945448,0.0004445183,0.000010941787,0.000015347594,0.0000064042215,0.0000112937305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990455,0.000013190908,0.00049001345,0.00006723447,0.0003086162,0.00007544592],"domain_scores_gemma":[0.9983372,0.0001427866,0.0003058569,0.00006395014,0.0011452843,0.000004883856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058295473,0.00007083743,0.00011674566,0.0002502613,0.000059675895,0.00007214861,0.00019574616,0.00002752255,0.000006826079],"category_scores_gemma":[0.0003093748,0.000048752663,0.0000611526,0.00062974024,0.000018556575,0.00027313593,0.00002832418,0.00013346692,4.1216478e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004213672,0.000090703674,0.011401268,0.00003887802,0.00011070829,0.0000015730996,0.00040927427,0.9793143,0.0000983393,0.0065712365,0.0002211166,0.0017004422],"study_design_scores_gemma":[0.0035517528,0.000102996964,0.021117957,0.00075862295,0.00016411289,0.00004257785,0.0042043836,0.9664251,0.00035163265,0.00083933555,0.002252147,0.00018934133],"about_ca_topic_score_codex":0.00024219087,"about_ca_topic_score_gemma":0.00037652018,"teacher_disagreement_score":0.25784284,"about_ca_system_score_codex":0.000044107386,"about_ca_system_score_gemma":0.00009157927,"threshold_uncertainty_score":0.19880758},"labels":[],"label_agreement":null},{"id":"W3155015670","doi":"10.5267/j.ijiec.2021.3.002","title":"Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"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; Tardiness; Crossover; Computer science; Sorting; Particle swarm optimization; Genetic algorithm; Scheduling (production processes); Total cost; Multi-objective optimization; Algorithm; Job shop scheduling; Mathematics; Schedule; Artificial intelligence","score_opus":0.04832974622145165,"score_gpt":0.29695585828675786,"score_spread":0.24862611206530622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155015670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016247267,0.00042730029,0.9811266,0.00029155245,0.001576789,0.00019934484,0.000047888254,0.00007292488,0.0000103484845],"genre_scores_gemma":[0.22648813,0.000038823822,0.77263725,0.000020359412,0.00065949926,0.00003732224,0.00006516882,0.00004378603,0.000009676685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826354,0.000053890897,0.00087592023,0.00019802335,0.0003744768,0.00023412507],"domain_scores_gemma":[0.9988731,0.0003343932,0.00015917336,0.00009586978,0.00039367354,0.0001437558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044874282,0.00022728692,0.00039578223,0.00044982386,0.00004716402,0.0001772751,0.00027570888,0.000109879125,0.00003659835],"category_scores_gemma":[0.0003606137,0.00023846235,0.00022467547,0.00022028158,0.00001971057,0.0003500401,0.000039895083,0.0004872063,0.000002386207],"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.000022318553,0.00013152437,0.00014234739,0.000008306568,0.00074987963,0.000073275856,0.0003223931,0.99511987,0.00033342987,0.00048211057,0.000007949063,0.0026065933],"study_design_scores_gemma":[0.0031788575,0.00005313077,0.00012446096,0.0001046611,0.00018428614,0.00012781906,0.00016613604,0.99518615,0.0004146514,0.00019588367,0.000045546683,0.00021840553],"about_ca_topic_score_codex":0.000009601856,"about_ca_topic_score_gemma":0.000004497057,"teacher_disagreement_score":0.21024087,"about_ca_system_score_codex":0.00024828906,"about_ca_system_score_gemma":0.00011049347,"threshold_uncertainty_score":0.9724213},"labels":[],"label_agreement":null},{"id":"W3155323166","doi":"10.5267/j.ijiec.2021.3.001","title":"Customer order scheduling with job-based processing on a single-machine to minimize the total completion time","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Computer science; Mathematical optimization; Single-machine scheduling; Order processing; Job shop scheduling; Scheduling (production processes); Schedule; Industrial engineering; Operations research; Engineering; Mathematics; Marketing; Supply chain","score_opus":0.02112532165083318,"score_gpt":0.24267594473780443,"score_spread":0.22155062308697127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155323166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065408126,0.00007183684,0.9305363,0.002219799,0.0013485133,0.00009375956,0.000017615985,0.00011770439,0.00018631361],"genre_scores_gemma":[0.7664379,0.0000016103861,0.23236962,0.00018479247,0.00088201027,0.000005988242,0.00003355438,0.000046576217,0.000037988037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987242,0.000030256242,0.0004308805,0.00011921533,0.00053870794,0.00015674175],"domain_scores_gemma":[0.9984676,0.0002550132,0.00011281689,0.00009120606,0.0009647426,0.00010859973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876379,0.00016983293,0.00019805969,0.0003165345,0.00007411782,0.00021277125,0.00021852326,0.00007209882,0.000056700144],"category_scores_gemma":[0.000363784,0.00013604772,0.00007372791,0.00059239595,0.000018098439,0.00013277601,0.00001955818,0.00043009993,0.000023238194],"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.000050400973,0.000056158355,0.000040750016,0.0000040463756,0.00012365301,0.00003447512,0.00011512089,0.9937973,0.0011664274,0.000049856877,0.00009626589,0.004465561],"study_design_scores_gemma":[0.0013495715,0.0000640605,0.0002467932,0.00036931256,0.000033985216,0.0001764379,0.00005104964,0.995542,0.0015724951,0.000003341866,0.00042496098,0.00016597837],"about_ca_topic_score_codex":0.0000020532777,"about_ca_topic_score_gemma":4.772818e-7,"teacher_disagreement_score":0.7010297,"about_ca_system_score_codex":0.00017415643,"about_ca_system_score_gemma":0.00017656539,"threshold_uncertainty_score":0.5547865},"labels":[],"label_agreement":null},{"id":"W3155585954","doi":"10.5267/j.ijiec.2021.2.002","title":"A biobjective capacitated vehicle routing problem using metaheuristic ILS and decomposition","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Mathematical optimization; Vehicle routing problem; Sorting; Benchmark (surveying); Metaheuristic; Multi-objective optimization; Decomposition; Tabu search; Set (abstract data type); Computer science; Iterated local search; Routing (electronic design automation); Genetic algorithm; Mathematics; Algorithm","score_opus":0.034552938549428196,"score_gpt":0.2983848979352959,"score_spread":0.2638319593858677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155585954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39541686,0.00012776062,0.60294914,0.00014631728,0.0011559562,0.00005864274,0.000014048841,0.000076577184,0.000054673943],"genre_scores_gemma":[0.8226794,0.000015547477,0.17686258,0.000014084766,0.00038488873,0.0000013625129,0.000010837401,0.000027938035,0.0000033423353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885017,0.000075548494,0.00051355426,0.00011207629,0.00028382093,0.00016483974],"domain_scores_gemma":[0.9986045,0.00031569166,0.00016855185,0.000058596168,0.00075032015,0.00010233433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878826,0.00014034241,0.0002188393,0.0003177337,0.000057208123,0.00015173927,0.00012629485,0.00009322229,0.000010766949],"category_scores_gemma":[0.000506868,0.00016106007,0.0000758363,0.00036518497,0.000020051151,0.0002948159,0.000035940437,0.00036572883,0.0000010827719],"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.000007956483,0.00001938223,0.00027035066,0.0000069303064,0.00027666005,0.000055242752,0.00030813986,0.9746741,0.020743648,0.00032611954,0.000030744075,0.003280711],"study_design_scores_gemma":[0.0009672504,0.000024655998,0.00034759965,0.00023378838,0.00006934227,0.000562305,0.00012338754,0.98971325,0.0075539974,0.00014395828,0.000105396015,0.00015507858],"about_ca_topic_score_codex":0.000007773313,"about_ca_topic_score_gemma":8.288246e-7,"teacher_disagreement_score":0.42726254,"about_ca_system_score_codex":0.00024782275,"about_ca_system_score_gemma":0.00012209412,"threshold_uncertainty_score":0.65678394},"labels":[],"label_agreement":null},{"id":"W3167976392","doi":"10.5267/j.ijiec.2021.5.003","title":"A homogenously weighted moving average scheme for observations under the effect of serial dependence and measurement inaccuracy","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Independent and identically distributed random variables; Scheme (mathematics); Variance (accounting); Observational error; Statistics; Monte Carlo method; Sampling scheme; Algorithm; Dependency (UML); Computer science; Mathematics; Process (computing); Autocorrelation; Constant (computer programming); Random variable; Artificial intelligence","score_opus":0.13819198507868338,"score_gpt":0.3700394960346386,"score_spread":0.2318475109559552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167976392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776265,0.00013653957,0.7195973,0.0007940566,0.0016821285,0.00012020063,0.00002893242,0.00000747962,0.0000068552526],"genre_scores_gemma":[0.964283,0.000006287967,0.035018317,0.00001788957,0.0006406974,0.000008493698,0.0000034820232,0.0000105214185,0.000011320836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973855,0.00009909698,0.0008464938,0.00015812744,0.0013847072,0.00012608038],"domain_scores_gemma":[0.99116224,0.0053079035,0.0004961118,0.000118695934,0.0028396246,0.00007544697],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0016694785,0.00011476105,0.00025416416,0.00019099972,0.00011817126,0.0001970326,0.00047445451,0.00005994232,0.000010858477],"category_scores_gemma":[0.01490566,0.000083030616,0.00010700272,0.00037352927,0.000040783445,0.0003926571,0.00009988027,0.00027469697,6.8508785e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016892319,0.000042887394,0.0018828764,0.00001128031,0.00028014102,0.000025334995,0.00024198231,0.9555763,0.011473705,0.0072150086,0.00014544232,0.022936102],"study_design_scores_gemma":[0.011660634,0.0010707261,0.015341595,0.0011223488,0.0002682801,0.00063742057,0.0011163811,0.86776465,0.05098668,0.046225388,0.0031428721,0.0006630233],"about_ca_topic_score_codex":0.000007757076,"about_ca_topic_score_gemma":0.000004687315,"teacher_disagreement_score":0.6866565,"about_ca_system_score_codex":0.00013970108,"about_ca_system_score_gemma":0.0002761258,"threshold_uncertainty_score":0.9933922},"labels":[],"label_agreement":null},{"id":"W3169704021","doi":"10.5267/j.ijiec.2021.5.005","title":"An explicit evolutionary approach for multiobjective energy consumption planning considering user preferences in smart homes","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Smart Grid Energy Management","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":"Junta de Andalucía; Universidad de la República Uruguay; Universidad Nacional del Sur; Consejo Nacional de Investigaciones Científicas y Técnicas; European Commission; Ministerio de Ciencia e Innovación; Universidad de Málaga; Agencia Nacional de Investigación e Innovación","keywords":"Electricity; Schedule; Computer science; Context (archaeology); Mains electricity; Consumption (sociology); Greedy algorithm; Multi-objective optimization; Evolutionary algorithm; Energy consumption; Set (abstract data type); Service (business); Mathematical optimization; Operations research; Engineering; Machine learning; Business; Algorithm; Marketing; Mathematics","score_opus":0.0487435928434825,"score_gpt":0.2714859075735069,"score_spread":0.22274231473002437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169704021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16970217,0.0003068782,0.8271005,0.000043353873,0.0024930108,0.000090804,0.00002249568,0.000086174,0.00015462277],"genre_scores_gemma":[0.95094633,0.0000386922,0.048091635,0.000017820967,0.00073067687,0.000034999142,0.0001038722,0.000027967673,0.000007983587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881613,0.00003506736,0.0005327014,0.00015104574,0.000290607,0.0001744436],"domain_scores_gemma":[0.99914485,0.00023893762,0.000110116904,0.00008495521,0.00034573424,0.00007537989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734592,0.00015685169,0.00021900039,0.00053294474,0.00003521259,0.00009278174,0.00021686431,0.00010065841,0.000014658545],"category_scores_gemma":[0.00015197805,0.00018195149,0.00008565726,0.0001856236,0.000013987164,0.00045023824,0.000032067197,0.00023642361,5.5137434e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026601534,0.00007054946,0.0038485397,0.000011991462,0.00025061413,0.000030999418,0.00020361601,0.9910835,0.00054511346,0.00188316,0.00031230482,0.0017329793],"study_design_scores_gemma":[0.0016158829,0.00004668505,0.006378279,0.00019182771,0.000026125936,0.00009154198,0.00033215928,0.9877605,0.0014483465,0.000140852,0.0017626748,0.0002051686],"about_ca_topic_score_codex":0.000014840483,"about_ca_topic_score_gemma":0.0000045046786,"teacher_disagreement_score":0.78124416,"about_ca_system_score_codex":0.0003005223,"about_ca_system_score_gemma":0.0000908386,"threshold_uncertainty_score":0.7419766},"labels":[],"label_agreement":null},{"id":"W3169766872","doi":"10.5267/j.ijiec.2021.5.004","title":"New models and algorithms to solve integrated problems of production planning and control taking into account worker skills in flexible manufacturing systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"European Regional Development Fund; European Commission","keywords":"Workstation; Production (economics); Production planning; Computer-integrated manufacturing; Control (management); Manufacturing execution system; Manufacturing engineering; Computer science; Process (computing); Cellular manufacturing; Flexible manufacturing system; Industrial engineering; Production control; Discrete manufacturing; Product (mathematics); Process development execution system; Engineering; Operations management; Scheduling (production processes); Artificial intelligence","score_opus":0.02416520006938427,"score_gpt":0.2587744399773354,"score_spread":0.23460923990795113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169766872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15486713,0.00080418616,0.84188825,0.00019271813,0.0020576862,0.00012717051,0.000005791777,0.000043553766,0.000013516706],"genre_scores_gemma":[0.88976175,0.000049698876,0.10964636,0.000009752451,0.00048467176,0.000004926426,0.000008528342,0.000023795272,0.000010507418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.0000167164,0.0006141672,0.00013393821,0.0002751159,0.00012883225],"domain_scores_gemma":[0.99917877,0.0001354697,0.0001729552,0.00005726373,0.0003494525,0.00010611889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028086678,0.00014119537,0.00027017973,0.00053740863,0.00002400845,0.00013396272,0.00011082153,0.000096113334,0.0000034937075],"category_scores_gemma":[0.00023899521,0.00014774014,0.000035667763,0.00026088045,0.000009838816,0.000333175,0.000028444212,0.00032944896,2.9524017e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013800392,0.000017010821,0.000257436,0.00001817037,0.00014124546,0.00001583753,0.0008391154,0.9833987,0.00069826155,0.000079556325,0.000037313777,0.014483551],"study_design_scores_gemma":[0.0012507911,0.000028532862,0.0005335243,0.0014615343,0.000022347065,0.00015304134,0.00032874075,0.9923768,0.0034793825,0.00010992839,0.00011113998,0.0001442456],"about_ca_topic_score_codex":0.00005985276,"about_ca_topic_score_gemma":0.000003290617,"teacher_disagreement_score":0.73489463,"about_ca_system_score_codex":0.00014017308,"about_ca_system_score_gemma":0.00010451624,"threshold_uncertainty_score":0.6024668},"labels":[],"label_agreement":null},{"id":"W3170059756","doi":"10.5267/j.ijiec.2021.5.001","title":"A producer-retailer incorporated multi-item EPQ problem with delayed differentiation, the expedited rate for common parts, multi-delivery and scrap","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Scrap; Supply chain; Computer science; Convexity; Operations management; Operations research; Operating expense; Hessian matrix; Holding cost; Reliability engineering; Business; Economics; Engineering; Marketing; Mathematics","score_opus":0.04447846428487876,"score_gpt":0.24256904488948133,"score_spread":0.19809058060460258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170059756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6502177,0.00022120633,0.3359332,0.008701163,0.0037051002,0.0010183761,0.000035403955,0.00009858164,0.0000692605],"genre_scores_gemma":[0.99335927,0.00001021928,0.0041686394,0.0003824783,0.0017453774,0.00003770162,0.00016108184,0.000026587275,0.000108630236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888843,0.000025172532,0.00049688993,0.00016295562,0.0002850593,0.00014147157],"domain_scores_gemma":[0.9979456,0.000178332,0.00047142032,0.00009151576,0.0012894413,0.00002369643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036463595,0.00016028942,0.0001879741,0.00029203633,0.00012785719,0.00042435632,0.00023060614,0.000054712753,0.000025677366],"category_scores_gemma":[0.00024399182,0.00012095644,0.00007369432,0.00030715292,0.000031981424,0.000595842,0.00009119145,0.0002181562,0.0000026632815],"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.0006179425,0.00091023394,0.032037668,0.00013559054,0.0025386277,0.00013972471,0.0005686275,0.9217144,0.0017814836,0.011432087,0.017861513,0.010262071],"study_design_scores_gemma":[0.007246997,0.00006373961,0.010869597,0.00035114383,0.00023308668,0.00003635373,0.00047492696,0.94419867,0.00038843768,0.00020077628,0.03564172,0.00029454962],"about_ca_topic_score_codex":0.00004527576,"about_ca_topic_score_gemma":0.00003164788,"teacher_disagreement_score":0.3431416,"about_ca_system_score_codex":0.00005299269,"about_ca_system_score_gemma":0.00008342873,"threshold_uncertainty_score":0.49324605},"labels":[],"label_agreement":null},{"id":"W3171104013","doi":"10.5267/j.ijiec.2021.5.002","title":"Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Tardiness; Computer science; Heuristics; Mathematical optimization; Job shop scheduling; Preventive maintenance; Scheduling (production processes); Metaheuristic; Production (economics); Constructive; Maximization; Operations research; Schedule; Algorithm; Reliability engineering; Mathematics; Engineering; Economics","score_opus":0.012505583434054958,"score_gpt":0.22199248858988077,"score_spread":0.20948690515582583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171104013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3030317,0.0002261851,0.6860559,0.00025942695,0.009989515,0.0001818568,0.00002373854,0.00006696536,0.00016467049],"genre_scores_gemma":[0.96509767,0.000031348893,0.03396854,0.0000038490844,0.0007590006,0.000006213074,0.00003415498,0.00002484075,0.00007438746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988498,0.000028599849,0.0005743755,0.00010193535,0.0003405265,0.000104743725],"domain_scores_gemma":[0.9982725,0.00008469484,0.00017595204,0.00007131185,0.0013509912,0.000044545086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017156005,0.000113067494,0.00021681334,0.0003305025,0.000013062666,0.000045643235,0.00011362675,0.00007405839,0.000012520802],"category_scores_gemma":[0.000443934,0.0001119348,0.000056809855,0.0004432319,0.000014814769,0.00032065698,0.000014345406,0.00024192315,0.0000015862803],"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.00003266069,0.000051569787,0.00027135876,0.000017703456,0.00016242158,0.000034934274,0.00015365638,0.99754596,0.0004041131,0.00011474339,0.00013150559,0.0010793963],"study_design_scores_gemma":[0.0012335989,0.000040078114,0.00067026104,0.0007684524,0.000024173338,0.00028516163,0.0001931589,0.99455374,0.0019609297,0.0000071926497,0.0001348055,0.00012846099],"about_ca_topic_score_codex":0.0000058464643,"about_ca_topic_score_gemma":0.0000010382155,"teacher_disagreement_score":0.6620659,"about_ca_system_score_codex":0.00015001821,"about_ca_system_score_gemma":0.00013593766,"threshold_uncertainty_score":0.45645687},"labels":[],"label_agreement":null},{"id":"W3171468365","doi":"10.5267/j.ijiec.2021.4.002","title":"Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Algorithm; Vehicle routing problem; Metaheuristic; Mathematical optimization; Set (abstract data type); Genetic algorithm; Computer science; Routing (electronic design automation); Hybrid algorithm (constraint satisfaction); Weed; Mathematics","score_opus":0.02588579521446102,"score_gpt":0.2501091145931175,"score_spread":0.2242233193786565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171468365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3666318,0.00009681451,0.6320146,0.00031616905,0.0006988458,0.00008670615,0.000020862894,0.00006214391,0.000072071736],"genre_scores_gemma":[0.84765625,0.000016608969,0.15202829,0.000008104341,0.000240437,0.0000026508878,0.000015515061,0.000024895713,0.0000072429884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988934,0.00004620984,0.00050393434,0.00009562783,0.00033022396,0.00013060862],"domain_scores_gemma":[0.9983883,0.0003195246,0.00021857995,0.00006138304,0.0009345448,0.00007770539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029700054,0.00012479619,0.00022147912,0.00025271194,0.00003176878,0.000062557825,0.00013490474,0.00006198555,0.000007971506],"category_scores_gemma":[0.00040610507,0.00012888899,0.000052729116,0.0002884116,0.000029854898,0.00025346907,0.000031598905,0.00031525164,5.3690746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013576333,0.000022043356,0.00039047102,0.000013129834,0.00027274434,0.000047946334,0.00024162432,0.97508633,0.017204637,0.00020054575,0.000066927336,0.006440051],"study_design_scores_gemma":[0.0018243582,0.00008017035,0.00068867416,0.00048383127,0.000053728036,0.0005367894,0.00014050398,0.9610263,0.03478892,0.000070468384,0.00014027499,0.00016596999],"about_ca_topic_score_codex":0.000012188179,"about_ca_topic_score_gemma":0.000001908741,"teacher_disagreement_score":0.48102447,"about_ca_system_score_codex":0.00011365426,"about_ca_system_score_gemma":0.00015963624,"threshold_uncertainty_score":0.52559406},"labels":[],"label_agreement":null},{"id":"W3205317538","doi":"10.5267/j.ijiec.2021.6.001","title":"A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Tabu search; Vehicle routing problem; Benchmark (surveying); Energy consumption; Homogeneous; Computer science; Mathematical optimization; Selection (genetic algorithm); Routing (electronic design automation); Truck; Operations research; Engineering; Automotive engineering; Mathematics; Artificial intelligence; Computer network","score_opus":0.033558854195274,"score_gpt":0.2816800808341932,"score_spread":0.24812122663891922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205317538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741128,0.00019783259,0.9294805,0.0012589715,0.0012731365,0.00018927497,0.00002772724,0.00010538429,0.00005589049],"genre_scores_gemma":[0.8672597,0.000026320822,0.13155557,0.000035335084,0.0009922578,0.00001357606,0.000025945943,0.000057088982,0.00003423283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873525,0.000052082094,0.00046811596,0.00011323534,0.000424879,0.00020643928],"domain_scores_gemma":[0.99766845,0.00073668757,0.00011725435,0.00011039615,0.0012880854,0.00007915055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005831814,0.00014589587,0.0001930269,0.00017904889,0.00010583307,0.00020209765,0.00032154637,0.00008665278,0.000014009041],"category_scores_gemma":[0.00027193036,0.00011945965,0.00010442775,0.00044521672,0.00002152649,0.00016262491,0.0000325455,0.00043566272,0.0000015532338],"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.000029694738,0.000021440697,0.00022662788,0.0000071335635,0.00028471847,0.00004991068,0.00021697213,0.9884347,0.0025452927,0.00053005555,0.0002376966,0.0074157678],"study_design_scores_gemma":[0.0015931115,0.000058726968,0.0001399642,0.00016629226,0.00005990633,0.0003889771,0.00011404113,0.984421,0.010384883,0.00002772491,0.0024969503,0.00014837955],"about_ca_topic_score_codex":0.0000049968094,"about_ca_topic_score_gemma":0.0000019331283,"teacher_disagreement_score":0.7998484,"about_ca_system_score_codex":0.00016412135,"about_ca_system_score_gemma":0.00021941194,"threshold_uncertainty_score":0.48714232},"labels":[],"label_agreement":null},{"id":"W3206030518","doi":"10.5267/j.ijiec.2021.7.003","title":"A hybrid approach of simulation and metaheuristic for the polyhedra packing problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Cuboid; Polyhedron; Packing problems; Mathematical optimization; Mathematics; Computer science; Heuristic; Algorithm; Combinatorics; Geometry","score_opus":0.036401805576588696,"score_gpt":0.27007988069348837,"score_spread":0.23367807511689967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206030518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005165227,0.00030486315,0.99347264,0.0001196097,0.00076664897,0.00009016056,0.00002378706,0.000024624445,0.000032455384],"genre_scores_gemma":[0.9214246,0.00003332629,0.07816205,0.000005536854,0.00033374864,0.000003791549,0.00001783448,0.000014354367,0.000004717894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933934,0.000009616261,0.0003547012,0.00005848696,0.00016491393,0.00007295791],"domain_scores_gemma":[0.99872,0.0006658949,0.00012930713,0.000049784645,0.00040547966,0.00002951956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014388956,0.00007895138,0.00013233058,0.00011594836,0.000029093642,0.000045473756,0.00010576387,0.000033943834,0.0000021306093],"category_scores_gemma":[0.00043573914,0.0000681169,0.000059640333,0.00007133111,0.0000164612,0.00010883053,0.000017752567,0.0001514893,8.243736e-8],"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.000010322737,0.000014359258,0.000010575067,0.000016172367,0.0001854217,0.0000027183967,0.00009937741,0.9915741,0.0001420033,0.0013908722,0.000037747024,0.0065163197],"study_design_scores_gemma":[0.0005660595,0.000019083876,0.000063824526,0.000056254063,0.000058813162,0.000055486787,0.000041358737,0.9962204,0.0013469396,0.0007746347,0.0007333321,0.00006381832],"about_ca_topic_score_codex":0.0000012777512,"about_ca_topic_score_gemma":1.2631796e-7,"teacher_disagreement_score":0.9162594,"about_ca_system_score_codex":0.000041149728,"about_ca_system_score_gemma":0.000037439997,"threshold_uncertainty_score":0.27777264},"labels":[],"label_agreement":null},{"id":"W3206345388","doi":"10.5267/j.ijiec.2021.7.001","title":"MILP of multitask scheduling of geographically distributed maintenance tasks","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"BIM and Construction Integration","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":"Serviceability (structure); Computer science; Scheduling (production processes); Solver; Integer programming; Operations research; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Distributed computing; Engineering; Computer network; Mathematics","score_opus":0.013708939168181906,"score_gpt":0.2302422794096966,"score_spread":0.2165333402415147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206345388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41553676,0.00034114573,0.5800689,0.00027564052,0.0034433769,0.000053391635,0.00016194934,0.00004188322,0.00007695914],"genre_scores_gemma":[0.98546904,0.00006420195,0.014093699,0.0000074784193,0.00030669724,0.00000150693,0.000040662177,0.000013127708,0.000003584696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986974,0.000017845621,0.0007776814,0.000070828995,0.00033609176,0.000100137426],"domain_scores_gemma":[0.9981185,0.00015170108,0.00024156552,0.00007714929,0.0013515152,0.00005953707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013841003,0.00010667419,0.00023059921,0.00030177383,0.000015210225,0.000025127692,0.00020395097,0.00010804178,0.00003530203],"category_scores_gemma":[0.00039532388,0.000110994704,0.00017348511,0.00035970987,0.000039476185,0.00015941155,0.000021167292,0.000320943,8.086185e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001901753,0.000042334483,0.00083015393,0.000016162207,0.00036076552,0.000017967468,0.00005480975,0.9699752,0.016040476,0.0057727396,0.00020790155,0.0066625206],"study_design_scores_gemma":[0.0043228236,0.00014730034,0.006268613,0.0017697203,0.00016167646,0.00067367725,0.00040968173,0.89646846,0.08343426,0.0010789254,0.004834531,0.00043034757],"about_ca_topic_score_codex":0.000007627522,"about_ca_topic_score_gemma":0.000002147093,"teacher_disagreement_score":0.5699323,"about_ca_system_score_codex":0.00006559234,"about_ca_system_score_gemma":0.000120869125,"threshold_uncertainty_score":0.45262328},"labels":[],"label_agreement":null},{"id":"W3206545747","doi":"10.5267/j.ijiec.2021.9.003","title":"Mathematical modeling for a multiproduct manufacturing system featuring postponement, external suppliers, overtime, and scrap","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Postponement; Overtime; Scrap; Quality (philosophy); Outsourcing; Process (computing); Computer science; Build to order; Order (exchange); Operations research; Function (biology); Lead time; Risk analysis (engineering); Manufacturing engineering; Industrial engineering; Production (economics); Operations management; Engineering; Economics; Business; Marketing","score_opus":0.03253996226697931,"score_gpt":0.23942784646214532,"score_spread":0.20688788419516602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206545747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40050048,0.00022540225,0.5921733,0.0019925344,0.003966594,0.0003924784,0.000015163734,0.00010157729,0.00063249504],"genre_scores_gemma":[0.9872,0.000004964553,0.009075863,0.00010189108,0.0034941614,0.0000096070335,0.00002144862,0.000027116026,0.00006492559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987462,0.0000068627,0.00052342284,0.00017174841,0.00037819386,0.00017352849],"domain_scores_gemma":[0.99906886,0.00008696529,0.0002328018,0.00008363743,0.0004979036,0.000029812203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034511258,0.00015103153,0.00021169103,0.00037969652,0.00008835914,0.00040380098,0.00021930855,0.000047064852,0.000053506228],"category_scores_gemma":[0.00027683654,0.00015297031,0.00011398695,0.000108272136,0.000011947777,0.00057426275,0.00013943954,0.00019269991,0.000009536542],"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.00014263301,0.00013217854,0.00024248683,0.00025265987,0.00052645575,0.00015693155,0.00007988904,0.95917875,0.0015847558,0.029310659,0.0011343635,0.007258268],"study_design_scores_gemma":[0.0023890322,0.00002000292,0.00011587609,0.0007873681,0.00011057803,0.00016478186,0.00038467217,0.98842466,0.0011864054,0.0006340232,0.005584073,0.00019850781],"about_ca_topic_score_codex":0.000011997388,"about_ca_topic_score_gemma":7.8185724e-7,"teacher_disagreement_score":0.58669955,"about_ca_system_score_codex":0.0001301985,"about_ca_system_score_gemma":0.000040131443,"threshold_uncertainty_score":0.62379485},"labels":[],"label_agreement":null},{"id":"W3206656095","doi":"10.5267/j.ijiec.2021.7.002","title":"Integrated modeling of the peer-to-peer markets in the energy industry","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Smart Grid Energy Management","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":"Computer science; Smart grid; Isolation (microbiology); Grid; Decomposition; Integer programming; Industrial engineering; Mathematical optimization; Scale (ratio); Linear programming; Operations research; Electricity; Distributed computing; Engineering; Mathematics; Algorithm","score_opus":0.0256908840809342,"score_gpt":0.24107197652037834,"score_spread":0.21538109243944414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206656095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6524521,0.000114551716,0.32677063,0.009071112,0.010061157,0.0001183886,0.000031772066,0.00005149914,0.0013287913],"genre_scores_gemma":[0.9976737,0.0000070644246,0.001439065,0.00012800071,0.00063931517,0.0000055109804,0.000010445005,0.000020610507,0.00007632087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982385,0.00006249022,0.0006068401,0.00008493815,0.000864975,0.00014225242],"domain_scores_gemma":[0.9986496,0.00019250979,0.00009030187,0.00015118938,0.00086714036,0.00004923907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305158,0.00013123089,0.00016894253,0.00033294797,0.00002299568,0.00007421174,0.0006768126,0.00013054155,0.000024897661],"category_scores_gemma":[0.0007769281,0.000098745164,0.000117450014,0.0007013936,0.00001197912,0.00012393389,0.0000856749,0.0007346663,9.742114e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008847188,0.00003146526,0.00021685075,0.0000024465526,0.0001519215,0.0000351921,0.00021559006,0.99210584,0.00028015077,0.0014449852,0.003878328,0.001628386],"study_design_scores_gemma":[0.00062781887,0.000012855179,0.0011229541,0.00024378889,0.000023707347,0.0000903625,0.00033272462,0.9795832,0.0010635717,0.00012072596,0.016666526,0.000111759655],"about_ca_topic_score_codex":0.00003608109,"about_ca_topic_score_gemma":0.000015235551,"teacher_disagreement_score":0.34522158,"about_ca_system_score_codex":0.00019171662,"about_ca_system_score_gemma":0.00012762228,"threshold_uncertainty_score":0.4026711},"labels":[],"label_agreement":null},{"id":"W3206683684","doi":"10.5267/j.ijiec.2021.8.002","title":"Discounted costs and obsolescence with the Joint replenishment problem","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Fundação para a Ciência e a Tecnologia","keywords":"Obsolescence; Sizing; Economics; Order (exchange); Holding cost; Value (mathematics); Upgrade; Joint (building); Economic order quantity; Present value; Econometrics; Sensitivity (control systems); Minification; Mathematical optimization; Operations research; Computer science; Operations management; Mathematics; Engineering; Supply chain; Business; Marketing","score_opus":0.02590694352842328,"score_gpt":0.22521729948569347,"score_spread":0.1993103559572702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206683684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69889617,0.00052009936,0.14837755,0.138593,0.0076402836,0.0008074699,0.000016467055,0.00015951699,0.0049894555],"genre_scores_gemma":[0.99697393,0.000010286633,0.0008156184,0.00063532847,0.001480966,0.0000047092103,0.000011532924,0.000011348806,0.00005630544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991277,0.000008083347,0.00027878897,0.00009861475,0.00039007582,0.000096758784],"domain_scores_gemma":[0.99910975,0.000052197993,0.00023347622,0.00007051683,0.0005192598,0.000014815937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024155072,0.00009339765,0.00010895788,0.00015606129,0.00005838527,0.00037592862,0.0001843112,0.000024371746,0.0000374201],"category_scores_gemma":[0.00011547727,0.000065474516,0.000045542172,0.00020071185,0.000030785897,0.00043626348,0.000105288855,0.00019613744,0.0000039258953],"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.00024395462,0.00051901484,0.008671613,0.00009559699,0.0016667475,0.0008637423,0.0007825525,0.75046504,0.0021674244,0.13512887,0.055624943,0.04377047],"study_design_scores_gemma":[0.011754589,0.00022079922,0.017591618,0.003375782,0.00054775405,0.0009446425,0.0063951556,0.34854186,0.0014533707,0.0017601815,0.6062429,0.0011713904],"about_ca_topic_score_codex":0.000029590265,"about_ca_topic_score_gemma":0.000009243536,"teacher_disagreement_score":0.55061793,"about_ca_system_score_codex":0.00008505238,"about_ca_system_score_gemma":0.00005376972,"threshold_uncertainty_score":0.36250883},"labels":[],"label_agreement":null},{"id":"W3206692493","doi":"10.5267/j.ijiec.2021.9.001","title":"Optimization of Bayesian repetitive group sampling plan for quality determination in Pharmaceutical products and related materials","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Acceptance sampling; Poisson distribution; Sampling (signal processing); Bayesian probability; Quality assurance; Quality (philosophy); Computer science; Plan (archaeology); Operations research; Statistics; Reliability engineering; Sample size determination; Mathematics; Engineering; Operations management; Artificial intelligence","score_opus":0.19378349450808674,"score_gpt":0.4550689203391297,"score_spread":0.261285425831043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206692493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08817705,0.00004326928,0.9092357,0.00057804264,0.0017589184,0.0001171992,0.000065447515,0.000007490238,0.000016891981],"genre_scores_gemma":[0.85909283,0.000009235113,0.14058903,0.0000065167,0.00026106968,0.0000036340573,0.000022140452,0.000008405064,0.0000071710742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977158,0.000109398236,0.0012790778,0.00018685135,0.0006075377,0.000101375284],"domain_scores_gemma":[0.9948107,0.0027794987,0.0005722874,0.00006608701,0.0017141113,0.000057338915],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0015858079,0.000086553366,0.00026338102,0.00036725544,0.000030213427,0.00010241292,0.00019246146,0.00007474847,0.00002138175],"category_scores_gemma":[0.020250676,0.00008482682,0.00003952456,0.0003623174,0.00003354118,0.00039212784,0.000049558817,0.00018085497,2.3140697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014011083,0.000069028414,0.00059591234,0.000014543935,0.000043688695,0.000023714003,0.0002628139,0.95682305,0.010340878,0.0070469966,0.000007972303,0.02463127],"study_design_scores_gemma":[0.0063699023,0.00022747293,0.008118118,0.00090366363,0.00006694507,0.0003405559,0.00089830405,0.90264523,0.05223549,0.027324919,0.0004694753,0.00039990572],"about_ca_topic_score_codex":0.000002778424,"about_ca_topic_score_gemma":9.117275e-7,"teacher_disagreement_score":0.77091575,"about_ca_system_score_codex":0.000097422155,"about_ca_system_score_gemma":0.00011675014,"threshold_uncertainty_score":0.9880022},"labels":[],"label_agreement":null},{"id":"W3206961072","doi":"10.5267/j.ijiec.2021.8.003","title":"An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Kuwait University","keywords":"Tardiness; Benchmark (surveying); Computer science; Algorithm; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Mathematics; Schedule","score_opus":0.019736753393790843,"score_gpt":0.25101466957287455,"score_spread":0.23127791617908372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206961072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03653789,0.000027618573,0.9602587,0.0003001862,0.002218598,0.00028903762,0.00019684715,0.00012966822,0.000041414845],"genre_scores_gemma":[0.126471,0.0000028397649,0.87067825,0.00003818353,0.002380104,0.00003917918,0.00029981122,0.00006569205,0.00002491615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00002015089,0.00058525667,0.00018700436,0.00037329437,0.00021830555],"domain_scores_gemma":[0.9975263,0.00038578457,0.00016000276,0.00009319487,0.0016628145,0.00017191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714748,0.00021517773,0.00031286373,0.00030592494,0.00007886053,0.00020872169,0.00017883482,0.00012531679,0.000026869338],"category_scores_gemma":[0.00033362836,0.00021962314,0.00016241906,0.00020306624,0.000021823575,0.00026883645,0.000013118133,0.00029966954,0.0000041065096],"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.00007287656,0.00008996695,0.000004377682,0.000012841252,0.00036208364,0.0000196981,0.00010979871,0.9805581,0.0015028635,0.0002602464,0.00013265682,0.016874477],"study_design_scores_gemma":[0.003330666,0.0003199678,0.000015892068,0.0003588029,0.000058248766,0.00039442116,0.00009925147,0.9934783,0.0013553874,0.00002968915,0.0003141279,0.00024523845],"about_ca_topic_score_codex":0.0000013517813,"about_ca_topic_score_gemma":2.6962923e-7,"teacher_disagreement_score":0.08993311,"about_ca_system_score_codex":0.0001843654,"about_ca_system_score_gemma":0.00024702324,"threshold_uncertainty_score":0.89559716},"labels":[],"label_agreement":null},{"id":"W3207420437","doi":"10.5267/j.ijiec.2021.8.001","title":"Cockpit crew pairing Pareto optimisation in a budget airline","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Chulalongkorn University","keywords":"Crew; Cockpit; Crew scheduling; Pareto principle; Computer science; Operations research; Reliability engineering; Mathematical optimization; Aeronautics; Engineering; Operations management; Mathematics","score_opus":0.03306707408553632,"score_gpt":0.287297977414064,"score_spread":0.25423090332852766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207420437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30389565,0.00028940072,0.6900583,0.0011813721,0.0041041323,0.000099072335,0.000021174823,0.00015768189,0.00019323135],"genre_scores_gemma":[0.91301906,0.00005831795,0.085716866,0.00004337012,0.0010696993,0.0000043977743,0.00004441144,0.00002804727,0.000015853791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985606,0.000060360202,0.0007024552,0.00011194997,0.00039404712,0.00017056015],"domain_scores_gemma":[0.9987291,0.00038101317,0.0001450894,0.00007878563,0.0005731902,0.00009279539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045776065,0.00014867229,0.00023900965,0.0003712666,0.000022405815,0.00010236091,0.0002410857,0.0001228893,0.000052014333],"category_scores_gemma":[0.0008096411,0.00016094338,0.000103402184,0.00048422604,0.0000093562185,0.00028392702,0.000039604573,0.00048437854,0.0000037462785],"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.000009405011,0.0000340996,0.0012577944,0.0000064477617,0.00010771648,0.00011518723,0.00014836465,0.98276633,0.0017916411,0.00019596968,0.00031770754,0.013249338],"study_design_scores_gemma":[0.0014062319,0.000023940087,0.0018431657,0.00030015974,0.000019791925,0.00023241295,0.000083592124,0.9901697,0.0030055633,0.00007034611,0.002657219,0.00018788937],"about_ca_topic_score_codex":0.000005429783,"about_ca_topic_score_gemma":0.0000062321005,"teacher_disagreement_score":0.6091234,"about_ca_system_score_codex":0.00031753135,"about_ca_system_score_gemma":0.00013628148,"threshold_uncertainty_score":0.65630805},"labels":[],"label_agreement":null},{"id":"W3207808978","doi":"10.5267/j.ijiec.2021.9.002","title":"Contract design for the fourth party logistics considering tardiness risk","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"State Key Laboratory of Synthetical Automation for Process Industries; National Natural Science Foundation of China","keywords":"Tardiness; Incentive; Payment; Computer science; Operations research; Risk management; Risk analysis (engineering); Business; Actuarial science; Microeconomics; Economics; Finance; Engineering; Job shop scheduling","score_opus":0.08385829152270577,"score_gpt":0.2667970091895406,"score_spread":0.1829387176668348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207808978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044376208,0.000114711525,0.98454654,0.00375352,0.006789815,0.0001899699,0.000012747161,0.000030699113,0.00012439568],"genre_scores_gemma":[0.98705274,0.000026693577,0.006338719,0.00048293095,0.006014765,0.0000124182825,0.000018210112,0.000020284164,0.000033212167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989845,0.0000155626,0.0004452462,0.00009838616,0.0003174247,0.00013888729],"domain_scores_gemma":[0.9975551,0.0009658894,0.00040236782,0.00008598605,0.00097437104,0.00001628581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063167483,0.00011502141,0.00016172206,0.00018262122,0.00011578259,0.0003815024,0.00030208245,0.000047369904,0.000074643125],"category_scores_gemma":[0.002357151,0.00009295443,0.00015271714,0.00017338565,0.000024402156,0.00036095319,0.00007429241,0.00023759625,0.0000064335336],"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.00004087454,0.000041504572,0.00057355943,0.0000066608204,0.00038092353,0.00004373251,0.000022665447,0.97279465,0.000044518063,0.011667855,0.008803973,0.0055790897],"study_design_scores_gemma":[0.0019761135,0.000016526492,0.0004889172,0.00009967317,0.00020041218,0.000035353274,0.00016798027,0.8429814,0.00018645063,0.0017212436,0.15197897,0.00014698692],"about_ca_topic_score_codex":0.000034675948,"about_ca_topic_score_gemma":0.0000050630592,"teacher_disagreement_score":0.9826152,"about_ca_system_score_codex":0.000065983004,"about_ca_system_score_gemma":0.00009047537,"threshold_uncertainty_score":0.37905717},"labels":[],"label_agreement":null},{"id":"W4205362192","doi":"10.5267/j.ijiec.2021.10.003","title":"A branch and bound method in a permutation flow shop with blocking and setup times","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Tardiness; Flow shop scheduling; Permutation (music); Blocking (statistics); Computer science; Upper and lower bounds; Branch and bound; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Exploit; Algorithm; Parallel computing; Mathematics; Routing (electronic design automation); Embedded system","score_opus":0.015070565385696202,"score_gpt":0.25338054438582075,"score_spread":0.23830997900012454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205362192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4214031,0.00027960681,0.5766742,0.00047527856,0.00094999385,0.00009470104,0.000019991814,0.000055443877,0.000047665795],"genre_scores_gemma":[0.89967513,0.000013561179,0.10003196,0.000020152178,0.00021091479,0.0000072713397,0.000012862485,0.000020150526,0.00000801629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992153,0.00003082374,0.0003005221,0.0000838089,0.0002768305,0.00009270905],"domain_scores_gemma":[0.9995347,0.00019535705,0.00007393615,0.000031933338,0.00011023389,0.00005378959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002900803,0.00009717723,0.00014069742,0.00046768034,0.000054116248,0.00009466021,0.00009898998,0.00003573855,0.000025280367],"category_scores_gemma":[0.000076048345,0.00010196499,0.00002303091,0.00023949676,0.000011993039,0.00016914438,0.000031532094,0.000376219,1.9677512e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002223046,0.000014037301,0.00049493357,0.000003656929,0.000087557244,0.000026337635,0.0007346707,0.98652345,0.000073398915,0.00013254395,0.000028221559,0.011858953],"study_design_scores_gemma":[0.0013937472,0.00006049421,0.0004701336,0.00006233088,0.000017163517,0.00044105074,0.00024767537,0.99685365,0.000053031847,0.00008193985,0.00021257575,0.00010619021],"about_ca_topic_score_codex":0.000007383172,"about_ca_topic_score_gemma":0.0000018286506,"teacher_disagreement_score":0.478272,"about_ca_system_score_codex":0.00011369985,"about_ca_system_score_gemma":0.000053348584,"threshold_uncertainty_score":0.41580117},"labels":[],"label_agreement":null},{"id":"W4205600329","doi":"10.5267/j.ijiec.2021.10.001","title":"Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Vehicle routing problem; Mathematical optimization; Integer programming; Time horizon; Ant colony optimization algorithms; Computer science; Metaheuristic; Routing (electronic design automation); Scheduling (production processes); Linear programming; Algorithm; Simulated annealing; Variable (mathematics); Set (abstract data type); Mathematics","score_opus":0.02123064897644581,"score_gpt":0.2451079673216813,"score_spread":0.2238773183452355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205600329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018141102,0.0000999144,0.97811055,0.0012165516,0.0020028527,0.00026655223,0.00007918597,0.00004874375,0.000034536337],"genre_scores_gemma":[0.74602675,0.0000045464435,0.25326893,0.000055530152,0.0005418455,0.000037352274,0.000012138891,0.00003973418,0.000013208325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876976,0.00006132781,0.00046348103,0.00007916987,0.00048071195,0.00014552134],"domain_scores_gemma":[0.9985187,0.00047237487,0.000292057,0.00010818788,0.00057486,0.000033829427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419076,0.00011190222,0.00014694562,0.00013484036,0.00021896765,0.000057883168,0.0005796286,0.000031299915,0.000020209302],"category_scores_gemma":[0.00013387491,0.000083406136,0.00008715234,0.00041477146,0.00002003648,0.00015162531,0.000078631216,0.00046682556,2.3356704e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000980814,0.00002002848,0.00011498872,0.0000060902375,0.00020611513,0.0000013667974,0.00023503506,0.98541903,0.0009841823,0.0005093845,0.0001712252,0.012322717],"study_design_scores_gemma":[0.0009911904,0.000059405716,0.0001231926,0.000079494435,0.000058457375,0.00014072834,0.0001063187,0.99621934,0.0006532605,0.00012682246,0.0013509745,0.00009083157],"about_ca_topic_score_codex":0.000030741387,"about_ca_topic_score_gemma":9.659735e-7,"teacher_disagreement_score":0.7278856,"about_ca_system_score_codex":0.00024467203,"about_ca_system_score_gemma":0.00020227258,"threshold_uncertainty_score":0.34012035},"labels":[],"label_agreement":null},{"id":"W4205601287","doi":"10.5267/j.ijiec.2021.10.002","title":"An exact algorithm for constrained k-cardinality unbalanced assignment problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Cardinality (data modeling); Assignment problem; Set (abstract data type); Generalized assignment problem; Weapon target assignment problem; Mathematical optimization; Algorithm; Computer science; Basis (linear algebra); Mathematics; Data mining","score_opus":0.03363362699043817,"score_gpt":0.3011088124539641,"score_spread":0.26747518546352594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205601287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010351851,0.000027221804,0.9855357,0.0003629758,0.0031232461,0.00023029515,0.00017664643,0.00014060948,0.00005145857],"genre_scores_gemma":[0.64013296,0.0000030740382,0.35889813,0.000024493347,0.00079696596,0.000036506823,0.00006502549,0.00003572864,0.000007132053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00008244696,0.0005649165,0.00011666793,0.000503528,0.00017520414],"domain_scores_gemma":[0.99892354,0.0002929524,0.00020442948,0.00009133014,0.0003759468,0.00011178241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009123922,0.00014372605,0.00022775898,0.000314025,0.00008908563,0.000088708155,0.00041719805,0.000056324727,0.000051187795],"category_scores_gemma":[0.00012039129,0.00016780174,0.00013686593,0.00022391582,0.00001603063,0.00022226798,0.000035801444,0.00041511442,5.4655675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015147512,0.00005118009,0.00006640838,0.0000032459209,0.00023177506,0.00001021624,0.000148881,0.9418563,0.0010261021,0.00032059196,0.00042350387,0.05584664],"study_design_scores_gemma":[0.0017570942,0.00017481668,0.00008028869,0.000027308108,0.000032053067,0.0001317265,0.00013742717,0.99291396,0.00050603965,0.00016716788,0.0039074067,0.00016470405],"about_ca_topic_score_codex":0.0000025996824,"about_ca_topic_score_gemma":8.982248e-8,"teacher_disagreement_score":0.6297811,"about_ca_system_score_codex":0.00046498532,"about_ca_system_score_gemma":0.00013046371,"threshold_uncertainty_score":0.6842756},"labels":[],"label_agreement":null},{"id":"W4205882819","doi":"10.5267/j.ijiec.2021.12.002","title":"Clustering and heuristics algorithm for the vehicle routing problem with time windows","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Universidad Nacional de Colombia; Massachusetts Institute of Technology","keywords":"Vehicle routing problem; Heuristics; Cluster analysis; Computer science; Set (abstract data type); Mathematical optimization; Algorithm; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.021013029719480766,"score_gpt":0.2563518208738407,"score_spread":0.2353387911543599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205882819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005786598,0.00008143332,0.99219126,0.00057658606,0.0010090995,0.00020915373,0.00004229583,0.0000765279,0.000027067043],"genre_scores_gemma":[0.48373207,0.000012692218,0.5148793,0.0000501895,0.0011484439,0.00004015702,0.000017470773,0.000074163254,0.00004550701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990468,0.000034442794,0.00035936688,0.00008259886,0.00033491474,0.00014189736],"domain_scores_gemma":[0.9987757,0.0007169595,0.00015299348,0.00006123557,0.0002398069,0.00005328732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059648324,0.000115749164,0.00014860128,0.00017357197,0.00016946344,0.000109781715,0.00027849647,0.0000335792,0.000012870114],"category_scores_gemma":[0.00012452998,0.000100867685,0.00005161218,0.00019347406,0.000018425731,0.00012383536,0.00007788398,0.00040624183,4.2275354e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014722102,0.0000103892025,0.000054192013,0.0000030007106,0.00018802682,0.0000072435646,0.00018570655,0.9485289,0.00015064012,0.00007173157,0.00023720699,0.05054826],"study_design_scores_gemma":[0.0011922398,0.00009328002,0.000067376815,0.000042791078,0.000042175245,0.00025146492,0.0000929157,0.99515694,0.00007171211,0.000022522912,0.0028560094,0.00011055711],"about_ca_topic_score_codex":0.0000028172676,"about_ca_topic_score_gemma":2.474964e-7,"teacher_disagreement_score":0.47794548,"about_ca_system_score_codex":0.00015704765,"about_ca_system_score_gemma":0.000059030583,"threshold_uncertainty_score":0.41132647},"labels":[],"label_agreement":null},{"id":"W4205998440","doi":"10.5267/j.ijiec.2021.11.001","title":"A new hybrid algorithm based on MVO and SA for function optimization","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Simulated annealing; Benchmark (surveying); Hybrid algorithm (constraint satisfaction); Algorithm; Metaheuristic; Optimization algorithm; Computer science; Mathematical optimization; Mathematics","score_opus":0.030199681041480582,"score_gpt":0.27547507868005605,"score_spread":0.24527539763857548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205998440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082065555,0.000024568826,0.9939412,0.00239821,0.003249386,0.00019882538,0.000034722703,0.000042852487,0.000028210407],"genre_scores_gemma":[0.03836397,0.0000049034547,0.9603843,0.00021424798,0.0008656052,0.00002301558,0.00004621297,0.000020108484,0.00007762444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837536,0.00006607074,0.0004358862,0.00017448718,0.0008127456,0.0001354714],"domain_scores_gemma":[0.99841356,0.00053256954,0.00025664165,0.0001112755,0.0005501273,0.00013582507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722686,0.0001101353,0.00014833201,0.0007643009,0.00013639877,0.00022984602,0.00057224394,0.000029763569,0.00007364422],"category_scores_gemma":[0.00051441527,0.00011997102,0.00008251324,0.0003460514,0.000009337112,0.00029601698,0.00011869231,0.00032263092,9.274604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041168514,0.00004609794,0.0000059250247,0.000001154574,0.00005419497,0.0000109487,0.000027635424,0.9015967,0.000008116972,0.0021498436,0.0023249655,0.09373324],"study_design_scores_gemma":[0.0020952602,0.00042189693,0.000024095132,0.00001974049,0.000013221323,0.000085166896,0.0000094340485,0.99100304,0.000049794704,0.00033472897,0.005842375,0.000101257516],"about_ca_topic_score_codex":0.000005833738,"about_ca_topic_score_gemma":5.2578617e-8,"teacher_disagreement_score":0.09363198,"about_ca_system_score_codex":0.0002014746,"about_ca_system_score_gemma":0.00041838113,"threshold_uncertainty_score":0.4892276},"labels":[],"label_agreement":null},{"id":"W4206161370","doi":"10.5267/j.ijiec.2021.12.003","title":"How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"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":"Quadratic assignment problem; Metaheuristic; Mathematical optimization; Heuristic; Bounding overwatch; Computation; Computer science; Weapon target assignment problem; Quadratic equation; Quadratic programming; Combinatorial optimization; Optimization problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.042516963782441256,"score_gpt":0.28286103164726606,"score_spread":0.24034406786482482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206161370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014396713,0.000058938807,0.9740269,0.006125674,0.00486001,0.00035417304,0.000044280747,0.00009123407,0.000042085234],"genre_scores_gemma":[0.89285475,0.0000025455547,0.10593532,0.00008999525,0.00093601074,0.00007139316,0.000011110944,0.00004774503,0.000051152747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985465,0.00005150844,0.00048388654,0.00011180645,0.0005949347,0.00021138077],"domain_scores_gemma":[0.9986018,0.0006723527,0.000175292,0.000104172505,0.0003499417,0.00009645702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093228515,0.00014940252,0.00018861175,0.00033354858,0.0001847786,0.00031809843,0.00051431893,0.000040562514,0.000021977474],"category_scores_gemma":[0.0006623737,0.00014161835,0.00013226595,0.00031840758,0.000012247424,0.00018169585,0.000094618554,0.0004713809,8.176805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002531724,0.000027750011,0.000029755449,0.000006055574,0.0001892411,0.00000869706,0.00054816523,0.98956394,0.00094875746,0.0008695855,0.0035351287,0.00424761],"study_design_scores_gemma":[0.00090358924,0.0001810991,0.000031543084,0.000075565426,0.000041644656,0.00008963602,0.0005313342,0.9609828,0.00030491577,0.00018691822,0.03649152,0.000179429],"about_ca_topic_score_codex":0.000002359249,"about_ca_topic_score_gemma":6.450374e-7,"teacher_disagreement_score":0.878458,"about_ca_system_score_codex":0.0005244871,"about_ca_system_score_gemma":0.00012313419,"threshold_uncertainty_score":0.5775029},"labels":[],"label_agreement":null},{"id":"W4206172178","doi":"10.5267/j.ijiec.2021.11.002","title":"Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Tardiness; Computer science; Scheduling (production processes); Mathematical optimization; Integer programming; Due date; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.034967296148163504,"score_gpt":0.2614152749469364,"score_spread":0.22644797879877288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206172178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045162044,0.00013667738,0.9507052,0.0003705564,0.0031888415,0.00020916178,0.00012414016,0.000087376015,0.000016012867],"genre_scores_gemma":[0.67210656,0.000007089259,0.32677045,0.00002184437,0.000971702,0.000023775932,0.000027786824,0.0000511708,0.000019639356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987128,0.000020853267,0.0004749631,0.00010324367,0.00051640027,0.00017173625],"domain_scores_gemma":[0.99873704,0.00037898382,0.00019025564,0.00007857689,0.0005545143,0.00006065564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035629078,0.00015485815,0.00017852403,0.00025993964,0.0001985941,0.00014858998,0.00035616464,0.000034289962,0.00003864316],"category_scores_gemma":[0.00015478319,0.00013140336,0.00008549028,0.00026173456,0.000020154848,0.00016452017,0.000055070675,0.00046437507,6.7073375e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035623383,0.000023115728,0.000026456064,0.0000060303414,0.00036369872,0.00002450766,0.00016066668,0.9969152,0.00014949926,0.00019693947,0.0001102093,0.0019880314],"study_design_scores_gemma":[0.0011408306,0.000060352355,0.0000047650406,0.000069715825,0.0000805599,0.0008072902,0.00028331956,0.99662554,0.00022283691,0.000055650195,0.0004919507,0.00015719538],"about_ca_topic_score_codex":0.000006951711,"about_ca_topic_score_gemma":2.2913926e-7,"teacher_disagreement_score":0.6269445,"about_ca_system_score_codex":0.00026679665,"about_ca_system_score_gemma":0.00018997796,"threshold_uncertainty_score":0.53584737},"labels":[],"label_agreement":null},{"id":"W4206764064","doi":"10.5267/j.ijiec.2021.12.001","title":"An extensive and systematic literature review for hybrid flowshop scheduling problems","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Computer science; Scheduling (production processes); Systematic review; Job shop scheduling; Operations research; Industrial engineering; Mathematical optimization; Schedule; Mathematics","score_opus":0.01997556386793187,"score_gpt":0.25983109668257126,"score_spread":0.2398555328146394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206764064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013887554,0.03185602,0.94667035,0.00090492464,0.0055587366,0.0007914596,0.00014264457,0.00017762167,0.000010673021],"genre_scores_gemma":[0.7476627,0.004971134,0.24325058,0.0006116321,0.0027452947,0.00025872324,0.00032606607,0.00014875093,0.000025118848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988269,0.000038889284,0.00058664184,0.000101770245,0.0003333841,0.00011238806],"domain_scores_gemma":[0.9988573,0.00020267455,0.00017198855,0.00008157528,0.000595035,0.00009140104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994353,0.00012998113,0.0002757829,0.00033111405,0.000080660444,0.00012126955,0.0002617704,0.00003373641,0.0000108636705],"category_scores_gemma":[0.0003996285,0.0001326276,0.000092993076,0.00021999632,0.0000077643335,0.00024138433,0.00002628071,0.00038286293,4.2176848e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006353616,0.000020551768,0.0000030373083,0.0012901678,0.00015817206,0.00001971127,0.00016327309,0.99705905,0.00010066331,0.00016379615,0.0002364333,0.00077882153],"study_design_scores_gemma":[0.0007223132,0.00008899874,0.0000033764231,0.009393941,0.0000716209,0.00075179053,0.00007210492,0.9883713,0.000046702746,0.000051474402,0.0002904209,0.0001359698],"about_ca_topic_score_codex":4.798954e-7,"about_ca_topic_score_gemma":6.472874e-8,"teacher_disagreement_score":0.73377514,"about_ca_system_score_codex":0.00011471496,"about_ca_system_score_gemma":0.000048273043,"threshold_uncertainty_score":0.5408397},"labels":[],"label_agreement":null},{"id":"W4242831141","doi":"10.5267/j.ijiec.2021.4.001","title":"Solving a hybrid batch production problem with unreliable equipment and quality reassurance","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Rework; Quality (philosophy); Schedule; Task (project management); Production (economics); Computer science; Batch production; Outsourcing; Product (mathematics); Process (computing); Production schedule; Operations research; Reliability engineering; Operations management; Engineering; Business; Economics; Microeconomics; Marketing","score_opus":0.03641510974055721,"score_gpt":0.24818987546042237,"score_spread":0.21177476571986517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242831141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801677,0.00027515058,0.09179204,0.016003365,0.008102347,0.000402736,0.000007392285,0.00012654367,0.0031227204],"genre_scores_gemma":[0.99358046,0.000015115133,0.003699472,0.00019936549,0.0023194326,0.0000058894348,0.00001803682,0.0000151741315,0.00014703741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887586,0.000011341106,0.00040937396,0.00014505336,0.0004367573,0.00012164026],"domain_scores_gemma":[0.9987744,0.00005631527,0.0003091236,0.00007078373,0.0007700606,0.000019288242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044191544,0.00010825008,0.0001528702,0.00023591824,0.000062628416,0.00029473632,0.00014426548,0.00002549617,0.00003920164],"category_scores_gemma":[0.00031651076,0.00010046175,0.000046084297,0.000220053,0.00001853652,0.0007729203,0.00008271861,0.00018819763,0.000004083494],"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.00017939354,0.0002937789,0.010812058,0.00012770627,0.00066407234,0.0001984679,0.00015127313,0.931315,0.0019707836,0.025543042,0.009795852,0.018948553],"study_design_scores_gemma":[0.018753126,0.00032471158,0.026648104,0.0074180975,0.00070189143,0.0013202376,0.002889411,0.33123997,0.008455826,0.0076695886,0.59215146,0.002427588],"about_ca_topic_score_codex":0.000060827966,"about_ca_topic_score_gemma":0.0000075441994,"teacher_disagreement_score":0.60007507,"about_ca_system_score_codex":0.000091643604,"about_ca_system_score_gemma":0.00006835178,"threshold_uncertainty_score":0.40967113},"labels":[],"label_agreement":null},{"id":"W4285157368","doi":"10.5267/j.ijiec.2022.2.002","title":"Integrated scheduling of machines and automated guided vehicles (AGVs) in flexible job shop environment using genetic algorithms","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":46,"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":"Job shop; Automated guided vehicle; Job shop scheduling; Scheduling (production processes); Computer science; Genetic algorithm; Benchmark (surveying); Flow shop scheduling; Machine shop; Industrial engineering; Algorithm; Mathematical optimization; Engineering; Artificial intelligence; Manufacturing engineering; Machine learning; Operating system; Schedule","score_opus":0.03381552671810476,"score_gpt":0.26868440500658464,"score_spread":0.23486887828847988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285157368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53026235,0.00017095452,0.46866968,0.000034304212,0.0007040305,0.00006028917,0.000023423478,0.000067268644,0.0000077196],"genre_scores_gemma":[0.87819713,0.000039623574,0.121604,0.000003930731,0.00011465362,0.0000029797734,0.000014423467,0.00002033055,0.0000029076248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998971,0.000025725927,0.00055243087,0.000082421495,0.000263212,0.00010521008],"domain_scores_gemma":[0.9995799,0.00010145676,0.00014577385,0.00004935261,0.000080946505,0.000042545176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016669458,0.000113952505,0.00017877007,0.0004998499,0.000037585087,0.000026334126,0.00016536332,0.000044599663,0.000016759144],"category_scores_gemma":[0.00009297505,0.00012718228,0.000039416846,0.00016698898,0.000019295085,0.000106721025,0.00005926362,0.0003234993,1.8824167e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012216768,0.000023385694,0.00053137005,0.0000062095564,0.00007044101,0.000019410336,0.000115732844,0.99340796,0.0022999092,0.0000681089,0.000016463662,0.0034287602],"study_design_scores_gemma":[0.0008088559,0.000036197995,0.0008040756,0.00006732372,0.000016840575,0.00010742343,0.00006921762,0.9968707,0.00091265695,0.00011549618,0.00008713685,0.00010409584],"about_ca_topic_score_codex":0.00002983211,"about_ca_topic_score_gemma":3.778325e-7,"teacher_disagreement_score":0.34793484,"about_ca_system_score_codex":0.000255523,"about_ca_system_score_gemma":0.00004389552,"threshold_uncertainty_score":0.5186343},"labels":[],"label_agreement":null},{"id":"W4285164761","doi":"10.5267/j.ijiec.2022.1.001","title":"Multi-depot heterogeneous fleet vehicle routing problem with time windows: Airline and roadway integrated routing","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Anadolu Üniversitesi","keywords":"Vehicle routing problem; Genetic algorithm; Computer science; Variable neighborhood search; Aviation; Variable (mathematics); Routing (electronic design automation); Range (aeronautics); Mathematical optimization; Node (physics); Operations research; Engineering; Metaheuristic; Computer network; Algorithm; Mathematics","score_opus":0.021445372266146498,"score_gpt":0.25305417389850543,"score_spread":0.23160880163235892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285164761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4124888,0.00010493257,0.5853954,0.00032530652,0.0010673575,0.00023248114,0.000052385065,0.00028937502,0.00004396321],"genre_scores_gemma":[0.88600075,0.000005024208,0.113455236,0.000028421713,0.00037034048,0.000010876646,0.000032651194,0.00006745447,0.000029259863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.00011842422,0.0007003993,0.00017303425,0.0005334251,0.00024923563],"domain_scores_gemma":[0.9988376,0.00029866528,0.0002920409,0.0000948602,0.000347476,0.00012937076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074671174,0.00023107124,0.0003020563,0.00043794894,0.00015624765,0.00014975424,0.00036074975,0.000083668405,0.000049205933],"category_scores_gemma":[0.00025040685,0.00023597572,0.000081690734,0.00044196568,0.00002599568,0.00025293796,0.00011927518,0.0009002775,0.000002428383],"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.00004036018,0.00004523926,0.0007648823,0.000004259327,0.0002990594,0.00007092734,0.00039403688,0.9874417,0.0028806566,0.000036736415,0.00007689021,0.007945259],"study_design_scores_gemma":[0.0021554152,0.00017556506,0.00017053749,0.00013378903,0.00004155746,0.00079666043,0.00014075753,0.9946569,0.0008777263,0.0000065218,0.0006072231,0.00023730504],"about_ca_topic_score_codex":0.00001459822,"about_ca_topic_score_gemma":0.0000013698008,"teacher_disagreement_score":0.47351193,"about_ca_system_score_codex":0.00036718365,"about_ca_system_score_gemma":0.0001169482,"threshold_uncertainty_score":0.96228105},"labels":[],"label_agreement":null},{"id":"W4285165978","doi":"10.5267/j.ijiec.2022.2.003","title":"The combined effect of rework, postponement, multiple shipments, and overtime producing common-component on a multiproduct vendor-client incorporated system","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"Rework; Postponement; Vendor; Quality (philosophy); Supply chain; Component (thermodynamics); Overtime; Product (mathematics); Holding cost; Lead time; Economic order quantity; Computer science; Operations management; Operations research; Business; Engineering; Economics; Marketing","score_opus":0.013139564267582738,"score_gpt":0.20936062887890824,"score_spread":0.19622106461132552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285165978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99285007,0.00008003356,0.000663434,0.0016662023,0.0041554365,0.00046645233,0.000009039343,0.00004487212,0.00006447874],"genre_scores_gemma":[0.9989602,0.0000029013986,0.00012258826,0.000040165978,0.0007565835,0.000021506663,0.000061943145,0.000019025005,0.000015094315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836344,0.00005668819,0.0006432396,0.00016084821,0.0006421407,0.00013363884],"domain_scores_gemma":[0.99845,0.00033418555,0.0007600331,0.00011677805,0.00031846002,0.000020554868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011860235,0.00014914754,0.0002224599,0.00041325937,0.0002633447,0.00014132651,0.0003524695,0.000025164512,0.000008259012],"category_scores_gemma":[0.00066402345,0.00012114829,0.000065764034,0.00035394102,0.000022980867,0.0002571961,0.0002073618,0.00032799607,0.0000026373375],"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.002116523,0.00019773222,0.034338992,0.00006260928,0.00045515635,0.00003784386,0.00017260293,0.94777566,0.0016442904,0.0038638941,0.002382003,0.0069526825],"study_design_scores_gemma":[0.02068238,0.0008901503,0.072468586,0.001862061,0.0003907326,0.00012722195,0.0006642819,0.8755096,0.0047346503,0.00034323693,0.021380858,0.00094620185],"about_ca_topic_score_codex":0.000041548028,"about_ca_topic_score_gemma":0.0000013455448,"teacher_disagreement_score":0.072266035,"about_ca_system_score_codex":0.00019925753,"about_ca_system_score_gemma":0.000055782803,"threshold_uncertainty_score":0.4940284},"labels":[],"label_agreement":null},{"id":"W4285166142","doi":"10.5267/j.ijiec.2022.2.001","title":"Assembly line rebalancing and worker assignment considering ergonomic risks in an automotive parts manufacturing plant","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"Automotive industry; Constructive; Assembly line; Heuristic; Quality (philosophy); Benchmark (surveying); Manufacturing engineering; Engineering; Risk analysis (engineering); Work (physics); Computer science; Operations research; Industrial engineering; Process (computing); Business; Mechanical engineering; Artificial intelligence","score_opus":0.03440726592990508,"score_gpt":0.26324806295233344,"score_spread":0.22884079702242835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285166142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9052191,0.00008560642,0.09188359,0.00016276393,0.0023584254,0.0001321658,0.000033358043,0.00009690382,0.000028116616],"genre_scores_gemma":[0.99392396,0.000017748838,0.0054320064,0.000024600087,0.00049615296,0.000012226245,0.00005270637,0.00003832004,0.0000022854538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985762,0.0000562256,0.00066646485,0.00014442067,0.00035806652,0.00019860647],"domain_scores_gemma":[0.99931985,0.00019856675,0.0001996032,0.00007941091,0.00010016,0.000102383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045096327,0.00017388538,0.0002531475,0.0005912926,0.00007186806,0.0001037342,0.00022435305,0.00006508382,0.000018285447],"category_scores_gemma":[0.00012055274,0.00020622594,0.000050125578,0.00013454772,0.000010814034,0.0003692422,0.00009369487,0.000669986,7.3866613e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025383446,0.000036753976,0.0019176692,0.0000032991181,0.000097592514,0.00009253538,0.0004462596,0.9941362,0.00085968187,0.000041854222,0.000054398388,0.0022883597],"study_design_scores_gemma":[0.0014209648,0.000102287035,0.008908982,0.00015091628,0.000021241865,0.00025998682,0.00030393986,0.9866314,0.0015954833,0.000039724637,0.00035002318,0.00021507153],"about_ca_topic_score_codex":0.000024651517,"about_ca_topic_score_gemma":0.0000106131065,"teacher_disagreement_score":0.088704884,"about_ca_system_score_codex":0.0006464595,"about_ca_system_score_gemma":0.000083891624,"threshold_uncertainty_score":0.840965},"labels":[],"label_agreement":null},{"id":"W4285175278","doi":"10.5267/j.ijiec.2022.1.004","title":"A dynamic decision-making framework for a hybrid production system for decayed merchandise with shortages in traditional and electronic markets","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Remanufacturing; Profit maximization; Profit (economics); Production planning; Production (economics); Economic shortage; Supply chain; Computer science; Dynamic programming; Maximization; Business; Industrial organization; Operations research; Manufacturing engineering; Economics; Microeconomics; Marketing; Engineering","score_opus":0.014246252778189517,"score_gpt":0.24368295383689872,"score_spread":0.2294367010587092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285175278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33415923,0.000059978887,0.66216296,0.0013122259,0.0015879072,0.00065692916,0.00002264197,0.000029538664,0.000008592634],"genre_scores_gemma":[0.98433167,0.0000022577688,0.014403641,0.000051082636,0.00094659877,0.0001910832,0.00004151993,0.000027042553,0.0000050814865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988083,0.000011461525,0.0004046931,0.00017069989,0.00040912558,0.0001956925],"domain_scores_gemma":[0.99866855,0.0006048963,0.00030723197,0.000055479308,0.0003514694,0.000012342809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076922425,0.00012257896,0.00017168661,0.0009914173,0.00014296967,0.00016492662,0.00023428278,0.000026886224,0.000013368205],"category_scores_gemma":[0.0006039581,0.00012609085,0.00007109203,0.00030736788,0.000012808127,0.00042854247,0.00005354875,0.0002784906,1.6368652e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010193108,0.000092607064,0.00032004618,0.000063682215,0.00021045755,0.000039175295,0.000055369805,0.94723374,0.000019373885,0.0398708,0.0003738769,0.010701571],"study_design_scores_gemma":[0.003711825,0.00018784737,0.001291849,0.0008616634,0.00014154706,0.00023096603,0.0019125282,0.9565393,0.00001177447,0.02934131,0.0054621818,0.00030722175],"about_ca_topic_score_codex":0.000006285906,"about_ca_topic_score_gemma":0.0000058298765,"teacher_disagreement_score":0.6501725,"about_ca_system_score_codex":0.0006410191,"about_ca_system_score_gemma":0.00012445975,"threshold_uncertainty_score":0.5141836},"labels":[],"label_agreement":null},{"id":"W4285201180","doi":"10.5267/j.ijiec.2022.1.003","title":"Decision analysis of individual supplier in a vendor-managed inventory program with revenue-sharing contract","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Supply chain; Revenue sharing; Vendor-managed inventory; Business; Revenue; Supply chain management; Flexibility (engineering); Operations research; Microeconomics; Operations management; Economics; Marketing; Finance","score_opus":0.03244608422329505,"score_gpt":0.2629049993179355,"score_spread":0.23045891509464045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285201180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99297446,0.000043386575,0.0045559565,0.00038103023,0.0014932071,0.00028443013,0.000030240419,0.000026854072,0.00021045371],"genre_scores_gemma":[0.9985077,0.0000019538168,0.00075504516,0.00011534546,0.00048595623,0.000025872612,0.000078495206,0.000015587839,0.000014068824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982345,0.000015381032,0.0006238149,0.00013679278,0.00084802345,0.00014147951],"domain_scores_gemma":[0.99901015,0.00010476615,0.00055316393,0.000097330856,0.00021698169,0.000017582384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007989671,0.00011582083,0.0002765755,0.0025090885,0.00005434825,0.00013483557,0.0006192049,0.000031298365,0.00018335799],"category_scores_gemma":[0.00016176233,0.00011690682,0.00015243086,0.0013549934,0.000019342688,0.0004278662,0.00024658453,0.00037357985,0.0000012941438],"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.00016692706,0.0002793506,0.03223926,0.000008199404,0.0011855344,0.000094601615,0.00015471593,0.95007426,0.000020219984,0.0025560795,0.00084825157,0.012372621],"study_design_scores_gemma":[0.007781461,0.0002451353,0.07148043,0.00039099436,0.0013466865,0.000027888502,0.00088047644,0.8566151,0.000022708593,0.00067466946,0.06008022,0.00045421062],"about_ca_topic_score_codex":0.000120113255,"about_ca_topic_score_gemma":0.000037812933,"teacher_disagreement_score":0.09345912,"about_ca_system_score_codex":0.00017504803,"about_ca_system_score_gemma":0.000046044115,"threshold_uncertainty_score":0.47673216},"labels":[],"label_agreement":null},{"id":"W4285213162","doi":"10.5267/j.ijiec.2022.4.001","title":"Fabrication runtime decision for a hybrid system incorporating probabilistic breakdowns, scrap, and overtime","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Computer science; Function (biology); Product (mathematics); Outsourcing; Probabilistic logic; Industrial engineering; Engineering; Artificial intelligence","score_opus":0.013914992217565645,"score_gpt":0.22282812444608022,"score_spread":0.20891313222851457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285213162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12790558,0.00012793121,0.86870587,0.0001226177,0.0026126998,0.00026534314,0.000098627715,0.000119702,0.000041606654],"genre_scores_gemma":[0.9825766,0.000004903627,0.01679963,0.000010276462,0.000495611,0.00003414398,0.00004614885,0.00002688337,0.0000057670454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989081,0.00001514481,0.0005218671,0.00010427051,0.00034612717,0.00010449377],"domain_scores_gemma":[0.9990884,0.00024583167,0.0002100568,0.00005861917,0.00033581816,0.000061262035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312486,0.00011777285,0.00016712034,0.0003542575,0.0001144756,0.00010641809,0.00021672936,0.00003346771,0.000011362877],"category_scores_gemma":[0.00023096713,0.0001279841,0.000063175496,0.00013886575,0.000009715824,0.00021537411,0.000054695953,0.00023055816,6.104947e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173461,0.000018258546,0.000056622055,0.000026125137,0.00008024934,0.000005358828,0.00006692551,0.98627234,0.00011253086,0.0009597838,0.00051052653,0.011859543],"study_design_scores_gemma":[0.0010171022,0.000080693484,0.00019954833,0.00012249069,0.00003153311,0.00018690502,0.000052799434,0.9959421,0.00024439095,0.00035271194,0.0016496091,0.000120084645],"about_ca_topic_score_codex":0.000004756744,"about_ca_topic_score_gemma":3.0141297e-7,"teacher_disagreement_score":0.85467106,"about_ca_system_score_codex":0.00031307503,"about_ca_system_score_gemma":0.000061971215,"threshold_uncertainty_score":0.521904},"labels":[],"label_agreement":null},{"id":"W4285252157","doi":"10.5267/j.ijiec.2022.3.002","title":"Nash-stackelberg game perspective on pricing strategies for ride-hailing and aggregation platforms under bundle mode","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation and Mobility Innovations","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":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Bundle; Pricing strategies; Nash equilibrium; Service (business); Key (lock); Popularity; Business; Computer science; Microeconomics; Industrial organization; Marketing; Economics; Computer security","score_opus":0.029391190782041377,"score_gpt":0.28313311123009316,"score_spread":0.25374192044805177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285252157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5673697,0.000053901644,0.42965207,0.0005620264,0.0018574675,0.0002021374,0.00011057873,0.00008969653,0.00010242782],"genre_scores_gemma":[0.9972424,0.000009240665,0.002223713,0.000054570242,0.00034994318,0.000027908816,0.000054347725,0.000025934778,0.000011962353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989329,0.000007718071,0.00047948264,0.000108161126,0.00034369636,0.00012806631],"domain_scores_gemma":[0.99909365,0.00024083257,0.00013866926,0.000056706172,0.0004157867,0.000054340497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948805,0.00013011391,0.00015276755,0.00049836235,0.00010715419,0.00009582616,0.00016173552,0.000049574424,0.000019014826],"category_scores_gemma":[0.00007204606,0.00014397157,0.00008220129,0.00023370497,0.000021409976,0.0003563381,0.000014569351,0.00040844755,5.7497897e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040713894,0.00004634405,0.00002623159,0.0000049028226,0.00017857895,0.000002511993,0.0012579809,0.8938555,0.00082114077,0.10255946,0.00010625683,0.0011003527],"study_design_scores_gemma":[0.0029354182,0.00035987925,0.00046129827,0.000118851814,0.000060321523,0.00009000166,0.008442054,0.9666989,0.0010128262,0.017567609,0.0019377519,0.00031510447],"about_ca_topic_score_codex":0.000022379183,"about_ca_topic_score_gemma":0.000011845731,"teacher_disagreement_score":0.4298727,"about_ca_system_score_codex":0.0004913435,"about_ca_system_score_gemma":0.00014247345,"threshold_uncertainty_score":0.587099},"labels":[],"label_agreement":null},{"id":"W4285286149","doi":"10.5267/j.ijiec.2022.3.001","title":"The effect of probabilistic incentives to promote cooperation during the pandemics using simulation of multi-agent evolutionary game","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","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":"Incentive; Free riding; Dilemma; Probabilistic logic; Microeconomics; Stochastic game; Social dilemma; Outcome (game theory); Prisoner's dilemma; Evolutionary game theory; Game theory; Economics; Computer science; Business; Artificial intelligence; Mathematics","score_opus":0.03017061161490087,"score_gpt":0.3131487571573433,"score_spread":0.28297814554244244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455724,0.00009212337,0.051979993,0.00050295546,0.001382684,0.00042591387,0.000023697801,0.000011085292,0.000009199499],"genre_scores_gemma":[0.99916095,0.0000074366544,0.00038401753,0.0000058920455,0.00038044612,0.000012931223,0.0000062607583,0.0000073621427,0.000034736422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818057,0.00045536438,0.00055091246,0.000078774625,0.00062599237,0.00010837179],"domain_scores_gemma":[0.9981,0.0007362561,0.0003944992,0.00006901336,0.0006589232,0.000041348256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001493723,0.00007923198,0.0001286345,0.00015906953,0.00052351627,0.0000385371,0.0003726072,0.000037217953,0.000012712461],"category_scores_gemma":[0.0016282885,0.00005994903,0.00008734037,0.0003846548,0.000090359965,0.00020252104,0.00008325477,0.00025726954,3.423161e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020608278,0.00004257831,0.0007384387,0.0000036411125,0.00007922554,0.0000012387446,0.0020532273,0.99066025,0.0023175268,0.0026389312,0.000009595492,0.0012492848],"study_design_scores_gemma":[0.001140682,0.00033046023,0.0023626422,0.00010575904,0.000052498042,0.000020375264,0.0006837876,0.99242777,0.00059426075,0.00018231504,0.0019962608,0.00010319973],"about_ca_topic_score_codex":0.00004975863,"about_ca_topic_score_gemma":0.000010575647,"teacher_disagreement_score":0.05358857,"about_ca_system_score_codex":0.00046898585,"about_ca_system_score_gemma":0.0002716142,"threshold_uncertainty_score":0.4026517},"labels":[],"label_agreement":null},{"id":"W4285286335","doi":"10.5267/j.ijiec.2022.1.002","title":"A hybrid matheuristic approach for the vehicle routing problem with three-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","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":"Vehicle routing problem; Column generation; Mathematical optimization; GRASP; Benchmark (surveying); Set (abstract data type); Bin packing problem; Heuristic; Computer science; Greedy algorithm; Packing problems; Greedy randomized adaptive search procedure; Heuristics; Set packing; Path (computing); Constructive; Container (type theory); Routing (electronic design automation); Mathematics; Algorithm; Process (computing); Bin; Engineering","score_opus":0.026621235433590133,"score_gpt":0.22915943037785697,"score_spread":0.20253819494426684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285286335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012881977,0.000067862704,0.9847818,0.0003356525,0.0013463675,0.00029027482,0.00007074078,0.00008786071,0.0001374907],"genre_scores_gemma":[0.96463567,0.0000012745652,0.034799237,0.000033546024,0.00040980443,0.000034288965,0.000039567763,0.000034971683,0.000011640929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890345,0.000017989682,0.00040811504,0.00009108967,0.00042204012,0.00015730059],"domain_scores_gemma":[0.999088,0.00037196046,0.0001647535,0.00006436335,0.00025626353,0.000054678243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004088439,0.00012607947,0.00014571016,0.00019354041,0.00018159476,0.00010325316,0.0003363293,0.000025607234,0.000051896764],"category_scores_gemma":[0.00006483386,0.00010365644,0.00008616971,0.0001627073,0.000031786225,0.00011426487,0.000044342745,0.00044845243,7.178421e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033641103,0.00003191337,0.00009929146,0.0000051254447,0.0002811551,0.000009431123,0.00011343701,0.9939606,0.00009646316,0.001441249,0.0007989281,0.0031287454],"study_design_scores_gemma":[0.0013140712,0.00007689105,0.000035754216,0.000044806926,0.000040530875,0.00043424114,0.00005563969,0.9962547,0.00007040835,0.00011260774,0.0014382853,0.00012206158],"about_ca_topic_score_codex":0.000004085419,"about_ca_topic_score_gemma":3.410515e-7,"teacher_disagreement_score":0.9517537,"about_ca_system_score_codex":0.00016301747,"about_ca_system_score_gemma":0.00010390876,"threshold_uncertainty_score":0.4226987},"labels":[],"label_agreement":null},{"id":"W4293252616","doi":"10.5267/j.ijiec.2022.5.004","title":"Optimizing an FPR-based supplier-retailer integrated problem with an outsourcer, rework, expedited rate, and probabilistic breakdown","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Rework; Probabilistic logic; Computer science; Supply chain; Operations research; Quality (philosophy); Reliability engineering; Risk analysis (engineering); Operations management; Business; Marketing; Engineering","score_opus":0.018313680453502103,"score_gpt":0.22510901243653045,"score_spread":0.20679533198302835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7943811,0.000042271346,0.19692814,0.004510101,0.0023983216,0.0010705064,0.000037472048,0.00029753108,0.00033456483],"genre_scores_gemma":[0.9889285,5.7174697e-7,0.008766028,0.00035128044,0.0015635939,0.000055826877,0.00023329793,0.000054668715,0.000046245954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982587,0.00005304935,0.0005597909,0.0002515856,0.0006321202,0.0002447422],"domain_scores_gemma":[0.99833655,0.00015070295,0.00047470332,0.00014055728,0.0008433752,0.00005413713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806095,0.00023027962,0.00024277388,0.0010996859,0.00020234106,0.0005916532,0.00053005456,0.000056490895,0.00019000914],"category_scores_gemma":[0.00020522719,0.00021762468,0.000058286605,0.00065821153,0.00004351194,0.0011660426,0.00016730277,0.000589052,0.0000015396049],"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.0003163493,0.00019926677,0.000823323,0.000021637661,0.00013910301,0.000108514694,0.00019511825,0.9931062,0.000052777472,0.0020241993,0.00070602633,0.0023074814],"study_design_scores_gemma":[0.003831089,0.0003527281,0.00057469535,0.00014230955,0.00012129029,0.00005901338,0.0025887561,0.96704495,0.000009940111,0.00043578946,0.024465142,0.00037426996],"about_ca_topic_score_codex":0.000166214,"about_ca_topic_score_gemma":0.0000107240085,"teacher_disagreement_score":0.1945474,"about_ca_system_score_codex":0.0003213995,"about_ca_system_score_gemma":0.00016658864,"threshold_uncertainty_score":0.88744766},"labels":[],"label_agreement":null},{"id":"W4293252697","doi":"10.5267/j.ijiec.2022.5.003","title":"Optimizing the learning process of multi-layer perceptrons using a hybrid algorithm based on MVO and SA","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Neural Networks and Applications","field":"Computer Science","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":"Artificial neural network; Computer science; Simulated annealing; Perceptron; Artificial intelligence; Machine learning; Process (computing); Heuristic; Algorithm; Convergence (economics); Data mining","score_opus":0.04562637255635546,"score_gpt":0.2973455510961347,"score_spread":0.2517191785397792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073431276,0.000033756045,0.9247337,0.0010784155,0.000592156,0.000092929826,0.0000107826,0.000019435585,0.0000075657326],"genre_scores_gemma":[0.95384604,0.0000024220983,0.045834888,0.00006692904,0.00022630674,0.0000070469036,0.0000030349163,0.0000086655555,0.0000046720334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897,0.000055870547,0.0003367841,0.00011284142,0.00042123694,0.00010331914],"domain_scores_gemma":[0.9990663,0.00029659012,0.00028426625,0.00008069956,0.00022416227,0.000048000915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002899957,0.00008790664,0.00012025989,0.00022310166,0.00020132116,0.00009300565,0.0005752397,0.000017706468,0.0000086772925],"category_scores_gemma":[0.0000718076,0.00007528185,0.0000718995,0.00025733287,0.000022191101,0.00016146232,0.00012273704,0.0005288946,2.0112098e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005604038,0.000051678304,0.000040092134,9.2449005e-7,0.000031515585,0.0000082783345,0.00023414582,0.9866494,0.00036736229,0.00037604792,0.00003242417,0.012202523],"study_design_scores_gemma":[0.0006168156,0.00008843755,0.00010346753,0.000042523443,0.0000112476655,0.00012813695,0.00010575818,0.9981607,0.00018697408,0.00004483999,0.00044112036,0.00006993558],"about_ca_topic_score_codex":0.000008450104,"about_ca_topic_score_gemma":1.2748637e-7,"teacher_disagreement_score":0.8804148,"about_ca_system_score_codex":0.00007943963,"about_ca_system_score_gemma":0.00012350683,"threshold_uncertainty_score":0.30699047},"labels":[],"label_agreement":null},{"id":"W4293252771","doi":"10.5267/j.ijiec.2022.7.003","title":"Contracts design for serial delivery with connecting time spot: From a perspective of fourth party logistics","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"State Key Laboratory of Synthetical Automation for Process Industries; National Natural Science Foundation of China","keywords":"Incentive; Computer science; Transshipment (information security); Profit (economics); Idle; Operations research; Pareto principle; Delivery system; Schedule; Operations management; Business; Microeconomics; Economics; Computer security; Operating system; Engineering","score_opus":0.047671402867204817,"score_gpt":0.2404922907122466,"score_spread":0.19282088784504178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19379325,0.000042698688,0.7998524,0.0014729484,0.003928331,0.00048157113,0.00011242941,0.000047271955,0.00026910455],"genre_scores_gemma":[0.9905066,9.397535e-7,0.0066269264,0.00012990732,0.0026402103,0.000010811866,0.000050839724,0.000020243577,0.000013544564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.000017193352,0.00039732008,0.00010832723,0.0003985518,0.000114875875],"domain_scores_gemma":[0.99815404,0.00044712974,0.0005619089,0.00005397103,0.0007672884,0.000015636093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040746157,0.000108965236,0.00019942685,0.00034263937,0.000095068826,0.00010693275,0.00029826144,0.000029255463,0.00017053273],"category_scores_gemma":[0.0005147675,0.00010704405,0.00009420971,0.00016362607,0.000018036562,0.00033550698,0.00008981856,0.00019951233,0.000002265035],"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.0005716452,0.00009862843,0.00008406755,0.0000036601593,0.00040595373,0.000027680373,0.00013231368,0.9898066,0.0003379702,0.0059639555,0.0018820489,0.00068551005],"study_design_scores_gemma":[0.006341468,0.00028009852,0.00014534066,0.00013810347,0.00024315223,0.000025027104,0.0018040612,0.96982205,0.0002703042,0.0027311582,0.017939877,0.00025937092],"about_ca_topic_score_codex":0.00014031069,"about_ca_topic_score_gemma":0.000002834688,"teacher_disagreement_score":0.79671335,"about_ca_system_score_codex":0.00018897664,"about_ca_system_score_gemma":0.00008575583,"threshold_uncertainty_score":0.43651295},"labels":[],"label_agreement":null},{"id":"W4293252833","doi":"10.5267/j.ijiec.2022.5.001","title":"A new metaheuristic approach for the meat routing problem by considering heterogeneous fleet with time windows","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Simulated annealing; Vehicle routing problem; Metaheuristic; Travelling salesman problem; Computer science; Mathematical optimization; Heuristic; Routing (electronic design automation); Operations research; Engineering; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.02869746294506607,"score_gpt":0.25335996152448875,"score_spread":0.2246624985794227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026765484,0.0002407913,0.995186,0.00043513434,0.0008600646,0.00035097654,0.00005748423,0.00012457985,0.000068464906],"genre_scores_gemma":[0.53802806,0.0000071815753,0.46073818,0.00005026851,0.0008660647,0.00004969983,0.00005418678,0.00009557286,0.0001107616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985412,0.000060373917,0.00053093553,0.00013135633,0.00052559824,0.00021053088],"domain_scores_gemma":[0.99851394,0.00080804905,0.00023551023,0.00010312292,0.00024176807,0.00009762238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778505,0.0001852373,0.00024850902,0.0002215079,0.00017176098,0.00014843479,0.0004909504,0.00004875283,0.00004180972],"category_scores_gemma":[0.00022374517,0.00016024025,0.00012382654,0.00028336776,0.000015909449,0.00013887418,0.0000701613,0.0005147206,8.053007e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040820592,0.000019271089,0.00003487767,0.0000045275956,0.0006029474,0.000008132956,0.00019920357,0.99055827,0.0006304856,0.00013470459,0.0032099136,0.004556837],"study_design_scores_gemma":[0.0015535573,0.00009553397,0.0000043774708,0.000037080474,0.00010501044,0.00055673585,0.00006198341,0.9912544,0.0005970393,0.000026774766,0.0055353865,0.000172137],"about_ca_topic_score_codex":0.000007987103,"about_ca_topic_score_gemma":2.5561508e-7,"teacher_disagreement_score":0.5353515,"about_ca_system_score_codex":0.0002251403,"about_ca_system_score_gemma":0.00014936586,"threshold_uncertainty_score":0.6534408},"labels":[],"label_agreement":null},{"id":"W4293252855","doi":"10.5267/j.ijiec.2022.7.002","title":"More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Heuristics; Dominance (genetics); Mathematical optimization; Scheduling (production processes); Computer science; Constructive; Relation (database); Job shop scheduling; Mathematics; Data mining","score_opus":0.01606371459052399,"score_gpt":0.26446453053549107,"score_spread":0.24840081594496707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020398002,0.00006751456,0.9683316,0.00063567417,0.009831211,0.00031041613,0.0002585843,0.00012155432,0.00004548274],"genre_scores_gemma":[0.67611605,0.000005450957,0.32044125,0.0002106012,0.0027885644,0.00013765387,0.00014171479,0.00009926116,0.00005945347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874794,0.000025512842,0.0005050216,0.000120070355,0.0004308499,0.00017061183],"domain_scores_gemma":[0.99858147,0.00044740425,0.0001128887,0.00008147613,0.00061706896,0.00015966335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030656712,0.00016278676,0.00023325536,0.0004894099,0.000090654146,0.00007695211,0.00038197348,0.00004898398,0.0000649034],"category_scores_gemma":[0.0007492359,0.00018268461,0.0001418002,0.00030687853,0.000009189593,0.000100719255,0.00006720048,0.000419433,0.000005531977],"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.00009597362,0.000045938617,0.00003629418,0.0000057950283,0.0002563283,0.00002306324,0.00023011751,0.99048656,0.0002105518,0.00011440443,0.0009351807,0.007559772],"study_design_scores_gemma":[0.0024044015,0.00011972519,0.00006611688,0.000050003306,0.000039290888,0.00009984935,0.00006764001,0.9906872,0.00025832033,0.00005463487,0.0059660953,0.00018671206],"about_ca_topic_score_codex":0.000006200097,"about_ca_topic_score_gemma":3.2406558e-7,"teacher_disagreement_score":0.655718,"about_ca_system_score_codex":0.00030881495,"about_ca_system_score_gemma":0.00008453109,"threshold_uncertainty_score":0.74496627},"labels":[],"label_agreement":null},{"id":"W4293252885","doi":"10.5267/j.ijiec.2022.8.001","title":"Optimization of two-dimensional irregular bin packing problem considering slit distance and free rotation of pieces","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","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":"Equidistant; Bin; Bin packing problem; Rotation (mathematics); GRASP; Algorithm; Benchmark (surveying); Mathematical optimization; Slit; Enhanced Data Rates for GSM Evolution; Mathematics; Packing problems; Minification; Computer science; Geometry; Artificial intelligence; Physics; Optics","score_opus":0.019053878419038266,"score_gpt":0.2338035660172336,"score_spread":0.21474968759819532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15596083,0.0004883055,0.8402102,0.00040820485,0.0023419631,0.00023578036,0.0001549499,0.000076293785,0.00012349061],"genre_scores_gemma":[0.9322037,0.000014364995,0.06755301,0.000008493492,0.0001482464,0.000005993373,0.00003603609,0.000024545367,0.0000055871706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998497,0.00004030432,0.00075599534,0.00009372454,0.0005083322,0.000104613195],"domain_scores_gemma":[0.9988633,0.00019729965,0.00039402625,0.00008268719,0.00040909855,0.000053617357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485233,0.00012418232,0.0002306807,0.00047509858,0.00005497647,0.000034811084,0.00023185163,0.00004281486,0.000059172376],"category_scores_gemma":[0.00015048566,0.00014334141,0.00007098144,0.00030494496,0.000029901288,0.00019104058,0.00007950566,0.00027059345,1.6473618e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002258107,0.000033234493,0.00051745557,0.000023510664,0.00016126751,0.000005045625,0.0003537407,0.99489826,0.0009514978,0.0015786331,0.00017110468,0.0012836971],"study_design_scores_gemma":[0.001591117,0.00007126523,0.00007623948,0.0001998989,0.000029844685,0.000080896185,0.00007669656,0.99629706,0.0008277621,0.00032063393,0.0003066217,0.00012196627],"about_ca_topic_score_codex":0.000011726235,"about_ca_topic_score_gemma":0.0000017141645,"teacher_disagreement_score":0.7762429,"about_ca_system_score_codex":0.000107489715,"about_ca_system_score_gemma":0.00007666285,"threshold_uncertainty_score":0.5845293},"labels":[],"label_agreement":null},{"id":"W4293252888","doi":"10.5267/j.ijiec.2022.5.002","title":"A model for location-assortment problem in a competitive environmen","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Solver; Mathematical optimization; Computer science; Integer programming; Facility location problem; Competitor analysis; Nonlinear programming; Linear programming; Product (mathematics); Operations research; Nonlinear system; Mathematics; Economics","score_opus":0.04186480303104558,"score_gpt":0.24453840394633627,"score_spread":0.20267360091529069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12686037,0.00008075275,0.84600735,0.01920575,0.0051008356,0.0013975772,0.00007741328,0.00008345662,0.0011864904],"genre_scores_gemma":[0.99571466,0.000002328801,0.0032323487,0.00030265455,0.00048332254,0.000087700784,0.00006406417,0.0000118441185,0.000101085454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888337,0.000007583915,0.00049541873,0.00010554875,0.00039526433,0.00011283873],"domain_scores_gemma":[0.9994555,0.000045299494,0.00017566461,0.000053801166,0.00025816035,0.000011558537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044634193,0.00008888351,0.00012174942,0.0005689964,0.00007102939,0.00006657323,0.00030969805,0.000021084394,0.00008679204],"category_scores_gemma":[0.0001243616,0.00010149994,0.00007368263,0.0002708985,0.000009352899,0.00034354412,0.00011429309,0.00018441677,0.000005785344],"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.000046847956,0.00015911472,0.0004969668,0.0000086202945,0.00006198745,0.0000033089393,0.00012436867,0.9641092,0.00002518516,0.03192181,0.0014683597,0.0015742318],"study_design_scores_gemma":[0.0013741144,0.000020669795,0.00057892135,0.000028506307,0.000017634971,0.0000031504344,0.00024090438,0.96662545,0.0000023707316,0.0011182299,0.029893221,0.0000968143],"about_ca_topic_score_codex":0.00008006705,"about_ca_topic_score_gemma":0.000026554935,"teacher_disagreement_score":0.8688543,"about_ca_system_score_codex":0.00030664628,"about_ca_system_score_gemma":0.000072445175,"threshold_uncertainty_score":0.41390476},"labels":[],"label_agreement":null},{"id":"W4293252900","doi":"10.5267/j.ijiec.2022.6.002","title":"Hopfield neural network based on clustering algorithms for solving green vehicle routing problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Color perception and design","field":"Psychology","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":"Vehicle routing problem; Cluster analysis; Artificial neural network; Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.06986691094752771,"score_gpt":0.3219841071336355,"score_spread":0.2521171961861078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056293827,0.000028943925,0.9248537,0.005026107,0.012719735,0.00044419803,0.000051329407,0.00010271367,0.0004794443],"genre_scores_gemma":[0.98822325,2.5471718e-7,0.008397887,0.0004682387,0.002717459,0.00004221345,0.000019825786,0.000025920395,0.00010495369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869627,0.000062730694,0.0005101695,0.00013944748,0.00038390906,0.00020745733],"domain_scores_gemma":[0.99873364,0.00063250854,0.00027658395,0.00007719931,0.00020601536,0.00007407843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059415115,0.000116598385,0.00016209681,0.0002937437,0.00016246618,0.000070615904,0.00033674348,0.000060121303,0.00038124577],"category_scores_gemma":[0.00010350826,0.00012984952,0.00016634702,0.00019694868,0.000009635058,0.00008562188,0.00006201037,0.0005260501,0.0000036447423],"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.00025923376,0.00008049064,0.00028788886,0.0000015550844,0.00009265306,0.000030983418,0.00045895105,0.97077185,0.00010451317,0.00048636348,0.0030999335,0.024325563],"study_design_scores_gemma":[0.0024434559,0.0005044935,0.0006710989,0.00004752346,0.000020415098,0.00008277275,0.00024413214,0.99276054,0.0000074424693,0.00008497689,0.003005331,0.0001278281],"about_ca_topic_score_codex":0.000039416107,"about_ca_topic_score_gemma":0.0000021627666,"teacher_disagreement_score":0.9319294,"about_ca_system_score_codex":0.00020730053,"about_ca_system_score_gemma":0.00008116783,"threshold_uncertainty_score":0.529511},"labels":[],"label_agreement":null},{"id":"W4293252951","doi":"10.5267/j.ijiec.2022.7.004","title":"Two-stage stochastic programming for the inventory routing problem with stochastic demands in fuel delivery","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Solver; Stochastic programming; Routing (electronic design automation); Context (archaeology); Operations research; Heuristic; Mathematics","score_opus":0.0322007951797287,"score_gpt":0.2770254553558977,"score_spread":0.24482466017616897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04601765,0.0001445395,0.95160955,0.00027929197,0.0014248156,0.0004088024,0.000020524032,0.000082503815,0.000012317786],"genre_scores_gemma":[0.9510953,0.000001705414,0.048250094,0.000017905506,0.00046955654,0.00009102827,0.000013309181,0.00004809497,0.0000130413455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855953,0.00005414012,0.0005629717,0.00011459527,0.0004831805,0.00022557139],"domain_scores_gemma":[0.998508,0.00083577796,0.0002364541,0.00008111904,0.00027604698,0.00006261702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009734114,0.00015697358,0.00019654736,0.00046448337,0.00011852561,0.00010101862,0.00043598836,0.00004002094,0.000012058142],"category_scores_gemma":[0.000282758,0.00014250987,0.00008871966,0.00042509486,0.000021738353,0.00018736617,0.000071596776,0.000667503,3.2944786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058967813,0.000031923064,0.00011394308,0.000008965893,0.00019175856,0.000012317399,0.00079011405,0.99284256,0.000041501808,0.0005875077,0.000035203204,0.005285219],"study_design_scores_gemma":[0.0023188146,0.000103388826,0.00005536355,0.0001253254,0.000042186355,0.00010710198,0.00068304513,0.9960011,0.00000950737,0.000039736668,0.0003656571,0.00014873815],"about_ca_topic_score_codex":0.000013881619,"about_ca_topic_score_gemma":0.000006579952,"teacher_disagreement_score":0.90507764,"about_ca_system_score_codex":0.00046345606,"about_ca_system_score_gemma":0.00016235393,"threshold_uncertainty_score":0.5811384},"labels":[],"label_agreement":null},{"id":"W4293252962","doi":"10.5267/j.ijiec.2022.8.003","title":"Bi-objective optimization of identical parallel machine scheduling with flexible maintenance and job release times","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Tardiness; Crossover; Mathematical optimization; Job shop scheduling; Computer science; Scheduling (production processes); Taguchi methods; Minification; Algorithm; Mathematics; Artificial intelligence; Schedule; Machine learning","score_opus":0.01299240473623745,"score_gpt":0.23498771834511153,"score_spread":0.2219953136088741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038446896,0.00021936787,0.95973575,0.0002781968,0.0010183795,0.000090326896,0.000032994583,0.00007212622,0.00010594488],"genre_scores_gemma":[0.79194325,0.000038367572,0.20771639,0.000014764386,0.00020767366,0.000006248302,0.000019824753,0.000027487167,0.00002600777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988393,0.000027842158,0.00049624586,0.000096059164,0.00042359674,0.00011694833],"domain_scores_gemma":[0.9991595,0.00015112967,0.00018493048,0.00005967254,0.0003646544,0.0000800754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023985958,0.00012430894,0.00019810257,0.0004248195,0.00006305798,0.000050930215,0.00019922596,0.000044005763,0.0000657936],"category_scores_gemma":[0.00019005421,0.00012399368,0.000056760226,0.00031730052,0.00002998192,0.00020052356,0.000049436552,0.00041676234,5.687111e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007916925,0.000032439228,0.0003777614,0.0000057005423,0.00021339835,0.000019197178,0.00015937582,0.99734914,0.00004783433,0.00086603814,0.00005386872,0.0007960656],"study_design_scores_gemma":[0.0015785317,0.00011604898,0.00016385688,0.00009364627,0.000036155987,0.000234688,0.00017232925,0.99718475,0.00015449892,0.00006883999,0.00007494789,0.00012168657],"about_ca_topic_score_codex":0.000009942271,"about_ca_topic_score_gemma":3.4664401e-7,"teacher_disagreement_score":0.75349635,"about_ca_system_score_codex":0.00013010947,"about_ca_system_score_gemma":0.00008491996,"threshold_uncertainty_score":0.50563157},"labels":[],"label_agreement":null},{"id":"W4293253022","doi":"10.5267/j.ijiec.2022.6.001","title":"Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"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":"Pickup; Memetic algorithm; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Genetic algorithm; Computer science; Set (abstract data type); Local search (optimization); Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.015429245592927108,"score_gpt":0.2521010675512609,"score_spread":0.23667182195833378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293253022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0372508,0.00017912444,0.9605729,0.00055864704,0.0010985715,0.000216499,0.00003759766,0.000075137665,0.0000107093965],"genre_scores_gemma":[0.80861336,0.00001572654,0.1909883,0.0000264902,0.0002732872,0.000021243837,0.0000086645805,0.00003630023,0.000016629472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999029,0.00003699921,0.00035073634,0.000088975605,0.00035177942,0.00014254512],"domain_scores_gemma":[0.9981301,0.001318261,0.0001447478,0.000061467756,0.00029393574,0.000051527237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884057,0.00011777893,0.0001433629,0.0001980506,0.00016406529,0.00009340201,0.00028448208,0.00003468672,0.000009841037],"category_scores_gemma":[0.00016877719,0.00010157001,0.000056517245,0.0002180871,0.000020212568,0.000117305615,0.00005897482,0.00041530305,2.460633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015598724,0.000012330425,0.00003638393,0.0000029309358,0.00021606106,0.000013307525,0.00019382856,0.90454155,0.00016160263,0.00008713613,0.000047929538,0.09467134],"study_design_scores_gemma":[0.0011852599,0.00011632708,0.000041010666,0.00003816021,0.000054414264,0.00026232377,0.00019837951,0.99617124,0.000058597256,0.00003190908,0.0017302602,0.00011212484],"about_ca_topic_score_codex":0.0000055044925,"about_ca_topic_score_gemma":8.596177e-7,"teacher_disagreement_score":0.77136254,"about_ca_system_score_codex":0.0002129322,"about_ca_system_score_gemma":0.00007100074,"threshold_uncertainty_score":0.41419047},"labels":[],"label_agreement":null},{"id":"W4293253066","doi":"10.5267/j.ijiec.2022.7.001","title":"Optimal subsidy strategies in a smart supply chain driven by dual innovation","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Subsidy; Supply chain; Stackelberg competition; Government (linguistics); Business; Industrial organization; Supply chain risk management; Supply chain management; Product (mathematics); Production (economics); Dual (grammatical number); Service management; Environmental economics; Economics; Microeconomics; Marketing; Market economy","score_opus":0.01713965323748696,"score_gpt":0.23629253306048015,"score_spread":0.2191528798229932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293253066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95741934,0.000035921574,0.033067487,0.0053038048,0.00334984,0.00029497722,0.000022668592,0.0000632788,0.00044269484],"genre_scores_gemma":[0.99753743,0.0000015367865,0.00062285655,0.00025564968,0.0013250933,0.000026573067,0.00014512276,0.000024694134,0.000061062834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820423,0.000022292046,0.0007055839,0.00014261871,0.0007159824,0.00020930122],"domain_scores_gemma":[0.9988625,0.00009999535,0.00044733644,0.00007172379,0.00050606503,0.000012398685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898169,0.00014746991,0.0001821633,0.001940737,0.00009362321,0.0003673789,0.00044735646,0.00004349895,0.00021261563],"category_scores_gemma":[0.0002784282,0.00017330314,0.00006749485,0.0012713466,0.000018450557,0.0010994921,0.00024959224,0.0005218266,0.0000051843754],"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.00006433629,0.00012117804,0.0032761302,0.000007852351,0.00009448425,0.00015060036,0.00011710633,0.9635589,0.00023497778,0.023642225,0.007686788,0.001045421],"study_design_scores_gemma":[0.0065977126,0.00013891137,0.0057117594,0.00011802098,0.00006333584,0.000103091596,0.008681952,0.8537648,0.00004978172,0.0018833651,0.12230056,0.0005867346],"about_ca_topic_score_codex":0.00019509358,"about_ca_topic_score_gemma":0.0000071414315,"teacher_disagreement_score":0.11461377,"about_ca_system_score_codex":0.0004307139,"about_ca_system_score_gemma":0.00015439546,"threshold_uncertainty_score":0.7067097},"labels":[],"label_agreement":null},{"id":"W4293253086","doi":"10.5267/j.ijiec.2022.8.002","title":"Heterogeneous-vehicle distribution logistics planning for assembly line station materials with multiple time windows and multiple visits","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"National Natural Science Foundation of China","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Computer science; Ant colony optimization algorithms; Routing (electronic design automation); Genetic algorithm; Local search (optimization); Convergence (economics); Algorithm; Mathematics","score_opus":0.023365243061437353,"score_gpt":0.25111053735487754,"score_spread":0.22774529429344018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293253086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18790297,0.000039603798,0.8103634,0.00006296491,0.00080182165,0.00016554056,0.00058894965,0.00007255383,0.0000021832875],"genre_scores_gemma":[0.98593897,0.000007077907,0.012930912,0.000010452521,0.00040771786,0.000014668436,0.00065210473,0.000031407722,0.000006709203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990691,0.000021194737,0.00040482404,0.00010342039,0.0002616078,0.00013987976],"domain_scores_gemma":[0.9989545,0.00049353443,0.00018998087,0.000051275925,0.00024985746,0.00006090568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018256893,0.0001354083,0.00017636654,0.00015959407,0.000113588205,0.00008407219,0.00013836841,0.00004949749,0.000008119598],"category_scores_gemma":[0.00037151526,0.00014183894,0.000034361186,0.000087774846,0.0000129366435,0.0001622075,0.000036443555,0.00020718783,5.031532e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015483724,0.00002854016,0.00008223364,0.0000089880705,0.00012262433,0.000015346775,0.000084855135,0.994936,0.0031762808,0.0000723497,0.00014628055,0.0011716614],"study_design_scores_gemma":[0.001996321,0.00023580961,0.00013386425,0.00005077114,0.000034925943,0.00007909168,0.00003405689,0.9884683,0.007681093,0.00007265923,0.0010582999,0.00015479558],"about_ca_topic_score_codex":0.000004603247,"about_ca_topic_score_gemma":6.1698256e-7,"teacher_disagreement_score":0.798036,"about_ca_system_score_codex":0.00020278903,"about_ca_system_score_gemma":0.000034140026,"threshold_uncertainty_score":0.5784024},"labels":[],"label_agreement":null},{"id":"W4309716479","doi":"10.5267/j.ijiec.2022.11.001","title":"Sales mode selection strategic analysis for risk-averse manufacturers under revenue sharing contracts","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Risk aversion (psychology); Business; Microeconomics; Profit (economics); Revenue; Supply chain; Revenue sharing; Commission; Competition (biology); Industrial organization; Market share; Principal–agent problem; Economics; Marketing; Expected utility hypothesis; Finance; Financial economics","score_opus":0.04996501676237946,"score_gpt":0.2660096670565612,"score_spread":0.21604465029418174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72361887,0.00003337052,0.2683995,0.0017433946,0.0053856135,0.00035498143,0.00011240169,0.000072252114,0.0002796345],"genre_scores_gemma":[0.99700296,0.0000028429045,0.0005734574,0.00021854245,0.0019773983,0.000016396032,0.000121377125,0.000017110342,0.00006990876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888194,0.0000126405175,0.000414661,0.00013590191,0.00041664427,0.00013820748],"domain_scores_gemma":[0.9990025,0.0000993409,0.00054020947,0.000059357324,0.00028001892,0.000018529121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046050266,0.000114758164,0.00017702008,0.0010506538,0.00017818686,0.00023337324,0.00034908456,0.000036342975,0.00014129838],"category_scores_gemma":[0.00011121843,0.0001259653,0.00023304112,0.0004630086,0.000009291454,0.00043166976,0.00008829649,0.00031964845,0.0000037785217],"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.00006740554,0.00005769838,0.0020042073,0.000004334444,0.001050497,0.000006996181,0.00003252913,0.98458713,0.000060921,0.010013583,0.0017252251,0.0003894462],"study_design_scores_gemma":[0.0017311232,0.00003611417,0.001888597,0.000023494014,0.0005707472,0.0000096477315,0.0004946695,0.96808684,0.000023035092,0.0044837124,0.022474913,0.00017712434],"about_ca_topic_score_codex":0.00020034223,"about_ca_topic_score_gemma":0.000032622316,"teacher_disagreement_score":0.27338412,"about_ca_system_score_codex":0.0002640433,"about_ca_system_score_gemma":0.000041263644,"threshold_uncertainty_score":0.51367164},"labels":[],"label_agreement":null},{"id":"W4309716485","doi":"10.5267/j.ijiec.2022.10.005","title":"A unifying framework and a mathematical model for the Slab Stack Shuffling Problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Shuffling; Slab; USable; Computer science; Context (archaeology); Supply chain; Shipbuilding; Operations research; Process (computing); Stack (abstract data type); Mill; Quality (philosophy); Engineering; Mechanical engineering; Business; Structural engineering; World Wide Web","score_opus":0.0420482785143213,"score_gpt":0.27463872370357484,"score_spread":0.23259044518925354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026569723,0.000170483,0.9956806,0.00051861175,0.0007291678,0.00014189737,0.0000290708,0.000053238557,0.000020010499],"genre_scores_gemma":[0.8255063,0.000022225377,0.174065,0.000021337753,0.00031945706,0.00002410058,0.000006173764,0.000022787988,0.000012613845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925965,0.000008582037,0.00032675915,0.0000615831,0.00023793054,0.000105484796],"domain_scores_gemma":[0.99899954,0.00068417855,0.00009502197,0.000052784202,0.00012872597,0.000039747287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002455174,0.00008926908,0.0001129615,0.00014551895,0.00011210592,0.00006949098,0.00021162441,0.00003786221,0.000008019912],"category_scores_gemma":[0.00026755815,0.00007944133,0.000053029373,0.000086018365,0.00001418095,0.000097945165,0.000049247366,0.00043172052,2.0477471e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001584698,0.000012222695,0.000003592631,0.000008590384,0.00010782273,0.0000025347883,0.0005725537,0.98668754,0.000025916393,0.009579466,0.0001738051,0.0028100857],"study_design_scores_gemma":[0.00042929553,0.000028448701,0.000002885607,0.000048457467,0.000028655908,0.00005674709,0.00014294482,0.9858673,0.000035822264,0.012597533,0.00068286277,0.0000790112],"about_ca_topic_score_codex":6.8212756e-7,"about_ca_topic_score_gemma":1.12393856e-7,"teacher_disagreement_score":0.82284933,"about_ca_system_score_codex":0.00012432084,"about_ca_system_score_gemma":0.000039527207,"threshold_uncertainty_score":0.32395232},"labels":[],"label_agreement":null},{"id":"W4309716668","doi":"10.5267/j.ijiec.2022.9.001","title":"Investigating the collective impact of postponement, scrap, and external suppliers on multiproduct replenishing decision","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"Postponement; Scrap; Outsourcing; Quality (philosophy); Production (economics); Process (computing); Industrial organization; Product (mathematics); Finished good; Production planning; Business; Manufacturing engineering; Operations management; Computer science; Risk analysis (engineering); Engineering; Marketing; Economics; Microeconomics","score_opus":0.024697197042830958,"score_gpt":0.2554607179983245,"score_spread":0.23076352095549352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99215764,0.000037762165,0.004849453,0.0010251863,0.0016545507,0.00016395497,0.000009685413,0.000015702679,0.00008608769],"genre_scores_gemma":[0.9974526,0.0000022561817,0.001341754,0.000101162346,0.0010590839,0.000005344926,0.000014018984,0.000013427535,0.000010311957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987264,0.000018701878,0.00046258286,0.000120814846,0.0005704536,0.00010102951],"domain_scores_gemma":[0.9986915,0.00023812539,0.00057558774,0.00006908299,0.00041081145,0.000014902254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741335,0.000107068096,0.0001394762,0.00052993005,0.00021561873,0.00016422861,0.00032063722,0.000020133371,0.000051275034],"category_scores_gemma":[0.0011703174,0.0000861421,0.00008484454,0.0004396479,0.000027252847,0.00044806954,0.00016405918,0.00033696744,8.8893063e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001584655,0.00006187634,0.017612178,0.0000036157217,0.00019333024,0.000008048929,0.00036924478,0.9666735,0.0020984306,0.0014919011,0.002646969,0.008682462],"study_design_scores_gemma":[0.014220305,0.00071968616,0.27234638,0.0011601333,0.00031194236,0.0004940714,0.0021708955,0.68522364,0.0017843458,0.013550758,0.0070108585,0.0010069769],"about_ca_topic_score_codex":0.000066216504,"about_ca_topic_score_gemma":0.0000011321247,"teacher_disagreement_score":0.28144982,"about_ca_system_score_codex":0.00024019205,"about_ca_system_score_gemma":0.00016465962,"threshold_uncertainty_score":0.3512773},"labels":[],"label_agreement":null},{"id":"W4309716671","doi":"10.5267/j.ijiec.2022.10.001","title":"Minimizing operating expenditures for a manufacturing system featuring quality reassurances, probabilistic failures, overtime, and outsourcing","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Quality and Supply Management","field":"Business, Management and Accounting","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":"Overtime; Outsourcing; Quality (philosophy); Probabilistic logic; Computer science; Job shop; Function (biology); Order (exchange); Operations research; Reliability engineering; Risk analysis (engineering); Operations management; Engineering; Business; Economics; Routing (electronic design automation)","score_opus":0.03557321196508803,"score_gpt":0.26334819551858957,"score_spread":0.22777498355350154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8079298,0.00026107611,0.177788,0.004852247,0.0074497988,0.0009754365,0.00007181782,0.00020543649,0.0004663881],"genre_scores_gemma":[0.99449325,9.373176e-7,0.0030375107,0.00010068756,0.0022522195,0.000038732996,0.000033947435,0.000021949003,0.000020788104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837327,0.00003290604,0.00070213433,0.00017748757,0.00053283776,0.00018136737],"domain_scores_gemma":[0.99886703,0.00032425093,0.0004979993,0.0000768997,0.00021074223,0.000023047018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010748776,0.00015300531,0.0002541275,0.00043500995,0.00033225009,0.00048013247,0.00034711466,0.000038881408,0.000018885554],"category_scores_gemma":[0.0004253865,0.00015947412,0.000106440246,0.00010600622,0.000015159832,0.0006264122,0.00024162297,0.00033583312,9.766513e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000835509,0.000047596084,0.0003871855,0.00013497527,0.00018800276,0.000025289337,0.0001770378,0.9793715,0.00014298098,0.015816806,0.00058629434,0.003038763],"study_design_scores_gemma":[0.007943721,0.00013248612,0.00539366,0.0011652391,0.00027553944,0.00028232604,0.008291735,0.87113553,0.00038944287,0.0009612142,0.103057064,0.00097201375],"about_ca_topic_score_codex":0.00021344172,"about_ca_topic_score_gemma":0.0000069380812,"teacher_disagreement_score":0.18656343,"about_ca_system_score_codex":0.00022946295,"about_ca_system_score_gemma":0.00004223506,"threshold_uncertainty_score":0.65031654},"labels":[],"label_agreement":null},{"id":"W4309716697","doi":"10.5267/j.ijiec.2022.9.004","title":"Multi-fidelity simulation optimization for production releasing in re-entrant mixed-flow shops","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"National Natural Science Foundation of China","keywords":"Fidelity; Discrete event simulation; Mathematical optimization; Computer science; Flow (mathematics); Routing (electronic design automation); Production (economics); Computation; Scale (ratio); High fidelity; Industrial engineering; Simulation; Algorithm; Engineering; Mathematics","score_opus":0.04072147039296904,"score_gpt":0.28110189164792765,"score_spread":0.24038042125495862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023279268,0.00006606924,0.9709385,0.000189694,0.0051550646,0.00023853473,0.000038842576,0.00008778511,0.000006212608],"genre_scores_gemma":[0.8226146,0.000020410938,0.17672253,0.0000088486095,0.00048320892,0.000019576006,0.0000973537,0.000028243805,0.0000052268156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987433,0.000034802997,0.0006355188,0.00012590381,0.00031588387,0.00014458435],"domain_scores_gemma":[0.99916166,0.00022511053,0.00018237215,0.00007079259,0.00031522027,0.000044842596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031424125,0.00012768434,0.0001657116,0.0004906477,0.00008646982,0.00004488379,0.00018243502,0.000059673366,0.00001462704],"category_scores_gemma":[0.00070117036,0.00015513055,0.00007807661,0.00023365139,0.000012269646,0.00029531692,0.000026768948,0.00038548396,2.7102075e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006497752,0.00006274775,0.000047753852,0.000008800576,0.000052746072,0.000005632653,0.00020719567,0.99216455,0.00012637324,0.000052906315,0.00009253683,0.0071137524],"study_design_scores_gemma":[0.0012714847,0.00004691888,0.00016182654,0.000055007855,0.000017749202,0.000020062658,0.00012261406,0.99728787,0.00020881314,0.000098825396,0.000572098,0.00013673732],"about_ca_topic_score_codex":0.0000043563136,"about_ca_topic_score_gemma":0.000002369923,"teacher_disagreement_score":0.79933536,"about_ca_system_score_codex":0.00056240096,"about_ca_system_score_gemma":0.000053400516,"threshold_uncertainty_score":0.63260406},"labels":[],"label_agreement":null},{"id":"W4309716757","doi":"10.5267/j.ijiec.2022.10.002","title":"To reduce maximum tardiness by Seru Production: model, cooperative algorithm combining reinforcement learning and insights","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"National Natural Science Foundation of China","keywords":"Tardiness; Heuristics; Computer science; Reinforcement learning; Algorithm; Mathematical optimization; Trimming; Scheduling (production processes); Mathematics; Job shop scheduling; Artificial intelligence; Schedule","score_opus":0.05299741288472434,"score_gpt":0.3623278408631616,"score_spread":0.30933042797843724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2078025,0.00011057147,0.7761792,0.009278613,0.0057167197,0.0006437767,0.00003255393,0.00006425371,0.00017182445],"genre_scores_gemma":[0.9779791,0.000035898905,0.020136666,0.00025594205,0.0007500386,0.00008403898,0.0001163451,0.000028163298,0.0006137991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809986,0.0002191737,0.00079766486,0.00017312911,0.00052522344,0.00018497232],"domain_scores_gemma":[0.9980972,0.00020108365,0.0003055899,0.00006276435,0.0011729061,0.00016047242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006639835,0.00013232103,0.00021875658,0.00038562424,0.00086053216,0.000052246098,0.00018471472,0.00007407991,0.000092129005],"category_scores_gemma":[0.00069226563,0.0001377573,0.000038846058,0.0003703178,0.000014699356,0.00026675803,0.00014942017,0.0011386256,0.000003572128],"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.00004818636,0.000033754626,0.00008368481,0.000004283401,0.00007741858,0.0000048565785,0.004413171,0.9873373,0.0004837999,0.0005583219,0.0036056403,0.0033496092],"study_design_scores_gemma":[0.0012854987,0.00025194045,0.000016055159,0.00015747143,0.000017832976,0.000042417032,0.0033389302,0.9775179,0.00009854631,0.0000653819,0.017047714,0.00016031333],"about_ca_topic_score_codex":0.00003354479,"about_ca_topic_score_gemma":0.0000014900236,"teacher_disagreement_score":0.7701766,"about_ca_system_score_codex":0.00047107213,"about_ca_system_score_gemma":0.00054881227,"threshold_uncertainty_score":0.66186047},"labels":[],"label_agreement":null},{"id":"W4309716783","doi":"10.5267/j.ijiec.2022.10.003","title":"Multi-decision points model to solve coupled-task scheduling problem with heterogeneous multi-AGV in manufacturing systems","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Dynamic priority scheduling; Computer science; Rate-monotonic scheduling; Two-level scheduling; Fair-share scheduling; Scheduling (production processes); Tabu search; Job shop scheduling; Fixed-priority pre-emptive scheduling; Flow shop scheduling; Simulated annealing; Automated guided vehicle; Mathematical optimization; Round-robin scheduling; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Schedule","score_opus":0.031863263616183884,"score_gpt":0.2598403450431686,"score_spread":0.22797708142698472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1345666,0.00006113214,0.8635895,0.000053104213,0.001372007,0.00022923203,0.000034438275,0.00008975962,0.000004221556],"genre_scores_gemma":[0.71122855,0.000007991084,0.28852034,0.000013126217,0.00014266123,0.000023784227,0.00001712496,0.00004108682,0.0000053337294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837303,0.000015527314,0.0006788012,0.00017244094,0.0005271997,0.00023302197],"domain_scores_gemma":[0.99926364,0.00014631507,0.00017265094,0.00010356035,0.000189754,0.00012406237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027448617,0.00020738636,0.0002612765,0.00076922926,0.00008142845,0.00010363505,0.00038021294,0.0000663796,0.000006265462],"category_scores_gemma":[0.00009562343,0.00021601992,0.00006642708,0.00019049658,0.000010368677,0.00020585654,0.00009337649,0.000640781,0.0000022233487],"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.000070022914,0.00007244881,0.000032792927,0.000008749193,0.000105270774,0.000085840984,0.00027051123,0.99818397,0.00030899962,0.000046783614,0.000014841305,0.0007997503],"study_design_scores_gemma":[0.0020803555,0.00008154051,0.000056218214,0.00019729786,0.000015709273,0.00018276878,0.000085047024,0.99655986,0.00036361523,0.000038220376,0.00011963254,0.00021971276],"about_ca_topic_score_codex":0.000017113327,"about_ca_topic_score_gemma":0.000005418988,"teacher_disagreement_score":0.57666194,"about_ca_system_score_codex":0.0006502573,"about_ca_system_score_gemma":0.0000726255,"threshold_uncertainty_score":0.88090366},"labels":[],"label_agreement":null},{"id":"W4309716785","doi":"10.5267/j.ijiec.2022.8.004","title":"Metaheuristic algorithm for the location, routing and packing problem in the collection of recyclable waste","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Tabu search; Vehicle routing problem; GRASP; Metaheuristic; Mathematical optimization; Greedy randomized adaptive search procedure; Routing (electronic design automation); Guided Local Search; Computer science; Set (abstract data type); Packing problems; Greedy algorithm; Local search (optimization); Combinatorial optimization; Scheme (mathematics); Algorithm; Mathematics","score_opus":0.030770653385703135,"score_gpt":0.275353779444464,"score_spread":0.24458312605876084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010636002,0.00021759917,0.98673326,0.00080209126,0.0012891582,0.0002660927,0.000014738407,0.000020182822,0.000020883488],"genre_scores_gemma":[0.91002756,0.000020217345,0.089510016,0.000019354793,0.00034864462,0.00003844103,0.0000071002128,0.00001939887,0.000009244308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989386,0.000091518545,0.00049035315,0.000063148254,0.00031896165,0.000097372154],"domain_scores_gemma":[0.9980477,0.0013384479,0.00021493348,0.000059265018,0.00032150617,0.000018121027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016089592,0.00008042152,0.00013322741,0.0002721326,0.000121925084,0.000054922653,0.00028301732,0.00003035362,0.0000042734523],"category_scores_gemma":[0.000469939,0.00006556412,0.000049426322,0.0005525941,0.000015188011,0.000108719076,0.00003491286,0.00035365872,5.8647665e-8],"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.0000074513873,0.000015195336,0.00012877598,0.000005629192,0.000099725745,0.0000014220302,0.0007420138,0.98075515,0.00009126184,0.00043170154,0.00027190917,0.017449765],"study_design_scores_gemma":[0.00073626277,0.000048135455,0.00018392291,0.00005274458,0.00003649402,0.000090615526,0.00067276414,0.99703515,0.00014125735,0.00016198793,0.0007806991,0.000059997972],"about_ca_topic_score_codex":0.000015042151,"about_ca_topic_score_gemma":0.0000010375687,"teacher_disagreement_score":0.8993916,"about_ca_system_score_codex":0.00014932078,"about_ca_system_score_gemma":0.00007389176,"threshold_uncertainty_score":0.2673627},"labels":[],"label_agreement":null},{"id":"W4309716834","doi":"10.5267/j.ijiec.2022.9.002","title":"Half-open time-dependent multi-depot electric vehicle routing problem considering battery recharging and swapping","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":15,"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":"Simulated annealing; Electric vehicle; Vehicle routing problem; Battery (electricity); Transport engineering; Environmental economics; Integer programming; Green logistics; Total cost; Operations research; Sustainable development; Computer science; Automotive engineering; Routing (electronic design automation); Engineering; Business; Computer network; Economics","score_opus":0.020963867815531483,"score_gpt":0.23631110929122817,"score_spread":0.2153472414756967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82767874,0.0009552722,0.16470759,0.0017041516,0.0035329375,0.0006116819,0.000038003564,0.00034233206,0.00042931407],"genre_scores_gemma":[0.99103105,0.000022087544,0.008307626,0.0000763792,0.0004616277,0.000012022932,0.000008562447,0.000047673555,0.000032983025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985004,0.000045651028,0.00063744345,0.00015089451,0.00041261164,0.00025299357],"domain_scores_gemma":[0.9992489,0.00019450122,0.00022015619,0.0000741421,0.00016116373,0.0001011118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005018295,0.0001788392,0.00025719972,0.0004638656,0.00017835372,0.00026043356,0.0005123581,0.000066781584,0.00008910617],"category_scores_gemma":[0.00010345656,0.00020426261,0.00006988026,0.00033090284,0.000008764973,0.00039387273,0.0002440608,0.00094512146,0.0000031477043],"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.000015625023,0.000023148115,0.00038453544,0.0000061348583,0.00023466322,0.00006194998,0.00024341092,0.9611063,0.02277746,0.00013462124,0.00050007866,0.0145120425],"study_design_scores_gemma":[0.0018567573,0.00009129673,0.0003366647,0.00012112335,0.000032250282,0.00094829226,0.000109311746,0.99143314,0.0022487172,0.00014239294,0.0024176843,0.00026235593],"about_ca_topic_score_codex":0.000025623698,"about_ca_topic_score_gemma":8.223508e-7,"teacher_disagreement_score":0.16335231,"about_ca_system_score_codex":0.00040102843,"about_ca_system_score_gemma":0.00010460313,"threshold_uncertainty_score":0.83295876},"labels":[],"label_agreement":null},{"id":"W4309716977","doi":"10.5267/j.ijiec.2022.9.003","title":"A matheuristic based solution approach for the general lot sizing and scheduling problem with sequence dependent changeovers and back ordering","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Mathematical optimization; Sizing; Simulated annealing; Scheduling (production processes); Integer programming; Sequence (biology); Variable neighborhood search; Computer science; Mathematics; Metaheuristic","score_opus":0.040796967387068325,"score_gpt":0.2478680294642839,"score_spread":0.2070710620772156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032614015,0.0002530632,0.9659929,0.0003272861,0.0005502855,0.00018563638,0.00002446418,0.00003962946,0.000012692758],"genre_scores_gemma":[0.6537202,0.000017105423,0.34587187,0.000024630595,0.00029573013,0.000027315687,0.000014860566,0.000022408598,0.000005857564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925005,0.000015448071,0.00025122555,0.00009472667,0.00026827076,0.000120292665],"domain_scores_gemma":[0.99943465,0.00021687274,0.00010317397,0.000042971777,0.00015036545,0.000051951283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029776184,0.000107611784,0.00011336934,0.00018274195,0.00014349227,0.00011236312,0.00014968352,0.000031003776,0.0000070858564],"category_scores_gemma":[0.00006407436,0.00009349937,0.000031225554,0.00013786767,0.000019988473,0.000116792,0.00003660429,0.00029151974,1.3086527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029857605,0.000012920007,0.00006066925,0.000012753338,0.00011535831,0.0000034998588,0.00018872572,0.99610144,0.00020917752,0.00016329224,0.000011457105,0.0030908624],"study_design_scores_gemma":[0.0012118166,0.00007074007,0.00002617959,0.000046862475,0.000036021578,0.00019088383,0.00020303584,0.99785703,0.00006964563,0.000013646689,0.0001695124,0.000104635335],"about_ca_topic_score_codex":0.000009128302,"about_ca_topic_score_gemma":5.409061e-7,"teacher_disagreement_score":0.6211062,"about_ca_system_score_codex":0.00012965458,"about_ca_system_score_gemma":0.0000604961,"threshold_uncertainty_score":0.38127938},"labels":[],"label_agreement":null},{"id":"W4309717115","doi":"10.5267/j.ijiec.2022.10.004","title":"Unrelated parallel machine scheduling with machine processing cost","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Job shop scheduling; Mathematical optimization; Computer science; Single-machine scheduling; Scheduling (production processes); Multi-objective optimization; Pareto principle; Schedule; Mathematics","score_opus":0.019536357505162943,"score_gpt":0.24572606074858788,"score_spread":0.22618970324342494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309717115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021427827,0.0006054659,0.974185,0.0005726168,0.0026132623,0.00014766068,0.000051354462,0.00023366149,0.00016318],"genre_scores_gemma":[0.9085714,0.000016622955,0.09075021,0.000038467366,0.00045514436,0.000013814915,0.000077130215,0.00005147387,0.000025742154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985827,0.000027668302,0.0005253676,0.000105235486,0.0005893755,0.00016963504],"domain_scores_gemma":[0.99920595,0.000102989834,0.00018950566,0.00006931818,0.00032465742,0.00010756173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027428273,0.00016821898,0.00020113737,0.0004970885,0.0001276368,0.000110427216,0.00037036053,0.00005453652,0.00010587423],"category_scores_gemma":[0.00008773439,0.00016642151,0.000074606665,0.00046537508,0.000016464404,0.00022805583,0.0000488442,0.00086051354,0.000002711371],"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.000053277618,0.000044634802,0.00024179257,0.0000038525463,0.00021317338,0.000066859684,0.00017287867,0.9907123,0.000050408675,0.000120344805,0.000072531606,0.008247953],"study_design_scores_gemma":[0.002052615,0.00007991051,0.000053410557,0.00008402621,0.000034961253,0.0005029666,0.000102432714,0.99511456,0.000065608496,0.000023501843,0.0017057558,0.00018022221],"about_ca_topic_score_codex":0.000007642364,"about_ca_topic_score_gemma":8.938614e-7,"teacher_disagreement_score":0.88714355,"about_ca_system_score_codex":0.00026964725,"about_ca_system_score_gemma":0.0001284796,"threshold_uncertainty_score":0.6786472},"labels":[],"label_agreement":null},{"id":"W4323342146","doi":"10.5267/j.ijiec.2022.11.002","title":"A hybrid delayed differentiation multiproduct EPQ model with scrap and end-products multi-shipment policy","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Scrap; Production (economics); Computer science; Supply chain; Quality (philosophy); Process (computing); Operations research; Operations management; Business; Reliability engineering; Economics; Engineering; Microeconomics","score_opus":0.049598028668130165,"score_gpt":0.25665760745497707,"score_spread":0.2070595787868469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8464282,0.000052485706,0.13917921,0.011120785,0.0025239924,0.00036765923,0.000019632711,0.00016472123,0.00014329594],"genre_scores_gemma":[0.9945542,0.00001974083,0.0021376016,0.00020182764,0.002851638,0.000008985851,0.000078558696,0.000025248537,0.00012215624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987535,0.000007982664,0.00040429356,0.00017572094,0.00048123303,0.0001772777],"domain_scores_gemma":[0.9990516,0.000044785276,0.0002974531,0.00008881511,0.0004895902,0.000027807098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382497,0.00015768032,0.00016310564,0.0011778657,0.000076018965,0.00026709278,0.0002475016,0.00003374051,0.000012944473],"category_scores_gemma":[0.00034203797,0.0001417944,0.000053202584,0.00035124374,0.000025271527,0.0006905576,0.000118304066,0.0001984314,0.000016187569],"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.00007015721,0.00009443629,0.0009485767,0.000019980185,0.00028720606,0.00004338568,0.000109422755,0.9831746,0.0004570463,0.0051076077,0.0023266014,0.007360937],"study_design_scores_gemma":[0.0022938582,0.000026783055,0.0028432687,0.00011665114,0.00005502671,0.000017910535,0.00008121338,0.9891651,0.00019355999,0.00034719013,0.0046925247,0.00016685796],"about_ca_topic_score_codex":0.000092008064,"about_ca_topic_score_gemma":0.0000051359616,"teacher_disagreement_score":0.14812604,"about_ca_system_score_codex":0.00009212311,"about_ca_system_score_gemma":0.000077091834,"threshold_uncertainty_score":0.5782208},"labels":[],"label_agreement":null},{"id":"W4323342215","doi":"10.5267/j.ijiec.2022.12.005","title":"An integrated optimization for minimizing the operation cost of home delivery services in O2O retail","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Urban and Freight Transport Logistics","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":"Sizing; Computer science; Scheduling (production processes); Operations research; Operating cost; Operational costs; Risk analysis (engineering); Business; Operations management; Economics; Engineering","score_opus":0.0481330419884006,"score_gpt":0.24588875602717206,"score_spread":0.19775571403877146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1849951,0.00006453954,0.811663,0.00023453902,0.0025938414,0.00023193551,0.000114266986,0.000085296924,0.000017506434],"genre_scores_gemma":[0.9911846,0.000064403124,0.008077339,0.000012730677,0.00041590785,0.000008930706,0.00021192619,0.000021089414,0.000003075266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.000016075059,0.0005496908,0.000063977604,0.00020856094,0.0001050316],"domain_scores_gemma":[0.99921936,0.00020714542,0.00010671424,0.00006149825,0.00036725873,0.00003800646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028539132,0.00009740568,0.00015311952,0.00042989448,0.000023160597,0.000055604924,0.00029278093,0.000082862854,0.000011850409],"category_scores_gemma":[0.00005107948,0.000084372296,0.000062085666,0.00034309656,0.000016838889,0.0002697725,0.000007553199,0.00020412411,8.876989e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030648745,0.000020242089,0.00033938338,0.0000122208,0.000078546174,0.000006761849,0.00040218997,0.9950616,0.00045096222,0.00024920757,0.00014411945,0.0032041208],"study_design_scores_gemma":[0.00088045426,0.000050182432,0.00075358554,0.00013600441,0.000021616643,0.0000072359735,0.00021286587,0.99671376,0.00036874175,0.000026714592,0.0007495181,0.00007929732],"about_ca_topic_score_codex":0.000015585912,"about_ca_topic_score_gemma":0.000014373793,"teacher_disagreement_score":0.8061895,"about_ca_system_score_codex":0.00009201076,"about_ca_system_score_gemma":0.00005536374,"threshold_uncertainty_score":0.34406024},"labels":[],"label_agreement":null},{"id":"W4323342229","doi":"10.5267/j.ijiec.2023.2.005","title":"Periodic blood inventory system with two supplies and two priority demand classes","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","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":"Service level; Mathematical optimization; Order (exchange); Time horizon; Tabu search; Operations research; Total cost; Service (business); Sensitivity (control systems); Computer science; Expected value; Dynamic programming; Product (mathematics); Operations management; Mathematics; Economics; Engineering; Statistics; Microeconomics; Finance","score_opus":0.025493055060706853,"score_gpt":0.2574185927664891,"score_spread":0.23192553770578225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98736084,0.000066323046,0.0074075107,0.0022958622,0.001919043,0.00012400451,0.0000059907707,0.00015474505,0.0006657071],"genre_scores_gemma":[0.99764746,0.000013851593,0.00045475573,0.00007869869,0.001752786,0.000003974531,0.000014860536,0.000015536547,0.000018078574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989642,0.00001199861,0.000359526,0.00010935509,0.00044220308,0.000112725545],"domain_scores_gemma":[0.9989919,0.00016471672,0.0003001323,0.000048664355,0.00046785246,0.000026709919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000391928,0.00011620901,0.00015961149,0.00067044667,0.000102548576,0.00044298047,0.00018811581,0.000039924136,0.000023377022],"category_scores_gemma":[0.00015640103,0.0001015873,0.000049564427,0.00037999425,0.000031548472,0.0010101667,0.00005283562,0.0002586054,0.000015032043],"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.0003516907,0.00033113977,0.12728375,0.00019323725,0.0018524849,0.0007114916,0.000579893,0.6862013,0.0010740852,0.16778038,0.0021177689,0.0115228165],"study_design_scores_gemma":[0.04140266,0.00027976144,0.0638157,0.0025043443,0.001640518,0.0020207195,0.0039092833,0.79039735,0.00057583075,0.0013260008,0.090655446,0.001472369],"about_ca_topic_score_codex":0.00008935392,"about_ca_topic_score_gemma":0.000023613911,"teacher_disagreement_score":0.16645439,"about_ca_system_score_codex":0.000028457789,"about_ca_system_score_gemma":0.00007407963,"threshold_uncertainty_score":0.4271671},"labels":[],"label_agreement":null},{"id":"W4323342232","doi":"10.5267/j.ijiec.2022.12.004","title":"Robust multiobjective scheme for closed-loop supply chains by considering financial criteria and scenarios","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Robustness (evolution); Supply chain; Mathematical optimization; Multi-objective optimization; Net present value; Closed loop; Computer science; Multinational corporation; Finance; Engineering; Mathematics; Economics; Control engineering; Production (economics); Business","score_opus":0.03519814397763681,"score_gpt":0.257601591651727,"score_spread":0.2224034476740902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80757654,0.000095751646,0.17417306,0.009469858,0.007222328,0.0009524682,0.00009519187,0.00027366742,0.00014112388],"genre_scores_gemma":[0.9905777,0.000011776721,0.0045641214,0.00038374556,0.004116913,0.000036974892,0.00010952998,0.000045754132,0.00015350146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871063,0.00000852399,0.0004946481,0.000179887,0.0003494281,0.0002568742],"domain_scores_gemma":[0.99852604,0.0002895709,0.00030286022,0.00006712984,0.0007842358,0.000030151872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000505581,0.0001759106,0.00022342145,0.00092511025,0.00012290878,0.0003972546,0.00027444755,0.00008936275,0.00002885086],"category_scores_gemma":[0.0017437628,0.00019338548,0.00010233394,0.00043141385,0.000032784657,0.00075838994,0.00015944678,0.00024251055,0.000007743383],"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.00022723961,0.00013091083,0.004095736,0.000118392134,0.0004817224,0.00015426356,0.00031708134,0.8614109,0.0018352538,0.013741664,0.10459156,0.012895284],"study_design_scores_gemma":[0.0047780136,0.00005329834,0.0026851932,0.00028249813,0.00006286875,0.00002583809,0.0008294481,0.94105726,0.00013436975,0.00095419755,0.048772164,0.0003648404],"about_ca_topic_score_codex":0.00007180057,"about_ca_topic_score_gemma":0.0000051136176,"teacher_disagreement_score":0.18300113,"about_ca_system_score_codex":0.00014647709,"about_ca_system_score_gemma":0.00008741103,"threshold_uncertainty_score":0.78860307},"labels":[],"label_agreement":null},{"id":"W4323342234","doi":"10.5267/j.ijiec.2022.12.003","title":"Airline operational crew-aircraft planning considering revenue management: A robust optimization model under disruption","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Crew; Crew scheduling; Schedule; Operations research; Cockpit; Scheduling (production processes); Revenue; Operational planning; Flight planning; Computer science; Operations management; Aeronautics; Engineering; Business","score_opus":0.06599283233639251,"score_gpt":0.30826771150392507,"score_spread":0.24227487916753254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019202726,0.000044876375,0.97708535,0.0007434469,0.002270308,0.00014099007,0.00004425115,0.00032959922,0.00013845679],"genre_scores_gemma":[0.56234735,0.00007447959,0.4358965,0.00007148728,0.0011858479,0.00001636208,0.00018330677,0.00009583081,0.00012887694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983153,0.000041932548,0.0007113796,0.00015345881,0.000551576,0.00022639192],"domain_scores_gemma":[0.998917,0.00028011296,0.00018110119,0.00010614394,0.00040736955,0.00010831015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055159134,0.00020136662,0.00022775341,0.00090717094,0.000090972644,0.00017344348,0.00030721514,0.00013442543,0.00002297176],"category_scores_gemma":[0.0003053391,0.00023575076,0.00011212808,0.0006223517,0.000020956866,0.0005026403,0.000066555986,0.0004118575,0.000009874781],"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.000013871732,0.000017671775,0.00010660739,0.000012797787,0.00024949427,0.000044450066,0.00018601105,0.9953495,0.00021092202,0.00096924376,0.001692778,0.0011466158],"study_design_scores_gemma":[0.0011134635,0.000017522727,0.0001857977,0.00030038058,0.000041872707,0.00008852483,0.00009587988,0.99733114,0.00008038662,0.00015719362,0.00038373857,0.00020408016],"about_ca_topic_score_codex":0.0000019216116,"about_ca_topic_score_gemma":3.4541554e-7,"teacher_disagreement_score":0.5431446,"about_ca_system_score_codex":0.00025657486,"about_ca_system_score_gemma":0.00007396136,"threshold_uncertainty_score":0.9613637},"labels":[],"label_agreement":null},{"id":"W4323342243","doi":"10.5267/j.ijiec.2023.2.003","title":"Optimization for bi-objective express transportation network design under multiple topological structures","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Sorting; Mathematical optimization; Multi-objective optimization; Computer science; Pareto principle; Sensitivity (control systems); Ranking (information retrieval); Network planning and design; Dominance (genetics); Network topology; Integer programming; Topology (electrical circuits); Engineering; Algorithm; Mathematics; Artificial intelligence","score_opus":0.06511255150463167,"score_gpt":0.3136093368642934,"score_spread":0.2484967853596617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018818442,0.000018546281,0.9766957,0.0010090232,0.0030034217,0.0002633667,0.00004885983,0.00012388422,0.000018735424],"genre_scores_gemma":[0.8888705,0.000036271886,0.10910717,0.00004401469,0.0016472217,0.000017155899,0.00022891667,0.000017157532,0.000031601256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873567,0.000078064426,0.0004572485,0.00011733484,0.00042701178,0.0001846977],"domain_scores_gemma":[0.99781716,0.001044091,0.00027793227,0.00003761562,0.0007396954,0.00008351106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660187,0.00010150524,0.00014932186,0.00030699,0.00020915983,0.000101819576,0.0002259338,0.00015138304,0.000036413017],"category_scores_gemma":[0.00064399326,0.000104445244,0.00010528171,0.00044895298,0.000041404794,0.00031225002,0.000003483783,0.00017098301,0.0000012929984],"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.00009231655,0.000018013272,0.0005155054,0.0000016122174,0.00009523705,0.0000056390754,0.0016762572,0.9870528,0.000025524201,0.008263401,0.0011830258,0.00107065],"study_design_scores_gemma":[0.0025773125,0.00014556469,0.0063638138,0.0001248981,0.00007722759,0.000004456977,0.0018066084,0.9802163,0.000114425144,0.00411491,0.0041968613,0.0002575947],"about_ca_topic_score_codex":0.000047146503,"about_ca_topic_score_gemma":0.00001670406,"teacher_disagreement_score":0.87005204,"about_ca_system_score_codex":0.00010872884,"about_ca_system_score_gemma":0.00021074379,"threshold_uncertainty_score":0.42591533},"labels":[],"label_agreement":null},{"id":"W4323342256","doi":"10.5267/j.ijiec.2023.2.002","title":"Composite heuristics and water wave optimality algorithms for tri-criteria multiple job classes and customer order scheduling on a single machine","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Tardiness; Heuristics; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Algorithm; Upper and lower bounds; Mathematics","score_opus":0.05144919766367224,"score_gpt":0.2880264720771587,"score_spread":0.23657727441348647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31956673,0.00010884955,0.6758733,0.00071155257,0.0031984935,0.00018190368,0.00013026361,0.00020405136,0.0000248984],"genre_scores_gemma":[0.8070125,0.00005216485,0.19192693,0.000033670003,0.0008099399,0.000007935921,0.00009420186,0.000045001878,0.000017660172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.000019593397,0.00048832584,0.0001339907,0.00025292215,0.000192098],"domain_scores_gemma":[0.9988412,0.00048329897,0.0000757908,0.00005964824,0.00042206686,0.00011798284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901795,0.0001774134,0.00023703474,0.00047948243,0.000073907555,0.00018767417,0.0001172173,0.00010918848,0.000008051071],"category_scores_gemma":[0.00038158704,0.00016008997,0.00006213125,0.00019778885,0.000027710996,0.00016346424,0.00004105615,0.000295909,0.0000036139206],"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.000049482638,0.000030299656,0.00016127754,0.000015724545,0.00019288326,0.00001897861,0.00021077333,0.99195755,0.0015618884,0.00007350567,0.00014154943,0.0055860695],"study_design_scores_gemma":[0.0020689873,0.00008647378,0.00030217803,0.00012487268,0.00003599909,0.00008536622,0.00005067422,0.9946011,0.0017457195,0.000047652222,0.0006759035,0.00017508825],"about_ca_topic_score_codex":0.0000046825858,"about_ca_topic_score_gemma":5.998048e-7,"teacher_disagreement_score":0.48744577,"about_ca_system_score_codex":0.000076613636,"about_ca_system_score_gemma":0.000021797596,"threshold_uncertainty_score":0.6528279},"labels":[],"label_agreement":null},{"id":"W4323342267","doi":"10.5267/j.ijiec.2023.1.002","title":"Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Algorithm; Benchmark (surveying); Benchmarking; Context (archaeology); Swarm behaviour; Optimization algorithm; Computer science; Swarm intelligence; Metaheuristic; Mathematics; Particle swarm optimization; Mathematical optimization; Artificial intelligence","score_opus":0.02614145670597141,"score_gpt":0.2875177971073566,"score_spread":0.2613763404013852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074049356,0.000080978185,0.9908815,0.001830719,0.005839642,0.0007448939,0.00020337122,0.00031714595,0.000027711718],"genre_scores_gemma":[0.0010935218,0.0001280384,0.99624974,0.000055200806,0.001836411,0.00009092308,0.00035669073,0.0000715393,0.00011791699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554163,0.00014060555,0.0014833092,0.00054196676,0.0016660853,0.0006263747],"domain_scores_gemma":[0.9950564,0.000966456,0.0007851611,0.000293987,0.0025681467,0.0003298746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016654072,0.00038849743,0.00052408664,0.0016338384,0.00023448384,0.00086598424,0.0018198931,0.00018069813,0.000028229808],"category_scores_gemma":[0.0009815262,0.00041049655,0.00028367594,0.001382918,0.00006340261,0.0012121527,0.00034035862,0.0006954021,0.000015420032],"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.0000057500924,0.000085907224,7.7086e-7,0.000007673888,0.0002139834,0.000027349772,0.000121709185,0.6827782,0.0001115204,0.00027321244,0.0024756517,0.31389832],"study_design_scores_gemma":[0.0024871556,0.000283762,0.0000031404643,0.0002131407,0.00003797812,0.00014714671,0.000035914763,0.99133354,0.0024683778,0.0006614665,0.0019450313,0.00038332873],"about_ca_topic_score_codex":0.000014001104,"about_ca_topic_score_gemma":1.8279603e-7,"teacher_disagreement_score":0.31351498,"about_ca_system_score_codex":0.00042858362,"about_ca_system_score_gemma":0.0008518361,"threshold_uncertainty_score":0.9998347},"labels":[],"label_agreement":null},{"id":"W4323342275","doi":"10.5267/j.ijiec.2023.2.004","title":"Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Natural Science Foundation of Shandong Province; Fundo para o Desenvolvimento das Ciências e da Tecnologia; National Natural Science Foundation of China","keywords":"Metaheuristic; Job shop scheduling; Mathematical optimization; Heuristics; Computer science; Simulated annealing; Iterated local search; Benchmark (surveying); Local search (optimization); Algorithm; Mathematics; Schedule","score_opus":0.03397247829670139,"score_gpt":0.27034646385531585,"score_spread":0.23637398555861447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077163756,0.000031382715,0.9193023,0.00045958423,0.0025936048,0.00015502624,0.00011188092,0.00015150136,0.00003098247],"genre_scores_gemma":[0.76517284,0.000030985506,0.23403491,0.0000424529,0.0005891051,0.000011532877,0.000046994333,0.000044818116,0.000026388765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909145,0.000009816328,0.000391997,0.000095761636,0.0002668644,0.00014410072],"domain_scores_gemma":[0.99884087,0.0004148277,0.000080166865,0.00005681471,0.00046923844,0.00013808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022181237,0.00013063247,0.00018282385,0.00047475204,0.000036596994,0.00010357263,0.00014543213,0.000072250055,0.00001533641],"category_scores_gemma":[0.00053438434,0.0001285946,0.000049255876,0.0002242348,0.000029336434,0.00008630695,0.000018076671,0.00018648636,0.000007784421],"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.000037231082,0.0000114385,0.00014897241,0.000007952238,0.0002187036,0.000021127935,0.00017695445,0.99457985,0.00013989114,0.0004721933,0.00088857056,0.0032971355],"study_design_scores_gemma":[0.0020299638,0.00010892641,0.0013284977,0.00017885074,0.00006797008,0.00016289645,0.0001351967,0.9936857,0.00019382156,0.000051846855,0.0018456206,0.00021068192],"about_ca_topic_score_codex":5.429994e-7,"about_ca_topic_score_gemma":3.2718654e-7,"teacher_disagreement_score":0.6880091,"about_ca_system_score_codex":0.000061197265,"about_ca_system_score_gemma":0.000051487026,"threshold_uncertainty_score":0.5243936},"labels":[],"label_agreement":null},{"id":"W4323342282","doi":"10.5267/j.ijiec.2022.12.001","title":"Bio-inspired multi-objective algorithms applied on production scheduling problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior","keywords":"Job shop scheduling; Mathematical optimization; Tardiness; Computer science; Multi-objective optimization; Scheduling (production processes); Particle swarm optimization; Pareto principle; Flow shop scheduling; Sorting; Algorithm; Schedule; Mathematics","score_opus":0.03865056961408586,"score_gpt":0.2654699293631502,"score_spread":0.22681935974906436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16160011,0.000076689365,0.816253,0.001100182,0.01904499,0.00042556346,0.000034764023,0.0012601056,0.0002046196],"genre_scores_gemma":[0.91448194,0.000057848134,0.08238347,0.000033733984,0.0028320712,0.000023832226,0.0000652552,0.00007849446,0.00004337564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853325,0.000016779184,0.0005839731,0.00016130076,0.00049835956,0.00020632133],"domain_scores_gemma":[0.99905336,0.0001400618,0.00016100812,0.00009654073,0.00044363915,0.00010538348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538181,0.000193497,0.00021427016,0.0009903202,0.00006601923,0.00010793186,0.00028723324,0.00013369897,0.000010051416],"category_scores_gemma":[0.00039115216,0.00020130632,0.000108307075,0.0007842652,0.000020620064,0.00019541726,0.000026262036,0.00051724847,0.000052226147],"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.000014580543,0.000045251127,0.000033799373,0.000005966494,0.00023528378,0.000013453504,0.00033134065,0.9856938,0.0010072826,0.00016248965,0.00027409795,0.012182637],"study_design_scores_gemma":[0.0013524867,0.000052149615,0.00031186632,0.00020352534,0.000021966724,0.00003981952,0.00013206928,0.99412596,0.0030731338,0.000047092395,0.00043585568,0.000204048],"about_ca_topic_score_codex":0.0000031479435,"about_ca_topic_score_gemma":4.796188e-7,"teacher_disagreement_score":0.7528818,"about_ca_system_score_codex":0.00022520065,"about_ca_system_score_gemma":0.00007164172,"threshold_uncertainty_score":0.82090336},"labels":[],"label_agreement":null},{"id":"W4323342300","doi":"10.5267/j.ijiec.2023.1.003","title":"MaOTLBO: Many-objective teaching-learning-based optimizer for control and monitoring the optimal power flow of modern power systems","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimal Power Flow Distribution","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":"Benchmark (surveying); Mathematical optimization; Sorting; Electric power system; Convergence (economics); Evolutionary algorithm; Pareto principle; Genetic algorithm; AC power; Computer science; Stability (learning theory); Power (physics); Multi-objective optimization; Power flow; Minification; Voltage; Mathematics; Engineering; Algorithm; Machine learning","score_opus":0.013282673481856294,"score_gpt":0.24994251217340083,"score_spread":0.23665983869154453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16947193,0.00015256838,0.8257733,0.0002535338,0.0037773736,0.00026925674,0.00014669253,0.00012493301,0.000030437395],"genre_scores_gemma":[0.9959504,0.0000054194006,0.0035607761,0.0000042618112,0.0003823978,0.000021059059,0.00002389183,0.000042268726,0.000009523306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864155,0.000045948545,0.000585774,0.00011507861,0.0004113998,0.00020025953],"domain_scores_gemma":[0.9983772,0.0007429037,0.00020374588,0.000081826955,0.0005154641,0.00007886166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006247439,0.00018196553,0.00027543504,0.00036729695,0.00007748831,0.00012172568,0.00027817272,0.00012140205,0.0000031200761],"category_scores_gemma":[0.0005408077,0.00016277867,0.0001532534,0.00016764934,0.00003183559,0.0002129064,0.000028778166,0.00057814334,0.0000019281833],"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.000091908136,0.000021508647,0.00021302888,0.000011073268,0.00040653275,0.000008688323,0.0002497409,0.99689907,0.0008166551,0.0002952056,0.00041317183,0.0005734344],"study_design_scores_gemma":[0.0021545857,0.00017765512,0.0008746997,0.00020392211,0.00005448466,0.000033044107,0.0001822538,0.9953968,0.00024250784,0.000024735851,0.00051584624,0.00013948759],"about_ca_topic_score_codex":0.0000044851577,"about_ca_topic_score_gemma":6.9530195e-8,"teacher_disagreement_score":0.8264785,"about_ca_system_score_codex":0.00017893662,"about_ca_system_score_gemma":0.000064428576,"threshold_uncertainty_score":0.66379213},"labels":[],"label_agreement":null},{"id":"W4323342302","doi":"10.5267/j.ijiec.2023.1.001","title":"Impact of dual uptime-reducing strategies, postponement, multi-delivery, and rework on a multiproduct fabrication-shipping problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Rework; Postponement; Outsourcing; Quality (philosophy); Production (economics); Overtime; Operations research; Operations management; Computer science; Business; Manufacturing engineering; Marketing; Engineering; Economics; Microeconomics","score_opus":0.05362517480058613,"score_gpt":0.28769731470988363,"score_spread":0.2340721399092975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880713,0.000040540337,0.008039841,0.0011938361,0.0020084544,0.00028452743,0.000013082117,0.00008685563,0.0002615128],"genre_scores_gemma":[0.99674875,0.000013622799,0.0012121717,0.00003629796,0.0018931875,0.000005309822,0.00004433136,0.000020981475,0.00002532468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869275,0.000012533507,0.0005672994,0.00015728848,0.00040816158,0.00016194426],"domain_scores_gemma":[0.99869657,0.000121669604,0.0004815591,0.000091053385,0.00058405916,0.000025074309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045692286,0.00015205338,0.00019012816,0.0010584975,0.000059688256,0.000236628,0.00023461098,0.00005273741,0.000039854796],"category_scores_gemma":[0.00034588983,0.0001434861,0.00012437472,0.00053306,0.000025062669,0.0007011219,0.00010837178,0.00023188679,0.000014795889],"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.00007343387,0.00013348283,0.0034356972,0.000025818536,0.00042102276,0.00002531128,0.00024933796,0.9817552,0.00103913,0.0024009503,0.0034792493,0.0069613624],"study_design_scores_gemma":[0.0056646466,0.00028715451,0.067669496,0.0014788397,0.00015544253,0.00003726294,0.0013147909,0.91756904,0.00014357163,0.00059031363,0.0045393677,0.0005500441],"about_ca_topic_score_codex":0.00024418518,"about_ca_topic_score_gemma":0.0000024094386,"teacher_disagreement_score":0.0642338,"about_ca_system_score_codex":0.00012607219,"about_ca_system_score_gemma":0.00008427455,"threshold_uncertainty_score":0.58511937},"labels":[],"label_agreement":null},{"id":"W4323342349","doi":"10.5267/j.ijiec.2023.2.001","title":"General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Science Fund of the Republic of Serbia; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Electric vehicle; Variable (mathematics); Variable neighborhood search; Set (abstract data type); Routing (electronic design automation); Quality (philosophy); Integer (computer science); Local search (optimization); Operations research; Mathematics; Power (physics)","score_opus":0.020586449861546043,"score_gpt":0.26197481995658256,"score_spread":0.24138837009503653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14647534,0.000038695012,0.851457,0.0004675103,0.00064117665,0.00033849024,0.000034722518,0.00034185624,0.00020519021],"genre_scores_gemma":[0.8503757,0.0000184767,0.14677411,0.000032492124,0.0021879505,0.000022064167,0.00006906227,0.00015327825,0.00036683228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860835,0.00004104916,0.00047417392,0.00014256679,0.00044217613,0.00029168837],"domain_scores_gemma":[0.99866253,0.0005293873,0.00012614288,0.00007310476,0.00048743942,0.00012136928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345539,0.00017421975,0.0002474948,0.00059371046,0.00007502275,0.00017867135,0.00025734244,0.00011121889,0.000019747038],"category_scores_gemma":[0.0001942425,0.00017510979,0.000060109713,0.00064880383,0.000012721123,0.00027299265,0.000045429995,0.00038935363,0.000013038312],"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.000034671135,0.000016753853,0.00031985444,0.000009864841,0.00028009602,0.000012118383,0.0001138458,0.97848856,0.013602635,0.00040500585,0.0003772351,0.006339347],"study_design_scores_gemma":[0.0017900948,0.00012457719,0.00020530439,0.00011719493,0.00004160174,0.00012021216,0.000015140328,0.9954289,0.0016616504,0.00008285662,0.00023470273,0.00017775445],"about_ca_topic_score_codex":0.000004228558,"about_ca_topic_score_gemma":1.1516187e-7,"teacher_disagreement_score":0.7046829,"about_ca_system_score_codex":0.0001787531,"about_ca_system_score_gemma":0.00014695454,"threshold_uncertainty_score":0.714077},"labels":[],"label_agreement":null},{"id":"W4323342366","doi":"10.5267/j.ijiec.2022.12.002","title":"Marketplace channel encroachment under private brand introduction of online platform","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Original equipment manufacturer; Supply chain; Business; Channel (broadcasting); Industrial organization; Marketing; Computer science; Telecommunications","score_opus":0.04171504357146112,"score_gpt":0.2532029662424199,"score_spread":0.21148792267095878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.927518,0.000035268862,0.046176698,0.013890406,0.011519871,0.00027751358,0.000020861262,0.00013604443,0.00042535277],"genre_scores_gemma":[0.9920006,0.000016624408,0.00032422983,0.00014659454,0.007270804,0.0000028702705,0.00012151991,0.000015974883,0.000100801706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874187,0.000005802374,0.0005388469,0.00010280036,0.00047852684,0.00013217043],"domain_scores_gemma":[0.99909323,0.000068331516,0.0003987329,0.00007411048,0.0003486731,0.000016946007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045521275,0.00011351088,0.00016758755,0.00094956625,0.00003279637,0.000096270975,0.00030356384,0.000051931158,0.00009081291],"category_scores_gemma":[0.00021361113,0.00011089463,0.0001053672,0.0004944778,0.000020200658,0.0006063882,0.00011458382,0.00018993196,0.00001753424],"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.00009569359,0.00011959445,0.00043082764,0.000025508945,0.00029847363,0.000013920334,0.000052288524,0.95937437,0.00033942403,0.013592556,0.021375205,0.004282158],"study_design_scores_gemma":[0.0061420887,0.000106026666,0.013190283,0.00043252113,0.00017351778,0.000042991345,0.0009740726,0.77326035,0.0005808377,0.004720008,0.19989659,0.000480729],"about_ca_topic_score_codex":0.000023239658,"about_ca_topic_score_gemma":0.0000020529674,"teacher_disagreement_score":0.18611401,"about_ca_system_score_codex":0.000095136435,"about_ca_system_score_gemma":0.000030166482,"threshold_uncertainty_score":0.4522152},"labels":[],"label_agreement":null},{"id":"W4323342379","doi":"10.5267/j.ijiec.2023.2.006","title":"Pricing and coordination of remanufacturing supply chain considering remanufacturing capacity and preferences under government mechanisms","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Remanufacturing; Supply chain; Business; Industrial organization; Government (linguistics); Profit (economics); Environmental economics; Marketing; Economics; Microeconomics; Engineering","score_opus":0.027174443334649627,"score_gpt":0.22347039980029895,"score_spread":0.19629595646564932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94551194,0.000021133323,0.05157522,0.0014888642,0.0010106467,0.00018951624,0.0000042831316,0.000058387748,0.00014002337],"genre_scores_gemma":[0.99750084,0.00002071471,0.0018583297,0.00005831193,0.00051298406,0.000004345472,0.0000062306876,0.000018351733,0.000019880657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985418,0.0000129583605,0.0005130133,0.00015217318,0.0006098538,0.00017022848],"domain_scores_gemma":[0.99890935,0.00032376143,0.00046760342,0.00006515259,0.00020982006,0.000024294484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069564005,0.00015047519,0.00021762132,0.0006340038,0.000077859266,0.00021261851,0.00018611712,0.00006207966,0.000013635187],"category_scores_gemma":[0.0005400086,0.00015238469,0.0000500111,0.00023980175,0.000032466698,0.00069454935,0.00021758261,0.00021408674,0.0000012302281],"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.000053038555,0.000044159995,0.0032231135,0.00019706161,0.00041275515,0.00005655794,0.00041859076,0.9393184,0.0025812043,0.035910767,0.000271586,0.017512754],"study_design_scores_gemma":[0.007647621,0.00018043374,0.08174949,0.00265233,0.00039038318,0.00017546178,0.011351223,0.8069236,0.017198352,0.0635039,0.007020716,0.0012064468],"about_ca_topic_score_codex":0.000109193454,"about_ca_topic_score_gemma":0.000007835761,"teacher_disagreement_score":0.13239476,"about_ca_system_score_codex":0.00014882913,"about_ca_system_score_gemma":0.00002489056,"threshold_uncertainty_score":0.62140673},"labels":[],"label_agreement":null},{"id":"W4381740477","doi":"10.5267/j.ijiec.2023.3.001","title":"An efficient multi-attribute multi-item auction mechanism with ex-ante and ex-post satisfaction for 4PL transportation service procurement","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"State Key Laboratory of Synthetical Automation for Process Industries; Higher Education Discipline Innovation Project; Major Research Plan; National Natural Science Foundation of China","keywords":"Procurement; Bidding; Incentive compatibility; Reverse auction; Computer science; Ex-ante; Mechanism design; Operations research; Mechanism (biology); Microeconomics; Business; Incentive; Economics; Marketing; Mathematics","score_opus":0.11293229378707483,"score_gpt":0.36466368101982516,"score_spread":0.25173138723275035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381740477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4168506,0.0000044664475,0.5806821,0.001150077,0.0008552381,0.0002802868,0.00012499467,0.000051738014,5.1650363e-7],"genre_scores_gemma":[0.9844625,0.000005115339,0.014877041,0.000054200176,0.00041132054,0.000033574965,0.00010214548,0.000020275998,0.000033847613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978727,0.00005830218,0.0008140878,0.00026528694,0.0008333906,0.00015619338],"domain_scores_gemma":[0.9964349,0.0005636114,0.00057106453,0.00012456714,0.002144271,0.00016154324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001223443,0.00015769081,0.00020814079,0.0007043924,0.0001737393,0.00021579972,0.0003044154,0.0000990054,0.000021535703],"category_scores_gemma":[0.0006195127,0.00013343121,0.0000851662,0.00073966995,0.000025755025,0.0005045235,0.000013882701,0.00022736496,0.000013394636],"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.000113492315,0.0001063712,0.000774057,0.000004897773,0.00010386531,0.000004469217,0.00085646985,0.98529106,0.0042262,0.0031042648,0.00008332183,0.0053315014],"study_design_scores_gemma":[0.0039942795,0.00032890067,0.0423117,0.0001289706,0.00008432444,0.00009291663,0.002102949,0.9466421,0.0023579905,0.000759983,0.00094039744,0.00025546155],"about_ca_topic_score_codex":0.000030149198,"about_ca_topic_score_gemma":0.00006392077,"teacher_disagreement_score":0.5676119,"about_ca_system_score_codex":0.00012385726,"about_ca_system_score_gemma":0.00015056899,"threshold_uncertainty_score":0.5441167},"labels":[],"label_agreement":null},{"id":"W4381740798","doi":"10.5267/j.ijiec.2023.3.002","title":"A new matheheuristic approach based on Chu-Beasley genetic approach for the multi-depot electric vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Genetic algorithm; Routing (electronic design automation); Vehicle routing problem; Electric vehicle; Mathematical optimization; Sensitivity (control systems); Range (aeronautics); Electric power; Computer science; Power (physics); Operations research; Engineering; Reliability engineering; Computer network; Mathematics; Electronic engineering","score_opus":0.04788489507255627,"score_gpt":0.28168451647574455,"score_spread":0.23379962140318827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381740798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032704677,0.000055338834,0.9942823,0.00049172284,0.0011094331,0.00040625254,0.00001485625,0.00029618226,0.00007345098],"genre_scores_gemma":[0.44931275,0.000009016366,0.54938483,0.00003434532,0.0010966142,0.000033690674,0.00002500131,0.00007380481,0.000029937224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983407,0.000048450842,0.0006366347,0.00016809993,0.0005116522,0.00029445568],"domain_scores_gemma":[0.9982143,0.0009333966,0.00020919034,0.00014248719,0.00037927326,0.00012136241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582684,0.00021494606,0.00023508104,0.0005839866,0.000099603436,0.00017565578,0.00057151605,0.00012491438,0.0000045750644],"category_scores_gemma":[0.0009208886,0.00018863115,0.00018538052,0.0008515125,0.000011046304,0.00010367942,0.000031040938,0.0005267477,0.0000048348975],"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.000023248642,0.000043411947,0.00008098991,0.000014707923,0.00018100449,0.0000046345435,0.00015159896,0.98239744,0.0004201984,0.00019121438,0.0011563593,0.015335168],"study_design_scores_gemma":[0.0019465857,0.000060711864,0.0005447054,0.00007355572,0.000056623583,0.000037476148,0.00004391007,0.996443,0.00020454668,0.0000310046,0.00038240303,0.0001754955],"about_ca_topic_score_codex":0.0000060262523,"about_ca_topic_score_gemma":1.1292244e-7,"teacher_disagreement_score":0.4460423,"about_ca_system_score_codex":0.00020963987,"about_ca_system_score_gemma":0.00017177076,"threshold_uncertainty_score":0.7692155},"labels":[],"label_agreement":null},{"id":"W4381800200","doi":"10.5267/j.ijiec.2023.4.003","title":"The bid generation problem in combinatorial auctions for transportation service procurement","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Chongqing Social Science Planning Fund; Chongqing Municipal Education Commission","keywords":"Vehicle routing problem; Column generation; Computer science; Mathematical optimization; Bundle; Service (business); Operations research; Procurement; Routing (electronic design automation); Probabilistic logic; Variable (mathematics); Set (abstract data type); Engineering; Computer network; Business; Mathematics","score_opus":0.1345178434308865,"score_gpt":0.369486236955104,"score_spread":0.23496839352421753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381800200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32419023,0.00004377355,0.61253583,0.043266445,0.018257825,0.0012960929,0.0001929572,0.00012608984,0.00009073029],"genre_scores_gemma":[0.9953661,0.000012942784,0.0021591482,0.00004901543,0.0021142408,0.00011009535,0.00007877097,0.000014051975,0.00009561569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783033,0.000059497772,0.0010215297,0.00014432859,0.00080781715,0.0001364746],"domain_scores_gemma":[0.9966301,0.0012134822,0.00044881378,0.000106760344,0.0015440431,0.000056847577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002176261,0.000091660804,0.00013571464,0.00053567084,0.00020528253,0.00023804516,0.0005560585,0.000071705435,0.000011576817],"category_scores_gemma":[0.0011717652,0.00007077934,0.00010971117,0.0012773382,0.000022037473,0.0003363774,0.000015160863,0.00021562653,0.000019658983],"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.000053198342,0.000052860192,0.00016589192,0.0000011548838,0.00005372333,0.0000017488114,0.00043953987,0.91055,0.0007751918,0.069481134,0.00714417,0.011281381],"study_design_scores_gemma":[0.0053683305,0.00021686593,0.0039808266,0.00011877652,0.00005552878,0.00003765041,0.0015146559,0.5985787,0.0018051915,0.13265498,0.25533,0.0003385077],"about_ca_topic_score_codex":0.000009359492,"about_ca_topic_score_gemma":0.00003452183,"teacher_disagreement_score":0.6711759,"about_ca_system_score_codex":0.0001206613,"about_ca_system_score_gemma":0.00019298607,"threshold_uncertainty_score":0.28862977},"labels":[],"label_agreement":null},{"id":"W4381800203","doi":"10.5267/j.ijiec.2023.5.003","title":"An efficient production planning approach based demand driven MRP under resource constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Operability; Production planning; Production (economics); Material requirements planning; Demand forecasting; Computer science; Capacity planning; Economic shortage; Operations research; Mathematical optimization; Engineering; Economics; Mathematics; Microeconomics","score_opus":0.03563932523880774,"score_gpt":0.26957165839742603,"score_spread":0.23393233315861828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381800203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1738814,0.000024501773,0.82259464,0.00028318007,0.002692206,0.00009001489,0.000011616627,0.00032759874,0.00009481655],"genre_scores_gemma":[0.9461377,0.000002528189,0.052555762,0.000024865209,0.001153006,0.000004404468,0.00008196872,0.000033498196,0.0000062442105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880415,0.000030322772,0.00044878956,0.00012310965,0.0004331366,0.00016048066],"domain_scores_gemma":[0.9992161,0.00012065021,0.00010904196,0.00008781549,0.0003503936,0.00011600411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038361226,0.00013394856,0.00015322368,0.00066987914,0.000056819532,0.00010959644,0.00025709957,0.00010058436,0.000011640136],"category_scores_gemma":[0.0002338966,0.0001419327,0.00007328115,0.00045353072,0.000030796982,0.00013370362,0.0000134050315,0.00035552253,0.0000065184713],"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.000010803514,0.000038479313,0.000086531385,0.0000045453467,0.00010653947,0.000015070154,0.00021131641,0.9970175,0.00029744988,0.000111221074,0.0005397053,0.0015608508],"study_design_scores_gemma":[0.000762862,0.000030047106,0.00036680675,0.000121991165,0.000019335184,0.00006568283,0.00030968557,0.99758935,0.0004128852,0.000009987847,0.00017658694,0.00013475277],"about_ca_topic_score_codex":7.579736e-7,"about_ca_topic_score_gemma":4.0668983e-8,"teacher_disagreement_score":0.7722563,"about_ca_system_score_codex":0.00012824938,"about_ca_system_score_gemma":0.0000790303,"threshold_uncertainty_score":0.57878476},"labels":[],"label_agreement":null},{"id":"W4381800644","doi":"10.5267/j.ijiec.2023.4.002","title":"A joint replenishment problem with the (T,ki) policy under obsolescence","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Fundação para a Ciência e a Tecnologia","keywords":"Obsolescence; Time horizon; Economics; Economic order quantity; Point (geometry); Order (exchange); Operations management; Value (mathematics); Present value; Production (economics); Microeconomics; Operations research; Econometrics; Computer science; Business; Supply chain; Marketing; Engineering; Mathematics","score_opus":0.04592410327322529,"score_gpt":0.24977326439274597,"score_spread":0.20384916111952067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381800644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44658256,0.00009796236,0.16333364,0.36692512,0.011463037,0.0015664072,0.000020456586,0.00081145467,0.009199379],"genre_scores_gemma":[0.99395657,0.000006370691,0.0003474622,0.0010226445,0.0044472087,0.000010870113,0.000014155873,0.00002037363,0.00017434183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988029,0.00000813399,0.00035254055,0.00010426005,0.00056765176,0.00016453139],"domain_scores_gemma":[0.9991432,0.00006509165,0.00030309727,0.000093796414,0.00037678456,0.00001804444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042085384,0.00011678052,0.000120731645,0.00067423395,0.00008325717,0.00032324067,0.0004096811,0.00003303514,0.00003636835],"category_scores_gemma":[0.00011367879,0.00008142747,0.00008568936,0.0007044943,0.000029704333,0.00045089616,0.00013027906,0.00023440352,0.000049340175],"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.000032724023,0.000048295675,0.00036022632,0.000011287282,0.00022934042,0.000048106773,0.00010284527,0.90720886,0.0001221405,0.051365994,0.036875453,0.0035947545],"study_design_scores_gemma":[0.0066133514,0.00018454094,0.01320154,0.0012657162,0.00022357627,0.00016308142,0.00264596,0.38959256,0.00022064205,0.006705474,0.5783698,0.00081376464],"about_ca_topic_score_codex":0.00008120382,"about_ca_topic_score_gemma":0.0000049238824,"teacher_disagreement_score":0.547374,"about_ca_system_score_codex":0.0001324889,"about_ca_system_score_gemma":0.000090044254,"threshold_uncertainty_score":0.33205158},"labels":[],"label_agreement":null},{"id":"W4381801098","doi":"10.5267/j.ijiec.2023.4.004","title":"Extending the hypergradient descent technique to reduce the time of optimal solution achieved in hyperparameter optimization algorithms","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Machine Learning and Data Classification","field":"Computer Science","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":"Hyperparameter; Machine learning; Computer science; Artificial intelligence; Hyperparameter optimization; Algorithm; Bayesian optimization; Support vector machine","score_opus":0.03418958972268212,"score_gpt":0.28851649353066855,"score_spread":0.25432690380798645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381801098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03386927,0.00001733949,0.955955,0.008965506,0.0009218662,0.00020696623,0.0000059375393,0.000045374432,0.000012708696],"genre_scores_gemma":[0.90448713,0.000017373884,0.09505867,0.000049425995,0.00031451051,0.000022543702,0.00001936859,0.000011111096,0.000019832152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986826,0.00010762602,0.0005143305,0.00012912163,0.00042982624,0.00013644838],"domain_scores_gemma":[0.99884653,0.00039565546,0.00026603517,0.0001734728,0.0002718121,0.000046498717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011205944,0.000093859875,0.00012599952,0.00051873486,0.00006786814,0.000114789014,0.0009559317,0.00005342443,0.0000033475965],"category_scores_gemma":[0.0007039215,0.00006624087,0.00007078481,0.00088264607,0.000021659615,0.00031496407,0.00015115291,0.00034509777,0.0000071183617],"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.000014402571,0.000030478674,0.000063158026,0.0000010189957,0.000028290055,0.0000046446107,0.00033206682,0.977451,0.0023000645,0.0011464292,0.00027773393,0.018350713],"study_design_scores_gemma":[0.00037401434,0.00006623882,0.0022096813,0.00010618951,0.000007100592,0.00006764421,0.000030645624,0.99554765,0.0007641345,0.000050461804,0.00070761755,0.00006860393],"about_ca_topic_score_codex":0.000023318411,"about_ca_topic_score_gemma":5.258906e-7,"teacher_disagreement_score":0.87061787,"about_ca_system_score_codex":0.00013718718,"about_ca_system_score_gemma":0.000095027135,"threshold_uncertainty_score":0.27012244},"labels":[],"label_agreement":null},{"id":"W4381802112","doi":"10.5267/j.ijiec.2023.5.002","title":"Low carbon decision-making model under the combined effect of corporate social responsibility and overconfidence","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Overconfidence effect; Corporate social responsibility; Business; Social responsibility; Welfare; Microeconomics; Carbon fibers; Industrial organization; Marketing; Economics; Market economy; Public relations; Psychology","score_opus":0.026444237751187094,"score_gpt":0.2709351047608289,"score_spread":0.2444908670096418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381802112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97118217,0.000009032784,0.026067767,0.0013360794,0.0010910279,0.00018475825,0.0000032622856,0.0000378462,0.000088029636],"genre_scores_gemma":[0.99901354,0.0000017677964,0.00016806283,0.000076792596,0.0007041085,0.000004082716,0.0000041334415,0.000014705132,0.000012782328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873686,0.000028319662,0.00046529734,0.00011127535,0.0005256201,0.00013261315],"domain_scores_gemma":[0.997502,0.0013652368,0.00052597857,0.00008070573,0.00051548163,0.000010561792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821502,0.00011846289,0.00019667405,0.00060388196,0.00008043177,0.00016645508,0.00034516669,0.00005705168,0.000006553547],"category_scores_gemma":[0.0015798972,0.000094773946,0.00008477292,0.0005709935,0.000051435996,0.000334834,0.00020455042,0.00023803004,0.0000016414798],"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.00023122484,0.000017283102,0.0014188035,0.00002482379,0.00011541904,0.000025465755,0.00006789964,0.98457587,0.00015151495,0.009352694,0.00052439026,0.003494602],"study_design_scores_gemma":[0.0012625629,0.000032060598,0.00855663,0.00021502473,0.00005575529,0.0000048500838,0.00022968491,0.97723943,0.00003999579,0.012211856,0.00006682556,0.000085323845],"about_ca_topic_score_codex":0.0000358648,"about_ca_topic_score_gemma":0.000002894194,"teacher_disagreement_score":0.027831368,"about_ca_system_score_codex":0.00009984734,"about_ca_system_score_gemma":0.00007047432,"threshold_uncertainty_score":0.38647693},"labels":[],"label_agreement":null},{"id":"W4381802817","doi":"10.5267/j.ijiec.2023.4.001","title":"Joint optimization of production and maintenance scheduling for unrelated parallel machine using hybrid discrete spider monkey optimization algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Computer science; Algorithm; Scheduling (production processes); Inertia; Genetic algorithm; Mathematics","score_opus":0.0323767358199523,"score_gpt":0.2624948780241332,"score_spread":0.2301181422041809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381802817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012908469,0.00012564195,0.98317933,0.00032343945,0.0030040466,0.00023240448,0.00007037894,0.00015070244,0.000005568741],"genre_scores_gemma":[0.21164188,0.00018691101,0.7873026,0.0000072003677,0.00063500705,0.000008195644,0.00014948248,0.000055269113,0.000013431005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985155,0.00002232925,0.00081555126,0.0001498248,0.00032047002,0.00017634791],"domain_scores_gemma":[0.998597,0.00012593642,0.0003210736,0.00007919377,0.00079184736,0.000084918436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040739487,0.00017849651,0.00027480864,0.00069478556,0.00006371841,0.00007226041,0.00014803313,0.000099667515,0.000008350639],"category_scores_gemma":[0.0007756104,0.00018808442,0.00010438695,0.00045571403,0.000029731798,0.00037498135,0.000030590138,0.00025408244,5.5734927e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024409137,0.000020703521,0.000029724786,0.00001773483,0.00021673125,0.0000053282365,0.0000962295,0.9967788,0.00021545206,0.00006359206,0.00007248487,0.002458832],"study_design_scores_gemma":[0.0011896737,0.000053524982,0.000021893691,0.0003554238,0.000059260878,0.0000968321,0.000068632835,0.997213,0.0006898208,0.00006139684,0.000022795832,0.00016771321],"about_ca_topic_score_codex":0.000007333155,"about_ca_topic_score_gemma":2.2926909e-7,"teacher_disagreement_score":0.1987334,"about_ca_system_score_codex":0.00012936449,"about_ca_system_score_gemma":0.000064015614,"threshold_uncertainty_score":0.766986},"labels":[],"label_agreement":null},{"id":"W4381803662","doi":"10.5267/j.ijiec.2023.5.001","title":"Optimizing inland port scale and function decisions: A bilevel programming approach","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","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":"National Natural Science Foundation of China","keywords":"Port (circuit theory); Bilevel optimization; Government (linguistics); Function (biology); Operations research; Investment (military); Heuristic; Computer science; Competition (biology); Scale (ratio); Transport engineering; Process (computing); Programming paradigm; Work (physics); Business; Mathematical optimization; Optimization problem; Engineering; Mathematics","score_opus":0.049915505766727174,"score_gpt":0.25950443921274596,"score_spread":0.20958893344601878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381803662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09032281,0.000222741,0.90521836,0.00013442931,0.0033080676,0.00014162602,0.000020620544,0.00024499028,0.00038638012],"genre_scores_gemma":[0.9575536,0.000116234165,0.041273583,0.000010646946,0.00093821745,0.0000074915347,0.000044975295,0.000029139068,0.000026093632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.000008803813,0.00044720512,0.00008736102,0.0003078986,0.00014324528],"domain_scores_gemma":[0.99935454,0.00019462126,0.00008890918,0.000053672014,0.00021138847,0.00009689527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031448787,0.000114634706,0.00016034917,0.00051223295,0.000042869957,0.0001297962,0.00014212637,0.00008768166,0.000007670768],"category_scores_gemma":[0.00024274741,0.00011164698,0.000060446044,0.00029413946,0.000018747798,0.00018063768,0.000041069303,0.000297328,0.000003075981],"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.000010189554,0.000017229584,0.0005974137,0.0000055334767,0.000118601056,0.00002625927,0.000121202655,0.8998978,0.000054449083,0.00019399088,0.0011986138,0.09775868],"study_design_scores_gemma":[0.0009265619,0.000058191537,0.0025336696,0.00017313218,0.00004615588,0.00024703288,0.00012430812,0.97737753,0.00003572399,0.00023389077,0.018066153,0.00017762314],"about_ca_topic_score_codex":0.0000063177463,"about_ca_topic_score_gemma":3.7622826e-7,"teacher_disagreement_score":0.86723083,"about_ca_system_score_codex":0.000052100484,"about_ca_system_score_gemma":0.000041795003,"threshold_uncertainty_score":0.45528316},"labels":[],"label_agreement":null},{"id":"W4386773670","doi":"10.5267/j.ijiec.2023.7.001","title":"Assembly line balancing with cobots: An extensive review and critiques","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"Workstation; Assembly line; Robot; Computer science; Scheduling (production processes); Process management; Process (computing); Engineering; Operations management; Manufacturing engineering; Artificial intelligence; Operating system; Mechanical engineering","score_opus":0.023336632943883853,"score_gpt":0.28449105950935344,"score_spread":0.2611544265654696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20541859,0.0025214693,0.7846619,0.0028933836,0.0029613026,0.00041250815,0.000053844324,0.0009023605,0.00017468625],"genre_scores_gemma":[0.98309636,0.0017328032,0.013767533,0.00015574068,0.0010606901,0.000007904271,0.00010568342,0.00006172025,0.000011571874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989795,0.000022030097,0.00045008116,0.00009956504,0.00030570946,0.00014313102],"domain_scores_gemma":[0.9988031,0.00017472518,0.00012197577,0.000075141674,0.0007181337,0.00010696153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027941636,0.00014652216,0.00026197082,0.00036831835,0.000031588504,0.00007938521,0.00017908963,0.00006778321,0.000006034549],"category_scores_gemma":[0.00034949262,0.00013878541,0.000038868995,0.0003611599,0.000014047569,0.00046440287,0.000024419183,0.00029522396,0.0000035593798],"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.0000075479807,0.000011193354,0.00014728584,0.00004600473,0.00013638484,0.000058771137,0.000105587525,0.99530447,0.00071305496,0.00012650472,0.0010093217,0.0023338557],"study_design_scores_gemma":[0.0010792882,0.00021152213,0.0014685942,0.0022558405,0.0001365007,0.00050470006,0.00010718597,0.9921192,0.0005547075,0.000049849365,0.0012316334,0.00028101265],"about_ca_topic_score_codex":0.0000048313677,"about_ca_topic_score_gemma":0.000002408282,"teacher_disagreement_score":0.7776778,"about_ca_system_score_codex":0.000089959736,"about_ca_system_score_gemma":0.00006444761,"threshold_uncertainty_score":0.56595045},"labels":[],"label_agreement":null},{"id":"W4386773677","doi":"10.5267/j.ijiec.2023.6.001","title":"Inventory routing problem with backhaul considering returnable transport items collection","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Computer science; Backhaul (telecommunications); Vehicle routing problem; Supply chain; Operations research; Economic order quantity; Routing (electronic design automation); Environmental economics; Business; Operations management; Computer network; Economics; Engineering","score_opus":0.03594425694504643,"score_gpt":0.26429579503772316,"score_spread":0.22835153809267672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39539623,0.000051781673,0.5978699,0.000733992,0.0042462316,0.00025773508,0.000014086185,0.0007819957,0.0006480563],"genre_scores_gemma":[0.950568,0.000032802727,0.048303254,0.000016085894,0.000877613,0.0000092213795,0.000026848991,0.00007325266,0.00009290956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845046,0.000037387243,0.0006396712,0.00012243644,0.0005114753,0.00023856875],"domain_scores_gemma":[0.9988772,0.00023496375,0.00021062551,0.00008189424,0.00047743844,0.00011784055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006708529,0.0001791748,0.0002456892,0.0007668659,0.000073986615,0.0000935209,0.0002507481,0.00011987643,0.00001994654],"category_scores_gemma":[0.00019991556,0.00018483492,0.000094451905,0.00094162417,0.000022672302,0.0003809696,0.000020322424,0.000521661,0.000007649036],"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.000020411793,0.00001208963,0.0027100588,0.000011910117,0.00025815147,0.000072385184,0.0004207604,0.9932453,0.0008174479,0.0001870984,0.001132517,0.0011118812],"study_design_scores_gemma":[0.0015086466,0.000070738206,0.0007699901,0.0004267138,0.000040995426,0.00030178472,0.00016772546,0.9922843,0.0011732631,0.00006287558,0.00296061,0.00023235292],"about_ca_topic_score_codex":0.000010582258,"about_ca_topic_score_gemma":0.0000032707949,"teacher_disagreement_score":0.5551718,"about_ca_system_score_codex":0.00028664898,"about_ca_system_score_gemma":0.00015832421,"threshold_uncertainty_score":0.75373495},"labels":[],"label_agreement":null},{"id":"W4386773691","doi":"10.5267/j.ijiec.2023.6.003","title":"A dynamic scheduling method with Conv-Dueling and generalized representation based on reinforcement learning","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Key Research and Development Program of China","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Reinforcement learning; Fair-share scheduling; Mathematical optimization; Artificial intelligence; Schedule; Mathematics","score_opus":0.026771620490980648,"score_gpt":0.295867984628311,"score_spread":0.26909636413733035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081740625,0.000023413533,0.91647696,0.00036442128,0.0010477615,0.00008214998,0.000002467976,0.00021271888,0.00004946079],"genre_scores_gemma":[0.7708068,0.000031765616,0.22878914,0.000029674133,0.00023753117,0.000005985715,0.000046574893,0.00003372838,0.000018799756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988969,0.000033201835,0.00041716997,0.00010859638,0.0004089898,0.00013513895],"domain_scores_gemma":[0.9990824,0.00035443273,0.00013584776,0.000058264115,0.00028610489,0.00008297659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036280826,0.00013449666,0.00017286347,0.0006893592,0.000056785426,0.00011769453,0.00012762618,0.00006988248,0.000012188421],"category_scores_gemma":[0.0003039192,0.0001301823,0.000055124463,0.00042257385,0.000011548268,0.00015013802,0.00001569657,0.00038439428,0.000004048018],"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.000040860778,0.0000068087907,0.000121166486,0.000005153445,0.00013340935,0.00002564089,0.00014678363,0.99402523,0.00027577722,0.0001142686,0.00002013264,0.005084768],"study_design_scores_gemma":[0.0018734755,0.000084831685,0.0001243996,0.00022067469,0.000026108075,0.000039523344,0.0001187046,0.9968775,0.0003874967,0.000016615244,0.00010108649,0.00012961816],"about_ca_topic_score_codex":0.0000042231804,"about_ca_topic_score_gemma":3.3048047e-7,"teacher_disagreement_score":0.6890662,"about_ca_system_score_codex":0.000109967266,"about_ca_system_score_gemma":0.0000543014,"threshold_uncertainty_score":0.530868},"labels":[],"label_agreement":null},{"id":"W4386773700","doi":"10.5267/j.ijiec.2023.6.002","title":"The joint influence of quality assurance and postponement on a hybrid multi-item manufacturing-delivery decision-making","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Product Development and Customization","field":"Business, Management and Accounting","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":"Postponement; Scrap; Quality assurance; Rework; Supply chain; Delivery Performance; Quality (philosophy); Operations research; Operations management; Computer science; Business; Process management; Engineering; Marketing; Service (business)","score_opus":0.030401820374395108,"score_gpt":0.26836640075731255,"score_spread":0.23796458038291746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98886245,0.000023722916,0.008388484,0.0012387335,0.0013261432,0.00010028849,0.000004275993,0.000032724787,0.00002316094],"genre_scores_gemma":[0.9985118,0.00002591929,0.0007817247,0.00009464318,0.0005602149,0.0000025697107,0.0000062084073,0.000009810554,0.0000071300697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987199,0.0000106057405,0.0005894483,0.00010001149,0.00047296757,0.000107072934],"domain_scores_gemma":[0.9983449,0.0005939675,0.00049689406,0.000067296205,0.0004855828,0.000011386845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007264328,0.00009800595,0.00013783819,0.00042435195,0.000102668615,0.00016836387,0.00024300072,0.000028596214,0.0000041812227],"category_scores_gemma":[0.001743943,0.00007853029,0.000056581153,0.00020721545,0.000022833117,0.00042012296,0.00010050133,0.00016981042,0.000008678092],"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.0001324347,0.00003954819,0.002344716,0.000015904192,0.00013917127,0.00001922876,0.0000621743,0.9461812,0.00050552347,0.0014776109,0.0008890087,0.04819352],"study_design_scores_gemma":[0.0045406376,0.00006458498,0.71433556,0.0026094243,0.00007379802,0.000047134083,0.0002594373,0.26234755,0.0032630747,0.003663578,0.008253439,0.00054179644],"about_ca_topic_score_codex":0.000013684608,"about_ca_topic_score_gemma":0.000002556847,"teacher_disagreement_score":0.71199083,"about_ca_system_score_codex":0.00005750069,"about_ca_system_score_gemma":0.000048998576,"threshold_uncertainty_score":0.32023725},"labels":[],"label_agreement":null},{"id":"W4386773766","doi":"10.5267/j.ijiec.2023.8.001","title":"Multi-objective optimization of simultaneous buffer and service rate allocation in manufacturing systems based on a data-driven hybrid approach","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Transformation in Industry","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":"Computer science; Mathematical optimization; Sorting; Genetic algorithm; Tabu search; Algorithm; Mathematics; Machine learning","score_opus":0.0396424296160002,"score_gpt":0.2549425273875085,"score_spread":0.2153000977715083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21402177,0.000019189096,0.783222,0.00016536724,0.001713585,0.00032078175,0.00022914875,0.0001468458,0.00016129448],"genre_scores_gemma":[0.9930881,0.000011529096,0.006421871,0.000012907877,0.00017225418,0.0000079445945,0.00025335845,0.000028596804,0.000003427559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987414,0.00003394028,0.0006421241,0.00012417696,0.00033140127,0.00012695878],"domain_scores_gemma":[0.9988989,0.00048175736,0.00016181906,0.00012134158,0.00027614593,0.00006000057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031560546,0.00014639518,0.00020836627,0.00082679413,0.000018557539,0.000092952556,0.0003402168,0.00009197144,0.0000025176553],"category_scores_gemma":[0.00019627764,0.0001582579,0.00003165311,0.00034988794,0.00001364468,0.0005028423,0.000034559445,0.00034288102,0.0000023815637],"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.000027994805,0.000043696025,0.000042220516,0.000044780605,0.00009434332,0.000017215292,0.0001540837,0.99820954,0.00011921827,0.00003403003,0.000045562032,0.0011673325],"study_design_scores_gemma":[0.0014092431,0.00003469793,0.00023752383,0.0003521145,0.000015019025,0.000030205982,0.00016420402,0.9971085,0.0004672375,0.0000037005518,0.00005506012,0.00012247445],"about_ca_topic_score_codex":0.000017087232,"about_ca_topic_score_gemma":0.0000011727766,"teacher_disagreement_score":0.7790663,"about_ca_system_score_codex":0.00016057448,"about_ca_system_score_gemma":0.00006307391,"threshold_uncertainty_score":0.645357},"labels":[],"label_agreement":null},{"id":"W4386773800","doi":"10.5267/j.ijiec.2023.7.002","title":"An improved genetic algorithm for multi-AGV dispatching problem with unloading setup time in a matrix manufacturing workshop","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Crossover; Mathematical optimization; Genetic algorithm; Process (computing); Computer science; Heuristic; Matrix (chemical analysis); Integer programming; Algorithm; Engineering; Mathematics; Artificial intelligence","score_opus":0.021127686772144324,"score_gpt":0.27909758926817485,"score_spread":0.2579699024960305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05889039,0.000020774538,0.93978214,0.000059957496,0.00075487426,0.00023417696,0.00003964447,0.00021418926,0.0000038568205],"genre_scores_gemma":[0.52376235,0.0000139760095,0.47552982,0.0000046259343,0.0005074238,0.000022150465,0.00007733166,0.000058414476,0.000023904267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887305,0.000014233264,0.00050562085,0.00014414475,0.00021581339,0.0002471411],"domain_scores_gemma":[0.9993174,0.0002219262,0.00014121189,0.00008050091,0.0001440451,0.000094937386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020590892,0.00018595166,0.00021503108,0.00066417863,0.000046472534,0.00012090371,0.0002725484,0.00010208622,0.000004184152],"category_scores_gemma":[0.00007288575,0.00018517303,0.00006195469,0.00022073947,0.0000124973,0.00033276458,0.00002271808,0.00036366985,0.0000028678319],"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.000019762549,0.000026200174,0.000029872528,0.000011760516,0.000087690096,0.000028986049,0.00021475258,0.9716385,0.00038734594,0.000013913301,0.000029432018,0.027511781],"study_design_scores_gemma":[0.001768429,0.000069065456,0.00031666836,0.00019459844,0.000021726277,0.000046327696,0.000064844004,0.99609524,0.0010039348,0.00009584899,0.00012213028,0.00020117861],"about_ca_topic_score_codex":0.0000081831795,"about_ca_topic_score_gemma":0.0000039593842,"teacher_disagreement_score":0.46487194,"about_ca_system_score_codex":0.00021494999,"about_ca_system_score_gemma":0.000045545396,"threshold_uncertainty_score":0.75511366},"labels":[],"label_agreement":null},{"id":"W4386773820","doi":"10.5267/j.ijiec.2023.8.002","title":"A kernel-free L1 norm regularized ν-support vector machine model with application","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Text and Document Classification Technologies","field":"Computer Science","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Support vector machine; Overfitting; Computer science; Kernel method; Artificial intelligence; Kernel (algebra); Binary classification; Machine learning; Polynomial kernel; Benchmark (surveying); Computational complexity theory; Mathematical optimization; Algorithm; Mathematics; Artificial neural network","score_opus":0.025864387485464106,"score_gpt":0.2603472942397424,"score_spread":0.2344829067542783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010384176,0.000010419691,0.9785666,0.009648625,0.00069850124,0.00013197743,0.000016094114,0.00043628778,0.00010735319],"genre_scores_gemma":[0.92640346,0.000013569238,0.07302221,0.000056980385,0.00026041103,0.000022399865,0.000031856795,0.000017449502,0.00017167242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852186,0.000013522976,0.0004873155,0.00017729445,0.0006368236,0.00016318455],"domain_scores_gemma":[0.9986442,0.00013960726,0.00036031904,0.00031130423,0.0004665657,0.00007805952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030299017,0.00013637962,0.00017294596,0.0006749693,0.00005629216,0.00019311742,0.0016218422,0.00009260499,0.000006244528],"category_scores_gemma":[0.00026930516,0.00011972225,0.000084017265,0.00073561544,0.000028758406,0.0005904945,0.00021116275,0.00030908705,0.000022948025],"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.000043714615,0.00006943833,0.00020771501,0.0000033483395,0.00017221794,0.000036249432,0.00020747923,0.87533706,0.0018854768,0.09163472,0.004433774,0.025968801],"study_design_scores_gemma":[0.001602617,0.00009931158,0.00064522686,0.000038878028,0.000013592535,0.000086848704,0.000020053136,0.98964286,0.0008476723,0.0044122846,0.0024457257,0.00014494163],"about_ca_topic_score_codex":0.000006739926,"about_ca_topic_score_gemma":0.000001574982,"teacher_disagreement_score":0.91601926,"about_ca_system_score_codex":0.00013867418,"about_ca_system_score_gemma":0.00021651239,"threshold_uncertainty_score":0.48821318},"labels":[],"label_agreement":null},{"id":"W4386773872","doi":"10.5267/j.ijiec.2023.9.005","title":"Fitness landscape analysis of the simple assembly line balancing problem type 1","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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; Metaheuristic; Fitness landscape; Mathematics; Heuristic; Benchmark (surveying); Population; Entropy (arrow of time); Computer science","score_opus":0.019846640842938558,"score_gpt":0.26274095018075494,"score_spread":0.2428943093378164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7563143,0.000054067237,0.2386899,0.00036868418,0.003989778,0.00013983034,0.000055323137,0.00019883724,0.00018929585],"genre_scores_gemma":[0.9975461,0.000017539594,0.0018075326,0.000008586973,0.0004868767,0.0000018852305,0.000091937836,0.00002430759,0.000015258549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987235,0.000021470125,0.0006099843,0.00007510948,0.00043471585,0.00013519541],"domain_scores_gemma":[0.99876666,0.00025563038,0.00022891289,0.000109336834,0.0005921076,0.00004735532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029761766,0.00011648185,0.00026352177,0.0008237149,0.00003152171,0.00004433786,0.00038327812,0.00008555061,0.000018942701],"category_scores_gemma":[0.0003735759,0.00009931721,0.00017085548,0.0022914603,0.000010261174,0.00015347239,0.00005226028,0.00026346004,0.0000034149332],"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.0000073312217,0.000012688284,0.0041748276,0.00000663961,0.0009186558,0.000004855273,0.00014465138,0.9913273,0.0017069287,0.00010744315,0.00084047497,0.0007481951],"study_design_scores_gemma":[0.00042576934,0.000023554912,0.010321809,0.000087804154,0.00021641314,0.000010216301,0.000042199867,0.98750347,0.0007608184,0.00003008122,0.00048573484,0.00009215343],"about_ca_topic_score_codex":0.000007863224,"about_ca_topic_score_gemma":0.0000051094817,"teacher_disagreement_score":0.24123178,"about_ca_system_score_codex":0.00009023167,"about_ca_system_score_gemma":0.00008709313,"threshold_uncertainty_score":0.40500382},"labels":[],"label_agreement":null},{"id":"W4386773874","doi":"10.5267/j.ijiec.2023.9.004","title":"A modified clustering search based genetic algorithm for the proactive electric vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Vehicle routing problem; Cluster analysis; Genetic algorithm; Mathematical optimization; Electric vehicle; Routing (electronic design automation); Computer science; Integer programming; Plan (archaeology); Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.05167001046008366,"score_gpt":0.3033825025772423,"score_spread":0.2517124921171586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806605,0.00003998017,0.9792734,0.0007321774,0.0015001349,0.00037440765,0.000019378094,0.0002333952,0.000020535546],"genre_scores_gemma":[0.7547548,0.00001630301,0.24377923,0.00002277872,0.001278424,0.00004777475,0.0000146872235,0.0000709842,0.000015017169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857104,0.000051952196,0.00052276335,0.000120199424,0.00045475396,0.00027929296],"domain_scores_gemma":[0.9978963,0.0012441331,0.00013121025,0.000093446004,0.00055760395,0.000077278506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008505915,0.00015571348,0.0001827331,0.0005559958,0.000102530874,0.00015757768,0.00044398333,0.00009711353,0.0000040370237],"category_scores_gemma":[0.00033659194,0.00014177478,0.00013861647,0.0007989324,0.000013974814,0.00015543961,0.00004184914,0.00045550885,0.0000033566157],"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.000012094885,0.000011744118,0.000027694046,0.0000060020516,0.00023059905,0.0000074696886,0.00019855906,0.8867712,0.0009125837,0.000040884886,0.00014579413,0.11163535],"study_design_scores_gemma":[0.0012774231,0.00005339422,0.0004155194,0.00008041577,0.00003889764,0.000031182426,0.000065762135,0.99635696,0.0013672517,0.000033062326,0.00014477634,0.00013537386],"about_ca_topic_score_codex":0.0000064599985,"about_ca_topic_score_gemma":3.616112e-7,"teacher_disagreement_score":0.7369482,"about_ca_system_score_codex":0.00025305687,"about_ca_system_score_gemma":0.00015060508,"threshold_uncertainty_score":0.5781408},"labels":[],"label_agreement":null},{"id":"W4386773878","doi":"10.5267/j.ijiec.2023.7.003","title":"Collaborative scheduling of machining-assembly in complex multiple parallel production lines environment considering kitting constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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; Machining; Scheduling (production processes); Tabu search; Job shop scheduling; Genetic algorithm scheduling; Mathematical optimization; Computer science; Flow shop scheduling; Production line; Fair-share scheduling; Dynamic priority scheduling; Algorithm; Industrial engineering; Engineering; Mathematics; Mechanical engineering; Schedule","score_opus":0.03068500485081709,"score_gpt":0.2637960633611397,"score_spread":0.2331110585103226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7246529,0.000053640993,0.27256855,0.0003346961,0.001958736,0.00021721957,0.000026689206,0.00014330224,0.00004431456],"genre_scores_gemma":[0.94533736,0.00005671843,0.05398203,0.0000048066786,0.0005039351,0.0000071372306,0.00007119358,0.00003420712,0.0000025920242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826807,0.000039198014,0.00097108306,0.0001332025,0.00039878392,0.00018968686],"domain_scores_gemma":[0.9988022,0.00040413043,0.00032941616,0.00007959608,0.0003219228,0.00006276577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004756677,0.00017322556,0.0003151946,0.00081228436,0.0000344937,0.000042537053,0.00020598996,0.000100733254,0.000009832375],"category_scores_gemma":[0.0011221042,0.00020001105,0.00007359187,0.0005317067,0.0000407211,0.00027705534,0.00004523361,0.0003632033,0.0000049056825],"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.0000212152,0.000030496178,0.005029553,0.000015733249,0.0001458815,0.000024918212,0.00062524463,0.9708916,0.020491436,0.00007847257,0.00007925108,0.0025662275],"study_design_scores_gemma":[0.00129905,0.000033767144,0.0043337396,0.00035075058,0.00001664976,0.000039751394,0.00046472842,0.9903736,0.002728715,0.000033365333,0.00016393157,0.00016193598],"about_ca_topic_score_codex":0.0000074433137,"about_ca_topic_score_gemma":0.0000040873506,"teacher_disagreement_score":0.22068451,"about_ca_system_score_codex":0.00021009038,"about_ca_system_score_gemma":0.000102091886,"threshold_uncertainty_score":0.8156214},"labels":[],"label_agreement":null},{"id":"W4386773881","doi":"10.5267/j.ijiec.2023.7.004","title":"Bi-Objective simplified swarm optimization for fog computing task scheduling","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"IoT and Edge/Fog Computing","field":"Computer Science","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":"Computer science; Cloud computing; Scheduling (production processes); Distributed computing; Computation; Sorting; Mathematical optimization; Algorithm; Mathematics","score_opus":0.039264903336617085,"score_gpt":0.29248482573702783,"score_spread":0.25321992240041075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03877012,0.000022473932,0.93552935,0.0012494031,0.023973368,0.00017838589,0.0000029773794,0.00023357327,0.000040348776],"genre_scores_gemma":[0.727791,0.0000074643362,0.26183367,0.00009999394,0.010167487,0.0000057737893,0.000039328326,0.000037008664,0.000018238408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817413,0.00003778986,0.00075255526,0.00022922362,0.0004994671,0.00030681654],"domain_scores_gemma":[0.997217,0.000982717,0.00046386867,0.00012688778,0.0010925655,0.00011697238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007722502,0.0001806669,0.00025534362,0.0009554534,0.0001724285,0.00036721944,0.0009592677,0.000116177296,0.0000011001878],"category_scores_gemma":[0.0009889627,0.00019285255,0.00020071372,0.0009052316,0.000017355158,0.000560032,0.00021504766,0.0003656967,0.000008491407],"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.000015460419,0.000028179624,0.00006320628,0.0000050019344,0.00015367815,0.000018874085,0.00050213595,0.9789754,0.00020474779,0.0017147384,0.001450291,0.016868258],"study_design_scores_gemma":[0.0013374112,0.00009022376,0.00014937209,0.00017359995,0.000016227816,0.00006904051,0.000042493724,0.99535066,0.0004316492,0.0005590295,0.0015954088,0.000184898],"about_ca_topic_score_codex":0.0000062730846,"about_ca_topic_score_gemma":1.18868954e-7,"teacher_disagreement_score":0.68902093,"about_ca_system_score_codex":0.0001985037,"about_ca_system_score_gemma":0.00025527173,"threshold_uncertainty_score":0.7864298},"labels":[],"label_agreement":null},{"id":"W4386773918","doi":"10.5267/j.ijiec.2023.8.003","title":"Should offline retailers expand online under consumer showrooming based on the effects of intershowrooming and intrashowrooming?","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Business; Profit (economics); Market power; Industrial organization; Scale (ratio); Online and offline; Marketing; Microeconomics; Economics; Computer science; Monopoly","score_opus":0.0611448095903316,"score_gpt":0.28037102204243075,"score_spread":0.21922621245209917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98629856,0.00008902242,0.005879067,0.004762987,0.0026495946,0.00020369321,0.000010643186,0.000060100447,0.000046348647],"genre_scores_gemma":[0.99887866,0.00001522135,0.00025437886,0.00021218168,0.00057781825,0.000006057728,0.0000147383935,0.000027320051,0.000013647607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.000019734784,0.000576296,0.00014240031,0.000510593,0.00017087958],"domain_scores_gemma":[0.9974459,0.0015556745,0.00042655866,0.00010664627,0.00044264615,0.00002259065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004628199,0.00018769811,0.0002847349,0.0008873012,0.00008227546,0.00014717162,0.00033846608,0.000075362565,0.00002161098],"category_scores_gemma":[0.0017734987,0.00014921982,0.000130476,0.00047103883,0.00007923081,0.00029063813,0.00013984913,0.00042332674,0.000004524405],"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.0008261995,0.0008059879,0.26940084,0.0005572275,0.003198329,0.00047881738,0.00091041776,0.49806753,0.025556775,0.012277468,0.008104176,0.17981622],"study_design_scores_gemma":[0.0087248655,0.0002106222,0.076514706,0.0048487675,0.0008508715,0.000057106907,0.0018475982,0.89765835,0.0014443422,0.00037283177,0.0066091316,0.00086081825],"about_ca_topic_score_codex":0.000032085543,"about_ca_topic_score_gemma":0.000013661254,"teacher_disagreement_score":0.3995908,"about_ca_system_score_codex":0.000064801476,"about_ca_system_score_gemma":0.000049692986,"threshold_uncertainty_score":0.6085008},"labels":[],"label_agreement":null},{"id":"W4386773919","doi":"10.5267/j.ijiec.2023.9.003","title":"Optimization of emergency supplies paths based on dynamic real-time split deliver","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Ant colony optimization algorithms; Computer science; Process (computing); Mathematical optimization; Operations research; Ant colony; Distribution (mathematics); Industrial engineering; Engineering; Algorithm; Mathematics","score_opus":0.02645593826975051,"score_gpt":0.2534626046442031,"score_spread":0.2270066663744526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5771913,0.00002020275,0.39522207,0.0072830888,0.015854517,0.0006093834,0.000090413705,0.00041344855,0.0033155659],"genre_scores_gemma":[0.99730873,0.000034456694,0.0015502074,0.000058887228,0.0007069483,0.000005284004,0.0001857911,0.000020542739,0.00012914243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986161,0.000008910801,0.000628653,0.000108514796,0.0005197111,0.000118116084],"domain_scores_gemma":[0.9989039,0.00005758539,0.0002480471,0.00009290206,0.000681112,0.000016504362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034596634,0.00011787221,0.0001546697,0.0010000695,0.00004253342,0.000052971838,0.00030372455,0.000053683194,0.0005645547],"category_scores_gemma":[0.0003137564,0.000121182966,0.00012595583,0.0006309168,0.000011626542,0.00035962337,0.00005345358,0.00012298809,0.00010117429],"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.00003972061,0.00006729229,0.00032035576,0.000017124323,0.00007526748,0.0000060663383,0.000023437411,0.9919336,0.00016809776,0.0018226765,0.0034408467,0.0020855584],"study_design_scores_gemma":[0.00061286555,0.000023579483,0.002383457,0.00008523338,0.000031144325,5.7030104e-7,0.000041782605,0.994839,0.000013133792,0.00010650061,0.0017605588,0.00010214886],"about_ca_topic_score_codex":0.00007750542,"about_ca_topic_score_gemma":0.0000037681073,"teacher_disagreement_score":0.42011744,"about_ca_system_score_codex":0.00007281263,"about_ca_system_score_gemma":0.000035554192,"threshold_uncertainty_score":0.61814785},"labels":[],"label_agreement":null},{"id":"W4386773941","doi":"10.5267/j.ijiec.2023.9.002","title":"Mixed-model assembly line balancing problem in multi-demand scenarios","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"National Natural Science Foundation of China","keywords":"Workstation; Mathematical optimization; Computer science; Sensitivity (control systems); Heuristic; Constraint (computer-aided design); Integer programming; Assembly line; Line (geometry); Product (mathematics); Resource allocation; Operations research; Simulation; Algorithm; Engineering; Mathematics","score_opus":0.03832489790588605,"score_gpt":0.27463714780971454,"score_spread":0.2363122499038285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20232429,0.000044708897,0.7943976,0.00030949563,0.0024179856,0.00014939251,0.00001685143,0.00027716314,0.000062535735],"genre_scores_gemma":[0.954714,0.000043224223,0.04450481,0.000014139956,0.000577878,0.000008124438,0.0000619912,0.000053301974,0.00002254156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836475,0.000021918788,0.00081549794,0.00012343812,0.00042710858,0.00024727927],"domain_scores_gemma":[0.9991246,0.00019482305,0.00016166619,0.00008378328,0.00033975136,0.00009540486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050387083,0.0001843931,0.00027024472,0.0010485623,0.000029300387,0.00008882162,0.0003358988,0.00014687252,0.0000039922575],"category_scores_gemma":[0.00037881723,0.00020274712,0.00009478363,0.00066689163,0.000009729544,0.00037446333,0.00004989333,0.0005197273,0.000015635484],"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.000009567515,0.000033912438,0.00092026626,0.000011332613,0.00008831405,0.00005245252,0.0002644254,0.993411,0.0030611735,0.0001151922,0.00060196134,0.0014303837],"study_design_scores_gemma":[0.0016209674,0.000026679383,0.0011406163,0.00033316662,0.000014182293,0.000045654862,0.00004571855,0.9958396,0.0005400314,0.000054570395,0.00016381849,0.0001749891],"about_ca_topic_score_codex":0.000007263251,"about_ca_topic_score_gemma":0.000010883448,"teacher_disagreement_score":0.7523897,"about_ca_system_score_codex":0.00030564956,"about_ca_system_score_gemma":0.00012890394,"threshold_uncertainty_score":0.82677877},"labels":[],"label_agreement":null},{"id":"W4386773972","doi":"10.5267/j.ijiec.2023.9.001","title":"A two-sided logistics matching method considering trading psychology and matching effort under a 4PL","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"State Key Laboratory of Synthetical Automation for Process Industries; Higher Education Discipline Innovation Project; Major Research Plan; National Natural Science Foundation of China","keywords":"Matching (statistics); Supply chain; Computer science; Integrator; Supply chain management; Service (business); Business; Optimal matching; Process management; Operations research; Marketing; Mathematics","score_opus":0.05474405565656017,"score_gpt":0.3269537224066977,"score_spread":0.2722096667501375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19618784,0.000030826646,0.793788,0.005433586,0.0036170352,0.00019047204,0.000003412391,0.00018763369,0.0005611732],"genre_scores_gemma":[0.977984,0.000009228584,0.018682236,0.00074153946,0.0024938036,0.0000064033125,0.000017785165,0.00004090861,0.000024105251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845654,0.000018365261,0.0006388061,0.0001896941,0.00042686381,0.00026975412],"domain_scores_gemma":[0.9986011,0.0005520731,0.00039321237,0.000091058464,0.0003238752,0.000038689283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070374,0.00018631006,0.00026680934,0.0014520154,0.00011246442,0.0004310972,0.00033410723,0.00007577889,0.000036541907],"category_scores_gemma":[0.00067826814,0.0001978367,0.00009845487,0.00056082144,0.000027930555,0.0006495974,0.00021379457,0.00042652362,0.0000112518655],"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.000027244483,0.00002179498,0.00038245946,0.000025633324,0.00026475507,0.00025170553,0.00015314398,0.94739807,0.00040853643,0.044484906,0.0010238272,0.005557937],"study_design_scores_gemma":[0.0046193833,0.000039626815,0.0026136523,0.00057586713,0.00019287113,0.00038540558,0.0027046632,0.879406,0.000037279304,0.10271061,0.0061989226,0.0005157354],"about_ca_topic_score_codex":0.00015166543,"about_ca_topic_score_gemma":0.0000063327643,"teacher_disagreement_score":0.78179616,"about_ca_system_score_codex":0.00013273628,"about_ca_system_score_gemma":0.00006259706,"threshold_uncertainty_score":0.8067547},"labels":[],"label_agreement":null},{"id":"W4390103189","doi":"10.5267/j.ijiec.2023.9.007","title":"Collaborative decision making of photovoltaic industry chain considering carbon quota sharing contract","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Social Acceptance of Renewable Energy","field":"Social Sciences","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":"Photovoltaic system; Business; Industrial organization; Environmental economics; Economics; Engineering","score_opus":0.03311161390844348,"score_gpt":0.32981361636673046,"score_spread":0.296702002458287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902423,0.00008481631,0.0033947385,0.0005293345,0.0047912938,0.00014330437,0.000016268297,0.000080591206,0.0007173295],"genre_scores_gemma":[0.9959787,0.000043308173,0.00225105,0.000024865794,0.0016409272,0.0000049599303,0.0000035012877,0.000021174254,0.000031494837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979215,0.000065760556,0.0007149432,0.00014301128,0.0009105736,0.00024420244],"domain_scores_gemma":[0.9970571,0.001073727,0.0006104419,0.00007741894,0.0010869451,0.000094378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714957,0.00013288645,0.0003012465,0.0007131115,0.00012407062,0.00012727428,0.000539758,0.00028021957,0.000050003382],"category_scores_gemma":[0.0037770476,0.00015009221,0.00012041067,0.0011653124,0.000087326305,0.00031371773,0.00009024073,0.0005410901,0.0000016962288],"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.000073693314,0.000040631698,0.010211344,0.0000034947127,0.00028302264,0.00009693974,0.0041199015,0.9560207,0.0021762284,0.004377862,0.0004346626,0.022161521],"study_design_scores_gemma":[0.01847777,0.0007123722,0.039931867,0.011903076,0.00044766668,0.00020277749,0.09905696,0.7570107,0.015097139,0.02138056,0.032950893,0.0028282008],"about_ca_topic_score_codex":0.0007017978,"about_ca_topic_score_gemma":0.00031033263,"teacher_disagreement_score":0.19900998,"about_ca_system_score_codex":0.000387177,"about_ca_system_score_gemma":0.0006741501,"threshold_uncertainty_score":0.6120583},"labels":[],"label_agreement":null},{"id":"W4390103296","doi":"10.5267/j.ijiec.2023.9.011","title":"Heterogeneous multi-drone and helicopter routing problem for reconnaissance","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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 Shandong Province; National Natural Science Foundation of China","keywords":"Drone; Heuristics; Computer science; Orienteering; Routing (electronic design automation); Simulated annealing; Integer programming; Linear programming; Sorting; Mathematical optimization; Real-time computing; Operations research; Algorithm; Engineering; Computer network; Mathematics","score_opus":0.06545099294135076,"score_gpt":0.3112549915261021,"score_spread":0.24580399858475133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08136215,0.00007837799,0.9152245,0.00054777344,0.0023091848,0.00018579862,0.000027314107,0.0002473168,0.000017574346],"genre_scores_gemma":[0.8250827,0.000038022805,0.17393585,0.000021042772,0.00081191526,0.000013725828,0.00001693946,0.000049644415,0.00003016805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990599,0.000019472043,0.00046506457,0.000098936616,0.00018488642,0.00017169926],"domain_scores_gemma":[0.9990773,0.00035117476,0.00013030136,0.00005423964,0.00030584118,0.00008112216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046116175,0.00012563383,0.00018002735,0.00037048358,0.000045424465,0.00009461842,0.00018677805,0.000086893284,0.0000048366637],"category_scores_gemma":[0.00038284727,0.00013855544,0.00007667952,0.00022506295,0.000016233009,0.0001747902,0.000032084517,0.00021662423,0.0000034422198],"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.000008976905,0.00000833785,0.00016107908,0.00001044007,0.00013803688,0.000009056687,0.0001610703,0.9837867,0.00085990864,0.00012229996,0.0003831729,0.014350904],"study_design_scores_gemma":[0.0012773235,0.00003720929,0.00018141221,0.00014835065,0.000016846307,0.00010923999,0.000022455602,0.9951139,0.0011295166,0.000058850605,0.0017731353,0.00013172583],"about_ca_topic_score_codex":0.0000013882668,"about_ca_topic_score_gemma":4.861941e-7,"teacher_disagreement_score":0.74372053,"about_ca_system_score_codex":0.000087977205,"about_ca_system_score_gemma":0.000030642837,"threshold_uncertainty_score":0.5650127},"labels":[],"label_agreement":null},{"id":"W4390103319","doi":"10.5267/j.ijiec.2023.9.006","title":"A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"Vehicle routing problem; Standard deviation; Mathematical optimization; Heuristic; Routing (electronic design automation); Function (biology); Computer science; Variable (mathematics); Genetic algorithm; Operations research; Value (mathematics); Mathematics; Statistics","score_opus":0.05862155019185327,"score_gpt":0.30389646599607206,"score_spread":0.24527491580421878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012349976,0.00006638548,0.9845008,0.00032611884,0.0020673415,0.00034162303,0.000043036922,0.0002865408,0.000018162655],"genre_scores_gemma":[0.6867553,0.000014694269,0.31223425,0.000014644232,0.00083802384,0.00003495963,0.000027203454,0.000055785542,0.000025161624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986415,0.00004739789,0.0005859514,0.00013206307,0.0003479573,0.00024512343],"domain_scores_gemma":[0.99794954,0.001143925,0.00019778576,0.0000982505,0.00052952743,0.000080949605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087189814,0.00017325449,0.00021201212,0.00038028203,0.00010881006,0.00014498713,0.00046235387,0.00007836742,0.0000029345338],"category_scores_gemma":[0.0012590796,0.00015402038,0.00016459699,0.00040708232,0.000023881219,0.00018655304,0.000054292123,0.0004716604,0.0000043608297],"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.000013689878,0.000031720327,0.00019787264,0.000010112966,0.000320107,0.000009039694,0.00035899846,0.9907186,0.00046755574,0.00014397362,0.00049849163,0.007229846],"study_design_scores_gemma":[0.0017743632,0.000027767055,0.0005225512,0.00007631466,0.00004738519,0.00007262172,0.00015055045,0.99618506,0.0005730881,0.000026267115,0.0003946622,0.00014936399],"about_ca_topic_score_codex":0.0000068179093,"about_ca_topic_score_gemma":4.5008255e-7,"teacher_disagreement_score":0.6744053,"about_ca_system_score_codex":0.00019702045,"about_ca_system_score_gemma":0.00008268684,"threshold_uncertainty_score":0.6280769},"labels":[],"label_agreement":null},{"id":"W4390103358","doi":"10.5267/j.ijiec.2023.10.003","title":"Contract selection for collaborative innovation in the new energy vehicle supply chain under the dual credit policy: Cost sharing and benefit sharing","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","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":"Supply chain; Profit (economics); Revenue sharing; Business; Revenue; Profit model; Industrial organization; Profit sharing; Microeconomics; Marketing; Economics; Finance","score_opus":0.02228901532112036,"score_gpt":0.2639880379622319,"score_spread":0.24169902264111157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88602453,0.00013557491,0.10326863,0.008512634,0.0015131349,0.00034917996,0.000044145443,0.00009630808,0.000055833272],"genre_scores_gemma":[0.99727136,0.000040792456,0.00026836776,0.000121671015,0.002196228,0.000017021146,0.00003307233,0.000021448703,0.000030022373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899304,0.000007762518,0.00046964738,0.00009642932,0.00025506684,0.00017808446],"domain_scores_gemma":[0.99913824,0.00033505016,0.00013227735,0.000051868723,0.00030635382,0.00003618511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038476993,0.000120219614,0.00013294324,0.0005945891,0.00008064963,0.00020646333,0.000264146,0.00009191341,0.000004220235],"category_scores_gemma":[0.00015646653,0.00009320841,0.0000395244,0.0014274046,0.000012555602,0.0002549399,0.000029056162,0.00035795328,3.9523238e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023236838,0.0000060712227,0.0007283888,0.000002238864,0.00010435631,0.0000027694837,0.0004506281,0.92110664,0.00093925267,0.06682032,0.0011955895,0.008620508],"study_design_scores_gemma":[0.0014463663,0.00006825292,0.008846976,0.000074502226,0.000016040292,0.000077342425,0.00027476874,0.97643936,0.0005187604,0.009197962,0.0029261042,0.00011358418],"about_ca_topic_score_codex":0.00010367047,"about_ca_topic_score_gemma":0.00004483404,"teacher_disagreement_score":0.11124682,"about_ca_system_score_codex":0.00020352767,"about_ca_system_score_gemma":0.00009701396,"threshold_uncertainty_score":0.38009286},"labels":[],"label_agreement":null},{"id":"W4390103365","doi":"10.5267/j.ijiec.2023.10.001","title":"Matheuristic approach and a mixed-integer linear programming model for biomass supply chain optimization with demand selection","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Forest Biomass Utilization and Management","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":"King Fahd University of Petroleum and Minerals","keywords":"Supply chain; Profit (economics); Supply chain optimization; Linear programming; Biomass (ecology); Integer programming; Environmental economics; Computer science; Fossil fuel; Renewable energy; Operations research; Business; Supply chain management; Economics; Engineering; Microeconomics; Waste management","score_opus":0.0240489747792783,"score_gpt":0.24185559505308873,"score_spread":0.21780662027381043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02101092,0.000022030916,0.977803,0.00014079342,0.0005397875,0.00025263324,0.000017301412,0.000191353,0.000022168668],"genre_scores_gemma":[0.90601903,0.000022223943,0.093458444,0.0000070101178,0.00029271073,0.000033565448,0.0000931064,0.00003849161,0.000035412442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919754,0.000008914435,0.0003255063,0.00009882881,0.00023037793,0.0001388379],"domain_scores_gemma":[0.9994531,0.0000704366,0.000093672614,0.000037662103,0.00027905815,0.00006604055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021675309,0.00012527926,0.00013695567,0.00057110155,0.00004380359,0.00009216143,0.000116489326,0.00006882023,0.0000018004312],"category_scores_gemma":[0.00008564162,0.00011711801,0.000046798228,0.00036294947,0.000016043152,0.00017209507,0.000019317951,0.00011760985,7.351981e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029303807,0.000023541383,0.00015104057,0.00003233522,0.00018112046,0.0000034387378,0.00013653551,0.9958379,0.0000732677,0.0009479772,0.0005502732,0.002033227],"study_design_scores_gemma":[0.0010708176,0.00006392343,0.00007002174,0.00008634823,0.000038692084,0.000046063262,0.000055305867,0.99763805,0.00011097071,0.000041205956,0.0006618857,0.00011669229],"about_ca_topic_score_codex":0.0000015776758,"about_ca_topic_score_gemma":0.0000016172244,"teacher_disagreement_score":0.8850081,"about_ca_system_score_codex":0.00008205557,"about_ca_system_score_gemma":0.00003337563,"threshold_uncertainty_score":0.4775934},"labels":[],"label_agreement":null},{"id":"W4390103372","doi":"10.5267/j.ijiec.2023.9.009","title":"A multi-objective site selection of electric vehicle charging station based on NSGA-II","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":19,"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 Inner Mongolia; National Natural Science Foundation of China","keywords":"Charging station; Site selection; Electric vehicle; Maximization; Selection (genetic algorithm); Cluster analysis; Computer science; Point (geometry); Transport engineering; Mathematical optimization; Operations research; Engineering; Mathematics","score_opus":0.023864676336733358,"score_gpt":0.26197651348998713,"score_spread":0.23811183715325376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77703434,0.0000073027027,0.22073206,0.00026739112,0.0014626244,0.000180877,0.000069779126,0.00021162331,0.00003397567],"genre_scores_gemma":[0.99685395,0.000007580681,0.0027213276,0.000022965392,0.00025374154,0.000013178872,0.00009055936,0.000025381105,0.000011312165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.000020541236,0.00060839095,0.000093666604,0.0004083835,0.00014168322],"domain_scores_gemma":[0.9988018,0.00023539532,0.00018243286,0.000057756843,0.00066827185,0.000054311626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002828944,0.0001261525,0.00016895964,0.0013585461,0.000055431487,0.000028316561,0.00014564079,0.00008345141,0.000023939534],"category_scores_gemma":[0.00023363956,0.00014115262,0.00010363543,0.0012757181,0.000010584868,0.00020980276,0.0000065460545,0.00034132713,0.000008166199],"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.000030958614,0.00007042833,0.0011305541,0.000007662365,0.00012124915,0.000004701455,0.00036036456,0.96193516,0.03312817,0.00030183163,0.00025208556,0.0026568042],"study_design_scores_gemma":[0.0014609281,0.00012952827,0.02116799,0.00011435201,0.000024089324,0.000005822855,0.00004334343,0.9674687,0.009060794,0.000021922959,0.00039091872,0.00011165424],"about_ca_topic_score_codex":0.000013951197,"about_ca_topic_score_gemma":0.0000064224523,"teacher_disagreement_score":0.21981959,"about_ca_system_score_codex":0.00019818085,"about_ca_system_score_gemma":0.000114212664,"threshold_uncertainty_score":0.57560366},"labels":[],"label_agreement":null},{"id":"W4390103421","doi":"10.5267/j.ijiec.2023.10.002","title":"Evolutionary game analysis of vehicle procurement in the courier industry from the perspective of green supply chain","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"National Natural Science Foundation of China","keywords":"Supply chain; Procurement; Business; Industrial organization; Interdependence; Supply chain management; Government (linguistics); Supply chain risk management; Stakeholder; Environmental economics; Service management; Marketing; Economics","score_opus":0.10125333663144054,"score_gpt":0.35847350783888043,"score_spread":0.2572201712074399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836973,0.000036986166,0.0052519715,0.009864331,0.0007341571,0.00012511674,0.0001382955,0.000007974053,0.00014388251],"genre_scores_gemma":[0.99925387,0.0000024830135,0.00024404685,0.00008008413,0.0003500649,0.0000026912683,0.000017259239,0.0000049133605,0.00004461247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996814,0.000137985,0.0011028694,0.000118640935,0.001723229,0.00010325702],"domain_scores_gemma":[0.9948127,0.0024002688,0.00075771875,0.00014406747,0.0018562893,0.00002889952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024468028,0.000085143416,0.00024379756,0.0013219643,0.00004142386,0.00005730595,0.00091138785,0.00009963095,0.0001375927],"category_scores_gemma":[0.0037098425,0.000052951404,0.00018426383,0.004008921,0.00006330757,0.0001650361,0.000085978565,0.0005274945,0.0000030755893],"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.00005766515,0.00010008771,0.045983415,5.874284e-7,0.00062823493,0.000014222439,0.0061916746,0.92733383,0.00041343234,0.0133889625,0.0020697098,0.0038182004],"study_design_scores_gemma":[0.0010533181,0.000063729654,0.3945509,0.00010282006,0.000110863715,0.00000917844,0.010160153,0.5880015,0.00009219617,0.004579883,0.0011884295,0.00008704478],"about_ca_topic_score_codex":0.00034135304,"about_ca_topic_score_gemma":0.000027801862,"teacher_disagreement_score":0.3485675,"about_ca_system_score_codex":0.000110481684,"about_ca_system_score_gemma":0.00020065845,"threshold_uncertainty_score":0.4441296},"labels":[],"label_agreement":null},{"id":"W4390122090","doi":"10.5267/j.ijiec.2023.10.005","title":"Research on optimization of flight crew scheduling considering pilot fatigue","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sleep and Work-Related Fatigue","field":"Psychology","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":"National Natural Science Foundation of China","keywords":"Crew; Alertness; Crew scheduling; Scheduling (production processes); Engineering; Duration (music); Aviation; Civil aviation; Aircrew; Operations research; Computer science; Aviation safety; Reliability engineering; Aeronautics; Operations management","score_opus":0.20343211385113855,"score_gpt":0.40880771451620307,"score_spread":0.20537560066506452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66355133,0.00019480883,0.3096822,0.0033020668,0.019024426,0.0003821121,0.00003499926,0.00020232212,0.0036257454],"genre_scores_gemma":[0.99386877,0.000017851627,0.005033267,0.000020632411,0.000975068,0.000006482089,0.00002298543,0.000028534521,0.00002638841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808806,0.00011746788,0.0007294303,0.0001472618,0.0006952577,0.00022250338],"domain_scores_gemma":[0.99725777,0.0013241664,0.00028601012,0.00012091233,0.0009165056,0.00009461399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695471,0.00012005025,0.00020486432,0.0016132193,0.00006964638,0.000057212077,0.00036761546,0.00014182633,0.00018788643],"category_scores_gemma":[0.0007611312,0.00012278784,0.000097093965,0.0009678086,0.00004712944,0.00013512772,0.000052390515,0.0008024828,0.000046923094],"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.00011926329,0.00010812258,0.00031012844,0.0000015969425,0.00040310566,0.000073659496,0.0004104077,0.9817152,0.00018405207,0.010695781,0.0016175455,0.0043611364],"study_design_scores_gemma":[0.017441701,0.0030509843,0.003110795,0.007086787,0.00020525698,0.00027508714,0.0038294478,0.954891,0.0058994405,0.0009992494,0.0021878146,0.0010224],"about_ca_topic_score_codex":0.0000295858,"about_ca_topic_score_gemma":7.1586726e-7,"teacher_disagreement_score":0.33031747,"about_ca_system_score_codex":0.00011425922,"about_ca_system_score_gemma":0.00011976596,"threshold_uncertainty_score":0.50071424},"labels":[],"label_agreement":null},{"id":"W4390122100","doi":"10.5267/j.ijiec.2023.10.004","title":"A dynamic incentive mechanism for data sharing in manufacturing industry","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"Incentive; Evolutionary game theory; Computer science; Evolutionarily stable strategy; Game theory; Data sharing; Mechanism (biology); Evolutionary algorithm; Population; Particle swarm optimization; Evolutionary computation; Traceability; Microeconomics; Artificial intelligence; Economics; Algorithm","score_opus":0.07501137362080551,"score_gpt":0.3540781143259964,"score_spread":0.2790667407051909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96832836,0.000012886331,0.01742401,0.0050256643,0.007970364,0.00028010464,0.00009487124,0.00011298279,0.0007507559],"genre_scores_gemma":[0.9974703,0.000020370408,0.0014812466,0.000027974167,0.0008405188,0.0000058251917,0.000043581662,0.000014014438,0.00009617405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987712,0.00003379376,0.00040535265,0.00014415612,0.00043838442,0.00020714237],"domain_scores_gemma":[0.99870324,0.0006809332,0.00018862789,0.00008612954,0.00025327658,0.00008780006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013526147,0.00007848782,0.00014312059,0.00049108063,0.00008476202,0.0001786212,0.0009480042,0.00016992667,0.0000075189637],"category_scores_gemma":[0.0038199879,0.00008958923,0.000059012687,0.00030521632,0.00002815481,0.000460621,0.00016426056,0.00045127733,0.0000034442248],"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.00038559,0.00043823637,0.009385998,0.0000493887,0.0012087715,0.0005130743,0.025595447,0.5457523,0.00038471527,0.18240361,0.0059975926,0.22788529],"study_design_scores_gemma":[0.00860071,0.00020116186,0.009785992,0.0028125227,0.000113419635,0.000031318432,0.01821594,0.8602961,0.00040259192,0.06875159,0.029706238,0.0010824712],"about_ca_topic_score_codex":0.00014408868,"about_ca_topic_score_gemma":0.00008780966,"teacher_disagreement_score":0.31454378,"about_ca_system_score_codex":0.00027767074,"about_ca_system_score_gemma":0.00024802584,"threshold_uncertainty_score":0.4573158},"labels":[],"label_agreement":null},{"id":"W4390122113","doi":"10.5267/j.ijiec.2023.9.008","title":"Part transformation-based spare parts inventory control model for the high-tech industries","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","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":"Spare part; Inventory theory; Transformation (genetics); Simulated annealing; Inventory control; Inventory cost; Holding cost; Computer science; Substitution (logic); Reliability engineering; Operations research; Operations management; Manufacturing engineering; Supply chain; Business; Engineering; Algorithm","score_opus":0.1880429861423732,"score_gpt":0.363890970614734,"score_spread":0.17584798447236083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016496208,0.000015969305,0.96495354,0.016229264,0.001584239,0.00035155177,0.0002430377,0.00010256587,0.00002365088],"genre_scores_gemma":[0.9963853,0.0000050761323,0.0024415485,0.00014483808,0.0008049154,0.000078630896,0.00003708284,0.000015485979,0.00008712814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768203,0.00003405931,0.00096493977,0.00013391636,0.0010156463,0.0001693992],"domain_scores_gemma":[0.99519116,0.002768448,0.00046696383,0.00017096887,0.0013188696,0.0000835634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018829197,0.00012337262,0.00020237951,0.0005387292,0.00017727152,0.0002635079,0.00094340614,0.000111507434,0.000024112669],"category_scores_gemma":[0.003004679,0.000088720044,0.0001821302,0.0007280439,0.000054116623,0.00025889117,0.000028740338,0.00032177343,0.0000118454955],"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.00003144392,0.000021470114,0.00009669004,9.387394e-7,0.000060317903,0.0000015758866,0.00013705865,0.94846904,0.000016831935,0.00788433,0.03380564,0.009474644],"study_design_scores_gemma":[0.0010663165,0.000045534667,0.00010382539,0.000059212776,0.000028875364,0.000008358085,0.00010613699,0.9630514,0.00017812617,0.0060877954,0.029176043,0.00008840578],"about_ca_topic_score_codex":0.000010932748,"about_ca_topic_score_gemma":0.000004574087,"teacher_disagreement_score":0.9798891,"about_ca_system_score_codex":0.00008917293,"about_ca_system_score_gemma":0.00034663462,"threshold_uncertainty_score":0.36178982},"labels":[],"label_agreement":null},{"id":"W4390122129","doi":"10.5267/j.ijiec.2023.11.002","title":"Optimization of a hybrid multi-item fabricating-shipping integrated system considering scrap, adjustable-rate, and postponement","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Postponement; Scrap; Production (economics); Finished good; Quality (philosophy); Computer science; Batch production; Operations research; Lead time; Plan (archaeology); Quality assurance; Operations management; Manufacturing engineering; Reliability engineering; Engineering; Economics","score_opus":0.029295349721258183,"score_gpt":0.2353091917561806,"score_spread":0.2060138420349224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3683033,0.00008088285,0.6267349,0.0013183036,0.0026567131,0.00046594915,0.000018264871,0.0002569926,0.00016470658],"genre_scores_gemma":[0.99150664,0.000009802057,0.007623279,0.000060355214,0.00066906965,0.000009945695,0.00006139067,0.00003237324,0.000027175125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983816,0.00002376642,0.000817979,0.0001619437,0.00040917651,0.00020550539],"domain_scores_gemma":[0.99768424,0.00028787553,0.00070668705,0.00009104229,0.0012022111,0.000027940667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008539882,0.00017443261,0.00027011463,0.0015761533,0.00007994377,0.00027159828,0.00029723512,0.000045547193,0.000016990594],"category_scores_gemma":[0.0011980474,0.00018152388,0.000080688216,0.00084009045,0.00002925899,0.0006904183,0.00019668862,0.00022965991,0.000004817679],"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.000029972423,0.000034109435,0.0013889188,0.00011156486,0.00023284786,0.000101693695,0.00006820192,0.9928611,0.00030250874,0.002504106,0.00049312075,0.0018718763],"study_design_scores_gemma":[0.0016128942,0.00001909395,0.0008792096,0.0006798109,0.00006770906,0.000035482426,0.0022899867,0.99295855,0.00010768902,0.000031234646,0.0011703494,0.00014801182],"about_ca_topic_score_codex":0.00016268337,"about_ca_topic_score_gemma":0.0000019272995,"teacher_disagreement_score":0.62320334,"about_ca_system_score_codex":0.0002259405,"about_ca_system_score_gemma":0.00008454397,"threshold_uncertainty_score":0.74023294},"labels":[],"label_agreement":null},{"id":"W4390122136","doi":"10.5267/j.ijiec.2023.12.004","title":"BHARAT: A simple and effective multi-criteria decision-making method that does not need fuzzy logic, Part-2: Role in multi- and many-objective optimization problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Multi-objective optimization; Mathematical optimization; Compromise; Fuzzy logic; Pareto principle; Simple (philosophy); Mathematics; Optimization problem; Process (computing); Computer science; Artificial intelligence","score_opus":0.12620302419145477,"score_gpt":0.42098832931910657,"score_spread":0.2947853051276518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16091587,0.000067673325,0.8356543,0.0005496186,0.002190686,0.00046972843,0.000087961795,0.000055221673,0.000008924114],"genre_scores_gemma":[0.80158937,0.000030226169,0.19789979,0.000082526414,0.0003191223,0.00002510153,0.00000944934,0.000029500217,0.0000149102725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960615,0.00037273703,0.0014291955,0.00050560816,0.0013289109,0.0003020404],"domain_scores_gemma":[0.98979324,0.008050904,0.00075401604,0.0001848676,0.0010570457,0.00015993221],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0039413585,0.0002922334,0.00057154166,0.0023929868,0.00013682888,0.0008780789,0.00062989345,0.00020728941,0.000056927493],"category_scores_gemma":[0.01140027,0.00022762477,0.0001372613,0.0009908682,0.00005840125,0.00096941047,0.00038706776,0.00054837967,0.000008779308],"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.00017711733,0.00007249939,0.002598249,0.0000033724777,0.00009396906,0.00008266437,0.0014574114,0.9198204,0.0012945854,0.00019903599,0.00010332378,0.07409735],"study_design_scores_gemma":[0.0034365435,0.00007921136,0.017825257,0.00042461554,0.000021631175,0.00012691635,0.00092574814,0.9725403,0.00026166893,0.0037487021,0.0003638776,0.00024548994],"about_ca_topic_score_codex":0.00003791138,"about_ca_topic_score_gemma":0.000021205109,"teacher_disagreement_score":0.6406735,"about_ca_system_score_codex":0.00018942576,"about_ca_system_score_gemma":0.000092528404,"threshold_uncertainty_score":0.99692714},"labels":[],"label_agreement":null},{"id":"W4390122146","doi":"10.5267/j.ijiec.2023.12.001","title":"Research on collaborative decision making of China's photovoltaic supply chain based on competition policy","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"Supply chain; Industrial organization; Profit (economics); Business; Competition (biology); China; Government (linguistics); Economics; Marketing; Microeconomics","score_opus":0.13634294949271067,"score_gpt":0.4369554203578868,"score_spread":0.3006124708651762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.888091,0.000006002347,0.10037647,0.0051208255,0.003982854,0.00029664158,0.0001519554,0.0000566245,0.0019176207],"genre_scores_gemma":[0.99632907,0.0000026619116,0.0025496958,0.00012305318,0.0009071701,0.0000039761117,0.000018719356,0.00001656346,0.000049111946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947161,0.00021638355,0.0012286702,0.00020575158,0.0034202414,0.00021286681],"domain_scores_gemma":[0.99011993,0.0051554,0.00067360065,0.00017382982,0.003804893,0.00007236307],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0048532067,0.00013623768,0.00027676107,0.006581401,0.00014773567,0.00022520135,0.0007445992,0.00011616263,0.00014615324],"category_scores_gemma":[0.014782418,0.00011498179,0.00013723483,0.0056242845,0.000065605505,0.00020019256,0.00009206601,0.0006436453,0.00005852454],"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.00029522082,0.000099993355,0.00028610002,0.000001373054,0.000028425795,0.00003159576,0.00034464395,0.94631034,0.0008563592,0.018599983,0.004513751,0.028632231],"study_design_scores_gemma":[0.0021132547,0.00052620354,0.012470717,0.0010469145,0.0000042532247,0.000018594334,0.0007994677,0.97348136,0.0010714562,0.005731236,0.0025996608,0.0001369116],"about_ca_topic_score_codex":0.000011403612,"about_ca_topic_score_gemma":0.0000021018295,"teacher_disagreement_score":0.10823804,"about_ca_system_score_codex":0.00027893586,"about_ca_system_score_gemma":0.00055836735,"threshold_uncertainty_score":0.9935165},"labels":[],"label_agreement":null},{"id":"W4390122151","doi":"10.5267/j.ijiec.2023.10.007","title":"The optimal design of differentiated subsidy policies for new energy vehicle firms by considering the difference in market share and endurance mileage","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Transit (satellite); Vehicle routing problem; Routing (electronic design automation); Computer science; Cash; Genetic algorithm; Mathematical optimization; Transport engineering; Engineering; Business; Public transport; Computer network; Finance; Mathematics","score_opus":0.04426574693649306,"score_gpt":0.2758473466521813,"score_spread":0.23158159971568826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21853903,0.00026599853,0.7791312,0.0009774148,0.0008368614,0.0001377859,0.000048585473,0.000057661862,0.0000054866696],"genre_scores_gemma":[0.9911646,0.00019532471,0.008294492,0.0000127041485,0.00022342442,0.00001187722,0.000010828938,0.000027731236,0.00005899158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.00006093247,0.00048049566,0.00007772612,0.00022570096,0.00016873522],"domain_scores_gemma":[0.99728024,0.0022801966,0.00015235659,0.00007150073,0.00016243754,0.000053245374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042252103,0.00012128438,0.00017541386,0.00020816531,0.00006242773,0.0000976671,0.00031915956,0.00006812722,0.0000050813865],"category_scores_gemma":[0.0007240525,0.00009291569,0.00005456097,0.00031967193,0.000035316545,0.00009579536,0.000043263943,0.00021972462,1.7094368e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031717573,0.0000067393776,0.0004018454,0.0000050283084,0.00010721169,0.0000022439342,0.0002476454,0.9854309,0.0044174273,0.0001796978,0.002414527,0.006755014],"study_design_scores_gemma":[0.0009770049,0.000027590866,0.0049338206,0.00014101792,0.000013158937,0.000015120002,0.0000879792,0.9901813,0.0029102867,0.00010346849,0.00051890395,0.00009035116],"about_ca_topic_score_codex":0.000027205038,"about_ca_topic_score_gemma":0.000004147953,"teacher_disagreement_score":0.7726256,"about_ca_system_score_codex":0.000058574624,"about_ca_system_score_gemma":0.000057009405,"threshold_uncertainty_score":0.3788992},"labels":[],"label_agreement":null},{"id":"W4390122163","doi":"10.5267/j.ijiec.2023.11.003","title":"Research on location-routing optimization of distribution center for emergency supplies based on IMOCS-LNS hybrid algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Cuckoo search; Mathematical optimization; Computer science; Algorithm; Mathematics; Particle swarm optimization","score_opus":0.07342673816903085,"score_gpt":0.3235448329334237,"score_spread":0.25011809476439284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020094607,0.00000501791,0.96974427,0.004243131,0.0050176997,0.00040058777,0.00018575981,0.0000792684,0.00022963589],"genre_scores_gemma":[0.9956809,0.000008640606,0.0013944107,0.00006060046,0.0016450115,0.000024573597,0.001126004,0.00002004646,0.000039785693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981513,0.000019674146,0.0007042534,0.00015562339,0.00077506516,0.00019407076],"domain_scores_gemma":[0.9973511,0.00019655425,0.00024520291,0.00010916334,0.0020766451,0.000021352342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010748311,0.00012478705,0.00015438585,0.0011015696,0.000124693,0.000092654955,0.0003352225,0.00005180932,0.000088744484],"category_scores_gemma":[0.0009571616,0.00012847102,0.00012330829,0.0009436441,0.00002227244,0.00033334238,0.00005330137,0.00022244935,0.000030679977],"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.00006798042,0.00015174852,0.00021423415,0.000027209604,0.00006473182,0.0000021255157,0.000017423557,0.97613144,0.000010704631,0.0067508765,0.010530866,0.006030689],"study_design_scores_gemma":[0.0010725769,0.00006306434,0.0009079243,0.0001843347,0.000017598148,7.0197353e-7,0.00013274777,0.9907341,0.000081270875,0.00020115598,0.0065017366,0.00010279676],"about_ca_topic_score_codex":0.000052393476,"about_ca_topic_score_gemma":0.0000025846555,"teacher_disagreement_score":0.9755863,"about_ca_system_score_codex":0.00015003697,"about_ca_system_score_gemma":0.000066250024,"threshold_uncertainty_score":0.5238896},"labels":[],"label_agreement":null},{"id":"W4390122165","doi":"10.5267/j.ijiec.2023.12.002","title":"A hybrid genetic algorithm with variable neighborhood search for batch dispersion problem to improve traceability","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"National Natural Science Foundation of China","keywords":"Crossover; Initialization; Population; Heuristic; Mathematical optimization; Genetic algorithm; Selection (genetic algorithm); Computer science; Local optimum; Variable (mathematics); Algorithm; Dispersion (optics); Mathematics; Artificial intelligence","score_opus":0.016080231477370515,"score_gpt":0.24755366560525943,"score_spread":0.23147343412788893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018480856,0.000011972934,0.9793065,0.00023669752,0.0013214923,0.00030493847,0.0001068866,0.0002019468,0.000028717042],"genre_scores_gemma":[0.5932258,0.000011991036,0.40580896,0.00001091787,0.0007917917,0.000028110027,0.000054185522,0.000044308486,0.000023983228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896646,0.000010183362,0.0003757752,0.0001306296,0.0003120305,0.00020494124],"domain_scores_gemma":[0.999033,0.00025176787,0.00006372776,0.00008240226,0.000448112,0.00012102448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214399,0.00013664465,0.00016605458,0.00035013206,0.0000459952,0.00007944259,0.00022687939,0.000054660926,0.0000067163905],"category_scores_gemma":[0.0001214056,0.0001293017,0.00005730238,0.00025663615,0.000011226599,0.00015449725,0.000028044087,0.00024475832,0.000004021474],"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.000034267545,0.000024509547,0.00002604611,0.0000140169195,0.00011772219,0.000011069406,0.00009286134,0.97020316,0.00023440771,0.00019068799,0.00038403334,0.028667219],"study_design_scores_gemma":[0.0011079203,0.00020964738,0.00016647848,0.00009495386,0.000025662213,0.000037353788,0.000031656768,0.99516106,0.0016180478,0.00047552702,0.000921358,0.00015033821],"about_ca_topic_score_codex":0.000005991658,"about_ca_topic_score_gemma":2.5770316e-7,"teacher_disagreement_score":0.57474494,"about_ca_system_score_codex":0.00019299219,"about_ca_system_score_gemma":0.000082252445,"threshold_uncertainty_score":0.527277},"labels":[],"label_agreement":null},{"id":"W4390122166","doi":"10.5267/j.ijiec.2023.10.006","title":"Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","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":"Simulated annealing; Computer science; Heuristic; Mathematical optimization; Reuse; USable; Exploit; Stock (firearms); Set (abstract data type); Engineering; Mathematics; Algorithm","score_opus":0.031786723530490245,"score_gpt":0.24662577589434723,"score_spread":0.21483905236385697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066271074,0.00013185953,0.9243956,0.0024682637,0.0037016752,0.0008467097,0.0013510943,0.00043532753,0.00039837297],"genre_scores_gemma":[0.95553154,0.000019552423,0.043153808,0.000057366175,0.0008696092,0.000032416632,0.00023581361,0.0000463606,0.00005356004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901146,0.000012458644,0.00038923902,0.000093515344,0.00033343403,0.00015990078],"domain_scores_gemma":[0.9982482,0.0011117007,0.00011907182,0.000045921992,0.00040438477,0.00007072078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027918242,0.00012592792,0.00014345295,0.00023529389,0.00012670434,0.00015921259,0.00016465694,0.000042764295,0.000109100365],"category_scores_gemma":[0.0002779193,0.00010470917,0.000052547908,0.0001695117,0.000048291426,0.00019981716,0.000025780575,0.0002770796,0.0000036956724],"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.000011963195,0.000010131562,0.00005814227,0.000010092591,0.00026375457,0.000008535318,0.00009598731,0.98764074,0.000082191655,0.0007555326,0.006617506,0.00444545],"study_design_scores_gemma":[0.0012644174,0.00006507709,0.00018316385,0.00034366388,0.000035927278,0.00022559933,0.00005671211,0.99367964,0.00011176085,0.0001323368,0.0037653977,0.00013630482],"about_ca_topic_score_codex":0.000002483174,"about_ca_topic_score_gemma":6.497307e-7,"teacher_disagreement_score":0.8892604,"about_ca_system_score_codex":0.00006945984,"about_ca_system_score_gemma":0.00010708158,"threshold_uncertainty_score":0.42699158},"labels":[],"label_agreement":null},{"id":"W4390122176","doi":"10.5267/j.ijiec.2023.11.001","title":"Software testing and release decision at different statistical confidence levels with consideration of debuggers’ learning and negligent factors","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Software Reliability and Analysis Research","field":"Computer Science","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":"Reliability (semiconductor); Debugging; Reliability engineering; Software quality; Computer science; Software; Confidence interval; Resource (disambiguation); Process (computing); Imperfect; Function (biology); Risk analysis (engineering); Software development; Engineering; Statistics; Mathematics","score_opus":0.061233479030421825,"score_gpt":0.3108060944516885,"score_spread":0.24957261542126669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4998905,0.000017589164,0.49979383,0.00011847682,0.00011562171,0.00003398895,0.0000055596583,0.000023751758,6.749329e-7],"genre_scores_gemma":[0.9618492,0.000018957471,0.038058706,0.0000044363164,0.00005190241,0.0000011633218,0.00000465972,0.000005758723,0.0000052268465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868697,0.000054460575,0.0004107542,0.0001476359,0.0005844695,0.000115682815],"domain_scores_gemma":[0.994353,0.004670197,0.00019698004,0.00005749942,0.0006027517,0.000119565564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002858039,0.000096541786,0.00019011617,0.00036761598,0.00008987315,0.00014089962,0.0001802672,0.000048604208,0.0000062679364],"category_scores_gemma":[0.0057886234,0.00007717149,0.000031831838,0.00030655105,0.00005416379,0.00022160381,0.00015050275,0.00025908797,5.946727e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005697726,0.000048501228,0.13468349,0.000019268875,0.00021839111,0.00010136174,0.00065165054,0.7922201,0.001348049,0.0019233475,0.0000765438,0.06865232],"study_design_scores_gemma":[0.0010737989,0.00032473676,0.10242504,0.00043850392,0.0000273296,0.00016309776,0.000102498605,0.89272743,0.0013091513,0.0012125534,0.000044403707,0.00015144447],"about_ca_topic_score_codex":0.00002470102,"about_ca_topic_score_gemma":0.0000032085588,"teacher_disagreement_score":0.4619587,"about_ca_system_score_codex":0.000079572084,"about_ca_system_score_gemma":0.000100355945,"threshold_uncertainty_score":0.6929941},"labels":[],"label_agreement":null},{"id":"W4390122183","doi":"10.5267/j.ijiec.2023.9.010","title":"An operating cost minimization model for buyer-vendor coordination batch system with breakdowns, scrap, overtime, and an external source","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Scrap; Vendor; Overtime; Production (economics); Procurement; Computer science; Supply chain; Quality (philosophy); Batch production; Operations research; Operations management; Engineering; Business; Economics","score_opus":0.03153021401973093,"score_gpt":0.2577516505625711,"score_spread":0.22622143654284016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2243824,0.00001065774,0.77347827,0.00061010453,0.00096776197,0.00034813525,0.000015160265,0.00012896553,0.000058552272],"genre_scores_gemma":[0.9928419,0.0000018571161,0.004262903,0.00012686689,0.002512919,0.000027407339,0.00014156864,0.00003630024,0.00004826383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879783,0.000012927862,0.00045025087,0.00017001657,0.00040791446,0.00016105545],"domain_scores_gemma":[0.99881226,0.00007557587,0.00032669638,0.00007904996,0.00066582044,0.000040622414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044591396,0.00015050362,0.00017088825,0.0006597109,0.00013808538,0.00056890165,0.00026798272,0.00006116217,0.000008016856],"category_scores_gemma":[0.00011672315,0.00014296688,0.000050096438,0.00028831448,0.000016953458,0.0016302548,0.00004744266,0.00013658068,0.0000031178236],"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.00006593825,0.000050912477,0.0008872694,0.000026726842,0.0001060823,0.000008743509,0.00012154633,0.9833937,0.00041063386,0.0061582825,0.0009442125,0.00782592],"study_design_scores_gemma":[0.0020151979,0.00006514488,0.0004795285,0.00025106678,0.000062061845,0.000020682106,0.00045892826,0.9951618,0.000037917962,0.00006522835,0.001235771,0.0001466846],"about_ca_topic_score_codex":0.00005926925,"about_ca_topic_score_gemma":0.000007710492,"teacher_disagreement_score":0.76921535,"about_ca_system_score_codex":0.0001035323,"about_ca_system_score_gemma":0.00004932545,"threshold_uncertainty_score":0.58300203},"labels":[],"label_agreement":null},{"id":"W4390122195","doi":"10.5267/j.ijiec.2023.12.003","title":"BHARAT: A simple and effective multi-criteria decision-making method that does not need fuzzy logic, Part-1: Multi-attribute decision-making applications in the industrial environment","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":14,"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":"Ranking (information retrieval); Normalization (sociology); Fuzzy logic; Group decision-making; Simple (philosophy); Computer science; Selection (genetic algorithm); Data mining; Weighted sum model; Decision maker; Operations research; Mathematics; Artificial intelligence; Optimal decision; Decision tree","score_opus":0.1575127770520264,"score_gpt":0.4300152273096848,"score_spread":0.2725024502576584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17998426,0.000065187676,0.814275,0.0010680396,0.0033112448,0.00095781754,0.00027117878,0.000060242786,0.000006990678],"genre_scores_gemma":[0.90720725,0.000030102876,0.09118375,0.0002044479,0.001196509,0.000102327685,0.00002217324,0.00004269295,0.0000107581645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926519,0.00072267285,0.0024169548,0.00073212275,0.0029643949,0.00051196414],"domain_scores_gemma":[0.9627078,0.034657955,0.0012289493,0.00053081097,0.00068475143,0.00018971592],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0085517205,0.0004655264,0.0007934915,0.0024957722,0.00035179692,0.00134677,0.0021974717,0.00035751399,0.00014947138],"category_scores_gemma":[0.017718824,0.00031169452,0.00036633192,0.0015731981,0.00010724222,0.0008418774,0.0006868197,0.0011905697,0.000054897155],"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.0003194358,0.00027339306,0.007554757,0.0000032079959,0.00021023778,0.00023713263,0.001792117,0.64360815,0.0006098985,0.0005726573,0.0017424471,0.34307653],"study_design_scores_gemma":[0.012133954,0.00026630564,0.06511252,0.0015181676,0.00016785026,0.00051631994,0.006169983,0.8692168,0.0003091833,0.019199822,0.024226721,0.001162401],"about_ca_topic_score_codex":0.000016523978,"about_ca_topic_score_gemma":0.000015442038,"teacher_disagreement_score":0.727223,"about_ca_system_score_codex":0.0003591,"about_ca_system_score_gemma":0.00016160817,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W4393121363","doi":"10.5267/j.ijiec.2024.1.001","title":"Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Flow shop scheduling; Mathematical optimization; Job shop scheduling; Sequence (biology); Scheduling (production processes); Computer science; Flow (mathematics); Mathematics; Biology; Schedule; Genetics","score_opus":0.021283955774783626,"score_gpt":0.23967310276866516,"score_spread":0.21838914699388154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042048942,0.00031666528,0.95547193,0.00033292617,0.0015883824,0.0000894074,0.000024179895,0.0000915114,0.00003603934],"genre_scores_gemma":[0.76130533,0.000040620464,0.2382565,0.000005819214,0.00034560874,0.0000024517774,0.000009008919,0.000026451331,0.000008199644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989915,0.000014882799,0.00043291095,0.000091430935,0.00037203924,0.000097220625],"domain_scores_gemma":[0.99939936,0.000093817755,0.00006702955,0.000060357008,0.000326544,0.00005290049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019809681,0.00012309557,0.0001420085,0.00027427048,0.000041217263,0.00018725624,0.00020099487,0.000055361863,0.0000135835335],"category_scores_gemma":[0.0000758016,0.000094598785,0.000060406757,0.0002262874,0.000025968713,0.00027652213,0.000028072032,0.00034991387,6.2829133e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007912475,0.000008303124,0.000019585295,0.000017035756,0.00020880674,0.000011395771,0.00019350115,0.99614865,0.00009754408,0.0002360302,0.000015122339,0.0030360934],"study_design_scores_gemma":[0.00040282556,0.000025063839,0.0000014375835,0.0006532467,0.00004456219,0.00024018805,0.000058890786,0.9978994,0.00049481017,0.000058429745,0.000023736226,0.00009740807],"about_ca_topic_score_codex":0.0000045858555,"about_ca_topic_score_gemma":4.911535e-7,"teacher_disagreement_score":0.7192564,"about_ca_system_score_codex":0.0000949676,"about_ca_system_score_gemma":0.00014249218,"threshold_uncertainty_score":0.38576263},"labels":[],"label_agreement":null},{"id":"W4393121380","doi":"10.5267/j.ijiec.2024.2.003","title":"Efficient last-mile logistics with service options: A multi-criteria decision-making and optimization methodology","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Last mile (transportation); Mile; Multi-objective optimization; Service (business); Operations research; Computer science; Operations management; Business; Mathematical optimization; Engineering; Mathematics; Marketing; Geography","score_opus":0.054863183522257226,"score_gpt":0.32281813401883785,"score_spread":0.26795495049658064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041438704,0.00041644476,0.9923108,0.0001410878,0.002688826,0.000086945765,0.000028000408,0.00016602612,0.000017974406],"genre_scores_gemma":[0.49470204,0.000050067218,0.5048969,0.000013290667,0.0002979561,0.0000031442332,0.000010861545,0.000024090512,0.00000162831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907666,0.000025853997,0.00041805618,0.00012478759,0.00022670078,0.00012792258],"domain_scores_gemma":[0.998585,0.0008349051,0.000079085636,0.0000636643,0.00037371024,0.00006364106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024089598,0.00015237943,0.0001767201,0.00048019158,0.000041459698,0.00017099747,0.00015534658,0.00009728406,0.000017031005],"category_scores_gemma":[0.0004459056,0.00013971645,0.00003809414,0.00026287694,0.000024856678,0.00013242579,0.00003383651,0.0003255936,0.0000020324799],"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.000025859166,0.000018646942,0.0000046709956,0.000019523355,0.00014580468,0.000049334216,0.00020196186,0.990881,0.000048700622,0.0008618299,0.000053086427,0.007689573],"study_design_scores_gemma":[0.0005217938,0.000044912285,0.000029623783,0.00056142744,0.000050391067,0.00029705817,0.000060816805,0.9977016,0.00004750636,0.0001857327,0.0003612573,0.00013791447],"about_ca_topic_score_codex":0.0000025601373,"about_ca_topic_score_gemma":0.0000024313686,"teacher_disagreement_score":0.49055818,"about_ca_system_score_codex":0.0001377894,"about_ca_system_score_gemma":0.000057056426,"threshold_uncertainty_score":0.5697471},"labels":[],"label_agreement":null},{"id":"W4393121399","doi":"10.5267/j.ijiec.2024.1.003","title":"A GRASP algorithm for the bus crew scheduling problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","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":"GRASP; Crew scheduling; Crew; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Algorithm; Engineering; Mathematics; Embedded system; Aeronautics; Programming language","score_opus":0.03539057958593704,"score_gpt":0.3015435518242727,"score_spread":0.26615297223833567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010431906,0.00090304605,0.9890439,0.0017198842,0.0068327165,0.00017533389,0.000028412,0.00021537059,0.000038135473],"genre_scores_gemma":[0.2157877,0.0000922841,0.77972496,0.000031211017,0.0042052143,0.00002669986,0.000015431384,0.00007939465,0.000037094538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989474,0.000018861447,0.00047429412,0.00009057426,0.00031588683,0.0001529862],"domain_scores_gemma":[0.9983336,0.0010692565,0.00007389113,0.00006699717,0.00039343993,0.000062825144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230777,0.00013404439,0.00014807646,0.0003436969,0.000049669394,0.00029225202,0.00036120418,0.00008779522,0.000012662694],"category_scores_gemma":[0.00028523162,0.00011105654,0.00016316421,0.00032429106,0.000016661863,0.00023750657,0.000024542123,0.00044805033,0.0000040762743],"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.0000028030279,0.000006516749,0.0000041142875,0.000009087829,0.0003428343,0.000009927165,0.0001444406,0.83438146,0.00015081246,0.00084500824,0.00076885615,0.16333416],"study_design_scores_gemma":[0.00045741195,0.000028057377,0.0000146082875,0.0002711724,0.000057888326,0.00014242278,0.000043061562,0.9854287,0.00030007688,0.00024077967,0.012906604,0.00010924493],"about_ca_topic_score_codex":0.0000026066593,"about_ca_topic_score_gemma":2.2679579e-7,"teacher_disagreement_score":0.21474451,"about_ca_system_score_codex":0.00016406045,"about_ca_system_score_gemma":0.000112454654,"threshold_uncertainty_score":0.45287544},"labels":[],"label_agreement":null},{"id":"W4393121416","doi":"10.5267/j.ijiec.2023.12.006","title":"Production control problem for multi-product multi-resource make-to-stock systems","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Stock (firearms); Computer science; Product (mathematics); Production (economics); Manufacturing engineering; Engineering; Business; Mathematics; Economics; Microeconomics; Mechanical engineering","score_opus":0.042823808629635675,"score_gpt":0.28272757652592145,"score_spread":0.23990376789628579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00404938,0.00059425615,0.9803621,0.00082527153,0.013246201,0.00051427487,0.000068408015,0.0003274126,0.0000126748155],"genre_scores_gemma":[0.66336197,0.000013646471,0.3303209,0.000030661326,0.0058198688,0.00008234334,0.000043222353,0.00010206068,0.00022534771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998645,0.000020049267,0.0006453353,0.0001764526,0.00032851505,0.00018464687],"domain_scores_gemma":[0.9989685,0.00015647241,0.000086024505,0.0000870867,0.0005749766,0.00012696571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042046682,0.000180064,0.00022157072,0.0006516369,0.00004432445,0.00027727545,0.00026577225,0.00008968685,0.000004138842],"category_scores_gemma":[0.00044509085,0.00018068023,0.0001325939,0.00032886802,0.0000108529575,0.00018795364,0.0000144408,0.00035821035,0.000010135942],"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.000021026475,0.00003554081,0.000018152297,0.000036046626,0.00036693615,0.000010276235,0.00020954195,0.98604584,0.0006452185,0.00021343115,0.001676466,0.010721516],"study_design_scores_gemma":[0.0012580447,0.000049399117,0.00003152508,0.00045670016,0.000052681065,0.00013852444,0.000049214013,0.9847508,0.00034996323,0.000004669875,0.012682374,0.00017609258],"about_ca_topic_score_codex":0.0000043135587,"about_ca_topic_score_gemma":6.941885e-7,"teacher_disagreement_score":0.6593126,"about_ca_system_score_codex":0.00024164625,"about_ca_system_score_gemma":0.000089892004,"threshold_uncertainty_score":0.7367926},"labels":[],"label_agreement":null},{"id":"W4393121419","doi":"10.5267/j.ijiec.2024.2.001","title":"An extended PSO algorithm for cold-chain vehicle routing problem with independent loading and minimum fuel volume","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Volume (thermodynamics); Mathematical optimization; Particle swarm optimization; Algorithm; Cold chain; Computer science; Routing (electronic design automation); Mathematics; Engineering; Physics; Mechanical engineering","score_opus":0.013829762344021036,"score_gpt":0.24808825498440945,"score_spread":0.23425849264038842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013397574,0.0001820113,0.9846193,0.00011135811,0.0013142187,0.00015348225,0.0000373371,0.00016326214,0.00002145126],"genre_scores_gemma":[0.86105716,0.000019731207,0.13807699,0.0000064529204,0.00075268856,0.000009394128,0.00002013334,0.000038818325,0.000018649469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911296,0.000009863091,0.0003632122,0.0001275006,0.00023471787,0.00015176591],"domain_scores_gemma":[0.99939454,0.0001650474,0.00007626914,0.00005039222,0.00021878903,0.00009498295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021039511,0.00014209494,0.00015149607,0.0003022853,0.000041874173,0.00023614705,0.00014358471,0.0000828377,0.0000036154504],"category_scores_gemma":[0.000047114514,0.00013794981,0.000043900956,0.00011254052,0.000017089464,0.00037347226,0.000015029859,0.00030316738,6.895667e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011579358,0.000018140594,0.000014806518,0.000020076379,0.00016490881,0.00003075157,0.00022387928,0.96915936,0.0006010984,0.0011226351,0.000066584595,0.028566157],"study_design_scores_gemma":[0.0008405247,0.0001559951,0.00005376145,0.00026217874,0.00003570691,0.00010932343,0.00007401883,0.99633664,0.00073695974,0.00038035322,0.000859722,0.00015479252],"about_ca_topic_score_codex":0.0000039986303,"about_ca_topic_score_gemma":0.0000010620522,"teacher_disagreement_score":0.8476596,"about_ca_system_score_codex":0.00015704706,"about_ca_system_score_gemma":0.00005795601,"threshold_uncertainty_score":0.56254303},"labels":[],"label_agreement":null},{"id":"W4393121421","doi":"10.5267/j.ijiec.2023.12.007","title":"An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Liaocheng University; National Natural Science Foundation of China; Natural Science Foundation of Shandong Province; Strong","keywords":"Greedy algorithm; Permutation (music); Iterated function; Job shop scheduling; Mathematical optimization; Algorithm; Mathematics; Computer science; Routing (electronic design automation)","score_opus":0.016826671395315913,"score_gpt":0.252478147932832,"score_spread":0.2356514765375161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020504538,0.0001185883,0.9724118,0.00021105233,0.005801045,0.00025911647,0.00031551518,0.00036787716,0.0000104423],"genre_scores_gemma":[0.68031895,0.00002068381,0.31525987,0.000022433096,0.0029827598,0.000048696154,0.0012002918,0.000117245974,0.0000290467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863756,0.000022616372,0.0006172748,0.00018113694,0.00033954557,0.00020187658],"domain_scores_gemma":[0.9983435,0.00017359511,0.00010313515,0.00009102561,0.0011456168,0.00014311358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026253026,0.00022647831,0.00022456053,0.0005245422,0.000055080272,0.00052062,0.00026357174,0.00014141097,0.000024767216],"category_scores_gemma":[0.000115648596,0.00021124186,0.00011049343,0.0004007528,0.000019088959,0.00063102756,0.000010705218,0.00038159572,0.0000056324366],"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.00003030585,0.00004188681,0.000007689787,0.000023173465,0.00033673018,0.000024112622,0.00022244384,0.9562583,0.0015995797,0.00006213792,0.00024480635,0.04114881],"study_design_scores_gemma":[0.0014221374,0.00029131878,0.000045719284,0.0003961669,0.00006746091,0.00016936418,0.000064395186,0.99499804,0.0005914634,0.000031032054,0.0016854118,0.00023751693],"about_ca_topic_score_codex":0.0000057998686,"about_ca_topic_score_gemma":0.000001780141,"teacher_disagreement_score":0.6598144,"about_ca_system_score_codex":0.00022638982,"about_ca_system_score_gemma":0.00013059827,"threshold_uncertainty_score":0.8614193},"labels":[],"label_agreement":null},{"id":"W4393121429","doi":"10.5267/j.ijiec.2023.12.009","title":"Strategic analysis of manufacturer encroachment in dual-channel supply chains with platform service","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Dual (grammatical number); Supply chain; Business; Service (business); Channel (broadcasting); Industrial organization; Supply chain management; Operations management; Process management; Computer science; Marketing; Telecommunications; Engineering","score_opus":0.042175160869689636,"score_gpt":0.24869832571228165,"score_spread":0.206523164842592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738818,0.00010543539,0.018646337,0.0031109087,0.0026922582,0.00020947361,0.000025300016,0.00005481658,0.001273676],"genre_scores_gemma":[0.9986318,0.0000064792416,0.00017460281,0.00017411158,0.0008997138,0.0000046606256,0.000066069355,0.000014797235,0.000027770211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987033,0.0000049185696,0.0005374763,0.00012657451,0.0004939395,0.00013378159],"domain_scores_gemma":[0.99933493,0.00007656276,0.00021712089,0.00006964569,0.0002838264,0.00001794171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003139885,0.00014018037,0.00023997812,0.0023378266,0.00001876836,0.00022491608,0.00020265464,0.000055451415,0.00012663529],"category_scores_gemma":[0.000022153316,0.000118562326,0.00013013616,0.0012326059,0.000013213007,0.00060582306,0.000057124853,0.00025140407,0.000005870056],"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.00004668267,0.00007788922,0.0007449295,0.000034304732,0.0014703054,0.00014979551,0.00018876701,0.9772883,0.0000433595,0.019069461,0.00029667295,0.00058955187],"study_design_scores_gemma":[0.0011615126,0.000040558145,0.003878236,0.00047536194,0.0005070749,0.000019799314,0.0006577667,0.9887756,0.000068524154,0.00062751543,0.0035966486,0.00019141307],"about_ca_topic_score_codex":0.00024203061,"about_ca_topic_score_gemma":0.00008417923,"teacher_disagreement_score":0.024750002,"about_ca_system_score_codex":0.00013408969,"about_ca_system_score_gemma":0.000060615715,"threshold_uncertainty_score":0.48348314},"labels":[],"label_agreement":null},{"id":"W4393121437","doi":"10.5267/j.ijiec.2024.2.004","title":"A study on the nonlinear relationship between market, subsidy, and income of photovoltaic enterprises based on chaos theory","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Grey System Theory Applications","field":"Decision Sciences","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":"Huaiyin Normal University; Government of Jiangsu Province","keywords":"Subsidy; Nonlinear system; Photovoltaic system; CHAOS (operating system); Chaos theory; Economics; Control theory (sociology); Econometrics; Business; Industrial organization; Computer science; Physics; Market economy; Engineering; Chaotic; Electrical engineering; Management","score_opus":0.12199054192735206,"score_gpt":0.3699762213888851,"score_spread":0.24798567946153302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92857534,0.000035985347,0.06749883,0.0016460756,0.0012888771,0.00043034452,0.00011455342,0.00003272497,0.0003772755],"genre_scores_gemma":[0.99894714,5.2517316e-7,0.0003839069,0.000031907108,0.00053711806,0.000015543026,0.0000032121452,0.000017231467,0.0000634135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9968688,0.00043062904,0.001075489,0.00020453932,0.0013178822,0.000102653335],"domain_scores_gemma":[0.9739237,0.02482468,0.0004041561,0.00025380868,0.0005144288,0.00007923861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004825235,0.0001486014,0.00025980407,0.001145559,0.000084752464,0.0002699936,0.0007836787,0.00007294782,0.000066308676],"category_scores_gemma":[0.0072303773,0.000098811935,0.0001510716,0.0007182821,0.00006553764,0.00017453253,0.00006702367,0.0005142499,0.00002089461],"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.00063761504,0.00081756106,0.40808955,0.00002100882,0.0011572392,0.0001327962,0.00414599,0.492864,0.00039898077,0.079055,0.002759812,0.009920438],"study_design_scores_gemma":[0.0036424696,0.0016014935,0.5968105,0.002256113,0.0002853881,0.00014686928,0.0034754977,0.3451421,0.0007994671,0.04199329,0.0033117943,0.0005350212],"about_ca_topic_score_codex":0.00000477212,"about_ca_topic_score_gemma":9.686194e-7,"teacher_disagreement_score":0.18872094,"about_ca_system_score_codex":0.00009612861,"about_ca_system_score_gemma":0.0001710884,"threshold_uncertainty_score":0.86559594},"labels":[],"label_agreement":null},{"id":"W4393121446","doi":"10.5267/j.ijiec.2024.2.002","title":"A case study of whale optimization algorithm for scheduling in C2M model","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Whale; Scheduling (production processes); Optimization algorithm; Computer science; Mathematical optimization; Job shop scheduling; Algorithm; Business; Mathematics; Fishery; Computer network; Biology","score_opus":0.040808429035197935,"score_gpt":0.29046878346220917,"score_spread":0.24966035442701123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15776183,0.00013714454,0.8395993,0.000037570037,0.002190401,0.00017180639,0.000022902494,0.00007059471,0.000008435289],"genre_scores_gemma":[0.64248407,0.000011165171,0.35709536,0.0000025126278,0.00035845282,0.000009913324,0.000008651662,0.000026450673,0.0000034069046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.000013240385,0.00070081506,0.00009986232,0.00025822897,0.000110783316],"domain_scores_gemma":[0.99918187,0.00023753221,0.0000852771,0.00005622628,0.00038518,0.000053926095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994135,0.0001231486,0.00019994822,0.0008430099,0.000019843903,0.0000964913,0.00016536331,0.00008687949,0.000005634848],"category_scores_gemma":[0.00013273594,0.0001329896,0.00008644156,0.0003758938,0.000008273279,0.0002925083,0.000016178996,0.00028753091,3.9652716e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063220277,0.00008950335,0.000011313676,0.000011771062,0.00018334007,0.000263774,0.0009848312,0.97991234,0.000024190505,0.00006300006,0.000020210218,0.018429419],"study_design_scores_gemma":[0.001423812,0.000085834145,0.0000010418227,0.00021564351,0.00003752567,0.00064103276,0.00077907747,0.9965733,0.00010152062,0.000021887166,0.000010313387,0.00010897179],"about_ca_topic_score_codex":0.000012534971,"about_ca_topic_score_gemma":0.0000022459374,"teacher_disagreement_score":0.48472226,"about_ca_system_score_codex":0.00014046572,"about_ca_system_score_gemma":0.0001008423,"threshold_uncertainty_score":0.5423159},"labels":[],"label_agreement":null},{"id":"W4393121469","doi":"10.5267/j.ijiec.2023.12.011","title":"A multi-objective fuzzy flexible job shop scheduling problem considering the maximization of processing quality","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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; Job shop scheduling; Flow shop scheduling; Computer science; Mathematical optimization; Fuzzy logic; Scheduling (production processes); Job shop; Quality (philosophy); Operations research; Engineering; Mathematics; Artificial intelligence; Embedded system","score_opus":0.04966639635301317,"score_gpt":0.30729064664747735,"score_spread":0.2576242502944642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033767164,0.001002018,0.9616064,0.00040587678,0.0026395558,0.00014613218,0.000017664594,0.00023711218,0.00017810502],"genre_scores_gemma":[0.7938946,0.000038066974,0.20530431,0.000011463903,0.0006770092,0.000006577832,0.000009375149,0.00003797322,0.000020632398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984171,0.00003754394,0.00084335293,0.00011926786,0.00043536164,0.00014739993],"domain_scores_gemma":[0.9986509,0.00035016355,0.00018089297,0.00007730714,0.0006771785,0.000063549975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058276,0.00016182127,0.00022320868,0.0004705275,0.000058748727,0.00023398061,0.00028607153,0.00010683198,0.000012367165],"category_scores_gemma":[0.00039419148,0.00013899636,0.00013350666,0.00052761403,0.000038650393,0.00039517303,0.000034035318,0.0005341616,0.000002835081],"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.000010972071,0.00002009651,0.00013053027,0.000043661104,0.00025848168,0.000009198919,0.0009062938,0.9859204,0.0010227953,0.0008204202,0.000039834602,0.010817283],"study_design_scores_gemma":[0.0006051649,0.00002137889,0.00015269805,0.00071103865,0.000042259504,0.00009113959,0.00033429512,0.9959666,0.0016183698,0.00017512766,0.00014293849,0.00013897552],"about_ca_topic_score_codex":0.000009975339,"about_ca_topic_score_gemma":0.0000013841787,"teacher_disagreement_score":0.7601274,"about_ca_system_score_codex":0.00017332828,"about_ca_system_score_gemma":0.00021582047,"threshold_uncertainty_score":0.5668107},"labels":[],"label_agreement":null},{"id":"W4393121490","doi":"10.5267/j.ijiec.2023.12.008","title":"Enhancing efficiency and adaptability in mixed model line balancing through the fusion of learning effects and worker prerequisites","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"King Fahd University of Petroleum and Minerals","keywords":"Adaptability; Line (geometry); Fusion; Computer science; Mathematics; Biology; Ecology","score_opus":0.012312939797526744,"score_gpt":0.24714352234068357,"score_spread":0.23483058254315683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47858822,0.0007774643,0.5198224,0.00008266248,0.000609162,0.00006824858,0.0000016795167,0.00003469006,0.000015420159],"genre_scores_gemma":[0.99050707,0.000091603295,0.00913408,0.0000026892553,0.00023522504,0.0000026384237,0.00000457771,0.000019153242,0.0000029631706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990284,0.000032297656,0.00049827655,0.00009861648,0.00023419075,0.00010824518],"domain_scores_gemma":[0.998899,0.00080577296,0.00008379342,0.00004691385,0.00013307296,0.000031456722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042106787,0.00011633026,0.00018504726,0.0002342339,0.000028608023,0.00007104457,0.000113088034,0.000076512624,0.0000016570517],"category_scores_gemma":[0.0005707555,0.00009722355,0.000041840973,0.00025349372,0.000021932143,0.00027450128,0.000047335347,0.00045911528,2.607396e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091394,0.000011049056,0.000703339,0.000044476994,0.000050384504,0.00000639146,0.0009799149,0.9871483,0.007064493,0.000270675,0.0000055798037,0.0037062622],"study_design_scores_gemma":[0.00039418455,0.00003835006,0.0015289504,0.00091821223,0.00002211218,0.000034122753,0.00009435891,0.99497586,0.0017208825,0.00016618984,0.000028429416,0.000078366495],"about_ca_topic_score_codex":0.000008608805,"about_ca_topic_score_gemma":0.0000041885796,"teacher_disagreement_score":0.51191884,"about_ca_system_score_codex":0.00009375233,"about_ca_system_score_gemma":0.000055117274,"threshold_uncertainty_score":0.39646614},"labels":[],"label_agreement":null},{"id":"W4393121492","doi":"10.5267/j.ijiec.2024.1.002","title":"Truck-drone joint path planning for post-disaster emergency material deployment considering fairness","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Robotic Path Planning Algorithms","field":"Computer Science","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":"Software deployment; Truck; Drone; Joint (building); Motion planning; Path (computing); Computer science; Aeronautics; Transport engineering; Engineering; Automotive engineering; Computer network; Robot; Structural engineering; Artificial intelligence","score_opus":0.05161699659116461,"score_gpt":0.29362337203353917,"score_spread":0.24200637544237455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04810183,0.00015168391,0.9277882,0.0014857755,0.022073636,0.00016617385,0.00005083015,0.00016268271,0.000019191957],"genre_scores_gemma":[0.7986374,0.000005910857,0.19826709,0.000044415036,0.0029272584,0.000018511477,0.000027664668,0.000039422142,0.000032328535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980701,0.000032853222,0.0008747736,0.00023601395,0.0005352288,0.0002510176],"domain_scores_gemma":[0.99873835,0.00026096214,0.00023919462,0.00012743475,0.00050581986,0.00012823273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004643675,0.00019962828,0.00025926594,0.00056678086,0.00006467591,0.00043672786,0.0006535026,0.00009691587,0.000019268093],"category_scores_gemma":[0.00031996815,0.00019337547,0.00018733778,0.00021730883,0.000014703587,0.0006811095,0.00013324138,0.00032362342,0.000006850564],"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.000030522213,0.000048452293,0.00008638552,0.00002644154,0.00041324287,0.00034983747,0.0014680017,0.9751635,0.0032845153,0.004819655,0.0024664274,0.0118430015],"study_design_scores_gemma":[0.0011250451,0.00023865236,0.00037030815,0.00090713025,0.000044333265,0.0008987164,0.00011196398,0.9907709,0.001514207,0.0009567195,0.0027548065,0.00030725953],"about_ca_topic_score_codex":0.000007660968,"about_ca_topic_score_gemma":1.06024736e-7,"teacher_disagreement_score":0.75053555,"about_ca_system_score_codex":0.00020141578,"about_ca_system_score_gemma":0.00025120168,"threshold_uncertainty_score":0.7885623},"labels":[],"label_agreement":null},{"id":"W4393121494","doi":"10.5267/j.ijiec.2023.12.005","title":"Competitive inland port location and pricing problem: A perspective from the entering seaport","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Port (circuit theory); Perspective (graphical); Operations research; Business; Computer science; Operations management; Industrial organization; Transport engineering; Marine engineering; Engineering; Electrical engineering","score_opus":0.01879347536165676,"score_gpt":0.2474066729244677,"score_spread":0.22861319756281093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068941705,0.0023621276,0.9151973,0.0025879678,0.0069977255,0.00029856068,0.000115404204,0.00025640114,0.0032427849],"genre_scores_gemma":[0.9959642,0.00008059428,0.002541078,0.000019891313,0.0013397555,0.0000031859422,0.000018335717,0.000019468896,0.000013470569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921924,0.000011260938,0.00035004548,0.00008849148,0.0002391302,0.000091806],"domain_scores_gemma":[0.9992217,0.0003100807,0.000059167087,0.000045132303,0.00031310107,0.000050818515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019113353,0.00010899904,0.00012376999,0.00015665812,0.0000326919,0.0002105781,0.0001443684,0.000052258547,0.00001949063],"category_scores_gemma":[0.00012513588,0.0000881894,0.00004642749,0.0001453097,0.000025598092,0.00018386162,0.00003281783,0.00038096932,0.000002069351],"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.000012350606,0.000018720424,0.0010482328,0.000018152134,0.00067062606,0.00015407831,0.0018384599,0.95518833,0.0002291807,0.02946779,0.0017310473,0.009623047],"study_design_scores_gemma":[0.0010573795,0.000099691555,0.009163972,0.0020176175,0.00018932341,0.0007302275,0.001377546,0.94047415,0.0002818793,0.0023577341,0.041863903,0.00038658243],"about_ca_topic_score_codex":0.0000947391,"about_ca_topic_score_gemma":0.00000472267,"teacher_disagreement_score":0.9270225,"about_ca_system_score_codex":0.0001700468,"about_ca_system_score_gemma":0.00008225841,"threshold_uncertainty_score":0.35962597},"labels":[],"label_agreement":null},{"id":"W4393121498","doi":"10.5267/j.ijiec.2023.12.010","title":"The consumer web-rooming on different sales models and retailing channel expansion","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Business; Channel (broadcasting); Marketing; Advertising; Computer science; Telecommunications","score_opus":0.058536912298230215,"score_gpt":0.27167032127858554,"score_spread":0.21313340898035532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791098,0.0016459164,0.008832389,0.0040123817,0.0060621565,0.00013227624,0.0000066346806,0.00008764626,0.00011080018],"genre_scores_gemma":[0.99874216,0.00012110814,0.00006552117,0.000028173095,0.000988572,0.000005124817,0.000006147992,0.000020153651,0.00002303414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989777,0.000008255633,0.00039056037,0.00011793271,0.00037916127,0.00012634482],"domain_scores_gemma":[0.99908584,0.00042992775,0.00014008478,0.00005799622,0.0002697758,0.000016384398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694889,0.00013978413,0.00014842527,0.00040765837,0.00014204172,0.0006274183,0.00020475824,0.000047785812,0.0000040411683],"category_scores_gemma":[0.00021972865,0.000100021185,0.000092510985,0.00014261185,0.000036020592,0.00047398865,0.000106639556,0.00035441312,0.000010756303],"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.00031371447,0.00021698774,0.010463713,0.000109887515,0.0021588814,0.00041258297,0.000710177,0.46079773,0.0029131882,0.08993278,0.0038837,0.42808667],"study_design_scores_gemma":[0.00082600623,0.000023838144,0.0014544373,0.0009803026,0.00014693472,0.000047474157,0.00021389885,0.9831895,0.00003295513,0.00093427044,0.0119496565,0.00020071933],"about_ca_topic_score_codex":0.000012902859,"about_ca_topic_score_gemma":0.000010502475,"teacher_disagreement_score":0.5223918,"about_ca_system_score_codex":0.000068894085,"about_ca_system_score_gemma":0.000037038873,"threshold_uncertainty_score":0.6050209},"labels":[],"label_agreement":null},{"id":"W4399680520","doi":"10.5267/j.ijiec.2024.3.003","title":"A multi objective optimization framework for robust and resilient supply chain network design using NSGAII and MOPSO algorithms","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","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":"National Key Research and Development Program of China","keywords":"Mathematical optimization; Supply chain; Computer science; Optimization algorithm; Supply chain network; Genetic algorithm; Algorithm; Multi-objective optimization; Chain (unit); Supply chain management; Mathematics; Business","score_opus":0.04420860427573051,"score_gpt":0.27862061092187895,"score_spread":0.23441200664614845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069354856,0.00048047875,0.98866355,0.00086396834,0.0026739175,0.00032623735,0.000006466009,0.00004373532,0.0000061841183],"genre_scores_gemma":[0.28436145,0.00009276486,0.7096772,0.00014699403,0.005635171,0.000015973657,0.000016761402,0.000038097663,0.000015586997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990178,0.000011975459,0.00037483659,0.00017463748,0.0002574926,0.00016325444],"domain_scores_gemma":[0.9990406,0.00040313316,0.00017404136,0.00004560833,0.00031167772,0.000024939734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935735,0.00014241441,0.00016230108,0.00051410886,0.00010864313,0.0005721128,0.00015188339,0.000088137815,0.000010521196],"category_scores_gemma":[0.00036085505,0.00013202122,0.000064424385,0.00031969434,0.000029471597,0.0006272107,0.00008082875,0.00022638329,7.621344e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043256245,0.000025579744,0.00022715074,0.000021535247,0.00016637356,0.000022938277,0.0001092413,0.98675275,0.000016179656,0.0043794457,0.0004842836,0.0077512693],"study_design_scores_gemma":[0.000645048,0.00003213165,0.00021164483,0.0005727281,0.00008401419,0.00002846403,0.00020291521,0.9959355,0.0000070123842,0.0013281421,0.00081859896,0.00013381829],"about_ca_topic_score_codex":0.000040152012,"about_ca_topic_score_gemma":0.0000012444408,"teacher_disagreement_score":0.27898633,"about_ca_system_score_codex":0.0000892068,"about_ca_system_score_gemma":0.0000542291,"threshold_uncertainty_score":0.5516897},"labels":[],"label_agreement":null},{"id":"W4399680523","doi":"10.5267/j.ijiec.2024.4.002","title":"The impacts of blockchain adoption in fourth party logistics service quality management","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"National Natural Science Foundation of China","keywords":"Blockchain; Business; Quality (philosophy); Process management; Quality of service; Service (business); Service quality; Operations management; Computer security; Industrial organization; Environmental economics; Computer science; Marketing; Economics; Telecommunications","score_opus":0.03423536447018753,"score_gpt":0.2823104056702841,"score_spread":0.24807504120009655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5880183,0.00079038064,0.35863134,0.030658588,0.017984433,0.0011147943,0.000028498087,0.0002185732,0.002555101],"genre_scores_gemma":[0.9975307,0.000025545109,0.0008031347,0.00012975899,0.001444616,0.000006152475,0.00001088406,0.000016582157,0.000032611635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837506,0.000020429485,0.00076356874,0.00010862817,0.0005584761,0.00017386854],"domain_scores_gemma":[0.99863696,0.00035821958,0.00032188458,0.0000995975,0.0005679457,0.000015392348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001321728,0.00012347526,0.00015645185,0.0007639424,0.000043742744,0.00032907573,0.00044437847,0.000051453768,0.000015108749],"category_scores_gemma":[0.00043725368,0.000101470076,0.000094131996,0.00075734407,0.000021695714,0.00030882325,0.00014884253,0.00028678981,0.000007933324],"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.00005048618,0.000050698105,0.0008867737,0.00012526271,0.00023315032,0.000095079144,0.00007183038,0.891262,0.000021056641,0.09547163,0.0009798774,0.010752155],"study_design_scores_gemma":[0.0018623522,0.000028705826,0.008738982,0.0011106094,0.00012357516,0.000018035922,0.0018589759,0.9268013,0.00002536509,0.0076411306,0.05152693,0.0002640247],"about_ca_topic_score_codex":0.00021959704,"about_ca_topic_score_gemma":0.00004216426,"teacher_disagreement_score":0.4095124,"about_ca_system_score_codex":0.00023223471,"about_ca_system_score_gemma":0.00006172648,"threshold_uncertainty_score":0.41378295},"labels":[],"label_agreement":null},{"id":"W4399680526","doi":"10.5267/j.ijiec.2024.4.001","title":"Change point analysis of events in social networks: An online convex optimization approach","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Mathematical optimization; Point (geometry); Regular polygon; Convex optimization; Computer science; Mathematics","score_opus":0.05895128934521809,"score_gpt":0.31425913128745614,"score_spread":0.25530784194223805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08641258,0.000050089962,0.9127387,0.00016328519,0.00043819167,0.000086074746,0.000048605656,0.000024868332,0.000037602065],"genre_scores_gemma":[0.9860054,0.0000046724485,0.011475171,0.0000083672085,0.0020828608,0.0000058459304,0.0004008778,0.000013664877,0.0000031152765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988064,0.000049679846,0.00064104295,0.000115690775,0.0002849448,0.00010222402],"domain_scores_gemma":[0.99927235,0.0001041732,0.00024030454,0.000057643978,0.0002824202,0.000043103722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029748576,0.000109101034,0.00031154582,0.0013003199,0.000019819701,0.000043164935,0.00025753674,0.000054256885,0.00006776456],"category_scores_gemma":[0.000014467411,0.000111905625,0.00025281348,0.0012019266,0.00001305487,0.00031397567,0.000038148395,0.00029873938,1.333574e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124330545,0.0001822837,0.0044687386,0.0000018169491,0.0014897927,0.000002673751,0.00026267,0.98291504,0.000009392491,0.0033097442,0.000049688322,0.007295706],"study_design_scores_gemma":[0.0003075791,0.000028198428,0.0032524986,0.00007850951,0.00031500476,0.0000018838217,0.0000837241,0.9956243,0.0000068003465,0.00016940743,0.000047042166,0.00008504783],"about_ca_topic_score_codex":0.00009187144,"about_ca_topic_score_gemma":0.0000035289934,"teacher_disagreement_score":0.90126354,"about_ca_system_score_codex":0.00009513354,"about_ca_system_score_gemma":0.000055755234,"threshold_uncertainty_score":0.45633787},"labels":[],"label_agreement":null},{"id":"W4399680550","doi":"10.5267/j.ijiec.2024.4.003","title":"A study on the competition and cooperation relationship of China's photovoltaic supply chain under the policy guidance","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Power Systems and Renewable Energy","field":"Energy","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":"Competition (biology); Photovoltaic system; China; Supply chain; Industrial organization; Business; Environmental economics; Economics; Engineering; Political science; Marketing; Electrical engineering; Ecology; Biology","score_opus":0.02933829871172546,"score_gpt":0.27450443368474176,"score_spread":0.2451661349730163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94462997,0.00034133255,0.04223874,0.008465296,0.0034657374,0.00024546144,0.00002324652,0.000039647228,0.00055054255],"genre_scores_gemma":[0.9986589,0.000010775169,0.00008265374,0.000047176603,0.0010623471,0.000009774905,0.0000069422113,0.000014768228,0.000106690255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988639,0.00011872942,0.00048559712,0.000090425136,0.0003585794,0.00008278449],"domain_scores_gemma":[0.99878365,0.0007218809,0.00016205588,0.00009122753,0.00020706464,0.000034143166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005580004,0.00010479539,0.00013048251,0.00033196784,0.00008908047,0.00014500933,0.00022245626,0.000055945136,0.000013783994],"category_scores_gemma":[0.00033529743,0.000063028856,0.00007000302,0.0003519808,0.000035730234,0.00012820994,0.000029846535,0.00030304372,0.0000021289527],"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.000014799114,0.000044287743,0.00021214894,0.0000023859557,0.00017185189,0.000008375957,0.00062157935,0.727355,0.0007011861,0.27013212,0.00026590526,0.00047034657],"study_design_scores_gemma":[0.005587392,0.0015952442,0.11545604,0.0036725423,0.00027313427,0.0010366096,0.005304785,0.8217162,0.0034273525,0.011044572,0.030150931,0.00073518633],"about_ca_topic_score_codex":0.00068942324,"about_ca_topic_score_gemma":0.000058262918,"teacher_disagreement_score":0.25908756,"about_ca_system_score_codex":0.000115534356,"about_ca_system_score_gemma":0.00016526233,"threshold_uncertainty_score":0.2570242},"labels":[],"label_agreement":null},{"id":"W4399680900","doi":"10.5267/j.ijiec.2024.5.005","title":"Collaborative truck-robot routing problem with meal delivery for the elderly on the personalized needs","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Truck; Robot; Routing (electronic design automation); Meal; Computer science; Engineering; Simulation; Manufacturing engineering; Automotive engineering; Embedded system; Artificial intelligence; Food science; Chemistry","score_opus":0.022376935045579822,"score_gpt":0.24994957566824824,"score_spread":0.2275726406226684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063453405,0.00024432893,0.9890008,0.0019925502,0.0018856273,0.00025719372,0.00003920395,0.00010720995,0.00012774572],"genre_scores_gemma":[0.98508817,0.00004229292,0.013696919,0.000028615728,0.0010297104,0.000026312508,0.000011646455,0.00003380997,0.000042501255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.000015687008,0.00029957906,0.00007190122,0.0002896629,0.00012467391],"domain_scores_gemma":[0.99801177,0.0014556092,0.00008034969,0.00005756768,0.00035914753,0.000035552755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023386742,0.0001367406,0.00012040036,0.00020860713,0.00009750892,0.0002320334,0.0002441132,0.00005426204,0.000008632998],"category_scores_gemma":[0.00016207444,0.00008135705,0.000077373996,0.00027059455,0.00003359734,0.00015143865,0.000011521282,0.0003970419,0.0000014890243],"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.00005459821,0.000007904947,0.0000020828961,0.000006079459,0.0004182187,0.0000075013304,0.0005640988,0.9712929,0.000052318428,0.017815499,0.0007919884,0.008986822],"study_design_scores_gemma":[0.00076554966,0.00021613916,0.000014519767,0.0003444888,0.00008030964,0.000055671266,0.0004869974,0.9882941,0.0005139842,0.00042339854,0.008672275,0.00013253397],"about_ca_topic_score_codex":0.0000029193359,"about_ca_topic_score_gemma":0.0000011722844,"teacher_disagreement_score":0.97874284,"about_ca_system_score_codex":0.00015585542,"about_ca_system_score_gemma":0.00010323179,"threshold_uncertainty_score":0.33176443},"labels":[],"label_agreement":null},{"id":"W4399680902","doi":"10.5267/j.ijiec.2024.5.004","title":"Effects of crossover operator combined with mutation operator in genetic algorithms for the generalized travelling salesman problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Al-Imam Muhammad Ibn Saud Islamic University","keywords":"Crossover; Travelling salesman problem; Operator (biology); Genetic algorithm; Mutation; Mathematical optimization; Algorithm; Mathematics; Computer science; Artificial intelligence; Biology; Genetics; Gene","score_opus":0.025199216016296072,"score_gpt":0.29227710258205736,"score_spread":0.26707788656576126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019760199,0.00032251835,0.97670496,0.0010322633,0.0015872711,0.00054678525,0.000011702657,0.000028763097,0.000005533134],"genre_scores_gemma":[0.6594172,0.00003657522,0.33994108,0.000028290058,0.00046390644,0.00005285922,0.000007392301,0.000025617246,0.00002704875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982903,0.00006615851,0.00067859853,0.0001784853,0.0006214174,0.0001650517],"domain_scores_gemma":[0.9974746,0.0013358385,0.00016589527,0.000104039136,0.0008477954,0.000071809074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052669895,0.00013973533,0.00022385157,0.0005412459,0.000047099915,0.00043307483,0.00075143477,0.000066712455,0.000005683135],"category_scores_gemma":[0.000337858,0.0001010374,0.00009092546,0.00063402276,0.00003620659,0.00037054118,0.000045448644,0.00030882886,0.000001288745],"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.000059608617,0.000060703696,0.000016958336,0.00003285482,0.00023776422,0.00008819897,0.00061799213,0.98043627,0.00048445028,0.00564362,0.00007715426,0.0122444555],"study_design_scores_gemma":[0.0028636581,0.00025539417,0.00023497728,0.00032178336,0.000029013248,0.000094497744,0.000018040262,0.99251074,0.003044893,0.00025779172,0.00026288707,0.000106343265],"about_ca_topic_score_codex":0.000015888163,"about_ca_topic_score_gemma":0.0000016324611,"teacher_disagreement_score":0.639657,"about_ca_system_score_codex":0.00013094337,"about_ca_system_score_gemma":0.0004774011,"threshold_uncertainty_score":0.41761506},"labels":[],"label_agreement":null},{"id":"W4399680970","doi":"10.5267/j.ijiec.2024.5.003","title":"Selection of livestreaming mode: Impacts of blockchain technology","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Technology Adoption and User Behaviour","field":"Decision Sciences","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":"Blockchain; Selection (genetic algorithm); Mode (computer interface); Computer science; Biochemical engineering; Process engineering; Environmental science; Engineering; Artificial intelligence; Computer security","score_opus":0.06286194603578611,"score_gpt":0.3699218380499057,"score_spread":0.3070598920141196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9090009,0.000115312534,0.087564,0.001316515,0.0018547646,0.000048461392,0.00002308231,0.000052805364,0.000024162538],"genre_scores_gemma":[0.9942897,0.000007688992,0.005457186,0.0000047227545,0.00020427266,9.803769e-7,0.0000013962567,0.000008828348,0.000025225865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998087,0.000028234106,0.0009802084,0.00011665225,0.00069376157,0.00009412835],"domain_scores_gemma":[0.9978427,0.0005134258,0.00043740508,0.00008853099,0.0010720573,0.000045862307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006361946,0.000090236215,0.00023263329,0.0026055435,0.000019083798,0.000052353967,0.00054111815,0.0001799497,0.00004785722],"category_scores_gemma":[0.0019804777,0.00007774465,0.0001414166,0.0011913744,0.000057685247,0.00015919821,0.00005884089,0.00042608022,0.000004316133],"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.00006470451,0.00019931578,0.029215807,0.000009094335,0.00046079612,0.000070444985,0.0005030114,0.80872524,0.040779654,0.03166062,0.0012944924,0.0870168],"study_design_scores_gemma":[0.0024821863,0.0008785686,0.015333533,0.0016201127,0.00016864175,0.0016249917,0.0010515974,0.87676764,0.07649304,0.01964203,0.0035391874,0.00039847838],"about_ca_topic_score_codex":0.000011297587,"about_ca_topic_score_gemma":0.000001934832,"teacher_disagreement_score":0.08661832,"about_ca_system_score_codex":0.00007872549,"about_ca_system_score_gemma":0.00022802527,"threshold_uncertainty_score":0.31703347},"labels":[],"label_agreement":null},{"id":"W4399681177","doi":"10.5267/j.ijiec.2024.5.001","title":"A two-stage stochastic model for picker allocation problem in warehouses considering the rest allowance and picker’s weight","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Allowance (engineering); Rest (music); Computer science; Operations management; Stage (stratigraphy); Mathematical optimization; Mathematics; Operations research; Engineering; Medicine; Biology","score_opus":0.036270187572803175,"score_gpt":0.2758138138767915,"score_spread":0.23954362630398832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014295264,0.0003608202,0.9832654,0.0005377064,0.0012135977,0.00018855662,0.000023913144,0.00009498157,0.000019773674],"genre_scores_gemma":[0.95436853,0.000050520972,0.045075383,0.000016441309,0.0003969054,0.000022204627,0.0000117695945,0.00003132516,0.000026942653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.0000072843777,0.00040679882,0.000102579645,0.00017294633,0.00012629108],"domain_scores_gemma":[0.99927366,0.0004265669,0.00006361455,0.00005455565,0.00014032813,0.000041276006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019907672,0.0001240465,0.00012945986,0.00027637798,0.00003558669,0.000119817625,0.00014388609,0.00005500993,0.0000018197304],"category_scores_gemma":[0.00020558892,0.00010797116,0.00004462452,0.00010761697,0.000025346555,0.00023692765,0.000021679189,0.00031402634,5.5923584e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013720756,0.000008587733,0.000008532677,0.000022024467,0.00007656576,0.000008186811,0.000431781,0.9900141,0.00014221833,0.0070849485,0.00010276435,0.0020865742],"study_design_scores_gemma":[0.000632726,0.000018459026,0.000023264358,0.00030421556,0.000020172032,0.000037184134,0.000037481437,0.9964966,0.00011240086,0.001679508,0.000531666,0.00010628466],"about_ca_topic_score_codex":0.0000072338416,"about_ca_topic_score_gemma":0.000012921081,"teacher_disagreement_score":0.94007325,"about_ca_system_score_codex":0.00015879485,"about_ca_system_score_gemma":0.000083016486,"threshold_uncertainty_score":0.44029358},"labels":[],"label_agreement":null},{"id":"W4399681193","doi":"10.5267/j.ijiec.2024.5.002","title":"Ant colony algorithms for minimizing costs in multi-mode resource constrained project scheduling problems with spatial constraints","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","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; Ant colony optimization algorithms; Scheduling (production processes); Computer science; Mode (computer interface); Resource constraints; Algorithm; Distributed computing; Mathematics","score_opus":0.13549378162218442,"score_gpt":0.3924922204413859,"score_spread":0.2569984388192015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111545935,0.00013390194,0.8835423,0.0013707755,0.0021683336,0.00084066374,0.00017847995,0.000080781625,0.00013882242],"genre_scores_gemma":[0.83305794,0.000004273302,0.16587104,0.000038088452,0.000902506,0.00003381636,0.000025836005,0.000041388037,0.000025104575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956579,0.00014473821,0.001824936,0.00046836754,0.0015039219,0.00040012915],"domain_scores_gemma":[0.9934314,0.004477438,0.00059164054,0.00015942579,0.0011810947,0.00015903659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030531914,0.0003066742,0.00053533306,0.0022226397,0.00009004778,0.0009280261,0.00090318685,0.0002088219,0.000024372212],"category_scores_gemma":[0.005747854,0.00025033866,0.00024285086,0.0010590324,0.0002062066,0.0005202884,0.00008352749,0.00090312003,0.0000048828165],"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.00021587245,0.00010716866,0.0006785769,0.000014523094,0.00031265442,0.00028327067,0.0016524087,0.90765077,0.0011556662,0.0008428585,0.00015161672,0.0869346],"study_design_scores_gemma":[0.004423234,0.00030696663,0.00012997261,0.00168988,0.000044135668,0.0009344957,0.0015241912,0.98639756,0.000413169,0.00015204726,0.0036738275,0.00031049908],"about_ca_topic_score_codex":0.00009338938,"about_ca_topic_score_gemma":0.000042546064,"teacher_disagreement_score":0.721512,"about_ca_system_score_codex":0.00047538005,"about_ca_system_score_gemma":0.001486821,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W4399681197","doi":"10.5267/j.ijiec.2024.4.004","title":"An improved black widow optimization (IBWO) algorithm for solving global optimization problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"Mathematical optimization; Optimization algorithm; Algorithm; Global optimization; Computer science; Optimization problem; Mathematics","score_opus":0.03040651770898991,"score_gpt":0.3082248744484339,"score_spread":0.277818356739444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000494548,0.00011855045,0.99264413,0.0015252087,0.0049454733,0.0004057282,0.000067943154,0.00021164985,0.00003185614],"genre_scores_gemma":[0.015229242,0.000043609154,0.98283756,0.000054513992,0.0016517484,0.000021986933,0.000096152646,0.00003451659,0.000030666535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976349,0.000059847294,0.00089998485,0.0003412288,0.0007796087,0.00028447196],"domain_scores_gemma":[0.99703103,0.0003698499,0.00029049063,0.00020389732,0.0018837763,0.00022096463],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000871099,0.00021869157,0.00025195163,0.00066973903,0.000090391644,0.0014557631,0.0012288755,0.00015627897,0.000034695997],"category_scores_gemma":[0.0006106907,0.00022178893,0.00016953608,0.0008917921,0.00003741944,0.0018409735,0.00010764594,0.000352485,0.0000041268727],"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.000007758538,0.00007654263,0.000003670997,0.000010879564,0.00018614996,0.000017268741,0.00013443462,0.9234543,0.000048589292,0.0023748747,0.00043314803,0.07325238],"study_design_scores_gemma":[0.0010183516,0.00022060443,0.000004784959,0.00018289156,0.00002977302,0.00011841187,0.000016313414,0.9970047,0.00007210144,0.0003055446,0.0008237628,0.00020279526],"about_ca_topic_score_codex":0.0000122880665,"about_ca_topic_score_gemma":4.8337165e-7,"teacher_disagreement_score":0.073550366,"about_ca_system_score_codex":0.0004410139,"about_ca_system_score_gemma":0.000616852,"threshold_uncertainty_score":0.9995808},"labels":[],"label_agreement":null},{"id":"W4399681230","doi":"10.5267/j.ijiec.2024.3.002","title":"Introduce free replacement extended warranty and bundle it? Optimal new extended warranty introduction strategy","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Technology Assessment and Management","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":"National Natural Science Foundation of China","keywords":"Warranty; Bundle; Computer science; Reliability engineering; Business; Engineering; Materials science","score_opus":0.01841457600517271,"score_gpt":0.2641105272508693,"score_spread":0.2456959512456966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13430972,0.0013211053,0.83100474,0.014814162,0.017312197,0.00030138483,0.00003181038,0.0006799782,0.00022487821],"genre_scores_gemma":[0.9830043,0.00021735896,0.0120703,0.000021350153,0.00442855,0.000007405187,0.000027174508,0.000039917388,0.00018370038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864155,0.000016765547,0.0005960309,0.00020697087,0.00034080053,0.0001978545],"domain_scores_gemma":[0.9994252,0.0000785282,0.00008748202,0.0001588348,0.00014671481,0.000103252736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177664,0.00020487938,0.00021792552,0.00063822215,0.00004089161,0.0002255075,0.00036172857,0.00013319177,0.00009577129],"category_scores_gemma":[0.00013204673,0.00020772447,0.000089457055,0.00025344946,0.000029722469,0.0004724142,0.00008673076,0.00062834745,0.0000062023832],"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.000055349585,0.000062448446,0.000010619395,0.000022409577,0.00084398023,0.00004565113,0.00020983444,0.86931664,0.001779013,0.01238889,0.069038376,0.046226807],"study_design_scores_gemma":[0.0035726589,0.00061150384,0.0005989176,0.0004029552,0.00023103775,0.0006612076,0.00044836817,0.8817293,0.0029222432,0.0026870554,0.10558252,0.00055222685],"about_ca_topic_score_codex":0.000010979103,"about_ca_topic_score_gemma":0.000002913175,"teacher_disagreement_score":0.8486945,"about_ca_system_score_codex":0.00025172596,"about_ca_system_score_gemma":0.00010707131,"threshold_uncertainty_score":0.84707576},"labels":[],"label_agreement":null},{"id":"W4399681246","doi":"10.5267/j.ijiec.2024.3.001","title":"A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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; Liaocheng University; National Natural Science Foundation of China","keywords":"Algorithm; Variable neighborhood search; Computer science; Job shop scheduling; Hybrid algorithm (constraint satisfaction); Constraint programming; Mathematical optimization; Scheduling (production processes); Variable (mathematics); Constraint logic programming; Metaheuristic; Mathematics; Stochastic programming; Schedule","score_opus":0.02386977824688337,"score_gpt":0.26570334906113396,"score_spread":0.2418335708142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003086109,0.00063036475,0.9931717,0.00018129438,0.0020851665,0.0002697838,0.00038873125,0.00017352046,0.000013333006],"genre_scores_gemma":[0.12299558,0.000036961963,0.87594414,0.0000049096943,0.000870833,0.00001689035,0.00007759265,0.000046968682,0.0000061172423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.0000128226075,0.000793059,0.00016750168,0.00039026004,0.00023934597],"domain_scores_gemma":[0.9986457,0.00035562814,0.00009090742,0.00007009541,0.00069652585,0.00014114704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043739,0.00019735114,0.00028500974,0.0005232946,0.00004426414,0.00026082137,0.000241033,0.00010959634,0.00001090523],"category_scores_gemma":[0.00016351727,0.00020712687,0.00012131557,0.00039228096,0.000044529348,0.0002369775,0.000039463474,0.0004385185,7.5697767e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068108366,0.00003470614,0.000016488126,0.00004981774,0.00043433558,0.000013426683,0.00012277471,0.83011353,0.00041803624,0.0008020658,0.000025211504,0.16796277],"study_design_scores_gemma":[0.0012889104,0.00009856992,0.000020188454,0.0006148718,0.00007602239,0.00041753944,0.00012418948,0.9957065,0.0009078912,0.00017938849,0.0003816057,0.00018430041],"about_ca_topic_score_codex":0.000009919423,"about_ca_topic_score_gemma":1.209844e-7,"teacher_disagreement_score":0.16777846,"about_ca_system_score_codex":0.00014690288,"about_ca_system_score_gemma":0.00025678068,"threshold_uncertainty_score":0.8446389},"labels":[],"label_agreement":null},{"id":"W4402846983","doi":"10.5267/j.ijiec.2024.9.001","title":"Performance evaluation of the NGHS metaheuristic as an alternative to the dynamic adaptive GA in the CREASE tool in SAS profile analysis of nanoparticulate system","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Water Quality Monitoring and Analysis","field":"Environmental Science","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":"Universidad del Cauca","keywords":"Metaheuristic; Computer science; Mathematical optimization; Mathematics","score_opus":0.039523176624915515,"score_gpt":0.3065537384715277,"score_spread":0.2670305618466122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402846983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968618,0.000019541636,0.001962325,0.0004169426,0.0005137523,0.00017355336,0.000022298207,0.0000039679376,0.000025829322],"genre_scores_gemma":[0.99972093,0.0000014575045,0.00015514444,0.0000061207975,0.000086453976,0.000013310062,0.000004709721,0.0000046330183,0.000007246188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980012,0.00029696018,0.00056073186,0.000104702165,0.0009537683,0.000082632825],"domain_scores_gemma":[0.99925077,0.0002737031,0.00019962841,0.00011935592,0.00013518009,0.00002138239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021913021,0.00007966887,0.0001657246,0.00033452906,0.000029512214,0.00004721425,0.00047195266,0.000027709248,0.000020352974],"category_scores_gemma":[0.00030845194,0.000045256522,0.00012740261,0.0012016431,0.000031952695,0.0001729556,0.000052344156,0.00021127387,0.0000035225344],"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.000020086487,0.0000459939,0.0027821022,0.0000027663857,0.00033937005,0.0000045121424,0.00206691,0.99179155,0.00074612885,0.00017248042,0.0000067672313,0.002021332],"study_design_scores_gemma":[0.0002103476,0.000051683324,0.058485996,0.00021109085,0.00043635847,0.000007984352,0.00052564556,0.9390693,0.00090351835,0.000040976767,0.000010838187,0.0000463112],"about_ca_topic_score_codex":0.0006370141,"about_ca_topic_score_gemma":0.000047225443,"teacher_disagreement_score":0.055703897,"about_ca_system_score_codex":0.00038030313,"about_ca_system_score_gemma":0.00006826313,"threshold_uncertainty_score":0.18455073},"labels":[],"label_agreement":null},{"id":"W4402846985","doi":"10.5267/j.ijiec.2024.7.001","title":"Pricing decision for recycling and remanufacturing supply chain considering consumer online consumption preferences and recycled products’ quality","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Recycling and Waste Management Techniques","field":"Environmental Science","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":"Remanufacturing; Supply chain; Business; Consumption (sociology); Quality (philosophy); Environmental economics; Marketing; Industrial organization; Economics; Manufacturing engineering; Engineering","score_opus":0.06243692555971005,"score_gpt":0.32312515385132,"score_spread":0.26068822829161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402846985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8195921,0.00026391103,0.17839718,0.0006133422,0.00087320985,0.00016008578,0.0000118625885,0.00006457406,0.000023692737],"genre_scores_gemma":[0.9595179,0.00046630955,0.039665822,0.000022319391,0.00028429073,0.0000049159607,0.000009413465,0.000013083165,0.00001596915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888974,0.00003060876,0.0005132227,0.00019442991,0.00026270046,0.000109277134],"domain_scores_gemma":[0.9986897,0.0009931991,0.00016070004,0.00005406692,0.000046283476,0.000056047866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181956,0.00011493898,0.00016343468,0.00022125684,0.00006105229,0.00019490955,0.00011957168,0.00006364142,0.000012117723],"category_scores_gemma":[0.00073897204,0.00010508343,0.000041333937,0.00008556999,0.000047869868,0.0003030503,0.00009036543,0.00021057483,7.695116e-7],"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.00012372676,0.0000601467,0.01935664,0.0000853216,0.00026004345,0.000024234563,0.00053243845,0.0961857,0.00469324,0.00076790043,0.00084026257,0.87707037],"study_design_scores_gemma":[0.004654725,0.00053313136,0.07992853,0.007151581,0.00032286617,0.00067243935,0.00050803914,0.8267767,0.015252672,0.015753644,0.04723566,0.001210022],"about_ca_topic_score_codex":0.000051994328,"about_ca_topic_score_gemma":0.000009293365,"teacher_disagreement_score":0.87586033,"about_ca_system_score_codex":0.00009638411,"about_ca_system_score_gemma":0.00001844459,"threshold_uncertainty_score":0.4285178},"labels":[],"label_agreement":null},{"id":"W4402846990","doi":"10.5267/j.ijiec.2024.6.003","title":"Optimizing contextual bandit hyperparameters: A dynamic transfer learning-based framework","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Data Stream Mining Techniques","field":"Computer Science","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":"Hyperparameter; Transfer of learning; Computer science; Artificial intelligence; Machine learning","score_opus":0.026186990339573574,"score_gpt":0.28628193189205703,"score_spread":0.26009494155248347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402846990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013708735,0.00019524415,0.98055327,0.0016626063,0.003378725,0.00007701442,0.000019261037,0.0003755089,0.000029653373],"genre_scores_gemma":[0.79195666,0.0000093113595,0.20758826,0.000053567204,0.0003469382,0.000004628674,0.000013154772,0.000019125806,0.000008344883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984851,0.00005072577,0.00054279465,0.00020713844,0.0005352685,0.00017897435],"domain_scores_gemma":[0.99837095,0.0010127856,0.00008852773,0.00014220795,0.00028448078,0.00010106813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039902874,0.00016942837,0.00020869095,0.0007663764,0.00004440211,0.0007052699,0.0011192524,0.00013477028,0.00001899604],"category_scores_gemma":[0.0005714421,0.00016677572,0.00018557395,0.0004072084,0.000030211238,0.00072221336,0.00007482981,0.0009206362,0.000010504575],"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.000018225684,0.000047669982,0.000018297524,0.000006523026,0.00024356143,0.00025230827,0.0005541315,0.94555926,0.00031099972,0.010928052,0.00049228314,0.041568667],"study_design_scores_gemma":[0.00046036646,0.00022166541,0.000020934525,0.0009532197,0.000025955169,0.00021677169,0.000024835303,0.99036753,0.0006602814,0.0006566019,0.006212436,0.00017940033],"about_ca_topic_score_codex":0.000006515855,"about_ca_topic_score_gemma":4.3947614e-7,"teacher_disagreement_score":0.77824795,"about_ca_system_score_codex":0.00021442285,"about_ca_system_score_gemma":0.00028908093,"threshold_uncertainty_score":0.6800934},"labels":[],"label_agreement":null},{"id":"W4402847032","doi":"10.5267/j.ijiec.2024.8.001","title":"Robotic assembly systems planning and scheduling problems: A revie","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Universidad Tecnológica de Pereira; Universidad de Antioquia","keywords":"Scheduling (production processes); Computer science; Systems engineering; Production planning; Engineering; Manufacturing engineering; Industrial engineering; Operations management; Production (economics)","score_opus":0.03640276141711752,"score_gpt":0.2738045249650229,"score_spread":0.23740176354790538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022539819,0.010322234,0.95717794,0.00028194097,0.009209488,0.000100335186,0.0000062474714,0.000267239,0.000094769886],"genre_scores_gemma":[0.9616032,0.00016358138,0.036416166,0.000009862667,0.0017345224,0.0000051847496,0.000009656266,0.00004119423,0.000016622698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895626,0.000015371968,0.0005192821,0.000094686395,0.00028967325,0.00012473969],"domain_scores_gemma":[0.9993449,0.00022807566,0.0000671287,0.000046364323,0.00022028889,0.00009326476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030095986,0.00013264836,0.00018926301,0.00048752408,0.00002866855,0.00041052047,0.00016361756,0.00008969818,0.000004883667],"category_scores_gemma":[0.00018939291,0.00013072403,0.000065554275,0.0002483431,0.000011343647,0.00030951598,0.000019713223,0.0004300461,0.000005102546],"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.0000020409566,0.000006116525,0.00004236066,0.00004706966,0.00024156262,0.000055043278,0.00019466548,0.9949238,0.00014125303,0.0007459124,0.00016249454,0.0034376902],"study_design_scores_gemma":[0.00030721116,0.000024579515,0.000024175544,0.0018872985,0.00003819643,0.00039294237,0.000068789624,0.9956908,0.000039552408,0.00002842815,0.0013747958,0.00012317904],"about_ca_topic_score_codex":0.0000025685283,"about_ca_topic_score_gemma":6.8648845e-8,"teacher_disagreement_score":0.9390634,"about_ca_system_score_codex":0.00011476065,"about_ca_system_score_gemma":0.000066718596,"threshold_uncertainty_score":0.5330771},"labels":[],"label_agreement":null},{"id":"W4402847045","doi":"10.5267/j.ijiec.2024.6.002","title":"Research on the influencing factors of traceability information sharing of agricultural product supply chain under the background of blockchain","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","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":"Traceability; Blockchain; Supply chain; Product (mathematics); Agriculture; Business; Information sharing; Quality (philosophy); Supply chain management; Process management; Industrial organization; Manufacturing engineering; Risk analysis (engineering); Computer science; Environmental economics; Engineering; Economics; Computer security; Marketing; World Wide Web; Software engineering; Mathematics","score_opus":0.07771118553019812,"score_gpt":0.30582565454067473,"score_spread":0.2281144690104766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906647,0.00002548346,0.0011234853,0.007112149,0.0007275317,0.00015551293,0.000011470504,0.000023144015,0.00015647624],"genre_scores_gemma":[0.999418,0.0000015716812,0.00006776789,0.000030327943,0.00045617216,0.0000036191711,0.000011804265,0.000005954621,0.0000047433155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985655,0.000017982398,0.00071116886,0.000069168564,0.0005351924,0.00010099313],"domain_scores_gemma":[0.997541,0.0006768408,0.0003684553,0.00011350526,0.001294221,0.0000059412923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013576816,0.0000871934,0.00014079716,0.00079912896,0.00007123611,0.000110525696,0.0005197183,0.00006276518,0.000021510148],"category_scores_gemma":[0.0004359822,0.000051693034,0.000094759096,0.001092348,0.00010146264,0.00051451894,0.00009983981,0.00060729485,0.0000021180588],"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.000019154617,0.00007193027,0.0028057145,0.00004892718,0.0002742418,7.2560334e-7,0.00041611696,0.61864084,0.0012760838,0.37488547,0.0006863686,0.0008743934],"study_design_scores_gemma":[0.0028649715,0.0003832645,0.5495975,0.0055055986,0.0003585711,0.00007527513,0.077862605,0.31826878,0.019397778,0.021235837,0.0037232134,0.0007265749],"about_ca_topic_score_codex":0.00021816239,"about_ca_topic_score_gemma":0.0000084360145,"teacher_disagreement_score":0.5467918,"about_ca_system_score_codex":0.0000772716,"about_ca_system_score_gemma":0.000071629634,"threshold_uncertainty_score":0.26384276},"labels":[],"label_agreement":null},{"id":"W4402847098","doi":"10.5267/j.ijiec.2024.7.002","title":"Coordination and optimization decision of assembly building supply chain under supply disruption risk","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","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":"National Office for Philosophy and Social Sciences","keywords":"Supply chain; Supply chain risk management; Supply chain optimization; Business; Risk analysis (engineering); Operations management; Computer science; Mathematical optimization; Manufacturing engineering; Engineering; Supply chain management; Service management; Mathematics","score_opus":0.015209350883606983,"score_gpt":0.26418200266727626,"score_spread":0.24897265178366929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38615388,0.0001816345,0.6100042,0.0011269564,0.002340872,0.000112957154,0.000007842585,0.000037214664,0.000034480116],"genre_scores_gemma":[0.9902963,0.000112727066,0.0079209935,0.0000390204,0.0015696675,0.0000032999733,0.00002637453,0.000019513524,0.000012111946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867743,0.000012354351,0.0005535064,0.00014411782,0.0004987509,0.00011380955],"domain_scores_gemma":[0.99884754,0.00030479892,0.00033371424,0.00005858408,0.00043617387,0.000019173563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057727855,0.00012816153,0.0001630424,0.0011425695,0.000060937364,0.00038828494,0.00021515702,0.00007672908,0.00003592908],"category_scores_gemma":[0.0003865326,0.00011687091,0.00009410706,0.00046227517,0.000025300322,0.0011758177,0.00008335042,0.00022900631,0.0000035379273],"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.00003224906,0.000037023587,0.002305193,0.000019618039,0.000117136595,0.000013520691,0.000046847133,0.94945204,0.0003184079,0.014216044,0.0006539638,0.03278794],"study_design_scores_gemma":[0.00074678514,0.000030854113,0.00359,0.00057518797,0.000091594564,0.000021456177,0.00016165814,0.99096876,0.00008660774,0.001556887,0.0020484582,0.000121755766],"about_ca_topic_score_codex":0.000112415706,"about_ca_topic_score_gemma":0.000004544249,"teacher_disagreement_score":0.6041424,"about_ca_system_score_codex":0.00009636278,"about_ca_system_score_gemma":0.00004268337,"threshold_uncertainty_score":0.47658575},"labels":[],"label_agreement":null},{"id":"W4402847106","doi":"10.5267/j.ijiec.2024.6.001","title":"Improving a multi-echelon last mile delivery system by effective solution methods based on ant colony optimization","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Ant colony optimization algorithms; Mile; Last mile (transportation); Computer science; ANT; Ant colony; Mathematical optimization; Engineering; Mathematics; Artificial intelligence; Geography; Computer network","score_opus":0.016497099999144577,"score_gpt":0.27527373218027956,"score_spread":0.258776632181135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011954989,0.00027234422,0.99275726,0.000059816,0.005087063,0.00018687993,0.000058438105,0.00034138648,0.00004130288],"genre_scores_gemma":[0.6887731,0.000018744393,0.31052345,0.000010737854,0.0005314038,0.000016135707,0.00007276095,0.000045066725,0.000008596544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988974,0.000057501256,0.00046273132,0.00014580069,0.00028198987,0.00015459635],"domain_scores_gemma":[0.99886006,0.00059451343,0.00012082603,0.00006976093,0.00027684655,0.00007798396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035638892,0.00018577867,0.00019292261,0.00052774843,0.000053172207,0.00015374723,0.00017478474,0.00014351484,0.0000052860155],"category_scores_gemma":[0.00031310346,0.00019042779,0.00010485747,0.00022330278,0.000015731957,0.00025572383,0.000018708488,0.0004564576,0.0000035881324],"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.000027938051,0.000030960542,0.00000253126,0.000042062595,0.00012793156,0.00002423742,0.000049705133,0.97350353,0.002019647,0.000103648475,0.00039655904,0.02367125],"study_design_scores_gemma":[0.00077296473,0.000101263584,0.000010711319,0.0005132031,0.000048737875,0.000033986787,0.000022393864,0.9939651,0.0035831116,0.0000044710905,0.00078164117,0.00016243165],"about_ca_topic_score_codex":0.000011423462,"about_ca_topic_score_gemma":5.284268e-7,"teacher_disagreement_score":0.6875776,"about_ca_system_score_codex":0.0007920566,"about_ca_system_score_gemma":0.00007073813,"threshold_uncertainty_score":0.776542},"labels":[],"label_agreement":null},{"id":"W4402847124","doi":"10.5267/j.ijiec.2024.7.003","title":"An optimization approach for assembly job shop order release based on clearing functions","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"Clearing; Order (exchange); Job shop; Mathematical optimization; Build to order; Computer science; Operations research; Engineering; Industrial engineering; Business; Mathematics; Microeconomics; Production (economics); Job shop scheduling; Economics; Flow shop scheduling","score_opus":0.021040178144804474,"score_gpt":0.260627631171557,"score_spread":0.23958745302675255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041804453,0.000042723135,0.99060166,0.0002020255,0.0040077404,0.00021053471,0.000043650587,0.00038391788,0.00032730703],"genre_scores_gemma":[0.76952595,0.000006900881,0.22804604,0.000027699987,0.001953505,0.00002218229,0.0003114689,0.00008666339,0.000019609615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865884,0.000024251585,0.00056077505,0.0001730789,0.0004057042,0.00017732826],"domain_scores_gemma":[0.9987591,0.00031095516,0.000086797445,0.000119790675,0.0006029231,0.000120428434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031390268,0.00019710348,0.00019458031,0.000835251,0.000063427084,0.00031575328,0.00027427118,0.00015127417,0.000015914606],"category_scores_gemma":[0.00035050916,0.0002091727,0.0001321828,0.000477896,0.000010672439,0.0005410646,0.000011014337,0.0004247804,0.000002952379],"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.0000404001,0.000060778108,0.00003778152,0.000022003253,0.00015234148,0.00000837242,0.000060193477,0.9948695,0.00040288153,0.00038355592,0.0006510013,0.0033112052],"study_design_scores_gemma":[0.00081933936,0.00014508805,0.000030430494,0.0002050921,0.000059138896,0.00003096231,0.00004021241,0.9976768,0.0001395093,0.000007895366,0.0006561041,0.00018946057],"about_ca_topic_score_codex":0.0000028208544,"about_ca_topic_score_gemma":4.1906864e-7,"teacher_disagreement_score":0.76534545,"about_ca_system_score_codex":0.0003187298,"about_ca_system_score_gemma":0.0001757577,"threshold_uncertainty_score":0.8529815},"labels":[],"label_agreement":null},{"id":"W4402847160","doi":"10.5267/j.ijiec.2024.7.004","title":"Energy-efficient scheduling for a flexible job shop problem considering rework processes and new job arrival","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Rework; Job shop; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Industrial engineering; Computer science; Operations research; Mathematical optimization; Engineering; Operations management; Mathematics; Schedule; Embedded system","score_opus":0.03790020328638515,"score_gpt":0.2729651741331217,"score_spread":0.23506497084673655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017463429,0.0018688178,0.97567147,0.00066828344,0.0037967218,0.00010561552,0.00001636566,0.00032458434,0.00008469825],"genre_scores_gemma":[0.6261095,0.00010545654,0.37053493,0.000028956518,0.0030395647,0.0000137193,0.000013743994,0.000070360635,0.00008379108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998823,0.000008271476,0.0005466919,0.00014446452,0.00029771173,0.00017985146],"domain_scores_gemma":[0.9988895,0.0004472532,0.00007274402,0.000052840605,0.00038269887,0.00015494862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021751762,0.00017468534,0.00020048683,0.00051224604,0.000052606436,0.00038005662,0.00018558581,0.00011180419,0.000011305906],"category_scores_gemma":[0.0003327595,0.00017902114,0.00008874793,0.0003625391,0.00001794977,0.00021480251,0.000028461056,0.00032027788,0.0000015488168],"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.000014388636,0.0000090178655,0.00002820699,0.000049773324,0.000254893,0.000015738531,0.0002796351,0.98523235,0.00017893524,0.002705691,0.0004988159,0.010732548],"study_design_scores_gemma":[0.0007602071,0.00004039372,0.000006833427,0.00093223463,0.000046932237,0.00019663473,0.00007445791,0.99362123,0.0008561303,0.0005032274,0.0027806824,0.0001810557],"about_ca_topic_score_codex":0.000005398812,"about_ca_topic_score_gemma":0.0000010451145,"teacher_disagreement_score":0.60864604,"about_ca_system_score_codex":0.00012499742,"about_ca_system_score_gemma":0.00032284993,"threshold_uncertainty_score":0.730027},"labels":[],"label_agreement":null},{"id":"W4405090962","doi":"10.5267/j.ijiec.2024.10.004","title":"Enhancing efficiency in supply chain management: A synergistic approach to production, logistics, and green investments under different carbon emission policies","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Business; Production (economics); Supply chain management; Supply chain; Industrial organization; Environmental economics; Natural resource economics; Economics; Microeconomics; Marketing","score_opus":0.020350840121512243,"score_gpt":0.24062867558843554,"score_spread":0.22027783546692328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405090962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79082865,0.00023666241,0.195819,0.006078082,0.005051422,0.000705177,0.000004388539,0.0001287734,0.0011478355],"genre_scores_gemma":[0.9970256,0.000010005916,0.00070152205,0.0001652539,0.0018451583,0.00001787792,0.000015034014,0.000026605863,0.00019295224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.000014031604,0.0005358185,0.00023305835,0.00047720093,0.00021911821],"domain_scores_gemma":[0.9994593,0.00007970642,0.00013108786,0.000084861385,0.00020928698,0.00003571816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004124407,0.00018449067,0.00018962531,0.001975322,0.000046406316,0.00037269518,0.00028712454,0.000053342017,0.0000045054903],"category_scores_gemma":[0.0003149119,0.00017149524,0.00004908241,0.00068532093,0.000025588339,0.00031751167,0.00021470577,0.00025780548,0.0000020474438],"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.000033020777,0.00016073548,0.0014573307,0.00023986562,0.00021722174,0.000108397515,0.00043111306,0.94757843,0.00030360272,0.04432631,0.00044864338,0.0046953266],"study_design_scores_gemma":[0.0018759846,0.000054964985,0.012362474,0.002593528,0.00022099413,0.00005499998,0.0028466198,0.96457255,0.00023310109,0.00936008,0.005183955,0.0006407749],"about_ca_topic_score_codex":0.00031528348,"about_ca_topic_score_gemma":0.000007986785,"teacher_disagreement_score":0.20619693,"about_ca_system_score_codex":0.00035472834,"about_ca_system_score_gemma":0.00003533282,"threshold_uncertainty_score":0.69933724},"labels":[],"label_agreement":null},{"id":"W4405090980","doi":"10.5267/j.ijiec.2024.10.007","title":"Inventory control of deteriorating items: A review","year":2024,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Recycling and Waste Management Techniques","field":"Environmental Science","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":"Control (management); Inventory control; Operations management; Computer science; Reliability engineering; Operations research; Business; Economics; Engineering; Artificial intelligence","score_opus":0.052950086838281556,"score_gpt":0.3297876950211163,"score_spread":0.27683760818283476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405090980","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009406162,0.979955,0.01728452,0.000121097546,0.0020124167,0.0003263884,0.000025992073,0.00004095709,0.0002241946],"genre_scores_gemma":[0.00047663032,0.99750507,0.001310105,0.00003326046,0.0005710927,0.000013542913,0.000013746096,0.000031996908,0.000044556735],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978152,0.00007400781,0.0013385329,0.00013986343,0.0005253514,0.00010702461],"domain_scores_gemma":[0.99861944,0.00017122754,0.00096836995,0.00010733364,0.000073044095,0.000060558257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733586,0.0002133689,0.00081582065,0.00034185222,0.000015006006,0.00005461462,0.0006038076,0.00012366391,0.00006670388],"category_scores_gemma":[0.00037224614,0.00017215947,0.0005085611,0.00031740332,0.0000335402,0.0001362313,0.00013675491,0.00054105266,0.000028505836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026481766,0.000035805904,0.000010261798,0.0027187893,0.00059720315,0.000057502275,0.000022787079,0.011876654,0.0000029483635,0.00009377912,0.009913827,0.9746678],"study_design_scores_gemma":[0.0001901462,0.00006585816,6.6525484e-7,0.09131206,0.00091508264,0.00010904709,0.0000031556494,0.0035456654,0.0000011618127,0.00004003322,0.90365624,0.00016087868],"about_ca_topic_score_codex":0.0000117676655,"about_ca_topic_score_gemma":3.3993007e-7,"teacher_disagreement_score":0.9745069,"about_ca_system_score_codex":0.000272502,"about_ca_system_score_gemma":0.00007969153,"threshold_uncertainty_score":0.702046},"labels":[],"label_agreement":null},{"id":"W4405121246","doi":"10.5267/j.ijiec.2024.11.001","title":"Determining a manufacturing-delivery policy for a multi-item EPQ system with multi-shipment, quality assurance, overtime, postponement, and external source","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Postponement; Rework; Overtime; Quality (philosophy); Quality assurance; Computer science; Work (physics); Finished good; Production (economics); Operations management; Lead time; Risk analysis (engineering); Operations research; Business; Marketing; Engineering; Economics; Service (business)","score_opus":0.05584718073777046,"score_gpt":0.29129796079828146,"score_spread":0.235450780060511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405121246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29076296,0.00021353483,0.70552945,0.00063344295,0.0022519235,0.00035975044,0.000022762131,0.00013943248,0.000086750646],"genre_scores_gemma":[0.98843676,0.0000084447975,0.008169423,0.00017752715,0.0030348185,0.000021894717,0.000016011874,0.00003959665,0.00009550214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985446,0.000014260511,0.0006134671,0.00020684999,0.00041287995,0.00020799824],"domain_scores_gemma":[0.99905246,0.00023027464,0.00033396197,0.00007572524,0.00026821595,0.000039346385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047380925,0.0002071239,0.00023327071,0.00089430343,0.000092265574,0.00071248977,0.00027712347,0.00006263385,0.000009561665],"category_scores_gemma":[0.00018387905,0.00018489193,0.0001290653,0.00014598487,0.000024557638,0.0008286472,0.000103876024,0.00022933885,0.000005506452],"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.0008705169,0.0005423606,0.013300556,0.0016552969,0.0046142098,0.000572468,0.0009672685,0.82272565,0.0022616598,0.025603633,0.0024665205,0.12441987],"study_design_scores_gemma":[0.0042753704,0.000067264074,0.005371042,0.0021434592,0.00014768135,0.00009391387,0.00042541293,0.9631081,0.0002356341,0.000025964326,0.023773303,0.00033281406],"about_ca_topic_score_codex":0.0001722267,"about_ca_topic_score_gemma":0.000014414239,"teacher_disagreement_score":0.6976738,"about_ca_system_score_codex":0.0002161548,"about_ca_system_score_gemma":0.00008675505,"threshold_uncertainty_score":0.75396746},"labels":[],"label_agreement":null},{"id":"W4405121610","doi":"10.5267/j.ijiec.2024.12.001","title":"Decision-making in cross-border e-commerce supply chains and coordination under revenue sharing and deferred payment contracts","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","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":"Jilin Office of Philosophy and Social Science; Yunnan Provincial Department of Education; National Natural Science Foundation of China; National Science Foundation","keywords":"Supply chain; Revenue sharing; Business; Payment; Profitability index; Industrial organization; Revenue; Revenue management; Transfer pricing; Transfer payment; Tariff; Supply chain management; Channel coordination; Economics; Marketing; Finance; International trade","score_opus":0.02391706323688436,"score_gpt":0.3306182240636279,"score_spread":0.30670116082674354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405121610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95193857,0.0002622588,0.038451053,0.007348973,0.0016864511,0.00010766325,0.000009522267,0.00004998017,0.00014551001],"genre_scores_gemma":[0.99813986,0.000016661745,0.0008015162,0.0002493994,0.00072175695,0.000004901309,0.0000124686085,0.00001713901,0.000036321762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990288,0.0000042163633,0.000483435,0.00014355339,0.00021584905,0.00012411857],"domain_scores_gemma":[0.9992106,0.00028377853,0.00015554778,0.000055816265,0.0002819094,0.000012344264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929384,0.00011539321,0.00015245444,0.0010805717,0.00006417816,0.0005496021,0.00016423111,0.000105648454,0.00002410772],"category_scores_gemma":[0.00047134247,0.00011724648,0.00003792759,0.00044915918,0.000042556476,0.00090070715,0.00011504922,0.00042408964,0.0000034483758],"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.000112568196,0.00019184631,0.15029268,0.0000657756,0.0005208063,0.00027323747,0.00036359177,0.2743464,0.0006651923,0.3668148,0.0021231377,0.20422997],"study_design_scores_gemma":[0.0039723003,0.00004134334,0.25324306,0.0040613837,0.00011168198,0.00040467194,0.00043041466,0.6898131,0.000027648675,0.024488261,0.022876544,0.0005296002],"about_ca_topic_score_codex":0.00006394044,"about_ca_topic_score_gemma":0.000029854242,"teacher_disagreement_score":0.41546667,"about_ca_system_score_codex":0.00009271031,"about_ca_system_score_gemma":0.000034887562,"threshold_uncertainty_score":0.52998257},"labels":[],"label_agreement":null},{"id":"W4405121831","doi":"10.5267/j.ijiec.2024.10.001","title":"Optimal green technology investment and lot-sizing decision under carbon tax and cap-and-trade regulations considering planned shortages, outsourced repair and batch shipments","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Greenhouse gas; Investment (military); Business; Purchasing; Environmental economics; Quality (philosophy); Carbon tax; Carbon footprint; Emissions trading; Industrial organization; Operations management; Commerce; Economics; Marketing","score_opus":0.0192439543651026,"score_gpt":0.2406795083119827,"score_spread":0.2214355539468801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405121831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761509,0.0009592963,0.0135532785,0.008101987,0.00080632075,0.00023183197,0.000004977087,0.00013236492,0.000059102214],"genre_scores_gemma":[0.99431837,0.00003600444,0.00476741,0.00016434789,0.0006438101,0.0000067269693,0.000009231703,0.000025571155,0.000028502769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886256,0.000009537519,0.00044590072,0.00022064593,0.00029794264,0.00016340165],"domain_scores_gemma":[0.9993956,0.00024276305,0.00014157579,0.00006639379,0.00011528522,0.000038363996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035341663,0.00017027113,0.00019501046,0.0011939631,0.000091270944,0.0004148932,0.000109311164,0.00010202923,0.000004227664],"category_scores_gemma":[0.00023616625,0.00017175109,0.000036672118,0.00027818588,0.00006304414,0.00047051095,0.00024775494,0.00029604035,3.493653e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014399922,0.00007244116,0.027315076,0.00022952251,0.0015763746,0.00065378123,0.00088275457,0.8751576,0.0005202717,0.06420776,0.0010423688,0.02819808],"study_design_scores_gemma":[0.0018500162,0.00006746898,0.010793377,0.00093379174,0.00023730681,0.00029919686,0.0024269626,0.966201,0.000029382036,0.005134594,0.011682552,0.0003443417],"about_ca_topic_score_codex":0.00015908311,"about_ca_topic_score_gemma":0.000014637246,"teacher_disagreement_score":0.09104344,"about_ca_system_score_codex":0.00011322317,"about_ca_system_score_gemma":0.00003805249,"threshold_uncertainty_score":0.7003806},"labels":[],"label_agreement":null},{"id":"W4405121936","doi":"10.5267/j.ijiec.2024.11.003","title":"You are entitled to access the full text of this documentA novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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 Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Algorithm; Constraint (computer-aided design); Sequence (biology); Heuristic; Computer science; Hybrid algorithm (constraint satisfaction); Variable (mathematics); Constraint programming; Mathematics; Constraint logic programming; Metaheuristic; Schedule; Stochastic programming","score_opus":0.03172744612313183,"score_gpt":0.2925761604895104,"score_spread":0.2608487143663786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405121936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018109972,0.0001413699,0.97999907,0.00041716138,0.0005932408,0.00040021972,0.00024231257,0.000060023067,0.000036656504],"genre_scores_gemma":[0.53587127,0.00001575503,0.46360886,0.000011915288,0.00034564646,0.000026755413,0.000037113958,0.000038236798,0.000044451972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987829,0.000015274065,0.0005190143,0.00013451363,0.0003872307,0.00016110144],"domain_scores_gemma":[0.9986772,0.0003038081,0.00010802228,0.00006842548,0.00075407914,0.00008848402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045318416,0.00014707095,0.0002285419,0.00033401352,0.000046339563,0.00028061867,0.00030616453,0.00005374386,0.000042647298],"category_scores_gemma":[0.00012879541,0.00011723558,0.00005633296,0.00035779047,0.000042785483,0.0003119848,0.00005596676,0.0003097722,0.000001061258],"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.000031902473,0.000030465186,0.000022879043,0.000043028784,0.0004941045,0.0000068147583,0.00035407185,0.9864486,0.0022139675,0.0008695019,0.000042554966,0.009442099],"study_design_scores_gemma":[0.0009133003,0.00015004896,0.0000049663217,0.00088005204,0.0000630793,0.00017092002,0.00021124225,0.99081206,0.0065074987,0.00003195958,0.0001321267,0.00012272499],"about_ca_topic_score_codex":0.000015794905,"about_ca_topic_score_gemma":9.759249e-7,"teacher_disagreement_score":0.5177613,"about_ca_system_score_codex":0.0001282585,"about_ca_system_score_gemma":0.0002457865,"threshold_uncertainty_score":0.4780728},"labels":[],"label_agreement":null},{"id":"W4405122072","doi":"10.5267/j.ijiec.2024.10.003","title":"Research on storage location allocation in three-dimensional automated warehouse based on cargo damage control","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Stacker; Warehouse; Computer science; Operational efficiency; Operations research; Reliability engineering; Engineering","score_opus":0.040092275403123934,"score_gpt":0.31293788958002144,"score_spread":0.2728456141768975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053254694,0.00008921225,0.94095445,0.0007413514,0.004047632,0.00022576861,0.00003804701,0.0005320358,0.00011682959],"genre_scores_gemma":[0.9966261,0.0000047621097,0.0026462714,0.000029579322,0.000581162,0.000011733785,0.00005092582,0.000042971733,0.000006493644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984533,0.0000543854,0.0004835685,0.0001482938,0.0006778109,0.00018264417],"domain_scores_gemma":[0.99838066,0.0009164306,0.000059858477,0.000104054954,0.00046564057,0.00007335519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006000356,0.00015398461,0.0001605862,0.0014992796,0.000040725627,0.00013077786,0.00022540703,0.00013055146,0.00001237208],"category_scores_gemma":[0.0003889947,0.00015576035,0.000057113142,0.00052460097,0.000023976905,0.00020679877,0.000011498446,0.0008403286,0.000017275852],"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.000060967493,0.000058470076,0.000018127306,0.0000143176885,0.00006193431,0.00008548565,0.000043370957,0.99584347,0.00008228013,0.0014523434,0.0007606726,0.0015185705],"study_design_scores_gemma":[0.001070454,0.00012932374,0.00079080247,0.0006772445,0.000010186922,0.000010459852,0.000010876606,0.9963966,0.00029247772,0.00017452918,0.00031128095,0.00012577121],"about_ca_topic_score_codex":0.000015783375,"about_ca_topic_score_gemma":0.000006461517,"teacher_disagreement_score":0.9433714,"about_ca_system_score_codex":0.00068924483,"about_ca_system_score_gemma":0.00016786183,"threshold_uncertainty_score":0.63517225},"labels":[],"label_agreement":null},{"id":"W4405122194","doi":"10.5267/j.ijiec.2024.10.008","title":"Multi-objective mixed-model assembly line balancing with hierarchical worker assignment: A case study of gear reducer manufacturing operations","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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 Science and Technology Council","keywords":"Reducer; Genetic algorithm; Mixed model; Assembly line; Mathematical optimization; Hierarchical database model; Sorting; Production line; Computer science; Product (mathematics); Operations research; Industrial engineering; Engineering; Algorithm","score_opus":0.02236663828791673,"score_gpt":0.2767296499417676,"score_spread":0.25436301165385083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48601326,0.000046862333,0.5125422,0.000051849853,0.0010632687,0.00016181888,0.000015112421,0.000091113725,0.000014493519],"genre_scores_gemma":[0.9598294,0.000007898068,0.039391454,0.0000047366566,0.0006534102,0.000014616014,0.000018759529,0.00006537878,0.00001434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824905,0.000042183397,0.00080208987,0.00018391183,0.0005345983,0.00018813649],"domain_scores_gemma":[0.99901843,0.0002563493,0.00010654925,0.00011705772,0.00038961464,0.00011201742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030379725,0.00023591319,0.00031073036,0.0007327286,0.000060959286,0.00017495592,0.0002293171,0.00011444626,0.0000074208633],"category_scores_gemma":[0.00012719656,0.0002160698,0.000096088195,0.00031866078,0.000018601126,0.00047438752,0.00004680074,0.0007343922,0.000001868011],"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.000025538488,0.00017786003,0.00008967143,0.000014851982,0.0007577452,0.0008262759,0.0019559667,0.99189085,0.0019655698,0.000033613935,0.00004738563,0.0022146765],"study_design_scores_gemma":[0.0015077975,0.00020579621,0.00015783956,0.00048356794,0.00012091924,0.0016259699,0.0008774016,0.99273103,0.0020662525,0.000005881168,0.000023773138,0.0001937577],"about_ca_topic_score_codex":0.00004248441,"about_ca_topic_score_gemma":0.000041967207,"teacher_disagreement_score":0.47381616,"about_ca_system_score_codex":0.00034883615,"about_ca_system_score_gemma":0.0002041268,"threshold_uncertainty_score":0.88110715},"labels":[],"label_agreement":null},{"id":"W4405122619","doi":"10.5267/j.ijiec.2024.10.002","title":"The vehicle routing problem as applied to residential solid waste collection operations: Systematic literature review","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Urban and Freight Transport Logistics","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":"Ministério da Ciência, Tecnologia e Inovação","keywords":"Vehicle routing problem; Municipal solid waste; Computer science; Routing (electronic design automation); Waste management; Operations research; Environmental science; Engineering; Computer network","score_opus":0.01993316916813459,"score_gpt":0.24962437169948173,"score_spread":0.22969120253134714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071279667,0.058361433,0.9002717,0.0051459237,0.024729976,0.0022077567,0.00007579515,0.00069112034,0.0013883394],"genre_scores_gemma":[0.9918838,0.0031356404,0.0020735003,0.000110041794,0.002506333,0.00005190813,0.00002615499,0.00004875072,0.00016383991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851054,0.00002439339,0.0008113174,0.000085576685,0.00042306335,0.00014511588],"domain_scores_gemma":[0.9991704,0.00024362568,0.00005805348,0.000085277235,0.00035635705,0.00008626283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045784612,0.00014561001,0.0002248924,0.00028118503,0.000099152174,0.0005174817,0.000308329,0.00007620322,0.0000073165866],"category_scores_gemma":[0.00024440608,0.000112840054,0.00011560003,0.0005668268,0.000011656273,0.00018607412,0.00001793134,0.0004711748,0.000020338293],"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.000009681087,0.000009053812,0.0000011382042,0.0012540906,0.0003397433,0.00005678417,0.00039201332,0.98093,0.00049099274,0.008082684,0.007952516,0.00048131373],"study_design_scores_gemma":[0.00068080385,0.00010861529,0.000012159774,0.088214345,0.00030431466,0.0005316654,0.00014584065,0.9013432,0.0010934348,0.00037071484,0.006830617,0.00036426797],"about_ca_topic_score_codex":0.0000031042318,"about_ca_topic_score_gemma":0.000004959721,"teacher_disagreement_score":0.9847559,"about_ca_system_score_codex":0.00021297365,"about_ca_system_score_gemma":0.00010695498,"threshold_uncertainty_score":0.4990088},"labels":[],"label_agreement":null},{"id":"W4405122622","doi":"10.5267/j.ijiec.2024.11.002","title":"A robust single-machine scheduling problem with scenario-dependent processing times and release dates","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Division of Graduate Education; National Science and Technology Council; Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Single-machine scheduling; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Real-time computing; Mathematics; Embedded system","score_opus":0.022839601723407994,"score_gpt":0.23229694352889066,"score_spread":0.20945734180548267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03944542,0.0026195948,0.9551003,0.0007380783,0.001468749,0.00011132581,0.00002031498,0.0003490397,0.00014719566],"genre_scores_gemma":[0.8153051,0.000049215923,0.18386653,0.000011859496,0.00067773,0.0000033292433,0.000018882893,0.00004523908,0.000022070391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893093,0.000011799495,0.0004275223,0.00013039986,0.0003574579,0.00014185991],"domain_scores_gemma":[0.9993426,0.00012865457,0.000078101286,0.00004892741,0.00029013303,0.00011159135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019739504,0.00016793191,0.0001700835,0.00046997098,0.000045769706,0.0004644066,0.00017014978,0.00008032192,0.000015466372],"category_scores_gemma":[0.000090425594,0.00014733322,0.000045165565,0.0002726929,0.000023853363,0.00045027304,0.000025557581,0.00047869803,0.0000029593123],"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.000016730048,0.000024805706,0.00006325465,0.000031485866,0.00021090674,0.00008564239,0.00023241602,0.97611225,0.00026967062,0.00019503883,0.00004632745,0.022711456],"study_design_scores_gemma":[0.00066065945,0.00006681992,0.000015437423,0.0010442454,0.00005254289,0.00052604044,0.00007271912,0.99658954,0.00039243518,0.000046366957,0.00036823627,0.00016497076],"about_ca_topic_score_codex":0.000005214891,"about_ca_topic_score_gemma":0.0000012475662,"teacher_disagreement_score":0.7758597,"about_ca_system_score_codex":0.00012764116,"about_ca_system_score_gemma":0.00011247299,"threshold_uncertainty_score":0.6008075},"labels":[],"label_agreement":null},{"id":"W4405122657","doi":"10.5267/j.ijiec.2024.10.005","title":"Integrating sequence-dependent setup times and blocking in hybrid flow shop scheduling to minimize total tardiness","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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; Blocking (statistics); Flow shop scheduling; Scheduling (production processes); Sequence (biology); Computer science; Job shop scheduling; Due date; Mathematical optimization; Real-time computing; Mathematics; Embedded system; Computer network","score_opus":0.02256627850798987,"score_gpt":0.26486653923336806,"score_spread":0.2423002607253782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2769198,0.00036732914,0.71645075,0.0005935705,0.005319497,0.00009608965,0.00003310786,0.00016459225,0.000055216024],"genre_scores_gemma":[0.83545953,0.000017540573,0.16343178,0.000016339996,0.0010069236,0.0000054407456,0.00001348607,0.000034501,0.000014433302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986986,0.00001869078,0.0006083241,0.000148939,0.00035158955,0.00017389264],"domain_scores_gemma":[0.99927664,0.0002851882,0.000051887313,0.000054966717,0.0002087318,0.00012258148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427867,0.00017644951,0.0002224308,0.0008370666,0.000034614575,0.00042234064,0.0001977978,0.00007715974,0.00002619255],"category_scores_gemma":[0.00039760745,0.00018184826,0.000074075535,0.0003462295,0.000014972505,0.00031491125,0.000045938694,0.00055664155,0.0000057992693],"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.000009314809,0.000009921021,0.000094662806,0.000011177334,0.0001305588,0.00014737397,0.00047863083,0.97988904,0.00042563115,0.00020052411,0.000058525886,0.018544652],"study_design_scores_gemma":[0.00051614374,0.000021896594,0.000039650775,0.0008490136,0.000018799814,0.00044805265,0.00019170903,0.99701315,0.0005475375,0.00006507923,0.00011504228,0.00017393763],"about_ca_topic_score_codex":0.000010137602,"about_ca_topic_score_gemma":0.0000012731655,"teacher_disagreement_score":0.55853975,"about_ca_system_score_codex":0.00023563698,"about_ca_system_score_gemma":0.00011612206,"threshold_uncertainty_score":0.7415557},"labels":[],"label_agreement":null},{"id":"W4405122745","doi":"10.5267/j.ijiec.2024.10.006","title":"Green pickup and delivery problem with private drivers for crowd-shipping distribution considering traffic congestion","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation and Mobility Innovations","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":"Pickup; Traffic congestion; Transport engineering; Distribution (mathematics); Business; Computer science; Automotive engineering; Computer security; Engineering; Mathematics; Artificial intelligence","score_opus":0.02292143232867713,"score_gpt":0.235166849413481,"score_spread":0.21224541708480388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60016406,0.00011529588,0.39738068,0.0006783004,0.0011274383,0.00020469233,0.00013679363,0.00018212765,0.00001062457],"genre_scores_gemma":[0.9916175,0.000027940547,0.007820369,0.000011242262,0.00033611376,0.000014731248,0.00014217992,0.000023590119,0.000006350626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912876,0.000007150246,0.00043416652,0.00010546875,0.00020325033,0.000121193974],"domain_scores_gemma":[0.99926895,0.00021875543,0.00006628847,0.000040261442,0.00033963958,0.000066086664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016551036,0.00012976548,0.00014023948,0.00029150813,0.00004574832,0.0001464858,0.00009665912,0.00007761477,0.000005439322],"category_scores_gemma":[0.000046084784,0.00012961445,0.000059311602,0.0002213815,0.000032225515,0.0003875818,0.0000064639476,0.00026802658,8.314288e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002245859,0.000012406285,0.00015861072,0.00004727258,0.00032759274,0.000018139679,0.00028505625,0.97802985,0.00075932196,0.0062649297,0.0001891642,0.013885205],"study_design_scores_gemma":[0.0025846974,0.000210242,0.0037856626,0.0013639071,0.0002096608,0.0003414116,0.0001872662,0.9667703,0.00070365396,0.0003610497,0.023080815,0.0004013269],"about_ca_topic_score_codex":0.000006583851,"about_ca_topic_score_gemma":0.0000091201055,"teacher_disagreement_score":0.39145344,"about_ca_system_score_codex":0.00015855237,"about_ca_system_score_gemma":0.000094113246,"threshold_uncertainty_score":0.5285524},"labels":[],"label_agreement":null},{"id":"W4407569468","doi":"10.5267/j.ijiec.2024.12.002","title":"Enhancing kidney transplantation through multi-agent kidney exchange programs: A comprehensive review and optimization models","year":2025,"lang":"en","type":"review","venue":"International Journal of Industrial Engineering Computations","topic":"Organ Donation and Transplantation","field":"Medicine","cited_by":15,"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":"Pooling; Computer science; Kidney transplantation; Kidney transplant; Risk analysis (engineering); Transplantation; Management science; Medicine; Artificial intelligence; Surgery; Engineering","score_opus":0.08600182259674147,"score_gpt":0.3461298326877869,"score_spread":0.26012801009104547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407569468","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012671065,0.6223502,0.37439537,0.00077492045,0.0012402245,0.0009668512,0.00018563255,0.000049899307,0.000035606066],"genre_scores_gemma":[0.000019954474,0.9626275,0.03428867,0.0006365937,0.0004657043,0.000045715948,0.0018074653,0.000045064477,0.000063332554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99750215,0.00010500104,0.0014137167,0.0002651881,0.0005404395,0.00017348804],"domain_scores_gemma":[0.9975682,0.00024142432,0.000767061,0.00011246993,0.0010470765,0.0002637647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022625005,0.00038118806,0.0012136543,0.00074922864,0.000058376227,0.00009144071,0.00021073321,0.00029193494,0.00004334985],"category_scores_gemma":[0.00036549728,0.00035252277,0.0003817397,0.00050126074,0.00003141069,0.0004087679,0.000028240753,0.0006706096,0.0000030491349],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018419654,0.00090791617,0.000009712925,0.1951234,0.0063612596,0.0005626917,0.0016169427,0.14952706,0.000012075153,0.000891141,0.0034353395,0.64136827],"study_design_scores_gemma":[0.007388156,0.00029228706,0.000004352627,0.43010852,0.012514796,0.0031650907,0.00004530803,0.029034415,0.000019642279,0.00002957343,0.5166685,0.0007293357],"about_ca_topic_score_codex":0.000010905763,"about_ca_topic_score_gemma":6.8003936e-7,"teacher_disagreement_score":0.64063895,"about_ca_system_score_codex":0.00028576527,"about_ca_system_score_gemma":0.0011769872,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W4408377847","doi":"10.5267/j.ijiec.2025.1.002","title":"Horizontal information sharing or not? The choice in information leakage dilemma of the reverse supply chain","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Business Strategies and Innovation","field":"Business, Management and Accounting","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":"Dilemma; Information leakage; Leakage (economics); Supply chain; Information sharing; Reverse logistics; Computer science; Business; Industrial organization; Operations management; Economics; Marketing; Computer security; Mathematics","score_opus":0.021494738045464933,"score_gpt":0.23625562270862457,"score_spread":0.21476088466315965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408377847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9515018,0.000009709296,0.02483437,0.014611756,0.007434977,0.0004223619,0.000019014244,0.00003250108,0.0011335473],"genre_scores_gemma":[0.99857026,0.0000026610255,0.00012144377,0.00056144764,0.0006974996,0.000005172118,0.000025610032,0.00000403288,0.000011881569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987217,0.00000675546,0.0007808204,0.000044355736,0.00034989725,0.00009647455],"domain_scores_gemma":[0.99835205,0.00011505764,0.0006259082,0.00008888287,0.00081325264,0.000004862145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043092496,0.00009623436,0.00012689798,0.0006434941,0.000070363014,0.0003278639,0.00052884454,0.00006749994,0.000020886731],"category_scores_gemma":[0.0010262589,0.00006292312,0.000071145776,0.0009812103,0.000024675763,0.0037775713,0.00013509017,0.00032235647,0.0000034304508],"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.00029572254,0.00005610718,0.015017393,0.0000759485,0.00013607768,0.0000024317205,0.00026005233,0.820877,0.00022062784,0.13181503,0.004803085,0.026440503],"study_design_scores_gemma":[0.005380221,0.00003730071,0.35026678,0.001676079,0.00008451802,0.000026981676,0.0010506412,0.48148736,0.0002674597,0.0010809487,0.1583348,0.00030687795],"about_ca_topic_score_codex":0.00063887506,"about_ca_topic_score_gemma":0.000048831775,"teacher_disagreement_score":0.33938965,"about_ca_system_score_codex":0.0001206661,"about_ca_system_score_gemma":0.00013060143,"threshold_uncertainty_score":0.3161599},"labels":[],"label_agreement":null},{"id":"W4408377877","doi":"10.5267/j.ijiec.2025.1.005","title":"Research on workload balance problem of mixed model assembly line under parallel task strategy","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"Beijing Wuzi University; National Natural Science Foundation of China","keywords":"Workload; Task (project management); Balance (ability); Assembly line; Computer science; Line (geometry); Mathematical optimization; Operations research; Parallel computing; Operations management; Engineering; Mathematics; Medicine; Mechanical engineering; Physical medicine and rehabilitation; Systems engineering","score_opus":0.0584162640161402,"score_gpt":0.33530540304369894,"score_spread":0.27688913902755874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408377877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07518185,0.00015525128,0.9217553,0.0005112782,0.001211918,0.00016072774,0.000022515287,0.00007709069,0.0009240476],"genre_scores_gemma":[0.975691,0.00006405786,0.023713082,0.000014184732,0.0003929352,0.000007885408,0.000023582352,0.000027984133,0.00006528414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816704,0.000047105896,0.0008026562,0.00012845929,0.0006395851,0.00021517948],"domain_scores_gemma":[0.99810404,0.00046290222,0.0001701491,0.00012171121,0.0010695347,0.00007167936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005590983,0.00016463177,0.0002801135,0.0009844138,0.000040127885,0.00007545703,0.00045665752,0.00016757952,0.000004316151],"category_scores_gemma":[0.00017208878,0.00017225563,0.0001010303,0.0006524641,0.00002702839,0.00021103462,0.000045404737,0.00077052496,0.0000034621546],"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.000050350784,0.000077968536,0.00006357005,0.000015493397,0.00024626293,0.0000066056427,0.000040566047,0.9866491,0.0018902849,0.006897216,0.0012921548,0.0027704574],"study_design_scores_gemma":[0.0012070688,0.00008935774,0.00034588596,0.00077458366,0.000020002057,0.0000093396175,0.00005290161,0.994977,0.0011084245,0.0011341035,0.00016311336,0.0001182164],"about_ca_topic_score_codex":0.0000072436164,"about_ca_topic_score_gemma":0.0000025147308,"teacher_disagreement_score":0.9005092,"about_ca_system_score_codex":0.00030988944,"about_ca_system_score_gemma":0.0002991471,"threshold_uncertainty_score":0.70243806},"labels":[],"label_agreement":null},{"id":"W4408377896","doi":"10.5267/j.ijiec.2025.2.001","title":"Packing layout added value in sheet metal laser cutting operations considering raw material reuse","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Manufacturing Process and Optimization","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Reuse; Sheet metal; Raw material; Engineering drawing; Manufacturing engineering; Materials science; Process engineering; Computer science; Engineering; Mechanical engineering; Waste management","score_opus":0.018421230113429596,"score_gpt":0.2494245939341994,"score_spread":0.2310033638207698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408377896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7592556,0.00009605952,0.232513,0.0006493583,0.0066467966,0.00019229401,0.000030413843,0.00016916565,0.00044735396],"genre_scores_gemma":[0.9871508,0.000023015595,0.012112888,0.000039867227,0.0005869478,0.000007901856,0.000030825053,0.00002690357,0.000020855103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985851,0.000031080217,0.0007862041,0.00012235688,0.00028897528,0.00018625068],"domain_scores_gemma":[0.9993163,0.0001692585,0.000094488125,0.00011661273,0.00024484674,0.000058493282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031424456,0.00017810124,0.00025939714,0.000798796,0.000054365526,0.00025174234,0.00042520903,0.0001236064,0.000048512713],"category_scores_gemma":[0.00058542774,0.00019333848,0.00008874208,0.00029898537,0.00001602345,0.00044760926,0.00008502024,0.00041718732,0.0000022653082],"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.000018659144,0.00002510713,0.0001916864,0.00001527123,0.00017545624,0.000029518465,0.0002038053,0.9961467,0.00079921604,0.0008649348,0.00024910818,0.0012805662],"study_design_scores_gemma":[0.0015095032,0.000019920602,0.0002972931,0.0005764206,0.000041576364,0.00004300632,0.00008464434,0.9820422,0.013953784,0.00020682122,0.0010243356,0.00020047808],"about_ca_topic_score_codex":0.00003501927,"about_ca_topic_score_gemma":0.0000057540105,"teacher_disagreement_score":0.22789523,"about_ca_system_score_codex":0.0002313981,"about_ca_system_score_gemma":0.00012395746,"threshold_uncertainty_score":0.78841144},"labels":[],"label_agreement":null},{"id":"W4408378015","doi":"10.5267/j.ijiec.2025.1.006","title":"Pricing decisions in a closed loop supply chain with focus preference under the carbon trading schem","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Yangzhou University; National Natural Science Foundation of China","keywords":"Supply chain; Preference; Loop (graph theory); Focus (optics); Closed loop; Carbon fibers; Microeconomics; Economics; Business; Industrial organization; Computer science; Engineering; Mathematics; Control engineering; Physics; Marketing","score_opus":0.02751780584049088,"score_gpt":0.24194520953437484,"score_spread":0.21442740369388397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78037155,0.000091494236,0.20216118,0.012617014,0.0023191199,0.00047557414,0.0000015782924,0.000059545247,0.0019029537],"genre_scores_gemma":[0.9978911,0.0000072002904,0.0010200709,0.00023749894,0.00074708747,0.000013546987,0.0000043769396,0.00001638218,0.00006270465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864346,0.000017459928,0.00051645905,0.00014302928,0.00047484785,0.00020476563],"domain_scores_gemma":[0.9986239,0.0006063052,0.0002720168,0.000112288326,0.00037120038,0.000014290933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060469005,0.00015382114,0.0001856018,0.0012783903,0.00007220725,0.00032966153,0.0005813121,0.00006050929,0.0000135932705],"category_scores_gemma":[0.0006637398,0.00011858221,0.0000665064,0.0010573601,0.000027209757,0.0004230367,0.00012484848,0.0004640895,0.0000012566682],"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.00009554769,0.000076059834,0.0039830604,0.00000906248,0.00021313583,0.00007083065,0.0000979601,0.9491619,0.00008442071,0.027839087,0.0003648438,0.018004134],"study_design_scores_gemma":[0.0049456144,0.000039913593,0.012995257,0.0015251809,0.00013029142,0.000025398207,0.0024884045,0.96337014,0.00016466346,0.0053109536,0.008684504,0.00031965604],"about_ca_topic_score_codex":0.0003283759,"about_ca_topic_score_gemma":0.00007204663,"teacher_disagreement_score":0.21751958,"about_ca_system_score_codex":0.00032066953,"about_ca_system_score_gemma":0.00016681738,"threshold_uncertainty_score":0.48356423},"labels":[],"label_agreement":null},{"id":"W4408378018","doi":"10.5267/j.ijiec.2025.2.003","title":"A hybrid artificial bee colony algorithm with an iterated local search mechanism for distributed no-wait flowshop problems with preventive maintenance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Mechanism (biology); Iterated function; Iterated local search; Preventive maintenance; Computer science; Mathematical optimization; Local search (optimization); Algorithm; Artificial intelligence; Engineering; Mathematics; Reliability engineering","score_opus":0.015708254781799012,"score_gpt":0.24903422165151262,"score_spread":0.2333259668697136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022120794,0.000014635872,0.9754355,0.0003461754,0.0013162858,0.00036254612,0.0002563412,0.00013009213,0.000017613038],"genre_scores_gemma":[0.7021091,0.000007906539,0.29647803,0.000047333302,0.00086832605,0.00005784863,0.0003151503,0.000058101927,0.000058213966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.000027880313,0.00053992623,0.00017671495,0.0003872563,0.00024152447],"domain_scores_gemma":[0.9973664,0.00017414587,0.00012229529,0.000080918166,0.0021377986,0.00011843602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025392207,0.00020947018,0.0002638231,0.00040783448,0.00007596825,0.00019377629,0.00030975064,0.000093986746,0.000010942669],"category_scores_gemma":[0.00012528565,0.00018526003,0.0000748415,0.00035895465,0.000039642473,0.00029903575,0.000020528696,0.0004289522,0.0000020700525],"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.00020078037,0.00009219836,0.000006686496,0.000013198539,0.0005260156,0.000033168348,0.00008807694,0.98853713,0.0001846663,0.0016456514,0.00022300039,0.008449401],"study_design_scores_gemma":[0.0024194126,0.00043102272,0.000016593127,0.00051330344,0.00006471983,0.00009894825,0.00009490058,0.99325705,0.0023117831,0.00032427878,0.00027054938,0.0001974692],"about_ca_topic_score_codex":0.000009968187,"about_ca_topic_score_gemma":0.0000044611315,"teacher_disagreement_score":0.6799883,"about_ca_system_score_codex":0.00027836926,"about_ca_system_score_gemma":0.00026466252,"threshold_uncertainty_score":0.7554684},"labels":[],"label_agreement":null},{"id":"W4408378111","doi":"10.5267/j.ijiec.2025.1.001","title":"Technology licensing contracts in supply chains with carbon cap-and-trade and vertical shareholding","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Intellectual Property and Patents","field":"Business, Management and Accounting","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":"Science Foundation of Ministry of Education of China; Yunnan University; Ministry of Education of the People's Republic of China; Yunnan University of Finance and Economics; National Natural Science Foundation of China","keywords":"Supply chain; Business; Industrial organization; International trade; Marketing","score_opus":0.048486812345121574,"score_gpt":0.22959261635665346,"score_spread":0.18110580401153187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907401,0.00011646912,0.0026236412,0.00542335,0.0006471187,0.00007952576,8.081039e-7,0.0000213192,0.00034765032],"genre_scores_gemma":[0.9991539,0.000007994471,0.0002142301,0.00023131595,0.00037489424,0.0000012375738,0.0000020881494,0.0000071967715,0.000007154662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938804,0.0000047478675,0.00027181636,0.00008577841,0.00013992094,0.00010972502],"domain_scores_gemma":[0.9996381,0.000111593195,0.00006794711,0.00002812754,0.00014301817,0.000011230615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014230987,0.000086441505,0.00014159599,0.0008612237,0.00003369069,0.0001333689,0.00011120978,0.000077688564,0.0000040609248],"category_scores_gemma":[0.00042425588,0.000074431846,0.000017974813,0.0003064918,0.000030220852,0.0002525193,0.000052188407,0.0003385482,4.715112e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012843296,0.00043977608,0.14831369,0.0001228034,0.0012376512,0.0008676484,0.000955265,0.6563984,0.0086595295,0.09762735,0.0009948243,0.08309873],"study_design_scores_gemma":[0.0059677307,0.00009317999,0.026583528,0.0027441452,0.00011823186,0.00025335036,0.00039235942,0.955931,0.00092191156,0.0008394531,0.005803961,0.0003511692],"about_ca_topic_score_codex":0.00010197282,"about_ca_topic_score_gemma":0.00001562519,"teacher_disagreement_score":0.29953256,"about_ca_system_score_codex":0.000047894337,"about_ca_system_score_gemma":0.000039751358,"threshold_uncertainty_score":0.30352426},"labels":[],"label_agreement":null},{"id":"W4408378137","doi":"10.5267/j.ijiec.2025.3.002","title":"Age of information-aware deep reinforcement learning for efficient cloud resource scheduling in dynamic environments","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"IoT and Edge/Fog Computing","field":"Computer Science","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":"Cloud computing; Reinforcement learning; Reinforcement; Scheduling (production processes); Computer science; Resource (disambiguation); Artificial intelligence; Engineering; Operations management; Computer network; Structural engineering; Operating system","score_opus":0.011882753831835444,"score_gpt":0.2490968094531764,"score_spread":0.23721405562134096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048044838,0.000029173343,0.9454642,0.00041741022,0.0058235507,0.00013955434,3.409262e-7,0.000017572642,0.00006334746],"genre_scores_gemma":[0.9788945,0.0000034375626,0.020584293,0.000043909386,0.0004204972,0.0000043956175,0.000021180602,0.000005727038,0.000022113743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985036,0.00002698714,0.00085699384,0.00009338622,0.0003575907,0.00016142646],"domain_scores_gemma":[0.99891436,0.00037964268,0.00039711097,0.000087735716,0.00017821451,0.00004293038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050715747,0.000109889246,0.00018980209,0.0008420103,0.00005616029,0.00010599001,0.0006464914,0.000073273775,7.707814e-7],"category_scores_gemma":[0.0004439683,0.00011883344,0.00010864593,0.00034346434,0.00001540063,0.00029049497,0.00015934088,0.00033518992,0.0000011682798],"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.000021314763,0.000029079009,0.00014235366,0.000009491618,0.00006911815,0.000005720657,0.00050636195,0.98571306,0.00012673253,0.001486643,0.000048373564,0.011841738],"study_design_scores_gemma":[0.0014244989,0.000057573518,0.00044452207,0.00035535631,0.000008752922,0.000009909865,0.00006561534,0.99099517,0.00022782788,0.00012277892,0.0062006614,0.00008736259],"about_ca_topic_score_codex":0.0000056691374,"about_ca_topic_score_gemma":2.3154891e-7,"teacher_disagreement_score":0.9308496,"about_ca_system_score_codex":0.00028611466,"about_ca_system_score_gemma":0.00012998332,"threshold_uncertainty_score":0.4845887},"labels":[],"label_agreement":null},{"id":"W4408378168","doi":"10.5267/j.ijiec.2025.2.005","title":"Research on the optimization of supply chain decisions for green agricultural products based on farmers' risk preferences and disaster year subsidies","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Agricultural Systems and Practices","field":"Agricultural and Biological Sciences","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":"Yunnan Provincial Department of Education; National Natural Science Foundation of China; National Science Foundation","keywords":"Subsidy; Supply chain; Business; Agriculture; Natural resource economics; Agricultural economics; Economics; Marketing; Market economy; Geography","score_opus":0.08367531947478174,"score_gpt":0.30658722178141246,"score_spread":0.22291190230663072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848647,0.000044964938,0.0010794043,0.012822622,0.00061049004,0.00031349531,0.000095957505,0.000007902024,0.00016042827],"genre_scores_gemma":[0.9989013,0.000025209294,0.00048459138,0.000020244994,0.0004828726,0.000010707486,0.000022699931,7.135388e-7,0.00005166375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990323,0.0001241791,0.00029693072,0.00010288918,0.00035310062,0.000090610236],"domain_scores_gemma":[0.995239,0.0037138646,0.00022227937,0.000025510284,0.0007696556,0.000029683666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006630137,0.000078890225,0.000117880816,0.00007635692,0.00014023184,0.00008984585,0.00024381484,0.00005853151,0.0000144122005],"category_scores_gemma":[0.0012987639,0.000026082884,0.000058289763,0.00032923135,0.000032336877,0.000115148854,0.00002826343,0.00023971447,5.6304646e-7],"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.0003328357,0.0001437667,0.002534774,0.0000069270045,0.00018882881,0.0000010065024,0.00024542463,0.96152216,0.0021900078,0.0044600046,0.003916592,0.024457697],"study_design_scores_gemma":[0.006512976,0.0070586964,0.6085741,0.00620616,0.00036685856,0.000046158115,0.025253346,0.29841083,0.007646246,0.0032524848,0.035544813,0.0011273003],"about_ca_topic_score_codex":0.000118390075,"about_ca_topic_score_gemma":0.000024530562,"teacher_disagreement_score":0.66311127,"about_ca_system_score_codex":0.000032279768,"about_ca_system_score_gemma":0.000024656858,"threshold_uncertainty_score":0.15548354},"labels":[],"label_agreement":null},{"id":"W4408378481","doi":"10.5267/j.ijiec.2025.1.003","title":"Scheduling of jobs and autonomous mobile robots: Towards the realization of line-less assembly systems","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Realization (probability); Scheduling (production processes); Mobile robot; Robot; Assembly line; Computer science; Engineering; Operations management; Artificial intelligence; Mechanical engineering; Mathematics","score_opus":0.028060529121773536,"score_gpt":0.2700780228710844,"score_spread":0.24201749374931086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1474781,0.0007815421,0.84831506,0.00010019777,0.003061694,0.00011887169,0.000017609736,0.000040077346,0.000086836364],"genre_scores_gemma":[0.9874007,0.00010823198,0.012130436,0.000006804958,0.00031155106,0.000005707911,0.000010130797,0.000014524535,0.000011920068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882543,0.000026724243,0.0007334344,0.00006749684,0.0002641968,0.000082704995],"domain_scores_gemma":[0.9987084,0.00024091432,0.00024520967,0.000079030455,0.00068924826,0.00003716187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034139262,0.000106795844,0.00023125786,0.0003997096,0.000027798304,0.000060833176,0.00025641333,0.00009859143,0.000002084628],"category_scores_gemma":[0.00027442467,0.00009336097,0.000069917405,0.0003337228,0.000028528964,0.00013195648,0.000031351512,0.00023510093,1.8318924e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009461934,0.000020326088,0.00015196121,0.000026954647,0.00024144903,0.0000016414527,0.00017536826,0.98892,0.00034674202,0.0035803935,0.000039189636,0.00648651],"study_design_scores_gemma":[0.00067077705,0.000039018578,0.00022996156,0.00044842594,0.00004817905,0.000024192657,0.0003259701,0.9965329,0.0014303619,0.000050888608,0.00012815362,0.000071156624],"about_ca_topic_score_codex":0.000031690222,"about_ca_topic_score_gemma":7.234934e-7,"teacher_disagreement_score":0.8399226,"about_ca_system_score_codex":0.00008107032,"about_ca_system_score_gemma":0.00013287939,"threshold_uncertainty_score":0.38071498},"labels":[],"label_agreement":null},{"id":"W4408378518","doi":"10.5267/j.ijiec.2025.2.004","title":"Optimization decision of supply chain data governance involving data governance service providers","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Cloud Data Security Solutions","field":"Computer Science","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":"Corporate governance; Business; Supply chain; Service provider; Data governance; Process management; Service (business); Operations management; Operations research; Data quality; Marketing; Engineering; Finance","score_opus":0.04415668828715067,"score_gpt":0.2914755235143603,"score_spread":0.24731883522720963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027316655,0.00048404938,0.98352724,0.008178345,0.0040166504,0.00017039226,0.00079713913,0.0000469468,0.000047547623],"genre_scores_gemma":[0.59867245,0.00027519822,0.39964354,0.00027806388,0.0005976437,0.000003180477,0.00049522053,0.000019713734,0.000014971964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975215,0.000051734998,0.0010054908,0.00037548091,0.0008623687,0.00018340016],"domain_scores_gemma":[0.996073,0.0008573987,0.0007990393,0.0011594783,0.0010304794,0.00008061844],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00079258555,0.00016877058,0.00027145824,0.00027776862,0.00007414083,0.0002658573,0.0067685153,0.000108496824,0.000011723233],"category_scores_gemma":[0.0033099025,0.0001847937,0.000056843124,0.001063479,0.000031932734,0.0028139895,0.0022793908,0.00042868138,0.0000022645424],"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.000027673259,0.00010863731,0.00021888691,0.00001254785,0.00017252383,0.000014082337,0.00012594102,0.9468428,0.000111881454,0.0228661,0.01539073,0.01410818],"study_design_scores_gemma":[0.001183461,0.000026467267,0.0009929703,0.0008395481,0.000030848627,0.000042371994,0.000024333136,0.9906843,0.000081716724,0.00047948761,0.005477767,0.00013677591],"about_ca_topic_score_codex":0.00020814818,"about_ca_topic_score_gemma":0.00006687034,"teacher_disagreement_score":0.59594077,"about_ca_system_score_codex":0.00025754372,"about_ca_system_score_gemma":0.00081873464,"threshold_uncertainty_score":0.9986054},"labels":[],"label_agreement":null},{"id":"W4408378575","doi":"10.5267/j.ijiec.2025.3.001","title":"Research on collaborative innovation decision making of new energy vehicle industry chain considering carbon quota sharing contract","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","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":"Huaiyin Normal University; National Natural Science Foundation of China","keywords":"Business; Industrial organization; Technology innovation; Chain (unit)","score_opus":0.03466995924420847,"score_gpt":0.3266755104334373,"score_spread":0.29200555118922883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366328,0.00025995605,0.058951095,0.00045797363,0.0025239896,0.00011817014,0.000012322731,0.00005581945,0.0009878647],"genre_scores_gemma":[0.99718297,0.000018795045,0.0020159867,0.00004791703,0.0006829498,0.0000027388116,0.0000045089178,0.000022911257,0.000021204916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815446,0.000031740616,0.0008695491,0.0001374795,0.00059478614,0.0002119587],"domain_scores_gemma":[0.9977947,0.0006185469,0.00021886609,0.00011490659,0.0012021139,0.000050876853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171045,0.0001593764,0.00027430712,0.0017971414,0.000049843144,0.000101700774,0.0003962643,0.00030102645,0.000016380203],"category_scores_gemma":[0.0006498273,0.00016767363,0.000060841463,0.0018943751,0.000025685447,0.00018603129,0.000062903884,0.0012600801,3.8472817e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009004223,0.000023276456,0.0008533342,0.0000068052195,0.00025438482,0.00001841288,0.00014965703,0.93069655,0.0041157925,0.016648756,0.0013856362,0.045757327],"study_design_scores_gemma":[0.0031580918,0.00024078095,0.003716663,0.002818772,0.00003620847,0.00004680275,0.0003197529,0.9561303,0.024119835,0.005789973,0.0033317572,0.0002910101],"about_ca_topic_score_codex":0.000041035233,"about_ca_topic_score_gemma":0.0000054434227,"teacher_disagreement_score":0.06055018,"about_ca_system_score_codex":0.00041416808,"about_ca_system_score_gemma":0.0003804751,"threshold_uncertainty_score":0.68375325},"labels":[],"label_agreement":null},{"id":"W4408378603","doi":"10.5267/j.ijiec.2025.2.002","title":"A study of dual-channel supply chain pricing decisions considering consumer privacy concerns in the context of blockchain","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Blockchain; Dual (grammatical number); Context (archaeology); Supply chain; Business; Channel (broadcasting); Marketing; Telecommunications; Computer security; Computer science","score_opus":0.03897292199353658,"score_gpt":0.2968383069069887,"score_spread":0.2578653849134521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75940317,0.0001244906,0.237167,0.0023001858,0.00061787176,0.00033397667,0.000009096125,0.000020826335,0.000023387302],"genre_scores_gemma":[0.9962866,0.000012619913,0.0035534357,0.0000598981,0.00006111988,0.000017313943,0.0000011367132,0.0000053313524,0.0000025498246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981487,0.00009673738,0.0010451328,0.00015734351,0.00041571519,0.00013639858],"domain_scores_gemma":[0.99690485,0.0016760025,0.000503239,0.0002764594,0.0006074546,0.000032004027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085553894,0.00012815381,0.00032374344,0.0009358783,0.000055241275,0.000044804554,0.0011675495,0.00010344943,0.0000018062284],"category_scores_gemma":[0.0010132004,0.00011012265,0.00009401222,0.00085891184,0.00006866803,0.00009657837,0.00023157833,0.00049828645,3.2579158e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083341525,0.0021159882,0.00879313,0.000014298232,0.0009479484,0.00017371062,0.02552397,0.70011556,0.0010659079,0.22915559,0.0007646226,0.031245958],"study_design_scores_gemma":[0.017781349,0.0011254674,0.017917506,0.002240821,0.0001950901,0.00064698403,0.024040312,0.90891844,0.00759766,0.016976394,0.0018817603,0.0006781952],"about_ca_topic_score_codex":0.000121015786,"about_ca_topic_score_gemma":0.000029547235,"teacher_disagreement_score":0.23688343,"about_ca_system_score_codex":0.00007717832,"about_ca_system_score_gemma":0.00024253127,"threshold_uncertainty_score":0.44906715},"labels":[],"label_agreement":null},{"id":"W4408378738","doi":"10.5267/j.ijiec.2025.1.004","title":"Multiperiod scheduling optimization of postearthquake emergency supply based on real-time environmental information","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Safety and Risk Management","field":"Business, Management and Accounting","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":"Scheduling (production processes); Computer science; Emergency rescue; Operations research; Mathematical optimization; Engineering; Operations management; Mathematics; Medicine; Medical emergency","score_opus":0.008647446307650844,"score_gpt":0.21411875846505826,"score_spread":0.2054713121574074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39887628,0.00002954513,0.58656996,0.003635843,0.00696861,0.00046415193,0.000045023684,0.00009281562,0.0033177352],"genre_scores_gemma":[0.9934084,0.00002072329,0.0057455017,0.00012461407,0.00055668934,0.0000027634615,0.000110402354,0.000008447622,0.000022469207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987886,0.000008648156,0.00066261,0.000069135,0.0003798998,0.00009111485],"domain_scores_gemma":[0.99913687,0.00006965644,0.00046844064,0.000070519694,0.00024307438,0.000011437996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000248595,0.000110655164,0.00014524617,0.0009297625,0.00005490859,0.00008141186,0.00024335417,0.0000637788,0.00018557909],"category_scores_gemma":[0.00022605166,0.00011099731,0.000111420006,0.00027328247,0.000013684856,0.0008618348,0.000050428087,0.00015541435,0.00001926896],"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.00010182113,0.00008743003,0.0016106969,0.000012648514,0.000093324736,0.0000024043832,0.000028701164,0.99036455,0.0001714276,0.0016478571,0.00034203072,0.005537085],"study_design_scores_gemma":[0.0014900094,0.00002626352,0.0059874565,0.00022502635,0.000047199555,0.0000012352135,0.00007680436,0.98920965,0.00006984558,0.000047377696,0.0027246848,0.000094465075],"about_ca_topic_score_codex":0.000034980563,"about_ca_topic_score_gemma":4.9469793e-7,"teacher_disagreement_score":0.59453213,"about_ca_system_score_codex":0.00008432355,"about_ca_system_score_gemma":0.000046106456,"threshold_uncertainty_score":0.4526339},"labels":[],"label_agreement":null},{"id":"W4408378905","doi":"10.5267/j.ijiec.2025.1.007","title":"Flexible job-shop scheduling problem with the number of workers dependent processing times","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Job shop scheduling; Flow shop scheduling; Scheduling (production processes); Job shop; Mathematical optimization; Computer science; Operations research; Operations management; Industrial engineering; Mathematics; Engineering; Schedule","score_opus":0.01498482121729295,"score_gpt":0.26505270492140814,"score_spread":0.2500678837041152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057406902,0.00020355567,0.9387256,0.0010188719,0.0012059881,0.00010631893,0.0000050193553,0.00009799217,0.0012297631],"genre_scores_gemma":[0.8831836,0.000010514623,0.1163223,0.000020298008,0.0003189083,0.0000052230303,0.0000042293145,0.000020818592,0.00011410111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895805,0.00001536193,0.0004640849,0.0000763085,0.0003642164,0.00012200326],"domain_scores_gemma":[0.99898136,0.00016668843,0.00016224378,0.00006889966,0.0005773966,0.000043388412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024591995,0.00012703618,0.00017394978,0.00027408966,0.000050191058,0.00011062946,0.0003402006,0.000075266915,0.000021897993],"category_scores_gemma":[0.0000815081,0.00009753366,0.00006837926,0.00044349697,0.000029713561,0.00019103214,0.000026773425,0.00038913198,0.0000020836092],"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.000024738674,0.000018860086,0.0012579752,0.000013437036,0.00029288037,0.0000047035655,0.00014989695,0.98934877,0.00007128571,0.00060252816,0.00020005136,0.008014893],"study_design_scores_gemma":[0.0013590289,0.000022228918,0.0002739309,0.00091447023,0.000077216944,0.00008518652,0.00042856162,0.9944497,0.0017455068,0.00012667445,0.00037053926,0.00014695582],"about_ca_topic_score_codex":0.0000051601173,"about_ca_topic_score_gemma":7.1526733e-7,"teacher_disagreement_score":0.8257767,"about_ca_system_score_codex":0.00010269558,"about_ca_system_score_gemma":0.00019813293,"threshold_uncertainty_score":0.3977307},"labels":[],"label_agreement":null},{"id":"W4410888292","doi":"10.5267/j.ijiec.2025.4.005","title":"MILP model for simultaneous batching, production and distribution operations in single-stage multiproduct batch plants","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Process Optimization and Integration","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":"Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Universidad Tecnológica Nacional","keywords":"Production (economics); Single stage; Stage (stratigraphy); Mathematical optimization; Distribution (mathematics); Computer science; Process engineering; Engineering; Mathematics; Economics; Microeconomics; Biology","score_opus":0.02512004611295398,"score_gpt":0.26703779180259285,"score_spread":0.24191774568963886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13625313,0.00011323191,0.8605153,0.0007134467,0.0019833634,0.00023169682,0.00010279579,0.000060590766,0.000026447638],"genre_scores_gemma":[0.9890242,0.000067254565,0.010328866,0.000022223501,0.00028934202,0.000016297075,0.00013845603,0.000015158801,0.000098182485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990312,0.000012344587,0.00054311426,0.00012738977,0.0001675571,0.00011840627],"domain_scores_gemma":[0.9992364,0.00014960075,0.00006938602,0.00005816804,0.00044400353,0.00004242946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019905313,0.00013177152,0.00016345839,0.0003983094,0.00004959011,0.00010612539,0.0001459763,0.00009789711,0.0000026068565],"category_scores_gemma":[0.0014134938,0.00014064701,0.00004586318,0.00019874005,0.000015690319,0.0003982784,0.00001554057,0.00025250847,3.6471573e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038055576,0.000054962886,0.000072237766,0.000014533714,0.00006304245,0.0000020766897,0.00025416882,0.99060875,0.0021511365,0.0007243885,0.0004972975,0.0055193393],"study_design_scores_gemma":[0.00082213624,0.000027052452,0.000047577585,0.0002360987,0.000013627433,0.000013899957,0.00006941507,0.9954171,0.0023575434,0.000100633304,0.00078337995,0.000111492016],"about_ca_topic_score_codex":0.000008474032,"about_ca_topic_score_gemma":0.000035140725,"teacher_disagreement_score":0.8527711,"about_ca_system_score_codex":0.00026363204,"about_ca_system_score_gemma":0.000093100665,"threshold_uncertainty_score":0.5735419},"labels":[],"label_agreement":null},{"id":"W4410888397","doi":"10.5267/j.ijiec.2025.5.001","title":"Entire-process scheduling optimization strategy for railway emergency logistics based on two-stage multi-objective programming","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Simulation and Modeling Applications","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":"Scheduling (production processes); Computer science; Process (computing); Stage (stratigraphy); Mathematical optimization; Operations research; Operations management; Engineering; Mathematics","score_opus":0.06018382696571139,"score_gpt":0.34967003595952245,"score_spread":0.28948620899381106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005450389,0.00003340718,0.9906785,0.00016385758,0.003052356,0.00031171125,0.000044487744,0.0001423717,0.00012295802],"genre_scores_gemma":[0.92176914,0.000006928509,0.07763885,0.000024219291,0.00039212353,0.000041905227,0.00006140632,0.000028422546,0.00003700763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879944,0.0000151818185,0.0006458801,0.00013299644,0.0002521584,0.00015434172],"domain_scores_gemma":[0.9984778,0.0002484224,0.00017346648,0.00008902764,0.00094505714,0.000066200904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023780038,0.00016425,0.00017578468,0.0006057464,0.00007908721,0.00009007009,0.0002617524,0.000102815626,0.000017886965],"category_scores_gemma":[0.00047203965,0.00018277834,0.00012801136,0.00034893487,0.000013560973,0.00014340246,0.000010659594,0.00030293426,0.0000012121099],"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.00003274148,0.000082851926,0.00008512327,0.00001681917,0.00014776704,0.0000014606579,0.00004742406,0.992322,0.000097594464,0.0019132604,0.0000641004,0.0051888265],"study_design_scores_gemma":[0.00213856,0.000042867923,0.000032867883,0.00015837749,0.000042840253,0.0000017049521,0.00008085976,0.9963768,0.00035665618,0.000093035014,0.00053443084,0.00014100314],"about_ca_topic_score_codex":0.00000389341,"about_ca_topic_score_gemma":0.0000014870809,"teacher_disagreement_score":0.9163188,"about_ca_system_score_codex":0.00020224793,"about_ca_system_score_gemma":0.00015838648,"threshold_uncertainty_score":0.74534845},"labels":[],"label_agreement":null},{"id":"W4410888418","doi":"10.5267/j.ijiec.2025.4.003","title":"The non-stationary stochastic lot-sizing with joint replenishment under (R, S) policy and the heuristic","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Sizing; Heuristic; Joint (building); Mathematical optimization; Computer science; Operations research; Mathematics; Engineering; Chemistry; Structural engineering","score_opus":0.019338951671507617,"score_gpt":0.2406457536634685,"score_spread":0.22130680199196087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0532515,0.0004634019,0.82679856,0.10821762,0.006753045,0.00084584637,0.0000059449667,0.00007872375,0.0035853721],"genre_scores_gemma":[0.9966791,0.000015018502,0.00021480082,0.0010759842,0.0018216036,0.000012866756,0.0000055722367,0.000010851699,0.00016415621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899393,0.000013336212,0.00041183765,0.00009305363,0.00036537342,0.00012243948],"domain_scores_gemma":[0.9987791,0.00045573126,0.0002833635,0.00008712453,0.00038177508,0.000012915075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054365786,0.00011109685,0.00013109858,0.0004062645,0.00020796261,0.0004554334,0.00028916984,0.00002664011,0.000007217684],"category_scores_gemma":[0.0005447896,0.00006690023,0.00006271382,0.00030439766,0.000089950205,0.00027819263,0.00012402478,0.00022608756,0.000003075977],"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.00015794087,0.000028576658,0.0000774572,0.000009315523,0.0003571974,0.000008477216,0.00006771956,0.7247884,0.000008464118,0.26609594,0.0032532082,0.0051472755],"study_design_scores_gemma":[0.01077668,0.000058632355,0.0050304,0.00094146904,0.00029273392,0.00006648839,0.0017975683,0.9004299,0.000015581494,0.021860888,0.058407795,0.0003218584],"about_ca_topic_score_codex":0.000104767816,"about_ca_topic_score_gemma":0.000006551739,"teacher_disagreement_score":0.9434276,"about_ca_system_score_codex":0.00012542846,"about_ca_system_score_gemma":0.00011568141,"threshold_uncertainty_score":0.43917546},"labels":[],"label_agreement":null},{"id":"W4410888925","doi":"10.5267/j.ijiec.2025.3.004","title":"Performance investigation of metaheuristics for the just-in-time single-machine under different time windows and setup restriction","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Metaheuristic; Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.02595319939458575,"score_gpt":0.24402573787954762,"score_spread":0.2180725384849619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50589967,0.00021621512,0.49113798,0.0006759811,0.0017911473,0.00018285634,0.000028115503,0.000038772985,0.000029240191],"genre_scores_gemma":[0.990244,0.00007262472,0.009353824,0.000021217065,0.00023803079,0.0000055582095,0.000024045932,0.000013258267,0.000027456763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916166,0.000016099028,0.00048118134,0.00006145981,0.00020066975,0.00007892398],"domain_scores_gemma":[0.9989238,0.00059583946,0.0001543075,0.000051888575,0.00024218485,0.00003199257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022399068,0.000099485675,0.0001628526,0.0003932647,0.00003174168,0.000049346785,0.00017017665,0.000070313035,0.0000046778187],"category_scores_gemma":[0.00027132465,0.0000836991,0.000050431667,0.00023219528,0.000023441138,0.00011226985,0.000019336143,0.00020940408,5.1394085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022905479,0.000017196431,0.00081187015,0.000010549289,0.0001523675,4.688878e-7,0.000058089077,0.99565995,0.0009123497,0.00017882456,0.00011517274,0.0020602706],"study_design_scores_gemma":[0.0010526002,0.000044389082,0.0042924574,0.00018216732,0.000062780695,0.000008297478,0.000018153149,0.99277616,0.0013319814,0.000094550574,0.000070972426,0.00006552103],"about_ca_topic_score_codex":0.0000029192563,"about_ca_topic_score_gemma":4.6678235e-7,"teacher_disagreement_score":0.4843443,"about_ca_system_score_codex":0.000108794404,"about_ca_system_score_gemma":0.00004077917,"threshold_uncertainty_score":0.34131503},"labels":[],"label_agreement":null},{"id":"W4410889165","doi":"10.5267/j.ijiec.2025.3.006","title":"A metaheuristic algorithm co-driven by Q-learning and a learning mechanism for the distributed blocking flowshop scheduling problem with preventive maintenance and sequence-dependent setup times","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Blocking (statistics); Q-learning; Metaheuristic; Scheduling (production processes); Computer science; Preventive maintenance; Sequence (biology); Job shop scheduling; Mathematical optimization; Mechanism (biology); Algorithm; Artificial intelligence; Engineering; Mathematics; Computer network; Reinforcement learning; Reliability engineering","score_opus":0.01123967558057845,"score_gpt":0.2516554425985393,"score_spread":0.24041576701796083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413173,0.00029023073,0.98700565,0.00043317757,0.00046279727,0.00023367963,0.00005800976,0.00008806599,0.0000152007615],"genre_scores_gemma":[0.7545427,0.00016349686,0.24480985,0.000020474869,0.00023732736,0.00003488464,0.000060713755,0.000035536734,0.00009503319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990111,0.000039487546,0.00039656274,0.00014168711,0.0002455013,0.0001656631],"domain_scores_gemma":[0.9985441,0.0007189665,0.00016498425,0.00004018657,0.0004680318,0.000063726024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638779,0.00016840736,0.00021280641,0.00020927767,0.00017870383,0.00021594774,0.00016421749,0.00008030639,0.000004376074],"category_scores_gemma":[0.00042830757,0.00013770502,0.000051887717,0.00016959687,0.00003469367,0.0001533095,0.00003306536,0.00065115135,2.990015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002101785,0.000011473543,0.00007729577,0.000013304006,0.00060244714,0.0000072237895,0.00018838674,0.9881569,0.00028650532,0.0006129459,0.000048249483,0.009974214],"study_design_scores_gemma":[0.001448547,0.00007509471,0.000017890334,0.00041435275,0.00012628408,0.0000951157,0.00040246395,0.9962739,0.00040730782,0.00017153984,0.00043067263,0.00013685731],"about_ca_topic_score_codex":0.0000062927807,"about_ca_topic_score_gemma":6.1563924e-7,"teacher_disagreement_score":0.7431295,"about_ca_system_score_codex":0.00011337001,"about_ca_system_score_gemma":0.00007360024,"threshold_uncertainty_score":0.5615448},"labels":[],"label_agreement":null},{"id":"W4410889336","doi":"10.5267/j.ijiec.2025.4.004","title":"An adaptive local search for large-scale parallel machine scheduling in textile production with release dates and sequence-dependent setup time","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Scheduling (production processes); Sequence (biology); Scale (ratio); Computer science; Production (economics); Job shop scheduling; Time sequence; Textile; Mathematical optimization; Engineering; Algorithm; Mathematics; Materials science; Embedded system; Economics; Composite material; Chemistry; Physics","score_opus":0.02045996562868604,"score_gpt":0.2728342139177948,"score_spread":0.25237424828910876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628068,0.00009574393,0.8523645,0.00035532512,0.00061439193,0.00016711061,0.00004514982,0.000059866405,0.000017253711],"genre_scores_gemma":[0.8834751,0.000018943912,0.11611421,0.000012836656,0.00027178778,0.000010269649,0.00005364101,0.000019866498,0.000023348777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911183,0.000022821001,0.00036244246,0.00013555694,0.00022185149,0.00014549796],"domain_scores_gemma":[0.9993321,0.000119948214,0.00006111518,0.00006501875,0.00034798885,0.000073873394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032561115,0.00012382907,0.00016868685,0.00047791927,0.00004381475,0.0000803067,0.00016246823,0.00008034849,0.0000071369404],"category_scores_gemma":[0.000078380544,0.00012091665,0.000031539155,0.0002378937,0.000020628318,0.00030781917,0.000017385571,0.00034978165,0.0000010020434],"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.00013676105,0.000055789664,0.00026665945,0.000008060344,0.00010972832,0.000009179259,0.00020907368,0.9939441,0.0002673172,0.00026285986,0.000021605267,0.0047088712],"study_design_scores_gemma":[0.0017107207,0.00010966058,0.00012935865,0.00024207056,0.000021518003,0.000047494494,0.00029378754,0.9964558,0.00077471987,0.000060481183,0.000042257027,0.000112149246],"about_ca_topic_score_codex":0.000012210894,"about_ca_topic_score_gemma":0.000008697335,"teacher_disagreement_score":0.7371944,"about_ca_system_score_codex":0.00016470197,"about_ca_system_score_gemma":0.000112996575,"threshold_uncertainty_score":0.49308378},"labels":[],"label_agreement":null},{"id":"W4410889364","doi":"10.5267/j.ijiec.2025.4.002","title":"Game-theoretic modeling of sustainable intermodal freight transportation: Optimal pricing and energy efficiency strategies under government intervention and fuzzy uncertainty","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","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":"Fuzzy logic; Intervention (counseling); Economic interventionism; Government (linguistics); Computer science; Environmental economics; Mathematical optimization; Microeconomics; Business; Operations research; Economics; Engineering; Mathematics; Artificial intelligence","score_opus":0.009648863964692332,"score_gpt":0.22570594708834502,"score_spread":0.21605708312365268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27453595,0.00022863195,0.7242283,0.00006582637,0.0004912547,0.000038026203,0.000012244476,0.000018854935,0.00038084507],"genre_scores_gemma":[0.9984996,0.0000614625,0.0012708599,0.0000066461143,0.00010916249,0.0000026317878,0.000011001454,0.000010429615,0.000028219754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896765,0.000013527514,0.00057167944,0.00008630557,0.00024383001,0.00011703445],"domain_scores_gemma":[0.9994295,0.000114672024,0.00011698004,0.000044020926,0.00024934675,0.000045476285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018883574,0.000120325734,0.00018676085,0.00022345032,0.000026731874,0.00009127119,0.00012330853,0.00007139181,0.00000881102],"category_scores_gemma":[0.000049042883,0.00012105334,0.00006165163,0.00011943376,0.00004138672,0.00019738101,0.00002288346,0.00019175168,3.277315e-8],"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.000024599913,0.00002622679,0.00006848816,0.00004675835,0.0001397717,0.000014584429,0.00018721743,0.8591709,0.000066241366,0.13783862,0.000014121278,0.0024024413],"study_design_scores_gemma":[0.0008585578,0.00006888187,0.0002983357,0.00038078247,0.000061011997,0.000020998905,0.0013107859,0.99317026,0.00014206638,0.0034368397,0.00014980254,0.000101666876],"about_ca_topic_score_codex":0.000057639783,"about_ca_topic_score_gemma":0.000006284908,"teacher_disagreement_score":0.7239636,"about_ca_system_score_codex":0.00013778354,"about_ca_system_score_gemma":0.000059634956,"threshold_uncertainty_score":0.49364117},"labels":[],"label_agreement":null},{"id":"W4410889392","doi":"10.5267/j.ijiec.2025.5.004","title":"Regulation strategy of an integrated energy system considering the dynamic change of electricity price in the spot market in the day-ahead and in the middle of the day","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Power Generation Technologies","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":"State Grid Corporation of China","keywords":"Electricity; Electricity market; Spot contract; Spot market; Economics; Present day; Industrial organization; Engineering; Electrical engineering; Financial economics","score_opus":0.028837924443163066,"score_gpt":0.24962417322148814,"score_spread":0.22078624877832506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9040247,0.00041038086,0.09345861,0.0010308861,0.0005657637,0.00035334408,0.000022723332,0.000019330668,0.00011422302],"genre_scores_gemma":[0.99957144,0.000032813903,0.00029285302,0.00002016392,0.00005103751,0.000017351558,0.0000048914785,0.000007096216,0.000002349935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852103,0.0003120048,0.000678923,0.00007365521,0.00031176582,0.00010263669],"domain_scores_gemma":[0.9981821,0.001227016,0.0002572274,0.00016873519,0.00015737535,0.0000075014345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015116741,0.000112902475,0.00018268403,0.00041265573,0.000030027442,0.000036902074,0.00068599544,0.00008707664,0.0000013608064],"category_scores_gemma":[0.00046967185,0.000061057304,0.000047346548,0.0009288202,0.00005989065,0.00016920619,0.00003264947,0.00046686575,2.2508958e-8],"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.000019634223,0.000036470145,0.00028346636,0.000017763796,0.000046487217,0.0000036711945,0.0017176195,0.9824837,0.0016850883,0.006750652,0.000029898907,0.0069255587],"study_design_scores_gemma":[0.0006822161,0.00004031158,0.024760433,0.00053753384,0.000020265092,0.000047097063,0.004448861,0.96581274,0.0027454558,0.0006840095,0.00014485355,0.00007619364],"about_ca_topic_score_codex":0.000110280926,"about_ca_topic_score_gemma":0.00022744264,"teacher_disagreement_score":0.0955467,"about_ca_system_score_codex":0.00013561378,"about_ca_system_score_gemma":0.00007342089,"threshold_uncertainty_score":0.24898444},"labels":[],"label_agreement":null},{"id":"W4410889409","doi":"10.5267/j.ijiec.2025.4.009","title":"Evolutionary game analysis of green packaging supply chain cooperative development considering consumer preferences for traceability","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Traceability; Supply chain; Business; Supply chain management; Manufacturing engineering; Biochemical engineering; Computer science; Industrial organization; Engineering; Marketing","score_opus":0.02813264559969827,"score_gpt":0.26319481102042425,"score_spread":0.23506216542072597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7740495,0.00013657176,0.22017483,0.0025662924,0.002060129,0.000629462,0.000030901672,0.00007171948,0.00028057737],"genre_scores_gemma":[0.9948791,0.0000023591394,0.0045143897,0.000108438755,0.00035589575,0.000023750088,0.000054421853,0.000009935135,0.000051692885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842215,0.000017986878,0.0008479762,0.00016439779,0.00038099996,0.00016646525],"domain_scores_gemma":[0.9971204,0.000541106,0.00047129352,0.00008899561,0.0017614492,0.000016802232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006381269,0.00015566892,0.00035802004,0.002047092,0.0000716808,0.00012985956,0.0003536759,0.000063417094,0.00004811138],"category_scores_gemma":[0.00093475176,0.00015759352,0.00018049881,0.0010234306,0.000040294595,0.0004700889,0.00011852594,0.0001792838,0.0000010099329],"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.00011917944,0.00014096538,0.045898676,0.00008195848,0.0042898715,0.000009470916,0.00029196087,0.9269692,0.00010388514,0.013457649,0.00073314377,0.007904096],"study_design_scores_gemma":[0.0032876753,0.00004022327,0.060897205,0.0005259823,0.0013597561,0.0000036952936,0.0021426126,0.9113917,0.00030012982,0.0027639116,0.01690462,0.00038248804],"about_ca_topic_score_codex":0.0001775185,"about_ca_topic_score_gemma":0.000039004575,"teacher_disagreement_score":0.2208296,"about_ca_system_score_codex":0.00025740013,"about_ca_system_score_gemma":0.00027649957,"threshold_uncertainty_score":0.64264774},"labels":[],"label_agreement":null},{"id":"W4410889576","doi":"10.5267/j.ijiec.2025.4.001","title":"Authorization or outsourcing? Investigating remanufacturing decisions under carbon trading policies and remanufacturing subsidies considering trade-in programs","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","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":"National Office for Philosophy and Social Sciences; Science and Technology Commission of Shanghai Municipality","keywords":"Remanufacturing; Subsidy; Outsourcing; Business; Industrial organization; Authorization; Environmental economics; Commerce; Manufacturing engineering; Economics; Marketing; Computer science; Engineering; Market economy; Computer security","score_opus":0.14422389164710062,"score_gpt":0.2966481295631427,"score_spread":0.15242423791604207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699309,0.0002610451,0.02425712,0.00342429,0.0016112264,0.0001370462,0.00001609609,0.0000344683,0.00032779222],"genre_scores_gemma":[0.9965264,0.00009831065,0.002873923,0.00008961816,0.00036328344,0.0000051382694,0.000007138569,0.000018616834,0.000017536096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845916,0.0000141796845,0.0010658553,0.00018306493,0.000066569664,0.00021114603],"domain_scores_gemma":[0.9988937,0.0004712711,0.00044237034,0.0000738106,0.000041125233,0.000077727396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048372181,0.00015909797,0.00036106474,0.0011231821,0.00007855401,0.00021944374,0.00019743637,0.000120916695,0.0000068388563],"category_scores_gemma":[0.0009291459,0.00017654127,0.00007681615,0.00023494934,0.000038332346,0.00028155564,0.00006815707,0.00036547778,6.138191e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075650954,0.00008793735,0.0526867,0.00004541831,0.00039455254,0.000032826887,0.005781108,0.88001764,0.00021047994,0.05256348,0.000051528645,0.008052703],"study_design_scores_gemma":[0.006205839,0.0002014234,0.08385438,0.00445994,0.0000768979,0.0003678296,0.00404708,0.84383667,0.003793826,0.050000332,0.002112925,0.0010428552],"about_ca_topic_score_codex":0.00019651507,"about_ca_topic_score_gemma":0.000082411425,"teacher_disagreement_score":0.036180936,"about_ca_system_score_codex":0.0003227106,"about_ca_system_score_gemma":0.000060125305,"threshold_uncertainty_score":0.71991444},"labels":[],"label_agreement":null},{"id":"W4410889664","doi":"10.5267/j.ijiec.2025.4.007","title":"A dual-layer BOM change control model for efficiency improvement in ETO manufacturing","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Natural Science Foundation of Sichuan Province","keywords":"Dual (grammatical number); Dual layer; Layer (electronics); Manufacturing engineering; Control (management); Operations management; Engineering; Industrial engineering; Computer science; Materials science; Composite material; Artificial intelligence; Art","score_opus":0.03368169497014554,"score_gpt":0.27547492272985713,"score_spread":0.2417932277597116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02633262,0.00006732342,0.9705962,0.00034102245,0.0022588097,0.00026183476,0.000034392826,0.00005904401,0.000048738508],"genre_scores_gemma":[0.9877698,0.000021897718,0.011655191,0.00005752047,0.00040702394,0.000036992962,0.000011694193,0.000018157863,0.000021711481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.0000057984,0.00050772453,0.00009487084,0.0001772068,0.00016604654],"domain_scores_gemma":[0.99944085,0.00018896021,0.00009831365,0.000061055565,0.00016766947,0.00004315186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017633598,0.00013423085,0.00018650462,0.00054946874,0.00002713285,0.000051921517,0.00018010393,0.00008747879,0.0000024922851],"category_scores_gemma":[0.00015426015,0.00014232339,0.00008088783,0.00009748525,0.00000930384,0.0001849468,0.000019355328,0.00026235296,4.916244e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003222698,0.000032883658,0.000018310337,0.000013463071,0.00008821322,0.000005752224,0.00011439887,0.98976517,0.000285926,0.00084829534,0.00012732355,0.008668058],"study_design_scores_gemma":[0.002286222,0.000035678015,0.00011527466,0.00015563233,0.000022208324,0.000005006711,0.000016491516,0.99369305,0.0024832343,0.0006960816,0.00037758978,0.00011354983],"about_ca_topic_score_codex":0.000006128633,"about_ca_topic_score_gemma":0.0000028352233,"teacher_disagreement_score":0.96143717,"about_ca_system_score_codex":0.00028454763,"about_ca_system_score_gemma":0.000050838553,"threshold_uncertainty_score":0.580378},"labels":[],"label_agreement":null},{"id":"W4410889687","doi":"10.5267/j.ijiec.2025.4.010","title":"The calculation method of critical chain buffer based on GERT network and information entropy","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Fault Detection and Control Systems","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":"National Natural Science Foundation of China","keywords":"Buffer (optical fiber); Entropy (arrow of time); Computer science; Chain (unit); Mathematical optimization; Operations research; Mathematics; Physics; Thermodynamics","score_opus":0.010024394479330612,"score_gpt":0.2702105315096421,"score_spread":0.26018613703031146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051143416,0.00007778573,0.9884185,0.0016395637,0.0043626535,0.000100058925,0.000007368697,0.00003593811,0.00024377069],"genre_scores_gemma":[0.99712807,0.000007551548,0.0023902685,0.000061992774,0.00039189064,0.0000049618766,0.0000034764419,0.0000056878066,0.000006123441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907315,0.0000421663,0.000504591,0.00003776819,0.0002543114,0.000088022076],"domain_scores_gemma":[0.9986248,0.00090561376,0.00009222683,0.000052536976,0.00028788883,0.000036907415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041173524,0.000080435704,0.00013055968,0.0002553175,0.000049010992,0.00007999699,0.00012208802,0.00007173443,0.0000028879335],"category_scores_gemma":[0.00055536424,0.00006615332,0.00006654629,0.0001807485,0.000017602275,0.00019766422,0.000009849088,0.00022730911,7.9448097e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042641266,0.000007824743,0.000051541207,0.0000075400335,0.00008555093,8.5483146e-7,0.000030193632,0.96856993,0.00015731073,0.013624288,0.0005550918,0.016867226],"study_design_scores_gemma":[0.0008087263,0.000038061455,0.0006573195,0.00014791056,0.0000189476,0.000011232896,0.000020303636,0.98776954,0.00022535003,0.00016690623,0.010085943,0.000049767077],"about_ca_topic_score_codex":0.0000059180775,"about_ca_topic_score_gemma":6.738905e-7,"teacher_disagreement_score":0.9920137,"about_ca_system_score_codex":0.000090123016,"about_ca_system_score_gemma":0.00004599404,"threshold_uncertainty_score":0.2697654},"labels":[],"label_agreement":null},{"id":"W4410889885","doi":"10.5267/j.ijiec.2025.3.005","title":"A hybrid time series analysis-genetic algorithm-support vector machine model for enhanced landslide prediction","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Landslides and related hazards","field":"Environmental Science","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":"Chongqing Three Gorges University; Chongqing Municipal Education Commission; China Three Gorges University; Chinese Academy of Sciences","keywords":"Series (stratigraphy); Support vector machine; Genetic algorithm; Landslide; Time series; Algorithm; Computer science; Engineering; Artificial intelligence; Machine learning; Geology; Geotechnical engineering","score_opus":0.007334529041325079,"score_gpt":0.2294708327412103,"score_spread":0.2221363036998852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03137484,0.00001721457,0.9665791,0.0004929516,0.0010375417,0.000118646145,0.0001724748,0.000027742753,0.00017952261],"genre_scores_gemma":[0.94464034,0.000019784879,0.053683158,0.000055984958,0.0003700673,0.000011245988,0.00011932065,0.0000134721,0.0010866163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989974,0.000012123166,0.00046277425,0.00012091776,0.0002859315,0.00012086798],"domain_scores_gemma":[0.9995107,0.00007912574,0.00017141925,0.000064511056,0.00011133575,0.000062888794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001726682,0.00010759679,0.00019085339,0.0002761053,0.000053877873,0.000058010985,0.00023919837,0.00006831333,0.00014780079],"category_scores_gemma":[0.00009614438,0.00009417,0.00018834608,0.00025966956,0.00002067579,0.00018102105,0.000050931692,0.00018845432,0.000007945562],"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.000059756367,0.000039348313,0.00042533688,0.0000012628661,0.0007311454,0.0000071314057,0.000055924003,0.9865798,0.000724455,0.000035075962,0.0015111287,0.009829638],"study_design_scores_gemma":[0.0010545565,0.000080191676,0.001410016,0.00003163739,0.00028918285,0.000028761213,0.0000039293695,0.9938956,0.00080233905,0.00025122755,0.0020698563,0.00008273379],"about_ca_topic_score_codex":0.000011312808,"about_ca_topic_score_gemma":0.0000018221713,"teacher_disagreement_score":0.9132655,"about_ca_system_score_codex":0.0001919784,"about_ca_system_score_gemma":0.00007183658,"threshold_uncertainty_score":0.3840141},"labels":[],"label_agreement":null},{"id":"W4410889971","doi":"10.5267/j.ijiec.2025.4.006","title":"A game-theoretic model for renewable and conventional energy generators under tradable green certificate mechanism","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Smart Grid Energy Management","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":"Qinglan Project of Jiangsu Province of China; Yangzhou University; National Natural Science Foundation of China","keywords":"Renewable energy; Certificate; Mechanism (biology); Environmental economics; Economics; Microeconomics; Biochemical engineering; Computer science; Mathematical economics; Engineering; Physics; Electrical engineering","score_opus":0.04296534069602469,"score_gpt":0.24443885250590533,"score_spread":0.20147351180988066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01413845,0.00013815971,0.98207265,0.00070288905,0.0026489147,0.00007717134,0.000023483588,0.000067042536,0.00013126308],"genre_scores_gemma":[0.9890454,0.000053039752,0.009958907,0.000085128784,0.00048024,0.00002267216,0.000026894857,0.000028517683,0.00029918892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902993,0.000011723145,0.00046814964,0.00011336443,0.00022698105,0.00014983123],"domain_scores_gemma":[0.999415,0.00012982578,0.000083961866,0.00007087077,0.00023120147,0.00006917017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018808742,0.00014331233,0.00017872988,0.00049401284,0.00003731695,0.00008393323,0.0002349377,0.000087287415,0.000008238202],"category_scores_gemma":[0.00003981827,0.00015470826,0.00009914706,0.00015951264,0.000020543448,0.00015363107,0.000035643647,0.00013331154,4.0086272e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001819664,0.000018084054,0.000005926314,0.000011337517,0.00036972805,0.000002747883,0.000024053923,0.8534623,0.00072201417,0.14297162,0.0014886596,0.00090534537],"study_design_scores_gemma":[0.0011828805,0.000022003194,0.000014246761,0.00010561369,0.000060373506,0.000014922535,0.000016753886,0.9657757,0.002455749,0.027205551,0.003024898,0.000121279365],"about_ca_topic_score_codex":0.00002233418,"about_ca_topic_score_gemma":0.000005860326,"teacher_disagreement_score":0.974907,"about_ca_system_score_codex":0.00018405478,"about_ca_system_score_gemma":0.00008420497,"threshold_uncertainty_score":0.630882},"labels":[],"label_agreement":null},{"id":"W4410889974","doi":"10.5267/j.ijiec.2025.5.003","title":"Mixed traffic optimization considering road reservation travel based on the bi-level programming model","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Reservation; Computer science; Mathematical optimization; Programming paradigm; Traffic model; Transport engineering; Operations research; Engineering; Mathematics; Computer network","score_opus":0.09298425618787723,"score_gpt":0.30520583520289296,"score_spread":0.21222157901501573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032320496,0.000013644686,0.9558564,0.009391553,0.001724266,0.00021523041,0.000017022996,0.000059858856,0.00040154348],"genre_scores_gemma":[0.9515334,0.000009445679,0.047829237,0.00018769858,0.00029188403,0.000010635371,0.000042798212,0.000011716587,0.00008318046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985108,0.00009266764,0.00053646055,0.00011386978,0.0005994593,0.00014678568],"domain_scores_gemma":[0.998219,0.0005620588,0.0002857402,0.00007226156,0.0008026891,0.00005820978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085371855,0.000111502144,0.0001355831,0.0005251752,0.00026674528,0.00021246713,0.00032771027,0.00011871817,0.000017049839],"category_scores_gemma":[0.0013903988,0.0001012746,0.000098917044,0.0005292997,0.000050976043,0.00026513293,0.000007645469,0.00032285077,8.817984e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003512244,0.000053266587,0.00014018895,0.0000021264616,0.000059467096,0.0000033855106,0.00077288086,0.98044425,0.000014578384,0.010646209,0.00052066223,0.0073078335],"study_design_scores_gemma":[0.00078929955,0.000021990421,0.00051679736,0.00026676786,0.000029093848,0.0000011233999,0.0005458383,0.9968557,0.00005427725,0.00007851374,0.0007522724,0.00008833937],"about_ca_topic_score_codex":0.000046739155,"about_ca_topic_score_gemma":0.00002064673,"teacher_disagreement_score":0.91921294,"about_ca_system_score_codex":0.00019707899,"about_ca_system_score_gemma":0.0006456498,"threshold_uncertainty_score":0.41298583},"labels":[],"label_agreement":null},{"id":"W4410890159","doi":"10.5267/j.ijiec.2025.5.002","title":"Two-stage optimization of instant distribution of fresh products based on improved NSGA-III algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Instant; Stage (stratigraphy); Mathematical optimization; Algorithm; Optimization algorithm; Distribution (mathematics); Computer science; Mathematics; Biology; Food science","score_opus":0.013305770494514113,"score_gpt":0.24889770478540563,"score_spread":0.2355919342908915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410890159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00629346,0.000035683082,0.9912727,0.00011003177,0.0018227707,0.00013443756,0.00015015346,0.000050656134,0.00013014142],"genre_scores_gemma":[0.9147115,0.000018005172,0.084901184,0.000007898246,0.00017667428,0.0000032882501,0.00015410174,0.000015638681,0.000011715084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987954,0.000019168303,0.0007023381,0.00009637815,0.00028068418,0.000106070605],"domain_scores_gemma":[0.9986108,0.0001995563,0.00030013022,0.000106280364,0.00074569805,0.00003754552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019839739,0.0001377186,0.00023420056,0.00044665873,0.000023138467,0.000023745879,0.00021537482,0.00008351926,0.0000079042975],"category_scores_gemma":[0.00049177924,0.0001442259,0.00007646946,0.00033718182,0.00002777936,0.00014325403,0.000020118365,0.00026275072,1.7281442e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057288245,0.000070911796,0.000013153118,0.0000239417,0.00012059013,0.0000029662267,0.00002496001,0.9933292,0.0006750927,0.0014807878,0.00009189445,0.004109162],"study_design_scores_gemma":[0.0018233035,0.000081108454,0.00006917378,0.00028495071,0.000032931857,0.0000024812014,0.00002211296,0.9758118,0.021483267,0.000058816997,0.00023387591,0.00009617311],"about_ca_topic_score_codex":0.000014299119,"about_ca_topic_score_gemma":6.6937935e-7,"teacher_disagreement_score":0.90841806,"about_ca_system_score_codex":0.0002225627,"about_ca_system_score_gemma":0.00012838913,"threshold_uncertainty_score":0.58813614},"labels":[],"label_agreement":null},{"id":"W4410890245","doi":"10.5267/j.ijiec.2025.3.003","title":"To cooperate or not? The cooperation conditions of different new energy vehicle manufacturers on power battery under government subsid","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Electric Vehicles and Infrastructure","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":"China Postdoctoral Science Foundation","keywords":"Battery (electricity); Government (linguistics); Power (physics); Business; Automotive engineering; New energy; Environmental economics; Industrial organization; Transport engineering; Engineering; Economics; Mechanical engineering","score_opus":0.011391076513122756,"score_gpt":0.23199238067746775,"score_spread":0.22060130416434498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410890245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67005914,0.00004068358,0.3201399,0.005374019,0.0038729755,0.00015974627,0.00007312596,0.000044756485,0.00023565366],"genre_scores_gemma":[0.9985892,0.000015217678,0.00022135378,0.0007112677,0.00029147937,0.0000037752877,0.000009975696,0.0000152167795,0.00014247076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989299,0.000019863353,0.0004654374,0.00008211778,0.00038029742,0.00012234815],"domain_scores_gemma":[0.999307,0.0002522739,0.00008930028,0.00009106053,0.00018484145,0.000075570824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007155646,0.00014442162,0.00017892047,0.00019229908,0.00004542382,0.00007661166,0.0002905762,0.00007948628,0.000091224276],"category_scores_gemma":[0.00008245577,0.000101188096,0.00008061341,0.00024118574,0.000012916703,0.00010074627,0.000026689942,0.00029971646,0.0000018532401],"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.000101418416,0.000026335081,0.000030249475,0.0000021303633,0.00029605237,0.000004382434,0.000075848584,0.96997595,0.008412353,0.005902821,0.012476537,0.0026959274],"study_design_scores_gemma":[0.007832847,0.0012712078,0.026668068,0.0013151334,0.0002589115,0.0001318018,0.0003814371,0.6127574,0.31258884,0.00089545787,0.035024,0.0008749134],"about_ca_topic_score_codex":0.000010640813,"about_ca_topic_score_gemma":0.0000072250823,"teacher_disagreement_score":0.35721856,"about_ca_system_score_codex":0.0002880437,"about_ca_system_score_gemma":0.000106556414,"threshold_uncertainty_score":0.4126331},"labels":[],"label_agreement":null},{"id":"W4410890309","doi":"10.5267/j.ijiec.2025.4.008","title":"Multi-objective artificial bee colony algorithm for energy-efficient scheduling of unrelated parallel batch processing machines with flexible preventive maintenance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Preventive maintenance; Scheduling (production processes); Computer science; Mathematical optimization; Algorithm; Engineering; Reliability engineering; Artificial intelligence; Mathematics","score_opus":0.01704109568812054,"score_gpt":0.2678278917345583,"score_spread":0.2507867960464377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410890309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010056421,0.00020278314,0.98769385,0.00018438837,0.001509888,0.00018578168,0.000045113225,0.000091487505,0.000030291112],"genre_scores_gemma":[0.38003114,0.000011195003,0.6195443,0.000013382931,0.00028148503,0.000020359392,0.000022398768,0.000028081271,0.00004760529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986855,0.00002169074,0.0006900164,0.00013925653,0.00028624292,0.00017732341],"domain_scores_gemma":[0.9981058,0.00024386976,0.00027546418,0.000053741023,0.0012613427,0.000059773414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549034,0.00018307281,0.0002913506,0.0005519877,0.00006630707,0.00007378333,0.00025490252,0.00012320657,0.000004231447],"category_scores_gemma":[0.00022198842,0.00017344514,0.00011841375,0.00050937844,0.000038146234,0.0001415413,0.000024147435,0.00030485148,3.3205995e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008304895,0.0001068684,0.00003200438,0.000014638699,0.00044529504,0.0000050440512,0.00020028435,0.9624062,0.000418099,0.00069942436,0.000042770094,0.035546333],"study_design_scores_gemma":[0.0021962477,0.00007899823,0.000084462816,0.00073146593,0.00007517631,0.000020946529,0.0001531066,0.9935849,0.0026977959,0.00015090051,0.00007404489,0.00015196562],"about_ca_topic_score_codex":0.000011847968,"about_ca_topic_score_gemma":0.0000021826886,"teacher_disagreement_score":0.3699747,"about_ca_system_score_codex":0.00019156116,"about_ca_system_score_gemma":0.00028649028,"threshold_uncertainty_score":0.70728874},"labels":[],"label_agreement":null},{"id":"W4410890443","doi":"10.5267/j.ijiec.2025.5.005","title":"You are entitled to access the full text of this documentInteracting with the e-tailer’s service investment in the presence of a store brand: Selling model choice","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","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":"Investment (military); Service (business); Business; Advertising; Computer science; Microeconomics; Marketing; Economics; Political science","score_opus":0.045712406106506384,"score_gpt":0.3014342301945475,"score_spread":0.2557218240880411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410890443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972689,0.00008271277,0.011424905,0.014411311,0.00064365775,0.00035543813,0.0000067531937,0.000009413062,0.00037685136],"genre_scores_gemma":[0.9992401,0.0000031730292,0.0001935654,0.0003312817,0.00017457009,0.000015455831,0.0000023954026,0.000007657702,0.00003177133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988728,0.000022703665,0.00045354053,0.000089655594,0.00045414164,0.00010713454],"domain_scores_gemma":[0.99805695,0.0005545321,0.0005407742,0.000117600546,0.0007228498,0.0000072910607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054673536,0.00010901626,0.00016979514,0.00034509655,0.000075576136,0.00022874714,0.00092143123,0.000026769152,0.00001706863],"category_scores_gemma":[0.00040588982,0.00006209271,0.000065825254,0.0006657603,0.000026103631,0.00046073901,0.0002019844,0.0003173459,0.0000011666209],"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.00010840492,0.00008489041,0.02915462,0.000036064546,0.00029854733,0.000005031926,0.0013505134,0.9638817,0.00033956757,0.0017666911,0.0010056699,0.0019683249],"study_design_scores_gemma":[0.0045388495,0.00005622981,0.046479292,0.004270316,0.0007314513,0.000023893968,0.0061146254,0.91661304,0.00043891976,0.00030325848,0.020025186,0.00040495163],"about_ca_topic_score_codex":0.00048634066,"about_ca_topic_score_gemma":0.0004996017,"teacher_disagreement_score":0.047268648,"about_ca_system_score_codex":0.000055001023,"about_ca_system_score_gemma":0.00007366904,"threshold_uncertainty_score":0.25320673},"labels":[],"label_agreement":null},{"id":"W4413872150","doi":"10.5267/j.ijiec.2025.6.002","title":"Switch-off policies in job-shop systems including energy price variabilit","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Smart Grid Energy Management","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":"Energy (signal processing); Job shop; Environmental economics; Business; Economics; Computer science; Labour economics; Industrial organization; Mathematics; Statistics; Flow shop scheduling; Embedded system; Job shop scheduling","score_opus":0.02159059099406922,"score_gpt":0.2553796295431288,"score_spread":0.2337890385490596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22646183,0.0008778511,0.74116164,0.0012442465,0.023918038,0.0001750776,0.000013374838,0.00024879986,0.005899147],"genre_scores_gemma":[0.99773157,0.00007698367,0.0009277851,0.0000369501,0.0010964563,0.000012893953,0.000006202825,0.000024503355,0.000086642685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984521,0.000031626496,0.000824021,0.00011167849,0.00037139773,0.00020913742],"domain_scores_gemma":[0.99908006,0.00036359538,0.0001164751,0.00011261086,0.0002625749,0.00006470844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037305435,0.00017437864,0.00026353946,0.0013264562,0.000029201901,0.00013960633,0.00048765214,0.00011293789,0.000009118372],"category_scores_gemma":[0.0003075479,0.00019138893,0.0000896669,0.0006401292,0.000014212173,0.00025714454,0.0001006653,0.00035670842,0.0000019987924],"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.00000973964,0.000026952803,0.0009050763,0.0000121700305,0.00030169295,0.000025999643,0.000093174494,0.9692334,0.00032169372,0.025251744,0.0018938541,0.0019245353],"study_design_scores_gemma":[0.0011921738,0.000022462049,0.0018853497,0.00055183563,0.000027960512,0.00003621123,0.00011280762,0.95630515,0.00024796638,0.00025297416,0.039172765,0.00019234933],"about_ca_topic_score_codex":0.000101258716,"about_ca_topic_score_gemma":0.000007502326,"teacher_disagreement_score":0.77126974,"about_ca_system_score_codex":0.0007304009,"about_ca_system_score_gemma":0.00010148063,"threshold_uncertainty_score":0.78046143},"labels":[],"label_agreement":null},{"id":"W4413872209","doi":"10.5267/j.ijiec.2025.6.001","title":"An enhanced dung beetle optimization algorithm based-on multi-strategies for solving global optimization problems","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","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":"National Natural Science Foundation of China","keywords":"Optimization algorithm; Dung beetle; Mathematical optimization; Computer science; Optimization problem; Algorithm; Mathematics; Ecology; Biology","score_opus":0.03418458907752006,"score_gpt":0.327242333226351,"score_spread":0.2930577441488309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000549403,0.000025699044,0.99540484,0.0010330937,0.002859204,0.00039098397,0.000038577175,0.000108586406,0.00008407494],"genre_scores_gemma":[0.06294017,0.000009954959,0.93640864,0.00012871169,0.00038120057,0.000032403408,0.000064168686,0.000016135851,0.000018644296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979509,0.00007322099,0.0007816025,0.00029015302,0.0006653021,0.00023878721],"domain_scores_gemma":[0.99674195,0.0004105864,0.00037543618,0.00021601497,0.002125837,0.00013020077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063573243,0.00020028098,0.00024773856,0.0007544909,0.00013288949,0.0008077542,0.0011328289,0.00014235932,0.000015699747],"category_scores_gemma":[0.00081235054,0.00020989375,0.0001278677,0.0008116473,0.000028506878,0.0011104112,0.000071358634,0.00027765235,0.000001187399],"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.000022301534,0.00019275282,0.000009322298,0.000007987046,0.00008983396,0.000005063659,0.00005714945,0.9760392,0.00006182543,0.004622609,0.00015142144,0.018740585],"study_design_scores_gemma":[0.0022773931,0.00019502634,0.000022045087,0.0002040725,0.00001865364,0.000010061847,0.000028913772,0.9964351,0.00025772708,0.00025328703,0.000136591,0.00016110585],"about_ca_topic_score_codex":0.00001067078,"about_ca_topic_score_gemma":8.5120246e-7,"teacher_disagreement_score":0.06288523,"about_ca_system_score_codex":0.00037218988,"about_ca_system_score_gemma":0.0008919557,"threshold_uncertainty_score":0.85592186},"labels":[],"label_agreement":null},{"id":"W4413872224","doi":"10.5267/j.ijiec.2025.6.010","title":"Corporate marketing based on improved depth-weighted k-mean arithmetic and improved extreme gradient boosting tree","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Customer churn and segmentation","field":"Business, Management and Accounting","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":"Gradient boosting; Weighted arithmetic mean; Mathematics; Arithmetic; Tree (set theory); Statistics; Computer science; Artificial intelligence; Combinatorics","score_opus":0.034954549597292106,"score_gpt":0.23502514898609758,"score_spread":0.20007059938880548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7592794,0.00010354521,0.22578816,0.0043935296,0.00745002,0.00050306314,0.000011655336,0.00015977668,0.0023108874],"genre_scores_gemma":[0.994964,0.0000034890234,0.0033859145,0.00043441556,0.0011141412,0.0000052448318,0.000031015104,0.000018490524,0.000043302927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876964,0.000020992238,0.0005977511,0.00016463827,0.00028621312,0.00016077117],"domain_scores_gemma":[0.9984253,0.00035544735,0.0006057639,0.000072360046,0.0005139857,0.000027153512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060777634,0.00017164697,0.00019900456,0.0010854241,0.00009856358,0.00038151117,0.00022136129,0.00007227047,0.000016027847],"category_scores_gemma":[0.0006384375,0.00016849485,0.00009670435,0.00043123894,0.000023689157,0.00040944136,0.000058927388,0.00032340654,0.0000025986308],"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.0018677339,0.0007159772,0.02207605,0.0001885519,0.00108807,0.000170765,0.00020532207,0.4149018,0.025437113,0.008978629,0.0031597363,0.52121025],"study_design_scores_gemma":[0.0029192783,0.000031143067,0.00953727,0.00043316252,0.00008087667,0.000009295363,0.000072661256,0.9850356,0.0001661589,0.00025934947,0.0012952496,0.00015993234],"about_ca_topic_score_codex":0.000050478626,"about_ca_topic_score_gemma":0.000017983954,"teacher_disagreement_score":0.5701338,"about_ca_system_score_codex":0.00014249017,"about_ca_system_score_gemma":0.00007944435,"threshold_uncertainty_score":0.6871021},"labels":[],"label_agreement":null},{"id":"W4413872235","doi":"10.5267/j.ijiec.2025.6.007","title":"An auxiliary caching strategy for mobile cache networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Caching and Content Delivery","field":"Computer Science","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":"Government of Jiangsu Province","keywords":"Cache; Computer science; Cache invalidation; Smart Cache; Cache algorithms; Computer network; CPU cache","score_opus":0.030998510189378384,"score_gpt":0.29573596224032855,"score_spread":0.2647374520509502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044219296,0.00016219355,0.95052207,0.0003909786,0.004463809,0.000116515206,0.000007446896,0.00006174573,0.00005597683],"genre_scores_gemma":[0.9925764,0.0000075855646,0.0064146137,0.00010552119,0.00083291676,0.000009938117,0.000010559538,0.000007257511,0.00003520161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900496,0.000036605335,0.00044896267,0.00013838752,0.0002294306,0.00014165656],"domain_scores_gemma":[0.9987565,0.00036326377,0.00017115474,0.00013166845,0.0005024169,0.00007496179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004109972,0.00010936574,0.00015833843,0.00039625276,0.00007533972,0.0003001278,0.0009364691,0.000084699226,0.0000018222959],"category_scores_gemma":[0.00013696414,0.000110373345,0.00013917149,0.00020922435,0.000010584744,0.00054918625,0.00005815968,0.000352989,5.2770565e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018141067,0.000046565878,0.00010944858,0.0000016037136,0.00013252493,0.000012175048,0.000054271906,0.95605963,0.0002835724,0.011488949,0.00053643965,0.03125666],"study_design_scores_gemma":[0.0008820077,0.00013277777,0.00010401728,0.000103981,0.000017865374,0.00004011219,0.000044975084,0.9967029,0.000082029626,0.00052185374,0.0012722902,0.00009519958],"about_ca_topic_score_codex":0.000026895928,"about_ca_topic_score_gemma":0.0000017210109,"teacher_disagreement_score":0.9483571,"about_ca_system_score_codex":0.00016675188,"about_ca_system_score_gemma":0.00029127556,"threshold_uncertainty_score":0.45008945},"labels":[],"label_agreement":null},{"id":"W4413872257","doi":"10.5267/j.ijiec.2025.6.009","title":"Performance analysis of an intelligent manufacturing cell with multi-resource collaboration","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Resource (disambiguation); Manufacturing engineering; Computer science; Knowledge management; Engineering; Business; Systems engineering","score_opus":0.014061507123340422,"score_gpt":0.24891725397546083,"score_spread":0.2348557468521204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5394661,0.000033982702,0.4596224,0.000043169366,0.00065035414,0.000049215956,0.000011589751,0.00004076971,0.0000824269],"genre_scores_gemma":[0.941951,0.000015395814,0.057831157,0.000010903394,0.00011887428,0.000002140782,0.000037121,0.000012638826,0.000020768139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904,0.00001575776,0.0005027583,0.000079263926,0.00027259672,0.00008961167],"domain_scores_gemma":[0.9991785,0.000096629934,0.0001588887,0.0000838241,0.0004261744,0.000055932094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016141363,0.00011408614,0.0002149577,0.0011831905,0.000026838125,0.00006365815,0.00024919046,0.00007072575,0.000012343196],"category_scores_gemma":[0.000040863233,0.00010969232,0.00007342853,0.00076448167,0.000014979105,0.00022607314,0.00001449782,0.00021612276,5.8554093e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027753413,0.0000529914,0.00047096596,0.000008240979,0.0008410167,0.000003725652,0.00022111752,0.9921305,0.00017804855,0.000032953056,0.000019956105,0.0060127284],"study_design_scores_gemma":[0.0007725693,0.000052982155,0.0012271506,0.00010228942,0.00024398135,0.000004869568,0.00019713186,0.9788666,0.018204734,0.0000013807926,0.0002335531,0.000092803915],"about_ca_topic_score_codex":0.000004332617,"about_ca_topic_score_gemma":0.0000032184587,"teacher_disagreement_score":0.40248492,"about_ca_system_score_codex":0.00012591876,"about_ca_system_score_gemma":0.00007913735,"threshold_uncertainty_score":0.44731233},"labels":[],"label_agreement":null},{"id":"W4413872281","doi":"10.5267/j.ijiec.2025.7.002","title":"Recall cost-time tradeoffs for remanufacturing shop lot streaming scheduling problem with non mixed production using an improved non-dominated sorting genetic algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Remanufacturing; Sorting; Computer science; Scheduling (production processes); Genetic algorithm; Mathematical optimization; Production (economics); Job shop scheduling; Flow shop scheduling; Sorting algorithm; Algorithm; Industrial engineering; Real-time computing; Operations research; Engineering; Manufacturing engineering; Mathematics; Computer network; Machine learning; Economics; Microeconomics","score_opus":0.018330680925257855,"score_gpt":0.2561280281782371,"score_spread":0.23779734725297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530315,0.00003090254,0.75182116,0.00009718678,0.0021596,0.00044538552,0.000011949491,0.00011686827,0.0000137704765],"genre_scores_gemma":[0.42405298,0.0000059406666,0.5748458,0.0000080410455,0.00095063716,0.000020755388,0.000041577638,0.000056140838,0.000018136885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981685,0.000025782678,0.0009336025,0.00025313292,0.0003195051,0.0002994556],"domain_scores_gemma":[0.99844474,0.00017250833,0.00033319453,0.0001274958,0.0007961186,0.00012596007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042253462,0.00028469725,0.00035451323,0.0007778053,0.00013062578,0.00022302773,0.00032552754,0.00017580135,0.000004248701],"category_scores_gemma":[0.00019708482,0.00029437494,0.000117110794,0.00041752783,0.000024455245,0.00048117523,0.000027452203,0.0005088154,6.6654263e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055461267,0.00006234865,0.000029641194,0.000027043812,0.00036639842,0.000009221479,0.0001996937,0.9411838,0.009580269,0.0000048105944,0.000011362058,0.048469927],"study_design_scores_gemma":[0.002267105,0.000115339084,0.00009251448,0.0007883529,0.00012650435,0.000103898434,0.00019100467,0.9773011,0.018684266,0.00002672051,0.000029918934,0.00027326122],"about_ca_topic_score_codex":0.000013134015,"about_ca_topic_score_gemma":0.0000021395385,"teacher_disagreement_score":0.17874983,"about_ca_system_score_codex":0.00041323077,"about_ca_system_score_gemma":0.00022372669,"threshold_uncertainty_score":0.9999508},"labels":[],"label_agreement":null},{"id":"W4413872284","doi":"10.5267/j.ijiec.2025.7.001","title":"Bayesian inference for zero-inflated negative binomial lindley model of overdispersed count data with excess zeros","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","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":"Count data; Negative binomial distribution; Bayesian probability; Statistics; Mathematics; Inference; Bayesian inference; Zero-inflated model; Econometrics; Zero (linguistics); Binomial (polynomial); Binomial distribution; Statistical inference; Quasi-likelihood; Poisson distribution; Computer science; Poisson regression; Artificial intelligence","score_opus":0.050390455601554265,"score_gpt":0.3227864682970722,"score_spread":0.27239601269551794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005917159,0.000019996447,0.99158686,0.0008059164,0.0012559912,0.00020877256,0.00011347705,0.000026106914,0.0000656882],"genre_scores_gemma":[0.5939793,0.000004425889,0.40578255,0.00004458176,0.00014860998,0.0000037435723,0.000013358439,0.0000072555235,0.00001616507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985495,0.00003693679,0.0006530552,0.00022079296,0.0003881672,0.00015155428],"domain_scores_gemma":[0.99743015,0.00068569416,0.00044199626,0.00028591976,0.0010785762,0.00007766588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047549335,0.00015887366,0.00030686447,0.00045895897,0.000049499275,0.00014947279,0.0016216406,0.00011201424,0.0000016517146],"category_scores_gemma":[0.0005563738,0.00013897519,0.0000848417,0.00035912584,0.000038527618,0.00070654764,0.00021256127,0.00031787928,1.9306893e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013035334,0.0000722394,0.00005987943,0.000009779951,0.00035259375,0.00000623528,0.00028380423,0.93224406,0.0010806646,0.050481822,0.00043040063,0.014848192],"study_design_scores_gemma":[0.0023301279,0.0001030054,0.000062434745,0.00032308022,0.00004396693,0.0000114527,0.00000991761,0.9865751,0.0017702306,0.00853356,0.00011182336,0.00012526108],"about_ca_topic_score_codex":0.000021019941,"about_ca_topic_score_gemma":0.0000024293543,"teacher_disagreement_score":0.58806217,"about_ca_system_score_codex":0.000109031906,"about_ca_system_score_gemma":0.00086299155,"threshold_uncertainty_score":0.56672436},"labels":[],"label_agreement":null},{"id":"W4413872293","doi":"10.5267/j.ijiec.2025.6.012","title":"Manufacturer encroachment in refurbished product supply chains under enhanced service levels: A game-theoretic analysis of partial and full encroachment","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Global trade and economics","field":"Economics, Econometrics and Finance","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":"Supply chain; Product (mathematics); Business; Service (business); Environmental economics; Industrial organization; Economics; Mathematics; Marketing","score_opus":0.047094328646526275,"score_gpt":0.25354488984718937,"score_spread":0.2064505612006631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950895,0.00024404621,0.04480693,0.0025068847,0.0010517823,0.00012634943,0.000111839254,0.000007455057,0.0002496844],"genre_scores_gemma":[0.9986859,0.00005201475,0.00095279445,0.00012564268,0.00013123507,0.0000053999383,0.000019352388,0.0000067389556,0.000020907226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985543,0.000014910553,0.0010209528,0.00019137425,0.000074369564,0.00014409365],"domain_scores_gemma":[0.99919343,0.000100392994,0.00043173452,0.00010261601,0.00011883589,0.00005300825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041484684,0.00012633926,0.0004273445,0.0011404753,0.000017981185,0.000062024505,0.00025580774,0.000078093864,0.000057238216],"category_scores_gemma":[0.00011623507,0.00014377548,0.00012755596,0.0005182358,0.000026309566,0.00015940082,0.000051653013,0.00022493143,0.0000022734766],"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.00006871737,0.00012041757,0.006955985,0.00001090554,0.00136714,0.0000035538267,0.0005137212,0.9262012,0.00018196642,0.06382766,0.000033209522,0.0007154797],"study_design_scores_gemma":[0.009005736,0.0002885523,0.36099228,0.0005181712,0.00060942833,0.00003633887,0.0006821358,0.5994074,0.0056625768,0.018872727,0.0031241407,0.0008005487],"about_ca_topic_score_codex":0.00009495048,"about_ca_topic_score_gemma":0.000022450096,"teacher_disagreement_score":0.3540363,"about_ca_system_score_codex":0.00025848616,"about_ca_system_score_gemma":0.000065985216,"threshold_uncertainty_score":0.5862994},"labels":[],"label_agreement":null},{"id":"W4413872301","doi":"10.5267/j.ijiec.2025.6.013","title":"Research on collaborative scheduling method for multi-robot tomato picking based on improved particle swarm optimization algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Particle swarm optimization; Computer science; Multi-swarm optimization; Metaheuristic; Swarm behaviour; Mathematical optimization; Scheduling (production processes); Algorithm; Robot; Artificial intelligence; Mathematics","score_opus":0.0691531646537556,"score_gpt":0.38619197058169846,"score_spread":0.31703880592794287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083593745,0.00002835386,0.9961031,0.0003379577,0.0022330806,0.00028036843,0.000034175777,0.00010451286,0.000042497268],"genre_scores_gemma":[0.29378173,0.0000068262543,0.70574903,0.000040890747,0.0003303024,0.000026738886,0.00002514433,0.000025225989,0.000014091941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987907,0.00005524074,0.00048492092,0.00014711938,0.00032054808,0.00020150593],"domain_scores_gemma":[0.9975298,0.0010991117,0.000117789044,0.00009383788,0.0010910011,0.000068430454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006043369,0.00015154954,0.00019338554,0.00068356015,0.000109782246,0.00013364364,0.000236161,0.00012042756,0.0000039908114],"category_scores_gemma":[0.00091416104,0.0001588423,0.00007650823,0.00047426502,0.00001823574,0.00014571847,0.00001982163,0.00047667712,0.000001008601],"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.00006807074,0.00007662115,0.0000035919186,0.000009265186,0.00012226019,0.000003805385,0.000053202748,0.98789805,0.000187213,0.0014283197,0.00007615508,0.010073417],"study_design_scores_gemma":[0.0021897028,0.00014237323,0.000015761554,0.000293125,0.000020360189,0.0000021444268,0.00008562598,0.9856385,0.011155485,0.0000870774,0.00024835198,0.00012149747],"about_ca_topic_score_codex":0.0000031446216,"about_ca_topic_score_gemma":5.9010983e-7,"teacher_disagreement_score":0.2929458,"about_ca_system_score_codex":0.00039004456,"about_ca_system_score_gemma":0.00014799104,"threshold_uncertainty_score":0.64774007},"labels":[],"label_agreement":null},{"id":"W4413872303","doi":"10.5267/j.ijiec.2025.8.006","title":"Quality gain-loss transmission in dam concrete construction: A CF-GERT-based approach","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Non-Destructive Testing Techniques","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":"National Natural Science Foundation of China","keywords":"Quality (philosophy); Transmission (telecommunications); Computer science; Civil engineering; Engineering; Reliability engineering; Telecommunications; Physics","score_opus":0.03479449812251603,"score_gpt":0.30057437205482834,"score_spread":0.2657798739323123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.126861,0.000082524595,0.86918354,0.00033772597,0.0015444417,0.0001529334,0.000015639176,0.00024458164,0.0015776292],"genre_scores_gemma":[0.6897567,0.0000065310837,0.30997443,0.000021623231,0.00020042276,0.000008043427,0.0000126650175,0.000017562495,0.0000020151656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984265,0.000061170096,0.0008528105,0.00013536478,0.0003556795,0.00016845492],"domain_scores_gemma":[0.99883485,0.00046747556,0.00015635231,0.000104474144,0.0003624342,0.0000743895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049220613,0.00018560988,0.00030353267,0.00084692566,0.000031297845,0.00007302634,0.00039014567,0.00016030158,0.000011439874],"category_scores_gemma":[0.00036747317,0.00020228539,0.00012626237,0.0005044308,0.00005794818,0.00020485894,0.000022848035,0.00066824054,7.855764e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070600974,0.000029642488,0.0031273598,0.000038906415,0.00020092254,0.000039126804,0.00009592205,0.96339726,0.0046792175,0.020959644,0.00030615012,0.007055273],"study_design_scores_gemma":[0.007973333,0.00013711269,0.0055523505,0.002244948,0.00008114302,0.0003770907,0.00014946968,0.9530623,0.009733062,0.018082429,0.001812125,0.00079463975],"about_ca_topic_score_codex":0.000019169247,"about_ca_topic_score_gemma":4.7038216e-7,"teacher_disagreement_score":0.56289566,"about_ca_system_score_codex":0.00041728318,"about_ca_system_score_gemma":0.00021770835,"threshold_uncertainty_score":0.82489586},"labels":[],"label_agreement":null},{"id":"W4413872308","doi":"10.5267/j.ijiec.2025.6.006","title":"The distributed flow shop problem under carbon quota constraints","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"Flow (mathematics); Mathematical optimization; Carbon fibers; Computer science; Environmental science; Business; Mathematics; Algorithm","score_opus":0.01557982499816315,"score_gpt":0.24722355988247627,"score_spread":0.2316437348843131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011642547,0.0002559758,0.9768594,0.0022537617,0.007929402,0.00012013663,0.00003709951,0.00015047428,0.0007511874],"genre_scores_gemma":[0.97329164,0.000056340064,0.025755797,0.000038097565,0.0007449919,0.000006744226,0.000033549855,0.000022665434,0.00005018688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.00002018539,0.00052941724,0.00007262964,0.00028861657,0.00014789021],"domain_scores_gemma":[0.99892825,0.00037234277,0.000094296585,0.000079652345,0.00046233798,0.0000631159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002471728,0.00012586017,0.0001419534,0.00023747847,0.00006703763,0.00017002408,0.000362579,0.000094698225,0.000009828584],"category_scores_gemma":[0.00025176033,0.00010719991,0.00008822384,0.0003212041,0.000045623376,0.00008776021,0.000028035896,0.00041816058,0.0000017837576],"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.000009314821,0.000014121321,0.00006934347,0.0000022741553,0.00031950133,0.0000065663635,0.00003590711,0.9847737,0.00004628041,0.0022906582,0.00070563564,0.011726675],"study_design_scores_gemma":[0.00093133317,0.000013765437,0.00011850447,0.00015278609,0.000029357627,0.000038427403,0.0001089611,0.99594015,0.00021844283,0.00036204714,0.001985895,0.00010030999],"about_ca_topic_score_codex":0.0000030214062,"about_ca_topic_score_gemma":0.0000013803234,"teacher_disagreement_score":0.96164906,"about_ca_system_score_codex":0.00019896447,"about_ca_system_score_gemma":0.00014936463,"threshold_uncertainty_score":0.4371485},"labels":[],"label_agreement":null},{"id":"W4413872340","doi":"10.5267/j.ijiec.2025.8.001","title":"Stochastic evolution of interaction-coupled value co-creation behavior of enterprises in high-technology industrial clusters under the perspective of multiple networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Collaboration in agile enterprises","field":"Business, Management and Accounting","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":"National Social Science Fund of China","keywords":"Perspective (graphical); Value (mathematics); Industrial engineering; Business; Materials science; Biochemical engineering; Computer science; Engineering; Artificial intelligence","score_opus":0.013781948111711895,"score_gpt":0.28000639750868395,"score_spread":0.26622444939697204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5617771,0.00004821056,0.43403652,0.0008411075,0.0029422913,0.00027859875,0.000011709835,0.000014776628,0.00004968311],"genre_scores_gemma":[0.99915963,0.0000028626541,0.00020516205,0.000017294626,0.0005701297,0.000014005378,0.000015137599,0.000010592969,0.000005159322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841446,0.000027741205,0.000986811,0.00011511758,0.00035471335,0.00010114368],"domain_scores_gemma":[0.9965261,0.0005633088,0.0012957547,0.000103029415,0.001503111,0.000008672051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032549733,0.00012815672,0.00029259265,0.0018327236,0.00003607098,0.00004931621,0.0003797256,0.00014036622,0.000019001911],"category_scores_gemma":[0.0014031666,0.00011926713,0.00010653409,0.0011214002,0.00009302744,0.00045193997,0.000087722794,0.00038570212,5.261697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028593573,0.00018423272,0.016569503,0.0000070564197,0.00019676166,0.0000016272859,0.0000686498,0.95907354,0.0006391692,0.022327557,0.000108224245,0.00053772685],"study_design_scores_gemma":[0.0062478697,0.000092105525,0.01716368,0.001348738,0.00027681974,0.000010602064,0.0043062004,0.96784073,0.00063271064,0.0018195432,0.00007906434,0.00018192692],"about_ca_topic_score_codex":0.0007809206,"about_ca_topic_score_gemma":0.000054655902,"teacher_disagreement_score":0.43738258,"about_ca_system_score_codex":0.00043515518,"about_ca_system_score_gemma":0.00020778336,"threshold_uncertainty_score":0.48635724},"labels":[],"label_agreement":null},{"id":"W4413872354","doi":"10.5267/j.ijiec.2025.6.004","title":"Research on the decision-making of remanufacturing transformation considering the standardization of recycler under carbon tax policy","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Recycling and Waste Management Techniques","field":"Environmental Science","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":"National Office for Philosophy and Social Sciences","keywords":"Remanufacturing; Standardization; Transformation (genetics); Business; Manufacturing engineering; Industrial organization; Accounting; Computer science; Engineering; Chemistry","score_opus":0.04461326132914136,"score_gpt":0.3509064593467372,"score_spread":0.30629319801759586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5504021,0.000013784539,0.4403841,0.00522214,0.0005560432,0.00021351798,0.0000052025107,0.000014146094,0.0031889428],"genre_scores_gemma":[0.9985004,0.000015577723,0.0013178403,0.000042054864,0.00010354628,0.0000027154297,7.155873e-7,0.0000057144252,0.000011410006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998557,0.0000858286,0.0005189436,0.00006823342,0.0006796999,0.00009034994],"domain_scores_gemma":[0.99830526,0.0011839106,0.00023664402,0.000106231455,0.00015487493,0.000013055698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013579931,0.00006783199,0.000111163434,0.00043155559,0.000075195916,0.00004481195,0.00037553767,0.00004875037,0.000016328482],"category_scores_gemma":[0.00067782565,0.000045195942,0.00006821929,0.00046108357,0.00007450199,0.00010805984,0.000078303165,0.000324246,4.792866e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003892488,0.000019509478,0.0001727045,0.0000029753005,0.00006319623,7.4051394e-7,0.00022161785,0.96979666,0.00047591582,0.007509575,0.00035261066,0.021345569],"study_design_scores_gemma":[0.003987246,0.0007092257,0.030700881,0.010672119,0.00018626917,0.000059493643,0.005136016,0.731397,0.10968279,0.09227373,0.014596021,0.00059923675],"about_ca_topic_score_codex":0.00008599917,"about_ca_topic_score_gemma":0.000006607844,"teacher_disagreement_score":0.4480983,"about_ca_system_score_codex":0.0002443969,"about_ca_system_score_gemma":0.000057744845,"threshold_uncertainty_score":0.1843037},"labels":[],"label_agreement":null},{"id":"W4413872384","doi":"10.5267/j.ijiec.2025.6.003","title":"Insight into bilateral efforts in green supply chain driven by manufacturers: A new dimension of coordination mechanisms","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Fundamental Research Funds for the Central Universities; Xidian University","keywords":"Supply chain; Dimension (graph theory); Business; Industrial organization; Manufacturing engineering; Chain (unit); Operations management; Process management; Engineering; Marketing; Mathematics; Physics","score_opus":0.0086050711316014,"score_gpt":0.22357826280789975,"score_spread":0.21497319167629836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6025573,0.00013287096,0.36927906,0.020462181,0.006077501,0.0008035162,0.00000906951,0.00008599987,0.00059250067],"genre_scores_gemma":[0.9969402,0.0000033406545,0.001951439,0.00027941476,0.00053821283,0.000005019252,0.000054359167,0.000016824091,0.00021120739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850875,0.000014455895,0.0007155877,0.00014865589,0.00045207667,0.00016045985],"domain_scores_gemma":[0.9989172,0.00010847331,0.00042581325,0.00008729493,0.00044033566,0.00002086826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034307645,0.0001654754,0.00025749844,0.0019206355,0.000035160414,0.0001329648,0.00040182655,0.00010261804,0.000051865918],"category_scores_gemma":[0.00022387433,0.00016719349,0.000101144324,0.00064221316,0.000016714033,0.0007422477,0.00016329471,0.00026828857,0.0000027272567],"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.00018333553,0.00020187108,0.0047448836,0.000084279374,0.00038473244,0.000098804114,0.00044546998,0.91533583,0.0035168917,0.03755386,0.010898671,0.026551377],"study_design_scores_gemma":[0.01672255,0.00019825363,0.0124210715,0.0027658232,0.00030411297,0.000026630622,0.0010356563,0.8206464,0.005881816,0.049592577,0.089429416,0.00097570923],"about_ca_topic_score_codex":0.001172534,"about_ca_topic_score_gemma":0.00003660969,"teacher_disagreement_score":0.39438286,"about_ca_system_score_codex":0.0003080495,"about_ca_system_score_gemma":0.00010620941,"threshold_uncertainty_score":0.68179524},"labels":[],"label_agreement":null},{"id":"W4413872414","doi":"10.5267/j.ijiec.2025.8.004","title":"Real-time rolling regulation model of integrated energy system based on model predictive control theory","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Power Systems and Technologies","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":"State Grid Corporation of China","keywords":"Model predictive control; Control theory (sociology); Energy (signal processing); Control (management); Computer science; Control engineering; Engineering; Mathematics; Artificial intelligence; Statistics","score_opus":0.01104383580850826,"score_gpt":0.21166736910286263,"score_spread":0.20062353329435437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017068114,0.00003173613,0.9802384,0.00007169282,0.0011231914,0.000089748624,0.00010667472,0.0002325061,0.0010379831],"genre_scores_gemma":[0.99542594,0.000005620309,0.0043694437,0.0000066664966,0.000116218645,0.0000082269125,0.000015184067,0.000019796646,0.000032922624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876744,0.00002988967,0.0006823123,0.00009239773,0.00031448636,0.00011347868],"domain_scores_gemma":[0.99882334,0.000305027,0.00021474545,0.0001099301,0.00051024574,0.000036685407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032166683,0.0001539911,0.00029740285,0.00085383205,0.000024981462,0.000034169938,0.00030350528,0.00017073602,0.0000024538497],"category_scores_gemma":[0.00018431281,0.00014624857,0.00012692007,0.00024123676,0.000020836516,0.00013516341,0.000015134106,0.00025766797,5.375152e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011484852,0.000024360532,0.000014326351,0.000012581276,0.00031724066,0.000002979597,0.00002858831,0.95966184,0.005327379,0.033131413,0.00022292083,0.0011415253],"study_design_scores_gemma":[0.0013187858,0.000049263093,0.000017637749,0.0008385688,0.000048570215,0.00000439328,0.000039748786,0.9936021,0.0030910391,0.00087231275,0.00002587297,0.00009170475],"about_ca_topic_score_codex":0.0000094021225,"about_ca_topic_score_gemma":2.7943383e-7,"teacher_disagreement_score":0.9783578,"about_ca_system_score_codex":0.0004131019,"about_ca_system_score_gemma":0.00019014046,"threshold_uncertainty_score":0.59638435},"labels":[],"label_agreement":null},{"id":"W4413872421","doi":"10.5267/j.ijiec.2025.8.005","title":"Ordering and financing strategies in electronic business platform financing with a loss averse retailer","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"National College Students Innovation and Entrepreneurship Training Program; National Social Science Fund of China","keywords":"Business; Finance","score_opus":0.013185881838242762,"score_gpt":0.20670272231051168,"score_spread":0.19351684047226891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97353923,0.00003205334,0.024519544,0.00026782116,0.0006492808,0.000064993445,9.0810374e-7,0.000017585067,0.00090855587],"genre_scores_gemma":[0.99911195,0.000012112918,0.00037636337,0.00007831576,0.00039383,0.000002038113,0.0000058262713,0.000009903279,0.000009657647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992568,4.9144444e-7,0.00036831733,0.000094281786,0.00011806874,0.00016205142],"domain_scores_gemma":[0.9994405,0.000060821203,0.00019715879,0.00004026188,0.0002525943,0.0000086784885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017442863,0.00011222723,0.00016803111,0.0006258802,0.000037277907,0.0006025554,0.00016055352,0.000067864865,0.000005618721],"category_scores_gemma":[0.00012634289,0.00010425265,0.000030485848,0.00037279754,0.000017438038,0.003282905,0.000060729544,0.00033012585,0.0000018107871],"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.000084602376,0.00002727932,0.004630227,0.00002684147,0.00007728393,0.00004726083,0.0000370709,0.9028694,0.000029027597,0.08673649,0.00006677191,0.0053677107],"study_design_scores_gemma":[0.013129447,0.00012168638,0.09947456,0.0047594607,0.00014729991,0.00033521527,0.0030130292,0.8185723,0.00010114126,0.03417879,0.025054496,0.0011126144],"about_ca_topic_score_codex":0.00013114329,"about_ca_topic_score_gemma":0.00011681676,"teacher_disagreement_score":0.09484433,"about_ca_system_score_codex":0.00013257167,"about_ca_system_score_gemma":0.00020394078,"threshold_uncertainty_score":0.58104557},"labels":[],"label_agreement":null},{"id":"W4413872432","doi":"10.5267/j.ijiec.2025.8.007","title":"Research on contract selection for collaborative innovation in China's photovoltaic industry supply chain from the perspective of supply-demand imbalance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Industrial Ecology","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":"Supply chain; Perspective (graphical); Industrial organization; China; Selection (genetic algorithm); Photovoltaic system; Business; Supply and demand; Supply chain management; Economics; Engineering; Marketing; Microeconomics; Computer science; Electrical engineering","score_opus":0.02576887645876444,"score_gpt":0.3268400645694122,"score_spread":0.3010711881106478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760539,0.00015033924,0.016686214,0.0029273962,0.0029269727,0.0007902763,0.00016904248,0.00003590314,0.000259976],"genre_scores_gemma":[0.99837446,0.000018366609,0.00053089333,0.0000365496,0.0009117692,0.00005629362,0.000027205018,0.000021160638,0.000023327195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981546,0.00014020313,0.00089652085,0.00015677273,0.00040556755,0.0002463545],"domain_scores_gemma":[0.9944241,0.002752819,0.00025868567,0.00009316539,0.0024365438,0.000034696714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013728103,0.00016329259,0.00031956006,0.0014660524,0.00006995728,0.000075422024,0.0004139508,0.0003888141,0.000024755034],"category_scores_gemma":[0.0032062104,0.00015310745,0.000069654496,0.002261817,0.00006394048,0.00020887498,0.00003318685,0.0017014395,6.585795e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036397538,0.00008752443,0.0049452987,0.0000058148034,0.00035335007,0.000007361318,0.00056881475,0.97021425,0.0021025182,0.017306281,0.0028022632,0.0012425731],"study_design_scores_gemma":[0.012989991,0.0008111468,0.097340114,0.0015812053,0.00008073565,0.000026485079,0.007849739,0.8415664,0.021931008,0.0114045525,0.0039906027,0.0004280287],"about_ca_topic_score_codex":0.0004128988,"about_ca_topic_score_gemma":0.00009114442,"teacher_disagreement_score":0.12864783,"about_ca_system_score_codex":0.0015315184,"about_ca_system_score_gemma":0.00079450145,"threshold_uncertainty_score":0.7392003},"labels":[],"label_agreement":null},{"id":"W4413872439","doi":"10.5267/j.ijiec.2025.8.002","title":"Environmental preference utility and evolutionary game of collaborative innovation of asymmetric technology enterprises based on complex networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","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":"Preference; Industrial organization; Business; Microeconomics; Game theory; Computer science; Economics; Environmental economics; Knowledge management","score_opus":0.028832685891976878,"score_gpt":0.242532338632011,"score_spread":0.21369965274003414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7156838,0.00008527054,0.28051838,0.0015129384,0.0012477784,0.0002099013,0.000032813226,0.000025306668,0.00068376726],"genre_scores_gemma":[0.9986668,0.0000059330246,0.0010126291,0.00007512298,0.00018362887,0.000002665271,0.00004606376,0.000004815589,0.0000023447742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989932,0.000008954477,0.00060872483,0.00008914413,0.00023276483,0.000067196306],"domain_scores_gemma":[0.998323,0.00013272118,0.0006110898,0.00005701514,0.00087173696,0.000004437527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019281355,0.00009459233,0.00017799115,0.0019589318,0.000029598576,0.000031844687,0.00017462851,0.00009549437,0.000019136309],"category_scores_gemma":[0.00040557815,0.00009553604,0.00002954655,0.001915975,0.0000745353,0.00034278003,0.00004969521,0.00019895972,3.5753123e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030721969,0.00031572607,0.0566115,0.00003466957,0.00017094561,0.0000026394264,0.000011689356,0.8554718,0.0012362268,0.06142033,0.00048812517,0.023929153],"study_design_scores_gemma":[0.0020074106,0.00007963605,0.23975472,0.000454079,0.00004752836,0.0000033639153,0.00008674672,0.7533337,0.0004973936,0.002132907,0.0014844385,0.00011811847],"about_ca_topic_score_codex":0.000009675573,"about_ca_topic_score_gemma":3.72075e-7,"teacher_disagreement_score":0.28298295,"about_ca_system_score_codex":0.000053864725,"about_ca_system_score_gemma":0.000085574575,"threshold_uncertainty_score":0.38958466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042395066,0.00011241329,0.99145585,0.00043228493,0.001586105,0.00017538211,0.000015280482,0.00015271814,0.0018304512],"genre_scores_gemma":[0.9156819,0.000019296162,0.08385122,0.000037209174,0.00025755365,0.000011106171,0.00006199237,0.000023402785,0.000056295827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865067,0.000018853038,0.00072239223,0.00009820811,0.00036208346,0.00014776601],"domain_scores_gemma":[0.9991253,0.00018530908,0.00013049261,0.000078041645,0.00040359425,0.00007726307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028008549,0.00014668821,0.00022053487,0.00049217883,0.00004423938,0.00012537604,0.0002914713,0.00011051171,0.000025739644],"category_scores_gemma":[0.00015828229,0.00015090416,0.00012909158,0.0004031934,0.000025061623,0.0002857594,0.000017710106,0.00031945528,0.000002923791],"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.000008965556,0.000061699415,0.000024142473,0.000027477496,0.00030370094,0.0000034723048,0.00012038579,0.9498764,0.00012157486,0.043541502,0.0009346285,0.004976038],"study_design_scores_gemma":[0.0017576477,0.00003851484,0.00045575935,0.0003457517,0.0001798819,0.000028573251,0.00018097229,0.9837742,0.00028886317,0.008631342,0.004060591,0.00025790784],"about_ca_topic_score_codex":0.000003558316,"about_ca_topic_score_gemma":9.647829e-7,"teacher_disagreement_score":0.9114424,"about_ca_system_score_codex":0.00018027949,"about_ca_system_score_gemma":0.00008664916,"threshold_uncertainty_score":0.6153693},"labels":[],"label_agreement":null},{"id":"W4413872455","doi":"10.5267/j.ijiec.2025.6.008","title":"Blockchain technology adoption decision and coordination contract in green supply chain","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"Fundamental Research Funds for the Central Universities; Ministry of Education, India; National Natural Science Foundation of China","keywords":"Blockchain; Supply chain; Business; Industrial organization; Supply chain management; Process management; Computer science; Marketing; Computer security","score_opus":0.00999470646681317,"score_gpt":0.2537414198360007,"score_spread":0.24374671336918752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2844511,0.00020316063,0.70020694,0.014160503,0.0007432282,0.00013076894,0.0000033406754,0.00006430102,0.000036665733],"genre_scores_gemma":[0.9762841,0.000021331196,0.023509752,0.000067408604,0.000086896725,0.000010743936,0.0000020615068,0.000004405088,0.000013290385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989423,0.000023805795,0.00053633336,0.00016379703,0.00020866773,0.00012507697],"domain_scores_gemma":[0.99891824,0.0003115785,0.00020284926,0.00013229462,0.00039847946,0.00003654992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046940905,0.00010597113,0.00018271215,0.0018936719,0.000047235924,0.00007079267,0.0006656055,0.00021368173,0.0000026305077],"category_scores_gemma":[0.00036727803,0.00011137782,0.000043246946,0.0009341563,0.00003980539,0.00016549282,0.00014651795,0.00046612494,9.4345694e-7],"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.000027190346,0.00014714096,0.006112193,0.0000036544538,0.00008982546,0.000037730348,0.00015344196,0.076673225,0.0007686582,0.4536194,0.00021223673,0.4621553],"study_design_scores_gemma":[0.0028777814,0.00010001748,0.011422222,0.0003612675,0.00001400466,0.00019221818,0.00005796546,0.9375411,0.00070061255,0.043195486,0.0033626477,0.00017464165],"about_ca_topic_score_codex":0.000034589382,"about_ca_topic_score_gemma":0.0000144126225,"teacher_disagreement_score":0.8608679,"about_ca_system_score_codex":0.00014477887,"about_ca_system_score_gemma":0.00011811783,"threshold_uncertainty_score":0.45418555},"labels":[],"label_agreement":null},{"id":"W4413872469","doi":"10.5267/j.ijiec.2025.8.003","title":"An improved adaptive large neighborhood search algorithm on collaborative last mile delivery with roaming customers","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Urban and Freight Transport Logistics","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":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Roaming; Mile; Last mile (transportation); Computer science; Algorithm; Mathematical optimization; Transport engineering; Real-time computing; Engineering; Computer network; Mathematics; Geography","score_opus":0.0173676675300361,"score_gpt":0.2376645769144932,"score_spread":0.2202969093844571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020886932,0.000116867115,0.97476125,0.000095974785,0.0026173324,0.00018766598,0.0002864073,0.000119547796,0.0009279981],"genre_scores_gemma":[0.98558426,0.000021578326,0.013614569,0.000043627948,0.00063256174,0.000005182044,0.0000500274,0.000028494635,0.000019687217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988958,0.00002466411,0.00040206002,0.00012485732,0.00034553144,0.00020709162],"domain_scores_gemma":[0.99883884,0.00018293106,0.00007681284,0.00008740198,0.00070218986,0.00011183789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016153358,0.00018715579,0.0002301835,0.0005929827,0.000056926758,0.0000878408,0.00030877182,0.00011037789,0.000012168767],"category_scores_gemma":[0.0000305293,0.00017586259,0.000067982415,0.0004739751,0.000030639516,0.00025569097,0.000012758859,0.0005801726,0.0000028040433],"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.00010649666,0.00011629125,0.00016525904,0.0000043194955,0.000619146,0.00007836918,0.000270588,0.9835504,0.0003346522,0.0023493627,0.0004110518,0.01199405],"study_design_scores_gemma":[0.0020606709,0.00037465195,0.0004348367,0.00023734527,0.00005969773,0.000015983007,0.00035479144,0.9930675,0.0009105834,0.000027607333,0.0022630196,0.00019330256],"about_ca_topic_score_codex":0.0000073987294,"about_ca_topic_score_gemma":0.000007902055,"teacher_disagreement_score":0.96469736,"about_ca_system_score_codex":0.00027624422,"about_ca_system_score_gemma":0.00022923178,"threshold_uncertainty_score":0.7171468},"labels":[],"label_agreement":null},{"id":"W4413872479","doi":"10.5267/j.ijiec.2025.6.005","title":"Bundling and pricing strategies for integrating physical and online stores: A game-theoretic approach considering effect of network externalities","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"Externality; Network effect; Game theory; Microeconomics; Industrial organization; Economics; Computer science; Mathematical economics; Operations research; Mathematical optimization; Business; Environmental economics; Engineering; Mathematics","score_opus":0.018891350826129406,"score_gpt":0.24679217503489895,"score_spread":0.22790082420876953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86682224,0.000090178335,0.13213645,0.000046974375,0.0005718003,0.00010268212,0.0000038945736,0.000013051338,0.00021272083],"genre_scores_gemma":[0.9960482,0.00000421766,0.0028261293,0.000030584706,0.0010666284,0.0000029797986,0.000008937259,0.000009472746,0.0000028174657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993528,0.000002094348,0.00036956882,0.00008271405,0.000094374795,0.00009843447],"domain_scores_gemma":[0.99898726,0.00053385703,0.0002708303,0.000030103487,0.00016859549,0.000009330126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277797,0.00010847604,0.00024529285,0.000249888,0.00003665576,0.00046839012,0.00010845972,0.00003729586,6.2916183e-7],"category_scores_gemma":[0.00034701556,0.000094291165,0.00006606913,0.000090931986,0.00004091997,0.0010248994,0.000067150424,0.00015298772,5.8517454e-8],"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.000093227376,0.000028993913,0.0008536688,0.00014333973,0.00020417507,0.0000017182174,0.00016482765,0.7171995,0.000094182506,0.27114913,0.000027309088,0.01003989],"study_design_scores_gemma":[0.0015662769,0.00006730542,0.00031614877,0.0009151923,0.00009091502,0.000017955872,0.0013031064,0.96472716,0.00003188643,0.030542975,0.00029762855,0.0001234668],"about_ca_topic_score_codex":0.000032375425,"about_ca_topic_score_gemma":0.0000021046862,"teacher_disagreement_score":0.24752761,"about_ca_system_score_codex":0.00003213971,"about_ca_system_score_gemma":0.000038734423,"threshold_uncertainty_score":0.45166966},"labels":[],"label_agreement":null},{"id":"W4413872499","doi":"10.5267/j.ijiec.2025.8.011","title":"Strengthening regional and global supply chains: The role of subsidies in preventing local market supply disruptions","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Global trade and economics","field":"Economics, Econometrics and Finance","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":"Subsidy; Supply chain; Business; Supply side; Industrial organization; Economics; Natural resource economics; Market economy; Marketing","score_opus":0.028048805651077115,"score_gpt":0.2335996506013695,"score_spread":0.20555084495029238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96672624,0.0025096624,0.023993684,0.003398082,0.0013489199,0.0001332517,0.00021136418,0.000011120351,0.0016676612],"genre_scores_gemma":[0.9987476,0.0001421096,0.0008791256,0.000032812295,0.00016055522,0.0000030136957,0.0000069736284,0.000004672205,0.000023175084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989237,0.000013001655,0.0007886102,0.00010226699,0.00005501484,0.00011739343],"domain_scores_gemma":[0.9992991,0.00019582036,0.00033556428,0.00005915104,0.00007796934,0.000032414086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038754483,0.00008823811,0.00021402074,0.0002763494,0.000036659665,0.000060201764,0.00026257295,0.000064896434,0.00002090813],"category_scores_gemma":[0.00021264274,0.000090303314,0.00009325466,0.00020281345,0.000049798335,0.0001869008,0.000056812,0.00020870508,0.0000011361589],"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.00005684434,0.00009460933,0.27035657,0.000008213352,0.00034955092,0.000004867364,0.00036920595,0.33721408,0.0000128942165,0.37986922,0.00043701218,0.01122693],"study_design_scores_gemma":[0.0037009015,0.00010249108,0.35775834,0.00083473953,0.00004408706,0.00013762996,0.0022529173,0.5437969,0.00008842352,0.0709623,0.01998076,0.00034050285],"about_ca_topic_score_codex":0.00014266306,"about_ca_topic_score_gemma":0.00002616018,"teacher_disagreement_score":0.3089069,"about_ca_system_score_codex":0.0001581,"about_ca_system_score_gemma":0.000058831552,"threshold_uncertainty_score":0.36824623},"labels":[],"label_agreement":null},{"id":"W4413872508","doi":"10.5267/j.ijiec.2025.8.012","title":"The impact of e-commerce development on the supply chain competitiveness of a-share listed companies in China","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","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":"Yunnan Provincial Department of Education; National Natural Science Foundation of China; National Science Foundation","keywords":"Business; China; Supply chain; E-commerce; Industrial organization; Commerce; Supply chain management; Marketing; Computer science; Geography","score_opus":0.02586455149202519,"score_gpt":0.27323900298052217,"score_spread":0.247374451488497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865082,0.000030439393,0.0027438793,0.009307994,0.00064577983,0.00013743521,0.000010289662,0.0000145790455,0.0006014084],"genre_scores_gemma":[0.9996143,0.000003861895,0.0001067045,0.000068519854,0.00015978658,0.000005453647,0.000018903298,0.000006459805,0.0000160035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989705,0.000015186972,0.0006341486,0.000059859205,0.00022198835,0.00009829084],"domain_scores_gemma":[0.99836785,0.0005260146,0.0004377092,0.00009020927,0.00057347416,0.000004724552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004327734,0.00010258721,0.00018592287,0.0007205464,0.000084780266,0.0000651144,0.00057311915,0.000058147314,0.000025573816],"category_scores_gemma":[0.00056499784,0.000067356596,0.000094907475,0.0007465195,0.000075530246,0.0001594743,0.00009544631,0.00036234153,0.0000016025805],"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.00015545049,0.00033204365,0.08912619,0.000021239674,0.00075303664,0.000007752011,0.0002520987,0.50257885,0.00042796574,0.3924439,0.0012940489,0.012607404],"study_design_scores_gemma":[0.0020554678,0.00005098025,0.9437636,0.0016312671,0.00003238019,0.000007936935,0.00066458865,0.044629373,0.0007369704,0.0018471103,0.004420051,0.00016028836],"about_ca_topic_score_codex":0.00022886603,"about_ca_topic_score_gemma":0.000034171706,"teacher_disagreement_score":0.8546374,"about_ca_system_score_codex":0.00009837862,"about_ca_system_score_gemma":0.00013044037,"threshold_uncertainty_score":0.2746722},"labels":[],"label_agreement":null},{"id":"W4413872542","doi":"10.5267/j.ijiec.2025.8.010","title":"Unlocking corporate green governance capabilities in China: A supply chain-oriented evaluation based on an improved FBWM-CoCoSo method","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Corporate governance; China; Supply chain; Business; Industrial organization; Political science; Marketing; Finance","score_opus":0.020761815798371056,"score_gpt":0.27269377433607367,"score_spread":0.2519319585377026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4360844,0.00006205713,0.5422191,0.012010959,0.006862032,0.0014204895,0.000025291829,0.00013757845,0.0011780711],"genre_scores_gemma":[0.9942751,0.0000013875433,0.0038265148,0.00045296116,0.0012583736,0.000039158964,0.000060295733,0.000024790515,0.00006141957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979501,0.00007092554,0.0007502003,0.00024163804,0.00075422035,0.00023291844],"domain_scores_gemma":[0.99772316,0.000251511,0.0007158295,0.00016244686,0.0011246526,0.00002240572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019699992,0.00021625849,0.00027606307,0.001455263,0.00007874464,0.00026453432,0.0004909312,0.000092709575,0.00005612769],"category_scores_gemma":[0.00143339,0.00022759072,0.00010975093,0.00097400433,0.000023659855,0.00088450196,0.00009347623,0.00043261735,0.0000024801816],"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.00016980455,0.00016020384,0.0036835708,0.00003284018,0.00009202307,0.00003504142,0.00009559847,0.95877075,0.0000887363,0.0179308,0.0001858543,0.018754752],"study_design_scores_gemma":[0.0033390478,0.0000473069,0.016335653,0.00041811497,0.00005881034,0.000002860129,0.00031978692,0.9739821,0.0000374655,0.0027679133,0.002513017,0.00017795543],"about_ca_topic_score_codex":0.0012416806,"about_ca_topic_score_gemma":0.000087816676,"teacher_disagreement_score":0.5581907,"about_ca_system_score_codex":0.0008164496,"about_ca_system_score_gemma":0.0002849376,"threshold_uncertainty_score":0.928088},"labels":[],"label_agreement":null},{"id":"W4413872563","doi":"10.5267/j.ijiec.2025.8.013","title":"Optimal grouping preventive maintenance strategy for the multi-part series system under the extended warranty condition","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Reliability and Maintenance Optimization","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":"Warranty; Preventive maintenance; Series (stratigraphy); Reliability engineering; Computer science; Condition-based maintenance; Optimal maintenance; Engineering; Biology","score_opus":0.024162410896961008,"score_gpt":0.26931225787759716,"score_spread":0.24514984698063616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007356745,0.00018383449,0.9852158,0.0014120358,0.005255502,0.000385598,0.00004575758,0.00007590921,0.000068851354],"genre_scores_gemma":[0.99292415,0.00006646852,0.0061919386,0.0000321112,0.0005852123,0.000051338186,0.000021964246,0.000017945533,0.00010884443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.000032101503,0.0005390223,0.00009477049,0.00020024358,0.00015594132],"domain_scores_gemma":[0.998663,0.0004779756,0.00015817008,0.00009978264,0.00057127554,0.000029811792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045086077,0.00013642125,0.00016390542,0.00013797554,0.00013570783,0.00014830814,0.0003640163,0.00008451145,0.0000054672732],"category_scores_gemma":[0.00021368342,0.00009385833,0.000148442,0.00019326656,0.000052930907,0.0003217979,0.000025222711,0.0003239772,9.5253847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047753594,0.00001947392,0.0000047661633,0.000019733203,0.000372495,0.0000021335807,0.00009426289,0.97531503,0.00012639297,0.020939583,0.0013947134,0.0016636286],"study_design_scores_gemma":[0.001100692,0.000041832896,0.0003205869,0.00049791014,0.00007730113,0.00005719662,0.0012623648,0.9930096,0.0004244416,0.0002694137,0.002837693,0.00010094286],"about_ca_topic_score_codex":0.000006139297,"about_ca_topic_score_gemma":0.000003574643,"teacher_disagreement_score":0.98556745,"about_ca_system_score_codex":0.00028355955,"about_ca_system_score_gemma":0.000100123674,"threshold_uncertainty_score":0.38274318},"labels":[],"label_agreement":null},{"id":"W4413872571","doi":"10.5267/j.ijiec.2025.8.014","title":"Manufacturer encroachment with consumer digital privacy in dual-channel supply chains","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Blockchain Technology Applications and Security","field":"Computer Science","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":"National Natural Science Foundation of China","keywords":"Dual (grammatical number); Supply chain; Business; Channel (broadcasting); Computer science; Industrial organization; Telecommunications; Marketing","score_opus":0.012336724190782416,"score_gpt":0.242994516979556,"score_spread":0.2306577927887736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1601805,0.00007492316,0.83120847,0.007377846,0.0008051042,0.00014848581,0.000011005504,0.00006084241,0.0001328669],"genre_scores_gemma":[0.99198,0.00001035473,0.0077731465,0.00008816755,0.00009255228,0.00001138471,0.000006128159,0.0000054347515,0.000032841355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.000013319075,0.00043937523,0.00015804832,0.00027425564,0.0001472402],"domain_scores_gemma":[0.99918526,0.00016548378,0.00016756168,0.00016413923,0.00026790545,0.000049639395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017124087,0.0001241322,0.00017078701,0.0007503769,0.000038081882,0.00016950905,0.0006024263,0.000106721986,0.000003442474],"category_scores_gemma":[0.00010079693,0.000110844594,0.000058534853,0.00043544197,0.000037372196,0.00032563822,0.00014878828,0.00045284367,0.0000023602042],"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.000073414645,0.0006638405,0.005968448,0.0000089429195,0.0006666319,0.00034474075,0.0011578451,0.66476566,0.00013376481,0.274916,0.0022075076,0.049093228],"study_design_scores_gemma":[0.013274851,0.00049963203,0.024867678,0.0012615713,0.00007423356,0.0016290292,0.00030922215,0.877375,0.005158805,0.026965091,0.047520235,0.0010646473],"about_ca_topic_score_codex":0.000010656712,"about_ca_topic_score_gemma":0.0000022712704,"teacher_disagreement_score":0.8317995,"about_ca_system_score_codex":0.00015241164,"about_ca_system_score_gemma":0.0002004624,"threshold_uncertainty_score":0.45201114},"labels":[],"label_agreement":null},{"id":"W4413872685","doi":"10.5267/j.ijiec.2025.8.009","title":"Optimizing multi-vehicle emergency perishable material distribution across multiple centers with a freshness consideration","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Manufacturing and Logistics Optimization","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":"Transport engineering; Computer science; Distribution (mathematics); Automotive engineering; Environmental science; Engineering; Mathematics","score_opus":0.019289886551665622,"score_gpt":0.2656743439157929,"score_spread":0.24638445736412729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1595314,0.0000437418,0.83603966,0.00011540062,0.00389878,0.000106092746,0.00013470123,0.000110408415,0.00001982816],"genre_scores_gemma":[0.9728035,0.000036738926,0.026582157,0.000008715771,0.00034878124,0.000008304866,0.00017064383,0.000021658045,0.00001952617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989363,0.000016624512,0.0005244651,0.000113381815,0.0002219655,0.00018726324],"domain_scores_gemma":[0.9991778,0.000088907014,0.00014783983,0.000077690915,0.00044732477,0.000060442206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012161958,0.00016327632,0.0001856809,0.00015928576,0.00009622491,0.0001366515,0.00019364813,0.0000973402,0.00001743921],"category_scores_gemma":[0.00022737063,0.00016304209,0.000064040905,0.00018071845,0.000024010591,0.0003556796,0.000031700758,0.00027326486,0.0000012335083],"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.00007282137,0.000042115724,0.00059631694,0.000012042167,0.00017983287,0.000014216965,0.00016728413,0.9963005,0.0009172961,0.00017587372,0.00045151898,0.0010701553],"study_design_scores_gemma":[0.0023788477,0.000044808254,0.0010037494,0.0002204035,0.000033719258,0.000029929939,0.00014504098,0.9879501,0.0067511173,0.00004627047,0.0012032363,0.00019281716],"about_ca_topic_score_codex":0.000022359496,"about_ca_topic_score_gemma":0.000012360246,"teacher_disagreement_score":0.81327206,"about_ca_system_score_codex":0.00024337112,"about_ca_system_score_gemma":0.000053459953,"threshold_uncertainty_score":0.6648663},"labels":[],"label_agreement":null},{"id":"W4413872689","doi":"10.5267/j.ijiec.2025.8.008","title":"Key corridor identification in multi-objective highway networks based on feature lines","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Automated Road and Building Extraction","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":"Fundamental Research Funds for the Central Universities; U.S. Department of Transportation","keywords":"Identification (biology); Key (lock); Feature (linguistics); Computer science; Transport engineering; Engineering; Computer security","score_opus":0.01693597708008487,"score_gpt":0.2681802477094447,"score_spread":0.25124427062935983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08577384,0.00011570128,0.9010988,0.00071271794,0.011797054,0.00015386526,0.000016011825,0.00019824064,0.0001337866],"genre_scores_gemma":[0.9969108,0.000014770626,0.002449961,0.000036858633,0.0004998689,0.0000062158183,0.000026048885,0.00001726587,0.00003820772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990949,0.00002225213,0.0004460428,0.00009772207,0.00022250065,0.00011660851],"domain_scores_gemma":[0.99926203,0.00022899859,0.00013082984,0.000068754554,0.00027217861,0.000037209345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020462902,0.0001332976,0.00016187779,0.00088670925,0.000029323997,0.000089590925,0.00021989708,0.00016388782,0.0000053456224],"category_scores_gemma":[0.00024263069,0.00013568084,0.00008384698,0.00043022132,0.000010367371,0.00018955271,0.000011114303,0.00059483084,0.0000026379576],"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.00003391572,0.000063799016,0.0004209702,0.0000047340627,0.00008283935,0.000016997772,0.000041366606,0.99133766,0.0009434805,0.00019308657,0.001790481,0.0050706724],"study_design_scores_gemma":[0.0012591205,0.000022956208,0.009245468,0.00044106433,0.000017242322,0.0000104886585,0.00002053092,0.9864703,0.001166299,0.000017938577,0.0012267387,0.00010187239],"about_ca_topic_score_codex":0.0000067332485,"about_ca_topic_score_gemma":0.0000037923105,"teacher_disagreement_score":0.911137,"about_ca_system_score_codex":0.00033596865,"about_ca_system_score_gemma":0.00006929891,"threshold_uncertainty_score":0.55329037},"labels":[],"label_agreement":null},{"id":"W7117233295","doi":"10.5267/j.ijiec.2025.9.003","title":"Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV under dynamic environments","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","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":"National Natural Science Foundation of China","keywords":"Scheduling (production processes); Dynamic priority scheduling; Automated guided vehicle; Job shop scheduling; Robustness (evolution); Flexible manufacturing system; Two-level scheduling; Fair-share scheduling","score_opus":0.015415521087041487,"score_gpt":0.25249260115186356,"score_spread":0.2370770800648221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117233295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13555026,0.00054860255,0.8580002,0.0003029202,0.005171782,0.00022126926,0.00010046041,0.000054767414,0.00004973417],"genre_scores_gemma":[0.8295329,0.00013468722,0.16978003,0.000022966653,0.00029681134,0.0000053827,0.00006131077,0.000063856445,0.000102019876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698704,0.000073710486,0.0015714394,0.00030376032,0.00073339755,0.00033064172],"domain_scores_gemma":[0.9975886,0.00050674425,0.00066751643,0.00019865058,0.00087290286,0.00016558572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040386376,0.00046328013,0.00063807535,0.0015840635,0.00008915178,0.00017292418,0.00064449635,0.00024901875,0.00004581353],"category_scores_gemma":[0.00055120786,0.00047711798,0.00026214082,0.0008019602,0.00010169596,0.00042890012,0.000092259295,0.0012478648,0.0000050931094],"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.00013883373,0.00026096488,0.00020409923,0.000025707088,0.0025543352,0.000052070096,0.00032976546,0.977681,0.0016898733,0.00018242864,0.000014447169,0.01686652],"study_design_scores_gemma":[0.004755145,0.00014673169,0.0005544369,0.0025588674,0.0002929008,0.00010922362,0.0008834609,0.9860859,0.004087413,0.000036493395,0.00013881619,0.00035063692],"about_ca_topic_score_codex":0.00003567451,"about_ca_topic_score_gemma":0.00000428838,"teacher_disagreement_score":0.69398266,"about_ca_system_score_codex":0.0009690535,"about_ca_system_score_gemma":0.000588713,"threshold_uncertainty_score":0.9997681},"labels":[],"label_agreement":null},{"id":"W7117234752","doi":"10.5267/j.ijiec.2025.11.003","title":"Multi-time-scale collaborative optimization strategy of source-grid-load-storage flexibility resources for new energy consumption","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Integrated Energy Systems Optimization","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":"Flexibility (engineering); Energy consumption; Intermittency; Demand response; Wind power; Energy storage; Volatility (finance); Scheduling (production processes); Energy (signal processing)","score_opus":0.02314537052130245,"score_gpt":0.2704543036451212,"score_spread":0.24730893312381874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117234752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013456394,0.0010969943,0.97574687,0.00027566732,0.008266485,0.00050181214,0.00035829525,0.00010975898,0.00018773304],"genre_scores_gemma":[0.8091248,0.00043211287,0.18309024,0.000047442925,0.004374595,0.000053927564,0.00035481213,0.0002047437,0.0023173233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565065,0.00018028381,0.0026150758,0.00037392293,0.00081745145,0.00036260643],"domain_scores_gemma":[0.9923088,0.0008543289,0.0013499103,0.00025187203,0.005019279,0.00021579067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083601417,0.0005276002,0.00088501035,0.0013953948,0.00012229255,0.00028529996,0.00072199415,0.00065819203,0.00012440773],"category_scores_gemma":[0.0012132593,0.00060503714,0.00039912228,0.0010663805,0.0000994412,0.0006617632,0.0000756321,0.0006020833,0.00000285432],"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.00045915777,0.00021219594,0.000054636468,0.00008236635,0.0015669136,0.000004746541,0.0007367891,0.983938,0.0029578218,0.0005065144,0.0029441132,0.0065367892],"study_design_scores_gemma":[0.0052223206,0.00022608033,0.00008923629,0.001596508,0.0002962879,0.000024393325,0.0002675514,0.98251283,0.0035481695,0.000033912962,0.0057976814,0.00038505552],"about_ca_topic_score_codex":0.00025516064,"about_ca_topic_score_gemma":0.000027564907,"teacher_disagreement_score":0.7956684,"about_ca_system_score_codex":0.0015954542,"about_ca_system_score_gemma":0.0018389157,"threshold_uncertainty_score":0.9996401},"labels":[],"label_agreement":null},{"id":"W7117234794","doi":"10.5267/j.ijiec.2025.11.001","title":"Carbon emission reduction decisions and financing strategies of non-controlled emission enterprises under the voluntary carbon reduction mechanism","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","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":"Ministry of Education of the People's Republic of China; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Market liquidity; Equity (law); Carbon fibers; Carbon finance; Reduction (mathematics); Equity financing; Economic order quantity; Greenhouse gas; Internal financing","score_opus":0.043595572873633574,"score_gpt":0.27277065072844286,"score_spread":0.22917507785480928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117234794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95474607,0.0013668153,0.02768661,0.003742351,0.011596151,0.00034930083,0.000065569526,0.000011745888,0.0004353867],"genre_scores_gemma":[0.9960919,0.0019134133,0.0005341622,0.000022228027,0.0012784583,0.000009598989,0.000014068986,0.000024046214,0.00011212024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972283,0.00004296443,0.0020608094,0.00028385856,0.00014909319,0.00023492778],"domain_scores_gemma":[0.997256,0.0004882967,0.0015980363,0.00018628781,0.00037143283,0.00009995449],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009273936,0.00027778128,0.00073992676,0.0012470306,0.00015489939,0.00022571285,0.00041340268,0.00037750442,0.000016717227],"category_scores_gemma":[0.00053166714,0.00027336756,0.00028444154,0.0003639147,0.000077231154,0.00038222683,0.00015060614,0.0008180601,5.0332534e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001670644,0.0004824382,0.0021052477,0.00009036833,0.0024534909,0.000013357413,0.0042140367,0.9354247,0.012190344,0.031683806,0.00057264103,0.009098922],"study_design_scores_gemma":[0.010120099,0.00037225857,0.00298395,0.0032736266,0.0003547958,0.00026016415,0.0073668896,0.9320015,0.004221336,0.03813595,0.0004220683,0.0004874024],"about_ca_topic_score_codex":0.00051954616,"about_ca_topic_score_gemma":0.0000063252937,"teacher_disagreement_score":0.041345835,"about_ca_system_score_codex":0.0004985313,"about_ca_system_score_gemma":0.0003403332,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W7117235498","doi":"10.5267/j.ijiec.2025.9.005","title":"Cost-availability ratio modeling of two-dimensional extended warranty for multi-component systems with fault correlation","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Reliability and Maintenance Optimization","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":"Warranty; Fault (geology); Independence (probability theory); Sensitivity (control systems); Reliability (semiconductor); Fault model; Interval (graph theory); Transmission system","score_opus":0.043323683363978266,"score_gpt":0.287709952686788,"score_spread":0.24438626932280974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117235498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04428956,0.000406718,0.94425654,0.0003573088,0.009145064,0.001287205,0.00016999515,0.000053180265,0.000034436784],"genre_scores_gemma":[0.95000947,0.000041204694,0.0491544,0.000013707329,0.0005363258,0.000048245856,0.000111476125,0.000043871187,0.000041325857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625015,0.00009706249,0.0022857366,0.00031423545,0.00073749153,0.00031532507],"domain_scores_gemma":[0.9940542,0.0007447839,0.000795591,0.00021787976,0.0040482422,0.00013932066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010937252,0.0003910572,0.00072677643,0.0008172793,0.00011571003,0.00015974289,0.00046099073,0.00029976474,0.0000132190125],"category_scores_gemma":[0.0010490445,0.00038482278,0.0003164163,0.00049601425,0.00007858996,0.0006000705,0.000047041955,0.0007279195,0.0000013116285],"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.0006043878,0.00035641922,0.00014632351,0.00014440854,0.0010476605,0.000005528252,0.0002887916,0.9905426,0.000772924,0.0033639243,0.00013923102,0.0025877918],"study_design_scores_gemma":[0.008068504,0.00019784043,0.0001300934,0.0022944673,0.00027974445,0.0000462941,0.00015800617,0.98782676,0.00043652512,0.00014502896,0.00012631087,0.00029039884],"about_ca_topic_score_codex":0.00009090024,"about_ca_topic_score_gemma":0.0000055649016,"teacher_disagreement_score":0.9057199,"about_ca_system_score_codex":0.0008550548,"about_ca_system_score_gemma":0.00069915113,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W7117236099","doi":"10.5267/j.ijiec.2025.9.002","title":"Minimizing customer waiting time in drone delivery systems: An optimization approach considering heterogeneous fleets and package setup time using modified coot algorithms","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"UAV Applications and Optimization","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":"Drone; Optimization problem; Vehicle routing problem; Selection (genetic algorithm); Routing (electronic design automation); Optimization algorithm","score_opus":0.027660723656150514,"score_gpt":0.2505322439841753,"score_spread":0.22287152032802476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117236099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2250192,0.00077359535,0.7715837,0.00009009775,0.0016223921,0.0005415668,0.000088187066,0.00009483903,0.0001864151],"genre_scores_gemma":[0.9051466,0.00014933974,0.09364316,0.000019581053,0.00074714073,0.000017736129,0.00015123637,0.000090757334,0.000034475936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659777,0.00014825157,0.0018848078,0.00041237703,0.00053678965,0.00041998428],"domain_scores_gemma":[0.9977365,0.0004111274,0.00060825655,0.00021210252,0.0008219261,0.00021005889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007025085,0.00047716254,0.00071002916,0.001893663,0.00017222398,0.00063974096,0.00044435455,0.0004293658,0.000029500125],"category_scores_gemma":[0.00022137784,0.0005953317,0.00013827368,0.0008539839,0.00006738256,0.0009381493,0.00014066619,0.0007742455,0.000003809383],"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.000055276134,0.00016219991,0.00004951856,0.000060492363,0.0005542371,0.00004588659,0.0004020481,0.99309915,0.0025136236,0.00024546718,0.000042734435,0.0027693724],"study_design_scores_gemma":[0.0025084615,0.000052837797,0.000021962715,0.0011869288,0.00019860649,0.00034477402,0.00022129514,0.9947131,0.00024633974,0.000011606113,0.000054563454,0.00043947436],"about_ca_topic_score_codex":0.00009947693,"about_ca_topic_score_gemma":0.000001154956,"teacher_disagreement_score":0.6801274,"about_ca_system_score_codex":0.0007612336,"about_ca_system_score_gemma":0.0003190971,"threshold_uncertainty_score":0.9996498},"labels":[],"label_agreement":null},{"id":"W7117236201","doi":"10.5267/j.ijiec.2025.12.003","title":"Joint revenue loss of \"BOOT+BTO\" mode for the comprehensive utilization of water conservancy project","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Public-Private Partnership Projects","field":"Business, Management and Accounting","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":"Profit (economics); Revenue; Water supply; Social Welfare; Fuzzy logic; Mode (computer interface); Debt; Government (linguistics); Equity (law)","score_opus":0.11316076909447279,"score_gpt":0.33193158023226577,"score_spread":0.21877081113779298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117236201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41913947,0.0015090698,0.53282624,0.019228345,0.023050077,0.0032128266,0.00040961942,0.000056715184,0.00056758814],"genre_scores_gemma":[0.99691635,0.00006617864,0.0010224014,0.00015720588,0.001598148,0.000020074629,0.00006647445,0.000030386294,0.0001227535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720925,0.000044572327,0.0016847504,0.00019094553,0.00060802867,0.0002624539],"domain_scores_gemma":[0.9929608,0.0007667573,0.0013662751,0.0001913635,0.00469541,0.0000193544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006963349,0.00026452448,0.0005404394,0.0013741158,0.00010861855,0.00023029365,0.0007086793,0.00017700084,0.000023482193],"category_scores_gemma":[0.0015735746,0.00020866613,0.00036815638,0.0006946458,0.0001228528,0.00080316357,0.00025364378,0.0004348327,0.0000023097298],"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.0007320299,0.00041744098,0.0013520123,0.00069999363,0.002706463,0.000018618344,0.0007599337,0.93545437,0.005487248,0.03403643,0.012775577,0.0055599064],"study_design_scores_gemma":[0.009267148,0.00018075891,0.0022496383,0.0051664347,0.0010503911,0.000051060535,0.0007860077,0.85205853,0.015442274,0.0037150634,0.10951244,0.0005202535],"about_ca_topic_score_codex":0.00019303671,"about_ca_topic_score_gemma":0.000008387427,"teacher_disagreement_score":0.5777769,"about_ca_system_score_codex":0.00015050557,"about_ca_system_score_gemma":0.00051998923,"threshold_uncertainty_score":0.85091573},"labels":[],"label_agreement":null},{"id":"W7117238929","doi":"10.5267/j.ijiec.2025.10.001","title":"Impact of information asymmetry and logistics service quality on sales mode selection in dual-channel supply chains: A game-theoretic analysis","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"National Office for Philosophy and Social Sciences","keywords":"Profitability index; Information asymmetry; Supply chain; Competition (biology); Outcome (game theory); Mode (computer interface); Quality (philosophy); Service (business)","score_opus":0.02684275332151035,"score_gpt":0.30117619489833364,"score_spread":0.27433344157682327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117238929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.715503,0.00011347433,0.2790939,0.0021667818,0.0021978982,0.0003918137,0.00008961139,0.000028567578,0.0004150076],"genre_scores_gemma":[0.99881023,0.00007356113,0.0001896765,0.00023403078,0.00054844853,0.00000527334,0.00010965868,0.000011877689,0.000017263355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973618,0.00006262526,0.0015790983,0.00016946284,0.0006123976,0.0002146597],"domain_scores_gemma":[0.9969707,0.00037532457,0.0011537751,0.00009896995,0.0013654225,0.00003581851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096337544,0.00027314812,0.0005287497,0.0051349755,0.00005268821,0.00036952397,0.00026420297,0.00017726659,0.00004105603],"category_scores_gemma":[0.0011556055,0.00028053072,0.0003076203,0.002569208,0.00004804122,0.001142826,0.00014272753,0.0004975659,0.0000041463],"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.0003279865,0.0002576649,0.016144909,0.0001317381,0.0021905988,0.000006546565,0.0002826008,0.94520295,0.000024487372,0.03306609,0.00023868213,0.0021257747],"study_design_scores_gemma":[0.0025662282,0.000100492776,0.07841307,0.00078128936,0.00054359937,0.0000043046202,0.0003761533,0.9155841,0.000017747287,0.0011524092,0.00025326095,0.00020732729],"about_ca_topic_score_codex":0.0010436676,"about_ca_topic_score_gemma":0.000058677637,"teacher_disagreement_score":0.28330725,"about_ca_system_score_codex":0.0005242547,"about_ca_system_score_gemma":0.00018398836,"threshold_uncertainty_score":0.9999647},"labels":[],"label_agreement":null},{"id":"W7117242944","doi":"10.5267/j.ijiec.2025.9.006","title":"Engineering supply chain quality control under different information conditions","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Evaluation and Optimization Models","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":"North China University of Water Resources and Electric Power","keywords":"Lagrange multiplier; Quality (philosophy); Complete information; Control (management); Supply chain; Optimal control; Function (biology); Value of information; Multiplier (economics)","score_opus":0.031953272306371516,"score_gpt":0.30550064808040517,"score_spread":0.27354737577403365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117242944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027284345,0.0002506891,0.95076674,0.0041537927,0.0160844,0.00047647208,0.00039046752,0.0001577692,0.00043530526],"genre_scores_gemma":[0.9950477,0.00013673777,0.0030227827,0.000381041,0.001043272,0.00002421199,0.0002141213,0.00004134919,0.00008878801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545985,0.0001372946,0.0027205977,0.00020217916,0.0010926219,0.0003874433],"domain_scores_gemma":[0.9953804,0.0012493044,0.00074835104,0.00023538302,0.0021327636,0.00025376695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009330275,0.00048797112,0.00069286284,0.0022031136,0.00012985105,0.00056927657,0.00073176116,0.00041319057,0.00035306494],"category_scores_gemma":[0.0016037007,0.00054876314,0.00044244368,0.00073682045,0.00004790581,0.0014548784,0.00008132545,0.0011341533,0.000035562694],"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.000069554466,0.000115128205,0.0003282378,0.000044626042,0.0014181106,0.000005292836,0.00026716013,0.9394343,0.0004172624,0.053069517,0.001990512,0.002840297],"study_design_scores_gemma":[0.0066134944,0.000061229635,0.004721584,0.0010269172,0.0002542879,0.000032547992,0.0001669891,0.98142666,0.00033444221,0.00063916744,0.004290324,0.00043235114],"about_ca_topic_score_codex":0.000022969232,"about_ca_topic_score_gemma":0.0000027485792,"teacher_disagreement_score":0.96776336,"about_ca_system_score_codex":0.0011008125,"about_ca_system_score_gemma":0.00054424617,"threshold_uncertainty_score":0.9996964},"labels":[],"label_agreement":null},{"id":"W7117243244","doi":"10.5267/j.ijiec.2025.9.004","title":"Research on competition and cooperation in the two level multi agent supply chain of China's new energy vehicle industry based on differential game theory","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Profit (economics); Supply chain; Differential game; Competition (biology); Game theory; Energy supply; Profit model; New energy","score_opus":0.04623318047965111,"score_gpt":0.3075705108711808,"score_spread":0.26133733039152973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117243244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53988785,0.00016261649,0.42879668,0.024064591,0.0052640224,0.00095219107,0.000044056123,0.00002839119,0.000799612],"genre_scores_gemma":[0.9970049,0.000019518227,0.00022770422,0.0005378955,0.0018730237,0.000012934966,0.00005480289,0.000025531897,0.000243671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683034,0.0003335404,0.0010356673,0.0002825397,0.0011935144,0.00032442005],"domain_scores_gemma":[0.9970904,0.001236575,0.00048000537,0.00020119935,0.0009506419,0.000041177555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002405362,0.00028590456,0.00034760972,0.0033033842,0.00015173371,0.0006117229,0.0007656016,0.00024014837,0.000109740315],"category_scores_gemma":[0.0011017743,0.00025722058,0.0001333385,0.0013182551,0.0001028289,0.0004357047,0.00019503398,0.0015666706,0.0000026514667],"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.00053329143,0.00058084645,0.0006654067,0.00004518801,0.00018150387,0.000055295146,0.00023025023,0.8092583,0.00009350367,0.17111002,0.00093579316,0.016310595],"study_design_scores_gemma":[0.009389755,0.00022163453,0.026860567,0.0023760437,0.00009872389,0.000004268922,0.001649926,0.95416117,0.00019147857,0.002102774,0.0026962727,0.00024741678],"about_ca_topic_score_codex":0.00072295417,"about_ca_topic_score_gemma":0.000040236024,"teacher_disagreement_score":0.45711708,"about_ca_system_score_codex":0.0004613483,"about_ca_system_score_gemma":0.00039420679,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W7117244722","doi":"10.5267/j.ijiec.2025.12.001","title":"Technological innovation in trade-in supply chain: Enterprise operations and consumer reactions","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Lingnan Normal University; Jilin Office of Philosophy and Social Science","keywords":"Profitability index; Purchasing; Technological change; Homogeneous; Product (mathematics); Product innovation","score_opus":0.025357064533197467,"score_gpt":0.2576094161369678,"score_spread":0.23225235160377034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117244722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79195094,0.0014819938,0.10002251,0.08630715,0.01606906,0.0016494569,0.000042952022,0.0001299753,0.0023459517],"genre_scores_gemma":[0.99794817,0.00020833506,0.0005331584,0.00048772997,0.0006405858,0.000021964155,0.000033279895,0.000016809323,0.00010995487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725085,0.000039836665,0.0018012042,0.00025717937,0.00039855766,0.00025236286],"domain_scores_gemma":[0.998825,0.0002297461,0.00039043766,0.00011725194,0.00041594103,0.000021607266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010677121,0.0002555688,0.00036730545,0.0054895654,0.000084195795,0.0004942064,0.00043997704,0.00024147518,0.00009936878],"category_scores_gemma":[0.0015265143,0.00028145095,0.0000928168,0.002290891,0.00012418003,0.0011224631,0.00019265502,0.00090785755,0.000006004617],"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.00018951473,0.00094304833,0.041764174,0.0001078409,0.00048148766,0.00020583783,0.0002538202,0.6490386,0.00051728665,0.263424,0.0033849762,0.039689407],"study_design_scores_gemma":[0.01131094,0.00008790511,0.034774724,0.0053625423,0.00018147685,0.00006532875,0.0020028541,0.7858104,0.00013937963,0.0032592788,0.15629093,0.000714193],"about_ca_topic_score_codex":0.00013532836,"about_ca_topic_score_gemma":0.000045874094,"teacher_disagreement_score":0.26016474,"about_ca_system_score_codex":0.0004104136,"about_ca_system_score_gemma":0.00016481597,"threshold_uncertainty_score":0.99996376},"labels":[],"label_agreement":null},{"id":"W7117244920","doi":"10.5267/j.ijiec.2025.10.003","title":"Research on collaborative R&D decision making of photovoltaic industry supply chain considering green preference under carbon target regulation","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Huaiyin Normal University","keywords":"Photovoltaic system; Supply chain; Profit (economics); Carbon tax; Greenhouse gas; Carbon fibers; Photovoltaics; Supply chain management","score_opus":0.06353468237390267,"score_gpt":0.3304659649508846,"score_spread":0.26693128257698195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117244920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85340536,0.0006377947,0.11962757,0.008348663,0.012197998,0.0019520544,0.000065772794,0.00008865311,0.0036761512],"genre_scores_gemma":[0.99337834,0.000022306966,0.0038838987,0.0002026065,0.0020863507,0.000021982969,0.00003193591,0.000052619376,0.00031994292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477506,0.00017762081,0.0019349803,0.00045764138,0.0021172855,0.00053740974],"domain_scores_gemma":[0.9895013,0.0020350588,0.0014029903,0.000331126,0.006679984,0.000049537022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002894118,0.00043597977,0.00064590306,0.006154232,0.00023416804,0.0006554893,0.0010789257,0.00057108694,0.00022220227],"category_scores_gemma":[0.0031017829,0.0004869885,0.00020357633,0.0036848865,0.00016503908,0.0009398114,0.00062554114,0.0022604156,0.000009185491],"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.00072418957,0.00025820927,0.0039312886,0.00015051907,0.000853255,0.000055631324,0.000277726,0.96420723,0.00053512474,0.01966039,0.0035107383,0.0058356733],"study_design_scores_gemma":[0.010497448,0.0003401872,0.018611308,0.02400611,0.00048352178,0.000028310165,0.011312592,0.86026394,0.0015662608,0.04054386,0.031152077,0.0011943792],"about_ca_topic_score_codex":0.0004136337,"about_ca_topic_score_gemma":0.000043253393,"teacher_disagreement_score":0.13997301,"about_ca_system_score_codex":0.0013394196,"about_ca_system_score_gemma":0.0010500217,"threshold_uncertainty_score":0.9997582},"labels":[],"label_agreement":null},{"id":"W7117249614","doi":"10.5267/j.ijiec.2025.10.002","title":"Unveiling multi-agent dynamics in digital transformation: A niche-based evolutionary game analysis of high-end manufacturing","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Digital Transformation in Industry","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":"Nanjing University of Finance and Economics; Nanjing University","keywords":"Digital transformation; Purchasing; Transformation (genetics); Government (linguistics); Incentive; Pace; Process (computing); Game theory","score_opus":0.018563520804260398,"score_gpt":0.2538971568186063,"score_spread":0.2353336360143459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117249614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32188052,0.00017393756,0.6705972,0.00077917846,0.004706532,0.0003032914,0.00088773866,0.00006269574,0.0006089251],"genre_scores_gemma":[0.9959692,0.00003064493,0.0032678137,0.000021986845,0.00022236786,0.000010728127,0.00039922367,0.000040792605,0.00003726986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503213,0.000042148447,0.003247403,0.0002530133,0.001031693,0.00039359214],"domain_scores_gemma":[0.99725467,0.00078703323,0.0006778971,0.00021968583,0.0008904756,0.00017021118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046702175,0.000468966,0.0009171185,0.0057620644,0.00004992984,0.00034889163,0.0008463366,0.00046127764,0.00010604409],"category_scores_gemma":[0.0003577007,0.0005706297,0.00070822187,0.0024188764,0.000091370144,0.0016994915,0.000058129983,0.0013319323,0.0000050500416],"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.00012356485,0.00036967907,0.0017142172,0.000105055886,0.0041473676,0.00003813239,0.00036819497,0.9767686,0.000024504267,0.005803227,0.00004439307,0.010493024],"study_design_scores_gemma":[0.0044917357,0.00006974875,0.006430344,0.0013917591,0.0007138141,0.000022070075,0.0006163676,0.9843694,0.0009228241,0.00014614961,0.00044776197,0.00037805046],"about_ca_topic_score_codex":0.000046950223,"about_ca_topic_score_gemma":0.000021456952,"teacher_disagreement_score":0.67408866,"about_ca_system_score_codex":0.0026756674,"about_ca_system_score_gemma":0.0006762717,"threshold_uncertainty_score":0.9996745},"labels":[],"label_agreement":null},{"id":"W7117251599","doi":"10.5267/j.ijiec.2025.12.006","title":"Bayesian evaluation of multi-grade damage efficiency of ammunition using multi-stage binomial distribution","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Military Defense Systems Analysis","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":"Multinomial distribution; Identifiability; Markov chain Monte Carlo; Prior probability; Bayesian probability; Gibbs sampling; Fisher information; Ammunition; Uncertainty quantification","score_opus":0.08501191574315461,"score_gpt":0.3374429335165788,"score_spread":0.25243101777342414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117251599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44488522,0.00051662594,0.5502697,0.000047190177,0.0035324132,0.00029779648,0.00041835062,0.000017895687,0.000014788941],"genre_scores_gemma":[0.9899596,0.00004540963,0.009287518,0.0000026705795,0.0004645373,0.0000050539193,0.00018054737,0.00003640164,0.000018281458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463993,0.00037568746,0.0029896707,0.00024517786,0.0014619672,0.00028759157],"domain_scores_gemma":[0.9940451,0.00044158148,0.0014029397,0.00029663424,0.0036881494,0.00012563121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024199593,0.00038440817,0.0008247869,0.0019959158,0.00009362713,0.00007621125,0.00068080745,0.00036107915,0.000071523726],"category_scores_gemma":[0.0017645895,0.0004530339,0.0005874655,0.0013938921,0.00010445853,0.00049091293,0.00010816434,0.0007835765,0.0000013506302],"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.000057688303,0.00043843832,0.0008110046,0.000121658,0.0016847709,0.000009668602,0.00058224803,0.97521675,0.018069517,0.00043644584,0.000035516612,0.002536272],"study_design_scores_gemma":[0.0054583494,0.00008487101,0.0021195794,0.0019434912,0.0010427127,0.000022917937,0.0005162163,0.98212594,0.006314991,0.00002133262,0.00008885274,0.00026073123],"about_ca_topic_score_codex":0.0005472555,"about_ca_topic_score_gemma":0.000028949935,"teacher_disagreement_score":0.54507434,"about_ca_system_score_codex":0.0014243505,"about_ca_system_score_gemma":0.0008576717,"threshold_uncertainty_score":0.99979216},"labels":[],"label_agreement":null},{"id":"W7117252841","doi":"10.5267/j.ijiec.2025.12.005","title":"Carbon emission accounting method for enterprises considering green electricity and green certificate consumption","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Environmental Impact and Sustainability","field":"Environmental Science","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":"Electricity; Renewable energy; Green consumption; Carbon accounting; Greenhouse gas; Consumption (sociology); Accounting method; Certificate; Electricity generation","score_opus":0.04527030584948785,"score_gpt":0.31537188834889335,"score_spread":0.2701015824994055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117252841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7820513,0.0003094102,0.21295519,0.0024127695,0.0016836731,0.0004599423,0.000041556148,0.00002121657,0.00006491295],"genre_scores_gemma":[0.99191654,0.000091019756,0.0073728566,0.00008911495,0.00036849748,0.000007835692,0.0000066081634,0.000019666764,0.00012786253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978077,0.0000886007,0.0010326129,0.00029742607,0.00046343263,0.00031026237],"domain_scores_gemma":[0.9982169,0.0007981284,0.0005465498,0.000117022355,0.00015664764,0.00016471957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009639359,0.0002710862,0.00037529288,0.00042545752,0.00016223143,0.00018942208,0.00037715552,0.00021400157,0.0000610853],"category_scores_gemma":[0.00075861154,0.0002853862,0.00017998602,0.00023780658,0.0001145804,0.00043082397,0.00023525112,0.0005410068,0.0000010149296],"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.00090503285,0.0004949524,0.29466778,0.00022122031,0.0013095174,0.00005253496,0.0015738643,0.3523655,0.06599972,0.00031288416,0.00032071123,0.28177628],"study_design_scores_gemma":[0.0038070993,0.00026230697,0.048718397,0.0007923812,0.00036243332,0.00014341711,0.00036074902,0.9283016,0.012820731,0.0018656107,0.002109755,0.00045556205],"about_ca_topic_score_codex":0.00055773585,"about_ca_topic_score_gemma":0.000008377773,"teacher_disagreement_score":0.5759361,"about_ca_system_score_codex":0.0010301583,"about_ca_system_score_gemma":0.00012960304,"threshold_uncertainty_score":0.9999598},"labels":[],"label_agreement":null},{"id":"W7117254448","doi":"10.5267/j.ijiec.2025.10.005","title":"Optimization of direct transshipment scheduling for river–sea intermodal transport with vessel arrival time matching","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Maritime Ports and Logistics","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":"Transshipment (information security); Scheduling (production processes); Flexibility (engineering); Port (circuit theory); Arrival time; Multi-objective optimization; Job shop scheduling; Matching (statistics); Convergence (economics); Heuristic","score_opus":0.015607161152823266,"score_gpt":0.24207047705546886,"score_spread":0.2264633159026456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117254448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029339567,0.00025824097,0.96517015,0.00050459156,0.003659398,0.00038918675,0.00028991728,0.000048856236,0.00034008996],"genre_scores_gemma":[0.9089015,0.00007896529,0.090033874,0.000015032097,0.0007500329,0.000009815044,0.00010549584,0.000052504813,0.000052741925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973519,0.000031182408,0.0015698636,0.00021272145,0.0005560675,0.00027830488],"domain_scores_gemma":[0.99760854,0.0005416547,0.00052007375,0.00012591011,0.0010738134,0.00012998343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005186283,0.00034973898,0.00065231824,0.00087806094,0.00007469375,0.00010082467,0.0005136282,0.00023029716,0.00007256366],"category_scores_gemma":[0.0002060729,0.00036331793,0.00031785137,0.00035499802,0.000077974946,0.00032199774,0.000027712103,0.0005949172,6.372056e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050803827,0.00017488124,0.0002481955,0.0001460992,0.0018811321,0.00003391213,0.0005555022,0.98997533,0.00029869418,0.0017687253,0.00010488152,0.0043045874],"study_design_scores_gemma":[0.0036318544,0.00026891468,0.0003736091,0.0028155907,0.0005296133,0.00004587866,0.00007660938,0.9900635,0.0010181324,0.00023493203,0.0006229699,0.00031839736],"about_ca_topic_score_codex":0.000032533975,"about_ca_topic_score_gemma":0.0000014651657,"teacher_disagreement_score":0.87956196,"about_ca_system_score_codex":0.0003198397,"about_ca_system_score_gemma":0.00046924443,"threshold_uncertainty_score":0.99988186},"labels":[],"label_agreement":null},{"id":"W7117257993","doi":"10.5267/j.ijiec.2025.12.002","title":"A general computational framework for precision quantification in heteroscedastic industrial data: theory, algorithms, and production control validation","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Heteroscedasticity; Range (aeronautics); Uncertainty quantification; Kriging; Metric (unit); Parametric statistics; Function (biology); Benchmark (surveying); Transformation (genetics); Probability density function","score_opus":0.15437182291724538,"score_gpt":0.42930193833323005,"score_spread":0.27493011541598467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117257993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016356148,0.0003864454,0.9575023,0.0040191086,0.020240767,0.0009337462,0.00052831596,0.000025812582,0.000007337246],"genre_scores_gemma":[0.85648227,0.00005958172,0.13961537,0.00005160763,0.003512829,0.000031199997,0.00015691365,0.000033872424,0.000056343426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936925,0.00042811828,0.003032301,0.00083852094,0.0016411135,0.00036740283],"domain_scores_gemma":[0.98112565,0.013891614,0.0015686561,0.00039899317,0.0028352705,0.00017983356],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052953307,0.00038564752,0.00072252,0.0019459663,0.00022385186,0.0008718727,0.0014746119,0.0004488481,0.000012932541],"category_scores_gemma":[0.05863378,0.0003940117,0.00013984906,0.0012066645,0.00016493582,0.0017106994,0.00027104883,0.0011862126,0.0000030577658],"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.00084136165,0.00019637973,0.001013776,0.000015431971,0.00025246988,0.0000075790213,0.00015357681,0.77175444,0.00011129361,0.02486787,0.00047485458,0.20031095],"study_design_scores_gemma":[0.004900719,0.00020041331,0.0016652368,0.001512957,0.00017155109,0.000042118452,0.00019322315,0.8181707,0.00021179074,0.17137727,0.0012552679,0.00029875478],"about_ca_topic_score_codex":0.000011747674,"about_ca_topic_score_gemma":0.0000019614847,"teacher_disagreement_score":0.84012616,"about_ca_system_score_codex":0.00052845816,"about_ca_system_score_gemma":0.0009085905,"threshold_uncertainty_score":0.99985117},"labels":[],"label_agreement":null},{"id":"W7117258300","doi":"10.5267/j.ijiec.2025.10.004","title":"The impact of credit guarantee on enterprises' willingness to undertake environmental responsibilities: Evidence from a dynamic evolutionary game model","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Finance and Green Bonds","field":"Economics, Econometrics and Finance","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":"Nanjing University; Nanjing University of Posts and Telecommunications","keywords":"Context (archaeology); Subsidy; Government (linguistics); Evolutionarily stable strategy; Process (computing); Evolutionary game theory; Evolutionary dynamics; Economic interventionism","score_opus":0.028803015204309678,"score_gpt":0.27670886205943795,"score_spread":0.2479058468551283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117258300","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8091077,0.002976378,0.18096952,0.001937031,0.003479333,0.00027869645,0.0012046075,0.000008375758,0.0000383179],"genre_scores_gemma":[0.9973657,0.0008439168,0.000820427,0.000047016543,0.00042222778,0.000011192381,0.000020032143,0.000026038098,0.00044342026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971346,0.000050115763,0.0018902314,0.00033976225,0.00025781605,0.00032747662],"domain_scores_gemma":[0.996119,0.002116704,0.0010004826,0.00032438984,0.00034114966,0.000098239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000715781,0.00030553743,0.0005660009,0.0009703598,0.00013958875,0.00017929477,0.0010633277,0.00021214421,0.000049106016],"category_scores_gemma":[0.0020186568,0.00030019254,0.00057631166,0.00047410151,0.00010978241,0.00046384585,0.00017004601,0.00067120104,0.0000135345135],"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.001317966,0.00022326606,0.006439003,0.0000063698762,0.0009092562,0.000018318877,0.0009206776,0.9837586,0.00007012283,0.0032615804,0.0008280943,0.0022467056],"study_design_scores_gemma":[0.0016213272,0.0005930297,0.03062708,0.00167761,0.000047416226,0.000011579058,0.00047407314,0.9506829,0.00003485946,0.013439159,0.00053728325,0.0002536989],"about_ca_topic_score_codex":0.00023029179,"about_ca_topic_score_gemma":0.000007666947,"teacher_disagreement_score":0.18825799,"about_ca_system_score_codex":0.002274649,"about_ca_system_score_gemma":0.00086395146,"threshold_uncertainty_score":0.99994504},"labels":[],"label_agreement":null},{"id":"W7117259559","doi":"10.5267/j.ijiec.2025.9.001","title":"Pricing and inventory coordination in cross-border e-commerce supply chains based on revenue sharing contracts","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","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":"Yunnan Provincial Department of Education; National Natural Science Foundation of China","keywords":"Revenue sharing; Supply chain; Profit (economics); Revenue; Profit sharing; Order (exchange); Supply chain management","score_opus":0.02067984548149054,"score_gpt":0.3131254409717456,"score_spread":0.29244559549025506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117259559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92076856,0.0002555341,0.031264834,0.039053198,0.0066746525,0.0004819215,0.000029505722,0.00006654893,0.0014052173],"genre_scores_gemma":[0.9969319,0.000023402825,0.00036880458,0.0012983509,0.0010397884,0.000010691926,0.000039792343,0.000027662438,0.00025961854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977711,0.000021969807,0.0012275393,0.0002716139,0.00043006582,0.00027770328],"domain_scores_gemma":[0.9976093,0.0005132316,0.00076245656,0.00015986817,0.00092783,0.000027324908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009648292,0.00027723986,0.00039008746,0.003559799,0.00016638925,0.00059079373,0.000519631,0.0003165319,0.000056508554],"category_scores_gemma":[0.002471031,0.0003262406,0.00011591615,0.0013790914,0.000109360495,0.0010454216,0.000173958,0.0012475475,0.000005953807],"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.00022763223,0.00062213046,0.20948575,0.000101320984,0.00045293904,0.00011296204,0.0001498895,0.6727299,0.0002931651,0.077337764,0.0022794567,0.036207084],"study_design_scores_gemma":[0.0074833236,0.00007328603,0.0767434,0.0044226893,0.0001268665,0.000020995174,0.00019177776,0.8780988,0.0000791405,0.0011494901,0.031205116,0.00040511668],"about_ca_topic_score_codex":0.00021356349,"about_ca_topic_score_gemma":0.000042214073,"teacher_disagreement_score":0.2053689,"about_ca_system_score_codex":0.00037149253,"about_ca_system_score_gemma":0.00020866861,"threshold_uncertainty_score":0.99991894},"labels":[],"label_agreement":null},{"id":"W7117260517","doi":"10.5267/j.ijiec.2025.10.006","title":"Dynamic optimization model of carbon emission allocation in agricultural product supply chain based on differential game theory","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"Goodwill; Profit (economics); Supply chain; Game theory; Agriculture; Subsidy; Emissions trading; Reduction (mathematics); Product (mathematics)","score_opus":0.009421788157894451,"score_gpt":0.22267208325263235,"score_spread":0.2132502950947379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117260517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2255605,0.00014467254,0.7588214,0.0074355975,0.0062237736,0.001049681,0.00001927395,0.00004906867,0.00069601525],"genre_scores_gemma":[0.9971625,0.000018829885,0.0016060055,0.000096143645,0.00071315473,0.000016277332,0.00013042524,0.0000320838,0.0002245675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969447,0.00008211062,0.0014636928,0.00032103673,0.00089625904,0.00029219617],"domain_scores_gemma":[0.9968264,0.00030183938,0.0010661382,0.00018677727,0.0015869745,0.00003185407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009166906,0.00035974584,0.00045887026,0.003167688,0.000055853783,0.00027385578,0.000690003,0.00018062384,0.000037537928],"category_scores_gemma":[0.0014247067,0.00035325784,0.00021329147,0.0011978059,0.00004628271,0.00061941595,0.00016643583,0.00062868954,7.156793e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048520026,0.00048255915,0.0006242804,0.00014990823,0.000244832,0.000013262357,0.00011881072,0.9878018,0.0006442724,0.0052823913,0.00014365815,0.0040090308],"study_design_scores_gemma":[0.0035432945,0.00005039958,0.0014635251,0.0021874218,0.00017505937,0.0000015696753,0.00035626514,0.9910174,0.00019361569,0.00069690734,0.000056797777,0.00025772248],"about_ca_topic_score_codex":0.00006812459,"about_ca_topic_score_gemma":0.0000038551966,"teacher_disagreement_score":0.77160203,"about_ca_system_score_codex":0.0008901637,"about_ca_system_score_gemma":0.00037034875,"threshold_uncertainty_score":0.99989194},"labels":[],"label_agreement":null},{"id":"W7117260949","doi":"10.5267/j.ijiec.2025.12.004","title":"Research on integrated optimization of order allocation and lotsizing sequencing for mixed-model parallel assembly lines using improved intelligent optimization algorithm","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Assembly Line Balancing Optimization","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":"National Natural Science Foundation of China","keywords":"Mass customization; Flexibility (engineering); Production (economics); Minification; Build to order; Automotive industry; Production line; Multi-objective optimization","score_opus":0.0658462642163103,"score_gpt":0.34752993688970757,"score_spread":0.2816836726733973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117260949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077645076,0.0003534193,0.98608947,0.00045385506,0.0042327545,0.00090978417,0.00009355685,0.00007056614,0.00003207932],"genre_scores_gemma":[0.3145451,0.0003379096,0.6840033,0.000020903439,0.0007306557,0.000023524039,0.00022306938,0.00009173111,0.000023794873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958499,0.00016812106,0.0022904945,0.00041771954,0.00082779455,0.00044595436],"domain_scores_gemma":[0.98956347,0.0013412478,0.0009307471,0.00022118694,0.0077880607,0.00015528254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018865741,0.00047743204,0.00071134657,0.00300634,0.00021155071,0.0003387466,0.00055514695,0.00054060837,0.00000613884],"category_scores_gemma":[0.0027514375,0.0005438436,0.00019954449,0.0017243804,0.00008564277,0.00074029766,0.00013165214,0.0010480032,3.5822904e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021210127,0.00014424691,0.000017354116,0.00011584464,0.00076198735,0.0000031391799,0.0003667216,0.9828669,0.003294555,0.0012595308,0.00007937129,0.010878245],"study_design_scores_gemma":[0.0025349779,0.00027320662,0.0000067766046,0.0028062933,0.00022755387,0.000024494797,0.0006873218,0.98945516,0.0034759422,0.00010842833,0.000050498216,0.00034932772],"about_ca_topic_score_codex":0.000070170194,"about_ca_topic_score_gemma":0.0000045482,"teacher_disagreement_score":0.30678058,"about_ca_system_score_codex":0.0017547358,"about_ca_system_score_gemma":0.0015961343,"threshold_uncertainty_score":0.9997013},"labels":[],"label_agreement":null},{"id":"W7117261912","doi":"10.5267/j.ijiec.2025.11.002","title":"Multi-level interactive self-balancing optimization strategy of source-grid-load-storage considering cluster security constraints","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Integrated Energy Systems Optimization","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":"Robustness (evolution); Renewable energy; Electric power system; Scheduling (production processes); Energy security; Constraint (computer-aided design); Energy supply; Voltage; Robust optimization","score_opus":0.020317053589434194,"score_gpt":0.25848791795426684,"score_spread":0.23817086436483265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117261912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030171426,0.0003578601,0.95139676,0.00023850375,0.016461425,0.00045726533,0.00022387321,0.00016046467,0.0005323958],"genre_scores_gemma":[0.9400933,0.000103472805,0.05838586,0.000034161087,0.0011544474,0.000010735981,0.00006106157,0.00009011637,0.00006686442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950597,0.00022030804,0.0029426098,0.00037023582,0.00095428654,0.00045280642],"domain_scores_gemma":[0.99271166,0.0009662994,0.0014799641,0.00024784042,0.0043931087,0.00020113078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009814972,0.00062730996,0.00096210255,0.0017707832,0.000111845955,0.00033613876,0.00075801543,0.00064607756,0.00011395605],"category_scores_gemma":[0.0017343569,0.0007344502,0.00041844824,0.00092500687,0.00012573133,0.0009864458,0.00015477143,0.0016061615,0.000004763781],"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.00014233701,0.00026771388,0.00012811858,0.00012373088,0.0030073908,0.000050718307,0.0018631801,0.98915195,0.001040627,0.00043921222,0.00057608046,0.0032089457],"study_design_scores_gemma":[0.0050323615,0.00010293668,0.00012057159,0.003732043,0.00029891322,0.00023099923,0.0009830059,0.98613435,0.0023313842,0.000022726841,0.0005443866,0.00046634514],"about_ca_topic_score_codex":0.00014280129,"about_ca_topic_score_gemma":0.000016542755,"teacher_disagreement_score":0.9099218,"about_ca_system_score_codex":0.0023715582,"about_ca_system_score_gemma":0.0016480313,"threshold_uncertainty_score":0.99951065},"labels":[],"label_agreement":null},{"id":"W750376962","doi":"10.5267/j.ijiec.2015.6.002","title":"Multi-response optimization of process parameters using Taguchi method and grey relational analysis during turning AA 7075/SiC composite in dry and spray cooling environments","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Aluminum Alloys Composites Properties","field":"Engineering","cited_by":40,"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":"Kalinga Institute of Industrial Technology; Materials and Energy Research Center; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Grey relational analysis; Taguchi methods; Composite number; Materials science; Process (computing); Mechanical engineering; Process engineering; Composite material; Engineering; Computer science; Mathematics; Statistics","score_opus":0.03926344422751607,"score_gpt":0.27395678071149754,"score_spread":0.23469333648398147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W750376962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5975084,0.0001412924,0.402038,0.00001720455,0.00020932616,0.00006365948,0.000006941073,0.000013939078,0.0000012155991],"genre_scores_gemma":[0.8188311,0.000007961695,0.18106814,0.0000030183048,0.000054773787,0.0000020262037,0.000009587428,0.000021845633,0.0000015427242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851394,0.0000936489,0.0007245703,0.00013680922,0.00039245337,0.00013860699],"domain_scores_gemma":[0.9990385,0.00032216252,0.00027354844,0.000060529932,0.00019191019,0.00011332726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005087913,0.00017230168,0.00032482605,0.0010972748,0.00003456583,0.000068409645,0.00015043984,0.0001007783,0.0000021234132],"category_scores_gemma":[0.0003472442,0.00018834432,0.00006674205,0.00039959996,0.000038664486,0.0005034757,0.0000526656,0.0003443394,1.847928e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022258448,0.000029712726,0.021874778,0.000011101789,0.00059504015,0.0000169276,0.0010900223,0.9591849,0.016809098,0.0000072663847,3.66795e-7,0.00015822948],"study_design_scores_gemma":[0.0018284555,0.000034851357,0.01801264,0.00020303286,0.00015630505,0.0000794815,0.0001323539,0.97604346,0.0033390482,0.0000100565585,0.0000025782329,0.0001577088],"about_ca_topic_score_codex":0.000015577776,"about_ca_topic_score_gemma":0.0000016309815,"teacher_disagreement_score":0.22132272,"about_ca_system_score_codex":0.0002606085,"about_ca_system_score_gemma":0.000060512528,"threshold_uncertainty_score":0.76804584},"labels":[],"label_agreement":null},{"id":"W758110396","doi":"10.5267/j.ijiec.2015.5.003","title":"Credit financing in economic ordering policies for non-instantaneous deteriorating items with price dependent demand under permissible delay in payments: A new approach","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Banking stability, regulation, efficiency","field":"Economics, Econometrics and Finance","cited_by":22,"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 Delhi","keywords":"Payment; Economics; Business; Monetary economics; Finance; Econometrics","score_opus":0.047659519707258347,"score_gpt":0.2626562954843174,"score_spread":0.21499677577705906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W758110396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5935321,0.00008829731,0.40515375,0.0002053192,0.00067139714,0.00018486333,0.00001644937,0.000008958733,0.00013890462],"genre_scores_gemma":[0.9829184,0.000006352768,0.016560858,0.000015154789,0.0004354826,0.000010405517,0.000008921787,0.000022398326,0.000022065991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984837,0.000011759871,0.0009788214,0.00020459444,0.0001105147,0.00021057771],"domain_scores_gemma":[0.99900997,0.00017508728,0.000506787,0.000088074004,0.0001323366,0.00008773238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078659464,0.00014112369,0.0003083403,0.0007196247,0.000033475088,0.00015497887,0.000284652,0.000088930385,0.00000666557],"category_scores_gemma":[0.00035264844,0.00015665319,0.000056123463,0.00023871532,0.000016769574,0.00039402305,0.00003933461,0.00023157892,0.0000022543336],"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.00005586254,0.00006465744,0.018513134,0.0000069771268,0.000042497868,0.000009027492,0.0011187606,0.9761386,0.000017105795,0.0034930762,0.0000318161,0.00050847064],"study_design_scores_gemma":[0.004624386,0.00016711865,0.0091164,0.00023872741,0.000007850708,0.00021665238,0.00040579055,0.98170435,0.00003868791,0.0027756002,0.0004382573,0.00026618148],"about_ca_topic_score_codex":0.00043829277,"about_ca_topic_score_gemma":0.00012402612,"teacher_disagreement_score":0.3893863,"about_ca_system_score_codex":0.0010824606,"about_ca_system_score_gemma":0.00038240408,"threshold_uncertainty_score":0.63881314},"labels":[],"label_agreement":null},{"id":"W767145735","doi":"10.5267/j.ijiec.2015.4.003","title":"Modeling and optimization of laser direct structuring process using artificial neural network and response surface methodology","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Laser Material Processing Techniques","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":"Response surface methodology; Artificial neural network; Structuring; Process (computing); Computer science; Process optimization; Surface (topology); Artificial intelligence; Engineering; Machine learning; Mathematics; Chemical engineering","score_opus":0.10762024680694074,"score_gpt":0.3254857763958546,"score_spread":0.21786552958891384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W767145735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64905804,0.00006945773,0.34991655,0.00004128642,0.0008112335,0.00004216834,0.0000070106353,0.00005075984,0.0000034832046],"genre_scores_gemma":[0.8660532,0.000006387662,0.1335377,0.0000035311475,0.00037436374,5.542858e-7,0.0000025836775,0.00002142851,2.2635658e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990355,0.00007639247,0.00048511437,0.000083104096,0.00020809987,0.00011181832],"domain_scores_gemma":[0.9991594,0.0001919781,0.00013398823,0.00004260666,0.0003934347,0.00007862332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007130332,0.000116822586,0.00022548395,0.0001902982,0.000025280728,0.00007404843,0.00012936215,0.000093944735,0.0000015624203],"category_scores_gemma":[0.00048298296,0.0001210461,0.00002567698,0.00013787324,0.000026120017,0.0003141353,0.000040213294,0.00018723693,6.917041e-8],"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.00019374714,0.0000053983617,0.00006455022,0.0000115756875,0.000064332904,0.0000068776635,0.0002773692,0.99618703,0.0027046122,0.00003384121,0.0000066149564,0.000444051],"study_design_scores_gemma":[0.00039323472,0.00004831742,0.000011198495,0.00013769555,0.000028912127,0.00010985772,0.00007245965,0.9907322,0.0077569364,0.00060572237,0.0000042311067,0.00009927001],"about_ca_topic_score_codex":0.0000114139375,"about_ca_topic_score_gemma":6.275535e-7,"teacher_disagreement_score":0.21699518,"about_ca_system_score_codex":0.000079445315,"about_ca_system_score_gemma":0.00007898929,"threshold_uncertainty_score":0.49361166},"labels":[],"label_agreement":null}]}