{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":892,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":892,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"95578f84ce5a","filters":{"topic":"Optimization and Search Problems"}},"results":[{"id":"W2114871659","doi":"10.1109/tac.2004.825639","title":"Local Control Strategies for Groups of Mobile Autonomous Agents","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":859,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Focus (optics); Control (management); Computer science; Mathematical optimization; Mobile robot; Point (geometry); Autonomous agent; Control theory (sociology); Distributed computing; Mathematics; Artificial intelligence; Economics","authors":[{"name":"Zhiyun Lin","is_ca":true},{"name":"Mireille E. Broucke","is_ca":true},{"name":"Brian Francis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01522188186033223,"gpt":0.2627341175685133,"spread":0.2475122357081811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005797617,0.0006856321,0.0003907698,0.0004403825,0.0003957493,0.001111618,0.0009326804,0.0006345324,0.001672414],"category_scores_gemma":[0.001766989,0.0001712729,0.0002534684,0.0003059749,0.001147868,0.0007723214,0.001121903,0.0005513321,0.0003472246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008311805,"about_ca_system_score_gemma":0.0004243742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002496861,"about_ca_topic_score_gemma":0.001743051,"domain_scores_codex":[0.9996941,0.00009286022,0.0000140711,0.00005934932,0.00009021006,0.00004946494],"domain_scores_gemma":[0.9994656,0.0002536864,0.0001014775,0.00003630596,0.0000892212,0.00005359783],"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.0001351326,0.00008912079,0.000613572,0.00019066,0.00005555484,0.0003349117,0.0007327929,0.6959161,0.008745503,0.2187402,0.001873854,0.0725726],"study_design_scores_gemma":[0.00005236683,0.0001511278,0.000151259,0.00001589761,0.00001610232,0.00004025091,0.0001173385,0.9190264,0.001097874,0.07721581,0.002104838,0.00001083689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07803018,0.00123516,0.9059486,0.0004868086,0.00006660617,0.00007681721,0.00002742086,0.0002510959,0.01387739],"genre_scores_gemma":[0.9675274,0.000471071,0.02423491,0.00006968505,0.00003494614,0.00017281,0.00003436749,0.00002348017,0.007431353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002496861,"threshold_uncertainty_score":0.006030738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010017329","doi":"10.1016/j.tcs.2005.01.001","title":"Gathering of asynchronous robots with limited visibility","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":396,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Visibility; Asynchronous communication; Robot; Computer science; Orientation (vector space); Mobile robot; Convergence (economics); Computation; Protocol (science); Point (geometry); Artificial intelligence; Distributed computing; Computer vision; Theoretical computer science; Algorithm; Mathematics; Telecommunications; Geography; Geometry","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01010129519343213,"gpt":0.2481306823814104,"spread":0.2380293871879783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041735,0.0009478357,0.0014558,0.001333656,0.001524076,0.001606748,0.00199931,0.001528063,0.003324182],"category_scores_gemma":[0.008131398,0.0009887179,0.0008747936,0.001019353,0.001377421,0.002749164,0.003015001,0.001043032,0.0004162323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007348095,"about_ca_system_score_gemma":0.0006722859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001870432,"about_ca_topic_score_gemma":0.001705719,"domain_scores_codex":[0.9994592,0.0001429362,0.00002887385,0.0001322097,0.0001164187,0.0001204592],"domain_scores_gemma":[0.9936596,0.003969991,0.0008669955,0.0004322065,0.0003969592,0.0006743584],"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.001408846,0.0002119456,0.00240741,0.000364104,0.0001172489,0.0007184198,0.0005417521,0.8388005,0.01247786,0.1103693,0.001988305,0.03059415],"study_design_scores_gemma":[0.0000849385,0.0001272756,0.0003204925,0.00001071597,0.00002469408,0.00005283003,0.00007206877,0.9548174,0.0009741313,0.04298267,0.0005186253,0.00001417052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4133667,0.0003882577,0.5761545,0.0004456305,0.00009391135,0.00009278255,0.0001252468,0.0002751942,0.009057682],"genre_scores_gemma":[0.9575259,0.0002310366,0.03553186,0.0000464704,0.00007049714,0.00009972924,0.0001219087,0.00006429185,0.00630832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003324182,"threshold_uncertainty_score":0.0111205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975531816","doi":"10.1016/j.tcs.2008.07.026","title":"Arbitrary pattern formation by asynchronous, anonymous, oblivious robots","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Task (project management); Asynchronous communication; Set (abstract data type); Computer science; Mobile robot; Compass; Point (geometry); Artificial intelligence; Mathematics; Engineering; Geography; Geometry; Programming language","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Peter Widmayer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01135423358031027,"gpt":0.2296839927461103,"spread":0.2183297591658001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156999,0.0003738559,0.0006703352,0.0004687843,0.0008078068,0.0009565131,0.00182793,0.0009046169,0.002309531],"category_scores_gemma":[0.006495263,0.0004439388,0.0005124789,0.0006595819,0.001456472,0.002005101,0.002417689,0.0008617369,0.0004716648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004936854,"about_ca_system_score_gemma":0.0008313282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007232275,"about_ca_topic_score_gemma":0.0009088113,"domain_scores_codex":[0.9990056,0.0003081476,0.00005579116,0.0002113711,0.0002564069,0.0001627301],"domain_scores_gemma":[0.9964223,0.001527522,0.0005377168,0.0009343752,0.0002662643,0.0003118234],"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.001057744,0.0001940332,0.002547722,0.00020251,0.00009988248,0.000467809,0.0005550447,0.5667864,0.02004783,0.3166039,0.003568062,0.08786912],"study_design_scores_gemma":[0.0001112765,0.0001263959,0.0003437907,0.0000090078,0.00002232269,0.0001266144,0.00008815787,0.827382,0.005252087,0.1644569,0.002063507,0.00001795508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2088098,0.0001164988,0.7793878,0.000470522,0.00007969046,0.0001160041,0.00009944763,0.000623357,0.01029684],"genre_scores_gemma":[0.9206671,0.00008738089,0.07088132,0.0000800151,0.00002542027,0.0001398035,0.00007945278,0.00007702561,0.007962399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002309531,"threshold_uncertainty_score":0.007726133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044712489","doi":"10.1016/s0304-3975(01)00303-6","title":"Searching games with errors—fifty years of coping with liars","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":211,"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 en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01614613090359288,"gpt":0.2451831090415628,"spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005793731,0.0007389262,0.0008743478,0.001066066,0.00177649,0.004648072,0.002391724,0.003585358,0.003234327],"category_scores_gemma":[0.02724425,0.0004301251,0.0006114682,0.0009897499,0.008140598,0.009659651,0.003309438,0.003390028,0.0004574127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961897,"about_ca_system_score_gemma":0.001603818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002717821,"about_ca_topic_score_gemma":0.003802077,"domain_scores_codex":[0.997265,0.001594458,0.0001222666,0.0002565935,0.0004048216,0.0003569208],"domain_scores_gemma":[0.9849764,0.01044162,0.001079693,0.001185783,0.001149722,0.001166835],"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.0003697485,0.0004352718,0.007635623,0.0004996833,0.0002081504,0.000348612,0.01061513,0.03241645,0.0006416409,0.7094334,0.02206654,0.2153297],"study_design_scores_gemma":[0.0000884793,0.0002080276,0.00216169,0.0006734286,0.00006077614,0.0002541746,0.007640851,0.05296816,0.0005727761,0.8289468,0.106329,0.00009589775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3458794,0.1103029,0.2323319,0.153579,0.00239343,0.0001779062,0.0001572356,0.0005019087,0.1546763],"genre_scores_gemma":[0.9160962,0.02484183,0.03500925,0.005196786,0.001278476,0.0001717822,0.00009622345,0.0001330818,0.01717634],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005793731,"threshold_uncertainty_score":0.03064054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118877434","doi":"10.1007/s00453-001-0003-0","title":"Optimal Search and One-Way Trading Online Algorithms","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":210,"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":"Competitive analysis; Portfolio; Stochastic game; Computer science; Online algorithm; Adversary; Mathematical economics; Economics; Algorithm; Mathematics; Upper and lower bounds; Financial economics","authors":[{"name":"Ran El‐Yaniv","is_ca":false},{"name":"Amos Fiat","is_ca":false},{"name":"Richard M. Karp","is_ca":false},{"name":"G. Turpin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04645055543326879,"gpt":0.2911219949819577,"spread":0.2446714395486889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002942438,0.001292301,0.00259838,0.0008870355,0.001040912,0.003463228,0.002436314,0.003788895,0.01065294],"category_scores_gemma":[0.02097902,0.0008506743,0.001000476,0.002413637,0.003197538,0.009457158,0.002438766,0.004051353,0.0009727311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001228943,"about_ca_system_score_gemma":0.001070801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008752346,"about_ca_topic_score_gemma":0.0008034579,"domain_scores_codex":[0.9977605,0.001235692,0.00009092547,0.0003650798,0.0003754387,0.0001724122],"domain_scores_gemma":[0.9887399,0.009399112,0.0004860889,0.0008183814,0.0003464455,0.0002101152],"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.000313722,0.0002392738,0.0007041538,0.0003138181,0.00009441823,0.00009172079,0.0001291204,0.1390782,0.0004045322,0.7740598,0.006140816,0.0784305],"study_design_scores_gemma":[0.00003868498,0.00003035643,0.0001197936,0.0000192312,0.00002050001,0.00004489116,0.00001968269,0.2187575,0.0001553236,0.7790459,0.001738232,0.000009861984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04447879,0.008897284,0.9138749,0.00295907,0.0005389432,0.00006400551,0.0001258401,0.0002838954,0.02877719],"genre_scores_gemma":[0.7505208,0.005152346,0.2081164,0.000517999,0.0008751506,0.0002672497,0.0002577577,0.0002554581,0.03403676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01065294,"threshold_uncertainty_score":0.03563762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144182788","doi":"10.1016/j.tcs.2007.09.032","title":"Gathering asynchronous oblivious mobile robots in a ring","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Snapshot (computer storage); Robot; Asynchronous communication; Computer science; Mobile robot; Node (physics); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence; Engineering; Operating system","authors":[{"name":"Ralf Klasing","is_ca":false},{"name":"Ευριπίδης Μάρκου","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009868126200166685,"gpt":0.2698464193739304,"spread":0.2599782931737638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635154,0.0006313457,0.001336256,0.0008419569,0.00157175,0.001338108,0.001883936,0.001102525,0.004044795],"category_scores_gemma":[0.006606077,0.0005923327,0.000592298,0.0009184346,0.001286731,0.003667078,0.003879284,0.001114571,0.0007695107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006270033,"about_ca_system_score_gemma":0.000665208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004759983,"about_ca_topic_score_gemma":0.0006236786,"domain_scores_codex":[0.9991102,0.0002879667,0.00005471195,0.0001959064,0.0001639452,0.0001873588],"domain_scores_gemma":[0.9946828,0.00306725,0.0007197742,0.0007898108,0.000294697,0.0004456404],"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.002490449,0.0003408027,0.002689067,0.0006353147,0.0001779139,0.0006582446,0.0009722957,0.6791614,0.0334267,0.2191378,0.004123767,0.05618636],"study_design_scores_gemma":[0.000128915,0.0003624801,0.0002649779,0.00001802082,0.00005033999,0.0001287076,0.0002026789,0.9247347,0.005638298,0.06632079,0.002125144,0.00002502541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3239764,0.0003534922,0.6653677,0.000863163,0.000104846,0.000185556,0.0001425592,0.0006171737,0.008389221],"genre_scores_gemma":[0.9026564,0.0002355241,0.08685754,0.00007969287,0.00007364582,0.0002077653,0.00008067811,0.00007383189,0.00973498],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004044795,"threshold_uncertainty_score":0.01353121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912100673","doi":"","title":"Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Vision; Computer science; Library science; Operations research; Autonomous agent; Track (disk drive); Artificial intelligence; Engineering; Sociology","authors":[{"name":"Ana L. C. Bazzan","is_ca":false},{"name":"Michael N. Huhns","is_ca":false},{"name":"Alessio Lomuscio","is_ca":false},{"name":"Paul Scerri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04896267297995336,"gpt":0.27961300150657,"spread":0.2306503285266166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002370212,0.001292192,0.001575073,0.001079425,0.001094553,0.006706938,0.002057754,0.002474156,0.0624421],"category_scores_gemma":[0.00531153,0.0003851092,0.0008327116,0.0009381817,0.001266612,0.003235324,0.002628703,0.0027111,0.02594285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009960876,"about_ca_system_score_gemma":0.00302313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326186,"about_ca_topic_score_gemma":0.001913738,"domain_scores_codex":[0.9980611,0.0005178259,0.0001775453,0.0003266015,0.0007557402,0.0001611353],"domain_scores_gemma":[0.9976196,0.0006518051,0.0001437068,0.0003431313,0.0008865686,0.0003552709],"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.0002139293,0.0002380185,0.001101062,0.0008932109,0.0001734689,0.0005246341,0.0004380281,0.005262786,0.003328802,0.05176752,0.5448789,0.3911797],"study_design_scores_gemma":[0.00001796596,0.00005117078,0.0005410977,0.0001956373,0.00004464284,0.0002637473,0.0001626142,0.006588215,0.0006830026,0.01375572,0.9776707,0.00002555438],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01272711,0.09078293,0.2711343,0.02712774,0.08431708,0.000912104,0.001953293,0.004696493,0.506349],"genre_scores_gemma":[0.1487282,0.09014888,0.1429092,0.008298613,0.02169738,0.001477555,0.0104167,0.001246305,0.5750772],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.0624421,"threshold_uncertainty_score":0.2088896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"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 en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","authors":[{"name":"Anders Dessmark","is_ca":false},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00716953051749322,"gpt":0.2238464719368621,"spread":0.2166769414193689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452821,0.000985904,0.001994446,0.001426419,0.002780602,0.003282903,0.003040523,0.002434256,0.009044521],"category_scores_gemma":[0.01273242,0.001289191,0.001119511,0.002264237,0.004251047,0.006404631,0.003677689,0.002654053,0.001082439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329163,"about_ca_system_score_gemma":0.001522697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006154896,"about_ca_topic_score_gemma":0.007691697,"domain_scores_codex":[0.9983359,0.0005649762,0.00006518399,0.0004580183,0.0002550575,0.0003208701],"domain_scores_gemma":[0.9909333,0.006552436,0.0006041919,0.001037707,0.0003377384,0.0005346468],"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.0005716782,0.0001076684,0.001153391,0.0003161156,0.0001044,0.0002245691,0.0006130697,0.3057693,0.001924651,0.6487612,0.007769501,0.03268446],"study_design_scores_gemma":[0.00009859689,0.00003449892,0.0002158011,0.00003426232,0.00003711797,0.00009368231,0.0002160379,0.2950231,0.001242269,0.6996757,0.003305989,0.00002299522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4227057,0.002419023,0.5222675,0.004065999,0.0002263105,0.0002390178,0.0008096251,0.001232831,0.046034],"genre_scores_gemma":[0.9064116,0.0009107147,0.07177787,0.0002537952,0.00008441443,0.0001862,0.0004800956,0.0004122666,0.01948304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009044521,"threshold_uncertainty_score":0.03025699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039936247","doi":"10.1016/j.tcs.2005.07.014","title":"Graph exploration by a finite automaton","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":176,"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 en Outaouais","funders":"","keywords":"Traverse; Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Butterfly graph; Robot; Regular graph; Upper and lower bounds; Voltage graph; Computer science; Line graph; Artificial intelligence","authors":[{"name":"Pierre Fraigniaud","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Guy Peer","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01346512824973406,"gpt":0.2579631548572839,"spread":0.2444980266075498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871408,0.0003641258,0.0007016008,0.0007656249,0.001114587,0.001388597,0.001161636,0.001375167,0.006801763],"category_scores_gemma":[0.004452002,0.0004094943,0.001352633,0.0007514482,0.001745728,0.002304768,0.001599216,0.001275118,0.0004251634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009321412,"about_ca_system_score_gemma":0.0008770557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002739653,"about_ca_topic_score_gemma":0.003243069,"domain_scores_codex":[0.9995484,0.0001641647,0.00002514828,0.000128284,0.00007610532,0.00005782294],"domain_scores_gemma":[0.9963966,0.002808359,0.0001102875,0.0003787628,0.0001588907,0.0001470409],"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.0004877019,0.0001531003,0.002215046,0.0002692413,0.0001108679,0.0004406645,0.0006469222,0.3159089,0.01079239,0.6163535,0.002936012,0.04968576],"study_design_scores_gemma":[0.0000488735,0.00005487637,0.0001749536,0.00002080918,0.00002911042,0.00007525997,0.00005852701,0.6549804,0.001765682,0.3411914,0.001583179,0.00001700004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.348976,0.0004381552,0.6217843,0.001460793,0.0001515614,0.0001126739,0.0003558214,0.001845948,0.02487486],"genre_scores_gemma":[0.8981665,0.0001519779,0.09494936,0.0001126499,0.00002340291,0.0001373034,0.0001485573,0.0001637725,0.00614637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006801763,"threshold_uncertainty_score":0.02275413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050063944","doi":"10.1016/j.tcs.2005.12.016","title":"Asynchronous deterministic rendezvous in graphs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":162,"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 en Outaouais; Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Upper and lower bounds; Mathematics; Node (physics); Topology (electrical circuits); Combinatorics; Algorithm; Discrete mathematics","authors":[{"name":"Gianluca De Marco","is_ca":false},{"name":"Luisa Gargano","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Ugo Vaccaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007596805078787223,"gpt":0.243354161246824,"spread":0.2357573561680368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033327,0.0006181714,0.001219893,0.001182729,0.001680353,0.001909195,0.001926925,0.001288489,0.006782087],"category_scores_gemma":[0.008050895,0.0007115147,0.0005908607,0.001291523,0.00207829,0.003512762,0.002347523,0.001592332,0.0007692908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001362539,"about_ca_system_score_gemma":0.0008635049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003849365,"about_ca_topic_score_gemma":0.004861058,"domain_scores_codex":[0.9990409,0.0003107656,0.00004222905,0.0002446468,0.000167003,0.0001943717],"domain_scores_gemma":[0.9920123,0.005486273,0.0006036684,0.0008919088,0.0004222637,0.0005835127],"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.000657915,0.00009299114,0.0008483667,0.000211513,0.0000518865,0.0002638728,0.0005464999,0.251047,0.005551977,0.7132396,0.00408684,0.02340152],"study_design_scores_gemma":[0.0001010907,0.00004347918,0.0002234965,0.00001887601,0.00003017799,0.00007955058,0.000168951,0.4525864,0.002192582,0.5420845,0.002447014,0.00002384506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4130693,0.0009755725,0.5517805,0.001639573,0.0002017426,0.0001376992,0.000417665,0.001238476,0.03053942],"genre_scores_gemma":[0.9591584,0.0003283233,0.02908006,0.0001216957,0.00005603696,0.00009243631,0.0001587544,0.0001966129,0.01080767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006782087,"threshold_uncertainty_score":0.02268833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127104083","doi":"10.1109/70.964662","title":"An optimal periodic scheduler for dual-arm robots in cluster tools with residency constraints","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics and Automation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Heuristics; Schedule; Scheduling (production processes); Correctness; Distributed computing; Mathematical optimization; Time limit; Time complexity; Computational complexity theory; Parallel computing; Algorithm; Mathematics; Engineering","authors":[{"name":"Salim Rostami","is_ca":true},{"name":"Babak Hamidzadeh","is_ca":true},{"name":"D. Camporese","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02765532918134312,"gpt":0.278591920039209,"spread":0.2509365908578658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322668,0.000477791,0.0004477834,0.0005027841,0.0007092867,0.0004285593,0.001053579,0.0003811197,0.002015009],"category_scores_gemma":[0.001088505,0.0003990753,0.0003241984,0.000573348,0.0003815139,0.0004267195,0.0003797001,0.0003683759,0.0003148591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006913212,"about_ca_system_score_gemma":0.002053489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003990409,"about_ca_topic_score_gemma":0.006054109,"domain_scores_codex":[0.9997637,0.00004543476,0.00001451488,0.000041148,0.00007273247,0.0000625414],"domain_scores_gemma":[0.9996829,0.0001211151,0.00005843155,0.00004387412,0.00005218007,0.00004156732],"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.0005357201,0.0001570562,0.0007844003,0.0002686217,0.0000394218,0.0002468679,0.0001588354,0.751142,0.02400874,0.03076075,0.004399428,0.1874982],"study_design_scores_gemma":[0.00007614431,0.0001686193,0.0002520749,0.000008720347,0.00001740098,0.0000568096,0.00002521377,0.9866643,0.004608389,0.005646877,0.002462298,0.00001312408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05910325,0.0003007013,0.9357613,0.0001165658,0.00005371021,0.0001413121,0.00007071273,0.0008472498,0.003605141],"genre_scores_gemma":[0.4921622,0.0002285176,0.5050666,0.00003291244,0.00003015096,0.000191032,0.0001229059,0.00009336738,0.002072376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003990409,"threshold_uncertainty_score":0.007934391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122384578","doi":"10.1287/opre.1080.0654","title":"Toward Robust Revenue Management: Competitive Analysis of Online Booking","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Competitive analysis; Revenue; Online algorithm; Revenue management; Computer science; Operations research; Upper and lower bounds; Perspective (graphical); Sequence (biology); Control (management); Mathematical optimization; Business; Microeconomics; Economics; Algorithm; Mathematics; Finance; Artificial intelligence","authors":[{"name":"Michael O. Ball","is_ca":false},{"name":"Maurice Queyranne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.126779056524012,"gpt":0.3956695854522347,"spread":0.2688905289282227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006426672,0.002140471,0.002312985,0.001852467,0.001039006,0.004029868,0.003718773,0.001987465,0.007360813],"category_scores_gemma":[0.02453666,0.00089304,0.001281743,0.001650636,0.003125545,0.007096691,0.002547388,0.003671911,0.0008741057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004364075,"about_ca_system_score_gemma":0.0020469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003330676,"about_ca_topic_score_gemma":0.001396809,"domain_scores_codex":[0.9955101,0.002035865,0.0001068737,0.0005303594,0.001204264,0.0006124239],"domain_scores_gemma":[0.9876289,0.008281093,0.001537578,0.0007400078,0.001256016,0.0005563291],"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.00009857709,0.0001434076,0.000407767,0.0001602297,0.00005304109,0.00008543862,0.00009129864,0.578777,0.001006349,0.3951029,0.002527792,0.02154616],"study_design_scores_gemma":[0.000008191227,0.00003382368,0.00008613538,0.00001445594,0.000007232904,0.00001714571,0.00001816937,0.9229424,0.000242476,0.0759251,0.0006935623,0.00001130616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02197821,0.001373644,0.9534076,0.0008225578,0.0000926872,0.0001294164,0.000112418,0.0001993666,0.02188414],"genre_scores_gemma":[0.8911858,0.001674763,0.09664911,0.0003472466,0.0004962802,0.0002920402,0.0001818867,0.0003261205,0.008846688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007360813,"threshold_uncertainty_score":0.03398794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087097376","doi":"10.1145/564870.564906","title":"Capture of an intruder by mobile agents","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Ottawa","keywords":"Computer science; Jump; Point (geometry); Tree (set theory); Graph; Tree network; Time complexity; Distributed computing; Theoretical computer science; Algorithm; Mathematics","authors":[{"name":"Lali Barrière","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02058791210969423,"gpt":0.2554402453622562,"spread":0.2348523332525619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004291657,0.0008280046,0.0008200184,0.0005519618,0.0007985694,0.0009767457,0.001679129,0.001440251,0.002544526],"category_scores_gemma":[0.002579215,0.0005327407,0.001022413,0.0005610403,0.0006503481,0.00190399,0.002337479,0.0008536942,0.0004250262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006459638,"about_ca_system_score_gemma":0.0006822571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00393295,"about_ca_topic_score_gemma":0.004159134,"domain_scores_codex":[0.9995745,0.00008926692,0.00002548444,0.00009918353,0.00007893337,0.0001326342],"domain_scores_gemma":[0.9992961,0.0003471262,0.0001180179,0.00008108404,0.00005529293,0.0001023487],"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.0006071561,0.0002136775,0.00832737,0.0004074539,0.0002198345,0.001736186,0.0008147071,0.8426914,0.02065801,0.03994219,0.002768149,0.081614],"study_design_scores_gemma":[0.00004025448,0.0001806439,0.0007625844,0.00002387418,0.00004481218,0.000304237,0.0004070161,0.9813623,0.003691136,0.01030061,0.002865992,0.00001635317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3449668,0.0004199976,0.6453722,0.0005707293,0.00005692874,0.0002533147,0.0001628921,0.0006198086,0.007577346],"genre_scores_gemma":[0.7978427,0.0003609711,0.1967291,0.0001136769,0.00002029554,0.0001849151,0.0003013422,0.00004794458,0.004399081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00393295,"threshold_uncertainty_score":0.008512259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056251021","doi":"10.1057/palgrave.jors.2601926","title":"Maximizing the value of an Earth observation satellite orbit","year":2005,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Satellite; Computer science; Operations research; Earth observation satellite; Orbit (dynamics); Profit (economics); Earth observation; Tabu search; Remote sensing; Geodesy; Aerospace engineering; Geology; Algorithm; Mathematics; Economics; Engineering","authors":[{"name":"J-F Cordeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09892549807221367,"gpt":0.3685871138794903,"spread":0.2696616158072767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006428751,0.0005080008,0.0007009325,0.0007542109,0.0003712852,0.001003422,0.0006008175,0.0007219025,0.005001549],"category_scores_gemma":[0.002619968,0.0002056047,0.0002463949,0.0008489742,0.0003574879,0.001199824,0.000661724,0.0003101146,0.0003351804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006961646,"about_ca_system_score_gemma":0.0006873053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002402527,"about_ca_topic_score_gemma":0.001678851,"domain_scores_codex":[0.9997283,0.0001071368,0.00001071856,0.00004378315,0.00004044674,0.00006969808],"domain_scores_gemma":[0.9989961,0.0006669026,0.0001032779,0.00005375432,0.00008165993,0.00009827335],"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.000935501,0.0002319309,0.003847671,0.0001787626,0.00008893546,0.0001840227,0.00008861856,0.9135075,0.004846556,0.01443971,0.005660953,0.05598983],"study_design_scores_gemma":[0.00006711267,0.0001760949,0.001394151,0.0000247229,0.0000369582,0.00007203833,0.00008519632,0.9836206,0.002854771,0.01023041,0.001426031,0.00001180594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8442707,0.001109947,0.1289467,0.001063453,0.0000689155,0.0001460943,0.000679108,0.000356838,0.02335814],"genre_scores_gemma":[0.9741407,0.0001888428,0.02259685,0.00003593433,0.00002023096,0.00003202345,0.0002124626,0.00003921458,0.002733751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005001549,"threshold_uncertainty_score":0.01673186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1751505773","doi":"10.1023/a:1011219024159","title":"Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations","year":2001,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Rendezvous; Computer science; Robot; Set (abstract data type); Constraint (computer-aided design); Distributed computing; Artificial intelligence; Human–computer interaction; Mathematics","authors":[{"name":"Nicholas Roy","is_ca":false},{"name":"Gregory Dudek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03879281381989205,"gpt":0.2616732478660249,"spread":0.2228804340461329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003454835,0.002635851,0.003086795,0.001224275,0.001221798,0.00364109,0.004019213,0.003551291,0.00261854],"category_scores_gemma":[0.02123289,0.001474766,0.0008575329,0.002575153,0.003869929,0.006409482,0.005255879,0.004064084,0.0008478295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001859467,"about_ca_system_score_gemma":0.001508525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004617179,"about_ca_topic_score_gemma":0.002805796,"domain_scores_codex":[0.9969898,0.0008998564,0.0001018548,0.0006092732,0.001099256,0.0002998424],"domain_scores_gemma":[0.9823262,0.01299523,0.001480887,0.001795125,0.001073143,0.0003294071],"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.0005223101,0.0001198422,0.0008535293,0.00038313,0.00008720848,0.00007288111,0.0001875193,0.8079648,0.002315256,0.09943136,0.00334824,0.08471398],"study_design_scores_gemma":[0.00002760788,0.00004539848,0.0002339714,0.00003156011,0.00001817357,0.00004206481,0.00003256796,0.933587,0.001454176,0.06358317,0.0009224644,0.00002185966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01203556,0.002793186,0.9814798,0.0003294978,0.00004972294,0.00003442992,0.00006514842,0.0003591113,0.002853517],"genre_scores_gemma":[0.7885866,0.004359784,0.1985864,0.0001324871,0.0004420383,0.0004418925,0.000373392,0.0003729595,0.006704357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004617179,"threshold_uncertainty_score":0.01827115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1802748673","doi":"10.1016/j.tcs.2015.09.018","title":"Autonomous mobile robots with lights","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Computer science; Mobile robot; Distributed computing; Artificial intelligence","authors":[{"name":"Shantanu Das","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Masafumi Yamashita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615962641213541,"gpt":0.2576801945142401,"spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001460619,0.00033565,0.0004045887,0.0003304235,0.000653077,0.0008827308,0.0005781722,0.0007018155,0.004169195],"category_scores_gemma":[0.0007058558,0.0003180869,0.0003946413,0.000306432,0.0008744968,0.001177617,0.001928995,0.0008138038,0.000848605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003207618,"about_ca_system_score_gemma":0.0003035557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008212614,"about_ca_topic_score_gemma":0.0008590385,"domain_scores_codex":[0.9998355,0.00003537724,0.000004152518,0.00004177484,0.00005677375,0.00002636963],"domain_scores_gemma":[0.9997743,0.00008795151,0.00002682994,0.0000354947,0.00003383371,0.00004160022],"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.0007468097,0.0001663013,0.001841517,0.0003963845,0.00008349364,0.0004558153,0.0004342249,0.2674364,0.07333029,0.4053531,0.01098801,0.2387677],"study_design_scores_gemma":[0.00008610415,0.0002557535,0.0007175678,0.00003241082,0.00003316497,0.000195273,0.0001744901,0.7273858,0.01006474,0.2359438,0.02506311,0.00004783067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1333601,0.001292687,0.8097931,0.001009572,0.0004949393,0.00007541559,0.0001396909,0.001185924,0.05264858],"genre_scores_gemma":[0.8973924,0.0006000262,0.07558684,0.0002304737,0.0001079909,0.00008710266,0.00008585479,0.0001167922,0.02579262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004169195,"threshold_uncertainty_score":0.01394737,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121824931","doi":"","title":"The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Ranking (information retrieval); Generalization; Computer science; Norm (philosophy); Ranking SVM; Learning to rank; Regular polygon; Boosting (machine learning); Simple (philosophy); Algorithm; Mathematics; Machine learning","authors":[{"name":"Cynthia Rudin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0132587340757605,"gpt":0.2457731972886478,"spread":0.2325144632128873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005503947,0.001675863,0.002404847,0.001669153,0.00099351,0.002444292,0.002058404,0.002486665,0.004430805],"category_scores_gemma":[0.01107466,0.0006839223,0.0009954832,0.001785785,0.002065089,0.004337071,0.002512634,0.00223392,0.002804329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009491493,"about_ca_system_score_gemma":0.001751938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008973855,"about_ca_topic_score_gemma":0.001199538,"domain_scores_codex":[0.9979019,0.0008584376,0.0001221184,0.0003546698,0.0005926719,0.0001701275],"domain_scores_gemma":[0.996094,0.001752803,0.0004180447,0.0006852529,0.0007986733,0.0002511062],"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.0004990648,0.0003453497,0.00191799,0.0005780004,0.000179437,0.0001568539,0.0002241954,0.2884561,0.01276591,0.08974797,0.02812102,0.5770081],"study_design_scores_gemma":[0.00007192719,0.0004154274,0.0004804762,0.00004828356,0.00003634166,0.0001963523,0.00005969757,0.9114503,0.008460974,0.07040114,0.008322808,0.00005623577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00936603,0.0002284593,0.9861605,0.0004146487,0.00006562281,0.00009848746,0.00008760457,0.0006028924,0.002975714],"genre_scores_gemma":[0.1792045,0.0004008778,0.8094571,0.0006280435,0.0002502097,0.0004332196,0.0005046878,0.0006523607,0.008469056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005503947,"threshold_uncertainty_score":0.02910805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970322539","doi":"10.1016/j.tcs.2008.10.005","title":"Gathering few fat mobile robots in the plane","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":141,"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 en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Plane (geometry); Artificial intelligence; Combinatorics; Mathematics; Geometry; Telecommunications","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02041441354726885,"gpt":0.260438264394177,"spread":0.2400238508469081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004700526,0.0006374381,0.001123053,0.0007466933,0.001178149,0.001070096,0.001052337,0.00138574,0.002866735],"category_scores_gemma":[0.003019142,0.0006287172,0.0005384134,0.0008049204,0.001089318,0.001978071,0.002350956,0.0009019708,0.0006192573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003704657,"about_ca_system_score_gemma":0.0002699976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001107614,"about_ca_topic_score_gemma":0.0009591486,"domain_scores_codex":[0.9997866,0.00004726197,0.000009983813,0.00005998795,0.00004318809,0.00005307774],"domain_scores_gemma":[0.9989104,0.0006510846,0.0001620881,0.00009148665,0.00008390476,0.0001010301],"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.002770823,0.0001916875,0.006224934,0.0006548898,0.0003485903,0.001632531,0.001070874,0.7431161,0.04455502,0.1120185,0.004306701,0.08310929],"study_design_scores_gemma":[0.0001589559,0.0002909328,0.001059744,0.00004996835,0.00005929471,0.0003920922,0.0005772076,0.9208407,0.004455372,0.06977876,0.002311287,0.00002561583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4746212,0.0007211096,0.5152678,0.001059159,0.00008363174,0.00006899011,0.0001830744,0.000233889,0.007761154],"genre_scores_gemma":[0.8295758,0.0005757834,0.1622955,0.0001451816,0.00005909083,0.00008996598,0.0002258817,0.00005740705,0.006975352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002866735,"threshold_uncertainty_score":0.009590209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108540055","doi":"10.1109/3477.931507","title":"Continuous and discretized pursuit learning schemes: various algorithms and their comparison","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); Carleton University","funders":"Indian Institute of Science","keywords":"Learning automata; Discretization; Computer science; Action (physics); Algorithm; Artificial intelligence; Automaton; Reinforcement learning; Class (philosophy); Machine learning; Mathematics","authors":[{"name":"B. John Oommen","is_ca":true},{"name":"M. Agache","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02296579884274759,"gpt":0.2534935298292132,"spread":0.2305277309864656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002745519,0.0006506959,0.0009561955,0.001424122,0.0004641442,0.002092245,0.001957528,0.001986629,0.002422327],"category_scores_gemma":[0.01335633,0.0003455112,0.0006156552,0.001738332,0.002179788,0.003524197,0.002166051,0.001815278,0.0004527913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001493828,"about_ca_system_score_gemma":0.0009679556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001410995,"about_ca_topic_score_gemma":0.0007697663,"domain_scores_codex":[0.9979714,0.000670942,0.0001704039,0.0002738887,0.0008069852,0.0001064738],"domain_scores_gemma":[0.9941103,0.003789222,0.0004050503,0.0007771187,0.0006941427,0.000224195],"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.0004330751,0.0001622183,0.001476271,0.0004489067,0.00009502671,0.00004356407,0.0002210133,0.3131724,0.002501622,0.2911112,0.001832467,0.3885022],"study_design_scores_gemma":[0.00007669522,0.0002642178,0.000423142,0.00006706479,0.00002186116,0.000104968,0.00005323533,0.934468,0.001618927,0.05969438,0.003172729,0.00003473368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01612537,0.003463638,0.9741823,0.0003718153,0.0001058985,0.00007653921,0.00004997111,0.0003146888,0.005309787],"genre_scores_gemma":[0.4462202,0.004296005,0.5445971,0.0002285793,0.0002505052,0.0003151293,0.0001701091,0.000140059,0.003782306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002745519,"threshold_uncertainty_score":0.01451987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313203312","doi":"10.1109/focs54457.2022.00064","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum-cost flow problem; Mathematics; Minimum cut; Separable space; Combinatorics; Amortized analysis; Bounded function; Regular polygon; Scaling; Time complexity; Maximum flow problem; Flow (mathematics); Discrete mathematics; Directed graph; Approximation algorithm; Mathematical optimization; Flow network; Computer science; Data structure","authors":[{"name":"Li Chen","is_ca":false},{"name":"Rasmus Kyng","is_ca":false},{"name":"Yang P. Liu","is_ca":false},{"name":"Richard Peng","is_ca":true},{"name":"Maximilian Probst Gutenberg","is_ca":false},{"name":"Sushant Sachdeva","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01399420956229129,"gpt":0.2647044641196495,"spread":0.2507102545573582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325835,0.001704065,0.0009124433,0.001104946,0.0007990664,0.001713462,0.001682532,0.001414682,0.008048496],"category_scores_gemma":[0.007082187,0.0006563287,0.001049269,0.001552706,0.0008475307,0.003756389,0.001412012,0.001813704,0.002034647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002167618,"about_ca_system_score_gemma":0.002975173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006984792,"about_ca_topic_score_gemma":0.009575842,"domain_scores_codex":[0.9989495,0.0001772308,0.00006627172,0.0003170058,0.000302404,0.00018763],"domain_scores_gemma":[0.9978395,0.00112079,0.0001869841,0.0004783315,0.0002901141,0.00008426804],"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.0006131968,0.0002564256,0.002216339,0.0003879997,0.0001031144,0.0001398118,0.000247116,0.5435408,0.00979362,0.06977117,0.02081807,0.3521123],"study_design_scores_gemma":[0.00005676206,0.00003104318,0.0003068309,0.00001630047,0.00001463915,0.00005970362,0.00004459832,0.9175959,0.00338469,0.07588129,0.002595382,0.00001274861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03779519,0.0002888965,0.9459522,0.0006176977,0.00007642456,0.0001762936,0.0008633588,0.006320792,0.007909143],"genre_scores_gemma":[0.2561299,0.000158404,0.7361989,0.0002195587,0.00007255997,0.0002514792,0.002198395,0.0009748014,0.003795906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008048496,"threshold_uncertainty_score":0.02692491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998843748","doi":"10.1016/s0304-3975(98)00116-9","title":"Competitive analysis of randomized paging algorithms","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"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":"Paging; Competitive analysis; Computer science; Online algorithm; Cache; Algorithm; Randomized algorithm; CPU cache; Demand paging; Page fault; Cache algorithms; Deterministic algorithm; Virtual memory; Memory management; Parallel computing; Upper and lower bounds; Mathematics; Operating system","authors":[{"name":"Dimitris Achlioptas","is_ca":true},{"name":"Marek Chrobák","is_ca":false},{"name":"John Noga","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008541897466011434,"gpt":0.2632950407095936,"spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008456368,0.002406974,0.00476499,0.003563574,0.002733937,0.007423846,0.009463843,0.004494741,0.02226106],"category_scores_gemma":[0.06645808,0.001708159,0.002090433,0.006116815,0.004191719,0.01081479,0.004107141,0.005101203,0.002277697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006764665,"about_ca_system_score_gemma":0.006212964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0067073,"about_ca_topic_score_gemma":0.004054929,"domain_scores_codex":[0.9885252,0.005698818,0.0003221056,0.000980611,0.002509626,0.001963657],"domain_scores_gemma":[0.9249324,0.06067259,0.002746909,0.005265438,0.003708574,0.002673969],"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.002407546,0.001123172,0.002236378,0.0006929151,0.0001835694,0.0001359528,0.0003554326,0.3282477,0.002218177,0.5733449,0.03212961,0.05692457],"study_design_scores_gemma":[0.0002310109,0.000180212,0.00044807,0.00003816268,0.00006339152,0.00007469674,0.0000705042,0.8181441,0.0004476228,0.1779513,0.002317937,0.0000328262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2553874,0.007309391,0.6126179,0.00976996,0.0007297846,0.0008840784,0.001825225,0.002229596,0.1092467],"genre_scores_gemma":[0.9041083,0.002380236,0.06945737,0.001152954,0.001317957,0.0007147567,0.001298212,0.0008247545,0.01874549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02226106,"threshold_uncertainty_score":0.07447064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621800709","doi":"","title":"How to meet asynchronously (almost) everywhere","year":2012,"lang":"en","type":"article","venue":"HAL AMU","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Terrain; Graph; Simply connected space; Point (geometry); Path (computing); Strongly connected component; Robot; Plane (geometry); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Geometry; Computer network","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Arnaud Labourel","is_ca":true},{"name":"Andrzej Pelc","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02134146295016659,"gpt":0.2461655440889937,"spread":0.2248240811388271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239727,0.0008345871,0.0008523575,0.0003545283,0.00154973,0.001915466,0.002234754,0.001448802,0.004196511],"category_scores_gemma":[0.008173278,0.0006468386,0.0008547421,0.0004970557,0.001618531,0.003662369,0.002432607,0.001240517,0.001769542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009251807,"about_ca_system_score_gemma":0.00162993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004558671,"about_ca_topic_score_gemma":0.004727483,"domain_scores_codex":[0.9982249,0.0003791398,0.0001455607,0.0005864258,0.0003867788,0.0002772304],"domain_scores_gemma":[0.995116,0.002053075,0.0004175211,0.001652832,0.000489518,0.0002709825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00127027,0.0001819789,0.005639047,0.0004795798,0.0001791115,0.0004677878,0.001890348,0.4605607,0.02413516,0.2996628,0.01160622,0.1939271],"study_design_scores_gemma":[0.000179944,0.0001796621,0.0006328584,0.00004449758,0.00007171488,0.000365125,0.0006348133,0.7708567,0.02216818,0.1856391,0.01915453,0.00007296277],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.08207235,0.0001256164,0.9061904,0.0008716962,0.00006340318,0.0001586918,0.0002406889,0.002084729,0.00819248],"genre_scores_gemma":[0.6017067,0.0001601531,0.388655,0.000171645,0.00002748573,0.000230469,0.0006707537,0.0003368019,0.008040939],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.004558671,"threshold_uncertainty_score":0.0140388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995813020","doi":"10.1177/0278364913504011","title":"Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations","year":2013,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Neighbourhood (mathematics); Feedback vertex set; Approximation algorithm; Vertex cover; Latency (audio); Patrolling; Combinatorics; Time complexity; Algorithm; Graph; Mathematics; Computer science","authors":[{"name":"Soroush Alamdari","is_ca":false},{"name":"Elaheh Fata","is_ca":true},{"name":"Stephen L. Smith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.14401273056313,"gpt":0.3575397659671938,"spread":0.2135270354040637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001365074,0.001237382,0.001361838,0.0007555071,0.0006528035,0.001227966,0.002243523,0.001259165,0.00100921],"category_scores_gemma":[0.006761078,0.0007283179,0.0004623611,0.001348762,0.00096364,0.003129915,0.001923609,0.001024321,0.0001734393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007458,"about_ca_system_score_gemma":0.001327006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004532911,"about_ca_topic_score_gemma":0.003855678,"domain_scores_codex":[0.9989511,0.0002672294,0.00006065279,0.0003253765,0.0002056312,0.0001899907],"domain_scores_gemma":[0.9960378,0.002608048,0.0006049354,0.0003125147,0.000184766,0.0002518994],"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.0002219507,0.00007181236,0.001602327,0.00009360989,0.00004718237,0.00009495798,0.0001242488,0.9607267,0.002848961,0.004854667,0.0004279988,0.02888561],"study_design_scores_gemma":[0.00002472104,0.00007993434,0.0003303736,0.000007139154,0.00001373746,0.00002999886,0.00005071026,0.9866246,0.001135687,0.01143505,0.0002606508,0.000007446689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1242008,0.0004194791,0.8734817,0.0003839732,0.00003086475,0.00006843649,0.0001344304,0.0005038009,0.0007764465],"genre_scores_gemma":[0.8621982,0.0002614027,0.1357546,0.00006577999,0.00003658179,0.0001396927,0.000263051,0.0001247312,0.001156003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004532911,"threshold_uncertainty_score":0.009013057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123976299","doi":"10.1109/focs.2009.51","title":"On Allocating Goods to Maximize Fairness","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Set (abstract data type); Logarithm; Approximation algorithm; Combinatorics; Computer science; Binary logarithm; Polynomial; Time complexity; Discrete mathematics; Mathematics; Algorithm","authors":[{"name":"Deeparnab Chakrabarty","is_ca":true},{"name":"Julia Chuzhoy","is_ca":false},{"name":"Sanjeev Khanna","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02045645435473559,"gpt":0.2815966787049548,"spread":0.2611402243502192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006626834,0.002585505,0.003448565,0.001376417,0.00286742,0.005136445,0.003917655,0.003639027,0.007775509],"category_scores_gemma":[0.0192549,0.001202542,0.001668763,0.003666678,0.003668252,0.01012917,0.003817734,0.003597776,0.001774137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005010762,"about_ca_system_score_gemma":0.004406058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006600243,"about_ca_topic_score_gemma":0.005125866,"domain_scores_codex":[0.9944097,0.002479437,0.0001996852,0.00126497,0.0006078686,0.001038339],"domain_scores_gemma":[0.9924912,0.005257535,0.0005165863,0.0009903745,0.0003273345,0.0004170191],"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.001758867,0.0003624232,0.001646562,0.0004862056,0.0001454045,0.0001744428,0.0006601838,0.5220658,0.001985401,0.3777717,0.01270235,0.08024079],"study_design_scores_gemma":[0.0001455753,0.00009035735,0.0002383384,0.00005891312,0.00004270439,0.0001146183,0.0001464988,0.5534007,0.001194277,0.4381868,0.006348434,0.00003275852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04222033,0.001797875,0.9362319,0.002949356,0.0002418762,0.0002103247,0.0004650314,0.0008775679,0.01500562],"genre_scores_gemma":[0.4517748,0.001621384,0.5272372,0.001060245,0.0005838897,0.0004339257,0.0005690104,0.0005831663,0.01613634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007775509,"threshold_uncertainty_score":0.03635585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988551609","doi":"10.1002/net.21453","title":"Deterministic rendezvous in networks: A comprehensive survey","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Task (project management); Graph; Terrain; Undirected graph; Theoretical computer science; Mathematical optimization; Operations research; Mathematics; Geography; Engineering","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04834175643551917,"gpt":0.2885700570184015,"spread":0.2402283005828823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491955,0.001065727,0.001593857,0.002132398,0.0006016751,0.002204392,0.001604648,0.001211183,0.002520705],"category_scores_gemma":[0.003499244,0.0008004729,0.0008850873,0.004365859,0.001174616,0.003506631,0.001403114,0.001180293,0.0008368288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442977,"about_ca_system_score_gemma":0.001146521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002516592,"about_ca_topic_score_gemma":0.001770581,"domain_scores_codex":[0.9990289,0.0002614468,0.00007193084,0.0002359093,0.0003027747,0.00009900468],"domain_scores_gemma":[0.9975168,0.001924155,0.0001440949,0.0001307923,0.0002268754,0.00005726191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001161839,0.0001849028,0.003211659,0.006451476,0.0002564872,0.0002198517,0.0002025674,0.2324293,0.0009554238,0.2961106,0.01660085,0.4432608],"study_design_scores_gemma":[0.0000438581,0.0002368688,0.003004459,0.002073311,0.0001997154,0.001014132,0.0003426732,0.2675808,0.001514755,0.462041,0.26185,0.00009841871],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.01522226,0.6943859,0.2425266,0.002121541,0.0004577254,0.00007253445,0.0003710211,0.0001902252,0.04465221],"genre_scores_gemma":[0.2310679,0.7000549,0.05944522,0.0004801947,0.001541572,0.0001617239,0.0006338963,0.0001211156,0.006493522],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002520705,"threshold_uncertainty_score":0.01046962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128105951","doi":"10.1007/s13042-014-0272-y","title":"Solving 0–1 Knapsack Problem using Cohort Intelligence Algorithm","year":2014,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Knapsack problem; Computational intelligence; Cohort; Computer science; Algorithm; Artificial intelligence; Quality (philosophy); Machine learning; Mathematical optimization; Mathematics; Statistics","authors":[{"name":"Anand J. Kulkarni","is_ca":true},{"name":"Hinna Shabir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01192780931146918,"gpt":0.2805020529458979,"spread":0.2685742436344287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001604429,0.0008199973,0.00135916,0.000999975,0.001024967,0.001550522,0.001572838,0.001571695,0.005701013],"category_scores_gemma":[0.004040996,0.0004500832,0.000998782,0.001372896,0.000611655,0.001333341,0.001566867,0.00144643,0.0005787097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006012689,"about_ca_system_score_gemma":0.00167918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006876629,"about_ca_topic_score_gemma":0.0043502,"domain_scores_codex":[0.9992192,0.0002558173,0.00005272091,0.0001698355,0.0001685681,0.0001337873],"domain_scores_gemma":[0.9984798,0.0009333923,0.0001386029,0.000105362,0.0002548482,0.00008814006],"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.0001101742,0.0001740933,0.001389994,0.0002047328,0.00007549927,0.000112017,0.0000804962,0.8796325,0.0009718501,0.03308995,0.004255414,0.07990328],"study_design_scores_gemma":[0.00001471892,0.00006237294,0.0001463675,0.00001536505,0.000009447218,0.00002127036,0.00002310457,0.9839462,0.0002755632,0.01470092,0.0007765263,0.000008250799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03425727,0.000337029,0.9545496,0.0003053434,0.000153618,0.0001498012,0.0001213366,0.0001838563,0.009942209],"genre_scores_gemma":[0.4455188,0.0005129972,0.5423793,0.0002373722,0.0001372261,0.0004475503,0.0006117279,0.0001130399,0.01004207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006876629,"threshold_uncertainty_score":0.01907176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053806044","doi":"10.1016/s0304-3975(99)00186-3","title":"Scheduling in the dark","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":104,"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":"Parallelizable manifold; Computer science; Scheduling (production processes); Multiprocessing; Parallel computing; Multiprocessor scheduling; Partition (number theory); Upper and lower bounds; Distributed computing; Job shop scheduling; Algorithm; Mathematical optimization; Flow shop scheduling; Mathematics; Operating system","authors":[{"name":"Jeff Edmonds","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01300710459324179,"gpt":0.2663847769236825,"spread":0.2533776723304407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157527,0.0005005825,0.0008530652,0.0008170027,0.002871542,0.005543649,0.001546702,0.001762668,0.04235214],"category_scores_gemma":[0.008047921,0.0005724495,0.0003263036,0.001704247,0.003414476,0.007480376,0.002237791,0.004814642,0.007430482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003703878,"about_ca_system_score_gemma":0.005115736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008506688,"about_ca_topic_score_gemma":0.009450621,"domain_scores_codex":[0.9987757,0.0004020596,0.00002908352,0.0002826046,0.0002213424,0.0002893086],"domain_scores_gemma":[0.9960194,0.001020534,0.0002275562,0.001178326,0.0004954814,0.001058637],"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.0003596444,0.00009250343,0.0003272789,0.0001136619,0.00002185807,0.00005526299,0.000368445,0.007527024,0.001455973,0.8687327,0.07015382,0.05079189],"study_design_scores_gemma":[0.00005900426,0.00004263932,0.0002260545,0.00006013159,0.000009144482,0.00003770206,0.0005415659,0.01502808,0.000639244,0.7859958,0.1973367,0.00002395757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06504212,0.01328686,0.1758276,0.1099782,0.008519281,0.0001378421,0.001047491,0.002082491,0.624078],"genre_scores_gemma":[0.7453877,0.006523222,0.03707034,0.01035203,0.003130341,0.0001224013,0.0006229333,0.001308887,0.1954821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04235214,"threshold_uncertainty_score":0.141682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162964807","doi":"10.1109/tsmcb.2006.879012","title":"Learning Automata-Based Solutions to the Nonlinear Fractional Knapsack Problem With Applications to Optimal Resource Allocation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Knapsack problem; Computer science; Learning automata; Discretization; Resource allocation; Scheme (mathematics); Mathematical optimization; Polling; Theoretical computer science; Automaton; Algorithm; Mathematics","authors":[{"name":"Ole‐Christoffer Granmo","is_ca":false},{"name":"B. John Oommen","is_ca":true},{"name":"Svein Arild Myrer","is_ca":false},{"name":"Morten Goodwin Olsen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02106864386116119,"gpt":0.2554649759567687,"spread":0.2343963320956075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134809,0.0008083358,0.0009844978,0.000620897,0.0006644397,0.001269883,0.001283049,0.00155093,0.003133216],"category_scores_gemma":[0.005410684,0.0004274635,0.0007701335,0.0005911478,0.001318402,0.001065457,0.001675222,0.001794765,0.0003904278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009852879,"about_ca_system_score_gemma":0.001304927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005439931,"about_ca_topic_score_gemma":0.005320928,"domain_scores_codex":[0.9995036,0.0001565839,0.00004059612,0.0001066645,0.0001186349,0.00007377977],"domain_scores_gemma":[0.9976107,0.001713355,0.0001956769,0.0001361732,0.0002495048,0.00009465998],"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.00001960767,0.00002243093,0.0002605983,0.00004778592,0.000013096,0.00003193083,0.00005376965,0.9617977,0.0005447735,0.02077258,0.0002993438,0.01613654],"study_design_scores_gemma":[0.000003181415,0.00001005189,0.00001999877,0.000004968392,0.000002140244,0.000005771846,0.000007516758,0.9924314,0.0001544991,0.007051268,0.0003059414,0.000003332009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008990971,0.0002800403,0.9866736,0.0002261492,0.00005458863,0.00003995854,0.00002773946,0.000176855,0.003530133],"genre_scores_gemma":[0.6130443,0.0005710667,0.3804915,0.0002242792,0.00008593276,0.0003724389,0.0001109544,0.0001020602,0.004997529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005439931,"threshold_uncertainty_score":0.01081657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4211103781","doi":"10.2200/s00440ed1v01y201208dct010","title":"Distributed Computing by Oblivious Mobile Robots","year":2012,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Mobile robot; Robotics; Robot; Artificial intelligence; Distributed computing; Human–computer interaction","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01118725042215,"gpt":0.2538542189076905,"spread":0.2426669684855405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006125467,0.0006789348,0.0008087603,0.0003746174,0.0006470873,0.001280159,0.000847779,0.0006695147,0.004134455],"category_scores_gemma":[0.002844213,0.0004348178,0.0003831731,0.0007450294,0.001409477,0.001988391,0.001565407,0.002128441,0.0007904054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183454,"about_ca_system_score_gemma":0.0006785732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005825362,"about_ca_topic_score_gemma":0.0006515845,"domain_scores_codex":[0.999512,0.000133951,0.00001924478,0.0001019587,0.00017085,0.00006193197],"domain_scores_gemma":[0.9990976,0.0005169279,0.00005024055,0.0002136243,0.00007296633,0.0000486188],"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.0002486165,0.00005277642,0.0002277958,0.0002346973,0.00005118892,0.00006147721,0.0001941824,0.1744096,0.007812948,0.7173679,0.01106146,0.08827731],"study_design_scores_gemma":[0.0001059933,0.00007967922,0.0001900465,0.00004155716,0.00003187422,0.0000632396,0.00004283447,0.4209011,0.005138385,0.5459264,0.02745834,0.00002050929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02779581,0.002099746,0.9410228,0.002331881,0.0006051685,0.0000754005,0.00007616891,0.0007110643,0.02528204],"genre_scores_gemma":[0.7696314,0.002682642,0.1717903,0.0004936213,0.0005843471,0.0003997586,0.0001265656,0.0002767795,0.05401454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004134455,"threshold_uncertainty_score":0.01383108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069552341","doi":"10.1016/j.cviu.2009.06.010","title":"Visual search for an object in a 3D environment using a mobile robot","year":2010,"lang":"en","type":"article","venue":"Computer Vision and Image Understanding","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":98,"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":"Computer science; Artificial intelligence; Object (grammar); Limit (mathematics); Mobile robot; Robot; Computer vision; Visual search; Space (punctuation); Optimization problem; Mechanism (biology); Mathematics; Algorithm","authors":[{"name":"Ksenia Shubina","is_ca":true},{"name":"John K. Tsotsos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06650966170180576,"gpt":0.3477666385531639,"spread":0.2812569768513581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002319293,0.0006242652,0.0007634367,0.0006805293,0.000647124,0.0008212094,0.0007678516,0.001521858,0.001455341],"category_scores_gemma":[0.000810246,0.0005929549,0.0007706386,0.0006811357,0.0006660278,0.001129597,0.001276802,0.000495124,0.000256738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004302619,"about_ca_system_score_gemma":0.0005373012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0057892,"about_ca_topic_score_gemma":0.005433299,"domain_scores_codex":[0.9998775,0.00001646124,0.000005242555,0.0000470434,0.00003889353,0.00001487912],"domain_scores_gemma":[0.9998491,0.00005923151,0.0000274439,0.00001891871,0.00002046682,0.00002477709],"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.0009558316,0.0001951298,0.003607973,0.0002559401,0.0002200397,0.00120039,0.0007085077,0.5305512,0.132393,0.01383237,0.002228572,0.313851],"study_design_scores_gemma":[0.00003865079,0.0001460102,0.0007338244,0.00001234541,0.00003374462,0.0002230082,0.00008213879,0.9870306,0.005973898,0.00478609,0.0009212014,0.00001862953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1678742,0.000372256,0.8280104,0.0002634889,0.00003941386,0.00006979377,0.00004860245,0.0006993526,0.002622584],"genre_scores_gemma":[0.753579,0.000214621,0.2441696,0.00006942094,0.00002533537,0.00006734877,0.00004895855,0.00006546632,0.001760259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0057892,"threshold_uncertainty_score":0.01151097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984719907","doi":"10.1007/s00446-006-0154-y","title":"Searching for a black hole in arbitrary networks: optimal mobile agents protocols","year":2006,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Node (physics); Ignorance; Computer science; Mathematical proof; Upper and lower bounds; Protocol (science); Topology (electrical circuits); Flexibility (engineering); Degree (music); Constructive; Mathematics; Computer network; Discrete mathematics; Combinatorics","authors":[{"name":"Stefan Dobrev","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511181324543472,"gpt":0.3120113948574338,"spread":0.2868995816119991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004947437,0.001144834,0.002224059,0.001560033,0.001746246,0.002930306,0.003302854,0.003342548,0.001830673],"category_scores_gemma":[0.01923596,0.001040811,0.0008657154,0.001705477,0.004449083,0.006762413,0.004269706,0.002351875,0.00025103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001715246,"about_ca_system_score_gemma":0.001711676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001308423,"about_ca_topic_score_gemma":0.001353263,"domain_scores_codex":[0.9981604,0.00101625,0.00007370037,0.000263074,0.0002776113,0.000208985],"domain_scores_gemma":[0.9909146,0.006719633,0.0007891433,0.0007001975,0.0004401555,0.0004362835],"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.0006295367,0.0001177961,0.0004105656,0.0001467101,0.000123785,0.00008766325,0.000286559,0.6097395,0.001248091,0.3606811,0.002843355,0.0236853],"study_design_scores_gemma":[0.0000843727,0.00003835392,0.00003971746,0.00001609653,0.00002545422,0.00001945145,0.00004405811,0.8231792,0.0003759562,0.1755553,0.0006113939,0.00001073484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06756887,0.001115362,0.9222708,0.002111899,0.0001314955,0.0001080723,0.00004241544,0.0001920997,0.006458954],"genre_scores_gemma":[0.7533854,0.0009599434,0.2410101,0.0002981804,0.0001533916,0.0002469492,0.00005823137,0.0001225397,0.003765321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004947437,"threshold_uncertainty_score":0.02616489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972775782","doi":"10.1007/s00446-011-0141-9","title":"How to meet when you forget: log-space rendezvous in arbitrary graphs","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":97,"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 en Outaouais","funders":"","keywords":"Rendezvous; Binary logarithm; Computer science; Upper and lower bounds; Graph; Combinatorics; Matching (statistics); Discrete mathematics; Node (physics); Mathematics; Theoretical computer science","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Adrian Kosowski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03537092847980609,"gpt":0.2406513227041873,"spread":0.2052803942243812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337631,0.0005717441,0.00131302,0.0005386437,0.00240847,0.002044891,0.001879113,0.001929084,0.006696729],"category_scores_gemma":[0.01254202,0.0004763996,0.0005480371,0.001144963,0.002904287,0.007260653,0.003557068,0.002526334,0.001283942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000809992,"about_ca_system_score_gemma":0.000961769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005029136,"about_ca_topic_score_gemma":0.005290134,"domain_scores_codex":[0.9991515,0.0003298116,0.0000280438,0.0001722639,0.0001471189,0.0001714186],"domain_scores_gemma":[0.9953087,0.002655376,0.0001920213,0.001111378,0.0002667903,0.0004656976],"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.001899159,0.0002342891,0.001879601,0.0002810437,0.00009777004,0.000578236,0.002069564,0.4001177,0.00633093,0.4220969,0.03509764,0.1293172],"study_design_scores_gemma":[0.00008884924,0.00005345644,0.0001864195,0.0000212484,0.00002385275,0.0001535723,0.0007218623,0.5786982,0.0024775,0.4119942,0.005550333,0.00003049559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2927701,0.001337389,0.6687254,0.008788339,0.0005333234,0.0001376068,0.0004042942,0.003363268,0.0239403],"genre_scores_gemma":[0.920525,0.000365096,0.06597112,0.0003279146,0.00008372366,0.00006762081,0.0002084418,0.0005681103,0.0118829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006696729,"threshold_uncertainty_score":0.02240282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963114728","doi":"10.1016/j.ic.2016.09.005","title":"Mutual visibility by luminous robots without collisions","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Visibility; Robot; Computer science; Convergence (economics); Computer vision; Plane (geometry); Artificial intelligence; Point (geometry); Topology (electrical circuits); Mathematics; Physics; Geometry; Optics; Combinatorics; Economics","authors":[{"name":"Giuseppe Antonio Di Luna","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Sruti Gan Chaudhuri","is_ca":false},{"name":"Federico Poloni","is_ca":false},{"name":"Nicola Santoro","is_ca":true},{"name":"Giovanni Viglietta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0127036894534556,"gpt":0.2644667625921533,"spread":0.2517630731386977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738704,0.0008715608,0.002027507,0.001007372,0.001600184,0.002764839,0.00210682,0.002858772,0.003152167],"category_scores_gemma":[0.01678981,0.001451728,0.001108823,0.001241297,0.003138125,0.004876412,0.006816924,0.001860683,0.000416534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018449,"about_ca_system_score_gemma":0.0009149828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002425696,"about_ca_topic_score_gemma":0.001434801,"domain_scores_codex":[0.9982826,0.0005999012,0.00006342747,0.0003503953,0.0003518816,0.0003519043],"domain_scores_gemma":[0.9903674,0.006733363,0.00123388,0.0006685582,0.0003905024,0.0006062802],"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.001580115,0.0001615531,0.003287911,0.0002965771,0.0002287537,0.0006985832,0.001227767,0.5632069,0.00536092,0.3860859,0.002689438,0.03517549],"study_design_scores_gemma":[0.00007925597,0.0001053471,0.0007029111,0.00002644791,0.00003830157,0.0001697622,0.0001720628,0.7393546,0.001474411,0.2567272,0.001112565,0.00003708232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2665323,0.0006249535,0.7169294,0.0009746728,0.00009858324,0.00005366737,0.0001068914,0.0002272546,0.01445214],"genre_scores_gemma":[0.9644834,0.0001576411,0.02931669,0.0001022378,0.00005773832,0.00005678671,0.0000680181,0.00008938473,0.005668113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003152167,"threshold_uncertainty_score":0.01054502,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032767523","doi":"10.7771/1932-6246.1090","title":"Human Performance on the Traveling Salesman and Related Problems: A Review","year":2011,"lang":"en","type":"review","venue":"The Journal of Problem Solving","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Travelling salesman problem; Computer science; Operations research; Mathematics; Algorithm","authors":[{"name":"James N. MacGregor","is_ca":true},{"name":"Yun Chu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09076530393819074,"gpt":0.3128578328087348,"spread":0.2220925288705441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001161229,0.001120895,0.001731206,0.002677818,0.0003437829,0.001285897,0.00114845,0.001669475,0.002713821],"category_scores_gemma":[0.002950748,0.0004158984,0.000436726,0.004056347,0.001010165,0.00236419,0.0006441492,0.001143939,0.002003144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008409278,"about_ca_system_score_gemma":0.001451973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002559018,"about_ca_topic_score_gemma":0.002843924,"domain_scores_codex":[0.9995172,0.00009520673,0.00007503856,0.0001029795,0.0001751567,0.00003438751],"domain_scores_gemma":[0.9979589,0.001363543,0.0001488272,0.00003742895,0.0004197005,0.00007163295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005012159,0.00008921525,0.0005777993,0.01208273,0.00008198555,0.00009216469,0.000119022,0.0006400216,0.0004882242,0.003936142,0.01845784,0.9633847],"study_design_scores_gemma":[0.00002961459,0.0004209923,0.007153949,0.01262156,0.0002389019,0.002245642,0.0004629104,0.000475973,0.001081517,0.01252763,0.9626385,0.0001028463],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0003263514,0.9976575,0.0003165829,0.0003085269,0.0000855793,0.000004644639,0.00001498972,0.000006650227,0.001279166],"genre_scores_gemma":[0.001322218,0.9977692,0.0003892237,0.00009046887,0.0001293955,0.00000665337,0.0000231889,0.000001984819,0.0002677134],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.002713821,"threshold_uncertainty_score":0.009078681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061226732","doi":"10.1145/1082473.1082620","title":"An online POMDP algorithm for complex multiagent environments","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Formalism (music); Partially observable Markov decision process; Action (physics); Online algorithm; Artificial intelligence; Distributed computing; Theoretical computer science; Algorithm; Machine learning; Markov chain","authors":[{"name":"Sébastien Paquet","is_ca":true},{"name":"Ludovic Tobin","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08067230983721858,"gpt":0.3221294756271801,"spread":0.2414571657899615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118241,0.0009323704,0.000953892,0.0004912447,0.0006850061,0.000935742,0.001590483,0.001213116,0.006754305],"category_scores_gemma":[0.00234758,0.0005017254,0.0006921877,0.0003989976,0.0007530402,0.001721899,0.001699483,0.001672761,0.00101499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009319041,"about_ca_system_score_gemma":0.001921949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003314068,"about_ca_topic_score_gemma":0.003929344,"domain_scores_codex":[0.9993741,0.0001706693,0.00003575517,0.0001643749,0.0001937326,0.0000614171],"domain_scores_gemma":[0.9991849,0.0005086976,0.00005745808,0.0001033477,0.00009187432,0.00005384751],"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.0001920462,0.0002496507,0.0004733317,0.0002701888,0.0000823206,0.0001523059,0.0001492162,0.6472638,0.003675275,0.09324513,0.006788634,0.2474581],"study_design_scores_gemma":[0.00006032849,0.00002617499,0.00003468208,0.00001083941,0.00000945883,0.00002678915,0.00001486319,0.9749623,0.0008537925,0.02055942,0.00343312,0.000008203347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001127494,0.0000439595,0.9970574,0.00005300535,0.00002251909,0.00004998795,0.00002827329,0.0004118402,0.001205572],"genre_scores_gemma":[0.08126087,0.00009804201,0.9161183,0.0000765695,0.00002301183,0.0003285666,0.0001175786,0.0001236017,0.001853559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006754305,"threshold_uncertainty_score":0.02259541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023452807","doi":"10.1016/j.tcs.2010.01.007","title":"Remembering without memory: Tree exploration by asynchronous oblivious robots","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Robot; Computer science; Asynchronous communication; Task (project management); Theoretical computer science; Node (physics); Tree (set theory); Swarm robotics; Graph; Mobile robot; Constructive; Self-reconfiguring modular robot; Computation; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Robot control; Combinatorics","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01301042963313472,"gpt":0.2584973290919054,"spread":0.2454868994587706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614241,0.0003984455,0.0009033448,0.0003727421,0.0008351277,0.00115267,0.001678587,0.001027085,0.003298846],"category_scores_gemma":[0.006282762,0.0003720511,0.0004161393,0.0005574174,0.001087422,0.003714463,0.001671467,0.001115975,0.0003135689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003891838,"about_ca_system_score_gemma":0.0006465344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00122306,"about_ca_topic_score_gemma":0.001262686,"domain_scores_codex":[0.999639,0.0001291295,0.00001948239,0.00007169514,0.00005866987,0.00008208584],"domain_scores_gemma":[0.996659,0.002129143,0.0002089576,0.0005956344,0.0001757923,0.0002314128],"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.002461391,0.000266484,0.00243703,0.0004196312,0.0001466016,0.0004795704,0.0013101,0.6440491,0.01243633,0.1859475,0.005636599,0.1444097],"study_design_scores_gemma":[0.00007943734,0.0000994724,0.0001693896,0.00001239911,0.00003068075,0.00006259315,0.00009088526,0.8395044,0.001774822,0.1572162,0.0009449671,0.00001477726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4469258,0.001074341,0.537434,0.0009363476,0.0001223026,0.00007304041,0.0001185051,0.001055202,0.01226048],"genre_scores_gemma":[0.9624926,0.0001972493,0.03421751,0.00006570617,0.00002532066,0.00004585792,0.00005099036,0.00008103383,0.002823761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003298846,"threshold_uncertainty_score":0.01103574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073076713","doi":"10.1016/j.tcs.2008.03.006","title":"Self-deployment of mobile sensors on a ring","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Software deployment; Ring (chemistry); Computer science; Visibility; Mathematical proof; Simple (philosophy); Impossibility; RADIUS; Coordinate system; Cover (algebra); Distributed computing; Topology (electrical circuits); Mathematics; Geometry; Physics; Computer network; Combinatorics; Artificial intelligence; Engineering","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Giuseppe Prencipe","is_ca":false},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01555006412774927,"gpt":0.2578851609787024,"spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032043,0.000466151,0.0009357004,0.0005074694,0.0006771868,0.0009676155,0.001464159,0.001104107,0.001202766],"category_scores_gemma":[0.00445529,0.0006575349,0.0004198374,0.0005643747,0.0008527141,0.002185135,0.002111168,0.0005850301,0.0004727812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004389583,"about_ca_system_score_gemma":0.0003523019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007115747,"about_ca_topic_score_gemma":0.0006714592,"domain_scores_codex":[0.9992862,0.0002250509,0.00002990853,0.0002056012,0.0001115352,0.0001417041],"domain_scores_gemma":[0.9976773,0.0009296681,0.0004349209,0.0004391877,0.000257878,0.0002611374],"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.0009836461,0.0002155028,0.006262548,0.0001824709,0.0001253834,0.000674492,0.000282443,0.8581746,0.04236504,0.03801845,0.002216298,0.05049913],"study_design_scores_gemma":[0.00002116264,0.0002339512,0.0007086617,0.000007128438,0.00002086768,0.0001327224,0.00009490112,0.9871621,0.005318219,0.005387182,0.0008992897,0.0000138631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.380212,0.0006227565,0.612715,0.0005631623,0.0001420909,0.0000697666,0.0001077226,0.0003735475,0.005193933],"genre_scores_gemma":[0.9645006,0.0002451222,0.0309179,0.00004644967,0.0000398154,0.00004029595,0.00004578793,0.00002453049,0.004139549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001464159,"threshold_uncertainty_score":0.005457997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080745503","doi":"10.1016/j.tcs.2007.05.011","title":"Map construction of unknown graphs by multiple agents","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Traverse; Graph; Computer science; Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Algorithm","authors":[{"name":"Shantanu Das","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Shay Kutten","is_ca":false},{"name":"Amiya Nayak","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01071225163422513,"gpt":0.2594873612681509,"spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008256288,0.0006884001,0.001150495,0.001125678,0.00139287,0.001585904,0.001853961,0.001693157,0.004549738],"category_scores_gemma":[0.005589243,0.0008316221,0.001569051,0.000967614,0.001328665,0.003458294,0.003849061,0.001737979,0.0007190696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000947457,"about_ca_system_score_gemma":0.0009235571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003594287,"about_ca_topic_score_gemma":0.002834304,"domain_scores_codex":[0.9992675,0.000295102,0.00002270778,0.0001792568,0.0001455165,0.00008978465],"domain_scores_gemma":[0.997456,0.001425932,0.0001388193,0.0005692996,0.0002190356,0.0001909867],"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.0004445642,0.0001941455,0.001687524,0.0003695046,0.0001620273,0.0005961861,0.0009511271,0.6354782,0.01082665,0.2089498,0.004895991,0.1354443],"study_design_scores_gemma":[0.00002816709,0.00004208845,0.0002262436,0.00001393349,0.00003198279,0.00006619877,0.0001198257,0.8822056,0.004172571,0.1107432,0.002331692,0.00001849466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05908406,0.0001058356,0.9348127,0.0003297611,0.00004481294,0.00008392001,0.0001052996,0.0006207251,0.004812852],"genre_scores_gemma":[0.5845117,0.0002327641,0.4052987,0.00009206539,0.00004207253,0.0001771298,0.0003223293,0.0003066784,0.009016654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004549738,"threshold_uncertainty_score":0.0152204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020796742","doi":"10.1007/s00453-011-9611-5","title":"Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; École de Technologie Supérieure; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Ring (chemistry); Theory of computation; Computer science; Prime (order theory); Combinatorics; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"David Ilcinkas","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03405175304668747,"gpt":0.2886569309033074,"spread":0.25460517785662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418455,0.0004161659,0.000914171,0.000416396,0.001005909,0.001567059,0.001727605,0.001000632,0.003570407],"category_scores_gemma":[0.0065945,0.0003893117,0.0005116672,0.0006158306,0.001985362,0.004084582,0.002361537,0.001235637,0.0004085875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005379235,"about_ca_system_score_gemma":0.0007300447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007505922,"about_ca_topic_score_gemma":0.0007386045,"domain_scores_codex":[0.99924,0.000336149,0.00002779111,0.0001383287,0.0001113701,0.000146379],"domain_scores_gemma":[0.9969073,0.00195327,0.000222535,0.0005279889,0.0001491849,0.0002397482],"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.001078453,0.0001374129,0.0006858986,0.0002115232,0.00006941881,0.0001658135,0.0003786285,0.5003465,0.005024066,0.4539081,0.003609293,0.03438479],"study_design_scores_gemma":[0.00006894711,0.00007631001,0.0001135275,0.00001103491,0.00002057312,0.00003983118,0.00007288207,0.7697736,0.001407018,0.226954,0.001445116,0.0000171702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2593844,0.001103889,0.7113301,0.001590278,0.0002085153,0.00009090425,0.0001328031,0.0005812576,0.02557779],"genre_scores_gemma":[0.9544291,0.0003026641,0.04024196,0.00008131758,0.0000616235,0.00007903232,0.00003487673,0.00007588601,0.00469348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003570407,"threshold_uncertainty_score":0.01194417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152324445","doi":"10.1109/tsmcb.2005.850180","title":"Dynamic Algorithms for the Shortest Path Routing Problem: Learning Automata-Based Solutions","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Shortest Path Faster Algorithm; K shortest path routing; Algorithm; Widest path problem; Computer science; Yen's algorithm; Euclidean shortest path; Distance; Graph; Mathematics; Dijkstra's algorithm; Theoretical computer science","authors":[{"name":"Sudip Misra","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03107009743229232,"gpt":0.2632003485274709,"spread":0.2321302510951786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009382059,0.001122531,0.001104803,0.001038051,0.0007019847,0.001269854,0.002102693,0.001818809,0.002540499],"category_scores_gemma":[0.005828621,0.00055277,0.0008876421,0.001043489,0.0009978956,0.00194339,0.001542333,0.001924907,0.0004607657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268136,"about_ca_system_score_gemma":0.001724958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004993409,"about_ca_topic_score_gemma":0.004094649,"domain_scores_codex":[0.9992141,0.0001861856,0.00005511861,0.0002630106,0.0001862607,0.0000953351],"domain_scores_gemma":[0.9976816,0.001599754,0.0001733661,0.000164994,0.000297434,0.00008280817],"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.00003886647,0.00004600386,0.0004685995,0.00007574627,0.00003430899,0.00003494976,0.00007831598,0.9164891,0.0007479797,0.02606846,0.001034162,0.05488351],"study_design_scores_gemma":[0.000006557857,0.00001147499,0.00002468933,0.00000482132,0.000003347621,0.000009413714,0.000009399691,0.9879833,0.0001753056,0.01136198,0.0004057026,0.000003873071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008680427,0.00021596,0.9886118,0.0001987975,0.00004166695,0.00004424583,0.00004222781,0.0003763512,0.001788671],"genre_scores_gemma":[0.4893361,0.0005671738,0.5046515,0.0002331528,0.0001111236,0.000529384,0.000430487,0.0001896748,0.003951442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004993409,"threshold_uncertainty_score":0.009928703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128634904","doi":"10.1145/2629656","title":"Gathering Despite Mischief","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Israeli Centers for Research Excellence; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Combinatorics; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Geography","authors":[{"name":"Yoann Dieudonné","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02024123927452412,"gpt":0.2543549482875596,"spread":0.2341137090130355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003038284,0.001337432,0.001325645,0.0006414455,0.003311247,0.002142109,0.003119156,0.00217349,0.006486794],"category_scores_gemma":[0.02033135,0.0009184172,0.001035526,0.0009222307,0.002427721,0.005222627,0.005177342,0.002285892,0.001730348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001449037,"about_ca_system_score_gemma":0.001790999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002734772,"about_ca_topic_score_gemma":0.003851533,"domain_scores_codex":[0.996595,0.0008708664,0.0001978672,0.001189252,0.0005262076,0.0006207973],"domain_scores_gemma":[0.9825736,0.006835528,0.001703426,0.00660445,0.001413599,0.0008694233],"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.002006485,0.0003331543,0.0130625,0.001577049,0.0003678363,0.002061824,0.006292228,0.2880429,0.04537805,0.3169556,0.02693666,0.2969857],"study_design_scores_gemma":[0.0001798655,0.0005942662,0.00267772,0.0001870698,0.0001890683,0.001401202,0.001292863,0.6580473,0.02416782,0.2505366,0.06064176,0.00008455909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1466503,0.0005145654,0.8225099,0.003457667,0.0001529378,0.0003009569,0.0004568974,0.00238247,0.02357423],"genre_scores_gemma":[0.7280418,0.0003453796,0.2542703,0.0006365247,0.0001029608,0.000321493,0.0006896717,0.0004508366,0.01514111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006486794,"threshold_uncertainty_score":0.0217005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078130991","doi":"10.1007/s00446-014-0220-9","title":"Forming sequences of geometric patterns with oblivious mobile robots","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Computer science; Simple (philosophy); Series (stratigraphy); Mobile robot; Orientation (vector space); Theoretical computer science; Theory of computation; Distributed computing; Artificial intelligence; Algorithm; Mathematics; Geometry","authors":[{"name":"Shantanu Das","is_ca":false},{"name":"Paola Flocchini","is_ca":true},{"name":"Nicola Santoro","is_ca":true},{"name":"Masafumi Yamashita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01243097375740878,"gpt":0.2426073737867117,"spread":0.2301764000293029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005985481,0.0006026094,0.001001074,0.0007042409,0.0007983479,0.0008262084,0.001854909,0.0009867318,0.003440945],"category_scores_gemma":[0.003314691,0.0008231797,0.0006281958,0.001235663,0.00135244,0.001909721,0.002455776,0.0009987102,0.000727844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006277568,"about_ca_system_score_gemma":0.0007535969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732507,"about_ca_topic_score_gemma":0.00209608,"domain_scores_codex":[0.9993775,0.0001674474,0.00004340896,0.0001518247,0.0001785137,0.00008142512],"domain_scores_gemma":[0.9987249,0.0005185935,0.0002286758,0.0003058678,0.0001108234,0.0001110824],"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.0004329408,0.0001382973,0.001706532,0.0001867591,0.00005977618,0.0002024008,0.0005019716,0.7889013,0.01176979,0.07438716,0.001688209,0.1200249],"study_design_scores_gemma":[0.00006498057,0.0001967976,0.0002925712,0.00001878262,0.00001514347,0.0001115455,0.0001559777,0.9180307,0.006363535,0.07206865,0.002662597,0.0000186434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058434,0.0001098809,0.8894525,0.0001896353,0.00003942158,0.0001364452,0.00005610604,0.0004234236,0.003749228],"genre_scores_gemma":[0.6083172,0.0002059171,0.3822359,0.00009656754,0.00002643184,0.0003224644,0.000215107,0.0001483865,0.008432167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003440945,"threshold_uncertainty_score":0.01151109,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001755298","doi":"10.5555/1283383.1283408","title":"On the separation and equivalence of paging strategies","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Partition (number theory); Equivalence (formal languages); Measure (data warehouse); Algorithm; Mathematics; Data mining; Computer network; Discrete mathematics","authors":[{"name":"Spyros Angelopoulos","is_ca":true},{"name":"Reza Dorrigiv","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03198190978746562,"gpt":0.3237985349184365,"spread":0.2918166251309708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006463281,0.001018816,0.001820594,0.001616932,0.001310256,0.005198467,0.002757674,0.002278748,0.00519155],"category_scores_gemma":[0.05563993,0.0008254396,0.00123988,0.001545421,0.004529098,0.01010371,0.004915198,0.00442672,0.001054966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002275544,"about_ca_system_score_gemma":0.001961938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287489,"about_ca_topic_score_gemma":0.0004958161,"domain_scores_codex":[0.9883503,0.004369212,0.001023553,0.002010714,0.002477187,0.001769076],"domain_scores_gemma":[0.9508064,0.03442802,0.003639212,0.006975755,0.002432248,0.001718436],"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.0005388206,0.0003320581,0.002741984,0.0001891909,0.0000486463,0.0001083328,0.001038513,0.05335782,0.003887979,0.8404014,0.002072583,0.09528285],"study_design_scores_gemma":[0.00008764586,0.0004842619,0.001756171,0.00007562264,0.0000344894,0.0002905693,0.0002424073,0.2973442,0.003429632,0.6927913,0.00341056,0.00005311885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1768928,0.0007035311,0.7894645,0.001181222,0.00005790382,0.0002398093,0.0002719811,0.000742071,0.0304462],"genre_scores_gemma":[0.8800589,0.0005141294,0.1137772,0.000424879,0.0001250148,0.000295422,0.0003513003,0.0003527499,0.004100387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006463281,"threshold_uncertainty_score":0.03418148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981643246","doi":"10.2200/s00278ed1v01y201004dct001","title":"The Mobile Agent Rendezvous Problem in the Ring","year":2010,"lang":"en","type":"article","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Rendezvous; Computer science; Robotics; Artificial intelligence; Mobile agent; Ring (chemistry); Distributed computing; Mobile robot; Collective intelligence; Multi-agent system; Engineering; Robot; Aerospace engineering","authors":[{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Ευριπίδης Μάρκου","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009257801723203448,"gpt":0.2502785384484939,"spread":0.2410207367252905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118374,0.0005095787,0.001441359,0.000387127,0.001469721,0.00258726,0.001299333,0.00194393,0.005863015],"category_scores_gemma":[0.00330026,0.0004461648,0.0006296779,0.0006565202,0.001965044,0.003857489,0.001630543,0.001941931,0.0006219563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071461,"about_ca_system_score_gemma":0.000834151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001555229,"about_ca_topic_score_gemma":0.001023219,"domain_scores_codex":[0.9993703,0.0002340146,0.00001995247,0.0001673079,0.0001005223,0.0001080314],"domain_scores_gemma":[0.9987394,0.0008295936,0.0001097784,0.0001084543,0.00006150097,0.0001512306],"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.0003284673,0.00004247855,0.0002072706,0.0001472499,0.00003531881,0.0001588593,0.0002029438,0.1185043,0.002289192,0.856302,0.005404657,0.0163773],"study_design_scores_gemma":[0.0001133204,0.00007286842,0.0001923978,0.00003337874,0.00002856345,0.0001224821,0.0002602645,0.3206053,0.001468893,0.6660587,0.0110119,0.00003188015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2348867,0.005418465,0.6677806,0.007250919,0.0006270272,0.0001475014,0.0003685684,0.0003198107,0.08320037],"genre_scores_gemma":[0.89752,0.002604818,0.06637199,0.00020695,0.0003850763,0.0001458556,0.0001375371,0.0001055455,0.0325222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005863015,"threshold_uncertainty_score":0.01961374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493636406","doi":"10.1007/978-3-642-15763-9_28","title":"Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"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 à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Computer science; Traverse; Visibility; Euclidean space; Grid; Position (finance); Upper and lower bounds; Dimension (graph theory); Trajectory; RADIUS; Euclidean distance; Algorithm; Topology (electrical circuits); Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Geometry; Artificial intelligence; Spacecraft; Mathematical analysis","authors":[{"name":"Evangelos Bampas","is_ca":false},{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"David Ilcinkas","is_ca":false},{"name":"Arnaud Labourel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01574144675944542,"gpt":0.252601312417252,"spread":0.2368598656578066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547057,0.0005172217,0.001142673,0.0004408213,0.0007042123,0.001093237,0.001089183,0.0006554555,0.004809201],"category_scores_gemma":[0.003296241,0.0004499322,0.0003769326,0.0006042208,0.001170561,0.001879853,0.002258877,0.001065703,0.0004774404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005863234,"about_ca_system_score_gemma":0.0003541845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001203689,"about_ca_topic_score_gemma":0.001055621,"domain_scores_codex":[0.9996065,0.0001306969,0.00002075394,0.00006544435,0.0001052918,0.0000713102],"domain_scores_gemma":[0.9985979,0.0008648768,0.00009458898,0.0002501911,0.00008193757,0.0001105269],"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.000519903,0.00005366731,0.0003282533,0.0001480422,0.00003421082,0.0001181318,0.0001654012,0.542989,0.008283047,0.4166321,0.003028979,0.02769926],"study_design_scores_gemma":[0.00003963367,0.00002465146,0.00007575817,0.000009555287,0.000005093573,0.00002976757,0.00004759109,0.8430073,0.001174639,0.1546797,0.0008959373,0.00001045136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2358287,0.0009743692,0.7235356,0.0005743661,0.0002534458,0.00005957728,0.0002166523,0.0007071533,0.03785018],"genre_scores_gemma":[0.9368699,0.0003862585,0.05210736,0.00007117615,0.00006308528,0.00007614633,0.0001354512,0.0001836362,0.01010701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004809201,"threshold_uncertainty_score":0.01608837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108234048","doi":"","title":"Route planning under uncertainty: the Canadian traveller problem","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Disjoint sets; Enhanced Data Rates for GSM Evolution; Markov chain; Approximation algorithm; Markov decision process; Markov process; Mathematics; Artificial intelligence; Discrete mathematics; Machine learning","authors":[{"name":"Evdokia Nikolova","is_ca":false},{"name":"David R. Karger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05892733423275166,"gpt":0.2637952815795497,"spread":0.204867947346798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233291,0.001131843,0.001323027,0.0009309953,0.002266239,0.001947861,0.002060002,0.002295225,0.005720239],"category_scores_gemma":[0.005556988,0.0004949397,0.0006690989,0.003154078,0.001863516,0.002732905,0.001318583,0.001854512,0.0003078138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01020554,"about_ca_system_score_gemma":0.01452419,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.5760457,"about_ca_topic_score_gemma":0.5776826,"domain_scores_codex":[0.9988554,0.0002894633,0.00002616758,0.0002473436,0.0003265477,0.0002551602],"domain_scores_gemma":[0.9983687,0.001060423,0.0001032155,0.00009069016,0.0002063956,0.0001706679],"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.0002983288,0.0000564504,0.001141847,0.0001122895,0.00005358437,0.0001786996,0.0001323427,0.8863415,0.0004812526,0.0608117,0.0144212,0.0359709],"study_design_scores_gemma":[0.00008359617,0.00003839606,0.0007719119,0.00001657352,0.00003108744,0.0001012827,0.0001395362,0.944605,0.000544659,0.04610265,0.007518065,0.00004724634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.352759,0.004444216,0.5486223,0.01288678,0.0003071399,0.0005255551,0.007745107,0.002257421,0.07045259],"genre_scores_gemma":[0.8711974,0.001868762,0.1082182,0.0005116449,0.00009383656,0.0001470264,0.0024719,0.000231114,0.01526007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4239543,"threshold_uncertainty_score":0.8529021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119251691","doi":"10.1016/j.tcs.2004.05.019","title":"Competitive online routing in geometric graphs","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"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":"Delaunay triangulation; Combinatorics; Mathematics; Routing (electronic design automation); Shortest path problem; Convex polygon; Regular polygon; Discrete mathematics; Computer science; Graph; Geometry","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01431149959555006,"gpt":0.2694103437007924,"spread":0.2550988441052424,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002166675,0.001398809,0.002817982,0.001833758,0.002309392,0.004848305,0.004658803,0.00399705,0.01319632],"category_scores_gemma":[0.01505078,0.001195668,0.001044447,0.003684485,0.002529389,0.009668965,0.002702915,0.003115581,0.001359383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00327257,"about_ca_system_score_gemma":0.001909143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004180997,"about_ca_topic_score_gemma":0.005366011,"domain_scores_codex":[0.9977374,0.0009186753,0.00006775976,0.000392673,0.0004780676,0.0004054742],"domain_scores_gemma":[0.9867237,0.009349375,0.001171593,0.0008619017,0.0007751713,0.001118269],"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.0007400746,0.0005104588,0.00138949,0.000589955,0.0001142195,0.0002440365,0.0004491661,0.186613,0.00237986,0.7229257,0.02561625,0.0584279],"study_design_scores_gemma":[0.0001462221,0.0001241053,0.0004281548,0.00003313188,0.00006016385,0.0002028064,0.0001623493,0.4214802,0.0007163447,0.5712863,0.005333217,0.00002713103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3947696,0.004316061,0.5243289,0.007510772,0.0004860477,0.0003211199,0.0009400219,0.0009803616,0.06634708],"genre_scores_gemma":[0.874919,0.002364609,0.09159408,0.0008620986,0.0006389202,0.0002746594,0.0009897952,0.0003925218,0.0279643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01319632,"threshold_uncertainty_score":0.04414606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149929647","doi":"10.1109/focs.2006.15","title":"Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Binary logarithm; Logarithm; Approximation algorithm; Algorithm; Embedding; Vertex (graph theory); Discrete mathematics; Mathematics; Graph; Computer science; Artificial intelligence; Mathematical analysis","authors":[{"name":"Chandra Chekuri","is_ca":false},{"name":"Mohammad Taghi Hajiaghayi","is_ca":false},{"name":"Guy Kortsarz","is_ca":false},{"name":"Mohammad R. Salavatipour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03388222873633773,"gpt":0.2617209479277961,"spread":0.2278387191914584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003546741,0.00233559,0.002580513,0.001311108,0.001119574,0.002707984,0.0040294,0.002925167,0.01119854],"category_scores_gemma":[0.01458317,0.001132366,0.001907323,0.00326776,0.001448174,0.007781372,0.002713517,0.003415328,0.002224622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003123317,"about_ca_system_score_gemma":0.001595982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003067707,"about_ca_topic_score_gemma":0.003898341,"domain_scores_codex":[0.9964366,0.001168127,0.0001776745,0.0008699983,0.0006839991,0.0006636415],"domain_scores_gemma":[0.992985,0.004486725,0.0006129191,0.00123004,0.0004027234,0.0002826496],"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.0009454484,0.0004884095,0.00146316,0.0005763792,0.0001593543,0.0001505806,0.0002274619,0.7638702,0.002604768,0.05853136,0.01534517,0.1556377],"study_design_scores_gemma":[0.00008794154,0.0001055244,0.0001621827,0.00002166213,0.00002735917,0.00009486855,0.00004267359,0.9326559,0.0008386612,0.06419078,0.001758472,0.00001394804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02866988,0.001294011,0.9594544,0.001164532,0.0001166407,0.0001872514,0.000452617,0.001519199,0.007141416],"genre_scores_gemma":[0.4547967,0.001239473,0.5279004,0.0008161186,0.0002879484,0.0005368032,0.00191393,0.0007334397,0.01177528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01119854,"threshold_uncertainty_score":0.03746289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980155648","doi":"10.1016/j.tcs.2004.07.031","title":"Optimal graph exploration without good maps","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":66,"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 en Outaouais","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","authors":[{"name":"Anders Dessmark","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01837253555669641,"gpt":0.2655600713819139,"spread":0.2471875358252175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007855304,0.0008761737,0.001435775,0.001108552,0.0009116104,0.001357138,0.001106535,0.001923487,0.007158639],"category_scores_gemma":[0.008353266,0.0008537308,0.0009297192,0.001187752,0.001323063,0.004312681,0.002896153,0.001754599,0.0006840338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007378873,"about_ca_system_score_gemma":0.000985596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001712138,"about_ca_topic_score_gemma":0.002394961,"domain_scores_codex":[0.9993705,0.0002989564,0.00002002923,0.000115475,0.0001036022,0.00009136795],"domain_scores_gemma":[0.9962872,0.002833652,0.0001119323,0.0004807698,0.000125402,0.0001610222],"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.001419179,0.0002370657,0.001268001,0.000714373,0.0001607457,0.0002441759,0.0004556339,0.5891887,0.005097709,0.257098,0.01639659,0.1277197],"study_design_scores_gemma":[0.0001107541,0.0001026484,0.0002930834,0.00004391444,0.0000490593,0.0001012855,0.00009332078,0.636344,0.001638354,0.3581721,0.003034932,0.00001665562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2704399,0.002718221,0.6738353,0.003428087,0.0002640167,0.0001777224,0.0006881281,0.002164073,0.04628455],"genre_scores_gemma":[0.8183689,0.0006436383,0.167105,0.0003507631,0.00007684183,0.0001718336,0.0003596246,0.0003894416,0.01253396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007158639,"threshold_uncertainty_score":0.02394801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2488817718","doi":"10.1007/978-3-642-51182-0","title":"Advances in Markov-Switching Models","year":2002,"lang":"en","type":"book","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Markov chain; Computer science; Machine learning","authors":[{"name":"Baldev Raj","is_ca":true},{"name":"James Hamilton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02400731189228429,"gpt":0.2472961401639825,"spread":0.2232888282716982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221283,0.001292013,0.001246459,0.001458419,0.0004992923,0.002058261,0.001097462,0.001270984,0.01046481],"category_scores_gemma":[0.004421289,0.0008415494,0.001486382,0.00267921,0.001086987,0.002665183,0.00108044,0.00374094,0.003593785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660949,"about_ca_system_score_gemma":0.001562654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002818412,"about_ca_topic_score_gemma":0.00250532,"domain_scores_codex":[0.99907,0.0002320821,0.00005320633,0.0001775374,0.0004106024,0.00005655602],"domain_scores_gemma":[0.9978549,0.001603565,0.00007896376,0.0001848998,0.0002251589,0.00005251128],"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.0000260873,0.00005059523,0.0003331324,0.0005692143,0.00008874669,0.0001256949,0.0001441097,0.04972957,0.0004565677,0.722892,0.08038624,0.1451979],"study_design_scores_gemma":[0.00001297878,0.00002758298,0.0003930415,0.0002317974,0.00003819731,0.0002086041,0.0000263393,0.1081037,0.0002662642,0.6371052,0.253554,0.00003232099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.004504156,0.1407418,0.6671654,0.009190327,0.00674619,0.0000828483,0.001339388,0.0009029548,0.1693269],"genre_scores_gemma":[0.1760949,0.315632,0.2645471,0.003621897,0.01100851,0.0005304795,0.003935756,0.0008800169,0.2237494],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01046481,"threshold_uncertainty_score":0.03500831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}