{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351974,0.00007592553,0.00009309444,0.0002142678,0.0007115233,0.000293512,0.0001720574,0.00004596268,0.00007776164],"category_scores_gemma":[0.0001238648,0.00005381136,0.00003449801,0.00038237,0.0001225612,0.0004730126,0.00001207353,0.0005060077,0.0000246103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007060362,"about_ca_system_score_gemma":0.0001861203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007359296,"about_ca_topic_score_gemma":0.0003758098,"domain_scores_codex":[0.9987825,0.00006603885,0.0004761842,0.00007773162,0.0003961984,0.000201368],"domain_scores_gemma":[0.9986309,0.0001320092,0.00001588499,0.0001228837,0.001007529,0.00009075476],"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.00001820759,0.000144459,0.0007711151,0.00002581842,0.0001339596,0.000005702872,0.002243801,0.8989887,0.02772904,0.03907221,0.003888597,0.02697834],"study_design_scores_gemma":[0.002219735,0.0001812898,0.01509904,0.0001135521,0.00002938423,0.0001910068,0.002032172,0.7768849,0.01081904,0.0002359441,0.1918699,0.0003240941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8934464,0.00447473,0.07743707,0.02071184,0.0003012164,0.0006817253,0.00002458295,0.00007398421,0.00284843],"genre_scores_gemma":[0.940083,0.0007486285,0.05825339,0.00004560867,0.0002161529,0.0000251077,0.000006852897,0.00001421029,0.0006070803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1879813,"threshold_uncertainty_score":0.5472534,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006060963,0.0002189117,0.0004571654,0.0009750441,0.001136062,0.0003569511,0.0006954686,0.000197208,0.001175827],"category_scores_gemma":[0.006703333,0.0001887339,0.0001859687,0.001400126,0.0002951431,0.0007252988,0.0001664451,0.0007359771,0.00002201293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002620946,"about_ca_system_score_gemma":0.00102118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001320197,"about_ca_topic_score_gemma":0.00005376106,"domain_scores_codex":[0.9956942,0.0006437433,0.001034389,0.0003537077,0.001493024,0.0007809925],"domain_scores_gemma":[0.9874712,0.001679897,0.0001781725,0.000529942,0.009825611,0.0003151302],"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.001650751,0.003184148,0.0001749621,0.0005383663,0.001187888,0.00009465263,0.01935733,0.5369676,0.01085688,0.2070916,0.1472677,0.07162819],"study_design_scores_gemma":[0.002975133,0.0007457307,0.000008031408,0.00009302779,0.00003629874,0.0001143446,0.004427887,0.966086,0.010247,0.0102816,0.004739368,0.0002455332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00170845,0.00007123441,0.9904083,0.005307255,0.0001876634,0.001049343,0.00008726941,0.00003179472,0.001148667],"genre_scores_gemma":[0.01672392,0.00009863263,0.9774769,0.0002161521,0.0007625266,0.00008933294,0.00002613436,0.00008087761,0.004525507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4291185,"threshold_uncertainty_score":0.9997373,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002318636,0.0001185976,0.0002795638,0.0001973666,0.000247662,0.00004278759,0.000504615,0.00007486678,0.0002959762],"category_scores_gemma":[0.008829258,0.00007180297,0.0001390452,0.0006168354,0.0002008705,0.0001582477,0.0000648612,0.0006628154,0.00002740803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009793035,"about_ca_system_score_gemma":0.0003764625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005199724,"about_ca_topic_score_gemma":0.000008310761,"domain_scores_codex":[0.9973745,0.0004520951,0.0006403513,0.0001102738,0.001168213,0.0002546081],"domain_scores_gemma":[0.9960413,0.001717251,0.0001595149,0.0004523495,0.001544558,0.00008504749],"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.00003372946,0.001042664,0.0002136308,0.00007832152,0.0001269634,0.00001713471,0.002578659,0.001646275,0.01006944,0.9796169,0.001814457,0.002761859],"study_design_scores_gemma":[0.001128004,0.0007711248,0.00007236559,0.0003219991,0.00003704211,0.0001196433,0.001416969,0.002827584,0.1930755,0.7982346,0.001809509,0.0001857081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8769225,0.0004439304,0.1081492,0.003376845,0.00224671,0.001230721,0.00001718862,0.00002294942,0.007589967],"genre_scores_gemma":[0.9359125,0.00006196874,0.06301609,0.00002570599,0.0001157205,0.00001013167,1.417697e-7,0.00002814345,0.0008295943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.183006,"threshold_uncertainty_score":0.9995198,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109101,0.00009741777,0.0001519514,0.00066925,0.0003209476,0.0002148156,0.0001397176,0.00008538355,0.0001111919],"category_scores_gemma":[0.0002534161,0.00008721745,0.00004860804,0.0004229044,0.00009518809,0.0004823504,0.00002375507,0.0005454167,0.00001326628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001100255,"about_ca_system_score_gemma":0.00008931237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006900007,"about_ca_topic_score_gemma":0.000005559673,"domain_scores_codex":[0.9988664,0.0001678381,0.0003345087,0.00009649071,0.000342697,0.000192027],"domain_scores_gemma":[0.9991163,0.0002142135,0.00002181212,0.000123734,0.0003972168,0.000126697],"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.00001369384,0.00004061855,0.00004600191,0.000009065979,0.00004377745,0.000003719596,0.0004540219,0.8823443,0.0002080076,0.1163214,0.0001521192,0.0003632451],"study_design_scores_gemma":[0.02027217,0.005997056,0.001961501,0.001650866,0.0002334876,0.0005412396,0.003134532,0.3826528,0.01966463,0.5597867,0.002349401,0.001755695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4391547,0.0007037696,0.5531232,0.001491281,0.001568502,0.0004510259,0.0000223257,0.0001136071,0.003371515],"genre_scores_gemma":[0.9923084,0.0003773308,0.006928308,0.00001860438,0.0002507418,0.000006860043,0.000008900629,0.00002550929,0.00007529838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5531537,"threshold_uncertainty_score":0.3556624,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00548302,0.0001053427,0.0001997919,0.0009931092,0.0002251176,0.0001219011,0.0001760874,0.0001201407,0.00002727351],"category_scores_gemma":[0.0007304074,0.00008227686,0.00005001853,0.0009291184,0.00007441578,0.0008744842,0.00003083793,0.0003510413,0.00000679111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009326937,"about_ca_system_score_gemma":0.0002655089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005975557,"about_ca_topic_score_gemma":0.00009657751,"domain_scores_codex":[0.9979693,0.0003036737,0.0006959101,0.0001427887,0.0005156378,0.0003726446],"domain_scores_gemma":[0.9973848,0.0003475683,0.00004569286,0.0001637575,0.001968862,0.00008929313],"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.00003040968,0.00003108991,0.001257348,0.00004745955,0.00001604173,0.000001544189,0.0005888895,0.9170383,0.05911505,0.0003719154,0.00003011034,0.02147189],"study_design_scores_gemma":[0.001094059,0.0001911237,0.001101596,0.0003604923,0.000005835032,0.0000648121,0.0003598098,0.9767627,0.01966164,0.0002179764,0.00007077975,0.0001092074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3096148,0.00009769166,0.6894815,0.0002285108,0.0001273743,0.0003506614,0.00000244455,0.0000212064,0.00007578583],"genre_scores_gemma":[0.9155885,0.0000582182,0.08402783,0.000004704997,0.0001712978,0.00001933899,0.000002934745,0.00003732629,0.0000898401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6059737,"threshold_uncertainty_score":0.3355153,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01623331,0.0001044185,0.000233508,0.0006858569,0.001435453,0.0007783741,0.001288159,0.00006618816,0.0004101376],"category_scores_gemma":[0.008308467,0.00004581175,0.0002212147,0.00145969,0.0001903418,0.00032638,0.0001416563,0.0003738455,0.0002847678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451236,"about_ca_system_score_gemma":0.001588751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007024465,"about_ca_topic_score_gemma":0.00007039378,"domain_scores_codex":[0.9956002,0.0004151323,0.0008300725,0.0002650208,0.002382065,0.0005075039],"domain_scores_gemma":[0.9874774,0.007513165,0.0001158531,0.0005320602,0.0040781,0.0002834721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007724647,0.0001957362,0.0001660671,0.000002228642,0.000147514,0.00001021508,0.001100964,0.04294606,0.005860399,0.01040532,0.07905678,0.8600315],"study_design_scores_gemma":[0.005770057,0.00167355,0.002478295,0.0003405189,0.0001172205,0.0003391676,0.003831422,0.5618801,0.005854808,0.02268905,0.3945825,0.0004432419],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01720858,0.001035814,0.9562862,0.02333936,0.001006587,0.0005551972,0.00002192118,0.0000135759,0.0005327459],"genre_scores_gemma":[0.717603,0.0002059987,0.2459994,0.0001082472,0.001178207,0.00008433779,8.904441e-7,0.00003183785,0.03478813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8595882,"threshold_uncertainty_score":0.9998645,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008118919,0.000121198,0.0002003894,0.0004263858,0.0002688336,0.0002530985,0.0001919762,0.0000730751,0.0001011071],"category_scores_gemma":[0.00002711765,0.00009917255,0.00005919501,0.0003310042,0.00003515539,0.0006625919,0.000006711613,0.0002880253,0.00002118939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003877919,"about_ca_system_score_gemma":0.00009716332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493097,"about_ca_topic_score_gemma":0.00003773367,"domain_scores_codex":[0.9986541,0.00008785616,0.0004410924,0.0001304588,0.0003468714,0.0003396039],"domain_scores_gemma":[0.9991988,0.0001059734,0.00004013321,0.0001457376,0.0003975799,0.0001117768],"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.00001621241,0.00008815315,0.00003544415,0.00009487592,0.00008564202,0.000006905625,0.0007537541,0.7798139,0.001014143,0.00006788078,0.001126914,0.2168962],"study_design_scores_gemma":[0.0006910196,0.0003852186,0.00001637344,0.0001011175,0.00001669331,0.0001322815,0.0001194251,0.9935906,0.001486784,0.00002063473,0.00332579,0.0001140782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02026873,0.001360039,0.9768718,0.0002335679,0.00009620444,0.0007492017,0.000009628568,0.00004475869,0.0003660259],"genre_scores_gemma":[0.6909832,0.0006999504,0.3072808,0.00000296578,0.0001239809,0.000154836,0.00002280463,0.00006129532,0.0006701472],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6707145,"threshold_uncertainty_score":0.4044139,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003429821,0.0001109657,0.0002623771,0.001184423,0.0003950329,0.0003416677,0.001833421,0.00006251295,0.000224356],"category_scores_gemma":[0.001092473,0.00008494133,0.0001178165,0.001548456,0.0002616577,0.001779504,0.0004200015,0.0008075355,0.0002201354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001276022,"about_ca_system_score_gemma":0.0005513444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008198046,"about_ca_topic_score_gemma":0.00004190252,"domain_scores_codex":[0.9965585,0.0005016275,0.0005504139,0.0002215283,0.001568081,0.0005998451],"domain_scores_gemma":[0.9956349,0.0007393977,0.00007963304,0.0006358707,0.002678464,0.0002317262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001159192,0.0006793825,0.0004857227,0.00003338892,0.00008903447,0.00007305634,0.001878598,0.0283198,0.2526122,0.6745234,0.004008311,0.03718124],"study_design_scores_gemma":[0.00590542,0.0155894,0.02039327,0.0008435173,0.00002288228,0.0005931366,0.002216811,0.1490123,0.5411192,0.2444939,0.01875458,0.001055604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7697638,0.0005621022,0.1969312,0.010306,0.0002611513,0.0009997416,0.000006020714,0.00003745572,0.02113252],"genre_scores_gemma":[0.9631916,0.00008898411,0.03474022,0.00003819792,0.00006687112,0.00003318677,3.691921e-7,0.00001242937,0.001828142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4300295,"threshold_uncertainty_score":0.3508385,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430008,0.0001441903,0.0002424023,0.000869355,0.0006419016,0.0006687393,0.001781481,0.00008664817,0.0001229167],"category_scores_gemma":[0.0009855723,0.00009279887,0.00005448219,0.001427994,0.0002700971,0.002727694,0.0003085877,0.001077056,0.00002062758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945004,"about_ca_system_score_gemma":0.0005712794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004004851,"about_ca_topic_score_gemma":0.0003540069,"domain_scores_codex":[0.9959069,0.001437669,0.0004774836,0.0002937733,0.001357303,0.0005269031],"domain_scores_gemma":[0.9959146,0.0007491548,0.00008857543,0.0008961968,0.002003553,0.0003478836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004280948,0.001697797,0.001354058,0.00005383852,0.0002472304,0.0001213604,0.01087704,0.01192183,0.4730525,0.3877095,0.004012693,0.1085241],"study_design_scores_gemma":[0.004893447,0.02220089,0.02567853,0.0002945553,0.0000205781,0.000527471,0.0126418,0.4291571,0.1049693,0.398215,0.0005129104,0.0008883467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9880794,0.00004114916,0.007516793,0.002950633,0.00005212987,0.0005592032,0.000003707721,0.00001110234,0.0007858899],"genre_scores_gemma":[0.9921883,0.00002797495,0.00746071,0.00007945632,0.00005148142,0.00004222691,0.000001688254,0.00001754421,0.0001306408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4172353,"threshold_uncertainty_score":0.6448669,"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005270211,0.0002102608,0.0003055072,0.0006097802,0.001629306,0.00125772,0.001120149,0.0001223729,0.000291766],"category_scores_gemma":[0.001677652,0.0001529364,0.000271102,0.0006472939,0.0001477438,0.0006555048,0.0008236988,0.001326407,0.0001107817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449536,"about_ca_system_score_gemma":0.0005315906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00224368,"about_ca_topic_score_gemma":0.005042352,"domain_scores_codex":[0.9971873,0.0000825931,0.0009762583,0.0003198874,0.0008569701,0.0005770383],"domain_scores_gemma":[0.9963239,0.0001534597,0.0001401352,0.0004470328,0.002886391,0.00004906361],"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.0003080387,0.0005196038,0.0001617426,0.002161767,0.0009888475,0.00001728156,0.00195797,0.4794343,0.003079501,0.09096013,0.3995142,0.02089659],"study_design_scores_gemma":[0.0006619202,0.00007205598,0.0002819267,0.0001585942,0.0001571381,0.000002007401,0.00303177,0.870745,0.0000311136,0.009069451,0.1155276,0.000261385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01865508,0.002593066,0.3030815,0.6555843,0.004957206,0.008801514,0.0001862588,0.0001555065,0.005985589],"genre_scores_gemma":[0.9787593,0.0005308843,0.009044524,0.00195353,0.007011606,0.000671283,0.000220995,0.00007528944,0.001732551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9601043,"threshold_uncertainty_score":0.999779,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01506761,0.00008554861,0.0002433205,0.00416897,0.0003824558,0.0007465428,0.0005161398,0.000078008,0.000008806207],"category_scores_gemma":[0.001216824,0.00007123387,0.00002623263,0.004117196,0.0002193396,0.0008266551,0.00009177747,0.0004152785,0.00001279147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000171712,"about_ca_system_score_gemma":0.0004542873,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02154051,"about_ca_topic_score_gemma":0.2248027,"domain_scores_codex":[0.9962729,0.001017969,0.0007321838,0.0003432982,0.001307087,0.0003265912],"domain_scores_gemma":[0.9982471,0.0004544344,0.00006765706,0.0003406565,0.0006658119,0.0002242987],"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.0000551622,0.0001199432,0.004891026,0.000008864239,0.0000101828,0.00003183413,0.006434754,0.9268907,0.0008511177,0.007753587,0.0004892066,0.05246358],"study_design_scores_gemma":[0.0003692983,0.00006517092,0.01563275,0.00002061048,0.000003654328,0.00003134127,0.005960918,0.9718534,0.00001273758,0.004922217,0.001053257,0.00007466874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9908719,0.000238257,0.001557208,0.004824815,0.0000215351,0.0001072307,0.000004525879,0.000005524062,0.002368973],"genre_scores_gemma":[0.9978084,0.0002338274,0.001425601,0.0000393399,0.00005880059,0.00001807135,0.00001089296,0.00000858402,0.0003964577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2032622,"threshold_uncertainty_score":0.9849752,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536803,0.0001021542,0.0002851822,0.0002938284,0.0002587752,0.00008077214,0.0002211706,0.00006298052,0.0002510565],"category_scores_gemma":[0.000699466,0.00007259283,0.00006934404,0.0006761345,0.0001807496,0.000284544,0.00004624746,0.0003040512,0.000007557465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002337003,"about_ca_system_score_gemma":0.0002390182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002130978,"about_ca_topic_score_gemma":0.00008390371,"domain_scores_codex":[0.9985275,0.0002411462,0.0004015041,0.0001538677,0.000439656,0.0002363534],"domain_scores_gemma":[0.9963979,0.001499738,0.0001160451,0.0002572581,0.001626838,0.0001022927],"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.001394342,0.001573376,0.09429205,0.0004911573,0.0005411417,0.00000892896,0.002771732,0.000642795,0.0328326,0.86206,0.002241756,0.001150131],"study_design_scores_gemma":[0.02213805,0.005131331,0.05781159,0.00107407,0.0005681451,0.001030726,0.01599294,0.02785638,0.07208394,0.7908683,0.00420714,0.001237317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9944417,0.00006482809,0.003604439,0.0005773423,0.00003540944,0.0006986178,0.00002454056,0.000005279002,0.0005478493],"genre_scores_gemma":[0.9905781,0.00004658113,0.008778801,0.0000108157,0.00002712129,0.00003992187,0.000002591536,0.0000167886,0.0004992881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07119162,"threshold_uncertainty_score":0.2960249,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006073565,0.00007789305,0.000125379,0.0005256546,0.00073828,0.001203605,0.000528027,0.00002980693,0.0002578057],"category_scores_gemma":[0.0007718579,0.00003991034,0.00004522086,0.0008422602,0.0003735778,0.0009636216,0.0001725717,0.000425774,0.00005112011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003277479,"about_ca_system_score_gemma":0.00009721176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002153331,"about_ca_topic_score_gemma":0.0006926039,"domain_scores_codex":[0.9985108,0.0001833736,0.0003269962,0.0001080809,0.0005941572,0.0002765757],"domain_scores_gemma":[0.9990519,0.0001527767,0.00006218089,0.0001701281,0.0005520419,0.00001097259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004247973,0.0003149364,0.01446148,0.00009904418,0.00006919573,0.0001178907,0.00534932,0.0005297931,0.0002414668,0.7573398,0.2100027,0.0110495],"study_design_scores_gemma":[0.005301967,0.0002155947,0.0177127,0.0001808633,0.00003218206,0.000074244,0.008462263,0.02519808,0.0000342102,0.01610481,0.9264625,0.0002205446],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8839514,0.0007215161,0.0006225483,0.07675256,0.0004953027,0.0009943986,0.000001015756,0.00001172816,0.03644958],"genre_scores_gemma":[0.9953087,0.00002568778,0.000158434,0.001578464,0.002502585,0.0000323757,0.000001623095,0.000008348983,0.0003837589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.741235,"threshold_uncertainty_score":0.9998332,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628408,0.00007224476,0.0001359771,0.00009579855,0.0005100193,0.0001423024,0.0001289062,0.00002105786,0.00005439908],"category_scores_gemma":[0.0001281454,0.00004879041,0.00002218215,0.0001890651,0.000154292,0.0001379517,0.00004895707,0.0002245653,0.000002883329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002334679,"about_ca_system_score_gemma":0.00009453636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002355599,"about_ca_topic_score_gemma":0.000053787,"domain_scores_codex":[0.9991223,0.00005314608,0.0003022356,0.0001268108,0.0001979145,0.0001975851],"domain_scores_gemma":[0.9987571,0.0005790298,0.0000418203,0.00008476865,0.0004536824,0.0000835935],"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.002158461,0.001633363,0.004070883,0.0001604859,0.0007626765,0.00002333929,0.01412733,0.07042662,0.003208485,0.832432,0.001613999,0.06938232],"study_design_scores_gemma":[0.001638853,0.0006283791,0.001654048,0.00005463289,0.00001411667,0.000008973094,0.0006026643,0.9251584,0.0001525205,0.0692989,0.0006904682,0.00009798871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4989005,0.0001017452,0.4958401,0.003211854,0.00008521497,0.0006136486,0.0003258478,0.000003045906,0.0009180822],"genre_scores_gemma":[0.9957163,0.000006019132,0.003825451,0.00001499227,0.0001557507,0.00002254899,0.000009840383,0.000009025001,0.0002400623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8547319,"threshold_uncertainty_score":0.3922708,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705896,0.0001117835,0.0001786432,0.0008345426,0.0005083233,0.0002704612,0.0006845761,0.00005783056,0.00006448656],"category_scores_gemma":[0.0001070105,0.00008987261,0.00006870758,0.0009993234,0.0002162474,0.0007827717,0.0001772806,0.0006131933,0.00001971583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003539198,"about_ca_system_score_gemma":0.0001846962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008376953,"about_ca_topic_score_gemma":0.00005793697,"domain_scores_codex":[0.9979627,0.0003274956,0.0004388433,0.0002232595,0.0007626121,0.0002851646],"domain_scores_gemma":[0.9981773,0.0002318341,0.00005843348,0.0002615169,0.00108954,0.0001813617],"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.0002048952,0.002399604,0.0008921906,0.00009730488,0.0003233727,0.0007957991,0.0150468,0.01566785,0.001417239,0.7172592,0.008379024,0.2375167],"study_design_scores_gemma":[0.001733303,0.004024088,0.004719296,0.0002123478,0.00001247221,0.001001709,0.0003450905,0.5301065,0.00187472,0.455004,0.0006411118,0.0003253466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2302716,0.0006956019,0.7643048,0.001612208,0.0004622506,0.0003238243,0.000006311398,0.00003667292,0.002286769],"genre_scores_gemma":[0.8683207,0.0001613784,0.1312066,0.00007084291,0.0001338679,0.000007916302,0.000002859558,0.000009208649,0.00008660958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6380491,"threshold_uncertainty_score":0.3909663,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198421,0.00007139608,0.0002122903,0.0007846334,0.0002035259,0.0001294539,0.001110999,0.00005996418,0.0002961866],"category_scores_gemma":[0.000218022,0.00006142398,0.0001016828,0.001202445,0.0002053761,0.0007050731,0.0001860808,0.0004070951,0.00003595035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008316164,"about_ca_system_score_gemma":0.0009410963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002497182,"about_ca_topic_score_gemma":0.00006881854,"domain_scores_codex":[0.9976003,0.0002902117,0.0007298955,0.000139755,0.0009975955,0.0002422067],"domain_scores_gemma":[0.9967843,0.000170736,0.0001218385,0.0003829399,0.002388413,0.0001517932],"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.0001561664,0.002487788,0.0008084934,0.00009324234,0.0002105732,0.00001397566,0.009622806,0.2381128,0.04913207,0.3506126,0.05888412,0.2898653],"study_design_scores_gemma":[0.004494753,0.002168665,0.001677425,0.0001787958,0.00002495416,0.0002324904,0.001197793,0.5212497,0.06023972,0.001870301,0.4062113,0.0004540943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02379914,0.0004188471,0.9373277,0.01353702,0.0002109956,0.0007922548,0.00001983357,0.00001644219,0.0238777],"genre_scores_gemma":[0.8547709,0.0002382268,0.1423397,0.00004362374,0.001093992,0.000019659,0.000002212916,0.000009235523,0.001482429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8309718,"threshold_uncertainty_score":0.3243035,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01858188,0.0001993525,0.0005146266,0.00316272,0.001733335,0.001250096,0.002268412,0.0001494563,0.002000137],"category_scores_gemma":[0.05141436,0.0001395872,0.0002517042,0.004028935,0.0003752411,0.002391728,0.0003051633,0.001009391,0.0006310978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002120001,"about_ca_system_score_gemma":0.0009198262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001347329,"about_ca_topic_score_gemma":0.00009331713,"domain_scores_codex":[0.9867865,0.001283011,0.002270489,0.0005253166,0.008570192,0.0005644589],"domain_scores_gemma":[0.9819411,0.006566962,0.0003489582,0.0008950064,0.009934657,0.0003133042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001326985,0.001224901,0.01950427,0.00001965819,0.0001214438,0.002212806,0.01626481,0.0706109,0.01411279,0.006233348,0.0460046,0.8223635],"study_design_scores_gemma":[0.010773,0.003805816,0.1111629,0.003454618,0.00007327976,0.02207868,0.02496626,0.4648286,0.007311547,0.280079,0.06922746,0.002238715],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713719,0.0005358722,0.1250918,0.0007725849,0.0006091162,0.0003253712,0.000007486055,0.00001559059,0.001270248],"genre_scores_gemma":[0.9526851,0.0001122924,0.0460359,0.00009182961,0.0005044064,0.00001550351,0.000001132538,0.00002737442,0.000526502],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8201247,"threshold_uncertainty_score":0.9997867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}