{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007987165,0.0001758486,0.0002399152,0.0003844678,0.002962124,0.001136879,0.0006156656,0.00009946652,0.00002837587],"category_scores_gemma":[0.001138767,0.0001053184,0.0000846818,0.001847325,0.0003440636,0.0004915522,0.00007400892,0.0003835204,0.0001293119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054233,"about_ca_system_score_gemma":0.0003226993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153431,"about_ca_topic_score_gemma":0.002305906,"domain_scores_codex":[0.9953335,0.001172597,0.0007092558,0.0006031299,0.001622975,0.0005585366],"domain_scores_gemma":[0.99224,0.003677642,0.0001024967,0.0006321989,0.003228223,0.000119478],"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.0003134541,0.000301793,0.0003564495,0.000003292334,0.00005166748,0.00000811123,0.0006734466,0.7675245,0.0009197649,0.01371468,0.003390893,0.2127419],"study_design_scores_gemma":[0.0008518202,0.000379553,0.002563617,0.00001625829,0.00001447791,0.00002498876,0.0006333853,0.9768262,0.00007952179,0.002113936,0.0163372,0.0001590659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01004193,0.00009366897,0.9841197,0.002506054,0.0001386521,0.002491328,0.00009750867,0.00005652101,0.0004546896],"genre_scores_gemma":[0.1794915,0.00005064168,0.8032867,0.00003685166,0.000490272,0.001309643,0.0005876157,0.00005543011,0.01469138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2125828,"threshold_uncertainty_score":0.9999,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703459,0.0001326946,0.0001403865,0.0003456532,0.0003750526,0.00003967611,0.0002768842,0.0001380344,0.0000404647],"category_scores_gemma":[0.00008187629,0.000134203,0.00004732134,0.0005427008,0.0002794078,0.00001723451,0.0001840205,0.0002634804,0.00007736741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006192633,"about_ca_system_score_gemma":0.0003784755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002532796,"about_ca_topic_score_gemma":0.0001521977,"domain_scores_codex":[0.9981796,0.0003051177,0.0002854585,0.000449388,0.0002955605,0.0004848479],"domain_scores_gemma":[0.9992237,0.00003420695,0.00001350112,0.0003030789,0.0003347333,0.00009074996],"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.00009285207,0.001579286,0.008348989,0.00006206506,0.0002142797,0.000158583,0.002370486,0.7480882,0.1872521,0.007568147,0.002349522,0.04191549],"study_design_scores_gemma":[0.002255029,0.001200208,0.005471899,0.00002836993,0.0000071336,0.0001739425,0.0007356458,0.9762401,0.003003439,0.002318706,0.007971901,0.0005936439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556969,0.00100263,0.04063311,0.0007373152,0.00009192924,0.0009535961,0.00002269751,0.00002392393,0.0008378724],"genre_scores_gemma":[0.9465602,0.0002703623,0.05113759,0.00004082101,0.0001782599,0.0003075144,0.0005235353,0.00002556064,0.0009561751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2281519,"threshold_uncertainty_score":0.5472641,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586481,0.0002267581,0.0004415567,0.0003499977,0.0007334505,0.00007667567,0.0005343544,0.0001568266,0.0002948654],"category_scores_gemma":[0.004130823,0.0002158369,0.0001505565,0.001654224,0.0005519613,0.0004142178,0.0003601241,0.0004141939,0.00003574428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003523499,"about_ca_system_score_gemma":0.0009380036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001870792,"about_ca_topic_score_gemma":0.0001194861,"domain_scores_codex":[0.9960938,0.0004917728,0.0008033233,0.0005908117,0.00120437,0.0008159768],"domain_scores_gemma":[0.9946892,0.001040541,0.00007172844,0.0006539667,0.003313356,0.0002312066],"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.001623654,0.007175076,0.00173516,0.002795592,0.001748196,0.0004316967,0.02333322,0.06501144,0.02102838,0.2777486,0.02478767,0.5725812],"study_design_scores_gemma":[0.001530029,0.0006357757,0.00004626321,0.00006957284,0.00001754085,0.0001975528,0.001232308,0.9791673,0.00820242,0.003989317,0.004597207,0.0003147517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008331059,0.00009281783,0.987478,0.0005882646,0.0001213174,0.002655857,0.0002701824,0.00009885989,0.0003636272],"genre_scores_gemma":[0.009114346,0.000124438,0.9875192,0.00002104269,0.000198592,0.0008538409,0.00007989968,0.00005340617,0.002035237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9141558,"threshold_uncertainty_score":0.8801575,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198037,0.0001161773,0.0001493492,0.0002270729,0.0005044646,0.0002389819,0.0002285437,0.00009123484,0.00005092339],"category_scores_gemma":[0.00009322904,0.0001109756,0.00005092903,0.0005598311,0.00002919781,0.0002805218,0.00001219341,0.0002429923,0.00003044373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103576,"about_ca_system_score_gemma":0.00007018467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000117958,"about_ca_topic_score_gemma":0.0001163881,"domain_scores_codex":[0.9986008,0.00005344245,0.0002718598,0.000232207,0.0002840228,0.0005576134],"domain_scores_gemma":[0.9993238,0.00008114662,0.000005447657,0.0002515686,0.0002536569,0.00008431584],"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.000001135727,0.00002956851,0.000001946866,0.00002765508,0.000008824553,0.000001027948,0.0002677653,0.9459597,0.006695461,0.001718311,0.001890622,0.04339801],"study_design_scores_gemma":[0.0002606592,0.0001048307,0.00005640256,0.00003888344,0.000002080324,0.000006915238,0.0001745972,0.9850827,0.001144978,0.0001357007,0.01284652,0.0001457591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2368528,0.001388782,0.7236487,0.001604775,0.0009852673,0.002486442,0.00005320703,0.0006943198,0.03228574],"genre_scores_gemma":[0.9703338,0.0001036187,0.02233526,0.00002145924,0.0005646109,0.0004216932,0.0000472102,0.00004183841,0.006130514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.733481,"threshold_uncertainty_score":0.4525455,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713394,0.00008776308,0.0001155697,0.0002384768,0.0001302656,0.00004189072,0.000211981,0.0000730449,0.0008324671],"category_scores_gemma":[0.00004656673,0.00008439636,0.00002662055,0.0006178698,0.00008440462,0.0001879208,0.00004002779,0.0002472638,0.0001557856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003167528,"about_ca_system_score_gemma":0.00006543256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002196023,"about_ca_topic_score_gemma":0.00006752473,"domain_scores_codex":[0.998966,0.00007295938,0.0002542032,0.0001466712,0.0002827454,0.0002774042],"domain_scores_gemma":[0.9992646,0.00003434398,0.000006319718,0.0002882783,0.0003264111,0.00008006115],"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.000008767937,0.0005109995,0.002033636,0.0001881188,0.0001936349,0.00001800611,0.01435007,0.9128112,0.01759415,0.02282177,0.005011247,0.02445847],"study_design_scores_gemma":[0.0002662889,0.0001071377,0.002302627,0.00005526726,0.00000570636,0.00000904499,0.0001818786,0.9918936,0.003405371,0.0002977091,0.00131211,0.0001632005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1035259,0.001472996,0.4805487,0.0002828481,0.001543618,0.003682755,0.0002384645,0.001193859,0.4075109],"genre_scores_gemma":[0.9682594,0.0002699871,0.03028099,0.000006614726,0.00005082753,0.00008601726,0.00002963667,0.00003286748,0.0009836376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8647335,"threshold_uncertainty_score":0.9114931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002056968,0.0001676605,0.0002854732,0.0008779905,0.003894308,0.00004770028,0.0001350012,0.0001847809,0.00009731655],"category_scores_gemma":[0.0004289165,0.0001655662,0.00002697495,0.001413993,0.0001448238,0.0004211792,0.000120164,0.000907457,0.00005008653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007375629,"about_ca_system_score_gemma":0.0008693545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002671561,"about_ca_topic_score_gemma":0.0006198575,"domain_scores_codex":[0.9951115,0.002348779,0.0007990669,0.0005601257,0.0005211746,0.0006593714],"domain_scores_gemma":[0.9979626,0.0003904917,0.00005399017,0.0003481319,0.00105128,0.0001935397],"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.00001956365,0.00009120272,0.00117699,0.0002016468,0.00001400679,0.000005952965,0.01940558,0.9741662,0.000002122971,0.001808736,0.00007988182,0.003028179],"study_design_scores_gemma":[0.001090279,0.00009549333,0.003839452,0.00008746172,0.000003949626,0.000004325886,0.01421646,0.9799133,9.438473e-7,0.0000190315,0.0005882987,0.0001409858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03947434,0.001265535,0.9436286,0.001633738,0.0002248706,0.006535706,0.00005465845,0.0001449188,0.007037645],"genre_scores_gemma":[0.7172505,0.001349372,0.2783641,0.0002193195,0.0001329436,0.0009490846,0.0003822113,0.00003670507,0.001315723],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6777762,"threshold_uncertainty_score":0.9974025,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00494127,0.0004451898,0.000508915,0.001085382,0.002081304,0.0002664998,0.0006082088,0.0002466782,0.001254597],"category_scores_gemma":[0.001531783,0.0004233932,0.0002051709,0.001487209,0.0003009731,0.0009798014,0.0004542305,0.001159691,0.0002929776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009641731,"about_ca_system_score_gemma":0.0005230798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002894568,"about_ca_topic_score_gemma":0.000437686,"domain_scores_codex":[0.9939654,0.000796443,0.0009284429,0.0008029054,0.001816073,0.001690719],"domain_scores_gemma":[0.9946035,0.001509442,0.00009479824,0.001084602,0.002156907,0.0005507148],"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.002942553,0.01975127,0.001133086,0.002435288,0.001579589,0.0000360207,0.01080437,0.2283459,0.008810296,0.1054098,0.1176532,0.5010987],"study_design_scores_gemma":[0.002807921,0.001639448,0.00005230584,0.0001206856,0.00003275393,0.00001339893,0.0006787327,0.970599,0.0008233912,0.00199475,0.02080091,0.0004366885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001460181,0.00007522252,0.9897033,0.001551309,0.0004149776,0.00527865,0.0003557612,0.0002416149,0.0009189824],"genre_scores_gemma":[0.02266465,0.00004915542,0.9641879,0.0002839302,0.001145081,0.004440145,0.000740252,0.0002072016,0.006281697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7422531,"threshold_uncertainty_score":0.9998218,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929363,0.000100327,0.0002355507,0.0005666491,0.0002345819,0.00005112437,0.001354475,0.00008380123,0.00045728],"category_scores_gemma":[0.0003574406,0.00007388579,0.0001616697,0.002185847,0.0004774193,0.0004418821,0.0003990894,0.0001956493,0.000004859213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007341481,"about_ca_system_score_gemma":0.000338765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006483878,"about_ca_topic_score_gemma":0.00003079629,"domain_scores_codex":[0.9970216,0.0003980164,0.0005351696,0.0003261841,0.00146031,0.0002587583],"domain_scores_gemma":[0.9980958,0.000268543,0.00007031898,0.0006389169,0.0008070464,0.0001194341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001414431,0.001633132,0.0003583602,0.00004666665,0.0009921109,0.000007082701,0.0117963,0.00008892261,0.2424152,0.009330782,0.003132333,0.730185],"study_design_scores_gemma":[0.0002507042,0.000138985,0.0006776279,0.0000127839,0.00003282465,0.000001848775,0.0004843513,0.3013429,0.69689,0.00009948737,0.00001013432,0.00005832254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004696113,0.00009271469,0.9936492,0.0002835712,0.0001110891,0.0007709877,0.00004673571,0.00003705984,0.0003125494],"genre_scores_gemma":[0.151522,0.00003183086,0.8475551,0.00009481857,0.00003847746,0.0004063198,0.00003013428,0.00001008564,0.0003112708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7301266,"threshold_uncertainty_score":0.5006896,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724145,0.0001066845,0.0001586628,0.0001256828,0.0006887034,0.0001615639,0.0001535939,0.00005240885,0.0005475939],"category_scores_gemma":[0.0002489362,0.00008913164,0.00002915477,0.0003460806,0.0001655576,0.000271881,0.0001903013,0.0002743371,0.0001500045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005712151,"about_ca_system_score_gemma":0.00003203645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006577951,"about_ca_topic_score_gemma":0.0001416098,"domain_scores_codex":[0.9984129,0.0002215235,0.0003065864,0.0001803341,0.0004032264,0.0004754458],"domain_scores_gemma":[0.9982453,0.0010168,0.00001880956,0.0002813433,0.0002601528,0.0001775732],"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.000001352786,0.0002984715,0.0002046239,0.00007279523,0.00002716255,3.105535e-7,0.002813295,0.000002578627,0.0002713396,0.9926829,0.002195161,0.001430017],"study_design_scores_gemma":[0.001649968,0.0004117008,0.004098976,0.0002867013,0.0001397509,0.0001318161,0.01263435,0.06386132,0.002745288,0.8738952,0.03901554,0.001129383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.849014,0.001477726,0.09767,0.00829202,0.0001343759,0.004245844,0.000715607,0.0002372607,0.03821315],"genre_scores_gemma":[0.8369923,0.0001814183,0.1594393,0.0001041915,0.0002954187,0.0006140901,0.00009044144,0.00003210832,0.002250738],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1187877,"threshold_uncertainty_score":0.599577,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007815418,0.000101682,0.00008035392,0.0001806473,0.0003717376,0.0001519794,0.0001513843,0.000051492,0.00006654564],"category_scores_gemma":[0.000004577941,0.00008416887,0.00003178333,0.000219492,0.00002441504,0.0004178094,0.00007518882,0.0001191434,0.0001896728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009322357,"about_ca_system_score_gemma":0.000003818604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004090303,"about_ca_topic_score_gemma":0.000009164744,"domain_scores_codex":[0.9987558,0.00003841231,0.0001704367,0.0001354903,0.0002606403,0.0006392715],"domain_scores_gemma":[0.9995926,0.00001584637,0.000002713594,0.000210443,0.0001005129,0.00007788686],"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.00000353226,0.00002072027,0.00001006236,0.00004202144,0.00003393346,2.406166e-7,0.0008125007,0.9851021,0.00007534725,0.002527464,0.006572205,0.004799931],"study_design_scores_gemma":[0.0002513914,0.00001243916,0.00003187813,0.000009511665,0.00001307184,4.402357e-7,0.00006345021,0.9904421,0.0003495884,0.0009611499,0.007747583,0.0001173802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003884723,0.000128083,0.984939,0.0002467355,0.0002429017,0.001186001,0.000008350042,0.0001758313,0.00918832],"genre_scores_gemma":[0.7465452,0.00006514957,0.2383014,0.00005648798,0.0009009372,0.001280277,0.0005292645,0.0000685924,0.01225268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7466376,"threshold_uncertainty_score":0.3432307,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171676,0.0001227827,0.00009489951,0.0001957489,0.001184526,0.0001711787,0.0002187437,0.00005336074,0.0001456228],"category_scores_gemma":[0.00007374929,0.00008441774,0.00002359554,0.0008168918,0.0001573749,0.0001704428,0.00003005211,0.0004691205,0.0001576248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109745,"about_ca_system_score_gemma":0.00007272899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004225489,"about_ca_topic_score_gemma":0.0000586815,"domain_scores_codex":[0.998594,0.0001643439,0.0001750513,0.0002001919,0.000536961,0.0003294045],"domain_scores_gemma":[0.9991471,0.0002543125,0.000008079381,0.000335682,0.0001897095,0.00006509332],"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.0000147056,0.00001993278,0.0001416573,0.00001530156,0.000040955,0.00001924811,0.003144325,0.9804142,0.0003329133,0.003297521,0.006929942,0.005629282],"study_design_scores_gemma":[0.0009811269,0.0002884802,0.0006489891,0.0001537258,0.00001031441,0.0001713302,0.001706743,0.9672741,0.004476945,0.0001393427,0.02376204,0.0003868967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5887814,0.0016655,0.1941875,0.01658517,0.0008229013,0.005974777,0.00007306723,0.002301579,0.1896081],"genre_scores_gemma":[0.9780873,0.0003068407,0.01613028,0.000168601,0.0002239036,0.0003308335,0.00006749871,0.00007832541,0.004606437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3893059,"threshold_uncertainty_score":0.911054,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111339,0.000135454,0.0002387293,0.0006027038,0.000335546,0.0001288574,0.001808293,0.00008822385,0.00005571326],"category_scores_gemma":[0.0004788296,0.0001087284,0.00008414231,0.001276693,0.0009702971,0.001133026,0.0006081438,0.0008088827,0.00002240719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003975552,"about_ca_system_score_gemma":0.0007135382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004015876,"about_ca_topic_score_gemma":0.0004962579,"domain_scores_codex":[0.9970335,0.0003390352,0.0003978081,0.0004101043,0.001121466,0.0006980977],"domain_scores_gemma":[0.9975048,0.0001340255,0.00003330446,0.001050144,0.001101953,0.0001757671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003567743,0.00010397,0.0003770179,0.00004309205,0.00003129266,0.000006303967,0.001524718,0.0004966129,0.6432672,0.3298094,0.00004133158,0.02426337],"study_design_scores_gemma":[0.001149143,0.0004746956,0.00636782,0.0000625521,0.000004888514,0.00005472284,0.0005945102,0.4042757,0.5669095,0.0196238,0.0001740596,0.0003085887],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9853374,0.000319918,0.01213361,0.0008533996,0.0002526734,0.0006833943,0.0000227197,0.00004810586,0.0003487454],"genre_scores_gemma":[0.9628032,0.00003055174,0.03639608,0.000007024809,0.0001454763,0.00006598847,0.000003779302,0.00001451811,0.0005334012],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4037791,"threshold_uncertainty_score":0.4433816,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007692616,0.0001483306,0.0001509229,0.0002883475,0.000384272,0.0002760531,0.0002124074,0.00009912597,0.00004123035],"category_scores_gemma":[0.00009276041,0.0001448283,0.00005927042,0.0006566028,0.00006863843,0.0002288603,0.00002420766,0.0003770892,0.00005376815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001237871,"about_ca_system_score_gemma":0.00008355777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000393443,"about_ca_topic_score_gemma":0.00003874513,"domain_scores_codex":[0.9985563,0.00007784601,0.0002619257,0.0002685697,0.000327965,0.0005074151],"domain_scores_gemma":[0.9991133,0.00005315762,0.000008162827,0.0002823989,0.0004243008,0.0001186712],"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.000007286889,0.0001313198,0.000001138719,0.00002766871,0.0000199591,6.722279e-7,0.0003631604,0.9663126,0.001074199,0.001792084,0.0006308639,0.02963904],"study_design_scores_gemma":[0.0006250385,0.0001588574,0.000006418413,0.000019128,0.000005962274,0.000005980293,0.0001573647,0.9967373,0.0002930927,0.00005397485,0.001770605,0.000166292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001234152,0.0001193065,0.9942772,0.0002817735,0.0001537284,0.001526659,0.00003540872,0.0003090143,0.002062708],"genre_scores_gemma":[0.6208249,0.00002374721,0.3737363,0.00003776258,0.0003755824,0.0006723669,0.000853577,0.00005593968,0.003419837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.620541,"threshold_uncertainty_score":0.5905928,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001371858,0.0002743756,0.000341374,0.0005619371,0.001525373,0.0002437571,0.0006529652,0.0001604114,0.00003417211],"category_scores_gemma":[0.0001831661,0.0002801312,0.00006951578,0.002489982,0.0005343833,0.001918902,0.0005772572,0.0006232082,0.00003664119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002869206,"about_ca_system_score_gemma":0.0004080072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298938,"about_ca_topic_score_gemma":0.000102383,"domain_scores_codex":[0.9961111,0.0004505466,0.000657999,0.0008248613,0.001019671,0.0009358023],"domain_scores_gemma":[0.9963801,0.0004053619,0.00006429874,0.0006630092,0.002306449,0.0001807665],"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.00001537758,0.0001406246,0.001632114,0.0000198428,0.00003135351,0.00001149149,0.0004393729,0.9798793,0.0004616872,0.004506891,0.0001180952,0.01274385],"study_design_scores_gemma":[0.0009150171,0.0002762586,0.01333215,0.0000678795,0.00000608548,0.00005061187,0.000143751,0.9823111,0.001814801,0.0006208392,0.0001744455,0.0002870079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1622722,0.0007559662,0.8340251,0.0002965181,0.0002317357,0.001201456,0.00004505462,0.0002228536,0.0009491052],"genre_scores_gemma":[0.5927569,0.0002128102,0.4059197,0.00002194356,0.000251788,0.00008376444,0.00007307616,0.00002932503,0.0006506894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4304847,"threshold_uncertainty_score":0.9999651,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004912045,0.0002088992,0.0002834695,0.0009649521,0.0009523029,0.0006363167,0.0008922774,0.0001412382,0.001891753],"category_scores_gemma":[0.0008536055,0.0001478624,0.00007504993,0.002596525,0.0005972556,0.002023585,0.0001643619,0.0004522125,0.0007142224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009371855,"about_ca_system_score_gemma":0.0006314411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001642951,"about_ca_topic_score_gemma":0.001411133,"domain_scores_codex":[0.9944797,0.0006377643,0.0007732821,0.0007793831,0.002693818,0.0006360856],"domain_scores_gemma":[0.9954754,0.0004797268,0.00008907389,0.0009909967,0.002668763,0.0002960467],"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.0002846651,0.0008215372,0.01308632,0.00001152159,0.0003130478,0.0001798646,0.02102176,0.2823193,0.0005248394,0.2657752,0.01844094,0.397221],"study_design_scores_gemma":[0.00101003,0.0003825671,0.01330167,0.00003218747,0.00002716953,0.00006737224,0.002463575,0.9597749,0.0006867494,0.01595834,0.005822242,0.00047318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08651361,0.0002148119,0.785979,0.0006928138,0.000306457,0.001488198,0.00009755445,0.0001345387,0.124573],"genre_scores_gemma":[0.9363512,0.0003828393,0.05446927,0.00007713692,0.0001842906,0.000152138,0.00007011098,0.00003400031,0.008279038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8498375,"threshold_uncertainty_score":0.9990206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008089573,0.0002110006,0.000178784,0.0002631808,0.0006682373,0.0003380371,0.0003110502,0.000192721,0.0005342792],"category_scores_gemma":[0.00008080183,0.0002019212,0.0000512713,0.0008005105,0.0001011528,0.0002091142,0.00006083252,0.001230931,0.0008556931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083526,"about_ca_system_score_gemma":0.0001234519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004543645,"about_ca_topic_score_gemma":0.002169064,"domain_scores_codex":[0.9981409,0.0001567747,0.0003074119,0.0003499145,0.0004294084,0.0006156113],"domain_scores_gemma":[0.9988108,0.0001341824,0.000009007282,0.0004655414,0.0003920111,0.0001884837],"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.000003773984,0.0000621108,0.00001502463,0.00001249673,0.00003125754,0.000004657122,0.0004880738,0.9759745,0.005341094,0.0007055278,0.004044885,0.01331659],"study_design_scores_gemma":[0.0004918128,0.00006466603,0.00007675841,0.00002623791,0.000003947875,0.000007215976,0.00004327316,0.989058,0.0005253284,0.00007166209,0.009403591,0.0002275047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0631322,0.0005182999,0.8837163,0.003171893,0.006159337,0.00820852,0.0004073068,0.001893284,0.03279289],"genre_scores_gemma":[0.3394892,0.0002531424,0.6502193,0.0001444927,0.0008743335,0.001008651,0.0004620825,0.0001554442,0.007393402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.276357,"threshold_uncertainty_score":0.9999223,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004539656,0.0001810603,0.0003338007,0.0005131706,0.0004369511,0.0001087562,0.0003698446,0.0001588757,0.001074773],"category_scores_gemma":[0.00464744,0.0001720941,0.00008939821,0.00148845,0.0002102389,0.0005730483,0.000135746,0.0005825915,0.0001294985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002996569,"about_ca_system_score_gemma":0.0003116917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007341408,"about_ca_topic_score_gemma":0.0001156596,"domain_scores_codex":[0.9965589,0.0009282953,0.0006458698,0.000344416,0.00067883,0.0008437111],"domain_scores_gemma":[0.994665,0.003267436,0.00004087304,0.0006334875,0.001194575,0.0001985861],"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.0001855594,0.004258368,0.00164504,0.0003833435,0.000184352,0.000004619455,0.008871954,0.01829447,0.006499687,0.7882805,0.007207853,0.1641843],"study_design_scores_gemma":[0.004160204,0.0005120778,0.0007483858,0.0002443966,0.0000315775,0.00003301529,0.0042114,0.8518767,0.02911822,0.08697966,0.02124348,0.0008409185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02233015,0.0001754499,0.9665691,0.0008026448,0.0002293098,0.002754692,0.00009403332,0.00005563852,0.006988979],"genre_scores_gemma":[0.03676868,0.00006770313,0.9539785,0.00003306475,0.0002595059,0.001177179,0.00005776218,0.00006883655,0.007588783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8335822,"threshold_uncertainty_score":0.9998384,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00285051,0.0001293341,0.0001628271,0.0003539931,0.002158273,0.0003353948,0.00141746,0.00006056664,0.00004308061],"category_scores_gemma":[0.0003070949,0.00008576026,0.00004903674,0.00158776,0.001714004,0.0007420602,0.0008224304,0.0006901917,0.0002688585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005699482,"about_ca_system_score_gemma":0.0002935753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002303268,"about_ca_topic_score_gemma":0.00006093889,"domain_scores_codex":[0.9966984,0.0009341261,0.000236434,0.0005079681,0.000979516,0.0006435746],"domain_scores_gemma":[0.9976165,0.0007085971,0.00001171979,0.0009304121,0.0005645741,0.0001681656],"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.00006531965,0.0001661935,0.0001665422,0.00002007168,0.00006573895,0.0001427678,0.00803078,0.003332229,0.0006577459,0.7819966,0.003405574,0.2019504],"study_design_scores_gemma":[0.00220176,0.0001600242,0.0004917632,0.00001570242,0.000002675043,0.0005153848,0.0002888615,0.8922172,0.0009579441,0.09380401,0.009085144,0.000259495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04351488,0.001998618,0.9143137,0.02151936,0.000203385,0.003130106,0.00001498285,0.0002710504,0.01503388],"genre_scores_gemma":[0.4697136,0.001585321,0.513967,0.0002776922,0.0002409223,0.000988237,0.000009269552,0.00003853292,0.01317942],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.888885,"threshold_uncertainty_score":0.9991408,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002208558,0.0001532592,0.0001392977,0.0001782764,0.00472088,0.0007037105,0.001748152,0.00006914998,0.00004076455],"category_scores_gemma":[0.0002385902,0.0001037379,0.00006197465,0.001336119,0.0003181089,0.0005349022,0.0005131894,0.000897422,0.0007404358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008007041,"about_ca_system_score_gemma":0.0005496467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001039247,"about_ca_topic_score_gemma":0.00008099283,"domain_scores_codex":[0.9969509,0.0003896974,0.0003081082,0.0005226944,0.001046428,0.000782118],"domain_scores_gemma":[0.9977704,0.0003767624,0.00001815178,0.00103127,0.0006216679,0.0001817704],"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.00001427509,0.0009097564,0.002409131,0.00002244356,0.0001619098,0.0004971094,0.007332047,0.05007259,0.001892885,0.286915,0.1714686,0.4783043],"study_design_scores_gemma":[0.0002304185,0.0001740598,0.0009705434,0.0000131358,0.000001427764,0.0001548949,0.00006685185,0.8845069,0.0002465098,0.0009198238,0.1125436,0.000171857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02473038,0.00305297,0.8761466,0.0392446,0.001532551,0.002601814,0.00001908205,0.001102704,0.05156928],"genre_scores_gemma":[0.6289437,0.001759129,0.287162,0.0003259522,0.001073333,0.0007408476,0.00003117695,0.00005937857,0.07990448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8344343,"threshold_uncertainty_score":0.9965748,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.007715294,0.000932385,0.001001577,0.0007941653,0.009508302,0.003307772,0.002400879,0.000836924,0.002228586],"category_scores_gemma":[0.002029634,0.0008400985,0.000381595,0.003148202,0.004414126,0.003527385,0.001271712,0.002440235,0.005862123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002445146,"about_ca_system_score_gemma":0.00329225,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.03325628,"about_ca_topic_score_gemma":0.03398028,"domain_scores_codex":[0.9823583,0.00506549,0.001678662,0.002138142,0.004548086,0.004211341],"domain_scores_gemma":[0.9917705,0.001559405,0.0001910398,0.001546444,0.002818149,0.002114442],"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.0008051707,0.007846841,0.004959385,0.001788232,0.005829513,0.001465639,0.1566587,0.02095851,0.01108875,0.2868606,0.09493565,0.406803],"study_design_scores_gemma":[0.002437265,0.001217324,0.00118653,0.001160899,0.0007757968,0.0000253508,0.008368242,0.06652734,0.003664169,0.004383909,0.9078563,0.002396883],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6504848,0.1486628,0.01462267,0.06342248,0.009437593,0.01603976,0.002649751,0.001427169,0.09325293],"genre_scores_gemma":[0.9198659,0.005949236,0.01248515,0.0006261535,0.007780195,0.0003103661,0.000338592,0.0002434146,0.052401],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8129206,"threshold_uncertainty_score":0.9998612,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01479331,0.0001338636,0.0001813256,0.0008113746,0.001906313,0.000487804,0.0006677535,0.0001068029,0.0003402831],"category_scores_gemma":[0.002237209,0.0001101671,0.0001108572,0.001700022,0.0003518548,0.0005279495,0.00009404473,0.0003756614,0.0004366084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001824025,"about_ca_system_score_gemma":0.0002346241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000743955,"about_ca_topic_score_gemma":0.0001007323,"domain_scores_codex":[0.9964015,0.0005523874,0.0005719369,0.0006586057,0.001337937,0.0004776302],"domain_scores_gemma":[0.9929116,0.004562511,0.00006181183,0.0005632751,0.001724731,0.0001760836],"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.0002361995,0.0006314337,0.0001944788,0.000006633127,0.00007650375,0.000005934064,0.00218246,0.1062412,0.008962602,0.5246588,0.005298513,0.3515053],"study_design_scores_gemma":[0.0007542887,0.0002165235,0.000868104,0.00001189578,0.000009607861,0.000008145913,0.004829361,0.8330628,0.03502751,0.1152055,0.009789755,0.0002165528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02395626,0.00002960471,0.9671296,0.001897057,0.0001826284,0.001177492,0.00007782017,0.00004541885,0.005504072],"genre_scores_gemma":[0.9291625,0.00000190726,0.06669719,0.0001155609,0.0003708721,0.0006419439,0.00009209003,0.0000187632,0.002899157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9052063,"threshold_uncertainty_score":0.999393,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008423006,0.0001286706,0.000138488,0.0003297005,0.0007155773,0.0002321722,0.0001674673,0.0001261437,0.00005896326],"category_scores_gemma":[0.00003777233,0.0001244694,0.00004695367,0.0003228618,0.00009486811,0.0002911121,0.00002432102,0.0004541326,0.00003427294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003626752,"about_ca_system_score_gemma":0.00004821315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004910001,"about_ca_topic_score_gemma":0.00004914943,"domain_scores_codex":[0.9989228,0.0001079776,0.0002126415,0.0002137926,0.0002022956,0.0003404786],"domain_scores_gemma":[0.9992488,0.0002362502,0.000008052682,0.0002620045,0.0001352603,0.0001096247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000915729,0.0002359531,0.001951263,0.0001640921,0.0003510707,0.00001648034,0.006492452,0.07728776,0.7357891,0.1283014,0.004109818,0.04520907],"study_design_scores_gemma":[0.001478836,0.0002522466,0.003247578,0.00004253814,0.00001325993,0.00006244058,0.0009279432,0.9651776,0.01316049,0.003777532,0.01147255,0.0003869749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.964643,0.001011225,0.03085543,0.0002927227,0.0005700728,0.00121101,0.00008299042,0.0002157031,0.001117874],"genre_scores_gemma":[0.9919519,0.0001200078,0.006390081,0.00001374082,0.0003419027,0.0005316558,0.0001289901,0.00004194355,0.0004797197],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8878899,"threshold_uncertainty_score":0.5503714,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001909846,0.0001131167,0.0001076387,0.0002540579,0.002504058,0.0004522959,0.001664081,0.00005617079,0.0001444423],"category_scores_gemma":[0.0001230315,0.0000828118,0.00008044772,0.001376764,0.0003061693,0.0006901408,0.0004164099,0.0004025043,0.0001185087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005902193,"about_ca_system_score_gemma":0.0003250081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001015773,"about_ca_topic_score_gemma":0.0002430712,"domain_scores_codex":[0.9981097,0.0001905906,0.0002419815,0.0004318437,0.0004636964,0.0005621662],"domain_scores_gemma":[0.997782,0.0003731954,0.00001457732,0.0009734958,0.0007550534,0.000101695],"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.000005500634,0.0001842463,0.000009722042,0.00001139098,0.00006292676,0.000002880383,0.005051867,0.000617245,0.000258638,0.9087894,0.01626928,0.06873693],"study_design_scores_gemma":[0.0004213573,0.0003006607,0.0003063664,0.0000178848,0.00001098507,0.00005420938,0.001115962,0.8047938,0.002442003,0.09355835,0.09671611,0.0002623294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003802614,0.0002777213,0.9889737,0.003428876,0.0004660257,0.001351614,0.00004139086,0.0001376878,0.004942709],"genre_scores_gemma":[0.06816573,0.000201448,0.9187053,0.0001475512,0.0004867066,0.002242919,0.00002235672,0.00002654272,0.01000139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.815231,"threshold_uncertainty_score":0.9987946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01176098,0.0001461036,0.0002331002,0.001015926,0.000401866,0.0005375537,0.000770458,0.0001337647,0.002356674],"category_scores_gemma":[0.004133842,0.0001207165,0.00005813989,0.002469223,0.0001754475,0.001735024,0.0003108729,0.0004127314,0.001301397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003397849,"about_ca_system_score_gemma":0.0001719092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003933494,"about_ca_topic_score_gemma":0.00001837832,"domain_scores_codex":[0.9932349,0.002293016,0.0006763457,0.0004735161,0.002552065,0.0007701914],"domain_scores_gemma":[0.997428,0.001066593,0.00002698746,0.0006528324,0.0005592691,0.0002662899],"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.0003209513,0.004315772,0.02770795,0.000008675031,0.00007605277,0.00003407749,0.03864621,0.5490734,0.216894,0.03816811,0.0180501,0.1067047],"study_design_scores_gemma":[0.001955377,0.0003218221,0.005088787,0.00002066133,0.000003709989,0.00001849945,0.008321367,0.8944883,0.07641145,0.001508258,0.01128106,0.000580693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2384089,0.002513165,0.7160925,0.0009452534,0.006299328,0.002927239,0.00004407921,0.0001295413,0.03264],"genre_scores_gemma":[0.7028639,0.00003259725,0.2931761,0.00003685612,0.0009301822,0.0002247707,0.0000148289,0.00002282922,0.002697873],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.464455,"threshold_uncertainty_score":0.9994762,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001581352,0.0001179845,0.00009438789,0.0002231818,0.003509635,0.0004886324,0.0005114017,0.00004191223,0.0005243733],"category_scores_gemma":[0.0001936012,0.00008559228,0.00004808299,0.001198972,0.0002461636,0.0008106137,0.0002815679,0.0002904845,0.004271287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006315806,"about_ca_system_score_gemma":0.0001017968,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007703662,"about_ca_topic_score_gemma":0.003058106,"domain_scores_codex":[0.9981027,0.00003496861,0.0003053302,0.0003079807,0.00074367,0.00050533],"domain_scores_gemma":[0.9986159,0.00003720913,0.000008618994,0.0005010456,0.0008153582,0.00002191093],"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.00003053869,0.0006446523,0.00328996,0.00008674654,0.0001078649,0.00003841787,0.0005465091,0.07603365,0.0004232716,0.3111268,0.5760028,0.03166876],"study_design_scores_gemma":[0.0002062285,0.000014483,0.003025835,0.000009669029,0.000005685531,0.000003466889,0.0004657133,0.4018525,0.00001842676,0.0005903507,0.5936587,0.0001489047],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4046341,0.001879834,0.01525684,0.08011449,0.003145092,0.008157543,0.00002520859,0.001147616,0.4856393],"genre_scores_gemma":[0.9537694,0.0006016821,0.001343623,0.0006190958,0.001001909,0.000569593,0.00007989347,0.0000282511,0.04198651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5491354,"threshold_uncertainty_score":0.9989041,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977152,0.0001363992,0.0001488108,0.0008948313,0.0005794961,0.0006059821,0.001342051,0.0001162321,0.0001498335],"category_scores_gemma":[0.0003784078,0.0001331746,0.00004938042,0.003025958,0.0002835203,0.0008467713,0.0004049223,0.001087684,0.00009516667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005422171,"about_ca_system_score_gemma":0.000276388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006352225,"about_ca_topic_score_gemma":0.002150632,"domain_scores_codex":[0.9975989,0.0002629171,0.0003447875,0.0005762717,0.0006566512,0.00056046],"domain_scores_gemma":[0.9982232,0.000222592,0.00001483621,0.0008918123,0.0005118847,0.000135708],"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.000002322052,0.0004262284,0.0002212213,0.00002194105,0.00001099062,0.0000226698,0.001210179,0.417348,0.001601237,0.5384554,0.0002849167,0.04039489],"study_design_scores_gemma":[0.0002981696,0.00006840824,0.0007173263,0.00001543308,8.799685e-7,0.00002211093,0.00003746688,0.973245,0.0001462905,0.02461701,0.0006696442,0.0001622325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02580773,0.0000796064,0.9661029,0.002621189,0.000768352,0.001113879,0.000008873339,0.0001956612,0.003301814],"genre_scores_gemma":[0.4476586,0.00007953425,0.5508394,0.00007961567,0.0002176399,0.0004725374,0.00003053173,0.00002200863,0.0006000948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5558971,"threshold_uncertainty_score":0.58435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00262437,0.0001220083,0.0001133146,0.000214426,0.0004664944,0.0001352501,0.0003449348,0.00008927454,0.00002169458],"category_scores_gemma":[0.0002263706,0.00008238007,0.00002947056,0.0008312453,0.000101395,0.000241163,0.00003148212,0.0003772583,0.000007195725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836964,"about_ca_system_score_gemma":0.0001041572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002848527,"about_ca_topic_score_gemma":0.0004138761,"domain_scores_codex":[0.9984821,0.0002469376,0.0002574591,0.0002255933,0.0003333258,0.000454597],"domain_scores_gemma":[0.9990095,0.0003706096,0.000009603627,0.0003394103,0.0002282877,0.00004261214],"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.00005090034,0.0003508801,0.0001277676,0.0002134065,0.0002174247,0.00001156809,0.01762095,0.6592494,0.0008137582,0.01386549,0.02786389,0.2796146],"study_design_scores_gemma":[0.0002297884,0.00006561477,0.000376899,0.00001052495,0.00001111907,0.00001368691,0.0002171299,0.9981958,0.00006800451,0.0005486882,0.0001622806,0.0001004077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004470181,0.0008035742,0.9869861,0.0004840325,0.0001129768,0.003162395,0.00003133102,0.00008747832,0.003861929],"genre_scores_gemma":[0.9509841,0.000455769,0.04496307,0.00003679802,0.0001068823,0.002281774,0.0000263908,0.00004676605,0.001098484],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9465139,"threshold_uncertainty_score":0.3587945,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003304916,0.00009519068,0.0001282469,0.0002335423,0.003510307,0.0004886076,0.0005826717,0.0002050579,0.005209582],"category_scores_gemma":[0.0008178416,0.00009809404,0.00005116971,0.0006353998,0.0007607513,0.0004330116,0.0001073567,0.000829155,0.003035127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001502093,"about_ca_system_score_gemma":0.001210876,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01380743,"about_ca_topic_score_gemma":0.03415016,"domain_scores_codex":[0.9979179,0.0002610889,0.0002376913,0.0003143641,0.0005629584,0.0007060039],"domain_scores_gemma":[0.9988036,0.0002617791,0.00001397065,0.0002734784,0.0003903086,0.0002569358],"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.00001873733,0.0005496434,0.02416371,0.00001506239,0.0001451209,0.00003938064,0.1436065,0.00005947641,0.00892632,0.4708252,0.1324762,0.2191747],"study_design_scores_gemma":[0.0004417949,0.00004652953,0.01702861,0.00001141499,0.000005661666,0.000005733415,0.01836234,0.001335964,0.0006248808,0.005230303,0.956479,0.0004277643],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7913222,0.00003875726,0.00007525388,0.009036754,0.003297916,0.0006315138,0.000020622,0.0001209586,0.195456],"genre_scores_gemma":[0.9121405,0.000216567,0.007682633,0.0001905422,0.002500843,0.0002262258,0.00003649158,0.00002402657,0.07698212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8240029,"threshold_uncertainty_score":0.997787,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551378,0.0001329244,0.0001939802,0.0002237855,0.0005884442,0.00003478819,0.0003006823,0.00007887634,0.0007293041],"category_scores_gemma":[0.0003597344,0.0000989597,0.00006391051,0.0007791629,0.0004940226,0.0003265693,0.0001092695,0.000509072,0.0000425791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002167301,"about_ca_system_score_gemma":0.0006053397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008890366,"about_ca_topic_score_gemma":0.0001956021,"domain_scores_codex":[0.9975982,0.0003260681,0.0003377705,0.0003642213,0.001037568,0.0003361453],"domain_scores_gemma":[0.9960409,0.0001158601,0.00003854679,0.0007763518,0.002885637,0.000142721],"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.0001962318,0.003130742,0.0007375007,0.00007836307,0.0002324183,0.00006561426,0.02808749,0.02467254,0.06871868,0.1096017,0.0008412426,0.7636374],"study_design_scores_gemma":[0.002866155,0.001089718,0.001824234,0.0001962198,0.0002779208,0.0001791759,0.01546539,0.8903888,0.07859294,0.007477417,0.001250769,0.0003912407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1934584,0.0006038821,0.7749202,0.001776802,0.0001948726,0.009103637,0.0002934432,0.0003699044,0.0192788],"genre_scores_gemma":[0.5143092,0.0001433854,0.4838617,0.00007334523,0.0001702901,0.0009240435,0.0001630908,0.00002863994,0.000326292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8657163,"threshold_uncertainty_score":0.7985368,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007870317,0.001126059,0.001189688,0.0007102886,0.008997309,0.003546495,0.002595768,0.001362729,0.01236949],"category_scores_gemma":[0.002271034,0.0009973813,0.0004580368,0.004016048,0.003418569,0.002073415,0.0007304161,0.003842503,0.007835044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138249,"about_ca_system_score_gemma":0.002557343,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0190958,"about_ca_topic_score_gemma":0.007877246,"domain_scores_codex":[0.9810773,0.004880125,0.001554141,0.002651186,0.005290942,0.004546347],"domain_scores_gemma":[0.991172,0.001893027,0.0001987445,0.001708444,0.002644347,0.002383499],"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.0006154064,0.006004646,0.005912971,0.0007476133,0.004852437,0.001336729,0.1725089,0.003536325,0.01443818,0.09702065,0.6390046,0.05402152],"study_design_scores_gemma":[0.00371973,0.00154772,0.002578973,0.0006155088,0.0008899352,0.00005284583,0.00853783,0.04946578,0.003491021,0.0007284746,0.9255531,0.002819058],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3978133,0.1874477,0.00376778,0.1313884,0.0109791,0.01487545,0.002570796,0.001427887,0.2497296],"genre_scores_gemma":[0.8477089,0.01199196,0.008777219,0.00194427,0.006723738,0.0004832844,0.0002580035,0.0002576459,0.1218549],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4498956,"threshold_uncertainty_score":0.9999337,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.02510246,0.001131433,0.001516552,0.001114408,0.009281768,0.00335343,0.003350366,0.001772881,0.005120321],"category_scores_gemma":[0.00491686,0.001017651,0.0005433132,0.007844809,0.004436068,0.002712457,0.001066576,0.003779437,0.009266019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001759491,"about_ca_system_score_gemma":0.004084428,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.04859834,"about_ca_topic_score_gemma":0.01905829,"domain_scores_codex":[0.9736845,0.01042724,0.002431989,0.002870522,0.005923188,0.004662502],"domain_scores_gemma":[0.987536,0.003966654,0.0002712783,0.002578159,0.003224447,0.002423491],"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.0002386656,0.00137911,0.001497123,0.0003659601,0.000812389,0.0006454759,0.01032722,0.0004821449,0.001029695,0.9194574,0.03365108,0.03011376],"study_design_scores_gemma":[0.002373229,0.001327631,0.001091448,0.001387216,0.0006020934,0.0001817666,0.006664415,0.01687906,0.001423311,0.02924976,0.9362299,0.002590178],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1694169,0.1066485,0.03721152,0.1513814,0.02969124,0.0286286,0.002359578,0.00274698,0.4719152],"genre_scores_gemma":[0.6901792,0.02742044,0.01812705,0.001700653,0.0156765,0.001110639,0.0007413128,0.0004553528,0.2445889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9025788,"threshold_uncertainty_score":0.999523,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127836,0.00009123256,0.0001030632,0.0001159379,0.001133934,0.0001184789,0.000174257,0.00006605776,0.00003174628],"category_scores_gemma":[0.0002358514,0.00006420689,0.00004613663,0.0003467189,0.0001713697,0.0002236123,0.00002816496,0.0002443089,0.000002511104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003796564,"about_ca_system_score_gemma":0.00007303814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007012824,"about_ca_topic_score_gemma":0.00008469322,"domain_scores_codex":[0.9990267,0.00005364939,0.0002584379,0.0001480503,0.0002211484,0.0002919702],"domain_scores_gemma":[0.998086,0.00122611,0.00001577435,0.0001966994,0.0004259344,0.00004947732],"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.00003481514,0.0001055184,0.0002250482,0.0002774777,0.0001921566,0.000001378928,0.00326648,0.9073923,0.02628923,0.04861689,0.003727245,0.009871504],"study_design_scores_gemma":[0.0004067422,0.00007502126,0.0008368585,0.00002432466,0.00001850999,0.000006663642,0.0007211848,0.9927992,0.002452688,0.000682863,0.00188618,0.00008982657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1184888,0.001792683,0.8740072,0.001674628,0.0006640285,0.002640282,0.0003514446,0.0000936018,0.0002872628],"genre_scores_gemma":[0.9775227,0.0007474265,0.02036482,0.00006109974,0.00045847,0.0003018601,0.0001838483,0.00003174535,0.0003280761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8590338,"threshold_uncertainty_score":0.8721422,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006144621,0.0001735022,0.0001777068,0.0002292222,0.0024602,0.001053268,0.002437043,0.000112723,0.0001289801],"category_scores_gemma":[0.001943185,0.0001291431,0.00009212886,0.002224991,0.0002436582,0.0007330831,0.0006035346,0.0003559608,0.0001391423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002257377,"about_ca_system_score_gemma":0.0007465078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002800124,"about_ca_topic_score_gemma":0.0000824281,"domain_scores_codex":[0.9957196,0.001080444,0.0004794808,0.0006720742,0.001164443,0.0008839397],"domain_scores_gemma":[0.9949648,0.0009151943,0.00003401611,0.001255911,0.002578381,0.000251679],"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.00002752133,0.0001930209,0.00002018231,0.00001219792,0.00007633313,0.000007696262,0.00070685,0.1171724,0.00003298577,0.6577772,0.004519446,0.2194542],"study_design_scores_gemma":[0.0004649135,0.0001648857,0.00004377163,0.000004991412,0.000004490403,0.00002124027,0.0001217771,0.9846103,0.0004253382,0.005447497,0.008542479,0.0001482927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000007987715,0.0001895371,0.9880477,0.002555702,0.0004147538,0.001485735,0.00002291787,0.0001322364,0.00714344],"genre_scores_gemma":[0.0007065838,0.0002036396,0.9938566,0.00008991056,0.000169024,0.0009517308,0.00002255668,0.00002121483,0.003978734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8674379,"threshold_uncertainty_score":0.9999837,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004979818,0.000103198,0.0002227658,0.0005894937,0.001063896,0.0001924915,0.0005448513,0.00007044407,0.00118051],"category_scores_gemma":[0.003899577,0.00007995928,0.00006358015,0.001615214,0.0005429478,0.00347699,0.0002252503,0.0002463748,0.000378015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005418781,"about_ca_system_score_gemma":0.0003139654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002096241,"about_ca_topic_score_gemma":0.00001072492,"domain_scores_codex":[0.9969131,0.0004082707,0.0009731438,0.0001766564,0.001302788,0.0002259873],"domain_scores_gemma":[0.9957089,0.0007198738,0.0001091802,0.0006851195,0.002670985,0.0001058717],"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.00002212872,0.00007752307,0.00007652405,0.0000784549,0.00002697838,8.437214e-7,0.001829284,0.002188357,0.0001093997,0.2713183,0.5720042,0.152268],"study_design_scores_gemma":[0.0002964489,0.00008826119,0.0006444959,0.00008499194,0.000007753415,0.0000651661,0.0002614633,0.06631427,0.0002189466,0.008311794,0.9235718,0.0001345805],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03916096,0.02642298,0.8017947,0.04645234,0.0003962028,0.008789072,0.001042378,0.0005076884,0.07543368],"genre_scores_gemma":[0.3988611,0.190477,0.3503186,0.02368652,0.0006448611,0.004518013,0.002952921,0.00008161703,0.0284593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4514761,"threshold_uncertainty_score":0.9997326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002938358,0.0002475066,0.0004385286,0.0009992491,0.0006397535,0.000144108,0.0005912383,0.0002301036,0.0002770237],"category_scores_gemma":[0.001813083,0.0002371666,0.0001344154,0.00163839,0.000360508,0.0005486659,0.0001300023,0.0005667179,0.0000107712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002834072,"about_ca_system_score_gemma":0.0006217833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005916662,"about_ca_topic_score_gemma":0.00002955817,"domain_scores_codex":[0.9962651,0.0003004491,0.0008401077,0.0005460276,0.001210446,0.0008379399],"domain_scores_gemma":[0.9944615,0.0007549218,0.00005872786,0.0007165673,0.003794082,0.0002141402],"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.0003384034,0.002133686,0.00001731192,0.0002692486,0.0001740608,0.00001554097,0.002378073,0.527273,0.03155332,0.1707137,0.002909165,0.2622245],"study_design_scores_gemma":[0.0009937447,0.0008818257,0.000006293866,0.00004939616,0.00001170744,0.0000134774,0.0002776611,0.908031,0.07316935,0.01603485,0.0002976641,0.0002330621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003513238,0.00005628579,0.9889996,0.001970296,0.00004841684,0.003447111,0.0001424546,0.0001702277,0.001652366],"genre_scores_gemma":[0.03060457,0.0002093388,0.96312,0.00005133049,0.000352786,0.0005297596,0.0002411591,0.00006377921,0.00482723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.380758,"threshold_uncertainty_score":0.9671374,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.005171259,0.0002620979,0.0003399188,0.0004262541,0.006493867,0.0005804368,0.001415149,0.0003994622,0.01049553],"category_scores_gemma":[0.0004046017,0.0002657129,0.0001879211,0.002357036,0.003162881,0.0008639107,0.0003451321,0.001071013,0.009844304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007946923,"about_ca_system_score_gemma":0.002376284,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05834183,"about_ca_topic_score_gemma":0.01581267,"domain_scores_codex":[0.9932457,0.001552051,0.0005419067,0.0008248443,0.002250193,0.001585259],"domain_scores_gemma":[0.9973096,0.0001912591,0.00005176563,0.0006183286,0.001182042,0.0006470549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005373209,0.00123458,0.0005118978,0.00004815856,0.0001760636,0.0001114935,0.6417146,0.00003574358,0.001012223,0.1722489,0.1103503,0.07250226],"study_design_scores_gemma":[0.0005803184,0.0004400222,0.003179399,0.0000669653,0.00006854181,0.000002352984,0.04942509,0.005554165,0.0002456223,0.003086586,0.9365602,0.0007907728],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.07061449,0.01339651,0.002651722,0.01433704,0.0123967,0.004262932,0.0002505267,0.000392372,0.8816977],"genre_scores_gemma":[0.8420424,0.004141425,0.007418205,0.0004090801,0.006036934,0.0002884307,0.00005862532,0.00007453506,0.1395304],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8262099,"threshold_uncertainty_score":0.9999795,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004044857,0.0005042304,0.0005498173,0.001034076,0.005821692,0.001884919,0.001045331,0.0003250277,0.02132293],"category_scores_gemma":[0.0004964043,0.0005228156,0.000264351,0.0004643706,0.001618785,0.001879107,0.0004457768,0.001958936,0.03096835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161409,"about_ca_system_score_gemma":0.0007674776,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007743501,"about_ca_topic_score_gemma":0.004886962,"domain_scores_codex":[0.9926038,0.00145215,0.0008957508,0.0008231518,0.002048104,0.002177002],"domain_scores_gemma":[0.9958696,0.0003365458,0.00006833602,0.001455009,0.001520511,0.0007499919],"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.0001082207,0.003963814,0.001110633,0.0006735178,0.0008263317,0.0001429815,0.08998131,0.0001921728,0.002007482,0.3080119,0.5563006,0.03668101],"study_design_scores_gemma":[0.0008334806,0.0003034092,0.0009568181,0.00009517168,0.0001548144,0.00002195256,0.00414225,0.007761861,0.0004693067,0.0002379558,0.9842538,0.0007691902],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3828835,0.1251734,0.004542612,0.0117265,0.05448516,0.009601383,0.002669693,0.0009746663,0.4079431],"genre_scores_gemma":[0.6801963,0.00198545,0.002054265,0.0002608624,0.02194462,0.0004947903,0.0004691416,0.0002019158,0.2923927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4279532,"threshold_uncertainty_score":0.9997224,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203489,0.0001135935,0.0002072243,0.00070745,0.0002673678,0.000196193,0.0002414826,0.00007070534,0.0006493282],"category_scores_gemma":[0.0000357123,0.0001271155,0.00004323417,0.0008245607,0.0000729548,0.0004213777,0.00004649523,0.00028719,0.0006281543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000158475,"about_ca_system_score_gemma":0.00003996555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005371225,"about_ca_topic_score_gemma":0.00006987027,"domain_scores_codex":[0.9985773,0.00004071164,0.0004402075,0.0004045953,0.00009557755,0.0004415881],"domain_scores_gemma":[0.9995472,0.00002743247,0.00002577495,0.0002696313,0.0000689368,0.0000610685],"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.000009132986,0.0001463537,0.0003204976,0.000005087779,0.00001388009,0.00002627929,0.000208768,0.007713349,0.000005855311,0.9837835,0.002064609,0.005702659],"study_design_scores_gemma":[0.001651368,0.0007891371,0.09497544,0.0001201758,0.000005637715,0.00000898821,0.001885379,0.5447761,0.0001223161,0.3154022,0.03945031,0.0008129776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05973498,0.00268714,0.01076711,0.00288928,0.0002597669,0.001225309,0.00005890146,0.00006363945,0.9223139],"genre_scores_gemma":[0.966863,0.001729339,0.01776114,0.0002078782,0.00014536,0.0001013397,0.00002818094,0.00001593679,0.0131478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9091661,"threshold_uncertainty_score":0.8073863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101245,0.0001543452,0.0001701808,0.001423452,0.000581908,0.0003225992,0.001314202,0.0001048931,0.0001192019],"category_scores_gemma":[0.0002642823,0.0001531946,0.00005452219,0.004705107,0.0002374034,0.001252657,0.0004473503,0.0006743457,0.0001843585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001747931,"about_ca_system_score_gemma":0.0003181484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009539621,"about_ca_topic_score_gemma":0.0005727585,"domain_scores_codex":[0.9963937,0.0006922979,0.0004088891,0.0006501135,0.001004606,0.0008504191],"domain_scores_gemma":[0.9979507,0.0003038981,0.00001642355,0.0008949965,0.0007131293,0.0001208794],"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.000006796769,0.0002241239,0.0003188223,0.000007477476,0.000005204159,0.00004232284,0.0001864021,0.6805169,0.001246181,0.3035866,0.0005276229,0.01333153],"study_design_scores_gemma":[0.0004698947,0.00008735794,0.0006007163,0.00001369946,6.21113e-7,0.00001089937,0.00006460449,0.9671656,0.001216981,0.02907876,0.001115339,0.0001754993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01448665,0.000276086,0.9788086,0.001719071,0.0001494043,0.0008676954,0.00001010655,0.0001548569,0.003527469],"genre_scores_gemma":[0.4593522,0.0001891984,0.5364364,0.00005740924,0.0001770938,0.0003774644,0.0000740484,0.00003763505,0.003298497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4448656,"threshold_uncertainty_score":0.6247093,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001031741,0.0001898239,0.0002334785,0.0002864108,0.0005063858,0.00006842256,0.0003665124,0.0001221589,0.00005707833],"category_scores_gemma":[0.0002161307,0.0001370251,0.0000735809,0.0006733932,0.0002088706,0.0001774491,0.0001100974,0.0004760856,0.0000637975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657431,"about_ca_system_score_gemma":0.00004430884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004714151,"about_ca_topic_score_gemma":0.00009503422,"domain_scores_codex":[0.99787,0.0001690559,0.0005017125,0.0001993716,0.0006704552,0.0005894399],"domain_scores_gemma":[0.9985766,0.0003020209,0.00003414927,0.0004118716,0.0005156363,0.0001596995],"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.00003300818,0.0006106104,0.003639718,0.0002050458,0.0001646885,0.000001016424,0.0042787,0.9615043,0.01235893,0.001894816,0.00008371299,0.01522542],"study_design_scores_gemma":[0.0006478056,0.00007809047,0.00257462,0.00007947412,0.00001101947,0.000003735352,0.0009345783,0.9511015,0.04425909,0.000007960673,0.0001454321,0.0001567194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9221289,0.001678059,0.07355894,0.0002950097,0.0004156941,0.001164259,0.00004625128,0.0001573462,0.0005555343],"genre_scores_gemma":[0.8467963,0.0003516263,0.151364,0.000005745211,0.0001568854,0.0001433072,0.00002901799,0.00005275123,0.00110034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07780511,"threshold_uncertainty_score":0.5587721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}