{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0779367,0.0035071366,0.7434479,0.0038622827,0.0010620872,0.00018487083,0.00062595506,0.00085121434,0.16852182],"genre_scores_gemma":[0.7709286,0.004917888,0.1858468,0.000978411,0.001687347,0.0001849564,0.0008852586,0.00033656493,0.03423415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999432,0.00015047898,0.000022309188,0.0001265105,0.00014987319,0.00011885651],"domain_scores_gemma":[0.9987373,0.0006670497,0.00011863531,0.00022063231,0.00014353367,0.00011288049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044994292,0.00058390567,0.00069890777,0.000707494,0.0009967558,0.0008892145,0.0011567881,0.0011126656,0.011251316],"category_scores_gemma":[0.0031086742,0.0002277962,0.0010795796,0.001512203,0.00079083076,0.0013583985,0.001166529,0.001797657,0.00083287706],"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.00013350924,0.00018842587,0.0011487708,0.00038492304,0.000056136927,0.0004644243,0.0002008361,0.26142722,0.0023268545,0.57603556,0.037789457,0.11984388],"study_design_scores_gemma":[0.000038146503,0.000054495697,0.00062737416,0.000026090851,0.000017441773,0.000513511,0.00008217531,0.62483865,0.0006298158,0.3210996,0.052058622,0.000014096613],"about_ca_topic_score_codex":0.0053416346,"about_ca_topic_score_gemma":0.0049266065,"teacher_disagreement_score":0.011251316,"about_ca_system_score_codex":0.0013466951,"about_ca_system_score_gemma":0.00081512315,"threshold_uncertainty_score":0.03763944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7577589,0.0030281907,0.15966348,0.00274119,0.00015978115,0.0001245316,0.0020640001,0.00044938835,0.07401051],"genre_scores_gemma":[0.9365495,0.001875324,0.049407262,0.00023739743,0.00038506626,0.0001736777,0.001524725,0.00024052382,0.009606641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.0003409963,0.00007414314,0.0002598313,0.0003533225,0.00035737333],"domain_scores_gemma":[0.9718679,0.021426944,0.002040619,0.0012909415,0.0012315796,0.002142094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022681777,0.0009922175,0.0011703622,0.0028909005,0.0018903932,0.0036431109,0.0015587592,0.0009069074,0.006077562],"category_scores_gemma":[0.013049507,0.0008795815,0.00075963984,0.0019556754,0.0029299522,0.008089023,0.001764851,0.0019741105,0.0008421262],"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.0016308828,0.00034964413,0.0104010375,0.00048588437,0.000088971996,0.0004299138,0.0013280623,0.080615826,0.011941589,0.8307186,0.008020554,0.05398901],"study_design_scores_gemma":[0.00012711492,0.00038815604,0.007299026,0.00017151017,0.00011021168,0.00073465274,0.00066055276,0.17557974,0.007507216,0.7988343,0.008499715,0.00008771084],"about_ca_topic_score_codex":0.0025614554,"about_ca_topic_score_gemma":0.0042543164,"teacher_disagreement_score":0.006077562,"about_ca_system_score_codex":0.002902214,"about_ca_system_score_gemma":0.0013400428,"threshold_uncertainty_score":0.021057129},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02061299,0.0003336175,0.9653428,0.0008932299,0.00008719664,0.00065171847,0.00013522421,0.00020121616,0.011741991],"genre_scores_gemma":[0.42356974,0.00070461055,0.5649427,0.00024078244,0.0001856999,0.00097693,0.0003605927,0.000051329967,0.008967568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99304575,0.0034621763,0.00039799346,0.0010859093,0.0016030872,0.00040501056],"domain_scores_gemma":[0.9963257,0.0021941813,0.00027281605,0.0003593789,0.00064773235,0.00020018288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007960312,0.0012098333,0.0015850073,0.0020060255,0.0022212595,0.0039576944,0.0016511156,0.0018992417,0.008348744],"category_scores_gemma":[0.008754904,0.00041275896,0.0016843852,0.0034482842,0.0015287459,0.003156592,0.0035174,0.0016871579,0.0013040676],"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.0003283128,0.00033700909,0.0029478772,0.0006345419,0.00044111704,0.0011113789,0.004559646,0.3281267,0.0044990014,0.45069227,0.0056143845,0.20070778],"study_design_scores_gemma":[0.0000659395,0.00027694085,0.00057708746,0.00012050538,0.00015666196,0.00020027015,0.00062764034,0.6666578,0.0020594269,0.31416726,0.015028134,0.00006233567],"about_ca_topic_score_codex":0.0023736153,"about_ca_topic_score_gemma":0.0015270334,"teacher_disagreement_score":0.008348744,"about_ca_system_score_codex":0.001410744,"about_ca_system_score_gemma":0.002651619,"threshold_uncertainty_score":0.04209864},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043931983,0.008991927,0.5508321,0.015400033,0.002286419,0.000208624,0.0004109126,0.0007410979,0.37719682],"genre_scores_gemma":[0.623277,0.00929784,0.20004295,0.004140567,0.0029039532,0.00047320977,0.0006713408,0.00083409995,0.158359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800247,0.0006815764,0.000112658105,0.0002735884,0.0007553312,0.00017433062],"domain_scores_gemma":[0.988359,0.008550041,0.00038983932,0.0008059917,0.0015783373,0.00031677348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042940085,0.0011481625,0.0009839915,0.0027023738,0.0018823058,0.0023207222,0.0017279414,0.0019176506,0.019732859],"category_scores_gemma":[0.026943253,0.00036221472,0.0015819557,0.0025122534,0.0038843895,0.006049368,0.0025806942,0.0056878403,0.0029890493],"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.000051535164,0.000027663502,0.00030123058,0.000063870844,0.000011638192,0.00010441411,0.00020293817,0.004745021,0.00059844495,0.9770876,0.005209349,0.011596281],"study_design_scores_gemma":[0.000029310762,0.000038170187,0.00038218725,0.00009002531,0.000015661324,0.00013589306,0.00010251224,0.0515013,0.0012782816,0.9235959,0.02279124,0.00003949829],"about_ca_topic_score_codex":0.0048672277,"about_ca_topic_score_gemma":0.0030834428,"teacher_disagreement_score":0.019732859,"about_ca_system_score_codex":0.0026579632,"about_ca_system_score_gemma":0.0012448474,"threshold_uncertainty_score":0.06601298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04031474,0.032973934,0.7611156,0.034046214,0.0011665619,0.00008192526,0.0002702981,0.00028303664,0.1297477],"genre_scores_gemma":[0.6578542,0.06420278,0.24337338,0.008544009,0.008399711,0.00044988465,0.0004795139,0.0005163967,0.016180107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971329,0.0016220732,0.00012657531,0.00034423592,0.0005728468,0.00020139868],"domain_scores_gemma":[0.98568195,0.012103189,0.0005644896,0.00076857454,0.00065222476,0.00022954273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040824474,0.0012399247,0.0015178582,0.003530878,0.002094905,0.0039281594,0.0023340264,0.00355912,0.00606954],"category_scores_gemma":[0.013229363,0.0007902093,0.0016263817,0.0052105566,0.007831735,0.011908466,0.0025339094,0.005200099,0.00057691825],"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.000012440257,0.000022747805,0.00015410683,0.00007434168,0.00001009574,0.000078635945,0.000073057105,0.0061689606,0.00008885679,0.9854565,0.001774494,0.006085785],"study_design_scores_gemma":[0.0000029203284,0.00000910977,0.000112349175,0.000035757123,0.0000035866224,0.000034863282,0.000029810652,0.010381944,0.00004605053,0.9870366,0.0023007852,0.0000063104358],"about_ca_topic_score_codex":0.0010281272,"about_ca_topic_score_gemma":0.00093391066,"teacher_disagreement_score":0.00606954,"about_ca_system_score_codex":0.0020368244,"about_ca_system_score_gemma":0.000623736,"threshold_uncertainty_score":0.021590292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2085714,0.0038670334,0.65785295,0.0034991435,0.0011033927,0.00012599296,0.00043006308,0.00081291597,0.123737134],"genre_scores_gemma":[0.7826814,0.00393183,0.19768842,0.0008590282,0.0006852847,0.00011777832,0.00037179093,0.00035978487,0.0133046545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861836,0.00044093045,0.00010011547,0.0002994705,0.00029737584,0.00024372122],"domain_scores_gemma":[0.99690104,0.0015076122,0.00025542453,0.00070541585,0.00042582327,0.00020475998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001289071,0.00050046155,0.00051044446,0.00061330793,0.0013894248,0.0012342164,0.001103139,0.00044152723,0.003192307],"category_scores_gemma":[0.0045642243,0.0004836985,0.00063684187,0.0012669589,0.001761718,0.002732401,0.0017181401,0.002775733,0.00066666],"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.00034934614,0.00011532215,0.0024559197,0.0003232725,0.00004045163,0.00077800493,0.0011471831,0.031136433,0.019451397,0.84922385,0.010388829,0.08458996],"study_design_scores_gemma":[0.00005746243,0.00023359049,0.002768316,0.00012287538,0.00007675901,0.0014464865,0.0006834556,0.06378946,0.015628943,0.8429469,0.072161354,0.00008439353],"about_ca_topic_score_codex":0.0030412772,"about_ca_topic_score_gemma":0.0035825502,"teacher_disagreement_score":0.003192307,"about_ca_system_score_codex":0.0010410006,"about_ca_system_score_gemma":0.00065755716,"threshold_uncertainty_score":0.010679305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24487244,0.00067256147,0.7271088,0.0025661204,0.00011012506,0.00037528906,0.0007787391,0.0010950784,0.022420902],"genre_scores_gemma":[0.73235154,0.0006102792,0.25318575,0.0004599798,0.000259706,0.0003617778,0.0017668498,0.0004315131,0.010572491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587435,0.0020067801,0.000116969255,0.0007585418,0.00058294274,0.00066045293],"domain_scores_gemma":[0.9878808,0.007718988,0.0013033443,0.0020853614,0.00047699452,0.00053450436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023072853,0.0013573859,0.0015197139,0.0008274679,0.0012557231,0.003011135,0.0045005903,0.0025114527,0.0117433835],"category_scores_gemma":[0.011480701,0.000680979,0.0009853115,0.0026693565,0.0018789896,0.008384179,0.0023968755,0.0018704107,0.0010979243],"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.0011002264,0.0010104702,0.0029608002,0.0005180535,0.00021534723,0.00056919997,0.00037832226,0.58737177,0.004144821,0.28526548,0.016930692,0.09953485],"study_design_scores_gemma":[0.00009078386,0.000112404035,0.00032299737,0.000018560688,0.000023385235,0.00015027271,0.00013262735,0.81895334,0.0022977542,0.17511235,0.002768663,0.00001690031],"about_ca_topic_score_codex":0.0019870545,"about_ca_topic_score_gemma":0.00270094,"teacher_disagreement_score":0.0117433835,"about_ca_system_score_codex":0.0021730587,"about_ca_system_score_gemma":0.0013823385,"threshold_uncertainty_score":0.0392856},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015691972,0.00007392667,0.9969785,0.00005368814,0.000016394786,0.000017164197,0.000014720387,0.00017849497,0.0010979194],"genre_scores_gemma":[0.117694415,0.00035509394,0.87380695,0.0000653776,0.00005235643,0.00030234896,0.00017576295,0.00025134705,0.0072964085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995956,0.0001230098,0.000016237376,0.00006821994,0.0001563312,0.000040619027],"domain_scores_gemma":[0.99973756,0.0001285076,0.000028215296,0.000028292035,0.000057168105,0.000020217034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071920425,0.0010846794,0.001318489,0.00062584307,0.00045858885,0.0010845811,0.0011199504,0.0007549936,0.0041332636],"category_scores_gemma":[0.0014018313,0.0006149782,0.00060558465,0.0012634619,0.00059831486,0.0011557571,0.0011671615,0.0018443168,0.0011408689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011559685,0.00006662058,0.00013224583,0.000087495726,0.000041532672,0.00006212938,0.000076741206,0.70958054,0.0025012903,0.06694547,0.003736975,0.21665344],"study_design_scores_gemma":[0.000014710957,0.000012099923,0.000021561746,0.0000036990343,0.0000030935933,0.000013704943,0.0000032292055,0.9898127,0.0002805299,0.008112492,0.0017182181,0.00000394413],"about_ca_topic_score_codex":0.0032066677,"about_ca_topic_score_gemma":0.0027852484,"teacher_disagreement_score":0.0041332636,"about_ca_system_score_codex":0.00088832196,"about_ca_system_score_gemma":0.0012037491,"threshold_uncertainty_score":0.0138270855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060069766,0.00028854955,0.98886514,0.00019385979,0.00012472928,0.00016765106,0.00017498163,0.0013682445,0.002809983],"genre_scores_gemma":[0.046239834,0.00015258329,0.9489161,0.00019697145,0.000071376984,0.00031827335,0.00075844745,0.00028974365,0.0030566438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.00022883787,0.000043273845,0.00027321107,0.00028420673,0.00018542391],"domain_scores_gemma":[0.9992768,0.00028892615,0.00006758903,0.00013207483,0.00016372833,0.00007094925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009796647,0.0013805624,0.0016057985,0.0015394775,0.0009408246,0.0012114927,0.003105657,0.0021118491,0.006220697],"category_scores_gemma":[0.0026962059,0.0006445585,0.0015602183,0.0019259965,0.00066105986,0.0015910441,0.0011281413,0.0016637604,0.0018511306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021118048,0.0003254914,0.000611963,0.00032495125,0.00008125253,0.00015549945,0.00013010122,0.48549867,0.008205281,0.02643754,0.0235381,0.45447996],"study_design_scores_gemma":[0.00010796975,0.000073963965,0.00014342282,0.000020265894,0.00001797069,0.00013877796,0.000021725738,0.9783201,0.0014761825,0.011903417,0.007750042,0.00002618578],"about_ca_topic_score_codex":0.006935711,"about_ca_topic_score_gemma":0.009603504,"teacher_disagreement_score":0.006935711,"about_ca_system_score_codex":0.0018542407,"about_ca_system_score_gemma":0.0031524654,"threshold_uncertainty_score":0.020810306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009946603,0.0002785298,0.9883837,0.000108365886,0.00001474367,0.000044284934,0.0000130092585,0.00014525608,0.0010655929],"genre_scores_gemma":[0.40957722,0.000497407,0.5866063,0.00014242742,0.000060270715,0.00046000196,0.0001266498,0.00018594896,0.0023437324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987581,0.0008142103,0.00004466781,0.00010229567,0.00020707615,0.000073711526],"domain_scores_gemma":[0.9972779,0.0019961318,0.00022482275,0.00016438629,0.0002592313,0.00007753885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036851014,0.001157778,0.0017378383,0.0011678849,0.0003755431,0.0012401035,0.0015005362,0.0011954033,0.0022544102],"category_scores_gemma":[0.006811182,0.000702236,0.0010509548,0.0011283488,0.0018402709,0.0019037584,0.00196771,0.0017027704,0.0004820711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008091027,0.000063391744,0.0002763061,0.000118120275,0.000032609063,0.00005704661,0.000108261025,0.9377258,0.0013028166,0.032159608,0.0005396771,0.027535478],"study_design_scores_gemma":[0.000014933208,0.000050139075,0.000018536639,0.000009409601,0.0000050075305,0.000007749648,0.000009895819,0.9941229,0.0003682974,0.005037032,0.0003508535,0.00000513934],"about_ca_topic_score_codex":0.0026776625,"about_ca_topic_score_gemma":0.0019244408,"teacher_disagreement_score":0.0036851014,"about_ca_system_score_codex":0.0009880922,"about_ca_system_score_gemma":0.0010664739,"threshold_uncertainty_score":0.01948893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065238858,0.0007299618,0.98557264,0.0002727262,0.00008654703,0.00008154849,0.00017485682,0.00067849737,0.0058794445],"genre_scores_gemma":[0.1029024,0.0005450828,0.8875598,0.00036868293,0.000100671554,0.0005307754,0.00063064205,0.0005286453,0.006833348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995863,0.00015864278,0.000017547354,0.000051171042,0.00015212229,0.00003425058],"domain_scores_gemma":[0.9993062,0.00039905412,0.00003931987,0.00008611032,0.00012481191,0.00004452751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345116,0.00093250093,0.0011583307,0.0006911702,0.0005575462,0.00082618755,0.0014758321,0.0010520077,0.0074075633],"category_scores_gemma":[0.0026397014,0.00039158703,0.00093037455,0.00082140113,0.00047144594,0.0010079833,0.001380452,0.0013078805,0.0015893823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002114666,0.00014423548,0.0009699812,0.00062757655,0.00012470642,0.0002640488,0.0001455132,0.6524421,0.006422582,0.032562133,0.020410294,0.28567538],"study_design_scores_gemma":[0.000027829683,0.00002587484,0.0001537978,0.000019120167,0.000008130884,0.000046304332,0.000012015591,0.98261696,0.0007589769,0.0087704845,0.007549894,0.0000106677035],"about_ca_topic_score_codex":0.0052914843,"about_ca_topic_score_gemma":0.009849596,"teacher_disagreement_score":0.0074075633,"about_ca_system_score_codex":0.0004581884,"about_ca_system_score_gemma":0.0012073134,"threshold_uncertainty_score":0.02478081},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41297117,0.010253977,0.43688923,0.034724485,0.0006587176,0.00019260934,0.00042223287,0.0003459314,0.103541575],"genre_scores_gemma":[0.9788617,0.0022930235,0.011636147,0.00032148964,0.0003341733,0.00007723371,0.00007308367,0.000031667405,0.0063714664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772376,0.0013116611,0.00010517238,0.00024693707,0.0002755891,0.000336865],"domain_scores_gemma":[0.98043936,0.015629804,0.0023498763,0.00037150565,0.00060399616,0.0006054665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067168083,0.00054557686,0.001100373,0.00089621526,0.0013555585,0.0036830222,0.0008237707,0.002837033,0.005054022],"category_scores_gemma":[0.017604545,0.000519595,0.000627907,0.0015227644,0.004309717,0.005565355,0.0010138343,0.0024088442,0.0002489919],"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.00020096677,0.00009385229,0.0024240804,0.00017178389,0.00006575632,0.00091598294,0.00077116134,0.113173105,0.00029404866,0.8527684,0.007160461,0.021960432],"study_design_scores_gemma":[0.0001091914,0.000059134607,0.0007865542,0.00006906425,0.000029132245,0.00025222814,0.00074126583,0.18462242,0.0003021546,0.8059829,0.0069984808,0.000047446345],"about_ca_topic_score_codex":0.0032524895,"about_ca_topic_score_gemma":0.0015637461,"teacher_disagreement_score":0.0067168083,"about_ca_system_score_codex":0.0023680495,"about_ca_system_score_gemma":0.0013133617,"threshold_uncertainty_score":0.035522282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014414628,0.001422181,0.96961266,0.0005408551,0.00014185271,0.000026225178,0.00006098165,0.0002656167,0.013514953],"genre_scores_gemma":[0.7401866,0.0034198728,0.23883727,0.00047547702,0.00060572143,0.00025690993,0.00031261955,0.0004204373,0.015485007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991366,0.00026485045,0.000056103483,0.000084607724,0.00037186273,0.000086004206],"domain_scores_gemma":[0.99415153,0.0040324572,0.0003224523,0.00045382348,0.0008878029,0.0001519366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026868351,0.00057550566,0.0006784698,0.0019205166,0.0004267673,0.0010927093,0.0012903074,0.00088357733,0.0039969585],"category_scores_gemma":[0.017638598,0.000308666,0.0010298049,0.0012123019,0.0015870754,0.0029226202,0.0011541425,0.0021953387,0.00082458503],"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.00003477638,0.000055206332,0.00088175264,0.00018434483,0.000024872128,0.00018921345,0.00015338515,0.17962752,0.0029462741,0.79283166,0.0020596064,0.021011336],"study_design_scores_gemma":[0.0000047817343,0.000009478151,0.00030499898,0.00002867927,0.000010273943,0.00008599028,0.000021229574,0.8429453,0.0007177018,0.15433325,0.0015260351,0.0000122927595],"about_ca_topic_score_codex":0.0024658015,"about_ca_topic_score_gemma":0.0016835122,"teacher_disagreement_score":0.0039969585,"about_ca_system_score_codex":0.001272081,"about_ca_system_score_gemma":0.0011148789,"threshold_uncertainty_score":0.014209449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91144794,0.00050106953,0.07365498,0.00024433233,0.000019872256,0.000021672578,0.00053857925,0.00012061474,0.013450922],"genre_scores_gemma":[0.9819288,0.0002998464,0.015957765,0.000028154305,0.00003410917,0.000027842598,0.0004147987,0.000039680162,0.0012690454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997762,0.000031033644,0.000012064633,0.0000749871,0.00006113245,0.00004461078],"domain_scores_gemma":[0.99833494,0.00080686976,0.00034764415,0.00015068798,0.00017340691,0.00018648361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033175998,0.00035811745,0.00045337173,0.0016893358,0.00054459,0.0009297787,0.0004836607,0.000459485,0.001190046],"category_scores_gemma":[0.002774114,0.00016757793,0.00022292676,0.0010932069,0.0008617826,0.001633803,0.0005004601,0.0004047235,0.000116698575],"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.0012419632,0.00017132988,0.0254064,0.00056902284,0.00011430327,0.0011264182,0.0010731001,0.1743778,0.07594725,0.6539543,0.0062287487,0.059789397],"study_design_scores_gemma":[0.00008798291,0.00024918068,0.01838502,0.000095238785,0.00010553218,0.002125916,0.0005194605,0.36119604,0.02131255,0.58753204,0.00832666,0.00006436035],"about_ca_topic_score_codex":0.00058462453,"about_ca_topic_score_gemma":0.0008480428,"teacher_disagreement_score":0.0016893358,"about_ca_system_score_codex":0.00082661037,"about_ca_system_score_gemma":0.00028307148,"threshold_uncertainty_score":0.0059975386},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058426107,0.00015477405,0.99117404,0.00009723439,0.000026149326,0.000046766454,0.000057158428,0.00015568093,0.002445577],"genre_scores_gemma":[0.10020267,0.00039014596,0.8946417,0.000111688336,0.0000527189,0.0003560848,0.0004771139,0.00021590994,0.0035519383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906796,0.00035055913,0.000041137486,0.00017551852,0.00025848413,0.000106417676],"domain_scores_gemma":[0.9981116,0.0010976814,0.00018376819,0.00018101736,0.00031157312,0.00011440893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019071375,0.0012438856,0.0013458111,0.0019650008,0.0010381013,0.001448112,0.0024248473,0.0022014156,0.007592528],"category_scores_gemma":[0.0073092687,0.00077024766,0.0015727549,0.001566175,0.00092885824,0.0021024805,0.0026381966,0.002119498,0.0017846726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015490851,0.00010951971,0.0004971379,0.00023474781,0.000059409715,0.00017555409,0.00019121188,0.7722478,0.002634913,0.1357222,0.004413804,0.08355876],"study_design_scores_gemma":[0.000071984934,0.00012730785,0.00012312099,0.000046610887,0.000018119606,0.00008581782,0.00007251382,0.9227118,0.0015276053,0.06900344,0.0061863153,0.00002537762],"about_ca_topic_score_codex":0.0015086067,"about_ca_topic_score_gemma":0.002115783,"teacher_disagreement_score":0.007592528,"about_ca_system_score_codex":0.0009242217,"about_ca_system_score_gemma":0.001328684,"threshold_uncertainty_score":0.025399566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05324058,0.0011177675,0.91811657,0.0008042248,0.00041150203,0.00029744586,0.0007668798,0.00035878975,0.024886178],"genre_scores_gemma":[0.56328547,0.0017246783,0.41422722,0.00035007004,0.0006052383,0.0004945878,0.0019377142,0.00025600096,0.017119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871814,0.00044742788,0.00006170411,0.00027596956,0.00024885611,0.0002479718],"domain_scores_gemma":[0.99936944,0.00033184906,0.00007476512,0.00006864484,0.00006703397,0.00008823617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992634,0.0014129686,0.0010262991,0.0006043792,0.00061258674,0.001309658,0.0013519935,0.0014828638,0.0062284274],"category_scores_gemma":[0.0014937302,0.00040992466,0.0010024628,0.0011550757,0.0006641317,0.0017739335,0.0012471486,0.0013074315,0.00071327103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003707445,0.00036481355,0.0013501071,0.00063910533,0.00015249025,0.00085088785,0.00023954832,0.73290014,0.00704771,0.08230184,0.013284083,0.16049848],"study_design_scores_gemma":[0.00010042323,0.00027251645,0.00087502284,0.000032601813,0.000055397184,0.00052797963,0.00017406655,0.93601465,0.0020394672,0.033161603,0.026710836,0.000035505625],"about_ca_topic_score_codex":0.003694369,"about_ca_topic_score_gemma":0.0024844254,"teacher_disagreement_score":0.0062284274,"about_ca_system_score_codex":0.00068361574,"about_ca_system_score_gemma":0.0016477791,"threshold_uncertainty_score":0.020836115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4069022,0.002446024,0.5300107,0.0030956788,0.00010979195,0.00046427362,0.00037830227,0.00016326939,0.056429766],"genre_scores_gemma":[0.9297489,0.0010065553,0.06302002,0.000100138925,0.000025809548,0.00020586264,0.0000620551,0.000015750706,0.0058147907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990588,0.0005396715,0.000029107441,0.000099437624,0.00013637995,0.00013667121],"domain_scores_gemma":[0.9981831,0.0014233163,0.00010094629,0.000040059378,0.00018738878,0.000065190055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023572193,0.0010015626,0.00087620126,0.0008989704,0.0019016168,0.002096547,0.0012475936,0.0018368607,0.0024251703],"category_scores_gemma":[0.0038711634,0.00037207824,0.0007200921,0.0019099533,0.0011742892,0.00076768,0.0010757666,0.0012973723,0.00012441255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046614754,0.00011539958,0.0013574914,0.00008478146,0.00002486222,0.00012564541,0.00023852043,0.93057245,0.00029666317,0.053099345,0.0005094864,0.013528685],"study_design_scores_gemma":[0.000015323005,0.000035379173,0.00061783014,0.000019215542,0.000014974572,0.000016658681,0.00030071466,0.9894056,0.00011909198,0.008144377,0.0012962904,0.0000145326885],"about_ca_topic_score_codex":0.32928008,"about_ca_topic_score_gemma":0.34834692,"teacher_disagreement_score":0.6707199,"about_ca_system_score_codex":0.009688646,"about_ca_system_score_gemma":0.0071520912,"threshold_uncertainty_score":0.6547269},"labels":[],"label_agreement":null}]}