{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"66173f754bec","filters":{"venue":"Yugoslav journal of operations research"}},"results":[{"id":"W3021274929","doi":"10.2298/yjor0501025s","title":"The operational flight and multi-crew scheduling problem","year":2005,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Crew scheduling; Operations research; Computer science; Column generation; Scheduling (production processes); Schedule; Set cover problem; Set (abstract data type); Mathematical optimization; Aeronautics; Engineering; Mathematics","authors":[{"name":"Mirela Stojković","is_ca":true},{"name":"François Soumis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06053945776518042,"gpt":0.3664722131157127,"spread":0.3059327553505322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992634,0.001412969,0.001026299,0.0006043792,0.0006125867,0.001309658,0.001351994,0.001482864,0.006228427],"category_scores_gemma":[0.00149373,0.0004099247,0.001002463,0.001155076,0.0006641317,0.001773934,0.001247149,0.001307431,0.000713271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006836157,"about_ca_system_score_gemma":0.001647779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003694369,"about_ca_topic_score_gemma":0.002484425,"domain_scores_codex":[0.9987181,0.0004474279,0.00006170411,0.0002759696,0.0002488561,0.0002479718],"domain_scores_gemma":[0.9993694,0.0003318491,0.00007476512,0.00006864484,0.00006703397,0.00008823617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003707445,0.0003648135,0.001350107,0.0006391053,0.0001524902,0.0008508879,0.0002395483,0.7329001,0.00704771,0.08230184,0.01328408,0.1604985],"study_design_scores_gemma":[0.0001004232,0.0002725165,0.0008750228,0.00003260181,0.00005539718,0.0005279796,0.0001740665,0.9360147,0.002039467,0.0331616,0.02671084,0.00003550563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05324058,0.001117768,0.9181166,0.0008042248,0.000411502,0.0002974459,0.0007668798,0.0003587898,0.02488618],"genre_scores_gemma":[0.5632855,0.001724678,0.4142272,0.00035007,0.0006052383,0.0004945878,0.001937714,0.000256001,0.017119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006228427,"threshold_uncertainty_score":0.02083611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2795213612","doi":"10.2298/yjor180120014g","title":"Less is more: Simplified Nelder-Mead method for large unconstrained optimization","year":2018,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Regular polygon; Mathematical optimization; Simplex; Simplex algorithm; Simple (philosophy); Algorithm; Computer science; Continuous optimization; Mathematics; Optimization problem; Convex optimization; Linear programming; Combinatorics; Multi-swarm optimization; Geometry","authors":[{"name":"Kayo Gonçalves-e-Silva","is_ca":false},{"name":"Daniel Aloise","is_ca":true},{"name":"Samuel Xavier‐de‐Souza","is_ca":false},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2462101905584332,"gpt":0.5465173684657684,"spread":0.3003071779073352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345116,0.0009325009,0.001158331,0.0006911702,0.0005575462,0.0008261875,0.001475832,0.001052008,0.007407563],"category_scores_gemma":[0.002639701,0.000391587,0.0009303745,0.0008214011,0.0004714459,0.001007983,0.001380452,0.001307881,0.001589382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004581884,"about_ca_system_score_gemma":0.001207313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005291484,"about_ca_topic_score_gemma":0.009849596,"domain_scores_codex":[0.9995863,0.0001586428,0.00001754735,0.00005117104,0.0001521223,0.00003425058],"domain_scores_gemma":[0.9993062,0.0003990541,0.00003931987,0.00008611032,0.0001248119,0.00004452751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002114666,0.0001442355,0.0009699812,0.0006275765,0.0001247064,0.0002640488,0.0001455132,0.6524421,0.006422582,0.03256213,0.02041029,0.2856754],"study_design_scores_gemma":[0.00002782968,0.00002587484,0.0001537978,0.00001912017,0.000008130884,0.00004630433,0.00001201559,0.982617,0.0007589769,0.008770484,0.007549894,0.0000106677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006523886,0.0007299618,0.9855726,0.0002727262,0.00008654703,0.00008154849,0.0001748568,0.0006784974,0.005879445],"genre_scores_gemma":[0.1029024,0.0005450828,0.8875598,0.0003686829,0.0001006716,0.0005307754,0.0006306421,0.0005286453,0.006833348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007407563,"threshold_uncertainty_score":0.02478081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020546119","doi":"10.2298/yjor0302199b","title":"Further notes on convergence of the Weiszfeld algorithm","year":2003,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Counterexample; Convergence (economics); Conjecture; Mathematics; Property (philosophy); Mathematical economics; Calculus (dental); Algorithm; Epistemology; Discrete mathematics; Economics; Philosophy","authors":[{"name":"Jack Brimberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1676460810047468,"gpt":0.4494282121498596,"spread":0.2817821311451127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004294008,0.001148163,0.0009839915,0.002702374,0.001882306,0.002320722,0.001727941,0.001917651,0.01973286],"category_scores_gemma":[0.02694325,0.0003622147,0.001581956,0.002512253,0.00388439,0.006049368,0.002580694,0.00568784,0.002989049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002657963,"about_ca_system_score_gemma":0.001244847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004867228,"about_ca_topic_score_gemma":0.003083443,"domain_scores_codex":[0.9980025,0.0006815764,0.0001126581,0.0002735884,0.0007553312,0.0001743306],"domain_scores_gemma":[0.988359,0.008550041,0.0003898393,0.0008059917,0.001578337,0.0003167735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005153516,0.0000276635,0.0003012306,0.00006387084,0.00001163819,0.0001044141,0.0002029382,0.004745021,0.000598445,0.9770876,0.005209349,0.01159628],"study_design_scores_gemma":[0.00002931076,0.00003817019,0.0003821873,0.00009002531,0.00001566132,0.0001358931,0.0001025122,0.0515013,0.001278282,0.9235959,0.02279124,0.00003949829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04393198,0.008991927,0.5508321,0.01540003,0.002286419,0.000208624,0.0004109126,0.0007410979,0.3771968],"genre_scores_gemma":[0.623277,0.00929784,0.2000429,0.004140567,0.002903953,0.0004732098,0.0006713408,0.0008340999,0.158359],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01973286,"threshold_uncertainty_score":0.06601298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044393101","doi":"10.2298/yjor0402147c","title":"On some interconnections between combinatorial optimization and extremal graph theory","year":2004,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Maxima and minima; Heuristics; Combinatorial optimization; Extremal graph theory; Extremal optimization; Mathematics; Graph theory; Graph; Optimization problem; Mathematical optimization; Combinatorics; Computer science; Line graph; Voltage graph; Meta-optimization","authors":[{"name":"Dragoš Cvetković","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Vera Kovačevíc-Vujčić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04528667587623218,"gpt":0.3250477698478197,"spread":0.2797610939715875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004082447,0.001239925,0.001517858,0.003530878,0.002094905,0.003928159,0.002334026,0.00355912,0.00606954],"category_scores_gemma":[0.01322936,0.0007902093,0.001626382,0.005210557,0.007831735,0.01190847,0.002533909,0.005200099,0.0005769182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036824,"about_ca_system_score_gemma":0.000623736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028127,"about_ca_topic_score_gemma":0.0009339107,"domain_scores_codex":[0.9971329,0.001622073,0.0001265753,0.0003442359,0.0005728468,0.0002013987],"domain_scores_gemma":[0.985682,0.01210319,0.0005644896,0.0007685745,0.0006522248,0.0002295427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001244026,0.0000227478,0.0001541068,0.00007434168,0.00001009574,0.00007863595,0.0000730571,0.006168961,0.00008885679,0.9854565,0.001774494,0.006085785],"study_design_scores_gemma":[0.000002920328,0.00000910977,0.0001123492,0.00003575712,0.000003586622,0.00003486328,0.00002981065,0.01038194,0.00004605053,0.9870366,0.002300785,0.000006310436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04031474,0.03297393,0.7611156,0.03404621,0.001166562,0.00008192526,0.0002702981,0.0002830366,0.1297477],"genre_scores_gemma":[0.6578542,0.06420278,0.2433734,0.008544009,0.008399711,0.0004498847,0.0004795139,0.0005163967,0.01618011],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00606954,"threshold_uncertainty_score":0.02159029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2531881412","doi":"10.2298/yjor160517018b","title":"Using injection points in reformulation local search for solving continuous location problems","year":2016,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Ministry of Education and Science of the Republic of Kazakhstan; Ministry of Education, Science and Technology; Ministerio de Economía y Competitividad","keywords":"Continuous phase modulation; Continuous modelling; Benchmark (surveying); Local search (optimization); Relaxation (psychology); Mathematical optimization; Exploit; Mathematics; Limiting; Relation (database); Computer science; Applied mathematics; Algorithm; Mathematical analysis; Data mining","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Zvi Drezner","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Saı̈d Salhi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1215643658333669,"gpt":0.4073655037568511,"spread":0.2858011379234842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003685101,0.001157778,0.001737838,0.001167885,0.0003755431,0.001240104,0.001500536,0.001195403,0.00225441],"category_scores_gemma":[0.006811182,0.000702236,0.001050955,0.001128349,0.001840271,0.001903758,0.00196771,0.00170277,0.0004820711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009880922,"about_ca_system_score_gemma":0.001066474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002677663,"about_ca_topic_score_gemma":0.001924441,"domain_scores_codex":[0.9987581,0.0008142103,0.00004466781,0.0001022957,0.0002070762,0.00007371153],"domain_scores_gemma":[0.9972779,0.001996132,0.0002248228,0.0001643863,0.0002592313,0.00007753885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008091027,0.00006339174,0.0002763061,0.0001181203,0.00003260906,0.00005704661,0.000108261,0.9377258,0.001302817,0.03215961,0.0005396771,0.02753548],"study_design_scores_gemma":[0.00001493321,0.00005013908,0.00001853664,0.000009409601,0.00000500753,0.000007749648,0.000009895819,0.9941229,0.0003682974,0.005037032,0.0003508535,0.00000513934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009946603,0.0002785298,0.9883837,0.0001083659,0.00001474367,0.00004428493,0.00001300926,0.0001452561,0.001065593],"genre_scores_gemma":[0.4095772,0.000497407,0.5866063,0.0001424274,0.00006027072,0.000460002,0.0001266498,0.000185949,0.002343732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003685101,"threshold_uncertainty_score":0.01948893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2286452095","doi":"10.2298/yjor151102003a","title":"A new efficient RLF-like algorithm for the vertex coloring problem","year":2016,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vertex (graph theory); Greedy algorithm; Heuristics; Greedy coloring; Algorithm; Mathematics; Computer science; Fractional coloring; Chromatic scale; Combinatorics; Mathematical optimization; Graph","authors":[{"name":"Mouhamed M. Adegbindin","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Martine Bellaïche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3141830685573495,"gpt":0.5029930622972192,"spread":0.1888099937398697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796647,0.001380562,0.001605798,0.001539477,0.0009408246,0.001211493,0.003105657,0.002111849,0.006220697],"category_scores_gemma":[0.002696206,0.0006445585,0.001560218,0.001925997,0.0006610599,0.001591044,0.001128141,0.00166376,0.001851131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001854241,"about_ca_system_score_gemma":0.003152465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006935711,"about_ca_topic_score_gemma":0.009603504,"domain_scores_codex":[0.998985,0.0002288379,0.00004327385,0.0002732111,0.0002842067,0.0001854239],"domain_scores_gemma":[0.9992768,0.0002889262,0.00006758903,0.0001320748,0.0001637283,0.00007094925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002111805,0.0003254914,0.000611963,0.0003249513,0.00008125253,0.0001554995,0.0001301012,0.4854987,0.008205281,0.02643754,0.0235381,0.45448],"study_design_scores_gemma":[0.0001079697,0.00007396397,0.0001434228,0.00002026589,0.00001797069,0.000138778,0.00002172574,0.9783201,0.001476182,0.01190342,0.007750042,0.00002618578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006006977,0.0002885495,0.9888651,0.0001938598,0.0001247293,0.0001676511,0.0001749816,0.001368245,0.002809983],"genre_scores_gemma":[0.04623983,0.0001525833,0.9489161,0.0001969715,0.00007137698,0.0003182733,0.0007584475,0.0002897436,0.003056644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006935711,"threshold_uncertainty_score":0.02081031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081059316","doi":"10.2298/yjor0202157h","title":"A separable approximation dynamic programming algorithm for economic dispatch with transmission losses","year":2002,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Lagrange multiplier; Economic dispatch; Mathematical optimization; Separable space; Convergence (economics); Quadratic equation; Quadratic programming; Dynamic programming; Multiplier (economics); Mathematics; Transmission (telecommunications); Stability (learning theory); Iterative method; Computer science; Algorithm; Electric power system","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02603753094713742,"gpt":0.3059293978766998,"spread":0.2798918669295624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192043,0.001084679,0.001318489,0.0006258431,0.0004585889,0.001084581,0.00111995,0.0007549936,0.004133264],"category_scores_gemma":[0.001401831,0.0006149782,0.0006055846,0.001263462,0.0005983149,0.001155757,0.001167162,0.001844317,0.001140869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000888322,"about_ca_system_score_gemma":0.001203749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003206668,"about_ca_topic_score_gemma":0.002785248,"domain_scores_codex":[0.9995956,0.0001230098,0.00001623738,0.00006821994,0.0001563312,0.00004061903],"domain_scores_gemma":[0.9997376,0.0001285076,0.0000282153,0.00002829204,0.0000571681,0.00002021703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001155968,0.00006662058,0.0001322458,0.00008749573,0.00004153267,0.00006212938,0.00007674121,0.7095805,0.00250129,0.06694547,0.003736975,0.2166534],"study_design_scores_gemma":[0.00001471096,0.00001209992,0.00002156175,0.000003699034,0.000003093593,0.00001370494,0.000003229206,0.9898127,0.0002805299,0.008112492,0.001718218,0.00000394413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001569197,0.00007392667,0.9969785,0.00005368814,0.00001639479,0.0000171642,0.00001472039,0.000178495,0.001097919],"genre_scores_gemma":[0.1176944,0.0003550939,0.873807,0.0000653776,0.00005235643,0.000302349,0.000175763,0.0002513471,0.007296409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004133264,"threshold_uncertainty_score":0.01382709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048023919","doi":"10.2298/yjor130704039h","title":"A note on r-equitable k-colorings of trees","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Graph; Order (exchange); Discrete mathematics; Economics","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Bernard Ries","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08322712656480684,"gpt":0.4109221989972904,"spread":0.3276950724324835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289071,0.0005004616,0.0005104445,0.0006133079,0.001389425,0.001234216,0.001103139,0.0004415272,0.003192307],"category_scores_gemma":[0.004564224,0.0004836985,0.0006368419,0.001266959,0.001761718,0.002732401,0.00171814,0.002775733,0.00066666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041001,"about_ca_system_score_gemma":0.0006575572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003041277,"about_ca_topic_score_gemma":0.00358255,"domain_scores_codex":[0.9986184,0.0004409305,0.0001001155,0.0002994705,0.0002973758,0.0002437212],"domain_scores_gemma":[0.996901,0.001507612,0.0002554245,0.0007054158,0.0004258233,0.00020476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003493461,0.0001153222,0.00245592,0.0003232725,0.00004045163,0.0007780049,0.001147183,0.03113643,0.0194514,0.8492239,0.01038883,0.08458996],"study_design_scores_gemma":[0.00005746243,0.0002335905,0.002768316,0.0001228754,0.00007675901,0.001446486,0.0006834556,0.06378946,0.01562894,0.8429469,0.07216135,0.00008439353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2085714,0.003867033,0.6578529,0.003499144,0.001103393,0.000125993,0.0004300631,0.000812916,0.1237371],"genre_scores_gemma":[0.7826814,0.00393183,0.1976884,0.0008590282,0.0006852847,0.0001177783,0.0003717909,0.0003597849,0.01330465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003192307,"threshold_uncertainty_score":0.0106793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975847110","doi":"10.2298/yjor130402037h","title":"On the maximum orders of an induced forest, an induced tree, and a stable set","year":2013,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Graph; Tree (set theory); Integer (computer science); Order (exchange); Upper and lower bounds; Set (abstract data type); Stability (learning theory); Discrete mathematics; Computer science","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Odile Marcotte","is_ca":true},{"name":"David Schindl","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1236571809826586,"gpt":0.400127747145303,"spread":0.2764705661626444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268178,0.0009922175,0.001170362,0.0028909,0.001890393,0.003643111,0.001558759,0.0009069074,0.006077562],"category_scores_gemma":[0.01304951,0.0008795815,0.0007596398,0.001955675,0.002929952,0.008089023,0.001764851,0.00197411,0.0008421262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002902214,"about_ca_system_score_gemma":0.001340043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002561455,"about_ca_topic_score_gemma":0.004254316,"domain_scores_codex":[0.9986143,0.0003409963,0.00007414314,0.0002598313,0.0003533225,0.0003573733],"domain_scores_gemma":[0.9718679,0.02142694,0.002040619,0.001290941,0.00123158,0.002142094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001630883,0.0003496441,0.01040104,0.0004858844,0.000088972,0.0004299138,0.001328062,0.08061583,0.01194159,0.8307186,0.008020554,0.05398901],"study_design_scores_gemma":[0.0001271149,0.000388156,0.007299026,0.0001715102,0.0001102117,0.0007346527,0.0006605528,0.1755797,0.007507216,0.7988343,0.008499715,0.00008771084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7577589,0.003028191,0.1596635,0.00274119,0.0001597811,0.0001245316,0.002064,0.0004493883,0.07401051],"genre_scores_gemma":[0.9365495,0.001875324,0.04940726,0.0002373974,0.0003850663,0.0001736777,0.001524725,0.0002405238,0.009606641],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006077562,"threshold_uncertainty_score":0.02105713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3015902257","doi":"10.2298/yjor200315008b","title":"Improved starting solutions for the planar p-median problem","year":2020,"lang":"en","type":"preprint","venue":"Yugoslav journal of operations research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematical optimization; Local search (optimization); Heuristic; Vertex (graph theory); Cluster analysis; Set (abstract data type); Planar; Mathematics; Local optimum; Iterated function; Greedy algorithm; Simple (philosophy); Iterated local search; Computer science; Algorithm; Artificial intelligence; Combinatorics; Graph","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Zvi Drezner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2304685259582979,"gpt":0.3775579500866497,"spread":0.1470894241283518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001907137,0.001243886,0.001345811,0.001965001,0.001038101,0.001448112,0.002424847,0.002201416,0.007592528],"category_scores_gemma":[0.007309269,0.0007702477,0.001572755,0.001566175,0.0009288582,0.002102481,0.002638197,0.002119498,0.001784673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009242217,"about_ca_system_score_gemma":0.001328684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001508607,"about_ca_topic_score_gemma":0.002115783,"domain_scores_codex":[0.999068,0.0003505591,0.00004113749,0.0001755185,0.0002584841,0.0001064177],"domain_scores_gemma":[0.9981116,0.001097681,0.0001837682,0.0001810174,0.0003115731,0.0001144089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001549085,0.0001095197,0.0004971379,0.0002347478,0.00005940971,0.0001755541,0.0001912119,0.7722478,0.002634913,0.1357222,0.004413804,0.08355876],"study_design_scores_gemma":[0.00007198493,0.0001273079,0.000123121,0.00004661089,0.00001811961,0.00008581782,0.00007251382,0.9227118,0.001527605,0.06900344,0.006186315,0.00002537762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005842611,0.0001547741,0.991174,0.00009723439,0.00002614933,0.00004676645,0.00005715843,0.0001556809,0.002445577],"genre_scores_gemma":[0.1002027,0.000390146,0.8946417,0.0001116883,0.0000527189,0.0003560848,0.0004771139,0.0002159099,0.003551938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007592528,"threshold_uncertainty_score":0.02539957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360782622","doi":"10.2298/yjor221016004m","title":"A managerial approach in resource allocation models: An application in US and Canadian oil and gas companies","year":2023,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Resource allocation; Planner; Data envelopment analysis; Novelty; Order (exchange); Environmental economics; Greenhouse gas; Resource (disambiguation); Computer science; Adaptation (eye); Perspective (graphical); Resource management (computing); Business; Industrial organization; Operations research; Economics","authors":[{"name":"Hengameh Mohamadinejad","is_ca":false},{"name":"Alireza Amirteimoori","is_ca":false},{"name":"Sohrab Kordrostami","is_ca":false},{"name":"Lotfi Hosseinzadeh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.203182646770192,"gpt":0.4388504875541352,"spread":0.2356678407839432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357219,0.001001563,0.0008762013,0.0008989704,0.001901617,0.002096547,0.001247594,0.001836861,0.00242517],"category_scores_gemma":[0.003871163,0.0003720782,0.0007200921,0.001909953,0.001174289,0.00076768,0.001075767,0.001297372,0.0001244125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009688646,"about_ca_system_score_gemma":0.007152091,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.3292801,"about_ca_topic_score_gemma":0.3483469,"domain_scores_codex":[0.9990588,0.0005396715,0.00002910744,0.00009943762,0.00013638,0.0001366712],"domain_scores_gemma":[0.9981831,0.001423316,0.0001009463,0.00004005938,0.0001873888,0.00006519006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004661475,0.0001153996,0.001357491,0.00008478146,0.00002486222,0.0001256454,0.0002385204,0.9305725,0.0002966632,0.05309935,0.0005094864,0.01352869],"study_design_scores_gemma":[0.000015323,0.00003537917,0.0006178301,0.00001921554,0.00001497457,0.00001665868,0.0003007147,0.9894056,0.000119092,0.008144377,0.00129629,0.00001453269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4069022,0.002446024,0.5300107,0.003095679,0.000109792,0.0004642736,0.0003783023,0.0001632694,0.05642977],"genre_scores_gemma":[0.9297489,0.001006555,0.06302002,0.0001001389,0.00002580955,0.0002058626,0.0000620551,0.00001575071,0.005814791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6707199,"threshold_uncertainty_score":0.6547269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942306438","doi":"10.2298/yjor181115010d","title":"Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices","year":2019,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Connectivity; Topological index; Graph; Order (exchange); Vertex connectivity; Discrete mathematics","authors":[{"name":"Gauvain Devillez","is_ca":false},{"name":"Alain Hertz","is_ca":true},{"name":"Hadrien Mélot","is_ca":false},{"name":"Pierre Hauweele","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06781829762024214,"gpt":0.408242393577595,"spread":0.3404240959573528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033176,0.0003581175,0.0004533717,0.001689336,0.00054459,0.0009297787,0.0004836607,0.000459485,0.001190046],"category_scores_gemma":[0.002774114,0.0001675779,0.0002229268,0.001093207,0.0008617826,0.001633803,0.0005004601,0.0004047235,0.0001166986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008266104,"about_ca_system_score_gemma":0.0002830715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005846245,"about_ca_topic_score_gemma":0.0008480428,"domain_scores_codex":[0.9997762,0.00003103364,0.00001206463,0.0000749871,0.00006113245,0.00004461078],"domain_scores_gemma":[0.9983349,0.0008068698,0.0003476441,0.000150688,0.0001734069,0.0001864836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001241963,0.0001713299,0.0254064,0.0005690228,0.0001143033,0.001126418,0.0010731,0.1743778,0.07594725,0.6539543,0.006228749,0.0597894],"study_design_scores_gemma":[0.00008798291,0.0002491807,0.01838502,0.00009523879,0.0001055322,0.002125916,0.0005194605,0.361196,0.02131255,0.587532,0.00832666,0.00006436035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9114479,0.0005010695,0.07365498,0.0002443323,0.00001987226,0.00002167258,0.0005385792,0.0001206147,0.01345092],"genre_scores_gemma":[0.9819288,0.0002998464,0.01595777,0.00002815431,0.00003410917,0.0000278426,0.0004147987,0.00003968016,0.001269045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001689336,"threshold_uncertainty_score":0.005997539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802307407","doi":"10.2298/yjor171116015b","title":"Financial planning in the public sector and the Newsvendor problem","year":2018,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Newsvendor model; Homogeneous; Business; Finance; Public sector; Economics; Marketing; Supply chain; Economy","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Abdalla Mansur","is_ca":false},{"name":"Ghaleb A. El Refae","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1156912356275451,"gpt":0.3475770187187019,"spread":0.2318857830911569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006716808,0.0005455769,0.001100373,0.0008962153,0.001355559,0.003683022,0.0008237707,0.002837033,0.005054022],"category_scores_gemma":[0.01760454,0.000519595,0.000627907,0.001522764,0.004309717,0.005565355,0.001013834,0.002408844,0.0002489919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002368049,"about_ca_system_score_gemma":0.001313362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003252489,"about_ca_topic_score_gemma":0.001563746,"domain_scores_codex":[0.9977238,0.001311661,0.0001051724,0.0002469371,0.0002755891,0.000336865],"domain_scores_gemma":[0.9804394,0.0156298,0.002349876,0.0003715057,0.0006039962,0.0006054665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002009668,0.00009385229,0.00242408,0.0001717839,0.00006575632,0.0009159829,0.0007711613,0.1131731,0.0002940487,0.8527684,0.007160461,0.02196043],"study_design_scores_gemma":[0.0001091914,0.00005913461,0.0007865542,0.00006906425,0.00002913224,0.0002522281,0.0007412658,0.1846224,0.0003021546,0.8059829,0.006998481,0.00004744634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4129712,0.01025398,0.4368892,0.03472449,0.0006587176,0.0001926093,0.0004222329,0.0003459314,0.1035416],"genre_scores_gemma":[0.9788617,0.002293024,0.01163615,0.0003214896,0.0003341733,0.00007723371,0.00007308367,0.0000316674,0.006371466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006716808,"threshold_uncertainty_score":0.03552228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2900942427","doi":"10.2298/yjor180418031k","title":"Asymptotic results for the first and second moments and numerical computations in discrete-time bulk-renewal process","year":2018,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; Canadian Armed Forces","funders":"","keywords":"Renewal theory; Mathematics; Limit (mathematics); Moment (physics); Constant (computer programming); Applied mathematics; Discrete time and continuous time; Computation; Term (time); Process (computing); Asymptotic analysis; Mathematical analysis; Computer science; Algorithm; Statistics; Physics","authors":[{"name":"J James Kim","is_ca":true},{"name":"L Mohan Chaudhry","is_ca":true},{"name":"Abdalla Mansur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02668776191856606,"gpt":0.3792068938149303,"spread":0.3525191318963642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002686835,0.0005755057,0.0006784698,0.001920517,0.0004267673,0.001092709,0.001290307,0.0008835773,0.003996958],"category_scores_gemma":[0.0176386,0.000308666,0.001029805,0.001212302,0.001587075,0.00292262,0.001154143,0.002195339,0.000824585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272081,"about_ca_system_score_gemma":0.001114879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002465802,"about_ca_topic_score_gemma":0.001683512,"domain_scores_codex":[0.9991366,0.0002648504,0.00005610348,0.00008460772,0.0003718627,0.00008600421],"domain_scores_gemma":[0.9941515,0.004032457,0.0003224523,0.0004538235,0.0008878029,0.0001519366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003477638,0.00005520633,0.0008817526,0.0001843448,0.00002487213,0.0001892134,0.0001533851,0.1796275,0.002946274,0.7928317,0.002059606,0.02101134],"study_design_scores_gemma":[0.000004781734,0.000009478151,0.000304999,0.00002867927,0.00001027394,0.00008599028,0.00002122957,0.8429453,0.0007177018,0.1543332,0.001526035,0.00001229276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01441463,0.001422181,0.9696127,0.0005408551,0.0001418527,0.00002622518,0.00006098165,0.0002656167,0.01351495],"genre_scores_gemma":[0.7401866,0.003419873,0.2388373,0.000475477,0.0006057214,0.0002569099,0.0003126196,0.0004204373,0.01548501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003996958,"threshold_uncertainty_score":0.01420945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054116841","doi":"10.2298/yjor1101011d","title":"On-line computation and maximum-weighted hereditary subgraph problems","year":2011,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Computation; Line (geometry); Focus (optics); Mathematics; Graph; Subgraph isomorphism problem; Set (abstract data type); Computer science; Algorithm; Line graph; Physics","authors":[{"name":"Marc Demange","is_ca":false},{"name":"Bernard Kouakou","is_ca":true},{"name":"Éric Soutif","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1693381571729664,"gpt":0.3650028625847389,"spread":0.1956647054117725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002307285,0.001357386,0.001519714,0.0008274679,0.001255723,0.003011135,0.00450059,0.002511453,0.01174338],"category_scores_gemma":[0.0114807,0.000680979,0.0009853115,0.002669357,0.00187899,0.008384179,0.002396876,0.001870411,0.001097924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173059,"about_ca_system_score_gemma":0.001382338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001987054,"about_ca_topic_score_gemma":0.00270094,"domain_scores_codex":[0.9958743,0.00200678,0.0001169693,0.0007585418,0.0005829427,0.0006604529],"domain_scores_gemma":[0.9878808,0.007718988,0.001303344,0.002085361,0.0004769945,0.0005345044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001100226,0.00101047,0.0029608,0.0005180535,0.0002153472,0.0005692,0.0003783223,0.5873718,0.004144821,0.2852655,0.01693069,0.09953485],"study_design_scores_gemma":[0.00009078386,0.000112404,0.0003229974,0.00001856069,0.00002338524,0.0001502727,0.0001326273,0.8189533,0.002297754,0.1751124,0.002768663,0.00001690031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2448724,0.0006725615,0.7271088,0.00256612,0.0001101251,0.0003752891,0.0007787391,0.001095078,0.0224209],"genre_scores_gemma":[0.7323515,0.0006102792,0.2531857,0.0004599798,0.000259706,0.0003617778,0.00176685,0.0004315131,0.01057249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01174338,"threshold_uncertainty_score":0.0392856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968085493","doi":"10.2298/yjor0501005b","title":"Applications of a special polynomial class of TSP","year":2005,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Class (philosophy); Mathematics; Combinatorics; Time complexity; Treasure; Measure (data warehouse); Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence; Database","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Ephraim Korach","is_ca":false},{"name":"Mokhtar Amami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05777407111335551,"gpt":0.3914086477752973,"spread":0.3336345766619417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499429,0.0005839057,0.0006989078,0.000707494,0.0009967558,0.0008892145,0.001156788,0.001112666,0.01125132],"category_scores_gemma":[0.003108674,0.0002277962,0.00107958,0.001512203,0.0007908308,0.001358398,0.001166529,0.001797657,0.0008328771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346695,"about_ca_system_score_gemma":0.0008151231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005341635,"about_ca_topic_score_gemma":0.004926607,"domain_scores_codex":[0.999432,0.000150479,0.00002230919,0.0001265105,0.0001498732,0.0001188565],"domain_scores_gemma":[0.9987373,0.0006670497,0.0001186353,0.0002206323,0.0001435337,0.0001128805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001335092,0.0001884259,0.001148771,0.000384923,0.00005613693,0.0004644243,0.0002008361,0.2614272,0.002326855,0.5760356,0.03778946,0.1198439],"study_design_scores_gemma":[0.0000381465,0.0000544957,0.0006273742,0.00002609085,0.00001744177,0.000513511,0.00008217531,0.6248387,0.0006298158,0.3210996,0.05205862,0.00001409661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0779367,0.003507137,0.7434479,0.003862283,0.001062087,0.0001848708,0.0006259551,0.0008512143,0.1685218],"genre_scores_gemma":[0.7709286,0.004917888,0.1858468,0.0009784109,0.001687347,0.0001849564,0.0008852586,0.0003365649,0.03423415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01125132,"threshold_uncertainty_score":0.03763944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998589625","doi":"10.2298/yjor0802205h","title":"A group decision-making aggregation process","year":2008,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Vagueness; Aggregate (composite); Computer science; Group decision-making; Process (computing); Granularity; Artificial intelligence; Representation (politics); Homogeneous; Interval (graph theory); Frame (networking); Decision problem; Natural language processing; Mathematics; Linguistics; Management science; Fuzzy logic; Algorithm; Psychology; Social psychology","authors":[{"name":"N. Halouani","is_ca":false},{"name":"Habib Chabchoub","is_ca":false},{"name":"Jean‐Marc Martel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3999634274497343,"gpt":0.5749928622698741,"spread":0.1750294348201398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007960312,0.001209833,0.001585007,0.002006026,0.00222126,0.003957694,0.001651116,0.001899242,0.008348744],"category_scores_gemma":[0.008754904,0.000412759,0.001684385,0.003448284,0.001528746,0.003156592,0.0035174,0.001687158,0.001304068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410744,"about_ca_system_score_gemma":0.002651619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002373615,"about_ca_topic_score_gemma":0.001527033,"domain_scores_codex":[0.9930457,0.003462176,0.0003979935,0.001085909,0.001603087,0.0004050106],"domain_scores_gemma":[0.9963257,0.002194181,0.000272816,0.0003593789,0.0006477323,0.0002001829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003283128,0.0003370091,0.002947877,0.0006345419,0.000441117,0.001111379,0.004559646,0.3281267,0.004499001,0.4506923,0.005614385,0.2007078],"study_design_scores_gemma":[0.0000659395,0.0002769408,0.0005770875,0.0001205054,0.000156662,0.0002002702,0.0006276403,0.6666578,0.002059427,0.3141673,0.01502813,0.00006233567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02061299,0.0003336175,0.9653428,0.0008932299,0.00008719664,0.0006517185,0.0001352242,0.0002012162,0.01174199],"genre_scores_gemma":[0.4235697,0.0007046105,0.5649427,0.0002407824,0.0001856999,0.00097693,0.0003605927,0.00005132997,0.008967568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008348744,"threshold_uncertainty_score":0.04209864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}