{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007405863,0.0001500163,0.0001892092,0.0002643182,0.0003158328,0.0002578866,0.000417974,0.00007445179,0.000008681693],"category_scores_gemma":[0.0001110314,0.0001079057,0.0001032709,0.0005085142,0.0000631202,0.0004146468,0.00005449668,0.000313337,0.000001587555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008135234,"about_ca_system_score_gemma":0.00008703222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003408626,"about_ca_topic_score_gemma":1.693262e-7,"domain_scores_codex":[0.9986359,0.0001149206,0.0003484301,0.0001803495,0.0005512044,0.0001691243],"domain_scores_gemma":[0.9988024,0.0002504275,0.0003741907,0.0002532913,0.0002345111,0.00008523315],"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.00009995332,0.0001801337,0.000008193223,0.000005166678,0.00001746854,0.000008809575,0.00007919567,0.6068959,0.00001334354,0.3912695,0.0001012103,0.001321088],"study_design_scores_gemma":[0.0025679,0.001525757,0.0001142006,0.0001162904,0.00002124119,0.00002655003,0.00001767848,0.625653,0.0005722026,0.3690809,0.0001501003,0.0001542325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004961327,0.0000280071,0.9879391,0.002431826,0.003960817,0.0001697029,9.486333e-7,0.00004058622,0.0004676918],"genre_scores_gemma":[0.8414066,0.0000601955,0.1568731,0.001128836,0.0004894048,0.000008544741,0.000002304495,0.0000217099,0.000009262853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8364453,"threshold_uncertainty_score":0.4400265,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003508657,0.0001335599,0.0001989799,0.0001655398,0.0001088818,0.00009468936,0.00007564321,0.0001240262,0.0001301978],"category_scores_gemma":[0.0002102115,0.0001498874,0.00005591109,0.0004164944,0.00001441141,0.0005658017,0.00001709857,0.0001744873,9.749768e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000111291,"about_ca_system_score_gemma":0.00009169064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.615592e-7,"about_ca_topic_score_gemma":9.581264e-7,"domain_scores_codex":[0.9986966,0.00008231434,0.0006878772,0.0001062223,0.0002930367,0.0001339215],"domain_scores_gemma":[0.9989093,0.00004372241,0.0002395764,0.00008879814,0.0006349573,0.00008363934],"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.00001851113,0.00004036842,0.00009781854,0.00002237264,0.00003576465,0.00000622779,0.0002130044,0.9947449,0.001667706,0.002323331,0.00002476842,0.0008052552],"study_design_scores_gemma":[0.0002433965,0.00005001226,0.00001698747,0.00004727035,0.00007878339,0.00004801511,0.0002358659,0.9918447,0.00503541,0.002241703,0.00001056164,0.0001473044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01186784,0.0002563816,0.9840775,0.00005560243,0.003475405,0.00007834075,0.000002919164,0.00004015016,0.0001458975],"genre_scores_gemma":[0.4299207,0.001129928,0.5682509,0.00001247848,0.0005910466,0.000001702185,0.00003961581,0.00004521205,0.000008426681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4180529,"threshold_uncertainty_score":0.6112229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541124,0.0000913264,0.0001898056,0.0003453985,0.0007225759,0.0002435072,0.0004075766,0.00006601939,0.00001638611],"category_scores_gemma":[0.0001076178,0.000065651,0.0000829694,0.001023285,0.00005818233,0.0005610033,0.00004281303,0.0001862138,0.000002259754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001035341,"about_ca_system_score_gemma":0.0005212546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003100914,"about_ca_topic_score_gemma":0.0006136157,"domain_scores_codex":[0.9987197,0.0001651579,0.0003811427,0.0001168218,0.0004202146,0.0001969448],"domain_scores_gemma":[0.998217,0.0001221123,0.0002877775,0.0001282129,0.0009952759,0.0002495468],"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.00001614776,0.00003796671,0.000316834,0.000002646632,0.0001912973,0.00001948455,0.0009697797,0.4659965,0.000004585108,0.5316869,0.0004485637,0.0003093168],"study_design_scores_gemma":[0.001294731,0.0002593046,0.001058093,0.00001328798,0.00007276633,0.00009040046,0.00004640727,0.9853584,0.00007697709,0.003910818,0.007649157,0.0001696842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001350444,0.0008027229,0.9654975,0.008935316,0.002467899,0.0005382188,0.00000359732,0.00004449622,0.02035982],"genre_scores_gemma":[0.9248303,0.001264071,0.07331842,0.000145605,0.0001371631,0.000003449101,0.000003286817,0.000009351854,0.0002883418],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9234799,"threshold_uncertainty_score":0.5557543,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822153,0.00006899444,0.0001240512,0.00002591773,0.00005493814,0.00002262951,0.00008886426,0.0001003347,0.000009182059],"category_scores_gemma":[0.0005408352,0.00005389616,0.00009978793,0.00005336638,0.00001852128,0.000004576261,0.00001300041,0.00004595046,3.974931e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009653948,"about_ca_system_score_gemma":0.00005526712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.176587e-7,"about_ca_topic_score_gemma":3.197184e-8,"domain_scores_codex":[0.9994265,0.00006439771,0.0002454811,0.00008099495,0.00008017452,0.0001024921],"domain_scores_gemma":[0.9993358,0.00002697658,0.0002248306,0.00006336443,0.0003032368,0.00004584814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002094639,0.001044104,0.004616851,0.00007497233,0.00038428,0.0000100774,0.00008167446,0.2952661,0.6199534,0.05717559,0.01627936,0.003018933],"study_design_scores_gemma":[0.01102222,0.008321178,0.0004243408,0.00006831453,0.0001550513,0.0001502666,0.000130644,0.006596649,0.7087536,0.01785814,0.2457954,0.0007242156],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3380109,0.0004237225,0.6544119,0.0001447946,0.004945365,0.0002274273,0.000003578368,0.000007962456,0.001824367],"genre_scores_gemma":[0.9641097,0.00004821453,0.03507593,0.00007387558,0.0006160513,0.000001592699,0.00001325833,0.000008111192,0.00005325101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6260989,"threshold_uncertainty_score":0.2197822,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423242,0.0001022268,0.0001672589,0.0002895163,0.00016171,0.0001448015,0.0002600825,0.00007257888,0.00001741017],"category_scores_gemma":[0.0001892214,0.000104042,0.00008282901,0.0004831933,0.00001808001,0.001892571,0.00003848639,0.0001452104,0.000008404339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001005483,"about_ca_system_score_gemma":0.0001905541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.561642e-7,"about_ca_topic_score_gemma":1.187146e-8,"domain_scores_codex":[0.9986264,0.0001329369,0.0004811879,0.0001080352,0.0004611928,0.00019025],"domain_scores_gemma":[0.9985818,0.0001965872,0.00049687,0.0001379331,0.0004460519,0.0001408171],"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.00002518605,0.0003624974,0.00004898918,0.000006310185,0.00002986171,0.000001828024,0.0003896802,0.4949769,0.0006337451,0.4988051,0.0005752592,0.004144595],"study_design_scores_gemma":[0.005770983,0.001527766,0.001651216,0.000159399,0.0001004802,0.0002142171,0.00005516461,0.8212391,0.008282286,0.156949,0.003400208,0.000650223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004098414,0.0001374704,0.9868578,0.0007825912,0.007110931,0.0001361255,0.000001113835,0.00003323074,0.0008422736],"genre_scores_gemma":[0.7572695,0.000020541,0.2407148,0.0001623321,0.001793304,0.000002501257,0.000006061613,0.000007326316,0.0000236752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7531711,"threshold_uncertainty_score":0.424271,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004589377,0.00007765767,0.0001857865,0.0003098079,0.00008304159,0.0000507159,0.000304644,0.00006449298,0.000006820141],"category_scores_gemma":[0.0001935244,0.00006826837,0.00007599059,0.0005332605,0.00001338544,0.0004978493,0.00002627007,0.0001976909,0.000002572522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007831062,"about_ca_system_score_gemma":0.00008135652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000663515,"about_ca_topic_score_gemma":2.626891e-7,"domain_scores_codex":[0.9988607,0.0001365515,0.0004931575,0.00009732887,0.000289866,0.000122363],"domain_scores_gemma":[0.9990552,0.0001322041,0.000386939,0.0001306769,0.0002264754,0.00006849746],"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.00002905501,0.0001075741,0.0003630451,0.00000213721,0.000008736005,0.00005877323,0.0003609918,0.8340936,0.00001554249,0.1628994,0.001251207,0.0008099928],"study_design_scores_gemma":[0.002218731,0.0006280981,0.0002534419,0.0001388108,0.00000310391,0.0003558873,0.00001963631,0.9738798,0.0001039574,0.02183428,0.0004222223,0.0001420785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05148584,0.00006290989,0.9351203,0.0002504823,0.01044695,0.00008629166,9.844977e-8,0.00002399533,0.002523071],"genre_scores_gemma":[0.9861191,0.00004063374,0.0134571,0.00008990042,0.0002575666,8.911935e-7,2.643071e-7,0.000006003168,0.00002854909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9346333,"threshold_uncertainty_score":0.2783904,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001923592,0.0002123703,0.0004643242,0.0003368805,0.0004353199,0.0007998705,0.0009811347,0.0001511675,0.0001374062],"category_scores_gemma":[0.0002520657,0.0001380112,0.0002500926,0.0003958547,0.00008854517,0.001222005,0.0000385528,0.0003389891,0.000009560694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001731172,"about_ca_system_score_gemma":0.0006198512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004308694,"about_ca_topic_score_gemma":0.00003217256,"domain_scores_codex":[0.9975368,0.0003797265,0.0008437555,0.0002348016,0.0006351356,0.0003697807],"domain_scores_gemma":[0.9964847,0.0004909182,0.0005792229,0.0003677245,0.001682378,0.0003950685],"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.0005872354,0.000304495,0.000001484389,0.000005302668,0.00007036248,0.00000237862,0.000493466,0.947393,0.000008092514,0.01888994,0.001409778,0.03083446],"study_design_scores_gemma":[0.03254154,0.0006246459,0.00001028263,0.00003011103,0.00002804741,0.00001294542,0.0000439319,0.9615598,0.00006093592,0.003938832,0.0009813634,0.0001675815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007607941,0.0000527553,0.9906677,0.004956987,0.002305147,0.001571449,0.000006968532,0.00003454835,0.0003283539],"genre_scores_gemma":[0.02033131,0.0001361288,0.9779619,0.0007358728,0.0006004316,0.00008416885,0.00002555724,0.00003126058,0.00009339024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03195431,"threshold_uncertainty_score":0.7713169,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547856,0.00006976878,0.0001942359,0.0002498471,0.00003743617,0.00005572778,0.0004663364,0.00005494893,0.000006083612],"category_scores_gemma":[0.001002802,0.00006316011,0.00005954402,0.0005057614,0.00003286919,0.001284318,0.00005689195,0.0001437176,0.0000014745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007894159,"about_ca_system_score_gemma":0.0002214982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001238491,"about_ca_topic_score_gemma":4.753496e-8,"domain_scores_codex":[0.9985301,0.0002081352,0.0005061911,0.00008766549,0.0005542578,0.0001135839],"domain_scores_gemma":[0.9972365,0.0001527192,0.0007288663,0.0001792577,0.001591625,0.0001110531],"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.0002543993,0.0001911758,0.0002167449,0.000018367,0.00003602986,0.0000147062,0.001332274,0.6529474,0.001423768,0.3280293,0.0005440103,0.0149918],"study_design_scores_gemma":[0.005198579,0.00158488,0.00008433179,0.00011062,0.00001793517,0.0001031685,0.0001923902,0.5765693,0.02668377,0.388806,0.0004334279,0.0002156773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00778791,0.0000780013,0.9876977,0.0002606885,0.002567795,0.00009148865,3.897876e-7,0.00001350093,0.001502594],"genre_scores_gemma":[0.6868042,0.00001737786,0.3130051,0.00001169816,0.0001353505,0.000001012213,0.000001052362,0.00000723293,0.00001705339],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6790162,"threshold_uncertainty_score":0.2575595,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372974,0.0001844964,0.0003534929,0.0002935295,0.00006619313,0.0001709249,0.0001650173,0.0001093385,0.00004436482],"category_scores_gemma":[0.00008933593,0.0001524914,0.0000528716,0.0004347959,0.00001499777,0.0004207829,0.000004510306,0.0002779191,0.000005827008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009848461,"about_ca_system_score_gemma":0.00006932995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.476081e-7,"about_ca_topic_score_gemma":5.398814e-8,"domain_scores_codex":[0.9987631,0.00004030597,0.0004938791,0.0001080728,0.0003936797,0.0002008989],"domain_scores_gemma":[0.9992522,0.00005302574,0.0002244114,0.00009507123,0.0002844729,0.00009081308],"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.0002987067,0.0001071349,0.00009196349,0.00001080481,0.00001957331,0.00001416591,0.00009767531,0.9975366,0.00005177597,0.0003333833,0.00005692073,0.001381284],"study_design_scores_gemma":[0.004171728,0.0004253748,0.00005894187,0.0002159578,0.00003237231,0.00002197322,0.00002532256,0.9941748,0.000183331,0.0004698353,0.00003779131,0.0001826161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06115493,0.001524205,0.9237782,0.001159398,0.003146206,0.0005596566,0.000002746468,0.0004095939,0.0082651],"genre_scores_gemma":[0.5857547,0.00008587044,0.4134277,0.0001100857,0.0005062301,0.000002238733,0.000007217705,0.00004024616,0.0000657124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5245997,"threshold_uncertainty_score":0.6218417,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792449,0.0001678075,0.0002618694,0.0002313813,0.00009108523,0.0000862644,0.0001284208,0.0001350085,0.00003330162],"category_scores_gemma":[0.0003686202,0.0001167467,0.00008969411,0.0002912707,0.00004246292,0.0006865381,0.000008006221,0.0001306296,0.000001922048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001488121,"about_ca_system_score_gemma":0.00007174522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.906809e-7,"about_ca_topic_score_gemma":1.799842e-7,"domain_scores_codex":[0.9986739,0.00004467344,0.0006234231,0.0001264122,0.0003424695,0.0001891203],"domain_scores_gemma":[0.9986174,0.000168672,0.0003044223,0.0001107107,0.0006887207,0.000110133],"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.0001952397,0.00005322041,0.00005064747,0.00003080409,0.00007441279,0.000001936973,0.00005840401,0.9894516,0.0005364153,0.001487321,0.00002344392,0.008036516],"study_design_scores_gemma":[0.00421058,0.000410882,0.00001564441,0.0001918088,0.00007946313,0.00008054566,0.00004124639,0.9882615,0.004951498,0.001496126,0.00006737876,0.000193337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003171063,0.0001082698,0.992785,0.0002168531,0.003196748,0.0002579245,0.0000068831,0.0001217138,0.0001355108],"genre_scores_gemma":[0.2056403,0.0001459889,0.7933742,0.000009612839,0.0007303126,0.00001527175,0.00001229821,0.00004710299,0.0000249134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2024692,"threshold_uncertainty_score":0.4760793,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001270552,0.0001018386,0.0002121908,0.000198872,0.00009064655,0.00003485965,0.0008651792,0.00005819354,0.00001801851],"category_scores_gemma":[0.001045283,0.00006719391,0.000113628,0.0006806661,0.0001032205,0.0008259026,0.0000912156,0.000256807,0.000006070023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005036276,"about_ca_system_score_gemma":0.0001286079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003285787,"about_ca_topic_score_gemma":4.093597e-8,"domain_scores_codex":[0.9982506,0.0003447573,0.0005373255,0.0001207503,0.0005933347,0.000153247],"domain_scores_gemma":[0.997693,0.0004586481,0.0007597324,0.0003655242,0.0006393985,0.00008370196],"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.0003799873,0.0002178439,0.00006134139,0.000005718979,0.00004557848,0.000007296365,0.001376532,0.01024971,0.00007593691,0.9870601,0.0002876662,0.0002323471],"study_design_scores_gemma":[0.001472012,0.0008077897,0.0002564678,0.00007459145,0.00001111225,0.00002613713,0.00006175657,0.01201383,0.00602047,0.9791456,0.00002048842,0.00008977052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1249252,0.0001569818,0.8459229,0.001701644,0.01081434,0.0009414557,0.000008183883,0.00008422916,0.01544498],"genre_scores_gemma":[0.9468867,0.0000514038,0.05283492,0.00005881578,0.0001345162,0.000003051397,4.311284e-7,0.00001091595,0.00001930712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8219614,"threshold_uncertainty_score":0.2740088,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313355,0.0001099053,0.0001950711,0.0002564048,0.0001158436,0.0001357512,0.0005790596,0.00005994598,0.00002333289],"category_scores_gemma":[0.0002230524,0.00008521137,0.00006043584,0.000589861,0.00003820795,0.002524635,0.00009366424,0.0002178198,0.000004888052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008180528,"about_ca_system_score_gemma":0.0001055566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.452273e-7,"about_ca_topic_score_gemma":2.318781e-8,"domain_scores_codex":[0.9985791,0.0001419364,0.0003142775,0.0001032213,0.0005657325,0.0002957704],"domain_scores_gemma":[0.998524,0.0001775738,0.0003992362,0.0002206953,0.0004917855,0.0001867331],"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.0009164387,0.001167263,0.01220113,0.00005909176,0.000219151,0.00008312896,0.004539221,0.3161932,0.001741279,0.6474009,0.002536657,0.01294255],"study_design_scores_gemma":[0.04383309,0.01389055,0.01100415,0.001613672,0.0003554005,0.002520182,0.001374954,0.5204754,0.06979055,0.3074816,0.02346002,0.004200426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008126068,0.0002144381,0.9876491,0.000240761,0.002997473,0.0001081953,6.349035e-7,0.00002825047,0.0006351015],"genre_scores_gemma":[0.7564029,0.00003118999,0.2429303,0.00002812045,0.00054724,0.00000255953,0.000001239334,0.0000144865,0.00004201881],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7482768,"threshold_uncertainty_score":0.3474818,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064459,0.0001199388,0.0001728874,0.0001217636,0.0003725111,0.0003274039,0.0007109864,0.00007939062,0.000008718799],"category_scores_gemma":[0.00007497685,0.00008815218,0.0001121642,0.0004052058,0.00008122086,0.001416009,0.00004788173,0.0001293367,0.000001161786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005311551,"about_ca_system_score_gemma":0.0001317836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003446296,"about_ca_topic_score_gemma":3.080299e-7,"domain_scores_codex":[0.9987206,0.0001061906,0.0004952524,0.000167019,0.0003263915,0.0001845238],"domain_scores_gemma":[0.9976919,0.0001551555,0.0006076342,0.0002960208,0.001168756,0.00008056124],"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.0003080864,0.001474709,0.00002728736,0.00005129258,0.0002054527,0.000003853826,0.003380541,0.06476787,0.001675933,0.3136295,0.003361959,0.6111135],"study_design_scores_gemma":[0.001264763,0.001404471,0.00002027821,0.00002034323,0.00002683255,0.00001769384,0.00003451094,0.925954,0.001193908,0.06885365,0.001103257,0.0001063075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000195688,0.00004136748,0.9936192,0.0005717765,0.005064058,0.0003927434,0.000003072518,0.00004081212,0.00007128163],"genre_scores_gemma":[0.04617784,0.00002558782,0.9516367,0.00009410567,0.002013602,0.00002161724,0.000007745248,0.00001200474,0.00001082617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8611861,"threshold_uncertainty_score":0.3594742,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261003,0.0001203132,0.0001590391,0.0001097895,0.00006207649,0.0000442356,0.0001195798,0.0001280917,0.000006307992],"category_scores_gemma":[0.0000433688,0.0001152843,0.0001563703,0.0001122394,0.00002168285,0.00002314517,0.00002050695,0.00006513204,7.931768e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006351234,"about_ca_system_score_gemma":0.0001059925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002855248,"about_ca_topic_score_gemma":2.535376e-7,"domain_scores_codex":[0.9991496,0.00003451471,0.0003791232,0.0001326693,0.0001643003,0.0001398105],"domain_scores_gemma":[0.9988474,0.00000774399,0.0004147785,0.0001164063,0.0005482338,0.00006548374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001009528,0.001245189,0.00004726827,0.00007466883,0.0005383549,0.000004557702,0.0004441012,0.5145289,0.4395247,0.001610661,0.0004619188,0.04051014],"study_design_scores_gemma":[0.06374694,0.01446327,0.0003408737,0.0002322386,0.0006957418,0.0004095804,0.0004837854,0.2222212,0.6220192,0.06773689,0.006036867,0.001613393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01443436,0.0001480617,0.9832287,0.0002347387,0.001507598,0.0003815266,0.000007335545,0.000007253661,0.0000503579],"genre_scores_gemma":[0.1981577,0.0001621324,0.7998018,0.00006835442,0.00149442,0.00002904349,0.0002190095,0.00004536086,0.0000221786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2923077,"threshold_uncertainty_score":0.4701159,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002392001,0.0000792419,0.0002470681,0.0001185214,0.00009002713,0.00007613021,0.0003387781,0.00004606515,0.000001946264],"category_scores_gemma":[0.000576012,0.00005093392,0.00005573372,0.0003250985,0.0002598138,0.0005113614,0.0001347375,0.0001684382,1.277399e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001239888,"about_ca_system_score_gemma":0.0000393595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000260126,"about_ca_topic_score_gemma":1.044562e-7,"domain_scores_codex":[0.9985935,0.0004497273,0.0003706472,0.0001205192,0.0003547756,0.0001108252],"domain_scores_gemma":[0.9982551,0.000574274,0.000391698,0.0002404646,0.0004661969,0.00007225484],"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.0004326013,0.00007993017,0.001282093,0.00002252655,0.00003087751,0.000001458695,0.0005455123,0.03050355,0.0001377638,0.9615262,0.00005119332,0.005386278],"study_design_scores_gemma":[0.005193233,0.000434577,0.0007517944,0.00003239742,0.00001613545,0.00003526688,0.00002005009,0.129686,0.0005033161,0.8631282,0.0001182965,0.00008069648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04002545,0.0002176897,0.9583136,0.0004518728,0.0006651871,0.0001369886,4.187029e-7,0.000007565384,0.0001812578],"genre_scores_gemma":[0.9503626,0.0001501956,0.04937921,0.00003465296,0.00006191546,0.000001224137,2.025981e-7,0.000005120016,0.000004862659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9103372,"threshold_uncertainty_score":0.2077025,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003474045,0.0001068686,0.000166639,0.000229414,0.0003153585,0.0002452709,0.0006810096,0.00007004115,0.00000415566],"category_scores_gemma":[0.0001889387,0.00007456545,0.00008202333,0.0006460372,0.000121482,0.0007537701,0.0001321162,0.0002466261,6.244306e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007122348,"about_ca_system_score_gemma":0.0001691695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001495625,"about_ca_topic_score_gemma":1.802376e-7,"domain_scores_codex":[0.9983963,0.000081684,0.0004218218,0.0001631586,0.0006101715,0.0003268829],"domain_scores_gemma":[0.9976555,0.0008122514,0.0002459275,0.0002207464,0.000942103,0.0001235404],"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.0006531384,0.0006683498,0.0001788569,0.00005027065,0.0001000687,0.00004910632,0.001859062,0.120255,0.000640075,0.5657966,0.0007672138,0.3089823],"study_design_scores_gemma":[0.003599077,0.001933584,0.0001230925,0.00004305712,0.00002771425,0.0001552817,0.000162938,0.861908,0.001145847,0.1279197,0.002754105,0.0002275815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001087805,0.0004615418,0.9954109,0.000511304,0.001969013,0.00034713,9.737748e-7,0.00001521424,0.0001960759],"genre_scores_gemma":[0.1232305,0.0001771646,0.8759038,0.00006560211,0.0004978231,0.00000744214,8.120082e-7,0.00001981386,0.00009699572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.741653,"threshold_uncertainty_score":0.3040691,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875762,0.0001275389,0.000240901,0.0001303117,0.0001139826,0.0004341495,0.0003348051,0.00006661157,0.0000141859],"category_scores_gemma":[0.000152254,0.0001005482,0.00003837595,0.0003055548,0.00004742686,0.001498894,0.00004003676,0.0001685507,0.00000348126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004808799,"about_ca_system_score_gemma":0.00009634319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001706312,"about_ca_topic_score_gemma":4.201948e-7,"domain_scores_codex":[0.9988587,0.00007031851,0.0003786766,0.0001512317,0.0003581277,0.0001828819],"domain_scores_gemma":[0.9984655,0.0001407327,0.0004767468,0.0001588996,0.0006162276,0.000141917],"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.00003395914,0.002140667,0.03204923,0.0002380554,0.0004886886,0.0003276685,0.004083218,0.349026,0.01707259,0.286319,0.005702573,0.3025183],"study_design_scores_gemma":[0.0163014,0.0091468,0.01340623,0.001614387,0.0003225395,0.00381949,0.0004381269,0.8184502,0.009463618,0.122138,0.00260381,0.002295369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03968969,0.0002555243,0.956288,0.0005306825,0.001277994,0.0001499338,4.820145e-7,0.00005743458,0.001750194],"genre_scores_gemma":[0.972181,0.00003484994,0.02739307,0.0000815071,0.0002745602,0.00000172503,0.00000123478,0.00001157303,0.00002047244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9324913,"threshold_uncertainty_score":0.4186514,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001458802,0.0001392225,0.000310226,0.0003436214,0.0001182071,0.00007758382,0.0005454231,0.0001131255,0.000009711253],"category_scores_gemma":[0.001070493,0.0001388478,0.00006284234,0.001014764,0.00004120173,0.001227821,0.00009954872,0.0002378491,0.000002636265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003307803,"about_ca_system_score_gemma":0.0003241441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002967889,"about_ca_topic_score_gemma":6.870942e-7,"domain_scores_codex":[0.9978633,0.0002409878,0.0009189117,0.0001937012,0.0005458771,0.0002372241],"domain_scores_gemma":[0.9982558,0.0001242548,0.0005800134,0.0003144545,0.0005907906,0.0001347005],"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.00005967711,0.0001621704,0.004983586,0.00001815901,0.000007020388,0.00001166538,0.0009867776,0.9760659,0.0005312861,0.0165367,0.00007866364,0.0005583459],"study_design_scores_gemma":[0.001375377,0.0005370699,0.009330694,0.00007574067,0.000009672516,0.000140579,0.00001546482,0.97879,0.00199105,0.007310249,0.0002055859,0.0002184902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1625545,0.00002790275,0.834367,0.00007837979,0.002556363,0.0002330746,8.446687e-7,0.00001694985,0.000164915],"genre_scores_gemma":[0.3309772,0.00001728876,0.6688408,0.00002531497,0.0001209329,0.000002112823,6.158141e-7,0.000008308357,0.000007433528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1684227,"threshold_uncertainty_score":0.5662051,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865075,0.0001239515,0.0001604186,0.0002612429,0.0001684411,0.0001645323,0.0007708304,0.00007956372,0.0001484799],"category_scores_gemma":[0.0003298381,0.0000645117,0.00009213024,0.0003893455,0.00003875685,0.0005713632,0.00004481897,0.0001802828,0.00002361356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000193996,"about_ca_system_score_gemma":0.0004204594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005531016,"about_ca_topic_score_gemma":0.00002929815,"domain_scores_codex":[0.9984496,0.0002102844,0.0004589932,0.0001444059,0.0004883524,0.0002483226],"domain_scores_gemma":[0.9983208,0.0001710736,0.0003329489,0.0002678982,0.000654121,0.0002532123],"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.00005108828,0.0005281401,0.00008963898,0.000006240188,0.00005147401,0.00002130995,0.000508977,0.3671167,0.0001986145,0.6108127,0.008053963,0.01256119],"study_design_scores_gemma":[0.009646433,0.001892218,0.0005749047,0.0004032884,0.00003258165,0.00007472614,0.00006062583,0.9077303,0.0008676885,0.05124253,0.02684935,0.0006253157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004749407,0.00002036248,0.9793867,0.01695171,0.002026623,0.0002498068,0.000003741915,0.00002372003,0.0008624191],"genre_scores_gemma":[0.5095323,0.0003163874,0.4867649,0.001877391,0.0005367285,0.00001075854,0.000004376613,0.00003950434,0.0009176325],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5595701,"threshold_uncertainty_score":0.2630711,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227839,0.00007937632,0.0002188346,0.0001738751,0.00007010277,0.00001610618,0.0001044322,0.0001197424,0.00003001968],"category_scores_gemma":[0.0005267905,0.00005635437,0.00003893935,0.0003195875,0.00009993804,0.0001483761,0.00005552215,0.0001441961,0.000001348456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001463576,"about_ca_system_score_gemma":0.00001606123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006344382,"about_ca_topic_score_gemma":1.182833e-7,"domain_scores_codex":[0.9988768,0.00003739609,0.000822981,0.0001063033,0.00007801584,0.00007851447],"domain_scores_gemma":[0.9982489,0.0001586256,0.001415104,0.0001347843,0.00002446975,0.0000181302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001116537,0.0003359869,0.1392438,0.00001405656,0.0001029872,3.893956e-7,0.0002644433,0.06896194,0.01242932,0.7775502,0.00004058432,0.0009446913],"study_design_scores_gemma":[0.0008843929,0.0002042613,0.8913183,0.00001477298,0.000006148477,0.00000267635,0.00003458481,0.006595965,0.009713369,0.09113868,0.00001804117,0.00006882304],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9981543,0.00002233884,0.001123656,0.0002700978,0.0002298513,0.0001182358,0.00001558431,0.000005180035,0.0000607795],"genre_scores_gemma":[0.998979,0.0000967151,0.0008547822,0.000009228064,0.00003186096,0.000002006882,0.00000527581,0.000008048392,0.00001308443],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7520745,"threshold_uncertainty_score":0.2298064,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804668,0.0001202908,0.0002633684,0.00015559,0.00006537187,0.0000584756,0.0002030075,0.00008573449,0.000008605412],"category_scores_gemma":[0.00002898581,0.00008613957,0.00006802649,0.0006272228,0.00003710173,0.0002983044,0.00002224473,0.0001464537,0.000001376013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006110763,"about_ca_system_score_gemma":0.00005521408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002324336,"about_ca_topic_score_gemma":2.70324e-7,"domain_scores_codex":[0.9988111,0.00003872373,0.000477642,0.00008702275,0.0003950749,0.0001904849],"domain_scores_gemma":[0.9991452,0.00001783272,0.0001904693,0.000172626,0.0003391162,0.0001347493],"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.00002954948,0.0001240456,0.00002616729,0.00008704686,0.00004320819,0.000001077005,0.0005364257,0.9930788,0.0001232751,0.005539429,0.0003763477,0.00003458007],"study_design_scores_gemma":[0.001111207,0.0001356904,0.000004073156,0.0001076334,0.00004221681,0.000008439668,0.0004267468,0.9974141,0.000230052,0.0002630063,0.0001569681,0.00009991197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0172081,0.00002884299,0.9792688,0.00004002405,0.001669628,0.0004105006,0.000008799998,0.0001003217,0.00126501],"genre_scores_gemma":[0.6202558,0.00004210905,0.3790375,0.0000341957,0.0004047721,0.00001836301,0.00004067719,0.00008689251,0.00007972879],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6030477,"threshold_uncertainty_score":0.351267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249723,0.0001303631,0.000166055,0.0001849768,0.0002587728,0.0002498965,0.0002650421,0.00006566454,0.00004740423],"category_scores_gemma":[0.0001935508,0.00009953413,0.00008149128,0.0005368312,0.00002561408,0.002006117,0.00001153693,0.0001032293,0.00000737287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007473849,"about_ca_system_score_gemma":0.00004334775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005090202,"about_ca_topic_score_gemma":0.000002774199,"domain_scores_codex":[0.9987077,0.00002735213,0.0006022244,0.0001354954,0.0003795926,0.0001477017],"domain_scores_gemma":[0.9975981,0.00002739567,0.0004114826,0.0001856094,0.001759854,0.00001753168],"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.0001161725,0.000385385,0.00003443446,0.00005529871,0.00003486257,2.511232e-7,0.0001344197,0.8774667,0.00005097628,0.02489576,0.002240206,0.0945855],"study_design_scores_gemma":[0.001326272,0.0001181398,0.001061326,0.00001678534,0.00009192072,8.525032e-7,0.0002104819,0.9799412,0.00003946581,0.01188656,0.005175043,0.0001319965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001347797,0.00003116922,0.993495,0.002068175,0.002055848,0.0006722643,0.000005638367,0.00004200533,0.0002821235],"genre_scores_gemma":[0.9078012,0.00003744696,0.08895041,0.0008957806,0.001913389,0.00003422777,0.0002736566,0.00001642362,0.00007744569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9064534,"threshold_uncertainty_score":0.4058884,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993564,0.0001077269,0.0002147991,0.0002011015,0.0002484442,0.0001146515,0.0003275133,0.00007643115,0.000009272611],"category_scores_gemma":[0.0003007072,0.0001025449,0.0001309763,0.0004482974,0.00002499673,0.0008187303,0.00003501975,0.00009859021,0.000002661122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001044368,"about_ca_system_score_gemma":0.0004177395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001465854,"about_ca_topic_score_gemma":4.230918e-7,"domain_scores_codex":[0.9987454,0.00006963381,0.0005023698,0.0001343061,0.000398492,0.0001498389],"domain_scores_gemma":[0.998161,0.0002127929,0.0004682419,0.0001293676,0.0009340295,0.0000946205],"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.000195659,0.0003094765,0.00007421105,0.00001001429,0.00004087919,0.00001732939,0.0003786016,0.9217218,0.0002856231,0.07049213,0.004941869,0.001532384],"study_design_scores_gemma":[0.004339165,0.001949727,0.0004957393,0.00002617036,0.00003967734,0.0003049896,0.00001213035,0.9436017,0.001678586,0.0388031,0.008464387,0.0002846499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02794366,0.00006559028,0.9644783,0.0004921526,0.0065855,0.000201857,9.39795e-7,0.00002247529,0.0002095394],"genre_scores_gemma":[0.746017,0.00002738837,0.2525013,0.0001753385,0.001191558,0.000006353187,0.000006570057,0.00001002539,0.00006452875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7180733,"threshold_uncertainty_score":0.4181661,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004055605,0.0001428483,0.0002701143,0.0002643391,0.0001458754,0.0002105867,0.0007732587,0.00009152209,0.0003308085],"category_scores_gemma":[0.00007400622,0.000129196,0.0001667762,0.0009063779,0.00005176506,0.001036754,0.00004867247,0.0002334727,0.00001146192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004238228,"about_ca_system_score_gemma":0.0001110148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006532092,"about_ca_topic_score_gemma":1.930145e-7,"domain_scores_codex":[0.9984673,0.0001389123,0.0005495595,0.0001605584,0.0004755076,0.0002081165],"domain_scores_gemma":[0.9986901,0.0001122558,0.0003255824,0.0002871855,0.0004480201,0.0001368926],"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.000368689,0.001144915,0.0004236101,0.000026297,0.0002233979,0.0001416991,0.001201631,0.3315854,0.0003298447,0.575555,0.006751915,0.0822476],"study_design_scores_gemma":[0.009904099,0.002064379,0.001390854,0.0001728078,0.00009294331,0.0004865779,0.00004468701,0.7854493,0.002357742,0.164641,0.03248083,0.0009148354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02480415,0.0003987211,0.9591489,0.001385374,0.008889867,0.0001882425,0.000002637135,0.0001355879,0.005046543],"genre_scores_gemma":[0.6870133,0.0003387737,0.3106526,0.0003284787,0.001326201,0.000003032405,0.000006379056,0.0000277106,0.0003035806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6622092,"threshold_uncertainty_score":0.5268459,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961481,0.00008048227,0.0002290296,0.0001863996,0.00004302301,0.00004045268,0.0000594652,0.00007736681,0.00002334628],"category_scores_gemma":[0.0008777227,0.00006806562,0.00007281756,0.0003644588,0.00001625596,0.0002696413,0.00001290948,0.0001727675,0.00001267813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001178056,"about_ca_system_score_gemma":0.0002299428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000779907,"about_ca_topic_score_gemma":6.806047e-8,"domain_scores_codex":[0.9990001,0.00004560132,0.0003896323,0.00006728802,0.0003918139,0.0001055335],"domain_scores_gemma":[0.9984535,0.00005731199,0.0004025045,0.00008397726,0.0008948836,0.0001078463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01505681,0.005450469,0.05494278,0.0004842569,0.001436792,0.001694615,0.004751514,0.6600762,0.09798981,0.01230504,0.1308749,0.01493678],"study_design_scores_gemma":[0.06241751,0.01083409,0.0006845809,0.001075122,0.001425234,0.00859827,0.001413194,0.3646946,0.3849257,0.01392011,0.148931,0.001080613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8761363,0.001505902,0.06226442,0.001089914,0.02104432,0.0004444457,0.00000139784,0.0001615027,0.03735181],"genre_scores_gemma":[0.9599284,0.00003112061,0.03794626,0.0003793533,0.001582694,0.00000128833,0.000002259945,0.00002518585,0.000103451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2953816,"threshold_uncertainty_score":0.2775635,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0002417657,0.0001025585,0.0003156581,0.0001831712,0.0001129131,0.000007901997,0.00009371719,0.001841435,0.0006219637],"category_scores_gemma":[0.0003835299,0.00008336294,0.0001006174,0.0003007003,0.0001027655,0.0001547172,0.00001677456,0.001591735,0.00003230303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006990178,"about_ca_system_score_gemma":0.0002475866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001905445,"about_ca_topic_score_gemma":2.373526e-8,"domain_scores_codex":[0.9989167,0.00003522508,0.0004433484,0.00008426882,0.0003824772,0.00013802],"domain_scores_gemma":[0.9986512,0.00003988387,0.0003336215,0.0001185893,0.0007490704,0.0001076131],"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.0009471059,0.0003041883,0.0002918453,0.00001230811,0.00009730388,0.0001088098,0.0001159362,0.003793611,0.0001746164,0.001611877,0.992331,0.0002113664],"study_design_scores_gemma":[0.00680895,0.001593678,0.0001805415,0.0001111957,0.0001773765,0.0009711221,0.00004131699,0.0006521549,0.002361734,0.0005025484,0.9864578,0.0001415313],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.007103181,0.0006230931,0.01122649,0.01047477,0.9513118,0.0003688075,0.000001236508,0.0000818382,0.01880884],"genre_scores_gemma":[0.0320879,0.004998812,0.01458133,0.0003920861,0.9466059,0.000001596721,0.00001094953,0.00003679093,0.001284665],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02498472,"threshold_uncertainty_score":0.9994544,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053758,0.0001013751,0.0001246925,0.00005212122,0.00011676,0.00006698845,0.0001446023,0.00008943036,0.00001651669],"category_scores_gemma":[0.00008229517,0.00007693154,0.00007358737,0.00006387335,0.00003861131,0.00002265865,0.00004280888,0.0001254864,2.444475e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001415788,"about_ca_system_score_gemma":0.00006210518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003166456,"about_ca_topic_score_gemma":9.017182e-7,"domain_scores_codex":[0.9992357,0.00003594947,0.0003165726,0.0001148724,0.0001734501,0.0001234537],"domain_scores_gemma":[0.9991395,0.00004176447,0.0003398813,0.0001218466,0.000307722,0.00004929351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004463753,0.001648721,0.003482404,0.0003539813,0.002002615,0.000008160669,0.0006933959,0.2201465,0.5423642,0.007985799,0.02157042,0.1952801],"study_design_scores_gemma":[0.05352798,0.01780558,0.006210411,0.0001632787,0.001600029,0.0006922011,0.001381446,0.4993156,0.1301,0.04559515,0.2412765,0.002331866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08932164,0.0004912101,0.90213,0.001168209,0.005385726,0.001235632,0.00003508827,0.000009281092,0.0002232245],"genre_scores_gemma":[0.4381807,0.0008004349,0.5566226,0.0001338907,0.003751811,0.00004854699,0.0002916394,0.00005879831,0.0001116337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4122642,"threshold_uncertainty_score":0.3137178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182563,0.00007738353,0.0001837241,0.0001355534,0.00007087592,0.0001453039,0.0006962295,0.00005235312,0.000008334252],"category_scores_gemma":[0.0006085757,0.00005222059,0.00007001957,0.0005972621,0.00005295179,0.0007542818,0.0001073354,0.0001730348,0.000001074891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006816941,"about_ca_system_score_gemma":0.0006064114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006477958,"about_ca_topic_score_gemma":1.211859e-7,"domain_scores_codex":[0.9984277,0.0001991635,0.0005069735,0.000079424,0.0006657359,0.00012096],"domain_scores_gemma":[0.9973953,0.00007756484,0.0006065996,0.0002074801,0.001593944,0.0001191087],"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.00004138313,0.000195924,0.00005700784,0.000006645144,0.00002087274,0.000002886787,0.001083265,0.9354973,0.00003393369,0.05964857,0.001037285,0.002374937],"study_design_scores_gemma":[0.002318894,0.0006120329,0.00009778821,0.00005143943,0.00001625622,0.00004771937,0.0001413277,0.9772213,0.0005697016,0.01460549,0.004207273,0.0001107785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001182782,0.0001331766,0.9916915,0.002822733,0.002708226,0.0001070895,6.900277e-7,0.00001643661,0.001337373],"genre_scores_gemma":[0.3746933,0.0001279267,0.6244389,0.0001858559,0.0004735723,0.000001015772,0.00000308754,0.00001322267,0.00006311788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3735105,"threshold_uncertainty_score":0.2129494,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007218014,0.00005798683,0.0001110514,0.0001333231,0.00003402256,0.0000450386,0.0003228067,0.00002714468,0.000004625237],"category_scores_gemma":[0.00007011924,0.0000375499,0.00003416083,0.0005294146,0.00001877571,0.001053568,0.00001491219,0.00009404844,2.823018e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002577066,"about_ca_system_score_gemma":0.00008273178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000289819,"about_ca_topic_score_gemma":1.447348e-7,"domain_scores_codex":[0.9990005,0.0001446233,0.0002895894,0.00005102562,0.0004171463,0.00009704495],"domain_scores_gemma":[0.9991232,0.0002228598,0.0002978117,0.0001058983,0.0002173634,0.00003289369],"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.00005949815,0.0002274149,0.002445974,0.000009158093,0.00001142942,0.000002820538,0.001802674,0.9197112,0.0001439571,0.07373381,0.0001322453,0.001719788],"study_design_scores_gemma":[0.01570145,0.004205667,0.09890869,0.0005158072,0.0001565356,0.000511356,0.000741221,0.7988362,0.01874299,0.0558641,0.00483564,0.0009803713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07537825,0.0001520666,0.9225463,0.0004430884,0.001189964,0.00009001583,3.183755e-7,0.000003598416,0.0001963801],"genre_scores_gemma":[0.95009,0.00003349568,0.04964557,0.00006085547,0.0001627098,0.00000121205,0.000001041782,0.000002529188,0.000002600631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8747118,"threshold_uncertainty_score":0.1531241,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004662594,0.00007786763,0.0001644772,0.00002673612,0.00005156897,0.00000723643,0.000140922,0.00008174641,0.00000736504],"category_scores_gemma":[0.0001124024,0.0000444917,0.00009534202,0.0001210537,0.00006493511,0.000009501539,0.00005359924,0.00007056873,1.134867e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001195155,"about_ca_system_score_gemma":0.00004555853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003906413,"about_ca_topic_score_gemma":9.929221e-7,"domain_scores_codex":[0.9992773,0.0001371958,0.0002819209,0.00006047213,0.0001285616,0.0001145606],"domain_scores_gemma":[0.9990224,0.00002754757,0.0005638553,0.0001027049,0.0002406976,0.0000428514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.004774605,0.001256466,0.2064748,0.0001087002,0.0005856492,0.000004805952,0.000424702,0.09933481,0.6825486,0.002799566,0.001075855,0.0006114683],"study_design_scores_gemma":[0.01766799,0.01387223,0.1654332,0.0009616086,0.0007195369,0.0005481379,0.0005075484,0.002753956,0.7827832,0.003027135,0.01034466,0.001380863],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.991358,0.0001976892,0.007039229,0.00004620946,0.001063814,0.00006870903,0.000002813724,0.000001282128,0.0002222404],"genre_scores_gemma":[0.9979638,0.00003119264,0.001662836,0.00002439076,0.0002771304,3.304743e-7,0.000004716347,0.000006641601,0.00002895677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1002345,"threshold_uncertainty_score":0.1814319,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007808626,0.0001276728,0.0004213961,0.0002602296,0.00005998894,0.00009876192,0.0004589045,0.0001202445,0.00001930485],"category_scores_gemma":[0.0001167594,0.0001156787,0.0002027965,0.0003955412,0.00002308388,0.000866417,0.00006857924,0.0001783699,0.000003299486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007286706,"about_ca_system_score_gemma":0.0001303012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000110602,"about_ca_topic_score_gemma":2.000604e-7,"domain_scores_codex":[0.9983628,0.0002027996,0.0006950584,0.0001595608,0.0004129893,0.000166788],"domain_scores_gemma":[0.9979795,0.0001760431,0.0009566471,0.000255656,0.0005310294,0.0001011576],"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.0004077198,0.0008367748,0.005169816,0.0001041677,0.0004906152,0.00005543881,0.002330699,0.8507949,0.00635312,0.07274183,0.007911279,0.05280368],"study_design_scores_gemma":[0.002924831,0.001033713,0.0002980131,0.0001508155,0.0000235975,0.00013207,0.00005092671,0.98921,0.002507556,0.002807324,0.0006710297,0.0001901399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1104545,0.00006689922,0.8696492,0.00009284211,0.01907858,0.0001639057,9.021606e-7,0.00002266644,0.0004704919],"genre_scores_gemma":[0.9610576,0.00001277207,0.03855003,0.00003330247,0.0003064772,0.000001245529,7.593701e-7,0.00001084574,0.00002694507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8506032,"threshold_uncertainty_score":0.471724,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002273174,0.0001181439,0.0002749639,0.0001557184,0.0002897627,0.000637488,0.0008464044,0.00007681797,0.00008521537],"category_scores_gemma":[0.0003311463,0.00005906323,0.0001803544,0.0003283155,0.0000594334,0.0005816675,0.00002823462,0.0002616064,0.000006698842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008760597,"about_ca_system_score_gemma":0.0008341489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001522575,"about_ca_topic_score_gemma":0.00007333986,"domain_scores_codex":[0.9984519,0.0002811784,0.0004799413,0.0001179264,0.0004622034,0.0002067809],"domain_scores_gemma":[0.9972491,0.001159886,0.0004182544,0.0002638216,0.000810802,0.0000981132],"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.0005278373,0.0000318792,0.00000101229,0.000003159958,0.00002510829,2.895883e-7,0.0002252638,0.4869495,0.000002420048,0.5111561,0.0008399707,0.0002374132],"study_design_scores_gemma":[0.02426916,0.0002753905,0.000004962516,0.0000301256,0.00001896262,0.000005193926,0.00008642024,0.8640991,0.00001380054,0.1088864,0.002225266,0.00008521507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002552624,0.00005741535,0.9761607,0.01623107,0.002871639,0.001477169,0.000002642236,0.00001670763,0.002927368],"genre_scores_gemma":[0.7981842,0.0002046439,0.1980821,0.002235156,0.0005826635,0.00006131876,0.00001118672,0.00003621962,0.0006024825],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7979289,"threshold_uncertainty_score":0.6147312,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395385,0.0001107885,0.0001786817,0.0002964409,0.0001239397,0.0002716074,0.0008215292,0.000088591,0.00003363553],"category_scores_gemma":[0.0007949398,0.00009495455,0.0001095009,0.0003962062,0.00005656796,0.0008945231,0.00007652354,0.0005423992,0.00001504099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003051387,"about_ca_system_score_gemma":0.0001588459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004117742,"about_ca_topic_score_gemma":4.601977e-7,"domain_scores_codex":[0.9985612,0.00009309514,0.0004509784,0.0001418762,0.0005715714,0.0001812985],"domain_scores_gemma":[0.9984356,0.0002162185,0.0004108141,0.0002777153,0.0004977764,0.0001618713],"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.00005238974,0.0002059589,0.0002848587,0.000003943912,0.00002159906,0.00002125511,0.0008032647,0.2709031,0.002164817,0.6990901,0.001043557,0.02540513],"study_design_scores_gemma":[0.0008091407,0.001252473,0.000243576,0.00009119535,0.00001961065,0.000108979,0.0001072627,0.5584105,0.03722036,0.3984311,0.002918023,0.0003877992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03693411,0.00001535707,0.9436128,0.001491564,0.01550858,0.000102438,4.097911e-7,0.00005135209,0.002283356],"genre_scores_gemma":[0.843208,0.00002020779,0.1560322,0.0001317364,0.0005650488,0.000001162003,4.304192e-7,0.00001159539,0.00002964756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8062739,"threshold_uncertainty_score":0.3872134,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199566,0.0001842526,0.000466009,0.0001961721,0.000177037,0.00008553509,0.0003452417,0.0001211035,0.00007528115],"category_scores_gemma":[0.001451375,0.0001331823,0.0001909212,0.0006719659,0.0002192633,0.0004055624,0.00006393513,0.0002882566,6.143363e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001806708,"about_ca_system_score_gemma":0.0006863404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002106577,"about_ca_topic_score_gemma":0.000004279258,"domain_scores_codex":[0.9972107,0.0002546613,0.001284627,0.0001341662,0.0008440024,0.0002718487],"domain_scores_gemma":[0.9959391,0.0006546492,0.001608242,0.0002447647,0.001476487,0.00007671315],"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.0003407516,0.0008050166,0.0004416839,0.0001654636,0.0001035015,0.00002994004,0.0001958168,0.8764964,0.0007028776,0.1185907,0.001263168,0.0008646183],"study_design_scores_gemma":[0.0349713,0.003260978,0.0001029959,0.00201483,0.0009455287,0.001371299,0.001687861,0.3303717,0.03020843,0.5902644,0.003198746,0.001601954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211219,0.0002157526,0.9791534,0.0007255672,0.002572032,0.001671132,0.00001585149,0.00006388895,0.003470204],"genre_scores_gemma":[0.3482143,0.0000234937,0.6510736,0.00001172482,0.000354347,0.00001050415,0.00000496343,0.00004539599,0.0002616755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5461247,"threshold_uncertainty_score":0.5431015,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003527067,0.0002010302,0.0003455332,0.0001452537,0.0001036038,0.0001577391,0.0001543619,0.0000734411,0.0002179054],"category_scores_gemma":[0.0001352754,0.0001830325,0.00009139319,0.0005120844,0.00002042693,0.0003686341,0.00002715255,0.0003446699,0.00001023848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191277,"about_ca_system_score_gemma":0.0001282195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002411976,"about_ca_topic_score_gemma":8.803219e-7,"domain_scores_codex":[0.9984915,0.00009025518,0.0005926559,0.0001372957,0.0004710013,0.0002173175],"domain_scores_gemma":[0.9982643,0.00007530997,0.0002631319,0.0001534383,0.001093858,0.0001500223],"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.0000634562,0.00009317933,0.0002603364,0.00003105365,0.0001081296,0.00005654839,0.0001748193,0.9980989,0.00007776387,0.0003740138,0.0001566523,0.000505113],"study_design_scores_gemma":[0.004786432,0.0001283645,0.000009732818,0.0001720899,0.00007447723,0.0001349384,0.0000725702,0.9931175,0.0007680019,0.0001287972,0.0003925481,0.00021452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005701545,0.0004662525,0.9793496,0.0001986763,0.006736849,0.000187665,0.000007068858,0.0001885205,0.007163864],"genre_scores_gemma":[0.1112038,0.00014104,0.8874543,0.00005530323,0.0009480147,0.000003594753,0.00004977319,0.00007130971,0.00007288062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1055023,"threshold_uncertainty_score":0.746385,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363646,0.0000772336,0.0001813514,0.0003031833,0.0001225969,0.00005275671,0.0007739884,0.0000658666,0.000005585826],"category_scores_gemma":[0.0002238518,0.00007316235,0.00005776122,0.0007930225,0.00005732155,0.001244874,0.0001126474,0.0003148542,9.104818e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009798651,"about_ca_system_score_gemma":0.00008734258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002964275,"about_ca_topic_score_gemma":6.564769e-7,"domain_scores_codex":[0.9986621,0.0003012613,0.00043085,0.00009229078,0.0003530293,0.0001604983],"domain_scores_gemma":[0.9986755,0.0002329308,0.0003592787,0.0003022758,0.0003659027,0.00006408573],"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.00004689994,0.00008469422,0.001565825,9.76576e-7,0.000006261832,0.00002097245,0.0003124467,0.9299923,0.00002513458,0.06682894,0.00008968511,0.001025827],"study_design_scores_gemma":[0.002174216,0.0002378429,0.002264671,0.00007024759,0.000003374107,0.0001209714,0.00003209698,0.9406192,0.0002328576,0.05389963,0.0002063819,0.0001385274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009668251,0.0003984465,0.9882054,0.0002967084,0.000893852,0.00008432178,7.538917e-8,0.00001897761,0.0004340121],"genre_scores_gemma":[0.8893855,0.0006804725,0.1097901,0.00002372148,0.00009969281,0.000001619096,9.649016e-7,0.00000738845,0.00001057334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8797172,"threshold_uncertainty_score":0.2983474,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001841413,0.0001232777,0.0005986679,0.0006267685,0.0001852121,0.0002140294,0.0006314623,0.00007502233,0.00005562295],"category_scores_gemma":[0.0003064619,0.00008205663,0.0003683658,0.001171819,0.0001783061,0.000563458,0.00003682184,0.000125941,6.962404e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007930786,"about_ca_system_score_gemma":0.0006718021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003653117,"about_ca_topic_score_gemma":0.0005087269,"domain_scores_codex":[0.998132,0.000290012,0.0008394007,0.0001381716,0.000401214,0.000199237],"domain_scores_gemma":[0.9957293,0.0004365003,0.0008074817,0.0002112892,0.002676088,0.0001393865],"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.0007110216,0.0001278033,0.0000104404,0.000006153784,0.000598717,5.79459e-7,0.001137422,0.6031584,0.00001314503,0.3937417,0.0001073011,0.0003873129],"study_design_scores_gemma":[0.02473058,0.0002782744,0.00006168686,0.0000232489,0.0004450073,0.000001841553,0.0002492873,0.9696543,0.00005551091,0.003100861,0.001306982,0.0000924108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001109666,0.00007766838,0.9960899,0.001172893,0.001217993,0.0006439218,0.00001392029,0.00001083599,0.0006618645],"genre_scores_gemma":[0.3780223,0.0001879661,0.6212721,0.0001609545,0.0002498079,0.0000157034,0.00002064225,0.0000121914,0.00005827407],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3906408,"threshold_uncertainty_score":0.3346172,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595202,0.0001175674,0.0001844519,0.00009359956,0.0000553109,0.0001039444,0.0001949126,0.00009126303,0.00004641866],"category_scores_gemma":[0.00004399522,0.00007761211,0.0001136062,0.0001133591,0.00002094948,0.0003991646,0.00001109068,0.0001395029,0.000002700106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004978506,"about_ca_system_score_gemma":0.00002151106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000236293,"about_ca_topic_score_gemma":7.598026e-8,"domain_scores_codex":[0.9991862,0.00002426329,0.0003975863,0.00005845135,0.0001860337,0.0001475043],"domain_scores_gemma":[0.9992187,0.0001550188,0.0001524991,0.000109009,0.0003111794,0.00005356955],"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.000151909,0.0003064897,0.0001623294,0.0001893654,0.000480757,0.00001239267,0.0008534987,0.6229569,0.009330449,0.002688723,0.1446305,0.2182367],"study_design_scores_gemma":[0.002169159,0.000806951,0.0001019506,0.00007634549,0.0001364242,0.00005338629,0.00005648207,0.9710824,0.007813041,0.009707447,0.007722992,0.00027345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001026027,0.0002327187,0.9948063,0.0002293066,0.002458797,0.0005436586,0.000002129555,0.00007327763,0.0006277663],"genre_scores_gemma":[0.4855169,0.0003142317,0.5109392,0.00008544885,0.002592953,0.00017118,0.000007686416,0.0001005773,0.0002718263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4844909,"threshold_uncertainty_score":0.316493,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746794,0.00009875642,0.0002293491,0.0005132093,0.00006873551,0.0001011933,0.0005630003,0.00005897051,0.0000589398],"category_scores_gemma":[0.0001147507,0.00009157608,0.000106844,0.001163783,0.00003640144,0.001021344,0.00005154181,0.0001540048,0.000004145059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005342982,"about_ca_system_score_gemma":0.0001418497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000368536,"about_ca_topic_score_gemma":3.401607e-7,"domain_scores_codex":[0.9983947,0.000142335,0.0006608458,0.0001253881,0.0005287616,0.0001480253],"domain_scores_gemma":[0.9978271,0.00007319906,0.0007457397,0.0002577275,0.0009893078,0.0001069519],"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.00006934693,0.0002405521,0.0004347005,0.00001318946,0.00002663256,0.000005807758,0.0002172622,0.8870621,0.0004165726,0.1089992,0.0009763952,0.001538243],"study_design_scores_gemma":[0.005083735,0.0009574431,0.000784261,0.0001736269,0.00004339272,0.00006812456,0.00004415362,0.9385535,0.003923427,0.03992742,0.01006829,0.000372667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002670022,0.00009574286,0.9945013,0.001245541,0.002565607,0.0001291987,3.860907e-7,0.00002666382,0.001168585],"genre_scores_gemma":[0.4037691,0.0003841625,0.5951508,0.00009009414,0.0002833445,0.000003590206,0.000005697232,0.00001622074,0.0002969328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4035021,"threshold_uncertainty_score":0.3734364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007548969,0.0001096711,0.0003270562,0.000575002,0.0003196476,0.0002872364,0.0003559231,0.00009644851,0.00003728111],"category_scores_gemma":[0.01093869,0.00008581145,0.0002646175,0.00101734,0.00003632853,0.0003830212,0.00002541549,0.0001713646,0.000005257637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006737349,"about_ca_system_score_gemma":0.0001255667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004912521,"about_ca_topic_score_gemma":1.649978e-7,"domain_scores_codex":[0.9976034,0.0002922441,0.001013878,0.0001809198,0.0006975906,0.0002119493],"domain_scores_gemma":[0.9935426,0.003369975,0.001058969,0.0001963667,0.001753582,0.00007854946],"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.0001403442,0.0001389696,0.0001922067,0.000001730685,0.00001798418,8.227966e-7,0.00004070804,0.8464494,0.0001702317,0.1480393,0.002546395,0.002261906],"study_design_scores_gemma":[0.002891366,0.0005374356,0.0001932017,0.00004610321,0.00008844941,0.00001353114,0.0000816739,0.2197305,0.00275106,0.7626322,0.01085231,0.0001822084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01076601,0.0001092219,0.9749966,0.0003044337,0.01236371,0.0001306188,0.000001879883,0.00001941649,0.001308056],"genre_scores_gemma":[0.2650865,0.000005536499,0.7334011,0.00003368459,0.001213523,0.000004937645,0.000003065169,0.00001576392,0.0002358985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6267189,"threshold_uncertainty_score":0.9973926,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006015208,0.0001299748,0.0003182232,0.0005183535,0.0001282719,0.00009570929,0.000698634,0.0001137418,0.000139589],"category_scores_gemma":[0.0002785381,0.000125637,0.0001938076,0.001245489,0.00005928722,0.0009117833,0.0001063969,0.0002800595,0.000007965344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005967978,"about_ca_system_score_gemma":0.00004765871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004672504,"about_ca_topic_score_gemma":1.239331e-7,"domain_scores_codex":[0.9981608,0.0001209112,0.0007988405,0.0001414365,0.0005908859,0.0001871287],"domain_scores_gemma":[0.9976699,0.0002354119,0.001002499,0.0003176355,0.0006660821,0.0001084313],"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.0000697745,0.001015671,0.0005910762,0.00006099984,0.0001783245,0.00003901426,0.001094556,0.5723305,0.0003251404,0.4054894,0.00455826,0.01424734],"study_design_scores_gemma":[0.002699823,0.0005930211,0.0002000156,0.000101069,0.00005837443,0.0001689261,0.0000202479,0.9293103,0.001031439,0.06238912,0.003164234,0.0002633931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002437117,0.0005264325,0.990676,0.000523429,0.004819364,0.00009280912,0.000002643656,0.00003356956,0.0008885953],"genre_scores_gemma":[0.5081832,0.0005111666,0.4905804,0.0000608163,0.0004763396,0.000002105576,0.000003275479,0.00001805837,0.0001646069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5057461,"threshold_uncertainty_score":0.5123326,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177231,0.0001561834,0.0002186823,0.0002951732,0.0001913814,0.000139764,0.0001997638,0.00007631343,0.00007361344],"category_scores_gemma":[0.00008842102,0.0001094967,0.00006202965,0.0004641619,0.00007161704,0.002982397,0.0000309612,0.00008081672,0.000007538808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001654165,"about_ca_system_score_gemma":0.0001174493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008686628,"about_ca_topic_score_gemma":0.000004301396,"domain_scores_codex":[0.9984621,0.00003670514,0.0005830543,0.0001936103,0.0005253105,0.0001992445],"domain_scores_gemma":[0.9968939,0.00002407202,0.0003511001,0.0001766496,0.002523844,0.00003044724],"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.0004328141,0.0003826256,0.0004842778,0.0002505009,0.00005742084,7.843677e-7,0.00007553878,0.9501212,0.0002819459,0.009539437,0.0001469845,0.03822643],"study_design_scores_gemma":[0.002458188,0.0001775426,0.0001152333,0.00009607254,0.00006554359,0.000002093378,0.0002343111,0.9939117,0.0003321059,0.001281708,0.001146603,0.0001788722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01411325,0.00001341569,0.9839106,0.0004919512,0.0008253254,0.0005273697,0.000004659435,0.00003895298,0.00007446775],"genre_scores_gemma":[0.6827602,0.00001588881,0.3156177,0.0001034977,0.001331723,0.00002122949,0.00007828265,0.00002766105,0.00004390686],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6686469,"threshold_uncertainty_score":0.4465147,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006165267,0.0001639362,0.0003904253,0.0002751451,0.0001040784,0.00002604016,0.0001684317,0.0002039499,0.00002454116],"category_scores_gemma":[0.000373186,0.0001605224,0.0001374133,0.0002492502,0.00002924171,0.0003670225,0.00001321557,0.0002052443,8.016046e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000877206,"about_ca_system_score_gemma":0.00006276011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001389438,"about_ca_topic_score_gemma":5.513727e-8,"domain_scores_codex":[0.9987662,0.00009173511,0.0006452203,0.00009933468,0.0002069812,0.0001905516],"domain_scores_gemma":[0.9987901,0.0002195406,0.0002743131,0.0001150694,0.0005169568,0.0000840331],"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.0001018317,0.00005209811,0.00005523991,0.00002577127,0.00005194805,0.00001023519,0.0001868425,0.995799,0.0007461821,0.0002537468,0.002203915,0.0005131589],"study_design_scores_gemma":[0.00185748,0.0004599477,0.000008124551,0.00004397142,0.00006416592,0.0001629387,0.00003031615,0.9846958,0.010548,0.0006201419,0.001315264,0.0001938855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003099166,0.0002656271,0.9929583,0.00005205987,0.002998682,0.0002365109,0.000006211776,0.0001656834,0.0002177658],"genre_scores_gemma":[0.04156905,0.0004775142,0.956642,0.00003308617,0.001150931,0.00001140239,0.00003581687,0.00005699383,0.00002318675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03846988,"threshold_uncertainty_score":0.6545914,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877186,0.0001342382,0.0001855528,0.0001625268,0.0008501087,0.0005776275,0.0004878589,0.00007506526,0.00005999831],"category_scores_gemma":[0.0003724728,0.0001009035,0.0001035489,0.0002412627,0.0001122908,0.002147847,0.00007772928,0.0001477905,0.0000155085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191346,"about_ca_system_score_gemma":0.0000771635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003222315,"about_ca_topic_score_gemma":0.0000130666,"domain_scores_codex":[0.9985964,0.00002172873,0.0005773352,0.0001410871,0.0004806836,0.000182728],"domain_scores_gemma":[0.996821,0.00004085918,0.0005640336,0.0003295311,0.002225973,0.00001864432],"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.0001501856,0.0001885557,0.0001051041,0.000179682,0.00007600272,5.442737e-7,0.0001183689,0.8968061,0.000008061302,0.02562086,0.00179222,0.07495437],"study_design_scores_gemma":[0.001628284,0.0000468234,0.0005963891,0.00003147522,0.00009148964,0.000001020949,0.0003333974,0.9846468,0.00004373529,0.004479831,0.007980903,0.0001198286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009819363,0.00002559188,0.9918041,0.002723258,0.002856319,0.000751852,0.000004701822,0.0000259914,0.000826207],"genre_scores_gemma":[0.9705629,0.00005090493,0.02759453,0.0002019286,0.001252219,0.00005051194,0.0001014615,0.00001995178,0.0001655832],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695809,"threshold_uncertainty_score":0.6538435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003590999,0.0001126949,0.000195486,0.0002404214,0.0000895459,0.00004417603,0.0001697371,0.0001293036,0.00002050704],"category_scores_gemma":[0.0001398704,0.0001086926,0.0002180068,0.0003193815,0.00002159297,0.0000228369,0.00003109657,0.00007313366,0.000001004449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007408125,"about_ca_system_score_gemma":0.00009242334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.307058e-7,"about_ca_topic_score_gemma":8.55124e-7,"domain_scores_codex":[0.9989645,0.0000642734,0.0004825316,0.0001747671,0.0001873068,0.0001266269],"domain_scores_gemma":[0.9986858,0.00001795845,0.0005731817,0.0002037237,0.0004365748,0.00008272347],"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.0004529333,0.0001496428,0.0004973991,0.00001132357,0.0002181869,2.568603e-7,0.00005980059,0.6884972,0.3053814,0.0002794944,0.001708602,0.002743742],"study_design_scores_gemma":[0.004811849,0.001193765,0.009103964,0.00005421321,0.0008621936,0.00001329201,0.0002106142,0.7241048,0.2085891,0.0001685262,0.05036865,0.0005190758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1863502,0.0002259304,0.8106378,0.0008044408,0.001546821,0.00020489,0.000004323036,0.00001089248,0.0002146736],"genre_scores_gemma":[0.9648653,0.0002230617,0.03354746,0.00007438134,0.001104403,0.0000128928,0.00007046865,0.00001870106,0.00008335185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.778515,"threshold_uncertainty_score":0.4432357,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004724387,0.0001211774,0.0002112049,0.0003887929,0.0001340126,0.0004233054,0.000639895,0.0001034005,0.0004154602],"category_scores_gemma":[0.0001047093,0.0001040635,0.00008764189,0.000537478,0.00002444317,0.001478767,0.00004076026,0.0001895243,0.00004052128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001414998,"about_ca_system_score_gemma":0.0005376439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001844694,"about_ca_topic_score_gemma":0.0000406465,"domain_scores_codex":[0.9984717,0.0001417721,0.0005371117,0.000135257,0.000434291,0.0002798843],"domain_scores_gemma":[0.9978805,0.00003662764,0.0003250773,0.0002116814,0.001135812,0.0004102571],"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.000005038451,0.00008021363,0.0001018298,0.000007847273,0.00003124657,0.000005805915,0.000486313,0.9065456,0.000117901,0.08096834,0.00962259,0.002027313],"study_design_scores_gemma":[0.00217225,0.0002771165,0.0001506386,0.00003065359,0.000008504367,0.000040168,0.00001751136,0.9712268,0.0002052197,0.01644718,0.00921045,0.0002135443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008926885,0.0000913671,0.9860761,0.004329685,0.003677871,0.0004042728,6.436999e-7,0.00003913103,0.004488252],"genre_scores_gemma":[0.2987098,0.0002899615,0.6988647,0.0008396737,0.0005510161,0.00002098797,0.000008799733,0.00003346739,0.0006815955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2978171,"threshold_uncertainty_score":0.4548998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007336813,0.0001808473,0.0003329995,0.0002328969,0.0002245049,0.0002337584,0.0009668889,0.000125058,0.00004701852],"category_scores_gemma":[0.0001813985,0.0001366384,0.0001837635,0.0006950668,0.00005333998,0.0009233813,0.0001205145,0.0003417711,0.000005171157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001383517,"about_ca_system_score_gemma":0.0004332616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006458255,"about_ca_topic_score_gemma":0.00000137594,"domain_scores_codex":[0.9976575,0.0002171418,0.0008829451,0.0001970572,0.0007858594,0.0002595386],"domain_scores_gemma":[0.9975929,0.0001713487,0.001047772,0.0002993055,0.0007600244,0.0001286512],"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.00007863035,0.0003687736,0.00009881397,0.00001987705,0.00002067669,0.000004856618,0.0004600076,0.9820893,0.0003079456,0.01544549,0.0004767989,0.0006288498],"study_design_scores_gemma":[0.003197146,0.0007342258,0.00009655448,0.0001630899,0.00004458845,0.00004726745,0.00005891694,0.9874484,0.005772328,0.001320182,0.0008802508,0.0002370547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02323306,0.0002802159,0.9571854,0.003695976,0.007266866,0.0008391993,0.000003807957,0.0000730938,0.007422341],"genre_scores_gemma":[0.6542891,0.0001993364,0.3432285,0.0001133203,0.001965343,0.000002634004,0.000002364217,0.0000243866,0.0001750086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.631056,"threshold_uncertainty_score":0.5571952,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091401,0.0001255625,0.0002238289,0.0001325133,0.0004350379,0.0001670467,0.0008648168,0.00008695423,0.00001415534],"category_scores_gemma":[0.0002431139,0.00008712402,0.000149239,0.0005061924,0.00006572744,0.001001939,0.00008503571,0.00022415,0.000002582608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007791138,"about_ca_system_score_gemma":0.0003702406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003849925,"about_ca_topic_score_gemma":1.490248e-7,"domain_scores_codex":[0.9983497,0.0001222246,0.000565976,0.0001524727,0.0005782848,0.0002312863],"domain_scores_gemma":[0.9974913,0.0003148159,0.0005175599,0.0002677811,0.001289682,0.0001188645],"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.00008201629,0.0002708755,0.0001815732,0.00001830382,0.00007046378,0.00001036118,0.001006323,0.9027239,0.00003161264,0.08399241,0.006947532,0.004664611],"study_design_scores_gemma":[0.002662363,0.0005078315,0.0001204439,0.00001971435,0.00001959662,0.0001152969,0.00001889237,0.9740924,0.0002541255,0.008611847,0.01342388,0.0001536365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001098331,0.0001729264,0.9929973,0.002482282,0.003415599,0.0004706081,0.000001488607,0.00003965972,0.0003102606],"genre_scores_gemma":[0.03822669,0.0007684382,0.9596705,0.0002111239,0.0008272452,0.00002260676,0.000004521866,0.00002159598,0.0002472863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07538057,"threshold_uncertainty_score":0.3552814,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265759,0.0001115479,0.0001720542,0.00008115488,0.0001488414,0.0001199809,0.0001603415,0.00008019971,0.00007869593],"category_scores_gemma":[0.0002290116,0.00008810639,0.0001041186,0.0002399026,0.00002229464,0.0002972946,0.000008531394,0.0001614344,0.000004377242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000106951,"about_ca_system_score_gemma":0.00002225497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.242261e-7,"about_ca_topic_score_gemma":7.296302e-8,"domain_scores_codex":[0.9989966,0.00003024848,0.0004670568,0.00006773237,0.0002782157,0.0001602003],"domain_scores_gemma":[0.9989984,0.0001283553,0.0002065815,0.0001042887,0.0005017131,0.00006064758],"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.00001119867,0.00003045577,0.00001059664,0.00001758879,0.0000357749,7.004194e-7,0.0003620855,0.996065,0.00003872635,0.0007586874,0.002019451,0.000649801],"study_design_scores_gemma":[0.001408332,0.00009968458,0.000003521891,0.00005204383,0.00004376449,0.00002007548,0.00006668931,0.994215,0.0003511086,0.0007090717,0.002922001,0.0001086674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001290759,0.001024094,0.9879255,0.0007301759,0.007225921,0.0002676941,0.000002426846,0.00009831295,0.001435113],"genre_scores_gemma":[0.4847935,0.0007273601,0.5116414,0.0001170315,0.002405439,0.00003548506,0.000009487317,0.00009524369,0.0001750079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4835028,"threshold_uncertainty_score":0.3592874,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007581454,0.000220104,0.0003772433,0.0004038619,0.0005321428,0.0001949472,0.0006383322,0.0001139617,0.00005247808],"category_scores_gemma":[0.00008818183,0.000208394,0.0001389407,0.0007385272,0.0001923471,0.001642509,0.0001699336,0.0002603934,0.000001360188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007756559,"about_ca_system_score_gemma":0.0002025508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008967942,"about_ca_topic_score_gemma":6.676575e-8,"domain_scores_codex":[0.9978824,0.0002926287,0.0006932239,0.0002607343,0.0006228711,0.0002481731],"domain_scores_gemma":[0.9982491,0.0001590009,0.0006427518,0.0002524038,0.0005133608,0.0001834559],"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.0003961701,0.0006481174,0.00241919,0.00003504055,0.0001701324,0.000203389,0.002456772,0.8226575,0.000205452,0.1667306,0.001931213,0.002146457],"study_design_scores_gemma":[0.009146118,0.003259417,0.0006456636,0.0001436973,0.0001131056,0.001083725,0.0002278868,0.9264815,0.0006036775,0.05522406,0.002299987,0.0007712044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02442199,0.0005542338,0.9629089,0.0007250201,0.01064063,0.0002400919,0.000003842856,0.00009558118,0.00040976],"genre_scores_gemma":[0.658083,0.0007167142,0.3402341,0.0001316754,0.0007870735,0.000004670954,0.0000137073,0.00002055893,0.000008444444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.633661,"threshold_uncertainty_score":0.8498061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}