{"meta":{"query_hash":"66173f754bec","filters":{"venue":"Yugoslav journal of operations research"},"cohort_total":17,"direct_labels_cover":0,"predictions_cover":17,"exported":17,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/66173f754bec","api":"https://metacan.xera.ac/api/v1/cohort?venue=Yugoslav+journal+of+operations+research"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Class (philosophy); Mathematics; Combinatorics; Time complexity; Treasure; Measure (data warehouse); Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence; Database","score_opus":0.05777407111335551,"score_gpt":0.39140864777529727,"score_spread":0.33363457666194174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968085493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023799136,0.00041884714,0.93732774,0.013537019,0.00021099563,0.00079225475,0.000019833571,0.000016442187,0.0238777],"genre_scores_gemma":[0.8547709,0.00023822681,0.14233969,0.000043623735,0.0010939917,0.000019658995,0.0000022129161,0.000009235523,0.0014824289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976003,0.0002902117,0.00072989555,0.00013975501,0.0009975955,0.00024220668],"domain_scores_gemma":[0.99678427,0.00017073599,0.0001218385,0.0003829399,0.0023884128,0.00015179324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198421,0.000071396076,0.00021229034,0.0007846334,0.00020352587,0.00012945387,0.0011109988,0.000059964183,0.00029618657],"category_scores_gemma":[0.00021802203,0.000061423976,0.000101682825,0.0012024448,0.00020537614,0.0007050731,0.00018608077,0.00040709507,0.000035950354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015616638,0.0024877884,0.0008084934,0.000093242335,0.00021057317,0.00001397566,0.009622806,0.23811282,0.049132068,0.35061258,0.05888412,0.28986534],"study_design_scores_gemma":[0.004494753,0.002168665,0.0016774249,0.00017879577,0.00002495416,0.00023249042,0.0011977929,0.52124965,0.060239725,0.0018703011,0.40621135,0.00045409435],"about_ca_topic_score_codex":0.000024971816,"about_ca_topic_score_gemma":0.00006881854,"teacher_disagreement_score":0.8309718,"about_ca_system_score_codex":0.00008316164,"about_ca_system_score_gemma":0.00094109634,"threshold_uncertainty_score":0.32430354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; 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","score_opus":0.12365718098265857,"score_gpt":0.40012774714530297,"score_spread":0.2764705661626444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975847110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98807937,0.000041149156,0.007516793,0.0029506332,0.00005212987,0.0005592032,0.0000037077207,0.000011102342,0.0007858899],"genre_scores_gemma":[0.9921883,0.00002797495,0.0074607097,0.000079456324,0.00005148142,0.000042226915,0.0000016882542,0.000017544215,0.00013064076],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959069,0.001437669,0.00047748358,0.0002937733,0.0013573029,0.0005269031],"domain_scores_gemma":[0.99591464,0.0007491548,0.00008857543,0.0008961968,0.0020035529,0.00034788364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00430008,0.00014419029,0.0002424023,0.00086935505,0.00064190157,0.0006687393,0.0017814807,0.00008664817,0.0001229167],"category_scores_gemma":[0.0009855723,0.000092798866,0.00005448219,0.0014279935,0.00027009705,0.0027276939,0.00030858768,0.0010770557,0.000020627584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042809482,0.0016977974,0.0013540582,0.000053838525,0.00024723043,0.000121360375,0.01087704,0.0119218305,0.4730525,0.38770947,0.004012693,0.108524084],"study_design_scores_gemma":[0.0048934473,0.022200892,0.025678527,0.00029455527,0.0000205781,0.000527471,0.012641801,0.42915714,0.10496934,0.398215,0.00051291037,0.0008883467],"about_ca_topic_score_codex":0.00040048506,"about_ca_topic_score_gemma":0.00035400686,"teacher_disagreement_score":0.4172353,"about_ca_system_score_codex":0.00006945004,"about_ca_system_score_gemma":0.0005712794,"threshold_uncertainty_score":0.6448669},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.39996342744973434,"score_gpt":0.5749928622698741,"score_spread":0.17502943482013977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998589625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8713719,0.00053587224,0.12509178,0.00077258487,0.0006091162,0.00032537116,0.0000074860545,0.00001559059,0.0012702477],"genre_scores_gemma":[0.95268506,0.00011229242,0.046035904,0.00009182961,0.0005044064,0.000015503507,0.0000011325377,0.000027374417,0.00052650203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98678654,0.0012830109,0.0022704895,0.0005253166,0.008570192,0.0005644589],"domain_scores_gemma":[0.9819411,0.0065669618,0.00034895825,0.0008950064,0.009934657,0.00031330425],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.018581884,0.00019935254,0.0005146266,0.0031627205,0.0017333345,0.001250096,0.0022684122,0.00014945627,0.002000137],"category_scores_gemma":[0.051414356,0.00013958722,0.00025170424,0.0040289355,0.00037524113,0.0023917276,0.00030516327,0.0010093913,0.0006310978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013269848,0.0012249006,0.019504266,0.000019658188,0.00012144381,0.0022128064,0.016264815,0.070610896,0.014112795,0.006233348,0.0460046,0.8223635],"study_design_scores_gemma":[0.010773003,0.0038058157,0.111162946,0.0034546177,0.00007327976,0.02207868,0.024966257,0.46482864,0.007311547,0.28007904,0.069227464,0.002238715],"about_ca_topic_score_codex":0.000013473293,"about_ca_topic_score_gemma":0.00009331713,"teacher_disagreement_score":0.82012475,"about_ca_system_score_codex":0.00021200013,"about_ca_system_score_gemma":0.0009198262,"threshold_uncertainty_score":0.9997867},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Counterexample; Convergence (economics); Conjecture; Mathematics; Property (philosophy); Mathematical economics; Calculus (dental); Algorithm; Epistemology; Discrete mathematics; Economics; Philosophy","score_opus":0.1676460810047468,"score_gpt":0.44942821214985956,"score_spread":0.28178213114511275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020546119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87692255,0.0004439304,0.10814916,0.0033768448,0.0022467098,0.0012307214,0.000017188624,0.00002294942,0.0075899675],"genre_scores_gemma":[0.9359125,0.00006196874,0.063016094,0.000025705986,0.0001157205,0.0000101316655,1.4176966e-7,0.000028143446,0.0008295943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973745,0.00045209515,0.0006403513,0.0001102738,0.0011682127,0.00025460805],"domain_scores_gemma":[0.9960413,0.001717251,0.00015951486,0.0004523495,0.0015445575,0.00008504749],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0023186358,0.00011859756,0.0002795638,0.0001973666,0.00024766196,0.000042787586,0.00050461496,0.00007486678,0.0002959762],"category_scores_gemma":[0.008829258,0.00007180297,0.00013904524,0.00061683543,0.00020087048,0.00015824767,0.000064861204,0.0006628154,0.000027408027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003372946,0.0010426643,0.00021363082,0.00007832152,0.00012696341,0.000017134713,0.0025786592,0.0016462748,0.010069439,0.9796169,0.001814457,0.0027618585],"study_design_scores_gemma":[0.0011280037,0.00077112485,0.00007236559,0.0003219991,0.00003704211,0.0001196433,0.0014169691,0.0028275843,0.19307548,0.7982346,0.0018095091,0.00018570811],"about_ca_topic_score_codex":0.0000051997245,"about_ca_topic_score_gemma":0.000008310761,"teacher_disagreement_score":0.18300603,"about_ca_system_score_codex":0.00009793035,"about_ca_system_score_gemma":0.00037646247,"threshold_uncertainty_score":0.99951977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.045286675876232176,"score_gpt":0.32504776984781975,"score_spread":0.27976109397158755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044393101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4391547,0.0007037696,0.55312324,0.0014912813,0.0015685017,0.00045102587,0.000022325696,0.000113607115,0.0033715153],"genre_scores_gemma":[0.99230844,0.00037733084,0.006928308,0.000018604376,0.00025074175,0.0000068600425,0.000008900629,0.000025509291,0.000075298376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886644,0.00016783805,0.0003345087,0.00009649071,0.00034269702,0.000192027],"domain_scores_gemma":[0.9991163,0.00021421353,0.000021812122,0.00012373397,0.00039721676,0.00012669699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010910104,0.00009741777,0.00015195142,0.00066925003,0.00032094758,0.00021481562,0.00013971755,0.00008538355,0.000111191875],"category_scores_gemma":[0.00025341613,0.00008721745,0.000048608035,0.00042290436,0.000095188094,0.0004823504,0.000023755067,0.00054541667,0.000013266281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013693838,0.000040618554,0.000046001907,0.000009065979,0.00004377745,0.0000037195957,0.00045402185,0.8823443,0.00020800764,0.11632139,0.0001521192,0.00036324508],"study_design_scores_gemma":[0.020272175,0.005997056,0.001961501,0.0016508665,0.00023348762,0.00054123957,0.0031345317,0.38265276,0.019664628,0.5597867,0.0023494011,0.0017556947],"about_ca_topic_score_codex":0.000006900007,"about_ca_topic_score_gemma":0.000005559673,"teacher_disagreement_score":0.5531537,"about_ca_system_score_codex":0.00011002553,"about_ca_system_score_gemma":0.00008931237,"threshold_uncertainty_score":0.35566244},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Graph; Order (exchange); Discrete mathematics; Economics","score_opus":0.08322712656480684,"score_gpt":0.4109221989972904,"score_spread":0.3276950724324835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048023919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7697638,0.0005621022,0.19693115,0.0103060035,0.00026115135,0.0009997416,0.000006020714,0.000037455717,0.02113252],"genre_scores_gemma":[0.9631916,0.00008898411,0.03474022,0.000038197915,0.00006687112,0.000033186767,3.6919207e-7,0.000012429373,0.0018281423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965585,0.0005016275,0.0005504139,0.00022152833,0.0015680813,0.00059984514],"domain_scores_gemma":[0.9956349,0.00073939766,0.00007963304,0.00063587073,0.0026784637,0.00023172621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034298205,0.00011096569,0.00026237709,0.0011844225,0.00039503287,0.00034166768,0.0018334206,0.00006251295,0.00022435597],"category_scores_gemma":[0.0010924729,0.000084941326,0.00011781655,0.001548456,0.00026165767,0.001779504,0.00042000148,0.00080753554,0.00022013542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011591925,0.00067938253,0.0004857227,0.00003338892,0.00008903447,0.00007305634,0.0018785984,0.028319804,0.2526122,0.67452335,0.004008311,0.037181243],"study_design_scores_gemma":[0.0059054196,0.015589402,0.020393273,0.0008435173,0.000022882276,0.00059313665,0.0022168113,0.1490123,0.5411192,0.24449389,0.018754577,0.0010556044],"about_ca_topic_score_codex":0.000081980455,"about_ca_topic_score_gemma":0.000041902524,"teacher_disagreement_score":0.43002945,"about_ca_system_score_codex":0.0001276022,"about_ca_system_score_gemma":0.0005513444,"threshold_uncertainty_score":0.35083848},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1693381571729664,"score_gpt":0.3650028625847389,"score_spread":0.1956647054117725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054116841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23027162,0.0006956019,0.76430476,0.001612208,0.00046225064,0.00032382426,0.0000063113985,0.000036672922,0.0022867692],"genre_scores_gemma":[0.8683207,0.00016137835,0.13120662,0.000070842914,0.00013386793,0.000007916302,0.0000028595584,0.000009208649,0.00008660958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796265,0.00032749563,0.0004388433,0.0002232595,0.0007626121,0.00028516463],"domain_scores_gemma":[0.9981773,0.00023183413,0.00005843348,0.00026151692,0.0010895397,0.00018136168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058956,0.000111783505,0.00017864324,0.00083454256,0.00050832325,0.00027046123,0.00068457605,0.000057830555,0.00006448656],"category_scores_gemma":[0.00010701053,0.000089872614,0.00006870758,0.0009993234,0.00021624738,0.0007827717,0.0001772806,0.00061319326,0.000019715833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020489524,0.0023996043,0.00089219055,0.00009730488,0.00032337275,0.00079579913,0.015046796,0.015667846,0.0014172392,0.7172592,0.0083790235,0.23751669],"study_design_scores_gemma":[0.0017333028,0.0040240884,0.004719296,0.00021234778,0.000012472211,0.001001709,0.00034509046,0.53010654,0.0018747202,0.45500398,0.00064111175,0.00032534657],"about_ca_topic_score_codex":0.000083769526,"about_ca_topic_score_gemma":0.000057936973,"teacher_disagreement_score":0.63804907,"about_ca_system_score_codex":0.00003539198,"about_ca_system_score_gemma":0.00018469618,"threshold_uncertainty_score":0.3909663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"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","score_opus":0.02603753094713742,"score_gpt":0.30592939787669976,"score_spread":0.27989186692956236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081059316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02026873,0.0013600386,0.97687185,0.00023356786,0.00009620444,0.00074920175,0.0000096285685,0.000044758686,0.00036602587],"genre_scores_gemma":[0.69098324,0.00069995044,0.3072808,0.0000029657801,0.00012398089,0.00015483596,0.000022804632,0.000061295315,0.0006701472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986541,0.00008785616,0.0004410924,0.00013045881,0.00034687138,0.00033960392],"domain_scores_gemma":[0.9991988,0.00010597344,0.000040133207,0.00014573759,0.0003975799,0.00011177682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008118919,0.00012119804,0.00020038936,0.0004263858,0.00026883357,0.0002530985,0.00019197624,0.0000730751,0.00010110711],"category_scores_gemma":[0.000027117649,0.000099172554,0.00005919501,0.0003310042,0.000035155394,0.00066259195,0.000006711613,0.00028802533,0.000021189393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016212414,0.000088153145,0.00003544415,0.00009487592,0.000085642016,0.0000069056246,0.00075375405,0.7798139,0.001014143,0.000067880785,0.0011269142,0.21689616],"study_design_scores_gemma":[0.00069101964,0.00038521865,0.000016373438,0.00010111753,0.00001669331,0.00013228146,0.00011942509,0.9935906,0.0014867836,0.000020634729,0.0033257902,0.000114078226],"about_ca_topic_score_codex":0.000014930969,"about_ca_topic_score_gemma":0.000037733666,"teacher_disagreement_score":0.6707145,"about_ca_system_score_codex":0.0003877919,"about_ca_system_score_gemma":0.00009716332,"threshold_uncertainty_score":0.40441394},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.3141830685573495,"score_gpt":0.5029930622972192,"score_spread":0.18880999373986967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286452095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720858,0.0010358142,0.9562862,0.023339361,0.0010065874,0.00055519724,0.000021921182,0.000013575905,0.0005327459],"genre_scores_gemma":[0.71760297,0.00020599867,0.2459994,0.000108247164,0.0011782068,0.000084337786,8.9044414e-7,0.000031837848,0.03478813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956002,0.0004151323,0.0008300725,0.0002650208,0.0023820654,0.0005075039],"domain_scores_gemma":[0.98747736,0.007513165,0.000115853145,0.00053206016,0.0040781004,0.00028347212],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.016233312,0.00010441852,0.00023350798,0.0006858569,0.0014354526,0.0007783741,0.0012881593,0.000066188164,0.00041013764],"category_scores_gemma":[0.008308467,0.00004581175,0.00022121474,0.0014596896,0.0001903418,0.00032638002,0.00014165632,0.0003738455,0.00028476777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007724647,0.00019573618,0.00016606708,0.0000022286417,0.00014751405,0.000010215084,0.0011009641,0.042946063,0.005860399,0.010405322,0.07905678,0.8600315],"study_design_scores_gemma":[0.005770057,0.0016735498,0.002478295,0.00034051892,0.00011722046,0.00033916757,0.0038314224,0.5618801,0.0058548083,0.02268905,0.39458254,0.0004432419],"about_ca_topic_score_codex":0.00007024465,"about_ca_topic_score_gemma":0.000070393784,"teacher_disagreement_score":0.8595882,"about_ca_system_score_codex":0.00014512363,"about_ca_system_score_gemma":0.0015887513,"threshold_uncertainty_score":0.9998645},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.12156436583336688,"score_gpt":0.4073655037568511,"score_spread":0.2858011379234842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531881412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30961484,0.00009769166,0.6894815,0.00022851079,0.00012737434,0.00035066143,0.0000024445503,0.000021206399,0.00007578583],"genre_scores_gemma":[0.9155885,0.000058218204,0.08402783,0.000004704997,0.00017129781,0.000019338991,0.0000029347455,0.00003732629,0.0000898401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979693,0.0003036737,0.0006959101,0.00014278872,0.0005156378,0.00037264463],"domain_scores_gemma":[0.99738485,0.00034756833,0.000045692865,0.00016375748,0.001968862,0.00008929313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00548302,0.00010534266,0.00019979195,0.0009931092,0.00022511765,0.00012190111,0.00017608736,0.0001201407,0.000027273514],"category_scores_gemma":[0.0007304074,0.00008227686,0.000050018527,0.00092911837,0.00007441578,0.0008744842,0.000030837935,0.0003510413,0.00000679111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030409685,0.00003108991,0.0012573482,0.00004745955,0.000016041733,0.0000015441889,0.00058888947,0.91703826,0.05911505,0.0003719154,0.000030110336,0.021471888],"study_design_scores_gemma":[0.0010940585,0.00019112366,0.001101596,0.00036049227,0.000005835032,0.0000648121,0.00035980975,0.97676265,0.01966164,0.00021797643,0.00007077975,0.00010920741],"about_ca_topic_score_codex":0.000059755574,"about_ca_topic_score_gemma":0.00009657751,"teacher_disagreement_score":0.60597366,"about_ca_system_score_codex":0.00093269366,"about_ca_system_score_gemma":0.00026550886,"threshold_uncertainty_score":0.33551532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2462101905584332,"score_gpt":0.5465173684657684,"score_spread":0.3003071779073352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795213612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017084503,0.00007123441,0.9904083,0.005307255,0.00018766336,0.0010493431,0.000087269415,0.000031794716,0.0011486672],"genre_scores_gemma":[0.016723922,0.000098632634,0.9774769,0.00021615205,0.00076252664,0.00008933294,0.00002613436,0.00008087761,0.004525507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569416,0.00064374326,0.0010343891,0.00035370773,0.0014930238,0.0007809925],"domain_scores_gemma":[0.9874712,0.001679897,0.00017817252,0.00052994204,0.0098256115,0.00031513022],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0060609626,0.00021891174,0.00045716544,0.0009750441,0.0011360617,0.00035695115,0.00069546857,0.00019720796,0.001175827],"category_scores_gemma":[0.006703333,0.00018873392,0.00018596869,0.0014001258,0.00029514308,0.0007252988,0.0001664451,0.00073597714,0.000022012926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016507506,0.0031841483,0.00017496213,0.00053836626,0.0011878881,0.00009465263,0.019357333,0.5369676,0.010856878,0.2070916,0.14726765,0.07162819],"study_design_scores_gemma":[0.0029751332,0.0007457307,0.000008031408,0.00009302779,0.000036298745,0.00011434463,0.004427887,0.96608603,0.0102470005,0.010281603,0.004739368,0.00024553319],"about_ca_topic_score_codex":0.000013201971,"about_ca_topic_score_gemma":0.00005376106,"teacher_disagreement_score":0.42911848,"about_ca_system_score_codex":0.00026209457,"about_ca_system_score_gemma":0.0010211798,"threshold_uncertainty_score":0.99973726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11569123562754507,"score_gpt":0.34757701871870195,"score_spread":0.23188578309115687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802307407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88395137,0.00072151615,0.0006225483,0.07675256,0.00049530267,0.0009943986,0.0000010157562,0.000011728164,0.03644958],"genre_scores_gemma":[0.9953087,0.000025687783,0.00015843402,0.0015784643,0.002502585,0.000032375698,0.0000016230949,0.000008348983,0.00038375886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851084,0.0001833736,0.00032699623,0.00010808086,0.0005941572,0.00027657565],"domain_scores_gemma":[0.9990519,0.0001527767,0.00006218089,0.0001701281,0.00055204186,0.000010972594],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006073565,0.00007789305,0.00012537898,0.0005256546,0.00073827995,0.0012036047,0.00052802695,0.000029806926,0.00025780575],"category_scores_gemma":[0.0007718579,0.000039910345,0.000045220862,0.0008422602,0.00037357776,0.0009636216,0.00017257173,0.00042577396,0.00005112011],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042479727,0.00031493642,0.014461484,0.00009904418,0.00006919573,0.000117890704,0.00534932,0.00052979315,0.00024146683,0.75733984,0.21000274,0.0110495025],"study_design_scores_gemma":[0.005301967,0.00021559469,0.017712696,0.00018086327,0.00003218206,0.000074243995,0.008462263,0.025198082,0.000034210196,0.016104814,0.92646253,0.00022054462],"about_ca_topic_score_codex":0.00021533309,"about_ca_topic_score_gemma":0.0006926039,"teacher_disagreement_score":0.741235,"about_ca_system_score_codex":0.000032774795,"about_ca_system_score_gemma":0.00009721176,"threshold_uncertainty_score":0.9998332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02668776191856606,"score_gpt":0.3792068938149303,"score_spread":0.3525191318963642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900942427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4989005,0.00010174519,0.49584007,0.0032118538,0.00008521497,0.00061364856,0.00032584782,0.0000030459057,0.0009180822],"genre_scores_gemma":[0.99571633,0.0000060191323,0.003825451,0.000014992273,0.00015575075,0.000022548993,0.000009840383,0.0000090250005,0.00024006228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.000053146083,0.0003022356,0.00012681082,0.00019791447,0.00019758512],"domain_scores_gemma":[0.9987571,0.00057902985,0.000041820298,0.000084768646,0.0004536824,0.0000835935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056284084,0.00007224476,0.00013597705,0.000095798554,0.0005100193,0.00014230241,0.0001289062,0.000021057856,0.000054399075],"category_scores_gemma":[0.00012814537,0.00004879041,0.000022182152,0.00018906509,0.00015429204,0.00013795166,0.00004895707,0.00022456534,0.0000028833285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021584607,0.0016333632,0.0040708827,0.00016048587,0.00076267653,0.000023339288,0.014127331,0.07042662,0.0032084845,0.83243203,0.0016139989,0.069382325],"study_design_scores_gemma":[0.0016388531,0.0006283791,0.0016540481,0.000054632892,0.000014116672,0.000008973094,0.0006026643,0.92515844,0.00015252052,0.0692989,0.0006904682,0.00009798871],"about_ca_topic_score_codex":0.000023555987,"about_ca_topic_score_gemma":0.000053787,"teacher_disagreement_score":0.85473186,"about_ca_system_score_codex":0.00002334679,"about_ca_system_score_gemma":0.00009453636,"threshold_uncertainty_score":0.39227077},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06781829762024214,"score_gpt":0.40824239357759495,"score_spread":0.3404240959573528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942306438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944417,0.00006482809,0.0036044386,0.0005773423,0.000035409445,0.00069861783,0.000024540555,0.0000052790024,0.0005478493],"genre_scores_gemma":[0.9905781,0.000046581128,0.008778801,0.000010815698,0.00002712129,0.000039921866,0.0000025915363,0.000016788605,0.00049928814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852747,0.00024114618,0.00040150408,0.00015386773,0.00043965597,0.00023635337],"domain_scores_gemma":[0.99639785,0.001499738,0.00011604506,0.0002572581,0.0016268385,0.00010229269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015368034,0.00010215416,0.00028518224,0.00029382843,0.00025877517,0.000080772144,0.00022117056,0.00006298052,0.00025105648],"category_scores_gemma":[0.00069946604,0.000072592826,0.00006934404,0.0006761345,0.00018074962,0.000284544,0.000046247464,0.00030405118,0.0000075574653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013943418,0.0015733761,0.09429205,0.0004911573,0.00054114166,0.00000892896,0.0027717322,0.000642795,0.032832604,0.86206,0.0022417563,0.0011501313],"study_design_scores_gemma":[0.022138052,0.005131331,0.05781159,0.0010740695,0.0005681451,0.0010307262,0.01599294,0.027856378,0.07208394,0.79086834,0.00420714,0.0012373168],"about_ca_topic_score_codex":0.000021309785,"about_ca_topic_score_gemma":0.00008390371,"teacher_disagreement_score":0.071191624,"about_ca_system_score_codex":0.000023370032,"about_ca_system_score_gemma":0.00023901816,"threshold_uncertainty_score":0.29602495},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematical optimization; 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","score_opus":0.2304685259582979,"score_gpt":0.3775579500866497,"score_spread":0.14708942412835183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015902257","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018655077,0.0025930663,0.30308148,0.65558434,0.004957206,0.008801514,0.00018625878,0.0001555065,0.005985589],"genre_scores_gemma":[0.97875935,0.00053088425,0.009044524,0.00195353,0.0070116064,0.000671283,0.00022099502,0.00007528944,0.0017325513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718726,0.0000825931,0.0009762583,0.00031988745,0.0008569701,0.00057703827],"domain_scores_gemma":[0.99632394,0.00015345967,0.00014013519,0.00044703283,0.0028863915,0.000049063612],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0052702115,0.00021026084,0.00030550716,0.0006097802,0.001629306,0.0012577203,0.0011201488,0.00012237293,0.00029176602],"category_scores_gemma":[0.0016776521,0.00015293635,0.00027110198,0.0006472939,0.00014774382,0.00065550476,0.0008236988,0.0013264074,0.00011078168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030803873,0.0005196038,0.00016174263,0.002161767,0.0009888475,0.000017281562,0.0019579697,0.4794343,0.0030795012,0.09096013,0.39951423,0.02089659],"study_design_scores_gemma":[0.00066192023,0.00007205598,0.00028192665,0.00015859416,0.0001571381,0.0000020074008,0.0030317698,0.870745,0.0000311136,0.009069451,0.11552763,0.000261385],"about_ca_topic_score_codex":0.0022436804,"about_ca_topic_score_gemma":0.0050423522,"teacher_disagreement_score":0.9601043,"about_ca_system_score_codex":0.0001449536,"about_ca_system_score_gemma":0.0005315906,"threshold_uncertainty_score":0.99977905},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"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","score_opus":0.060539457765180424,"score_gpt":0.36647221311571265,"score_spread":0.3059327553505322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021274929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89344645,0.0044747298,0.07743707,0.020711841,0.00030121644,0.00068172533,0.000024582947,0.000073984214,0.0028484298],"genre_scores_gemma":[0.94008297,0.00074862846,0.058253393,0.000045608667,0.00021615291,0.000025107698,0.0000068528966,0.000014210286,0.0006070803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878246,0.00006603885,0.00047618416,0.000077731616,0.0003961984,0.00020136796],"domain_scores_gemma":[0.99863094,0.00013200917,0.000015884994,0.00012288369,0.0010075285,0.00009075476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519742,0.000075925534,0.00009309444,0.00021426775,0.0007115233,0.00029351204,0.00017205742,0.00004596268,0.00007776164],"category_scores_gemma":[0.00012386475,0.00005381136,0.000034498014,0.00038237,0.00012256119,0.0004730126,0.000012073529,0.0005060077,0.000024610295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018207593,0.00014445896,0.00077111507,0.000025818419,0.0001339596,0.0000057028724,0.0022438013,0.8989887,0.027729044,0.03907221,0.0038885975,0.02697834],"study_design_scores_gemma":[0.0022197352,0.00018128977,0.015099041,0.000113552094,0.000029384235,0.00019100678,0.0020321722,0.77688485,0.010819038,0.00023594413,0.19186991,0.00032409406],"about_ca_topic_score_codex":0.000007359296,"about_ca_topic_score_gemma":0.0003758098,"teacher_disagreement_score":0.18798131,"about_ca_system_score_codex":0.000070603615,"about_ca_system_score_gemma":0.00018612026,"threshold_uncertainty_score":0.54725343},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20318264677019204,"score_gpt":0.43885048755413525,"score_spread":0.2356678407839432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360782622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908719,0.000238257,0.001557208,0.004824815,0.000021535097,0.00010723072,0.000004525879,0.0000055240616,0.0023689733],"genre_scores_gemma":[0.9978084,0.0002338274,0.0014256011,0.000039339895,0.000058800586,0.000018071354,0.000010892959,0.00000858402,0.0003964577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627286,0.0010179685,0.0007321838,0.00034329825,0.0013070874,0.00032659117],"domain_scores_gemma":[0.99824715,0.00045443437,0.000067657056,0.00034065652,0.00066581194,0.0002242987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015067613,0.000085548614,0.0002433205,0.0041689696,0.00038245582,0.00074654276,0.0005161398,0.000078008,0.000008806207],"category_scores_gemma":[0.0012168236,0.00007123387,0.000026232634,0.0041171964,0.00021933958,0.0008266551,0.000091777474,0.00041527854,0.000012791473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000551622,0.00011994317,0.004891026,0.000008864239,0.0000101828045,0.000031834126,0.006434754,0.92689073,0.00085111766,0.007753587,0.00048920664,0.05246358],"study_design_scores_gemma":[0.00036929827,0.00006517092,0.015632747,0.000020610483,0.0000036543277,0.000031341275,0.0059609185,0.9718534,0.000012737579,0.004922217,0.0010532574,0.00007466874],"about_ca_topic_score_codex":0.02154051,"about_ca_topic_score_gemma":0.22480275,"teacher_disagreement_score":0.20326224,"about_ca_system_score_codex":0.00017171197,"about_ca_system_score_gemma":0.00045428728,"threshold_uncertainty_score":0.98497516},"labels":[],"label_agreement":null}]}