{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":40,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":40,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9018dc6bc9d9","filters":{"venue":"Algorithmic operations research"}},"results":[{"id":"W1669838345","doi":"","title":"The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Decomposition; Computation; Set (abstract data type); Mathematical optimization; Computer science; Scale (ratio); Sampling (signal processing); Nested set model; Multistage sampling; Decomposition method (queueing theory); Mathematics; Algorithm; Statistics; Data mining","authors":[{"name":"Christopher Donohue","is_ca":false},{"name":"John R. Birge","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1881139073848471,"gpt":0.5090869338795994,"spread":0.3209730264947522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158781,0.0006985718,0.0007850455,0.0003977066,0.0002902962,0.000505459,0.0008741952,0.0005412189,0.002872184],"category_scores_gemma":[0.004079651,0.0004480816,0.0008387758,0.0005067668,0.0006617123,0.0009610815,0.001082639,0.001366065,0.0004888931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004594515,"about_ca_system_score_gemma":0.001310693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002773767,"about_ca_topic_score_gemma":0.003948408,"domain_scores_codex":[0.9989812,0.0005532753,0.00002575241,0.00008050205,0.0002972335,0.00006202613],"domain_scores_gemma":[0.998971,0.0006303921,0.00008550715,0.000102919,0.0001282062,0.00008195068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009604775,0.0001194804,0.000490632,0.00023373,0.00007395146,0.0001570808,0.0001138727,0.6753643,0.008319509,0.2103276,0.002240689,0.1024632],"study_design_scores_gemma":[0.00001104711,0.00003186322,0.00006940206,0.0000108322,0.000006284449,0.00002192834,0.000003971249,0.9731362,0.0005398477,0.02413219,0.002029869,0.000006706747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001435597,0.00007036814,0.9978306,0.00001997344,0.00001343411,0.00001694343,0.00001278478,0.00003301248,0.0005674337],"genre_scores_gemma":[0.1046052,0.0002680879,0.8919675,0.00005946794,0.00004437235,0.0002101619,0.00009444225,0.00009580845,0.002655029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002872184,"threshold_uncertainty_score":0.01141685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156841116","doi":"","title":"Quadratic Binary Programming Models in Computational Biology","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Heuristics; Solver; Quadratic equation; Linearization; Quadratic programming; Binary number; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Arithmetic","authors":[{"name":"Richard J. Forrester","is_ca":false},{"name":"Harvey J. Greenberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08857950310823591,"gpt":0.376263285187368,"spread":0.2876837820791321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886098,0.001127978,0.000965261,0.0008151461,0.0007347269,0.0023915,0.001605924,0.001624427,0.007856443],"category_scores_gemma":[0.008176479,0.0004627882,0.0008371773,0.002586575,0.002422004,0.003662304,0.001779496,0.003531653,0.001680758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002051862,"about_ca_system_score_gemma":0.001725078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005320102,"about_ca_topic_score_gemma":0.003833255,"domain_scores_codex":[0.997914,0.001205618,0.0000598788,0.0002445196,0.0004066961,0.0001692343],"domain_scores_gemma":[0.9951361,0.003889899,0.0002521523,0.0002616149,0.0003120865,0.0001480527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002806065,0.00005380957,0.000186909,0.0001636666,0.00001902102,0.00003335343,0.0001077785,0.1501979,0.0001478722,0.8223038,0.006417637,0.0203402],"study_design_scores_gemma":[0.00002217366,0.00002839924,0.00009952284,0.00003543473,0.000007410704,0.00002356083,0.00005053258,0.3698878,0.0001309376,0.6167693,0.01293211,0.00001308499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009382922,0.005055963,0.9486127,0.005282731,0.0003517453,0.0001066674,0.0003374318,0.0002327631,0.030637],"genre_scores_gemma":[0.4588852,0.01057248,0.477346,0.002227376,0.001644681,0.0008480158,0.001458268,0.0002665976,0.04675141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007856443,"threshold_uncertainty_score":0.02628237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593747011","doi":"","title":"Global convergence of a primal-dual interior-point method for nonlinear programming","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Interior point method; Iterated function; Convergence (economics); Nonlinear programming; Mathematical optimization; Dual (grammatical number); Point (geometry); Computer science; Nonlinear system; Linear programming; Mathematics; Mathematical analysis","authors":[{"name":"Igor Griva","is_ca":false},{"name":"David F. Shanno","is_ca":false},{"name":"Robert J. Vanderbei","is_ca":false},{"name":"Hande Y. Benson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1546466863892976,"gpt":0.4936075924287063,"spread":0.3389609060394087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004078865,0.001083284,0.001352389,0.0007557642,0.0005165942,0.000937178,0.001402193,0.001180007,0.002588375],"category_scores_gemma":[0.007255644,0.0006839324,0.0008991765,0.0005434153,0.001829165,0.001188143,0.002734912,0.002602473,0.0008855808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005715137,"about_ca_system_score_gemma":0.001116475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007342436,"about_ca_topic_score_gemma":0.0006153806,"domain_scores_codex":[0.9988418,0.0005946485,0.00003641149,0.000119031,0.0003488412,0.0000592661],"domain_scores_gemma":[0.9981462,0.001184856,0.00009878013,0.0001693146,0.0003224462,0.00007841437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000185271,0.000124768,0.0006933435,0.0003720024,0.00008051493,0.0001351438,0.0001900974,0.7824449,0.006560004,0.1218246,0.00268779,0.08470161],"study_design_scores_gemma":[0.00001165124,0.00002225379,0.00003869086,0.00001576087,0.000004840292,0.00002575782,0.000005268326,0.9858319,0.001050504,0.01173304,0.001254538,0.00000584765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001700182,0.00008541263,0.9969926,0.00004695654,0.00002455938,0.00001891828,0.000008748796,0.00006223354,0.001060314],"genre_scores_gemma":[0.1274223,0.0002854684,0.8681449,0.000115846,0.00007402479,0.0002999507,0.00009176644,0.0003219185,0.003243729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004078865,"threshold_uncertainty_score":0.02157134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1547588018","doi":"","title":"Recoverable Robustness for Train Shunting Problems","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Unavailability; Computer science; Shunting; Mathematical optimization; Exploit; Algorithm; Reliability engineering; Mathematics; Engineering","authors":[{"name":"Serafino Cicerone","is_ca":false},{"name":"Gianlorenzo D’Angelo","is_ca":false},{"name":"Gabriele Di Stefano","is_ca":false},{"name":"Daniele Frigioni","is_ca":false},{"name":"Alfredo Navarra","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05416012265873652,"gpt":0.3219233463933957,"spread":0.2677632237346592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002484207,0.00163618,0.001458633,0.00153637,0.0005185372,0.001987506,0.001261662,0.001946225,0.003482458],"category_scores_gemma":[0.01060126,0.0004336321,0.002303178,0.001102685,0.002145356,0.002409671,0.002845359,0.002876181,0.0003648882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208602,"about_ca_system_score_gemma":0.000719024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009726806,"about_ca_topic_score_gemma":0.0004135049,"domain_scores_codex":[0.9981285,0.000609892,0.0001355381,0.0004054771,0.0005011615,0.0002194533],"domain_scores_gemma":[0.9931832,0.005176216,0.0007759594,0.0003695493,0.0003166985,0.0001783538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009882137,0.00004781215,0.0004840588,0.0003046739,0.00007413953,0.000166391,0.0001201398,0.8712545,0.003601633,0.1011928,0.001026958,0.02162799],"study_design_scores_gemma":[0.00001005712,0.00006411517,0.000167219,0.00002794338,0.00001627505,0.00006798605,0.00003732333,0.9149205,0.001179202,0.08241146,0.001081409,0.00001641514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02095343,0.001051011,0.9727419,0.0003487865,0.00003933066,0.00005405332,0.00008204504,0.0002283188,0.004501191],"genre_scores_gemma":[0.7753028,0.003316651,0.2125703,0.0002446213,0.000399721,0.0003318041,0.0006081504,0.0004189168,0.006806974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003482458,"threshold_uncertainty_score":0.01313788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1569707558","doi":"","title":"Variants of Shortest Path Problems","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Digraph; Mathematics; Longest path problem; Combinatorics; Shortest path problem; Bottleneck; Discrete mathematics; Path (computing); Algebraic number; Mathematical optimization; Graph; Computer science","authors":[{"name":"Lara Turner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1195355251014714,"gpt":0.310154888384663,"spread":0.1906193632831916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959928,0.002566969,0.001634034,0.001687626,0.001275182,0.004444555,0.003269792,0.002024376,0.01418374],"category_scores_gemma":[0.01015684,0.0009059104,0.002295865,0.004957211,0.002042012,0.008125116,0.003125373,0.004485956,0.00372439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00191524,"about_ca_system_score_gemma":0.001844317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001768002,"about_ca_topic_score_gemma":0.001746761,"domain_scores_codex":[0.9951228,0.001812984,0.000415469,0.001175992,0.001033618,0.0004391591],"domain_scores_gemma":[0.9954301,0.002586052,0.0003885768,0.0008683238,0.0005181447,0.0002088172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001391945,0.0001103249,0.0005020694,0.0006651231,0.00009939605,0.0001547308,0.0002350055,0.07500544,0.0009543499,0.8066753,0.02481483,0.09064433],"study_design_scores_gemma":[0.0000612653,0.00009415579,0.0002369601,0.0001017686,0.00005282638,0.0004233757,0.0001396824,0.1109878,0.0008663092,0.7946079,0.0923931,0.00003481456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009759596,0.005374693,0.9345146,0.001611086,0.000807935,0.0004313604,0.001446389,0.0005463882,0.04550797],"genre_scores_gemma":[0.2409423,0.01348922,0.7039266,0.001182775,0.001925763,0.00103936,0.004928635,0.00065214,0.03191322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01418374,"threshold_uncertainty_score":0.04744929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1541832321","doi":"","title":"Multiobjective Optimization in Health Care Management. A metaheuristic and simulation approach.","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Metaheuristic; Context (archaeology); Computer science; Mathematical optimization; Management science; Operations research; Multi-objective optimization; Quality (philosophy); Health care; Mathematics; Machine learning; Artificial intelligence; Engineering; Economics","authors":[{"name":"Cristina Azcárate","is_ca":false},{"name":"Fermín Mallor","is_ca":false},{"name":"A. Gáfaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1406919612659554,"gpt":0.4994470119753868,"spread":0.3587550507094314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003181242,0.001039459,0.0009594904,0.00161532,0.0004952569,0.002088002,0.001124909,0.001713013,0.002148945],"category_scores_gemma":[0.004608487,0.0005710421,0.0009979511,0.001792307,0.002061693,0.001632449,0.001271894,0.0020971,0.0003567672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002186259,"about_ca_system_score_gemma":0.003443891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00396355,"about_ca_topic_score_gemma":0.005342407,"domain_scores_codex":[0.9979129,0.001448048,0.00006657226,0.0000977781,0.0004106198,0.00006389687],"domain_scores_gemma":[0.9978975,0.001560322,0.0001906877,0.00009963036,0.0001504945,0.0001013228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002311429,0.00008048482,0.0006776045,0.0003034652,0.0002293917,0.00006311424,0.00009789562,0.5801452,0.0003284089,0.3699946,0.004459512,0.04359714],"study_design_scores_gemma":[0.00002972383,0.00006041319,0.0002923842,0.0001662505,0.0000391926,0.00005306047,0.0001189336,0.6867349,0.0002144051,0.2964988,0.01577437,0.00001759404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006033993,0.01355901,0.9490845,0.007369836,0.0004976125,0.0001464833,0.000151769,0.0001492447,0.02300759],"genre_scores_gemma":[0.341785,0.01347324,0.6325351,0.001543198,0.0007762806,0.0007013456,0.0001919224,0.0001367387,0.008857114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00396355,"threshold_uncertainty_score":0.01682425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1549649786","doi":"","title":"A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Interior point method; Algorithm; Newton's method in optimization; Complementarity (molecular biology); Centrality; Computer science; Kernel (algebra); Function (biology); Linear complementarity problem; Point (geometry); Mathematical optimization; Mathematics; Nonlinear system; Iterative method; Local convergence; Discrete mathematics; Combinatorics; Geometry","authors":[{"name":"Behrouz Kheirfam","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1803284949878697,"gpt":0.4503554120542215,"spread":0.2700269170663518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457554,0.0009038312,0.001088751,0.0006091017,0.0005731439,0.0006979719,0.001486882,0.001188868,0.00403185],"category_scores_gemma":[0.002664928,0.0004917903,0.0008882065,0.0007841397,0.0007837091,0.001453247,0.001896395,0.001948534,0.00121558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006567708,"about_ca_system_score_gemma":0.001894771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002202836,"about_ca_topic_score_gemma":0.001762982,"domain_scores_codex":[0.9994306,0.0001744726,0.00003202173,0.00007678165,0.0002342,0.00005183028],"domain_scores_gemma":[0.9992981,0.0003555627,0.00006297686,0.00008179477,0.0001520457,0.00004948365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000173391,0.0001615266,0.0004607479,0.0003251332,0.00005455286,0.0002148954,0.0001798427,0.7187539,0.008309719,0.09556373,0.003375245,0.1724274],"study_design_scores_gemma":[0.00001664965,0.00001927406,0.00004518966,0.000007839286,0.00000388757,0.00004162761,0.000005755047,0.989626,0.0007905568,0.008066853,0.001368501,0.000007996769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00135661,0.00004523488,0.9977558,0.00002983403,0.00001011784,0.00002004778,0.000009474353,0.00009618364,0.0006767449],"genre_scores_gemma":[0.07330146,0.0001444543,0.9234514,0.00005899242,0.00002680858,0.0002570893,0.0001282166,0.0001793787,0.002452257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00403185,"threshold_uncertainty_score":0.01348782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1536437679","doi":"","title":"Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Fraser Health; Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Image segmentation; Computer vision; Toolbox; Market segmentation; Image (mathematics); Noise reduction; Medical imaging; Pattern recognition (psychology); Scale-space segmentation; Markov random field","authors":[{"name":"Youssef Qranfal","is_ca":true},{"name":"Dorit S. Hochbaum","is_ca":false},{"name":"Germain Tanoh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08648639396389575,"gpt":0.4188762014867848,"spread":0.332389807522889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004255401,0.0009842133,0.001152889,0.002158175,0.0008650499,0.001048334,0.0009000127,0.001440262,0.003454016],"category_scores_gemma":[0.02477936,0.0004407915,0.000538112,0.00187635,0.0008451657,0.0009336384,0.00062132,0.0005767071,0.0009403456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008833279,"about_ca_system_score_gemma":0.0006670951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005670578,"about_ca_topic_score_gemma":0.004882968,"domain_scores_codex":[0.9971545,0.001052401,0.0002437549,0.0004443102,0.000913561,0.0001914451],"domain_scores_gemma":[0.9847217,0.01025377,0.0006386923,0.001648888,0.002462398,0.0002744716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005035137,0.001233577,0.004920724,0.002370834,0.0003780783,0.0006156833,0.001089262,0.2389428,0.2470457,0.003985171,0.007820622,0.4865624],"study_design_scores_gemma":[0.000210825,0.001932287,0.01320377,0.0001317799,0.0001893326,0.001142184,0.0003650039,0.805132,0.1681779,0.00326822,0.00612401,0.0001227246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5543638,0.003723556,0.4239224,0.0008762754,0.0003635843,0.0006054589,0.001762587,0.005478036,0.008904271],"genre_scores_gemma":[0.6304034,0.001007634,0.360326,0.0001719117,0.00007073958,0.0003061156,0.002672095,0.001223162,0.003818903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005670578,"threshold_uncertainty_score":0.02250499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1498489264","doi":"","title":"Complementarity Problems And Positive Definite Matrices","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Positive-definite matrix; Complementarity (molecular biology); Mathematics; Semidefinite programming; Linear complementarity problem; Semidefinite embedding; Complementarity theory; Matrix (chemical analysis); Regular polygon; Combinatorics; Applied mathematics; Mathematical optimization; Quadratically constrained quadratic program; Nonlinear system; Eigenvalues and eigenvectors","authors":[{"name":"P. Bhimashankaram","is_ca":false},{"name":"T. Parthasarathy","is_ca":false},{"name":"A. L. N. Murthy","is_ca":false},{"name":"G. S. R. Murthy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3671744036549908,"gpt":0.4818244199868566,"spread":0.1146500163318658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155602,0.000945193,0.0006360824,0.0009787529,0.0008106588,0.001824046,0.0005621816,0.001014019,0.006766709],"category_scores_gemma":[0.003744622,0.0003147412,0.0006641824,0.001367808,0.003104581,0.002269802,0.001338261,0.002127622,0.001206168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008007902,"about_ca_system_score_gemma":0.0008182302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164395,"about_ca_topic_score_gemma":0.0008781571,"domain_scores_codex":[0.9985655,0.0004945075,0.00006438141,0.0002909056,0.0004707602,0.0001139725],"domain_scores_gemma":[0.9985026,0.0008621435,0.0001920253,0.0001042239,0.0002791043,0.00005990766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001905764,0.00002280505,0.0001594607,0.0001353248,0.00001762709,0.0001650948,0.0001451477,0.01940057,0.00150051,0.9535605,0.003334156,0.02153968],"study_design_scores_gemma":[0.00001059855,0.0000350037,0.0001787208,0.00002959347,0.000006850415,0.0002324563,0.00008858305,0.07128516,0.0008812665,0.9132652,0.01396707,0.00001953881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01726373,0.002392964,0.9338268,0.001207554,0.0001994321,0.00007278574,0.0002403249,0.0001029962,0.04469334],"genre_scores_gemma":[0.674839,0.006843552,0.283566,0.001166554,0.001111473,0.0005194927,0.0008527626,0.0001596089,0.03094173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006766709,"threshold_uncertainty_score":0.02263689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1506248691","doi":"","title":"A Network Flow Model for Irrigation Water Management","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Water resources management and optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Prosperity; Computer science; Irrigation; Flow network; Water flow; Mathematical optimization; Operations research; Water resource management; Environmental science; Environmental engineering; Mathematics; Economics; Ecology","authors":[{"name":"A. L. N. Murthy","is_ca":false},{"name":"G. S. R. Murthy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05487309776333665,"gpt":0.2986850760117749,"spread":0.2438119782484383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008815915,0.001114095,0.000849535,0.0009177536,0.0009814061,0.001833918,0.002208464,0.002626012,0.01416226],"category_scores_gemma":[0.002163369,0.0005824754,0.0009482928,0.002159551,0.0008404311,0.003249137,0.0009546768,0.001830091,0.001301433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003271435,"about_ca_system_score_gemma":0.00224045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02474938,"about_ca_topic_score_gemma":0.01821371,"domain_scores_codex":[0.9995554,0.000170165,0.00001959457,0.00008648614,0.0001034474,0.00006501005],"domain_scores_gemma":[0.9995499,0.0002549647,0.00004983819,0.0000197602,0.0000923051,0.00003313386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001344403,0.00002370195,0.0001259264,0.00002323436,0.00000760982,0.00003752853,0.00002538489,0.9112051,0.0001955157,0.08142748,0.001885635,0.005029458],"study_design_scores_gemma":[0.000005908732,0.000008225633,0.00003613202,0.000005291449,0.000003235128,0.000008745557,0.000006740362,0.9793913,0.00003430892,0.01732067,0.003174294,0.000005119344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007618431,0.0006432934,0.9599329,0.001426997,0.0001974988,0.0001188565,0.001006354,0.0003435207,0.0287122],"genre_scores_gemma":[0.6215983,0.004574581,0.260181,0.0005388991,0.000431018,0.001357894,0.002195761,0.0003826868,0.1087399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02474938,"threshold_uncertainty_score":0.04921061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517789689","doi":"","title":"On Packing Rectangles with Resource Augmentation: Maximizing the Profit","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Unit square; Combinatorics; Packing problems; Mathematics; Profit (economics); Bounded function; Square (algebra); Mathematical optimization; Microeconomics; Economics; Geometry","authors":[{"name":"Aleksei V. Fishkin","is_ca":false},{"name":"Olga Gerber","is_ca":false},{"name":"Klaus Jansen","is_ca":false},{"name":"Roberto Solis-Oba","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07067051632240474,"gpt":0.3019838953193751,"spread":0.2313133789969704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441543,0.001454166,0.001698207,0.0006069604,0.0006466364,0.001576948,0.00131627,0.001222807,0.003036723],"category_scores_gemma":[0.004659206,0.0005965473,0.0006334124,0.001736634,0.001545307,0.003395407,0.001806494,0.0007855035,0.0007375277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121342,"about_ca_system_score_gemma":0.0009653598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001697156,"about_ca_topic_score_gemma":0.0009504786,"domain_scores_codex":[0.9988779,0.0004763098,0.00004438389,0.0001967414,0.0001785768,0.0002259495],"domain_scores_gemma":[0.9984666,0.0009999105,0.0001501209,0.0001837743,0.0001020974,0.00009755416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004929939,0.0001236944,0.0006914447,0.0002210933,0.00004358324,0.0002545498,0.0001281005,0.8744488,0.005669803,0.04805814,0.003624532,0.06624334],"study_design_scores_gemma":[0.00003640077,0.0001196975,0.0001792862,0.000020705,0.00001799588,0.0001191662,0.0000514826,0.9578134,0.002242551,0.03768174,0.001700811,0.00001678153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1023276,0.001772972,0.8811592,0.0009848163,0.0001241584,0.0001625472,0.0002069546,0.0005519885,0.01270986],"genre_scores_gemma":[0.6565776,0.001825202,0.3348601,0.0002222433,0.000177614,0.0002841692,0.0003000709,0.0002112863,0.005541672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003036723,"threshold_uncertainty_score":0.0101589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1501033600","doi":"","title":"Some Structural Properties of a Least Central Subtree of a Tree","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Cardinality (data modeling); Tree (set theory); Mathematics; Graph; Set (abstract data type); Discrete mathematics; Computer science; Data mining","authors":[{"name":"Martti Hamina","is_ca":false},{"name":"Matti Peltola","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05119654889255751,"gpt":0.3449830083518981,"spread":0.2937864594593406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956401,0.000225683,0.0005984502,0.001220226,0.001587332,0.001962018,0.0007688844,0.0008915395,0.003228245],"category_scores_gemma":[0.004373435,0.0004257758,0.0006004031,0.001474159,0.002409881,0.002887313,0.001362299,0.001117465,0.0004956477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008715205,"about_ca_system_score_gemma":0.0006048889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007369097,"about_ca_topic_score_gemma":0.0009849289,"domain_scores_codex":[0.9994352,0.0001229419,0.00003651637,0.0001447533,0.0001670088,0.0000935486],"domain_scores_gemma":[0.9964404,0.001697385,0.0006596675,0.0003328862,0.0003956403,0.0004741213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001945878,0.00009529523,0.004203733,0.0002231113,0.00002349424,0.0007435664,0.001716229,0.01069099,0.02246163,0.9322811,0.002133544,0.02523263],"study_design_scores_gemma":[0.00006100098,0.0001479376,0.002825652,0.00005403459,0.00003765548,0.001050794,0.001034932,0.05367484,0.008498638,0.922882,0.009695185,0.00003732345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7539953,0.0008675192,0.2240847,0.0008591139,0.00004332432,0.00008138416,0.0004461843,0.0002018325,0.01942064],"genre_scores_gemma":[0.9108489,0.0004063671,0.08331102,0.0001254531,0.0001245117,0.00008270908,0.000775903,0.0001457566,0.004179279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003228245,"threshold_uncertainty_score":0.01079959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1629073290","doi":"","title":"A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Integer (computer science); Mathematical optimization; Integer programming; Trim; Stochastic programming; Nonlinear system; Nonlinear programming; Class (philosophy); Exploit; Branch and price; Mathematics; Computer science; Artificial intelligence","authors":[{"name":"Maria Elena Bruni","is_ca":false},{"name":"Patrizia Beraldi","is_ca":false},{"name":"Domenico Conforti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07428170403181933,"gpt":0.3544697612289102,"spread":0.2801880571970908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211714,0.0009864212,0.0008081983,0.0005881643,0.0005186432,0.0008693707,0.001222101,0.001261449,0.005326811],"category_scores_gemma":[0.001790366,0.0005580742,0.0009962446,0.0006968825,0.0007021149,0.0009324668,0.001901638,0.00176984,0.0006072292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007202472,"about_ca_system_score_gemma":0.00150622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446167,"about_ca_topic_score_gemma":0.001908939,"domain_scores_codex":[0.9995209,0.0001753417,0.0000193503,0.00007146209,0.000164696,0.00004838199],"domain_scores_gemma":[0.9996156,0.0002175321,0.00003670358,0.00002851312,0.00007280018,0.00002889912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003614898,0.00006163198,0.0001711787,0.0001089836,0.00003576206,0.00007558571,0.00008188054,0.8210506,0.002455222,0.1270677,0.001419174,0.0474362],"study_design_scores_gemma":[0.00001337365,0.00002892785,0.00002230688,0.00000824413,0.000004602859,0.00001347247,0.000007846233,0.9754191,0.0003604823,0.02223057,0.00188667,0.0000044696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001085252,0.00004458106,0.9972415,0.00006317638,0.00001434035,0.00002342264,0.00001125132,0.00003507306,0.001481432],"genre_scores_gemma":[0.09213296,0.000224032,0.9023495,0.0001109857,0.00006736123,0.0003865424,0.00008623861,0.00009083049,0.00455153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005326811,"threshold_uncertainty_score":0.01781994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1529269817","doi":"","title":"Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms forMulti-objective Network Partitioning","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Tabu search; Simulated annealing; Mathematical optimization; Heuristics; Computer science; Metaheuristic; Evolutionary algorithm; Set (abstract data type); Pareto principle; Multi-objective optimization; Algorithm; Mathematics","authors":[{"name":"C. Gil","is_ca":false},{"name":"Raúl Baños","is_ca":false},{"name":"Julio Gómez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02842249801593428,"gpt":0.3213298862748583,"spread":0.292907388258924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004065411,0.001516894,0.001764939,0.002165052,0.000927956,0.00176802,0.001488339,0.002252743,0.002072896],"category_scores_gemma":[0.01435988,0.0004813494,0.001026046,0.002897493,0.0007350809,0.001906057,0.0007795863,0.0008813617,0.0003348192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001905593,"about_ca_system_score_gemma":0.001397722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007835726,"about_ca_topic_score_gemma":0.005407882,"domain_scores_codex":[0.996151,0.002200761,0.0001833109,0.0002312805,0.0009552278,0.0002784932],"domain_scores_gemma":[0.9893121,0.008288579,0.0005175281,0.0007370352,0.00100104,0.0001437107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005302889,0.0002024923,0.001593835,0.0002878674,0.0001954459,0.00003999212,0.0001022608,0.9157763,0.001968005,0.004594306,0.0009742317,0.07373493],"study_design_scores_gemma":[0.00003845589,0.0002668948,0.0009826113,0.00002077509,0.00004267938,0.00003806877,0.00004791114,0.9938552,0.002382689,0.001566292,0.000743361,0.00001513333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7038182,0.01568528,0.246626,0.001110786,0.0004532531,0.0003145694,0.0004748539,0.002551242,0.02896579],"genre_scores_gemma":[0.8904487,0.00173956,0.1049978,0.0001098545,0.00004460179,0.0001335949,0.0004043377,0.0002289319,0.001892509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007835726,"threshold_uncertainty_score":0.02150017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561159387","doi":"","title":"Mean-Absolute Deviation Portfolio Models with Discrete Choice Constraints","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Portfolio; Variance (accounting); Mathematical optimization; Absolute deviation; Solver; Linear programming; Heuristic; Set (abstract data type); Portfolio optimization; Mathematics; Integer programming; Computer science; Statistics; Economics; Finance","authors":[{"name":"Roy H. Kwon","is_ca":true},{"name":"Stephen J. Stoyan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3088138248982664,"gpt":0.4443298865650969,"spread":0.1355160616668305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005659154,0.001658818,0.0026783,0.0008480537,0.0005186932,0.00370246,0.003641268,0.003170596,0.005467351],"category_scores_gemma":[0.01189943,0.001178386,0.0013503,0.001823599,0.001541961,0.003843245,0.001793597,0.003468927,0.0006527257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723074,"about_ca_system_score_gemma":0.001443329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002781348,"about_ca_topic_score_gemma":0.002697514,"domain_scores_codex":[0.9961562,0.002099808,0.000150535,0.0006747303,0.0005805027,0.0003382842],"domain_scores_gemma":[0.993573,0.004864221,0.0007204353,0.0002913697,0.0003320641,0.0002188863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006504612,0.00007545416,0.0004724907,0.00007003958,0.0000873664,0.0001399729,0.00003026223,0.7678441,0.0001713797,0.2201628,0.00118685,0.009694229],"study_design_scores_gemma":[0.00003198523,0.00003160156,0.0001005744,0.00001118649,0.00001646942,0.00003397143,0.000008369268,0.897245,0.0001013,0.1014959,0.0009104227,0.00001329696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02629485,0.00123803,0.9604247,0.001619058,0.0001585769,0.00007488237,0.0003431124,0.0001442134,0.009702581],"genre_scores_gemma":[0.8240775,0.001561345,0.1518249,0.000545401,0.0003806184,0.000374936,0.0005384876,0.00008488874,0.02061208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005659154,"threshold_uncertainty_score":0.0299288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1566305412","doi":"","title":"Minimum Cost Flow Problem on Dynamic Multi Generative Network flows","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Minimum-cost flow problem; Flow network; Multi-commodity flow problem; Mathematical optimization; Computer science; Computation; Flow (mathematics); Time horizon; Mathematics; Algorithm","authors":[{"name":"Ahmad Hosseini","is_ca":false},{"name":"H. Salehi Fathabadi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04003761077161055,"gpt":0.337510223600903,"spread":0.2974726128292925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446611,0.0008425094,0.001009874,0.0009456498,0.0005567346,0.00147573,0.001349657,0.001398417,0.003094688],"category_scores_gemma":[0.003969138,0.0006731696,0.0009083369,0.001381434,0.001294346,0.003183211,0.001043687,0.001240963,0.0002156548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371136,"about_ca_system_score_gemma":0.00122365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003550019,"about_ca_topic_score_gemma":0.002365419,"domain_scores_codex":[0.9990739,0.0003986086,0.00003315758,0.0002122981,0.0001466329,0.0001354646],"domain_scores_gemma":[0.998693,0.0008898341,0.0001370134,0.00009793278,0.0001101651,0.00007204128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003849352,0.00003120632,0.0002015172,0.00003656985,0.00001046212,0.00007383636,0.00003094917,0.9018918,0.0004179299,0.09059252,0.0005825402,0.006092166],"study_design_scores_gemma":[0.000007811542,0.00001172884,0.00006744314,0.000004242519,0.000004166195,0.00001966381,0.00001381244,0.9606242,0.0002279052,0.03852693,0.000488155,0.000003951424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05349524,0.0001700752,0.9400504,0.0003335718,0.00002452791,0.00006749317,0.0001817376,0.00009026899,0.005586687],"genre_scores_gemma":[0.7942092,0.0004918152,0.1953418,0.0001035008,0.00006836534,0.000251874,0.0005428676,0.0001254488,0.008865089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003550019,"threshold_uncertainty_score":0.01720387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126636640","doi":"","title":"O(m) Bound on Number of Iterations in Sphere Methods for LP","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematical proof; Mathematics; Matrix (chemical analysis); Subject (documents); Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Geometry","authors":[{"name":"Katta G. Murty","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2659736424241235,"gpt":0.6091308202330554,"spread":0.343157177808932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005965741,0.003942181,0.001865173,0.00130621,0.001287678,0.002282744,0.00345061,0.002172956,0.01997217],"category_scores_gemma":[0.03310693,0.0008912121,0.002132534,0.001344554,0.003787927,0.007380294,0.005499734,0.007936106,0.005221235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924363,"about_ca_system_score_gemma":0.00187163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002514007,"about_ca_topic_score_gemma":0.004725233,"domain_scores_codex":[0.9938077,0.002814298,0.0002661388,0.0006937425,0.001785587,0.0006325534],"domain_scores_gemma":[0.969749,0.02386615,0.0008938103,0.003217507,0.00159501,0.0006785917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00324501,0.0007123397,0.004426922,0.001955075,0.0003794686,0.0007794533,0.001012558,0.2015085,0.01426203,0.4083744,0.05882348,0.3045208],"study_design_scores_gemma":[0.0001895921,0.000379291,0.0008814479,0.0002053931,0.00008149257,0.0002320124,0.0001682908,0.7331421,0.005120246,0.2443684,0.01517413,0.00005765692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02227801,0.003576931,0.9118645,0.004080805,0.0007610571,0.0003129536,0.0005062383,0.002498247,0.05412123],"genre_scores_gemma":[0.2570343,0.002741381,0.7041225,0.002092306,0.00113183,0.001288947,0.001329017,0.002945501,0.02731417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01997217,"threshold_uncertainty_score":0.06681359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526859640","doi":"","title":"K 3,3 Minors and the Maximum-Flow Problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Minor (academic); Combinatorics; Mathematics; Planar graph; Graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Graph minor; Flow (mathematics); Discrete mathematics; Planar; Computer science; Chordal graph; Line graph; Geometry; Voltage graph; Artificial intelligence","authors":[{"name":"Donald K. Wagner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05306217073047875,"gpt":0.341977265077557,"spread":0.2889150943470783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818357,0.0007291944,0.0006048491,0.0005802941,0.0009323393,0.001287417,0.0009344087,0.0008088578,0.003672163],"category_scores_gemma":[0.002330918,0.0006161518,0.0009311927,0.0006864085,0.001052103,0.003521733,0.001508426,0.00116008,0.0005692643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008000634,"about_ca_system_score_gemma":0.0007232116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002364322,"about_ca_topic_score_gemma":0.002232867,"domain_scores_codex":[0.9995508,0.000118649,0.00002785654,0.0001169741,0.00006807598,0.0001176777],"domain_scores_gemma":[0.9986064,0.0006052785,0.000289403,0.0001849514,0.0001017636,0.0002121864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00192531,0.0008149045,0.0077815,0.0007839697,0.0001786147,0.001116319,0.001411291,0.1341136,0.03280751,0.6177224,0.02898094,0.1723637],"study_design_scores_gemma":[0.0001543014,0.0001962537,0.002839854,0.00005856151,0.00005845143,0.001023053,0.00045952,0.1536043,0.006209079,0.8169916,0.018359,0.00004603578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6220156,0.001272553,0.3454548,0.002803018,0.0001265248,0.0002591783,0.001246168,0.0009000208,0.02592215],"genre_scores_gemma":[0.8373032,0.0007864425,0.1482828,0.0003913785,0.0001560552,0.0001873011,0.002377524,0.0002299335,0.01028551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003672163,"threshold_uncertainty_score":0.01228458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W167710240","doi":"","title":"The alpha-reliable shortest path problem.","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Alpha (finance); Path (computing); Shortest path problem; Mathematics; Combinatorics; Computer science; Statistics; Graph; Computer network","authors":[{"name":"Francesca Guerriero","is_ca":false},{"name":"Patrizia Beraldi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04682918372997396,"gpt":0.343110913445022,"spread":0.296281729715048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002819333,0.001155988,0.001439745,0.001392068,0.001160259,0.002163233,0.002181857,0.00211551,0.01000758],"category_scores_gemma":[0.02450563,0.0006024474,0.0006623662,0.00243638,0.001493103,0.005800354,0.001947083,0.002340639,0.002252286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020774,"about_ca_system_score_gemma":0.001601691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369346,"about_ca_topic_score_gemma":0.001306828,"domain_scores_codex":[0.9980907,0.0007202361,0.0001202888,0.0003708809,0.0004585479,0.0002393763],"domain_scores_gemma":[0.9878756,0.007910853,0.001166678,0.00133786,0.001102012,0.0006069677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001113386,0.0001725502,0.002012313,0.0009964667,0.0002201353,0.0003390013,0.0002857308,0.3067864,0.001501148,0.3872354,0.07093908,0.2283984],"study_design_scores_gemma":[0.00008676693,0.0001086402,0.0005074712,0.0000932341,0.00005049418,0.0002642317,0.0001231413,0.2636625,0.0008763755,0.7211393,0.0130681,0.0000197077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09476851,0.006908071,0.8331184,0.007775564,0.001156523,0.0002882838,0.00468348,0.0009111998,0.05038994],"genre_scores_gemma":[0.7302957,0.005776505,0.231914,0.0005438937,0.001259053,0.0004494076,0.003995752,0.0003929497,0.0253728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01000758,"threshold_uncertainty_score":0.03347874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3033253995","doi":"","title":"Rezension zu: Schliesky, Utz, Souveränität und Legitimität von Herrschaftsgewalt: Die Weiterentwicklung von Begriffen der Staatslehre und des Staatsrechts im europäischen Mehrebenensystem, Tübingen (Mohr Siebeck) 2004, 815 S.","year":2005,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Philosophy","authors":[{"name":"Stephan Kirste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09449557842601454,"gpt":0.4170837451319026,"spread":0.322588166705888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001944122,0.001069993,0.0008196064,0.002470126,0.002677479,0.006841694,0.001051019,0.004889743,0.0182869],"category_scores_gemma":[0.005563073,0.0004979489,0.000624381,0.004137684,0.006489213,0.0154618,0.002860314,0.005592024,0.003260937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007818256,"about_ca_system_score_gemma":0.005207189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02034501,"about_ca_topic_score_gemma":0.03769365,"domain_scores_codex":[0.9991127,0.0002653837,0.00006648634,0.0001995008,0.0002557567,0.0001002649],"domain_scores_gemma":[0.998669,0.0008426317,0.0001429999,0.00007718623,0.0002098712,0.00005831181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004665801,0.00002228043,0.000445254,0.000324164,0.00003270186,0.00007833332,0.001938821,0.0005388904,0.0001675728,0.6132542,0.3493704,0.03378062],"study_design_scores_gemma":[0.0000282905,0.00001146943,0.001917349,0.0007200523,0.00004395622,0.0001145622,0.001143623,0.000881141,0.0006162482,0.6268418,0.3676334,0.00004821734],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01035032,0.4376246,0.01662965,0.4354078,0.005945986,0.00005780055,0.001530844,0.0002083506,0.09224465],"genre_scores_gemma":[0.3630183,0.3248759,0.01986063,0.05122387,0.01205041,0.0003760072,0.001182,0.0006285788,0.2267843],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.02034501,"threshold_uncertainty_score":0.06117582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096143056","doi":"","title":"Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks","year":2007,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Decomposition; Computer science; Group (periodic table); Mathematics; Mathematical optimization; Theoretical computer science; Algorithm; Chemistry","authors":[{"name":"Salim Haddadi","is_ca":false},{"name":"Omar Slimani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3875462872364164,"gpt":0.5302215977139096,"spread":0.1426753104774933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005879062,0.001769688,0.001592366,0.002592508,0.0008454533,0.002345241,0.004518505,0.003117728,0.005159358],"category_scores_gemma":[0.01408757,0.001122291,0.001893695,0.003943769,0.001280683,0.003127485,0.002499669,0.003417643,0.0009813028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002470723,"about_ca_system_score_gemma":0.002225862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003114139,"about_ca_topic_score_gemma":0.004611916,"domain_scores_codex":[0.994902,0.00324114,0.0002216107,0.0004404431,0.0007923494,0.0004023671],"domain_scores_gemma":[0.9920516,0.004976322,0.0005145299,0.001080198,0.0009343261,0.0004429915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008119335,0.001033957,0.001116546,0.0004736933,0.0002884514,0.0001259114,0.0004742348,0.6006574,0.003808181,0.08653578,0.008527041,0.296147],"study_design_scores_gemma":[0.0001487309,0.0001210909,0.000180397,0.00002622651,0.00003016157,0.00006080952,0.00005111356,0.9709259,0.0007004886,0.02586226,0.001872495,0.00002041562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02235113,0.0005376508,0.9706124,0.000514648,0.0001068285,0.0002897962,0.0001453173,0.0003832331,0.005059051],"genre_scores_gemma":[0.1310782,0.0003578911,0.8643873,0.0002764976,0.00006957851,0.000662807,0.0003602474,0.000128977,0.002678533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005879062,"threshold_uncertainty_score":0.03109181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488163438","doi":"","title":"Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Multileaf collimator; Integer matrix; Context (archaeology); Mathematical optimization; Binary number; Decomposition method (queueing theory); Algorithm; Discrete mathematics; Beam (structure); Symmetric matrix; Nonnegative matrix","authors":[{"name":"Antje Kiesel","is_ca":false},{"name":"Céline Engelbeen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03833592896667294,"gpt":0.3791121652766149,"spread":0.340776236309942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000578916,0.000644495,0.0004189171,0.0005113385,0.0004112749,0.0007941792,0.0004228532,0.0005045374,0.004110792],"category_scores_gemma":[0.002136557,0.0003216521,0.0004750997,0.000809029,0.0006620974,0.001189269,0.0006917709,0.0008139535,0.0006789749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008931682,"about_ca_system_score_gemma":0.0008561005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002083011,"about_ca_topic_score_gemma":0.003956773,"domain_scores_codex":[0.9995953,0.0001445632,0.00001603067,0.00006604897,0.0001209952,0.00005702717],"domain_scores_gemma":[0.99929,0.0003958588,0.0001042412,0.00009993822,0.00005977147,0.0000501804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003654015,0.0001274619,0.0007324754,0.0003710604,0.00004343506,0.0001744043,0.0002598253,0.5462837,0.02802623,0.222008,0.005675228,0.1959328],"study_design_scores_gemma":[0.00004304835,0.000146318,0.000418728,0.00002707398,0.00002210553,0.0001105771,0.0000816936,0.8333762,0.006903273,0.1534664,0.005383588,0.00002100323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04687306,0.0002956346,0.946914,0.0002768775,0.00003013497,0.00009292491,0.0001411508,0.0001729103,0.005203329],"genre_scores_gemma":[0.4032927,0.0005102095,0.5876322,0.0001246669,0.00007012796,0.0001712569,0.0004617969,0.0001547159,0.007582224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004110792,"threshold_uncertainty_score":0.01375192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127378345","doi":"","title":"Reductions for the stable set problem","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Independent set; Clique; Mathematics; Combinatorics; Graph; Benchmark (surveying); Set (abstract data type); Reduction (mathematics); Clique problem; Discrete mathematics; Mathematical optimization; Computer science; Pathwidth; Line graph","authors":[{"name":"Edward C. Sewell","is_ca":false},{"name":"Sheldon H. Jacobson","is_ca":false},{"name":"Hemanshu Kaul","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2833151832057892,"gpt":0.394546714682085,"spread":0.1112315314762958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00197767,0.001731017,0.0010543,0.00170226,0.001924067,0.002491079,0.002973683,0.001557988,0.01261437],"category_scores_gemma":[0.005595366,0.0006548273,0.003683285,0.001754782,0.002254239,0.006389907,0.00451928,0.007197842,0.001862545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001792843,"about_ca_system_score_gemma":0.001872363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666724,"about_ca_topic_score_gemma":0.002618108,"domain_scores_codex":[0.9974247,0.0007574034,0.0001238838,0.0004167686,0.001004988,0.0002722497],"domain_scores_gemma":[0.9966665,0.002056407,0.0001486676,0.0006456285,0.0003544432,0.0001283669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001621155,0.0003508487,0.0004246258,0.0006062834,0.000108947,0.000195286,0.0004036465,0.07078501,0.005532112,0.7795721,0.03274576,0.1091132],"study_design_scores_gemma":[0.00004999231,0.00006439736,0.0002292327,0.00004511031,0.00004712747,0.0001537178,0.0001577321,0.08646647,0.00330107,0.886625,0.02283323,0.00002700891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02507486,0.0008501466,0.927381,0.002666528,0.0002996004,0.0004995905,0.0007878524,0.0008293038,0.04161118],"genre_scores_gemma":[0.2866775,0.002142265,0.6760905,0.001150623,0.0009497092,0.001533203,0.003964113,0.000975708,0.0265163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01261437,"threshold_uncertainty_score":0.04219925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1481493156","doi":"","title":"Optimization in 2 m 3 n Factorial Experiments","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Integer programming; Factorial experiment; Post hoc; Factorial; Design of experiments; Mathematical optimization; Orthogonal array; Theoretical computer science; Industrial engineering; Algorithm; Mathematics; Machine learning; Taguchi methods; Engineering; Statistics","authors":[{"name":"G. S. R. Murthy","is_ca":false},{"name":"D.K. Manna","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.5038899504498755,"gpt":0.6029256541613165,"spread":0.09903570371144099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02707644,0.001860965,0.003025192,0.001206196,0.0008054647,0.001865392,0.001826952,0.00153888,0.003038281],"category_scores_gemma":[0.04036488,0.001479337,0.002226301,0.001866889,0.00309465,0.00188651,0.001961894,0.001696116,0.0004400799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002804493,"about_ca_system_score_gemma":0.003645218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001850069,"about_ca_topic_score_gemma":0.00248416,"domain_scores_codex":[0.9595641,0.03424145,0.001095359,0.002756364,0.001735892,0.000606903],"domain_scores_gemma":[0.9535488,0.04115858,0.002463419,0.001710244,0.0008254633,0.000293573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001210488,0.0003713207,0.001579842,0.001616716,0.0004196404,0.0002024697,0.0002999397,0.6506925,0.004571182,0.2158107,0.001611354,0.121614],"study_design_scores_gemma":[0.0004475489,0.001559807,0.001245356,0.0001077085,0.0001079865,0.00006571824,0.00007946775,0.7689641,0.002990894,0.2193359,0.005022605,0.00007289151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0092253,0.0004112303,0.9877751,0.0001916202,0.00003198104,0.0003150551,0.00006624944,0.0001129056,0.001870542],"genre_scores_gemma":[0.1470989,0.0004835716,0.8477787,0.0002223629,0.00006403502,0.00255719,0.0001162196,0.00006402567,0.001614906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02707644,"threshold_uncertainty_score":0.1431956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563143451","doi":"","title":"The α-reliable shortest path problem","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Shortest path problem; Mathematical optimization; Computer science; Path (computing); Heuristic; Knapsack problem; Set (abstract data type); Integer programming; A priori and a posteriori; Constrained Shortest Path First; Longest path problem; Mathematics; K shortest path routing; Theoretical computer science","authors":[{"name":"Francesca Guerriero","is_ca":false},{"name":"Patrizia Beraldi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08721923934476747,"gpt":0.3182600762586555,"spread":0.231040836913888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068269,0.001446907,0.001396433,0.0009550092,0.0007416843,0.001429164,0.001533518,0.001796684,0.005116199],"category_scores_gemma":[0.008016433,0.0005471645,0.00070909,0.001774139,0.001039892,0.002349988,0.001103095,0.001234122,0.0007944411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008410292,"about_ca_system_score_gemma":0.001237726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754999,"about_ca_topic_score_gemma":0.0009835385,"domain_scores_codex":[0.9981913,0.0007744547,0.0001167035,0.0003838193,0.0003326304,0.00020106],"domain_scores_gemma":[0.9966469,0.002169885,0.0005367103,0.0001947237,0.0002750237,0.0001767093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001475356,0.00005686295,0.0005034046,0.0003525141,0.0000643992,0.0002551492,0.0001196394,0.8982842,0.001142678,0.05300562,0.003907198,0.04216073],"study_design_scores_gemma":[0.00007302197,0.0001687048,0.0004189012,0.00005789496,0.00003692282,0.0003759925,0.0001546624,0.8399058,0.0009443453,0.1486382,0.009193487,0.00003204302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06722223,0.00168386,0.9110356,0.001440207,0.000152701,0.00033214,0.001263569,0.0003999125,0.01646977],"genre_scores_gemma":[0.7298191,0.003100581,0.2535618,0.0002255224,0.0002870291,0.0006457614,0.001670715,0.0002310042,0.01045849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005116199,"threshold_uncertainty_score":0.01711535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1482466102","doi":"","title":"Probabilistic optimization in graph-problems","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Probabilistic logic; Null graph; Voltage graph; Graph; Mathematics; Graph property; Vertex (graph theory); Computation; Regular graph; Combinatorics; Mathematical optimization; Discrete mathematics; Line graph; Algorithm","authors":[{"name":"Cécile Murat","is_ca":false},{"name":"Vangélis Th. Paschos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05702908760854954,"gpt":0.344652739817995,"spread":0.2876236522094455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004173259,0.001713564,0.001611475,0.001305987,0.001044753,0.00360248,0.002236512,0.00253693,0.004846787],"category_scores_gemma":[0.0161674,0.0008338113,0.002176214,0.002741942,0.004026406,0.00859537,0.002789491,0.00500815,0.0007155914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003860229,"about_ca_system_score_gemma":0.001596115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002487544,"about_ca_topic_score_gemma":0.002248417,"domain_scores_codex":[0.9955673,0.002240198,0.0001785043,0.000794271,0.0008147972,0.0004050133],"domain_scores_gemma":[0.9846069,0.01313944,0.0008436168,0.0007506415,0.0003851943,0.0002743271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003896734,0.00005767562,0.0003176069,0.0002095036,0.00005007898,0.00006950947,0.00009881049,0.1769171,0.0003575416,0.8117218,0.001951747,0.008209635],"study_design_scores_gemma":[0.00001795954,0.00002970106,0.0001218517,0.00001983739,0.0000135879,0.00004091833,0.00002690052,0.3328107,0.0001877555,0.6641139,0.00260586,0.00001107792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01511493,0.001594737,0.9716015,0.002293832,0.0000814505,0.00008299996,0.0002419353,0.0001857379,0.008802903],"genre_scores_gemma":[0.6516582,0.00445505,0.3276315,0.00115796,0.0009476417,0.0006425577,0.0009177805,0.0003195331,0.01226977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004846787,"threshold_uncertainty_score":0.0280081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158930128","doi":"","title":"Probabilistic Model and Solution Algorithm for the Electricity Retailers in the Italian Market","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Bidding; Simulated annealing; Electricity market; Computer science; Probabilistic logic; Electricity; Mathematical optimization; Portfolio; Algorithm; Economics; Mathematics; Artificial intelligence; Microeconomics; Finance; Engineering","authors":[{"name":"Chefi Triki","is_ca":false},{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Roberto Musmanno","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0691444894806862,"gpt":0.297606831795214,"spread":0.2284623423145278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094187,0.0008159303,0.001163021,0.0007559734,0.0006524231,0.001132353,0.001531033,0.001601907,0.005056133],"category_scores_gemma":[0.00297657,0.0006036326,0.001087285,0.00098845,0.0007085413,0.001094944,0.001222505,0.001285856,0.0005581782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001602565,"about_ca_system_score_gemma":0.002197102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01369792,"about_ca_topic_score_gemma":0.01110426,"domain_scores_codex":[0.9995127,0.0002012584,0.00001945183,0.0000922077,0.0001013109,0.00007312185],"domain_scores_gemma":[0.9992242,0.0005402485,0.00007640017,0.00003292273,0.00009395456,0.00003230021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001495485,0.000009778732,0.0001411252,0.00001700237,0.000008837602,0.0000168096,0.00001950045,0.9847506,0.00009801071,0.00983476,0.0002978508,0.004790799],"study_design_scores_gemma":[0.000004483933,0.000004248827,0.00002846439,0.000001650165,0.000001884047,0.000004350971,0.000003932056,0.9964,0.00003059517,0.003332556,0.0001861504,0.000001620009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01781211,0.0001843011,0.9772974,0.0003718271,0.00002514545,0.00006236613,0.000134323,0.0001995488,0.003912855],"genre_scores_gemma":[0.5548999,0.0004833162,0.4314058,0.0001992362,0.00007519659,0.0007460113,0.0006185583,0.0001684736,0.01140361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01369792,"threshold_uncertainty_score":0.0272364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1651694003","doi":"","title":"Santosh Narayan Kabadi 1956-2010","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Social and Economic Development in India","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Psychology","authors":[{"name":"R. Chandrasekaran","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1017055954195236,"gpt":0.4393494547887703,"spread":0.3376438593692467,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146222,0.0009484328,0.0007073221,0.002013639,0.00223483,0.002775885,0.001054115,0.001346406,0.04319485],"category_scores_gemma":[0.005506574,0.0004006361,0.0005122633,0.002447522,0.002073997,0.00226724,0.002788829,0.002601414,0.01673162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006733275,"about_ca_system_score_gemma":0.005644742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008672058,"about_ca_topic_score_gemma":0.01495866,"domain_scores_codex":[0.9988905,0.0001989716,0.00009980485,0.0003093322,0.0003927041,0.0001087852],"domain_scores_gemma":[0.997122,0.0007863251,0.0001494616,0.0004301378,0.001257851,0.0002542648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003837529,0.0001219717,0.00173608,0.0006753685,0.00007172529,0.0002984003,0.0007328025,0.004696278,0.001673838,0.3516423,0.3258822,0.3120854],"study_design_scores_gemma":[0.00001831786,0.00005543353,0.001354837,0.0001858884,0.00003031254,0.0001913799,0.0001176741,0.00136737,0.001409593,0.02383448,0.9714121,0.00002257053],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.032725,0.06260103,0.03133119,0.06082232,0.05678859,0.0003176029,0.00433929,0.0007054475,0.7503695],"genre_scores_gemma":[0.1898145,0.02931728,0.01373431,0.004228454,0.01327581,0.0001835464,0.001696579,0.0002742255,0.7474753],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04319485,"threshold_uncertainty_score":0.1445012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1823796094","doi":"","title":"Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"","keywords":"Software; Computer science; Radio frequency; Specific absorption rate; Algorithm; Pulse (music); Telecommunications","authors":[{"name":"Christopher Kumar Anand","is_ca":true},{"name":"Stephen J. Stoyan","is_ca":true},{"name":"Tamás Terlaky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2984122185525563,"gpt":0.4958848011205555,"spread":0.1974725825679992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004767641,0.001267493,0.001049022,0.00137322,0.0005160733,0.001221636,0.001799666,0.001996892,0.002199844],"category_scores_gemma":[0.01290084,0.0004953074,0.000722405,0.001256127,0.0006614578,0.001337138,0.001252334,0.001090215,0.0003900117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001600833,"about_ca_system_score_gemma":0.002292853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009741733,"about_ca_topic_score_gemma":0.007018958,"domain_scores_codex":[0.9983701,0.0006526495,0.00009203943,0.0001638249,0.0005957604,0.0001256348],"domain_scores_gemma":[0.9914836,0.006082255,0.0003488701,0.0003597152,0.001520666,0.0002047882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009052742,0.0003693824,0.001335332,0.0001961245,0.00009214334,0.00005313622,0.0001324122,0.7758657,0.002428522,0.01719205,0.00157904,0.1998508],"study_design_scores_gemma":[0.00004158743,0.0001136102,0.0001295656,0.00000505718,0.00001059702,0.00001551796,0.0000137921,0.9975822,0.0008276482,0.0008654514,0.0003879762,0.000007112009],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.112344,0.001003654,0.8758909,0.0004096865,0.0001442627,0.0002770154,0.00009674066,0.001302885,0.008530847],"genre_scores_gemma":[0.3492896,0.0003736127,0.6466944,0.0001444772,0.00005065883,0.0003258737,0.0002406475,0.0004881419,0.002392496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009741733,"threshold_uncertainty_score":0.02521402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031953439","doi":"","title":"Rezension zu: Uhlenbrock Henning, Der Staat als juristische Person: Dogmengeschichtliche Untersuchungen zu einem Grundbegriff der deutschen Staatsrechtslehre, Berlin Duncker & Humblot (Schriften zur Verfassungsgeschichte Band 61) 2000, 197 S.","year":2002,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities; Political science","authors":[{"name":"Stephan Kirste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1520224141106146,"gpt":0.3827758540505588,"spread":0.2307534399399442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002292952,0.001108,0.0007537852,0.002021529,0.003175755,0.006256891,0.001389523,0.006886125,0.02026104],"category_scores_gemma":[0.008089761,0.000579535,0.0004175555,0.004106429,0.004130614,0.01345294,0.002871265,0.007238001,0.003958183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005268348,"about_ca_system_score_gemma":0.004657824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03968772,"about_ca_topic_score_gemma":0.05872678,"domain_scores_codex":[0.9987582,0.0004368522,0.00008861173,0.0002299534,0.0003662626,0.000120132],"domain_scores_gemma":[0.9976767,0.001659983,0.0001446397,0.0000622265,0.0003548544,0.0001016582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002230739,0.00001451011,0.0001802066,0.000220578,0.00001096841,0.00004937124,0.001636648,0.00008443922,0.00004291366,0.1077751,0.8740774,0.01588557],"study_design_scores_gemma":[0.00003215776,0.000008091321,0.001326496,0.001259707,0.00002010212,0.0001020447,0.002232073,0.0001693242,0.0002216175,0.1205604,0.8740255,0.00004246331],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"review","genre_scores_codex":[0.001365163,0.4557535,0.001782396,0.500929,0.01072783,0.00003265089,0.0005423324,0.00005269824,0.02881436],"genre_scores_gemma":[0.1043465,0.4412249,0.005202741,0.2801645,0.02325824,0.0003201579,0.0007367696,0.0003910303,0.1443552],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.03968772,"threshold_uncertainty_score":0.07891345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031690743","doi":"","title":"Rezension zu: Braczyk, Boris Alexander: Rechtsgrund und Grundrecht, Grundlegend einer systematischen Grundrechtstheorie: Schriften zur Rechtstheorie, Heft 175, Berlin 1996","year":2001,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Law and Political Science","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities","authors":[{"name":"Stephan Kirste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08867625373547645,"gpt":0.4285875478775111,"spread":0.3399112941420346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995985,0.001174932,0.001162398,0.002617178,0.001368627,0.00514677,0.001460031,0.003510868,0.04090586],"category_scores_gemma":[0.008590894,0.0005301507,0.0005560674,0.004434953,0.00255753,0.009248227,0.0028219,0.004878491,0.01253525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002811725,"about_ca_system_score_gemma":0.002643409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01018048,"about_ca_topic_score_gemma":0.01441932,"domain_scores_codex":[0.9989784,0.0002588312,0.00008383687,0.0002275808,0.0003372494,0.0001141624],"domain_scores_gemma":[0.9981745,0.0010989,0.0001304244,0.00009520324,0.0004270499,0.00007383586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002953646,0.00002338586,0.00009138034,0.0003678452,0.00001890142,0.00004608017,0.0005195911,0.0001274998,0.00007852201,0.07117286,0.8990883,0.02843601],"study_design_scores_gemma":[0.00003425165,0.00001000141,0.000945169,0.0009361091,0.00003090462,0.0001843383,0.0005041672,0.000336355,0.0004212316,0.1137671,0.8827838,0.00004656452],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.002896198,0.5084782,0.01499388,0.3794041,0.04280761,0.0001068014,0.002205879,0.0003549773,0.04875228],"genre_scores_gemma":[0.1230347,0.4440673,0.01965481,0.1464594,0.05074136,0.0007399934,0.002732692,0.001200831,0.211369],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.04090586,"threshold_uncertainty_score":0.1368437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576467755","doi":"","title":"Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling","year":2007,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Travelling salesman problem; Scheme (mathematics); Generalization; Mathematics; Combinatorics; Mathematical optimization","authors":[{"name":"Md. Fazle Baki","is_ca":true},{"name":"Santosh N. Kabadi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09858564593074017,"gpt":0.3929758128072795,"spread":0.2943901668765393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003787683,0.001000412,0.00154402,0.001555329,0.002075822,0.002676808,0.002851364,0.003057119,0.01123636],"category_scores_gemma":[0.03113024,0.00088434,0.002811438,0.001974531,0.006043579,0.009456958,0.003097267,0.00691436,0.001325098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00260838,"about_ca_system_score_gemma":0.002149978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001887094,"about_ca_topic_score_gemma":0.001336263,"domain_scores_codex":[0.9969297,0.0005896967,0.0003200184,0.0007512234,0.0007847413,0.0006246442],"domain_scores_gemma":[0.9692003,0.02144434,0.002936211,0.002491196,0.002469559,0.001458529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004706707,0.0002574615,0.004352837,0.0004967753,0.0000672041,0.000685594,0.0005482947,0.02926533,0.006943241,0.9270728,0.008435089,0.02140473],"study_design_scores_gemma":[0.0001529687,0.0002885778,0.002180803,0.0001057303,0.00007513729,0.0005182718,0.0003369957,0.08949623,0.008100123,0.8919816,0.006657221,0.000106265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3955489,0.001975119,0.5069921,0.009272472,0.0007097541,0.0006102924,0.002867511,0.001099915,0.08092386],"genre_scores_gemma":[0.8771357,0.001527688,0.1093899,0.0007943565,0.0009932349,0.0005081896,0.00294177,0.0001601618,0.006549005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01123636,"threshold_uncertainty_score":0.03758943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145224703","doi":"","title":"The AID Method for Global Optimization","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Global optimization; Benchmark (surveying); Minification; Computer science; Population; Diversification (marketing strategy); Function (biology); Mathematics; Biology","authors":[{"name":"Mahamed G. H. Omran","is_ca":false},{"name":"Fred Glover","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1302166930664999,"gpt":0.4265542467424667,"spread":0.2963375536759668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326809,0.001003734,0.001077358,0.001282207,0.0005770967,0.001059619,0.001356464,0.001055442,0.006116482],"category_scores_gemma":[0.002281874,0.0004250065,0.001099296,0.0009370253,0.001012356,0.0009267804,0.002265735,0.001961036,0.001202606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005561356,"about_ca_system_score_gemma":0.001305919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001292821,"about_ca_topic_score_gemma":0.001226616,"domain_scores_codex":[0.9993415,0.0002558133,0.00002225428,0.00006284023,0.000271026,0.00004647085],"domain_scores_gemma":[0.9994948,0.0002372282,0.00004204453,0.00008652925,0.0001054466,0.00003388715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001108675,0.00006364542,0.0006981588,0.0003678979,0.0001219687,0.0001115594,0.0001371076,0.4848631,0.006462692,0.2222367,0.009701243,0.275125],"study_design_scores_gemma":[0.0000485187,0.0000749778,0.0001776009,0.0000395692,0.00002931022,0.0000999022,0.00002022464,0.9403392,0.00183883,0.03366724,0.02364496,0.00001966493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001629284,0.0003743328,0.9914011,0.00009488566,0.00006095862,0.00004719524,0.00003583213,0.0002661583,0.006090214],"genre_scores_gemma":[0.09448616,0.0006237369,0.8939987,0.0002186422,0.0001113354,0.0004467904,0.0001548966,0.0002970492,0.009662705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006116482,"threshold_uncertainty_score":0.02046168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1628824412","doi":"","title":"Uncertainty and Information: Foundations of Generalized Information Theory (a book review)","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Epistemology; Management science; Mathematical economics; Information retrieval; Mathematics; Philosophy; Engineering","authors":[{"name":"Jiřina Vejnarová","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1689708614860037,"gpt":0.4596860708050143,"spread":0.2907152093190106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001081046,0.001134036,0.00172797,0.00411531,0.0005708247,0.003616965,0.001002985,0.001713912,0.01269862],"category_scores_gemma":[0.004816004,0.0005762266,0.000759756,0.007618783,0.001476704,0.00517931,0.00112325,0.003003335,0.007373915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001491064,"about_ca_system_score_gemma":0.002403818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002481493,"about_ca_topic_score_gemma":0.002835746,"domain_scores_codex":[0.9991048,0.0001161232,0.00005723942,0.0001173297,0.0005447743,0.00005964504],"domain_scores_gemma":[0.9974825,0.001593898,0.0001668758,0.00009146884,0.0005611039,0.0001042312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003557723,0.00005110794,0.000213858,0.002833808,0.0000735748,0.00008819955,0.0001332712,0.001748457,0.0003307693,0.03930618,0.4561058,0.4990795],"study_design_scores_gemma":[0.000009721295,0.00003145203,0.0007689775,0.002060637,0.00003327526,0.0005167116,0.00008436456,0.0007803288,0.0001496629,0.05998989,0.9355378,0.00003719257],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000333219,0.9643285,0.007720265,0.005317871,0.003158858,0.00002645273,0.0003085412,0.0000906364,0.01871561],"genre_scores_gemma":[0.004872005,0.9644051,0.006056644,0.003127479,0.005403176,0.00005497341,0.0004607338,0.0000705987,0.01554926],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01269862,"threshold_uncertainty_score":0.04248112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606844304","doi":"","title":"General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Line search; Convergence (economics); Mathematical optimization; Independence (probability theory); Line (geometry); Forcing (mathematics); Computer science; Mathematics; Applied mathematics; Mathematical analysis; Statistics","authors":[{"name":"Zhensheng Yu","is_ca":false},{"name":"Ji Lin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1156901292525855,"gpt":0.4623901905659462,"spread":0.3467000613133607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000798443,0.0007069329,0.0006722946,0.0005222776,0.0004276565,0.0005025414,0.001214763,0.001130602,0.005592444],"category_scores_gemma":[0.001356862,0.0003338607,0.0006982313,0.0006976421,0.000667736,0.001077909,0.0009956876,0.001009855,0.00103887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003079042,"about_ca_system_score_gemma":0.0007842394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005282284,"about_ca_topic_score_gemma":0.001344008,"domain_scores_codex":[0.9995433,0.0001276643,0.00002804086,0.00007569495,0.0001940466,0.0000312995],"domain_scores_gemma":[0.9996977,0.000108963,0.00004175793,0.00007335297,0.00006279114,0.00001556495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001801926,0.000164029,0.0007694046,0.0005625041,0.00008980697,0.000448424,0.0001986408,0.5038792,0.05755463,0.2721118,0.0034185,0.1606229],"study_design_scores_gemma":[0.00003704801,0.00007814729,0.000194484,0.00002300517,0.000006955547,0.0001170404,0.000008446767,0.9639879,0.004678883,0.02358733,0.007261511,0.0000192937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004053128,0.0001042537,0.9928893,0.00005699388,0.000027452,0.00004443092,0.00003029602,0.00008612297,0.002708037],"genre_scores_gemma":[0.1588178,0.0003634746,0.8324926,0.0002139789,0.00006150004,0.0004712009,0.0001339898,0.0001182946,0.007327153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005592444,"threshold_uncertainty_score":0.01870859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3029385445","doi":"","title":"Nachruf. Zum Tode von Winfried Brugger","year":2011,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"German Social Sciences and History","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Psychology","authors":[{"name":"Stephan Kirste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1704803927664388,"gpt":0.4056490835125189,"spread":0.2351686907460802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158331,0.000841971,0.0008423448,0.001107381,0.001088478,0.001669272,0.0007180886,0.001933469,0.05940421],"category_scores_gemma":[0.006465,0.0003716447,0.0002883831,0.0009373606,0.001485658,0.003701931,0.00215133,0.004372741,0.04453578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010719,"about_ca_system_score_gemma":0.0008404172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001509673,"about_ca_topic_score_gemma":0.001954746,"domain_scores_codex":[0.9990662,0.0002813109,0.00004172535,0.0002100676,0.0003116214,0.00008916199],"domain_scores_gemma":[0.9984871,0.0008815004,0.00007350146,0.0001100214,0.0003056938,0.0001420891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000790773,0.00003026847,0.0001615291,0.0001718361,0.00001350239,0.0001294213,0.0001453284,0.0002243708,0.0002302742,0.03622972,0.891459,0.07112561],"study_design_scores_gemma":[0.00003280478,0.00002501661,0.0003380355,0.0004123923,0.0000132514,0.0004253357,0.0001547321,0.000586113,0.0005832503,0.06367116,0.933725,0.00003283887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"editorial","genre_scores_codex":[0.004998335,0.2762669,0.02139266,0.4784897,0.06028754,0.00007590537,0.00218611,0.001364872,0.154938],"genre_scores_gemma":[0.08925473,0.150861,0.01538107,0.1271758,0.04005122,0.0003440446,0.001904939,0.003352301,0.571675],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.05940421,"threshold_uncertainty_score":0.1987269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3031183160","doi":"","title":"Nachruf. Zum Tode von Gerd Roelcke","year":2012,"lang":"de","type":"article","venue":"Algorithmic operations research","topic":"Memory, History, Trauma, Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"GERD; Philosophy; Medicine; Internal medicine; Reflux; Disease","authors":[{"name":"Stephan Kirste","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1145536463027915,"gpt":0.3611729432833378,"spread":0.2466192969805463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075394,0.0008113381,0.0007955062,0.001014271,0.001082574,0.002071246,0.0007265097,0.002209039,0.0613553],"category_scores_gemma":[0.006777768,0.0003643804,0.0002463719,0.0007507664,0.001579583,0.003529714,0.0023407,0.004837695,0.04757275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000915592,"about_ca_system_score_gemma":0.0008078311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001477572,"about_ca_topic_score_gemma":0.002011937,"domain_scores_codex":[0.9991266,0.0002717373,0.00004570104,0.00017739,0.0002917358,0.00008684751],"domain_scores_gemma":[0.9985806,0.0008253367,0.00007987797,0.00009939221,0.0002810788,0.0001337674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008202882,0.00002814212,0.0001719041,0.0001800873,0.00001359213,0.0001839004,0.0002124944,0.0001550476,0.0001989579,0.03347556,0.8815428,0.08375552],"study_design_scores_gemma":[0.0000259943,0.00002193401,0.0002829187,0.0004235471,0.000009624719,0.0006359268,0.0002269073,0.0003772666,0.0003519744,0.04017914,0.9574375,0.0000271699],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"other","genre_scores_codex":[0.004186594,0.2817598,0.01220878,0.4988161,0.06023452,0.00007532421,0.001878696,0.001263409,0.1395768],"genre_scores_gemma":[0.09198178,0.1412603,0.01053432,0.1623795,0.04134351,0.0003009064,0.001367302,0.00294613,0.5478863],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.0613553,"threshold_uncertainty_score":0.2052539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1559508785","doi":"","title":"Robust Selling Times in Adaptive Portfolio Management","year":2009,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Stock price; Computer science; Portfolio; Stock (firearms); Portfolio optimization; Econometrics; Project portfolio management; Robust optimization; Investment strategy; Operations research; Mathematical optimization; Economics; Microeconomics; Financial economics; Mathematics; Series (stratigraphy); Profit (economics); Project management","authors":[{"name":"Michael Dziecichowicz","is_ca":false},{"name":"Aurélie Thiele","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1212074988205182,"gpt":0.3038757568824742,"spread":0.1826682580619561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003957439,0.00103503,0.001356505,0.0007460141,0.0004510921,0.001466625,0.001255713,0.001220782,0.001670007],"category_scores_gemma":[0.01500367,0.0007121395,0.0006053518,0.0007861535,0.001480692,0.002383558,0.001125402,0.001421118,0.0002474701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000913879,"about_ca_system_score_gemma":0.000781442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001527744,"about_ca_topic_score_gemma":0.0006756996,"domain_scores_codex":[0.9983863,0.0006327545,0.00009443844,0.0003480583,0.0004049464,0.0001336739],"domain_scores_gemma":[0.9946111,0.003828439,0.0008361135,0.0002796093,0.0002825741,0.0001621419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009840418,0.00003841168,0.00056392,0.0000453103,0.00004512577,0.00006225694,0.00005240071,0.9324189,0.001030457,0.0391904,0.0002834088,0.02617116],"study_design_scores_gemma":[0.00001246596,0.00003094491,0.000107546,0.000004244616,0.000006513941,0.00001233594,0.000004697537,0.9737996,0.000260129,0.02559783,0.0001556788,0.000008101027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03400937,0.0007709903,0.9628108,0.0002695977,0.00003752477,0.00003127858,0.00002830866,0.0001790357,0.001863082],"genre_scores_gemma":[0.9061461,0.0006141417,0.09074744,0.00009499118,0.0001213752,0.0001243675,0.00006234006,0.00007522738,0.002013882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003957439,"threshold_uncertainty_score":0.02092916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1590078554","doi":"","title":"Simplex Adjacency Graphs in Linear Optimization","year":2006,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Simplex; Adjacency list; Mathematics; Context (archaeology); Linear programming; Chordal graph; Indifference graph; Degeneracy (biology); Duality (order theory); Discrete mathematics; Computer science; Graph; Mathematical optimization","authors":[{"name":"Gerard Sierksma","is_ca":false},{"name":"Gert A. Tijssen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04304331769652263,"gpt":0.3724864654297721,"spread":0.3294431477332495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491808,0.0008054237,0.0005378641,0.001455598,0.0008479567,0.002024651,0.0007407908,0.001309588,0.007519064],"category_scores_gemma":[0.003323135,0.0004514638,0.0005708462,0.002663237,0.002361175,0.003482481,0.001390192,0.002287987,0.001287813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001191753,"about_ca_system_score_gemma":0.0005013205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002397716,"about_ca_topic_score_gemma":0.001961544,"domain_scores_codex":[0.9992942,0.0003399439,0.00002099346,0.0001327685,0.0001550085,0.00005711039],"domain_scores_gemma":[0.9986785,0.0009225441,0.0001169136,0.00009611031,0.0001225797,0.00006334306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006984681,0.000006698652,0.00007297805,0.00003837806,0.000005038684,0.00002881298,0.00007041775,0.01712212,0.0001850566,0.9705917,0.001777365,0.01009439],"study_design_scores_gemma":[0.000002326288,0.000004183195,0.00005230797,0.00001009123,0.000002292466,0.00001823388,0.00002438397,0.02298123,0.0000751978,0.9724715,0.004353696,0.000004658936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0359138,0.008686987,0.8617055,0.002898267,0.0003488865,0.00006162249,0.0006343721,0.0004042718,0.08934622],"genre_scores_gemma":[0.7034984,0.01150461,0.2549201,0.000854808,0.001056415,0.0003389798,0.0009285788,0.0003699725,0.02652807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007519064,"threshold_uncertainty_score":0.02515376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123428140","doi":"","title":"The makespan problem of scheduling multi groups of jobs on multi processors at different speeds","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Parallel computing; Mathematics; Computer network; Routing (electronic design automation)","authors":[{"name":"Wei Ding","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0685321649947203,"gpt":0.3414718059983619,"spread":0.2729396410036416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001801951,0.001156102,0.001163189,0.0008039028,0.001084682,0.0008628943,0.001080818,0.0007266907,0.001877076],"category_scores_gemma":[0.004676355,0.0005220136,0.0008534599,0.00131402,0.0007214837,0.002126808,0.0009083776,0.0007391653,0.0001697479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004395,"about_ca_system_score_gemma":0.001297781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770887,"about_ca_topic_score_gemma":0.001162913,"domain_scores_codex":[0.9987929,0.0004031604,0.000069045,0.0002428823,0.0003006991,0.000191402],"domain_scores_gemma":[0.9987757,0.0007476022,0.0001821008,0.0000813701,0.0001092805,0.0001039584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006967635,0.0001524631,0.001108034,0.0006525717,0.0002633655,0.0002945354,0.0001804805,0.9100281,0.009026933,0.01514586,0.001632428,0.06081848],"study_design_scores_gemma":[0.00007522517,0.0005752179,0.001986761,0.00002362196,0.00008701791,0.0002782309,0.0001687467,0.9547366,0.005804844,0.03363099,0.002611249,0.00002149529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2562775,0.001050498,0.7329589,0.0006130448,0.0002194049,0.0003798971,0.0002901253,0.0002820346,0.007928674],"genre_scores_gemma":[0.8434865,0.0007581863,0.1510251,0.000103866,0.0002142069,0.0004845602,0.0003619249,0.0002132069,0.003352435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001877076,"threshold_uncertainty_score":0.009529769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}