{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":133,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":133,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"06cf318476e5","filters":{"venue":"Journal of Combinatorial Optimization"}},"results":[{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","authors":[{"name":"Etienne de Klerk","is_ca":true},{"name":"Dmitrii V. Ṗasechnik","is_ca":false},{"name":"Joost P. Warners","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01223000613380427,"gpt":0.2180044899597861,"spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004712902,0.002084481,0.003425859,0.001994377,0.001620122,0.003695635,0.00573985,0.003328848,0.008145647],"category_scores_gemma":[0.02858309,0.00124251,0.001771945,0.004694732,0.002865822,0.01050966,0.004007641,0.004301536,0.001466171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003874093,"about_ca_system_score_gemma":0.00308674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005003412,"about_ca_topic_score_gemma":0.006365009,"domain_scores_codex":[0.9964935,0.001745567,0.0001622861,0.000506858,0.0007369123,0.0003548669],"domain_scores_gemma":[0.9790069,0.01536012,0.0008958541,0.002962847,0.00116262,0.0006116511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001499125,0.0003828559,0.002183439,0.0003795777,0.0001631293,0.00007483061,0.0002837303,0.6374008,0.002667702,0.1610929,0.009311582,0.1845603],"study_design_scores_gemma":[0.00005481324,0.00005638802,0.0003006271,0.00002795608,0.00003594034,0.00005012979,0.00004936893,0.8777672,0.000613706,0.1199626,0.001064422,0.00001667606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0391659,0.00155981,0.9497644,0.00113183,0.000173893,0.0001333939,0.0002001086,0.0009994453,0.006871257],"genre_scores_gemma":[0.3488642,0.001467961,0.6394535,0.0007520328,0.000320805,0.0004226658,0.000898855,0.0007315564,0.007088301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008145647,"threshold_uncertainty_score":0.02810866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128641904","doi":"10.1007/s10878-021-00699-0","title":"Designing emergency flood evacuation plans using robust optimization and artificial intelligence","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Computer science; Flood myth; Robust optimization; Operations research; Theory of computation; Emergency evacuation; Mathematical optimization; Set (abstract data type); Plan (archaeology); Engineering; Mathematics; Algorithm","authors":[{"name":"Soheyl Khalilpourazari","is_ca":true},{"name":"Seyed Hamid Reza Pasandideh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02920122571456015,"gpt":0.2539812705037813,"spread":0.2247800447892211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402567,0.001159635,0.001470319,0.001295888,0.000421556,0.001292175,0.00105138,0.001319887,0.00207988],"category_scores_gemma":[0.004406267,0.0010478,0.001290807,0.0005808887,0.0009007826,0.001255269,0.001262215,0.0009516561,0.0002191995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007573568,"about_ca_system_score_gemma":0.00118544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003681301,"about_ca_topic_score_gemma":0.002469888,"domain_scores_codex":[0.9994814,0.0001981498,0.00003373739,0.0001002518,0.0001095833,0.00007694367],"domain_scores_gemma":[0.9984988,0.001041166,0.0002023778,0.00005900571,0.0001474409,0.00005116512],"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.00001546984,0.00001524658,0.0001013425,0.00001928262,0.00001904646,0.000013455,0.000008950235,0.9933239,0.0003040736,0.001713865,0.0000963385,0.00436911],"study_design_scores_gemma":[0.000002882617,0.00001599522,0.00003012462,0.000002987348,0.000003749594,0.000002770978,0.000005642114,0.9988135,0.0001118015,0.0009321025,0.00007607976,0.000002329246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02490448,0.0001877929,0.9706935,0.0001670817,0.00003397706,0.00007717065,0.00003963602,0.0001656449,0.003730677],"genre_scores_gemma":[0.7486718,0.0002793243,0.2481128,0.00009581666,0.0000563427,0.0002256741,0.000136207,0.0001179485,0.00230419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003681301,"threshold_uncertainty_score":0.007417619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078856178","doi":"10.1007/s10878-008-9156-y","title":"The canadian traveller problem and its competitive analysis","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Theory of computation; Vertex (graph theory); Computer science; Competitive analysis; Adaptive strategies; Graph; Grid; Mathematical optimization; Shortest path problem; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Upper and lower bounds; Artificial intelligence; Geography","authors":[{"name":"Yinfeng Xu","is_ca":false},{"name":"Mao‐Lin Hu","is_ca":false},{"name":"Bing Su","is_ca":false},{"name":"Binhai Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01421972525174794,"gpt":0.2319537224110097,"spread":0.2177339971592618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038613,0.001770045,0.001769412,0.00187932,0.003194837,0.004188172,0.005376137,0.003330444,0.02318485],"category_scores_gemma":[0.01374244,0.0005178149,0.001053135,0.003437602,0.002672959,0.005057308,0.002584066,0.002989682,0.001578121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007956333,"about_ca_system_score_gemma":0.00658196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.09749472,"about_ca_topic_score_gemma":0.061604,"domain_scores_codex":[0.9970971,0.0008695553,0.0000612166,0.0004863375,0.0007224403,0.0007633748],"domain_scores_gemma":[0.9932628,0.004159508,0.000477424,0.0004033227,0.0007647344,0.0009321522],"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.0006532067,0.0003577366,0.002424945,0.0004333124,0.0001388079,0.0004272479,0.0004946652,0.2128259,0.001146364,0.690898,0.03959916,0.05060074],"study_design_scores_gemma":[0.0002050749,0.0001758111,0.001099262,0.00005724116,0.00007242049,0.0003383165,0.0003607248,0.6614684,0.0006877746,0.312147,0.02331035,0.00007758397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2314587,0.003963054,0.379301,0.01015623,0.0003470512,0.0009083451,0.00280183,0.0008041481,0.3702596],"genre_scores_gemma":[0.8960212,0.002497258,0.05991071,0.0009211478,0.0003462244,0.0005776406,0.001458446,0.000262678,0.03800478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09749472,"threshold_uncertainty_score":0.1938545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964440534","doi":"10.1023/b:joco.0000017385.39168.0d","title":"Exordium for DNA Codes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Los Alamos National Laboratory; Francis Crick Institute; Alexander von Humboldt-Stiftung; University of California Berkeley; Laboratory Directed Research and Development; U.S. Department of Energy; University of Calgary; National Science Foundation","keywords":"Generalization; Computer science; Sequence (biology); DNA; Code (set theory); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Genetics; Biology; Programming language","authors":[{"name":"A.G. D'yachkov","is_ca":false},{"name":"Péter L. Erdős","is_ca":false},{"name":"Anthony J. Macula","is_ca":false},{"name":"David C. Torney","is_ca":false},{"name":"Chang‐Shung Tung","is_ca":false},{"name":"P.A. Vilenkin","is_ca":false},{"name":"Paul S. White","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075103160510034,"gpt":0.2501131395328206,"spread":0.2393621079277203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790778,0.0005863749,0.0005797855,0.00100529,0.0009631858,0.001546086,0.001053313,0.0008301202,0.01320208],"category_scores_gemma":[0.003774264,0.000218986,0.0005880463,0.0009781375,0.00112932,0.001865525,0.002567719,0.001875265,0.003119666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006877856,"about_ca_system_score_gemma":0.0005526999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005329697,"about_ca_topic_score_gemma":0.000760949,"domain_scores_codex":[0.9993346,0.0002031702,0.00004267207,0.00009950815,0.0002212279,0.00009884503],"domain_scores_gemma":[0.9992323,0.0003190476,0.00004517627,0.0002263918,0.0001235966,0.00005352678],"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.00006338455,0.00001735755,0.0001119653,0.00005961091,0.000006070932,0.00005123461,0.00005909576,0.003226752,0.0008753205,0.9347212,0.007003559,0.05380434],"study_design_scores_gemma":[0.00001262447,0.00002130276,0.00007222642,0.00003678535,0.00000623821,0.0001052101,0.00001767119,0.02327645,0.001501915,0.9451825,0.02975767,0.000009327316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03216536,0.001943507,0.8117452,0.002346967,0.001662986,0.0001020865,0.0005378927,0.001394477,0.1481016],"genre_scores_gemma":[0.5654153,0.001867887,0.3064361,0.001757711,0.001040151,0.0004486535,0.0009463429,0.001619424,0.1204684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01320208,"threshold_uncertainty_score":0.04416531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2755780781","doi":"10.1007/s10878-012-9452-4","title":"Some variations on constrained minimum enclosing circle problem","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Theory of computation; Space (punctuation); Computational geometry; Set (abstract data type); Time complexity; Algorithm; Discrete mathematics; Computer science","authors":[{"name":"Arindam Karmakar","is_ca":false},{"name":"Sandip Das","is_ca":false},{"name":"Subhas C. Nandy","is_ca":false},{"name":"Binay Bhattacharya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01180894065111405,"gpt":0.2434845912251584,"spread":0.2316756505740444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096524,0.001248999,0.001355597,0.001275963,0.0007670091,0.001360815,0.002657721,0.002155742,0.01210434],"category_scores_gemma":[0.00490152,0.0005210919,0.001362234,0.002404414,0.00102589,0.002634075,0.002069682,0.002529283,0.001258478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008157106,"about_ca_system_score_gemma":0.0005512686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002118856,"about_ca_topic_score_gemma":0.001842251,"domain_scores_codex":[0.9990215,0.0003448752,0.00004462364,0.0002463382,0.0002800243,0.00006263472],"domain_scores_gemma":[0.9987143,0.000717708,0.00009732428,0.0001815659,0.0001961302,0.00009303998],"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.0002327705,0.0001504277,0.0005514089,0.0005815109,0.00008765514,0.0002527588,0.000224914,0.2386694,0.005251993,0.5640486,0.02550174,0.1644467],"study_design_scores_gemma":[0.00003742741,0.0001096196,0.0003806718,0.00004765857,0.00003498016,0.0002192717,0.00004307076,0.7604403,0.001745163,0.2055432,0.03135573,0.0000428666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01430541,0.001825163,0.9500133,0.0007585409,0.0004425106,0.0001195225,0.0002984713,0.0001880612,0.03204904],"genre_scores_gemma":[0.263958,0.003310427,0.6814181,0.0008423172,0.0009964352,0.0004389256,0.001145661,0.0007367133,0.04715338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01210434,"threshold_uncertainty_score":0.04049301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998169461","doi":"10.1007/s10878-008-9160-2","title":"On broadcasting in unicyclic graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Graph; Vertex (graph theory); Combinatorics; Time complexity; Broadcasting (networking); Connectivity; Theory of computation; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Edward Maraachlian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01514791040988392,"gpt":0.2288880742478951,"spread":0.2137401638380112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438098,0.001177637,0.002047893,0.003009289,0.001861072,0.002536265,0.002550341,0.001883309,0.01190234],"category_scores_gemma":[0.01695005,0.0009537062,0.0008169338,0.005267656,0.00291066,0.00467297,0.0024683,0.002217126,0.0009083386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002905407,"about_ca_system_score_gemma":0.001321931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006908836,"about_ca_topic_score_gemma":0.006723995,"domain_scores_codex":[0.9991401,0.0003471935,0.00003071579,0.0001123211,0.0001896009,0.0001800195],"domain_scores_gemma":[0.9817429,0.01463108,0.001170893,0.0006536633,0.001037631,0.0007638947],"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.0004995351,0.0001465713,0.001532546,0.0007242409,0.00008852935,0.0002912974,0.0008194649,0.1277523,0.002800185,0.7798151,0.033595,0.05193517],"study_design_scores_gemma":[0.0001081301,0.0000768757,0.000702604,0.0001443866,0.00008588103,0.0001873908,0.000267571,0.1854379,0.0006417789,0.8048251,0.007483989,0.00003843611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4219412,0.01795612,0.3569123,0.01404625,0.001750183,0.0002669661,0.001443005,0.0007005624,0.1849834],"genre_scores_gemma":[0.8798357,0.01917065,0.03451399,0.001663232,0.002443158,0.00035129,0.001108809,0.0004989873,0.06041416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01190234,"threshold_uncertainty_score":0.03981727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043815754","doi":"10.1007/s10878-013-9634-8","title":"An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Competitive analysis; Randomized algorithm; Theory of computation; Disjoint sets; Online algorithm; Shortest path problem; Computer science; Node (physics); Graph; Combinatorics; Path (computing); Algorithm; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Artificial intelligence; Computer network","authors":[{"name":"Marco Bender","is_ca":false},{"name":"Stephan Westphal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01434579864123511,"gpt":0.2585192954949509,"spread":0.2441734968537158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611617,0.003043783,0.004240959,0.002241432,0.003483916,0.004092182,0.008950352,0.004984265,0.03419734],"category_scores_gemma":[0.007063992,0.001581797,0.001963502,0.003773784,0.002189449,0.006294255,0.004383666,0.003843785,0.004010078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007102969,"about_ca_system_score_gemma":0.01557092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.07809363,"about_ca_topic_score_gemma":0.1136943,"domain_scores_codex":[0.9977384,0.000441802,0.00008501046,0.0007772253,0.0003089671,0.0006485788],"domain_scores_gemma":[0.9955893,0.00251052,0.0002673373,0.0005688648,0.0003860119,0.0006780699],"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.00246409,0.001652251,0.002139628,0.001064835,0.0002558806,0.0003690659,0.0004647148,0.6432492,0.003365465,0.06828017,0.09744879,0.1792459],"study_design_scores_gemma":[0.0007145631,0.0001955137,0.0004937129,0.00005570056,0.00008055361,0.0001335437,0.0003332098,0.9432073,0.0009839021,0.04823056,0.005505507,0.00006592539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2195997,0.001707649,0.6645606,0.007444151,0.0009075918,0.0038111,0.009539356,0.009468022,0.08296183],"genre_scores_gemma":[0.4281222,0.0005730549,0.5331843,0.0009258587,0.0002003498,0.00126595,0.008317052,0.001011712,0.02639958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07809363,"threshold_uncertainty_score":0.1552782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1917899534","doi":"10.1007/s10878-015-9947-x","title":"Reconfiguration of dominating sets","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Connected dominating set; Graph; Domination analysis; Control reconfiguration; Discrete mathematics; Adjacency list; Computer science","authors":[{"name":"Akira Suzuki","is_ca":false},{"name":"Amer E. Mouawad","is_ca":true},{"name":"Naomi Nishimura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02884581217723134,"gpt":0.3039958334775957,"spread":0.2751500213003644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004812002,0.0007644034,0.001054064,0.001289206,0.001221106,0.002602236,0.00128192,0.0007821326,0.01097691],"category_scores_gemma":[0.003372509,0.0006938404,0.0008667888,0.001294004,0.0009191455,0.002588122,0.001739878,0.001239198,0.001269733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166124,"about_ca_system_score_gemma":0.0004773635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007685939,"about_ca_topic_score_gemma":0.0009559473,"domain_scores_codex":[0.9991673,0.0001738697,0.00004870095,0.0002501827,0.0001357669,0.0002240853],"domain_scores_gemma":[0.997801,0.0007433899,0.0001861707,0.0006467837,0.0002145134,0.0004081946],"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.001663073,0.0005454972,0.003006073,0.0007459339,0.0002300304,0.001332687,0.00101529,0.1739703,0.06859709,0.4704082,0.03240664,0.2460792],"study_design_scores_gemma":[0.0001748016,0.0003679197,0.003602398,0.00008531866,0.0001255834,0.001476199,0.0007838272,0.2883151,0.02126303,0.6445673,0.03916143,0.00007700727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6075501,0.001656986,0.2441006,0.001659583,0.0007872756,0.0003444348,0.001437887,0.002116708,0.1403463],"genre_scores_gemma":[0.9375559,0.0004992761,0.04335409,0.0002571071,0.000152839,0.00009944089,0.001204491,0.0002920231,0.01658491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01097691,"threshold_uncertainty_score":0.03672141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976269048","doi":"10.1007/s10878-009-9270-5","title":"Just-in-time scheduling with controllable processing times on parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Theory of computation; Computer science; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Algorithm","authors":[{"name":"Yaron Leyvand","is_ca":false},{"name":"Dvir Shabtay","is_ca":false},{"name":"George Steiner","is_ca":true},{"name":"Liron Yedidsion","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005926028021514501,"gpt":0.2206826583498893,"spread":0.2147566303283747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00225728,0.001338736,0.002165024,0.0005545933,0.0009310822,0.001670686,0.002547164,0.0009553172,0.002797708],"category_scores_gemma":[0.009062148,0.001112137,0.000723909,0.001279313,0.001411792,0.003081223,0.001577661,0.001604305,0.0003645367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007686664,"about_ca_system_score_gemma":0.00140664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001250919,"about_ca_topic_score_gemma":0.001628713,"domain_scores_codex":[0.9982756,0.0007618301,0.00009108622,0.0002400134,0.000289302,0.0003422377],"domain_scores_gemma":[0.9941598,0.003326863,0.00050815,0.0008920322,0.0006622654,0.0004508911],"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.001602056,0.0002269218,0.0007201605,0.0003342788,0.0001085322,0.0003781129,0.0001893357,0.8249596,0.009251654,0.1272645,0.003035427,0.03192935],"study_design_scores_gemma":[0.00009454702,0.0001277517,0.0001190925,0.000005132969,0.00002105079,0.00003595036,0.00001334517,0.9348574,0.00137081,0.06270495,0.0006325337,0.00001751332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1104168,0.0003839355,0.8824247,0.0005266821,0.0003297315,0.0001251674,0.00009301861,0.000571147,0.005128887],"genre_scores_gemma":[0.8605267,0.0003332995,0.1347184,0.0001299189,0.000271463,0.0001819502,0.000139441,0.0002565336,0.003442328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002797708,"threshold_uncertainty_score":0.01193774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2435530825","doi":"10.1007/s10878-016-0044-6","title":"Approximation algorithms for precedence-constrained identical machine scheduling with rejection","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Rounding; Submodular set function; Computer science; Job shop scheduling; Scheduling (production processes); Approximation algorithm; Mathematical optimization; Linear programming; Algorithm; Mathematics","authors":[{"name":"Xianzhao Zhang","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Chenchen Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0116746661865757,"gpt":0.2380949645483972,"spread":0.2264202983618215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004162685,0.00157222,0.002654426,0.00113366,0.001094675,0.002496242,0.004199764,0.002309225,0.005501045],"category_scores_gemma":[0.01635395,0.001221212,0.001273243,0.0026155,0.001288945,0.003076579,0.002201891,0.003240513,0.0009378171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002424743,"about_ca_system_score_gemma":0.003250166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008353317,"about_ca_topic_score_gemma":0.007499999,"domain_scores_codex":[0.9977296,0.001126314,0.0001073353,0.0002557065,0.000407,0.0003741442],"domain_scores_gemma":[0.9914016,0.006421087,0.0005768789,0.0006856927,0.0005349751,0.0003797103],"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.0004417791,0.0001881857,0.0003911827,0.0001127867,0.0000522798,0.00004390828,0.00007434398,0.932842,0.0004380779,0.02202791,0.003257736,0.04012975],"study_design_scores_gemma":[0.00003692944,0.00002613822,0.00003142616,0.00000684252,0.000008003638,0.00001064364,0.00001151327,0.9883993,0.00009213279,0.01110107,0.0002719605,0.000003947462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01631788,0.0006615723,0.9779417,0.0004471402,0.0001429537,0.00008681633,0.00009655052,0.0004361743,0.003869311],"genre_scores_gemma":[0.4757552,0.0007688925,0.5153508,0.0004358807,0.0002426016,0.0003460961,0.0006014797,0.0003671145,0.006131774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008353317,"threshold_uncertainty_score":0.02201462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017143580","doi":"10.1007/s10878-011-9386-2","title":"Some results on the injective chromatic number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Injective function; Combinatorics; Mathematics; Chromatic scale; Graph; Vertex (graph theory); Monomorphism; Edge coloring; Brooks' theorem; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Min Chen","is_ca":false},{"name":"Geňa Hahn","is_ca":true},{"name":"André Raspaud","is_ca":false},{"name":"Weifan Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0255321798051334,"gpt":0.2815818603931285,"spread":0.2560496805879951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244916,0.001946329,0.001117348,0.006613412,0.002282888,0.00471,0.003762104,0.001615598,0.01607489],"category_scores_gemma":[0.0138107,0.001131299,0.001600392,0.005980424,0.005763287,0.008120798,0.003057234,0.005240348,0.0009495015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003551176,"about_ca_system_score_gemma":0.001248719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003317111,"about_ca_topic_score_gemma":0.004340785,"domain_scores_codex":[0.9988527,0.0002706701,0.0000549703,0.0003003222,0.0002934702,0.0002277508],"domain_scores_gemma":[0.9828396,0.01288353,0.001149739,0.00103075,0.0008264392,0.001269917],"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.0003676536,0.0001728206,0.004338924,0.0005193186,0.00009556241,0.0001735032,0.000722402,0.02737867,0.00386702,0.9216374,0.01005924,0.03066757],"study_design_scores_gemma":[0.00006587299,0.00007380184,0.00347011,0.0001117351,0.0001092564,0.000179175,0.0002771397,0.03713176,0.001960408,0.9496031,0.006953128,0.00006449241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4746709,0.01056483,0.1843619,0.007803585,0.001028466,0.0001433126,0.001835879,0.0006396904,0.3189514],"genre_scores_gemma":[0.9326534,0.006412795,0.0282166,0.001055982,0.00175851,0.0001957459,0.001390976,0.0004171324,0.02789882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01607489,"threshold_uncertainty_score":0.05377591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104070086","doi":"10.1007/s10878-012-9462-2","title":"Finding paths with minimum shared edges","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Disjoint sets; Heuristics; Theory of computation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Graph; Maximum flow problem; Constant (computer programming); Discrete mathematics; Computer science; Algorithm; Mathematical optimization","authors":[{"name":"Masoud T. Omran","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true},{"name":"Hamid Zarrabi-Zadeh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02160757127980269,"gpt":0.2802607690312165,"spread":0.2586531977514138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009426388,0.001624222,0.001879303,0.002389655,0.002027249,0.00182415,0.002970705,0.002933947,0.0156951],"category_scores_gemma":[0.01055251,0.001464575,0.001621151,0.002707223,0.001089153,0.005226925,0.003250146,0.002083287,0.001776528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009910672,"about_ca_system_score_gemma":0.002055144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001110887,"about_ca_topic_score_gemma":0.002438142,"domain_scores_codex":[0.9988311,0.0003327129,0.00006580009,0.0003747871,0.0001779834,0.000217589],"domain_scores_gemma":[0.9939507,0.003724103,0.0005989534,0.0007356146,0.0005010341,0.0004894935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004305201,0.001975148,0.01093813,0.003136483,0.0007570296,0.001331872,0.001533242,0.2982928,0.03552224,0.1376489,0.03164267,0.4729165],"study_design_scores_gemma":[0.0008399746,0.001343069,0.003674329,0.0003749322,0.0004342965,0.001083638,0.001821943,0.5056438,0.01895169,0.4531539,0.01259301,0.00008543588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5900702,0.0007727424,0.3797665,0.00186809,0.0002052412,0.0008572864,0.003273414,0.001289505,0.02189704],"genre_scores_gemma":[0.5507021,0.0004119109,0.4353097,0.0002167801,0.00006640264,0.0005405225,0.003033357,0.0004971097,0.009222184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0156951,"threshold_uncertainty_score":0.05250531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908273849","doi":"10.1007/s10878-018-00372-z","title":"An improved approximation algorithm for the minimum 3-path partition problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Approximation algorithm; Disjoint sets; Partition (number theory); Partition problem; Vertex cover; Theory of computation; Vertex (graph theory); Set cover problem; Discrete mathematics; Graph; Algorithm; Set (abstract data type); Computer science","authors":[{"name":"Yong Chen","is_ca":false},{"name":"Randy Goebel","is_ca":true},{"name":"Guohui Lin","is_ca":true},{"name":"Bing Su","is_ca":false},{"name":"Yao Xu","is_ca":true},{"name":"An Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01381954223386258,"gpt":0.2585072634341832,"spread":0.2446877212003206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095156,0.001904321,0.002415342,0.001951399,0.001292638,0.002563009,0.004551685,0.002514564,0.01360954],"category_scores_gemma":[0.005447556,0.0009171753,0.001657647,0.00350954,0.0007966308,0.004201587,0.002943637,0.003244803,0.002609076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002583619,"about_ca_system_score_gemma":0.003854671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007412937,"about_ca_topic_score_gemma":0.01091333,"domain_scores_codex":[0.9986351,0.0002642126,0.00006988783,0.00031703,0.000420281,0.0002934675],"domain_scores_gemma":[0.9978718,0.001066735,0.0001378943,0.0004764489,0.0002746227,0.0001725169],"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.001625833,0.001022303,0.001910647,0.0006051971,0.0001952992,0.0002408361,0.0003518948,0.3959942,0.008471934,0.03935502,0.03520943,0.5150174],"study_design_scores_gemma":[0.0002719761,0.0001354779,0.0004110608,0.000030766,0.0000573941,0.0001510654,0.00008032042,0.9662437,0.001333506,0.02714484,0.004117276,0.00002264479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06413227,0.001140345,0.9122375,0.001270187,0.0003893454,0.0005140658,0.001068733,0.003606396,0.01564115],"genre_scores_gemma":[0.1757721,0.0004183947,0.8145596,0.0003788037,0.0001716926,0.0004991542,0.002340615,0.0004185284,0.005441273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01360954,"threshold_uncertainty_score":0.04552841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014859375","doi":"10.1023/b:joco.0000031419.12290.2b","title":"A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Sorting; Combinatorics; Approximation algorithm; Theory of computation; Mathematics; Graph; Decomposition; Discrete mathematics; Breakpoint; Computer science; Algorithm","authors":[{"name":"Guohui Lin","is_ca":true},{"name":"Tao Jiang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005139858459938569,"gpt":0.2396506692138155,"spread":0.234510810753877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835286,0.002058476,0.001870903,0.001812038,0.0009341363,0.002277888,0.003533862,0.002099926,0.02465849],"category_scores_gemma":[0.004512328,0.0008363576,0.001900876,0.002967595,0.0007975712,0.004084563,0.002987926,0.004214315,0.005721136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001761664,"about_ca_system_score_gemma":0.002290633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00562571,"about_ca_topic_score_gemma":0.009707372,"domain_scores_codex":[0.9986626,0.0002321796,0.00006234058,0.0003825053,0.0004211018,0.000239273],"domain_scores_gemma":[0.998147,0.0005411524,0.00009692341,0.0007265469,0.0003148064,0.0001734748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001079046,0.0008381252,0.001054949,0.0003829006,0.0001590361,0.0002093941,0.0002328065,0.1664081,0.02272631,0.03968082,0.04315171,0.7240767],"study_design_scores_gemma":[0.000357334,0.0001788483,0.0004594168,0.00003036748,0.00008894288,0.0002219999,0.00009020475,0.9271454,0.00706636,0.04734907,0.01697514,0.00003690124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01519626,0.0002314358,0.9728041,0.000603736,0.0002611783,0.0002583187,0.0005154668,0.003786531,0.006342985],"genre_scores_gemma":[0.05959817,0.0001114094,0.9305581,0.0002965373,0.00009142265,0.0002586143,0.001549512,0.0005694881,0.006966836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02465849,"threshold_uncertainty_score":0.08249092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143633463","doi":"10.1007/s10878-014-9712-6","title":"Zero-visibility cops and robber and the pathwidth of a graph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Bounded function; Monotonic function; Visibility; Theory of computation; Pathwidth; Mathematics; Zero (linguistics); Discrete mathematics; Visibility graph; Graph; Combinatorics; Line graph; Algorithm; Mathematical analysis; Physics","authors":[{"name":"Dariusz Dereniowski","is_ca":false},{"name":"Danny Dyer","is_ca":true},{"name":"Ryan M. Tifenbach","is_ca":true},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006789592392098764,"gpt":0.2429313883482507,"spread":0.2361417959561519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002337,0.001189159,0.001979514,0.003130929,0.001843075,0.003816914,0.003818613,0.002372701,0.01028044],"category_scores_gemma":[0.02088752,0.001626751,0.001083214,0.002681533,0.004449815,0.01097514,0.00279238,0.002956143,0.0006797111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001405979,"about_ca_system_score_gemma":0.001053801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00269959,"about_ca_topic_score_gemma":0.002273907,"domain_scores_codex":[0.9985454,0.0005121497,0.00006138696,0.0003045523,0.0002792424,0.0002971874],"domain_scores_gemma":[0.978228,0.01642622,0.0023325,0.0009097608,0.0007340569,0.001369413],"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.0004811454,0.0002071938,0.004264471,0.0003903177,0.000150466,0.0003668887,0.0008765188,0.07313732,0.002789015,0.8834041,0.008680193,0.02525236],"study_design_scores_gemma":[0.0000627383,0.00006122333,0.001399041,0.00009172305,0.00005370694,0.000316181,0.0003418173,0.1076396,0.0007252356,0.8864123,0.002860326,0.00003607887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7234905,0.004219768,0.219253,0.005356306,0.0002643761,0.0001109885,0.001083049,0.0003821228,0.04583994],"genre_scores_gemma":[0.9523639,0.002346226,0.03467258,0.0004638952,0.0003786065,0.0001404247,0.000549625,0.000223562,0.008861207],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01028044,"threshold_uncertainty_score":0.03439146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977507713","doi":"10.1007/s10878-007-9106-0","title":"Lower bounds and a tabu search algorithm for the minimum deficiency problem","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Theory of computation; Tabu search; Graph; Graph coloring; Edge coloring; Neighbourhood (mathematics); Discrete mathematics; Algorithm; Graph power; Line graph","authors":[{"name":"Mathieu Bouchard","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Guy Desaulniers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375133543579926,"gpt":0.2907933059047155,"spread":0.2770419704689163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00280191,0.001573508,0.001659615,0.002642847,0.001291467,0.003546089,0.002794055,0.002572587,0.01383881],"category_scores_gemma":[0.02103256,0.0009458388,0.001080679,0.002969294,0.001578911,0.003285679,0.001916695,0.003418273,0.002012081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161776,"about_ca_system_score_gemma":0.002251155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003618048,"about_ca_topic_score_gemma":0.004260957,"domain_scores_codex":[0.9982721,0.0006973692,0.00007089401,0.0001910791,0.0005416803,0.0002268941],"domain_scores_gemma":[0.9915793,0.006286535,0.0003297918,0.0007306535,0.0008668545,0.0002068878],"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.001155396,0.0005334638,0.001419672,0.0003727566,0.00008670417,0.00008565343,0.0002307112,0.6272544,0.003268048,0.112613,0.01994006,0.2330402],"study_design_scores_gemma":[0.0001315475,0.0000866929,0.0002147039,0.00005673176,0.00002137047,0.00004476806,0.0000383572,0.9256779,0.0006932708,0.07069474,0.00232228,0.00001763579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06201036,0.001810464,0.9033445,0.002158985,0.0004226876,0.0002712964,0.0007265962,0.001668011,0.02758714],"genre_scores_gemma":[0.252735,0.0006799999,0.7356752,0.0005315056,0.0002470422,0.0005371479,0.001413698,0.0007328331,0.007447602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01383881,"threshold_uncertainty_score":0.0462954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048232458","doi":"10.1007/s10878-013-9630-z","title":"Snakes, coils, and single-track circuit codes with spread $$k$$ k","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Backtracking; Hypercube; Combinatorics; Path (computing); Generalization; Theory of computation; Algorithm; Track (disk drive); Mathematics; Computer science; Discrete mathematics; Mathematical analysis","authors":[{"name":"Simon Hood","is_ca":true},{"name":"Daniel Recoskie","is_ca":true},{"name":"Joe Sawada","is_ca":true},{"name":"Dennis Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01325903371285218,"gpt":0.201548607443708,"spread":0.1882895737308558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718519,0.0004774395,0.0005830842,0.0009689014,0.0006063888,0.001231642,0.0009532456,0.001773481,0.004257392],"category_scores_gemma":[0.006296939,0.0004979337,0.0005781402,0.000854989,0.002344402,0.001989137,0.001326245,0.001278747,0.0005082568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007631344,"about_ca_system_score_gemma":0.0005984494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001051513,"about_ca_topic_score_gemma":0.0009754564,"domain_scores_codex":[0.9996582,0.0001043983,0.00001345807,0.00006401058,0.00009907876,0.00006089019],"domain_scores_gemma":[0.9968425,0.001976326,0.0004176344,0.000244841,0.0003080163,0.0002106949],"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.0002296477,0.00003677491,0.0009419673,0.00007399265,0.00003741863,0.0001687199,0.0001112653,0.216981,0.004430865,0.7576758,0.001665448,0.0176471],"study_design_scores_gemma":[0.00003893845,0.00007000426,0.0003372116,0.00002203032,0.00001656228,0.000177163,0.00004696749,0.4596682,0.001280523,0.5370644,0.001249934,0.00002802418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.296441,0.0007936565,0.6786677,0.001307658,0.0001308927,0.00005156044,0.0001358924,0.0003000983,0.02217155],"genre_scores_gemma":[0.9400406,0.0004704068,0.04488834,0.0002100509,0.00008364944,0.00006860058,0.00009062792,0.00007122232,0.0140765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004257392,"threshold_uncertainty_score":0.01424235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081776044","doi":"10.1007/s10878-008-9142-4","title":"Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Satisfiability; Cardinality (data modeling); Propositional formula; Computer science; Theory of computation; Propositional calculus; Boolean satisfiability problem; Algorithm; Propositional variable; Theoretical computer science; Mathematics; Discrete mathematics; Mathematical optimization","authors":[{"name":"Christian Desrosiers","is_ca":true},{"name":"Philippe Galinier","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Sandrine Paroz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05335867939472368,"gpt":0.3008953051668395,"spread":0.2475366257721159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002460522,0.001683992,0.001645102,0.003354218,0.001338565,0.00217484,0.002359164,0.001473362,0.005873346],"category_scores_gemma":[0.01496245,0.001571294,0.002338869,0.002334322,0.001685129,0.003080218,0.001747129,0.002758304,0.0006044881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001825659,"about_ca_system_score_gemma":0.00351849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007764929,"about_ca_topic_score_gemma":0.01700702,"domain_scores_codex":[0.9982474,0.0006960629,0.0001422054,0.0002997392,0.0003308117,0.0002838233],"domain_scores_gemma":[0.9882987,0.009834387,0.0004716779,0.0005603894,0.0006570657,0.0001777581],"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.001440876,0.001277864,0.008487594,0.001353523,0.0004397165,0.0009597827,0.0009799325,0.4325517,0.01554515,0.06354022,0.01316659,0.4602571],"study_design_scores_gemma":[0.000312097,0.0002297729,0.0008544215,0.000175622,0.0002846668,0.0001760318,0.000582113,0.8892115,0.01090407,0.09442185,0.002798204,0.0000496816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.204051,0.0009560402,0.7802666,0.001159279,0.0001600752,0.001048828,0.0009444029,0.002899953,0.00851371],"genre_scores_gemma":[0.2979417,0.0003494256,0.6965139,0.0003909975,0.00004526319,0.0003284867,0.002079788,0.0004165093,0.001933975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007764929,"threshold_uncertainty_score":0.01964831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513559281","doi":"10.1007/s10878-016-0079-8","title":"On the online multi-agent O–D k-Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Disjoint sets; Computer science; Focus (optics); Theory of computation; Graph; A priori and a posteriori; Enhanced Data Rates for GSM Evolution; Node (physics); Competitive analysis; Combinatorics; Theoretical computer science; Mathematics; Upper and lower bounds; Artificial intelligence; Algorithm","authors":[{"name":"Davood Shiri","is_ca":false},{"name":"F. Sibel Salman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02635618243659009,"gpt":0.2547440991462963,"spread":0.2283879167097062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095231,0.002352049,0.004352696,0.001465586,0.003112721,0.003578861,0.005378807,0.006400881,0.01676806],"category_scores_gemma":[0.008202987,0.001057085,0.0014545,0.003170104,0.0025799,0.004710668,0.003690878,0.002783921,0.00102292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005546247,"about_ca_system_score_gemma":0.006119312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1330462,"about_ca_topic_score_gemma":0.09470004,"domain_scores_codex":[0.9984591,0.0005384626,0.00005612814,0.0003411137,0.0001447163,0.0004603775],"domain_scores_gemma":[0.9957905,0.002612965,0.0003090379,0.0002441384,0.0002963302,0.0007471284],"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.001099902,0.0003395347,0.001455477,0.0004271207,0.0001875722,0.0004808959,0.0002423749,0.865299,0.0004343379,0.08614002,0.02349453,0.02039907],"study_design_scores_gemma":[0.0001696119,0.0001185022,0.0003641131,0.00004078769,0.0000545936,0.00007999387,0.0002607363,0.9544687,0.0001640044,0.0402975,0.003939384,0.00004203001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3916399,0.004299483,0.4707976,0.01121432,0.0008242357,0.001340207,0.005276953,0.0008997014,0.1137076],"genre_scores_gemma":[0.8844002,0.001400997,0.07497565,0.0007949595,0.0002268226,0.0003780269,0.002029651,0.0002649321,0.03552888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1330462,"threshold_uncertainty_score":0.2645436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313887027","doi":"10.1007/s10878-022-00984-6","title":"RETRACTED ARTICLE: The mechanism and test of the impact of environmental regulation and technological innovation on high quality development","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Energy, Environment, Economic Growth","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":true,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Anhui Office of Philosophy and Social Science; Federation for the Humanities and Social Sciences","keywords":"Quality (philosophy); Promotion (chess); Environmental quality; Investment (military); Technological change; Business; Industrial organization; Mechanism (biology); Economics; Environmental regulation; Economic system; Natural resource economics; Ecology; Macroeconomics","authors":[{"name":"Xiao-Hong Shi","is_ca":false},{"name":"Li Han","is_ca":false},{"name":"Zejiong Zhou","is_ca":false}],"retraction":{"nature":"Retraction","openalex_flagged":true},"screen_n_in":null,"score":{"opus":0.01901661426576699,"gpt":0.2200048598094042,"spread":0.2009882455436372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00580739,0.000877044,0.001716134,0.001638097,0.002112603,0.004300893,0.00404147,0.009406661,0.02683007],"category_scores_gemma":[0.05749156,0.0004799551,0.001395052,0.001724507,0.002609913,0.002414631,0.001647548,0.007835648,0.007315586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003564988,"about_ca_system_score_gemma":0.003498124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00870305,"about_ca_topic_score_gemma":0.007319542,"domain_scores_codex":[0.9963228,0.0008816459,0.000382217,0.0007368784,0.001349341,0.0003272288],"domain_scores_gemma":[0.9438806,0.03110508,0.001751737,0.003257308,0.01803192,0.001973335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"observational","study_design_scores_codex":[0.000275535,0.0001235257,0.001229762,0.0002296968,0.0001203236,0.0006505923,0.0001260101,0.000833296,0.0004410025,0.022297,0.9575838,0.01608935],"study_design_scores_gemma":[0.0005198991,0.0004810788,0.02023261,0.0007464398,0.0007337045,0.001575835,0.0006978649,0.02059253,0.005005673,0.1431567,0.8059529,0.0003047243],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.01041642,0.003159299,0.008558072,0.5056974,0.4525793,0.00007186244,0.00326363,0.0005430369,0.01571095],"genre_scores_gemma":[0.2977204,0.007502636,0.01152084,0.1737567,0.3418436,0.0002792642,0.003536008,0.001064331,0.1627762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02683007,"threshold_uncertainty_score":0.08975554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360978753","doi":"10.1007/s10878-023-01002-z","title":"An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Augmented Lagrangian method; Theory of computation; Mathematical optimization; Nonlinear system; Computer science; Nonlinear programming; Lagrange multiplier; Minification; Scale (ratio); Lagrangian relaxation; Mathematics; Algorithm","authors":[{"name":"Abolfazl Gharaei","is_ca":true},{"name":"Alireza Amjadian","is_ca":false},{"name":"Ali Shavandi","is_ca":false},{"name":"Amir Amjadian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01169545611259706,"gpt":0.2239217104963334,"spread":0.2122262543837363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415757,0.001277218,0.001739832,0.0008380609,0.0006394553,0.001523355,0.001680905,0.001623459,0.003547951],"category_scores_gemma":[0.002991013,0.001107542,0.001280206,0.001107824,0.0008855116,0.001468801,0.001734747,0.002025688,0.0004441983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008072551,"about_ca_system_score_gemma":0.002022585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01297838,"about_ca_topic_score_gemma":0.01434134,"domain_scores_codex":[0.9996228,0.0001765608,0.00001738555,0.00004040898,0.00009545163,0.00004731484],"domain_scores_gemma":[0.9988294,0.0007439009,0.0000967613,0.00005950902,0.0002045255,0.00006575091],"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.000008241872,0.00001580012,0.00006459445,0.0000266026,0.00001525494,0.00002945095,0.00001049956,0.9916151,0.0001056972,0.005089036,0.0003336989,0.002686093],"study_design_scores_gemma":[0.0000022987,0.000003606392,0.00001080397,0.000002031141,0.000001589211,0.000001550954,0.000002201787,0.9988086,0.00001401917,0.001051077,0.0001008817,0.00000133108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01386634,0.0005232213,0.9787586,0.0003245299,0.0001188695,0.00007789156,0.000145875,0.0001400935,0.006044583],"genre_scores_gemma":[0.6330602,0.0008060489,0.3535166,0.0002596066,0.000216908,0.0006717558,0.0004911901,0.0002089864,0.0107687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01297838,"threshold_uncertainty_score":0.02580565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083833523","doi":"10.1007/s10878-009-9213-1","title":"An approximation algorithm for the k-level capacitated facility location problem","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; 1-center problem; Approximation algorithm; Combinatorics; Mathematics; Combinatorial optimization; Mathematical optimization; Supply chain management; Computer science; Discrete mathematics; Algorithm; Supply chain","authors":[{"name":"Donglei Du","is_ca":true},{"name":"Xing Wang","is_ca":false},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02788160282492381,"gpt":0.248890497160571,"spread":0.2210088943356472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193488,0.001465558,0.00245799,0.00124026,0.001232556,0.00306475,0.00418685,0.003045331,0.01129938],"category_scores_gemma":[0.005163473,0.001052179,0.001369646,0.003362337,0.0008569628,0.003204606,0.002579215,0.002388057,0.002226881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003284505,"about_ca_system_score_gemma":0.003992504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01252254,"about_ca_topic_score_gemma":0.01298653,"domain_scores_codex":[0.9987342,0.0003257137,0.00006910867,0.0002721404,0.000250707,0.0003482301],"domain_scores_gemma":[0.9976902,0.001351439,0.0001705383,0.0002832948,0.000294082,0.0002104401],"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.0006597613,0.0003819189,0.001061754,0.0002482767,0.00008632687,0.0001161688,0.000146215,0.8240041,0.001449854,0.01756885,0.01177301,0.1425037],"study_design_scores_gemma":[0.00009745853,0.00003684662,0.0001018338,0.00001100156,0.00001458308,0.00004109946,0.00003178974,0.9913122,0.000241329,0.007295917,0.0008059114,0.000009943755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04837492,0.0007306237,0.9329759,0.001259887,0.0001876102,0.0002566348,0.000761052,0.002290352,0.01316295],"genre_scores_gemma":[0.3161424,0.0003784118,0.6754144,0.0002929451,0.0001004481,0.0004090651,0.001494896,0.0002756685,0.005491671],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01252254,"threshold_uncertainty_score":0.03780019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049678150","doi":"10.1007/s10878-008-9149-x","title":"A quadratic lower bound for colourful simplicial depth","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Convex hull; Mathematics; Theory of computation; Regular polygon; Quadratic equation; Point (geometry); Set (abstract data type); Graph; Computer science; Geometry; Algorithm","authors":[{"name":"Tamon Stephen","is_ca":true},{"name":"Hugh Thomas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01859173484208591,"gpt":0.2602583741801576,"spread":0.2416666393380717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005129926,0.00318776,0.003466521,0.003295744,0.002566489,0.007358939,0.01048755,0.004941534,0.04504799],"category_scores_gemma":[0.03167171,0.002009835,0.002859052,0.004595532,0.005769183,0.02021315,0.01192767,0.01279962,0.006541654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006071241,"about_ca_system_score_gemma":0.003179044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00378754,"about_ca_topic_score_gemma":0.006249409,"domain_scores_codex":[0.9942287,0.0009053723,0.0001944237,0.00104476,0.002382251,0.001244526],"domain_scores_gemma":[0.9721309,0.01974414,0.0007702151,0.003996067,0.001600047,0.0017587],"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.001084538,0.0004763066,0.002319914,0.001277278,0.0001690809,0.0002381696,0.0005425233,0.09498472,0.009975777,0.7169397,0.0484207,0.1235712],"study_design_scores_gemma":[0.0001122231,0.0001299415,0.0006826937,0.0001313202,0.0001122664,0.0002336846,0.00008369338,0.2256988,0.002717768,0.7601238,0.009906936,0.00006696582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06787394,0.007024073,0.7513357,0.01473865,0.001498911,0.0003677069,0.003494462,0.002905208,0.1507613],"genre_scores_gemma":[0.6261546,0.005248858,0.2865759,0.005062791,0.002204075,0.0008681584,0.002941864,0.003184489,0.06775931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04504799,"threshold_uncertainty_score":0.1507006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012939571","doi":"10.1023/a:1009893108387","title":"Steiner k-Edge Connected Subgraph Polyhedra","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Polyhedron; Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph; Enhanced Data Rates for GSM Evolution; Computer science; Algorithm","authors":[{"name":"Mohamed Didi Biha","is_ca":true},{"name":"A. Ridha Mahjoub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008733764535961423,"gpt":0.2215240309997457,"spread":0.2127902664637843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003148282,0.0008552388,0.001233069,0.000841385,0.0009989272,0.002101521,0.002001288,0.001503606,0.01968044],"category_scores_gemma":[0.002415893,0.0008669403,0.0009903413,0.002037443,0.0009084299,0.003167948,0.001902589,0.001856201,0.002637765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007190172,"about_ca_system_score_gemma":0.0004836577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008531822,"about_ca_topic_score_gemma":0.001509938,"domain_scores_codex":[0.9993395,0.0001850037,0.00004882584,0.0001329318,0.0001792875,0.0001144051],"domain_scores_gemma":[0.9987767,0.0005279488,0.0001741158,0.0002405295,0.0001324954,0.0001481568],"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.001019196,0.0003612978,0.002553032,0.0008990962,0.0001963461,0.001041825,0.0004977406,0.2972174,0.01504164,0.5156863,0.03104883,0.1344372],"study_design_scores_gemma":[0.0001530565,0.0001448491,0.001715094,0.00009203619,0.00007374639,0.0009028873,0.0003831445,0.3822901,0.005397953,0.595248,0.01355516,0.00004404252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4538713,0.0007632834,0.4300218,0.002189368,0.0002306169,0.0003718463,0.003858921,0.0007984401,0.1078945],"genre_scores_gemma":[0.7499719,0.001007131,0.2125234,0.0004354357,0.0001020214,0.0002580373,0.00482841,0.00036077,0.03051296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01968044,"threshold_uncertainty_score":0.06583762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1537002715","doi":"10.1007/s10878-015-9951-1","title":"Almost separable matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Separable space; Cardinality (data modeling); Simple (philosophy); Theory of computation; Row; Matrix (chemical analysis); Upper and lower bounds","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03478843338879645,"gpt":0.3056192439964332,"spread":0.2708308106076368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932455,0.001744032,0.0009600327,0.001181437,0.0004606814,0.002071017,0.0009735558,0.001211774,0.01925368],"category_scores_gemma":[0.009194589,0.0005774133,0.000505046,0.001085642,0.001346859,0.002678565,0.001820263,0.002036286,0.003333056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000761599,"about_ca_system_score_gemma":0.0009002438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113691,"about_ca_topic_score_gemma":0.001217457,"domain_scores_codex":[0.9988714,0.0003912912,0.00004423195,0.0002476647,0.0003323717,0.0001131543],"domain_scores_gemma":[0.9963146,0.002058326,0.0003367927,0.0005093815,0.0005194892,0.0002614104],"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.0001651959,0.0001529232,0.0007112484,0.0002525499,0.0000972413,0.0002247605,0.00009734716,0.08445802,0.003618903,0.7707159,0.03747265,0.1020334],"study_design_scores_gemma":[0.00003533946,0.00007749902,0.0006474999,0.00004389929,0.00002191726,0.0002423879,0.00005574071,0.2424838,0.001242635,0.7435914,0.01153015,0.00002783645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05175145,0.00107023,0.863869,0.004673223,0.0004757069,0.0002193595,0.002368268,0.0004685211,0.07510413],"genre_scores_gemma":[0.6534854,0.002411365,0.2135183,0.002380762,0.001256843,0.0005111888,0.004396478,0.0004283497,0.1216113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01925368,"threshold_uncertainty_score":0.06440997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014621567","doi":"10.1007/s10878-008-9167-8","title":"Editorial, COCOON 2007 special issue","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Biotechnology and Related Fields","field":"Medicine","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Theory of computation; Mathematical economics; Computer science; Mathematics; Calculus (dental); Algorithm","authors":[{"name":"Guohui Lin","is_ca":true},{"name":"Zhipeng Cai","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006779990404217673,"gpt":0.2378446738934293,"spread":0.2310646834892116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005057596,0.003769915,0.003864389,0.003669603,0.002597114,0.006994012,0.003236864,0.01534758,0.02070744],"category_scores_gemma":[0.02126453,0.001356238,0.003074046,0.00169162,0.001683145,0.003046875,0.001514349,0.01382617,0.009247073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003289107,"about_ca_system_score_gemma":0.002070097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002222917,"about_ca_topic_score_gemma":0.006326948,"domain_scores_codex":[0.9976301,0.0003569663,0.0003662555,0.0004175752,0.0009674844,0.0002615552],"domain_scores_gemma":[0.9870675,0.004496267,0.001088709,0.0004207671,0.005162729,0.001764033],"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.0001038574,0.00001753484,0.00005884881,0.0001464093,0.00002639599,0.0001621009,0.000004149629,0.00003260315,0.00008810914,0.0001275141,0.9951972,0.004035204],"study_design_scores_gemma":[0.0002429863,0.00008466358,0.00140982,0.0003614027,0.0001553737,0.0004662487,0.00003708412,0.0005734143,0.0003153145,0.0007512601,0.9955757,0.00002680925],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00008418364,0.003677886,0.0001402986,0.03136634,0.9629822,0.00003080985,0.0000918911,0.00005263718,0.00157376],"genre_scores_gemma":[0.001038174,0.002788011,0.0002035514,0.02456067,0.9586366,0.00004157799,0.00008988464,0.0000603724,0.01258114],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02070744,"threshold_uncertainty_score":0.06927323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075485134","doi":"10.1007/s10878-010-9366-y","title":"Exact and approximation algorithms for the complementary maximal strip recovery problem","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Approximation algorithm; Combinatorics; Mathematics; Theory of computation; Algorithm; Sequence (biology); Set (abstract data type); Constant (computer programming); Running time; Discrete mathematics; Computer science","authors":[{"name":"Haitao Jiang","is_ca":false},{"name":"Zhong Li","is_ca":true},{"name":"Guohui Lin","is_ca":true},{"name":"Lusheng Wang","is_ca":false},{"name":"Binhai Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01119861558667182,"gpt":0.247467282165162,"spread":0.2362686665784902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003141514,0.001931775,0.002706698,0.001709093,0.001463483,0.003820422,0.005300638,0.003166569,0.01282826],"category_scores_gemma":[0.01290948,0.001178767,0.001716129,0.003625647,0.002232445,0.00657764,0.003791032,0.004439416,0.001626257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003113337,"about_ca_system_score_gemma":0.004551473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006814122,"about_ca_topic_score_gemma":0.009485793,"domain_scores_codex":[0.9977165,0.000691413,0.00009474464,0.0005132567,0.0005245703,0.0004594934],"domain_scores_gemma":[0.9903843,0.006982728,0.0005141954,0.00123287,0.0004995054,0.0003863002],"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.001118643,0.0008287693,0.001280338,0.0004755973,0.0001422322,0.0001212683,0.0002900911,0.6786722,0.00241862,0.1025707,0.02500933,0.1870722],"study_design_scores_gemma":[0.0001391961,0.00005567598,0.0001912374,0.00001921184,0.00003062265,0.00004901978,0.00008869007,0.9131625,0.0005756244,0.08443495,0.001237807,0.00001556613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05289122,0.0009737351,0.9285538,0.002077093,0.0001903599,0.0002593828,0.0007693301,0.001551207,0.01273395],"genre_scores_gemma":[0.2958255,0.0006312954,0.6920316,0.0004877687,0.0002440583,0.0004624571,0.001931324,0.0005621202,0.007823842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01282826,"threshold_uncertainty_score":0.04291481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2211969678","doi":"10.1007/s10878-015-9915-5","title":"Towards the price of leasing online","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Theory of computation; Order (exchange); Set cover problem; Integer programming; Online algorithm; Computer science; Integer (computer science); Randomized rounding; Operations research; Set (abstract data type); Mathematical economics; Facility location problem; Service (business); Mathematics; Combinatorics; Approximation algorithm; Economics; Algorithm; Business; Marketing; Finance","authors":[{"name":"Sebastian Abshoff","is_ca":false},{"name":"Peter Kling","is_ca":true},{"name":"Christine Markarian","is_ca":false},{"name":"Friedhelm Meyer auf der Heide","is_ca":false},{"name":"Peter Pietrzyk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04894002924072742,"gpt":0.2914331280640873,"spread":0.2424930988233598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003235945,0.0006716554,0.001533684,0.001280869,0.001564664,0.008378579,0.002742044,0.005536992,0.02852999],"category_scores_gemma":[0.03368662,0.00104345,0.0006803948,0.001702453,0.003100936,0.01731834,0.00238316,0.006656217,0.00247373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003060415,"about_ca_system_score_gemma":0.001608916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001704095,"about_ca_topic_score_gemma":0.002142117,"domain_scores_codex":[0.9977103,0.000995782,0.00006813175,0.0002785301,0.0007235568,0.0002235409],"domain_scores_gemma":[0.9880118,0.00883919,0.0005631064,0.00095598,0.001134922,0.0004949223],"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.0002063982,0.0001365245,0.0009693658,0.0001146091,0.00002522603,0.0001368866,0.0001298739,0.01876679,0.0006723924,0.9333007,0.01081001,0.03473125],"study_design_scores_gemma":[0.00003025756,0.00003768862,0.0003005316,0.00004563813,0.00001779364,0.0001216568,0.0001543126,0.1083741,0.000426061,0.8839855,0.006484353,0.00002217299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294422,0.003786582,0.4425961,0.03151706,0.001296606,0.0001441021,0.000418396,0.0005106261,0.3902883],"genre_scores_gemma":[0.9083461,0.001288976,0.0405599,0.00105891,0.0008712856,0.00007869653,0.0001192647,0.0002771111,0.04739979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02852999,"threshold_uncertainty_score":0.09544235,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085562535","doi":"10.1007/s10878-012-9475-x","title":"Coverage with k-transmitters in the presence of obstacles","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Transmitter; Cover (algebra); Combinatorics; Plane (geometry); Integer (computer science); Theory of computation; Line (geometry); Range (aeronautics); Upper and lower bounds; Mathematics; Computer science; Geometry; Telecommunications; Algorithm; Mathematical analysis","authors":[{"name":"Brad Ballinger","is_ca":false},{"name":"Nadia M. Benbernou","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Mirela Damian","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"Robin Flatland","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"John Iacono","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"Vera Sacristán","is_ca":false},{"name":"Diane L. Souvaine","is_ca":false},{"name":"Ryuhei Uehara","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008990101363827583,"gpt":0.2259723087213967,"spread":0.2169822073575691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008686805,0.0006375797,0.001323668,0.0007743775,0.0007354649,0.001269892,0.001482706,0.00176752,0.001284194],"category_scores_gemma":[0.005995815,0.0006998919,0.0006694411,0.001075205,0.001019001,0.001376663,0.002544255,0.0006440302,0.0003052258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005362797,"about_ca_system_score_gemma":0.0004180992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004209871,"about_ca_topic_score_gemma":0.002796105,"domain_scores_codex":[0.9992157,0.0002509695,0.00003243628,0.0001138099,0.0001478192,0.0002392252],"domain_scores_gemma":[0.9951408,0.003650746,0.00041188,0.0002074605,0.0002997008,0.0002894093],"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.0005569066,0.00003856455,0.003470124,0.0001142734,0.00007587857,0.0008801721,0.0001946643,0.9763485,0.003564547,0.006584318,0.0006202326,0.007551794],"study_design_scores_gemma":[0.00002573568,0.00006110028,0.0006593745,0.00001197783,0.00003193268,0.0002015651,0.0001129008,0.9935354,0.0009694391,0.004138617,0.0002385739,0.0000133844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5400754,0.001134589,0.4441809,0.000662527,0.00009353386,0.00006337212,0.0003377,0.0002496012,0.01320233],"genre_scores_gemma":[0.9817062,0.0002969011,0.01546283,0.00004516909,0.00003270923,0.00002652238,0.0001059424,0.00002200369,0.002301766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004209871,"threshold_uncertainty_score":0.008370757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042572227","doi":"10.1007/s10878-012-9541-4","title":"A lower bound of the surviving rate of a planar graph with girth at least seven","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Planar graph; Graph; Wheel graph; Mathematics; Upper and lower bounds; Girth (graph theory); Discrete mathematics; Graph power; Line graph","authors":[{"name":"Weifan Wang","is_ca":false},{"name":"Stephen Finbow","is_ca":true},{"name":"Ping Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007577310179705699,"gpt":0.2124624381415707,"spread":0.204885127961865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002973726,0.002757259,0.00287237,0.003309302,0.001581617,0.003183966,0.004635967,0.002607348,0.01153634],"category_scores_gemma":[0.02297097,0.0008622935,0.002051158,0.002283772,0.003241152,0.004393901,0.004220214,0.004619705,0.00190595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081571,"about_ca_system_score_gemma":0.001374564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001769223,"about_ca_topic_score_gemma":0.00136275,"domain_scores_codex":[0.9978564,0.000447073,0.00007515596,0.0003762076,0.0005537912,0.0006912591],"domain_scores_gemma":[0.973123,0.02049986,0.001144608,0.001950171,0.001195405,0.002086936],"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.002133728,0.0004280619,0.005902341,0.001950737,0.0004922207,0.0007716747,0.001156831,0.3996823,0.0428858,0.4227284,0.02969284,0.09217504],"study_design_scores_gemma":[0.0001427957,0.0005830629,0.003296713,0.0003564153,0.0003434269,0.001300547,0.0003804807,0.6640426,0.01400028,0.3023905,0.01295639,0.0002068672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4633107,0.01254965,0.4052979,0.007147624,0.0008704536,0.0002783143,0.003727656,0.002066283,0.1047513],"genre_scores_gemma":[0.9060344,0.005871113,0.06707083,0.0009587779,0.0007819752,0.0004631943,0.002680826,0.0008315446,0.01530724],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01153634,"threshold_uncertainty_score":0.03859288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2920974405","doi":"10.1007/s10878-019-00400-6","title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Vertex connectivity; Connectivity; Graph; Time complexity; Theory of computation; Discrete mathematics; Algorithm","authors":[{"name":"Jun Liang","is_ca":false},{"name":"Dingjun Lou","is_ca":false},{"name":"Zongrong Qin","is_ca":false},{"name":"Qinglin Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005635936552762238,"gpt":0.2127651921359911,"spread":0.2071292555832289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993067,0.0009294088,0.001073635,0.001832969,0.001255351,0.00200486,0.00265871,0.001431431,0.01036315],"category_scores_gemma":[0.005441241,0.0006657045,0.0009722169,0.002499345,0.0009324454,0.002384121,0.001755952,0.001263881,0.00145664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001755503,"about_ca_system_score_gemma":0.003259068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008002302,"about_ca_topic_score_gemma":0.0128688,"domain_scores_codex":[0.9992629,0.0001555133,0.00004110355,0.0002441671,0.0001385456,0.0001578641],"domain_scores_gemma":[0.9954788,0.002969144,0.0003629117,0.0005780803,0.0003803353,0.0002307786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00200919,0.0009323899,0.007902224,0.0007891695,0.0002372049,0.0005252197,0.0007239548,0.3183107,0.03238898,0.05733981,0.03079179,0.5480494],"study_design_scores_gemma":[0.0003340098,0.0002620513,0.00146321,0.00003984049,0.00007813888,0.0001615324,0.0002723899,0.916262,0.007666007,0.06953415,0.003887899,0.00003869129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4362527,0.0004776067,0.5317162,0.001092217,0.0001335665,0.0006718397,0.001962651,0.004337995,0.02335517],"genre_scores_gemma":[0.610814,0.0002178402,0.3782787,0.0002343046,0.00009740052,0.0002828171,0.003974466,0.0004273106,0.0056731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01036315,"threshold_uncertainty_score":0.03466821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910174849","doi":"10.1007/s10878-019-00378-1","title":"On the randomized online strategies for the k-Canadian traveler problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Combinatorics; Graph; Randomized algorithm; Computer science; Disjoint sets; Undirected graph; Node (physics); Online algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Upper and lower bounds; Mathematical optimization; Algorithm; Artificial intelligence; Physics","authors":[{"name":"Davood Shiri","is_ca":false},{"name":"F. Sibel Salman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0171038450377816,"gpt":0.2554739539877305,"spread":0.238370108949949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003792421,0.002485055,0.004881631,0.002077412,0.002623945,0.004198231,0.005940137,0.005042648,0.0200443],"category_scores_gemma":[0.01964436,0.001287684,0.001498288,0.003887902,0.003385181,0.006573819,0.003427225,0.004561169,0.001342939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007975682,"about_ca_system_score_gemma":0.01435648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.08928537,"about_ca_topic_score_gemma":0.08661059,"domain_scores_codex":[0.996999,0.001323724,0.00009537648,0.0004133267,0.0003580661,0.0008104801],"domain_scores_gemma":[0.9863641,0.01089416,0.0005071522,0.0006259109,0.000583224,0.001025552],"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.002173945,0.0008663314,0.001378202,0.0006180443,0.0002403532,0.0002217848,0.0004103286,0.6752768,0.0008659407,0.2347174,0.03875415,0.04447669],"study_design_scores_gemma":[0.0004276994,0.0001763391,0.0003781116,0.00006691589,0.00006515592,0.00005460713,0.0002027578,0.8759398,0.0002581355,0.1191121,0.003258385,0.00005994098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3199527,0.005091465,0.5131422,0.01267838,0.0008116176,0.002220024,0.00409735,0.001692123,0.1403141],"genre_scores_gemma":[0.8538904,0.002087325,0.105281,0.001453739,0.0003824896,0.0009200115,0.001974575,0.0005125487,0.03349783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08928537,"threshold_uncertainty_score":0.1775314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076264749","doi":"10.1007/s10878-010-9328-4","title":"Fast searching games on graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Discrete mathematics; Graph; Pathwidth; Quadratic equation; Chordal graph; Line graph","authors":[{"name":"Donald Stanley","is_ca":true},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01397503146299714,"gpt":0.2768316864650855,"spread":0.2628566550020884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360248,0.001036549,0.001882429,0.001550979,0.001293604,0.002757213,0.002029933,0.002361607,0.01017189],"category_scores_gemma":[0.0128458,0.0008166973,0.0009748213,0.001424289,0.001626045,0.00570995,0.00232642,0.00310037,0.0006136298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001738748,"about_ca_system_score_gemma":0.001286961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002494112,"about_ca_topic_score_gemma":0.002472194,"domain_scores_codex":[0.9990256,0.0004063543,0.00004257816,0.0001332559,0.0002287501,0.0001633656],"domain_scores_gemma":[0.989965,0.007759298,0.0004537053,0.0006070391,0.0004838561,0.0007310655],"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.0004851912,0.0001819371,0.0005635393,0.0002085187,0.00006725987,0.0001066407,0.0002263585,0.1765244,0.002599756,0.7816538,0.01066641,0.02671624],"study_design_scores_gemma":[0.000108257,0.00006577974,0.0001599867,0.00001559841,0.00001788195,0.00004854736,0.00004952178,0.4273193,0.000385451,0.5703964,0.001419061,0.00001410323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4039993,0.001275571,0.5194935,0.004494444,0.0003746586,0.0003871104,0.000675253,0.0008923929,0.06840781],"genre_scores_gemma":[0.874337,0.0007028835,0.09511961,0.0004162433,0.0001522993,0.0002957671,0.0005016794,0.0002383003,0.02823632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01017189,"threshold_uncertainty_score":0.03402835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074049387","doi":"10.1007/s10878-006-9625-0","title":"Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Theory of computation; Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic equation; Quadratic programming; Discrete mathematics; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Geometry","authors":[{"name":"Eranda Çela","is_ca":false},{"name":"Bettina Klinz","is_ca":false},{"name":"Christophe Meyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02051957195072803,"gpt":0.2957860368845196,"spread":0.2752664649337916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403125,0.001390966,0.001496185,0.0008847522,0.001055936,0.004066969,0.001887142,0.002780897,0.0190943],"category_scores_gemma":[0.0111462,0.0006151332,0.0008053205,0.001457489,0.001991113,0.002892352,0.001836889,0.003348424,0.001221961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001287972,"about_ca_system_score_gemma":0.001571313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307436,"about_ca_topic_score_gemma":0.004293397,"domain_scores_codex":[0.9981925,0.0005574254,0.00006791854,0.0003246684,0.0003838241,0.0004735746],"domain_scores_gemma":[0.994521,0.004180003,0.0004896494,0.0002680245,0.0002970869,0.0002442189],"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.001015171,0.0005030878,0.001125564,0.0009448744,0.00010543,0.001390389,0.0003051257,0.2105785,0.00229964,0.6872329,0.03666012,0.05783914],"study_design_scores_gemma":[0.0002171646,0.0001166365,0.0005246623,0.00005168413,0.0000298128,0.0003887698,0.0002110365,0.3706619,0.001351905,0.621667,0.004726389,0.00005297895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.293089,0.00232674,0.445978,0.00744808,0.0006987464,0.0003521889,0.002964152,0.0008495548,0.2462935],"genre_scores_gemma":[0.8961638,0.0006898076,0.06653365,0.0004737415,0.000614258,0.0001910403,0.001358166,0.0003082536,0.03366738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190943,"threshold_uncertainty_score":0.06387675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3162151920","doi":"10.1007/s10878-021-00755-9","title":"A two-machine no-wait flow shop problem with two competing agents","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Job shop scheduling; Theory of computation; Computer science; Flow shop scheduling; Tabu search; Mathematical optimization; Scheduling (production processes); Branch and bound; Upper and lower bounds; Constraint (computer-aided design); Heuristic; Algorithm; Mathematics; Schedule","authors":[{"name":"Abdennour Azerine","is_ca":false},{"name":"Mourad Boudhar","is_ca":false},{"name":"Djamal Rebaïne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007408698531007035,"gpt":0.2262347254713052,"spread":0.2188260269402982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002417981,0.001390939,0.003311143,0.0007067365,0.001449666,0.003022254,0.003267384,0.005039955,0.006909045],"category_scores_gemma":[0.003533651,0.001565246,0.001136102,0.001101661,0.001530345,0.002622147,0.001986364,0.00164816,0.0006022367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174534,"about_ca_system_score_gemma":0.001547952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003116885,"about_ca_topic_score_gemma":0.002591063,"domain_scores_codex":[0.997926,0.0008090915,0.00009189711,0.0004785655,0.0002567486,0.0004377695],"domain_scores_gemma":[0.9969255,0.001865974,0.0002847757,0.0001355279,0.0001836073,0.0006046511],"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.002280922,0.0006225905,0.001401836,0.0006177961,0.0002107302,0.001917088,0.0002070986,0.9357894,0.007741163,0.02953392,0.002804663,0.01687291],"study_design_scores_gemma":[0.0003033832,0.0003475095,0.0004957338,0.00001664328,0.00005383892,0.0001844151,0.00009278087,0.9849104,0.0008827647,0.01171078,0.0009635084,0.00003817249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.376415,0.001253247,0.5991632,0.002706358,0.0006135571,0.0006368221,0.0008104887,0.0003942641,0.01800696],"genre_scores_gemma":[0.9250566,0.0002658385,0.06184416,0.000202337,0.0001614988,0.0002375049,0.000227485,0.00006018843,0.01194432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006909045,"threshold_uncertainty_score":0.02311307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087455919","doi":"10.1007/s10878-008-9150-4","title":"Packing trees in communication networks","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Mathematics; Solver; Linear programming relaxation; Approximation algorithm; Multicast; Integer programming; Theory of computation; Steiner tree problem; Combinatorics; Spanning tree; Relaxation (psychology); Tree (set theory); Independent set; Block (permutation group theory); Time complexity; k-minimum spanning tree; Linear programming; Discrete mathematics; Graph; Computer science; Mathematical optimization; Algorithm; Tree structure; Binary tree; K-ary tree","authors":[{"name":"Mohamed Saad","is_ca":false},{"name":"Tamás Terlaky","is_ca":true},{"name":"Anthony Vannelli","is_ca":true},{"name":"Zhang Hu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01893529126758242,"gpt":0.2744476154568449,"spread":0.2555123241892625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868017,0.0006448624,0.001628652,0.002148994,0.001947199,0.004315784,0.001423122,0.002880592,0.009074492],"category_scores_gemma":[0.009427005,0.001377745,0.0007175892,0.004847167,0.001965798,0.004925536,0.001656569,0.002858245,0.001156831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139619,"about_ca_system_score_gemma":0.0008164817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001801864,"about_ca_topic_score_gemma":0.002201969,"domain_scores_codex":[0.9990993,0.0003366565,0.00004074967,0.0001235866,0.0002383796,0.0001614114],"domain_scores_gemma":[0.9943178,0.003979741,0.0005257152,0.000393747,0.000370675,0.000412373],"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.00009738487,0.00008681537,0.000696749,0.0001789256,0.00002905727,0.0001531683,0.0003269726,0.0653239,0.0009127246,0.8865372,0.01238363,0.03327355],"study_design_scores_gemma":[0.00001454267,0.00001907761,0.0002709019,0.00002956498,0.0000156046,0.0001115173,0.00008048544,0.1116172,0.0001905213,0.8840154,0.003626352,0.000008775285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3409415,0.009277644,0.5326977,0.006629342,0.001068018,0.0001838128,0.0008573199,0.0007079088,0.1076367],"genre_scores_gemma":[0.870014,0.007276326,0.08249624,0.0009024416,0.001179805,0.0002092783,0.0008978575,0.0003589548,0.0366651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009074492,"threshold_uncertainty_score":0.03035718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2823384615","doi":"10.1007/s10878-018-0324-4","title":"Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Disjoint sets; Computer science; Graph; Online algorithm; Enhanced Data Rates for GSM Evolution; Node (physics); Combinatorics; Mathematics; Mathematical optimization; Theoretical computer science; Upper and lower bounds; Algorithm; Artificial intelligence","authors":[{"name":"Davood Shiri","is_ca":false},{"name":"F. Sibel Salman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02551466331164235,"gpt":0.2938431342376827,"spread":0.2683284709260403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006088619,0.002959153,0.00529352,0.002706825,0.00239125,0.00451467,0.00789987,0.005112553,0.02031283],"category_scores_gemma":[0.02856471,0.001516021,0.001951793,0.002868223,0.003354931,0.005467335,0.003343859,0.004488035,0.0009940545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008796894,"about_ca_system_score_gemma":0.01077484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.07467113,"about_ca_topic_score_gemma":0.05657263,"domain_scores_codex":[0.9961131,0.001646694,0.0001123062,0.0004511833,0.0005709679,0.001105778],"domain_scores_gemma":[0.9748024,0.01956749,0.001460941,0.0007185003,0.001540103,0.001910508],"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.0009363414,0.0005406626,0.001335202,0.0003842601,0.0002014515,0.0001792333,0.0002455312,0.8115847,0.0005931869,0.1602101,0.01096838,0.01282085],"study_design_scores_gemma":[0.0001045082,0.00009980486,0.000224867,0.00001962448,0.00003851506,0.00002346616,0.00008673669,0.9700702,0.00009535369,0.02843381,0.0007778276,0.00002536905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3650404,0.003450897,0.5348891,0.006134454,0.0004508779,0.001358356,0.001912385,0.00087859,0.085885],"genre_scores_gemma":[0.9390463,0.001076665,0.03526784,0.0006076004,0.0002403135,0.0005264801,0.0008832428,0.0002888441,0.02206268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07467113,"threshold_uncertainty_score":0.148473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963695813","doi":"10.1007/s10878-012-9591-7","title":"Algorithms for the minimum diameter terminal Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"University of Alberta","keywords":"Steiner tree problem; Terminal (telecommunication); Theory of computation; Combinatorics; Mathematics; Computer science; Tree (set theory); Mathematical optimization; Discrete mathematics; Algorithm; Computer network","authors":[{"name":"Wei Ding","is_ca":false},{"name":"Ke Qiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01090636629701123,"gpt":0.2224046219714752,"spread":0.211498255674464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051896,0.001207129,0.001279803,0.00152822,0.0009644483,0.002392312,0.002549418,0.001972508,0.009239484],"category_scores_gemma":[0.005473743,0.0007383293,0.00123203,0.002489115,0.0007309922,0.00400264,0.00201653,0.002243496,0.001778025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001545968,"about_ca_system_score_gemma":0.00168438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002035606,"about_ca_topic_score_gemma":0.003703957,"domain_scores_codex":[0.9993021,0.0001677365,0.00004463362,0.0001530444,0.0002195046,0.0001128586],"domain_scores_gemma":[0.9979532,0.001318972,0.0001500012,0.0002413576,0.0002309812,0.0001054195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005510004,0.0003820949,0.0009177789,0.0005082168,0.0001016477,0.0001247098,0.0002285841,0.4917251,0.003875221,0.1114107,0.02164661,0.3685282],"study_design_scores_gemma":[0.0001885847,0.00009301808,0.0002409589,0.0000546471,0.00004406573,0.0001199729,0.00008490249,0.8859146,0.001313921,0.1065331,0.00539617,0.00001596406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0228439,0.0008576805,0.9595308,0.0007479863,0.0001485606,0.0001630984,0.0003485143,0.0008929316,0.01446645],"genre_scores_gemma":[0.1533445,0.00105581,0.8363085,0.000254935,0.0001600119,0.0003047471,0.001164283,0.000354183,0.007053086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009239484,"threshold_uncertainty_score":0.03090918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1492783741","doi":"10.1023/a:1011688823715","title":"Robot Map Verification of a Graph World","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Vertex (graph theory); Robot; Traverse; Robotics; Artificial intelligence; Theory of computation; Combinatorics; Computer science; Orientation (vector space); Graph; Automation; Topology (electrical circuits); Mathematics; Algorithm; Geometry; Geography; Engineering; Cartography","authors":[{"name":"Xiaotie Deng","is_ca":true},{"name":"Evangelos Milios","is_ca":true},{"name":"Andranik Mirzaian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01678363309690364,"gpt":0.2575980775032374,"spread":0.2408144444063337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297632,0.0007157933,0.001306574,0.001197429,0.001421549,0.002676213,0.002264155,0.002174541,0.007855428],"category_scores_gemma":[0.01547231,0.0006806458,0.001590081,0.0008677102,0.002250884,0.005525802,0.00369347,0.001627795,0.0008384794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001065171,"about_ca_system_score_gemma":0.002460866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01358739,"about_ca_topic_score_gemma":0.01030153,"domain_scores_codex":[0.9983718,0.0004345143,0.0000800374,0.0003595957,0.0004431976,0.0003109635],"domain_scores_gemma":[0.9885437,0.007957978,0.0008412213,0.001227394,0.001052049,0.0003776685],"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.001900229,0.0004108762,0.007741033,0.0006255598,0.0002787551,0.002485772,0.0008124325,0.6981817,0.01536421,0.170928,0.008676792,0.09259469],"study_design_scores_gemma":[0.0000792193,0.0001009243,0.0006750209,0.00003075513,0.00003861908,0.0001156134,0.0001762905,0.8821378,0.006376453,0.1093288,0.0009113222,0.00002924207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3674423,0.00017061,0.614109,0.001664036,0.0001527221,0.0003455409,0.001174989,0.002800641,0.0121401],"genre_scores_gemma":[0.926828,0.00007520261,0.06887583,0.0001095304,0.00002596631,0.00005034565,0.0006825799,0.0002425892,0.003109952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01358739,"threshold_uncertainty_score":0.02701658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141410486","doi":"10.1007/s10878-006-9019-3","title":"On edge orienting methods for graph coloring","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Digraph; Graph coloring; Edge coloring; Tabu search; Theory of computation; Fractional coloring; Mathematics; Graph; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Algorithm; Line graph; Graph power","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Alain Hertz","is_ca":true},{"name":"Patrick St‐Louis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07129417282979277,"gpt":0.4222655733320862,"spread":0.3509714005022934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913553,0.001519788,0.001042617,0.001802962,0.0008318776,0.001338241,0.00194627,0.001048817,0.009212442],"category_scores_gemma":[0.00776491,0.0006730221,0.001266608,0.00258979,0.001277418,0.003337351,0.002166477,0.003233813,0.001597618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008857652,"about_ca_system_score_gemma":0.000860589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599907,"about_ca_topic_score_gemma":0.004694066,"domain_scores_codex":[0.999114,0.000443776,0.00003412215,0.0001229196,0.0002037525,0.00008147703],"domain_scores_gemma":[0.9964228,0.002549788,0.0001254927,0.0004525487,0.0003169304,0.0001324229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001909503,0.0002355911,0.0007154253,0.0003378542,0.00006967409,0.00006217246,0.0002371575,0.1680445,0.003947408,0.3570952,0.01438783,0.4546762],"study_design_scores_gemma":[0.00005122967,0.00005069467,0.0002533593,0.00008011564,0.00003828796,0.00004688424,0.0000646016,0.6100012,0.001215287,0.3727079,0.01546989,0.00002046126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003555619,0.0006537732,0.988481,0.0001931999,0.0001385037,0.00004021441,0.00005701933,0.0002651899,0.006615457],"genre_scores_gemma":[0.07170103,0.002019744,0.9138988,0.0004247902,0.0003486094,0.0002404289,0.0003426004,0.0008388881,0.01018522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009212442,"threshold_uncertainty_score":0.03081864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046371296","doi":"10.1023/a:1014895808844","title":"Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Relaxation (psychology); Polytope; Theory of computation; Rank (graph theory); Matrix (chemical analysis); Dimension (graph theory); Semidefinite programming; Projection (relational algebra); Discrete mathematics; Algorithm; Mathematical optimization","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01504170788102348,"gpt":0.2364874729956339,"spread":0.2214457651146104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181588,0.001521621,0.001684748,0.001772967,0.001562211,0.005609964,0.003023388,0.001978131,0.01520998],"category_scores_gemma":[0.009349895,0.001243948,0.001134741,0.001629195,0.002834921,0.00589854,0.002955604,0.005763989,0.002104748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219763,"about_ca_system_score_gemma":0.001121075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242826,"about_ca_topic_score_gemma":0.001090804,"domain_scores_codex":[0.9982444,0.0006452551,0.00006045967,0.0002736925,0.0005174647,0.0002587826],"domain_scores_gemma":[0.9954363,0.002467084,0.0007574514,0.0003339924,0.0004822921,0.0005229675],"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.00007392558,0.0000456391,0.00007209535,0.00006325114,0.00001096452,0.00003946549,0.0001309073,0.02030196,0.0005367806,0.9684844,0.004785971,0.005454659],"study_design_scores_gemma":[0.00003585059,0.00003460482,0.0001017697,0.00001651263,0.000007873738,0.00006179121,0.00006534861,0.06889521,0.0003299498,0.9283201,0.002113352,0.00001772152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1762666,0.001176091,0.6918417,0.004122888,0.000289432,0.0002637556,0.001479667,0.0007912393,0.1237687],"genre_scores_gemma":[0.8172467,0.001624977,0.1197666,0.001295769,0.0008004088,0.0005822101,0.001859949,0.0008057919,0.05601757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01520998,"threshold_uncertainty_score":0.0508824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2521482842","doi":"10.1007/s10878-016-0080-2","title":"An approximation algorithm for k-facility location problem with linear penalties using local search scheme","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; Zhàng; Local search (optimization); Extension (predicate logic); Approximation algorithm; Algorithm; Scheme (mathematics); Mathematics; 1-center problem; Computer science; Contrast (vision); Mathematical optimization; Combinatorics; Artificial intelligence","authors":[{"name":"Yishui Wang","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Chenchen Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02624823424378466,"gpt":0.2613735980046961,"spread":0.2351253637609114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391171,0.0009382676,0.002526519,0.0009255233,0.0009443819,0.001436182,0.00372528,0.002074743,0.007094682],"category_scores_gemma":[0.004151827,0.0007878953,0.00105925,0.002062444,0.0007684255,0.002213767,0.001935043,0.002024271,0.001129207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002031013,"about_ca_system_score_gemma":0.003155555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01076448,"about_ca_topic_score_gemma":0.0095162,"domain_scores_codex":[0.9990236,0.0003358338,0.00004730389,0.0001737232,0.0002177259,0.0002019375],"domain_scores_gemma":[0.9981875,0.001073955,0.0001410858,0.0002014725,0.0002395372,0.0001564315],"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.0004206861,0.0003467271,0.000614614,0.0001912664,0.00005069526,0.00007509456,0.00009260728,0.8939023,0.001666724,0.01571578,0.005793373,0.0811302],"study_design_scores_gemma":[0.000036121,0.00002962953,0.00004754037,0.000005201203,0.00000621743,0.00001668843,0.00001098987,0.9974718,0.0001565908,0.001975117,0.0002392084,0.00000485218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02662939,0.000399297,0.9672626,0.0003981498,0.00008734155,0.0001498037,0.0001564142,0.0008563604,0.00406057],"genre_scores_gemma":[0.3442145,0.0002478627,0.6488337,0.0002163065,0.00006299269,0.0004490168,0.0004954669,0.0001679736,0.005312146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01076448,"threshold_uncertainty_score":0.02373409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978440339","doi":"10.1007/s10878-008-9148-y","title":"A nonlinear optimization methodology for VLSI fixed-outline floorplanning","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Floorplan; Very-large-scale integration; Mathematical optimization; Nonlinear programming; Sizing; Computer science; Optimization problem; Nonlinear system; Mathematics","authors":[{"name":"Chaomin Luo","is_ca":true},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03905878121476061,"gpt":0.2762490240574581,"spread":0.2371902428426975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658054,0.0007644216,0.0004864461,0.0005035664,0.0004523885,0.0005064057,0.001208017,0.0004803906,0.003632533],"category_scores_gemma":[0.001197836,0.0005097533,0.000752961,0.0005423002,0.0005274214,0.0006860626,0.0007928416,0.0008593476,0.0006602259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006737393,"about_ca_system_score_gemma":0.001153358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003532677,"about_ca_topic_score_gemma":0.006508135,"domain_scores_codex":[0.9997208,0.00007887479,0.00001240323,0.00003451319,0.0001282015,0.00002524182],"domain_scores_gemma":[0.9996413,0.0001769551,0.00004010611,0.00003622571,0.0000927003,0.00001261944],"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.00001962536,0.00002802383,0.0001363736,0.0000811256,0.00002079188,0.00003221665,0.00002824567,0.900829,0.005093338,0.01990804,0.000681541,0.0731416],"study_design_scores_gemma":[0.000003146261,0.00001903243,0.00003931317,0.00000451087,0.000004269031,0.00001495685,0.00000332019,0.9953043,0.0006724537,0.003245285,0.0006862066,0.000003250874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001582682,0.00004604215,0.9965442,0.00002737578,0.00001026811,0.00002665892,0.00001537961,0.0001004888,0.001647019],"genre_scores_gemma":[0.1158898,0.0002434583,0.8772779,0.00006171937,0.00003525572,0.000209515,0.00009272228,0.0001708916,0.006018713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003632533,"threshold_uncertainty_score":0.01215208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2759640845","doi":"10.1007/s10878-017-0179-0","title":"A local search approximation algorithm for the uniform capacitated k-facility location problem","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; Constraint (computer-aided design); Set (abstract data type); Cardinality (data modeling); Computer science; Approximation algorithm; Mathematical optimization; 1-center problem; Combinatorial optimization; Local search (optimization); Total cost; Service (business); Algorithm; Mathematics; Database","authors":[{"name":"Lu Han","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Dongmei Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0288429195336987,"gpt":0.2576009970994438,"spread":0.2287580775657451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278537,0.0008807557,0.002101906,0.001041219,0.0007895931,0.001425108,0.003114657,0.002103307,0.00831022],"category_scores_gemma":[0.004975461,0.0007521216,0.000923028,0.002172355,0.0007884402,0.001962455,0.001854873,0.001871812,0.001500607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001819474,"about_ca_system_score_gemma":0.002334904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009569373,"about_ca_topic_score_gemma":0.009430279,"domain_scores_codex":[0.999228,0.0002851154,0.00003381871,0.0001491872,0.0001585514,0.0001453277],"domain_scores_gemma":[0.997826,0.001461818,0.0001457082,0.0001501366,0.0002672753,0.0001490066],"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.0003947086,0.0002485884,0.0005709618,0.0001388329,0.00004814034,0.00007088594,0.00007628042,0.8950191,0.0009003149,0.01113661,0.006115463,0.08528011],"study_design_scores_gemma":[0.00004399695,0.00002863755,0.0000398166,0.000005902253,0.000006330816,0.00001385271,0.00001231144,0.9975074,0.000107178,0.001936293,0.0002939956,0.000004336971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03195769,0.0005696249,0.9584256,0.0005381361,0.0001014497,0.0001260367,0.0002316824,0.001142736,0.006906954],"genre_scores_gemma":[0.3794743,0.0003155096,0.6115346,0.0002645955,0.00009197833,0.0004172604,0.0007205541,0.0002542636,0.006926997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009569373,"threshold_uncertainty_score":0.0278005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093200602","doi":"10.1007/s10878-005-6857-3","title":"Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Pattern recognition (psychology); Computational biology; Data mining; Artificial intelligence; Mathematics; Biology","authors":[{"name":"Zhipeng Cai","is_ca":true},{"name":"Maysam Heydari","is_ca":true},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01405018599024662,"gpt":0.2728460998049763,"spread":0.2587959138147297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008166673,0.0007182159,0.001221308,0.003466041,0.0004775786,0.001006603,0.001227153,0.0008295343,0.002599538],"category_scores_gemma":[0.003801994,0.0004387314,0.000770838,0.003756188,0.0005462908,0.0008180091,0.0008012349,0.0007544869,0.001075454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008986579,"about_ca_system_score_gemma":0.0009316502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003817752,"about_ca_topic_score_gemma":0.003882767,"domain_scores_codex":[0.9988266,0.0002745482,0.000102842,0.0002611678,0.0004181924,0.0001166128],"domain_scores_gemma":[0.998085,0.0008798963,0.00020062,0.0002562104,0.0005012154,0.00007706073],"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.0004263018,0.0002296893,0.003752189,0.0002075517,0.00006795173,0.00004635731,0.00007684351,0.06404952,0.04994526,0.004982234,0.003930611,0.8722855],"study_design_scores_gemma":[0.00003602029,0.00009194314,0.002266567,0.0000173887,0.00003199772,0.00007517346,0.00006427082,0.9656074,0.01924871,0.01021976,0.002315328,0.00002541498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0452634,0.000299627,0.9516441,0.0001077734,0.0000230434,0.0001144768,0.000740041,0.001253118,0.00055454],"genre_scores_gemma":[0.2849208,0.000302577,0.7077911,0.00009309479,0.00004493894,0.0005201138,0.003830192,0.0001858462,0.002311436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003817752,"threshold_uncertainty_score":0.008696318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088810319","doi":"10.1007/s10878-013-9614-z","title":"Generalized Canadian traveller problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"National Tsing Hua University; National Science Council","keywords":"Competitive analysis; Theory of computation; Combinatorics; Constant (computer programming); Upper and lower bounds; Bounded function; Online algorithm; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Generalization; Discrete mathematics; Mathematical optimization; Graph; Algorithm; Telecommunications","authors":[{"name":"Chung-Shou Liao","is_ca":false},{"name":"Yamming Huang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01321259777739848,"gpt":0.2240957758642578,"spread":0.2108831780868593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008473162,0.001194113,0.001382156,0.001841484,0.002623067,0.004119529,0.002762686,0.00282418,0.02842978],"category_scores_gemma":[0.005635703,0.0005512031,0.001019882,0.002672075,0.002404286,0.003259519,0.002185637,0.003243909,0.001435087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008791914,"about_ca_system_score_gemma":0.006373425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1355079,"about_ca_topic_score_gemma":0.148334,"domain_scores_codex":[0.9990708,0.0002391221,0.00003122363,0.0001778639,0.0002519767,0.0002290361],"domain_scores_gemma":[0.9984009,0.0006153508,0.0001131802,0.0001538574,0.0004174525,0.0002993105],"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.00005126235,0.00002273127,0.0001643002,0.00004647697,0.00001792432,0.00005357217,0.0000772366,0.02835017,0.0001352351,0.941576,0.01864425,0.01086076],"study_design_scores_gemma":[0.00004928045,0.00002195617,0.0003319221,0.00003233863,0.00001967894,0.00009128672,0.0002351211,0.1223107,0.0002289066,0.8455665,0.03106506,0.00004720755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1483045,0.003872967,0.2892544,0.008051698,0.0008109506,0.0003314695,0.003278076,0.0004686771,0.5456273],"genre_scores_gemma":[0.6907567,0.002480868,0.05627492,0.0007248831,0.0003457197,0.0002687399,0.002208987,0.0002607621,0.2466785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1355079,"threshold_uncertainty_score":0.2694384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093224514","doi":"10.1007/s10878-005-1778-8","title":"Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Travelling salesman problem; Theory of computation; Scheduling (production processes); Mathematics; Computer science; Implementation; Combinatorics; Mathematical optimization; Algorithm","authors":[{"name":"Vladimir G. Deı̌neko","is_ca":false},{"name":"George Steiner","is_ca":true},{"name":"Zhihui Xue","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0154251013706192,"gpt":0.2412177868623189,"spread":0.2257926854916997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082493,0.0008608186,0.001463384,0.0006690657,0.001378745,0.003043451,0.001598341,0.002451781,0.008744835],"category_scores_gemma":[0.006801879,0.0006529942,0.001120967,0.001157459,0.001281583,0.003188474,0.001122193,0.001436188,0.000699082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008427592,"about_ca_system_score_gemma":0.001210729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002323725,"about_ca_topic_score_gemma":0.003484962,"domain_scores_codex":[0.9989504,0.0002850462,0.00005961137,0.0002177127,0.0001174651,0.0003697426],"domain_scores_gemma":[0.9950067,0.003055759,0.0007378647,0.0005471195,0.0002748412,0.0003776516],"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.001702208,0.0007046948,0.003357525,0.0006132847,0.0001826735,0.003008728,0.0006366363,0.3833822,0.008396162,0.5475208,0.01819027,0.03230482],"study_design_scores_gemma":[0.0002099289,0.0001150718,0.0005749353,0.0000162258,0.00003723634,0.0006793771,0.0003397817,0.6446012,0.002335515,0.3487517,0.002297696,0.00004142052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7328811,0.0004027168,0.2201125,0.001288068,0.0001826686,0.000224793,0.0009463147,0.0003490915,0.04361269],"genre_scores_gemma":[0.9532993,0.000195081,0.03842638,0.0001025367,0.00009396965,0.00007746676,0.000588197,0.00009247317,0.00712453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008744835,"threshold_uncertainty_score":0.02925438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919974563","doi":"10.1007/s10878-007-9126-9","title":"Priority algorithms for the subset-sum problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Algorithm; Computer science; Subset sum problem; Mathematics; Combinatorics; Discrete mathematics; Knapsack problem","authors":[{"name":"Yuli Ye","is_ca":true},{"name":"Allan Borodin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0313018334077141,"gpt":0.2772436833332365,"spread":0.2459418499255224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004031005,0.001340423,0.002704166,0.001350649,0.00155926,0.00364882,0.003401636,0.001525721,0.01012761],"category_scores_gemma":[0.0140241,0.0007977589,0.001179422,0.00248165,0.001086817,0.005751266,0.002551081,0.003972521,0.002069015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704483,"about_ca_system_score_gemma":0.002409834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001772359,"about_ca_topic_score_gemma":0.0025559,"domain_scores_codex":[0.9979987,0.0007626549,0.0001037996,0.0002716308,0.0005499754,0.0003133525],"domain_scores_gemma":[0.9914222,0.005945095,0.0003659615,0.0009075438,0.0008042172,0.0005549117],"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.001133283,0.0006434369,0.0007879776,0.0006582321,0.0001510416,0.00008543694,0.0003777929,0.1497857,0.002729994,0.5032178,0.02906524,0.311364],"study_design_scores_gemma":[0.0002578534,0.0002685676,0.00019719,0.0000450882,0.00006949429,0.0001184311,0.00009706127,0.4447202,0.001255758,0.5453656,0.007575161,0.0000295094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01835753,0.001485539,0.9671121,0.0009497856,0.0003600905,0.0001375542,0.0001493006,0.0005002397,0.01094785],"genre_scores_gemma":[0.3528861,0.003019879,0.6201304,0.0007593805,0.001113615,0.0003988601,0.0007453265,0.0007005057,0.02024606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01012761,"threshold_uncertainty_score":0.03388023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1603740932","doi":"10.1023/a:1013370208101","title":"3-Partitioning Problems for Maximizing the Minimum Load","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; McMaster University; University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics","authors":[{"name":"Shi Ping Chen","is_ca":false},{"name":"Yong He","is_ca":false},{"name":"Guohui Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01708650442051253,"gpt":0.2139673845605278,"spread":0.1968808801400153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034615,0.001368827,0.00134927,0.0009726074,0.0008221854,0.001537596,0.001391694,0.001963728,0.008509533],"category_scores_gemma":[0.00317361,0.0006459178,0.001091702,0.001234472,0.0005966298,0.002286889,0.0014295,0.001092892,0.0008817179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037521,"about_ca_system_score_gemma":0.0007707832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002200861,"about_ca_topic_score_gemma":0.002506613,"domain_scores_codex":[0.9994825,0.0002248286,0.0000226908,0.00006670018,0.0001027046,0.0001005446],"domain_scores_gemma":[0.9991539,0.0006065551,0.00006106795,0.0000472637,0.00007505421,0.00005614674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004043108,0.0001840091,0.0004404066,0.0003127603,0.00008035936,0.0001566078,0.0001812806,0.8315161,0.004418271,0.07315107,0.006341378,0.08281349],"study_design_scores_gemma":[0.00004895849,0.00007710203,0.0002685364,0.00003274491,0.00002424361,0.00009351125,0.00005613578,0.9153615,0.001600247,0.07974771,0.002671525,0.00001774597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07953011,0.0009620451,0.8948684,0.000805807,0.0001355026,0.0002652522,0.0005223951,0.0002715764,0.02263903],"genre_scores_gemma":[0.5970545,0.001174579,0.3883119,0.0004333976,0.0001619279,0.0005041496,0.0008028198,0.0004618832,0.01109488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008509533,"threshold_uncertainty_score":0.0284673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007520294","doi":"10.1007/s10878-008-9194-5","title":"Periodic complementary binary sequences and Combinatorial Optimization algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Formalism (music); Autocorrelation; Combinatorial optimization; Theory of computation; Algorithm; Binary number; Mathematics; Optimization problem; Computer science; Theoretical computer science","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"C. Koukouvinos","is_ca":false},{"name":"P. M. Pardalos","is_ca":false},{"name":"Oleg V. Shylo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615915097400654,"gpt":0.2401402947344964,"spread":0.2239811437604899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210744,0.0009482765,0.001282454,0.001785931,0.0009392134,0.002586527,0.001495996,0.001952788,0.006295853],"category_scores_gemma":[0.01299417,0.0007807423,0.0008025722,0.002900015,0.002793177,0.003316821,0.001742143,0.002670455,0.0005872824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001582997,"about_ca_system_score_gemma":0.001328921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009142508,"about_ca_topic_score_gemma":0.0009107149,"domain_scores_codex":[0.9988439,0.000589796,0.00004401264,0.0001327792,0.0003018491,0.00008762314],"domain_scores_gemma":[0.9941159,0.004899534,0.0003163798,0.0002962732,0.0002539832,0.0001178787],"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.00005124057,0.00004517284,0.0001712351,0.00006679189,0.00002369382,0.00002691219,0.00004306149,0.07065205,0.0002276383,0.8991262,0.00253332,0.02703283],"study_design_scores_gemma":[0.00002434711,0.00001882772,0.00006247576,0.00002093824,0.000007683019,0.00003201591,0.00001388315,0.1910617,0.0001527876,0.806999,0.001597107,0.000009038471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08014039,0.005572263,0.8329415,0.003465418,0.000674716,0.0001276783,0.0001802886,0.0002225364,0.07667523],"genre_scores_gemma":[0.7118748,0.005777455,0.2404792,0.001035179,0.001150612,0.000490014,0.0004155769,0.0001907366,0.0385864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006295853,"threshold_uncertainty_score":0.02106178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}