{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000297628,0.000186647,0.0003628509,0.0001947562,0.0001714272,0.0001272071,0.0004788639,0.00008846878,0.0000869534],"category_scores_gemma":[0.000005949319,0.0001721925,0.0002057532,0.0002585241,0.0001043985,0.0004656477,0.000001298494,0.0001084062,0.00003832674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108628,"about_ca_system_score_gemma":0.0003619025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003698292,"about_ca_topic_score_gemma":0.00002917006,"domain_scores_codex":[0.9984767,0.00007546978,0.0005035077,0.0003017498,0.0003062007,0.0003363653],"domain_scores_gemma":[0.9988751,0.00025758,0.0001433453,0.000436611,0.0001585797,0.0001287562],"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.00002674744,0.0004116693,5.52843e-7,0.00006308474,0.00009969186,0.000002562321,0.0007287445,0.9369456,0.0005214568,0.009512327,0.00002903053,0.05165857],"study_design_scores_gemma":[0.007054112,0.0006960113,0.00003124178,0.0000435248,0.00003922472,0.000007301207,0.0001664399,0.9862342,0.001408959,0.004036135,0.000112418,0.0001703923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002146554,0.00002252074,0.9948457,0.0005343193,0.0003435865,0.001520586,0.0000495681,0.0003523422,0.0001847738],"genre_scores_gemma":[0.9789946,0.000004899899,0.01982262,0.0004224174,0.00001125906,0.0006491823,0.000001242161,0.00001635852,0.00007743846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976848,"threshold_uncertainty_score":0.7021806,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903,0.0001293612,0.000178054,0.0001449268,0.0001888667,0.0002046545,0.001747823,0.00003172577,0.00005641976],"category_scores_gemma":[0.00004706186,0.00009395608,0.00003650101,0.001217726,0.002004258,0.0007713308,0.000617594,0.0001390876,0.00003056628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005692165,"about_ca_system_score_gemma":0.0001627541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002172021,"about_ca_topic_score_gemma":0.000001162549,"domain_scores_codex":[0.9980201,0.0000830149,0.0002558395,0.0005420213,0.0006644062,0.0004346173],"domain_scores_gemma":[0.9984664,0.0001354691,0.0000694913,0.0008026662,0.0002954756,0.0002305235],"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.000008432415,0.0001053301,0.0001528901,0.000007615372,0.000003059466,0.000002187562,0.0005332333,0.04179953,0.000566356,0.8895248,0.00000439432,0.06729221],"study_design_scores_gemma":[0.0002528696,0.0003283722,0.001284808,0.00002777313,0.000001613575,0.00001770977,0.000003058317,0.981804,0.007003725,0.009098463,0.00003534695,0.0001422707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03703757,0.00001257481,0.9580007,0.001004498,0.0000666015,0.0001595082,4.099433e-7,0.0001486674,0.003569494],"genre_scores_gemma":[0.5803678,0.000001878227,0.4194306,0.0001652379,0.00002526234,0.00000200388,1.504743e-7,0.000003392104,0.000003686771],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9400045,"threshold_uncertainty_score":0.7384773,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319247,0.0002043959,0.0001978248,0.0002129977,0.0007857071,0.0004251479,0.002351122,0.0000648234,0.00008717705],"category_scores_gemma":[0.0000366599,0.0001755473,0.00006169009,0.001170041,0.00186639,0.002069125,0.0008076995,0.000250142,0.0002344768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009003295,"about_ca_system_score_gemma":0.0001922368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006660031,"about_ca_topic_score_gemma":5.597788e-7,"domain_scores_codex":[0.9971718,0.0001413222,0.0003453802,0.00065915,0.0009624618,0.0007199518],"domain_scores_gemma":[0.9984288,0.000118614,0.00008308946,0.0007580139,0.000215606,0.0003958839],"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.000005341231,0.0002541319,0.0002417457,0.00001798939,0.00000576817,0.00005554542,0.001862112,0.002466793,0.0009579968,0.8919352,0.004101459,0.09809588],"study_design_scores_gemma":[0.0002922674,0.0002409931,0.0004279935,0.00001816053,0.000001426021,0.000232806,0.000002902508,0.9799327,0.003281956,0.01501502,0.000271448,0.0002823281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0083896,0.0000503886,0.9846596,0.001590577,0.0003064197,0.0002393509,0.000002718002,0.0003837265,0.004377697],"genre_scores_gemma":[0.8455457,0.00004362077,0.1524308,0.001863775,0.0000634902,0.000009900119,0.000005527555,0.000009324222,0.00002785949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9774659,"threshold_uncertainty_score":0.7158611,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008411097,0.0001287035,0.0001883315,0.0002138389,0.0002102913,0.0003007403,0.001673702,0.00002724025,0.00006084338],"category_scores_gemma":[0.00003883801,0.00009276959,0.00002803962,0.0015089,0.002836589,0.0007199949,0.0005063946,0.0002082683,0.000027101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002807611,"about_ca_system_score_gemma":0.00008515613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005030017,"about_ca_topic_score_gemma":9.91158e-7,"domain_scores_codex":[0.9976901,0.0001045317,0.0001953089,0.0005229441,0.0009776748,0.000509441],"domain_scores_gemma":[0.9986474,0.000187649,0.00007061483,0.0006265594,0.000217926,0.0002498733],"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.000008313949,0.00006202642,0.0001389992,0.00001288471,0.000005487493,0.00001952093,0.001956724,0.008462408,0.0001085051,0.9564935,0.00003333736,0.03269828],"study_design_scores_gemma":[0.0003819337,0.0006207745,0.0006583157,0.00009229278,0.000002636812,0.00004999186,0.00001229684,0.9897836,0.001055391,0.006978513,0.0001638395,0.0002003987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03309299,0.00001766845,0.9616089,0.00122696,0.00006359188,0.0001662373,4.875282e-7,0.0001216945,0.003701496],"genre_scores_gemma":[0.6838351,0.00000677868,0.3158219,0.0002950717,0.00001572688,0.000002799997,1.550484e-7,0.000005991066,0.0000164907],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9813212,"threshold_uncertainty_score":0.9998771,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003500203,0.0001513922,0.0001809716,0.0001743977,0.0002088471,0.0002659691,0.0005877695,0.00007598136,0.00008996327],"category_scores_gemma":[0.00002437209,0.0001491455,0.00004445227,0.0005478697,0.00008969039,0.0005555513,0.0002861823,0.0002639029,0.00004352499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000367681,"about_ca_system_score_gemma":0.00007451346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005342602,"about_ca_topic_score_gemma":0.000005581212,"domain_scores_codex":[0.9983335,0.0000851215,0.0002297956,0.0004737741,0.000398934,0.0004788456],"domain_scores_gemma":[0.9991356,0.00008460279,0.00002961684,0.0003746926,0.0001088806,0.0002666794],"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.000007227974,0.0003524673,0.0002138123,0.00001706166,0.00005109585,0.0001019976,0.001388629,0.002372984,0.0003997603,0.01928258,0.0005824047,0.97523],"study_design_scores_gemma":[0.0005018801,0.0001347336,0.0005494249,0.00001702453,0.000003794453,0.0001024155,0.00006260281,0.991249,0.000400704,0.0007511341,0.006017497,0.0002097378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01267927,0.0002509615,0.9798263,0.004266843,0.0001512213,0.0002256027,0.000008274761,0.0002585572,0.002333018],"genre_scores_gemma":[0.07194244,0.0004101708,0.9255467,0.0005331247,0.0002128014,0.00001149897,0.00001859241,0.00002155348,0.001303108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.988876,"threshold_uncertainty_score":0.6081978,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437512,0.0001524127,0.0001722606,0.000400387,0.0002492458,0.0004319532,0.002031313,0.00004959562,0.00003853445],"category_scores_gemma":[0.00006059222,0.0001361934,0.00004113731,0.001970611,0.001054341,0.0007551633,0.001036415,0.0002538921,0.00007666907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408314,"about_ca_system_score_gemma":0.0001180432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007911382,"about_ca_topic_score_gemma":0.000005691149,"domain_scores_codex":[0.9974321,0.0000664212,0.0003298305,0.0006480204,0.0006419096,0.0008817366],"domain_scores_gemma":[0.9986827,0.0002253382,0.00004720778,0.0006139838,0.0001176305,0.0003131812],"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.000003472967,0.00007397059,0.0002139134,0.000005133061,0.000001038427,0.00004386608,0.001070733,0.02661947,0.0005327346,0.8828974,0.000001885928,0.08853641],"study_design_scores_gemma":[0.0002760071,0.0001774411,0.002156076,0.00003792884,5.807336e-7,0.00003911735,0.00001277769,0.9719089,0.002062674,0.02308052,0.00003784794,0.0002101693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05047896,0.00003205122,0.9417642,0.0001547293,0.0003042003,0.0002376814,1.381701e-7,0.0002119651,0.006816026],"genre_scores_gemma":[0.7524164,0.000005166674,0.2472766,0.0002371911,0.00004476683,0.000007062627,1.433502e-7,0.000006361274,0.000006380842],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9452894,"threshold_uncertainty_score":0.5553804,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002174249,0.0000518714,0.00006135603,0.00003760779,0.00004529287,0.0001446564,0.0004933453,0.0000212223,0.00002817535],"category_scores_gemma":[0.00002478104,0.00003234084,0.00001574641,0.00006225455,0.0000334774,0.0001387081,0.0001920154,0.00004820789,0.00001830201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001394955,"about_ca_system_score_gemma":0.0000163171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002152512,"about_ca_topic_score_gemma":0.000001453309,"domain_scores_codex":[0.9994284,0.00001508429,0.0001220273,0.0001533168,0.0001989332,0.00008226614],"domain_scores_gemma":[0.9996223,0.00001427739,0.00006614452,0.0001032768,0.0001512771,0.00004274711],"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.000001647428,0.00006456898,0.003334196,0.00002083802,0.00001051413,8.178982e-8,0.0005084974,0.001073037,0.0004718642,0.9868612,0.004597512,0.00305599],"study_design_scores_gemma":[0.0002185635,0.00003314693,0.003983621,0.00002226105,6.786997e-7,0.000001834111,0.00003005925,0.9918796,0.0002564123,0.0001728953,0.003357553,0.00004336295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02657607,0.00001339689,0.8063334,0.006618742,0.001359709,0.0007289305,0.000003411548,0.0001609777,0.1582054],"genre_scores_gemma":[0.9857419,0.00001558803,0.009426214,0.0002793551,0.00001342962,0.000008601033,3.190703e-7,0.000002523313,0.004512079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9908066,"threshold_uncertainty_score":0.1394925,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000134392,0.00007182709,0.00008487681,0.000151036,0.00004614204,0.00008710234,0.0004081403,0.00003635084,0.00001850493],"category_scores_gemma":[0.00001428557,0.00006976389,0.00002800708,0.0004634054,0.00002965178,0.0001761277,0.00008781982,0.0000888118,0.0000709498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000213945,"about_ca_system_score_gemma":0.00003649059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001114815,"about_ca_topic_score_gemma":0.00003771414,"domain_scores_codex":[0.9991646,0.0000422043,0.0001700152,0.0002267345,0.0001616809,0.0002347376],"domain_scores_gemma":[0.9995816,0.00004516499,0.00002931887,0.00026862,0.0000310801,0.00004417815],"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.000006067278,0.000438616,0.001961668,0.00002365192,0.00001023215,0.0004016608,0.0004658215,0.005350041,0.0005218454,0.6046357,0.007916503,0.3782682],"study_design_scores_gemma":[0.0007011457,0.00008906973,0.006951891,0.00001643918,0.000001743957,0.00003853677,0.00000802106,0.875914,0.0005620472,0.1059462,0.009487852,0.0002830731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003561816,0.0001022876,0.9665577,0.001356371,0.000299405,0.0002207468,0.000002674059,0.0002723639,0.02762657],"genre_scores_gemma":[0.8306001,0.000009849199,0.1677829,0.0002881532,0.00004448798,0.00002257029,0.000006263714,0.000009199559,0.001236453],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.870564,"threshold_uncertainty_score":0.2844889,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114079,0.0001363372,0.0001234795,0.0002025152,0.0003959368,0.0007006584,0.001823932,0.00004139156,0.00007726756],"category_scores_gemma":[0.00006377375,0.0001147411,0.00004361604,0.001438848,0.001168217,0.002299391,0.0005615748,0.0001475988,0.0002833978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004518756,"about_ca_system_score_gemma":0.00009071823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001080564,"about_ca_topic_score_gemma":3.43402e-7,"domain_scores_codex":[0.9978758,0.0001005467,0.0002421957,0.000565295,0.0007259984,0.0004902178],"domain_scores_gemma":[0.9987361,0.0001419702,0.00005038867,0.0005982959,0.0001820114,0.0002912778],"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.000001554988,0.00005458294,0.000005386856,0.000001862398,0.000001204159,0.000001146082,0.0004658638,0.005866795,0.0003272131,0.9339461,0.0008749659,0.05845338],"study_design_scores_gemma":[0.0001724142,0.00009950474,0.00001839989,0.000008922168,8.433609e-7,0.000005998459,0.000002515826,0.9257401,0.003574315,0.06817894,0.002044458,0.000153587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001017688,0.00002185034,0.9868971,0.007342363,0.000203155,0.0001505767,0.000001102647,0.0004303821,0.003935797],"genre_scores_gemma":[0.6760599,0.00001242065,0.3223915,0.001425604,0.00005873931,0.000009546527,0.000001682295,0.000005002157,0.00003564327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198733,"threshold_uncertainty_score":0.6756465,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133959,0.0001500226,0.0001696005,0.0003748334,0.0002416832,0.0004947863,0.002040313,0.0000455588,0.00003805926],"category_scores_gemma":[0.00004959411,0.0001301577,0.00004395574,0.001828148,0.001754959,0.0005600508,0.0006528549,0.0001847006,0.00008401408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007546295,"about_ca_system_score_gemma":0.000161991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000165873,"about_ca_topic_score_gemma":0.00000648387,"domain_scores_codex":[0.9976315,0.0001113556,0.000317791,0.0006534706,0.0006242603,0.0006616486],"domain_scores_gemma":[0.9988447,0.0001644948,0.0000478801,0.0006517049,0.0001152394,0.000175962],"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.000001964471,0.00007270684,0.0001978814,0.000003431782,4.559499e-7,0.00003771688,0.00009668663,0.003201286,0.0001118696,0.9788424,0.00003051453,0.01740302],"study_design_scores_gemma":[0.0001881492,0.0001033195,0.002479148,0.00001226256,5.966909e-7,0.00003050145,0.000001054393,0.6450401,0.0003122867,0.3516462,0.00004529295,0.000141168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01234221,0.00001857522,0.9737111,0.0006469216,0.0002974503,0.0001575459,5.630621e-7,0.0001908603,0.01263479],"genre_scores_gemma":[0.8057923,0.000002584961,0.1938819,0.0002613782,0.00003720339,0.000007209351,6.301177e-7,0.000005131199,0.00001161829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934501,"threshold_uncertainty_score":0.6466218,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002406245,0.0001330374,0.0001356462,0.0002282419,0.0002228921,0.000366762,0.0001341094,0.00007865458,0.00003833428],"category_scores_gemma":[0.000005561971,0.0001200106,0.00002961896,0.0003085101,0.00007726148,0.001025211,0.000001659349,0.000133866,0.000006493202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003951711,"about_ca_system_score_gemma":0.0001085969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006667748,"about_ca_topic_score_gemma":0.0000634198,"domain_scores_codex":[0.9989615,0.00005444008,0.0002419523,0.0003116044,0.0001943253,0.0002361842],"domain_scores_gemma":[0.999408,0.00009495499,0.00005578937,0.0002307592,0.0001072995,0.000103194],"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.00003690611,0.0001781157,0.00002870828,0.00001446116,0.000007628015,0.000003997049,0.0004530099,0.9514961,0.00008249968,0.002785538,0.000008289167,0.0449048],"study_design_scores_gemma":[0.001206568,0.0004359276,0.001070902,0.00006527844,0.000007671338,0.00003788181,0.00006825047,0.9962489,0.0003164156,0.0003578337,0.00001646098,0.0001679123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01525009,0.000007936883,0.9824412,0.001398051,0.0001215642,0.0005123486,0.000005602546,0.0001284798,0.0001346997],"genre_scores_gemma":[0.641587,0.00003443226,0.3580833,0.0001556896,0.00001065598,0.00004875212,0.000004758331,0.000009237497,0.0000661802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6263369,"threshold_uncertainty_score":0.4893891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709455,0.00006200723,0.000147613,0.001001299,0.0002616291,0.0002220077,0.0006788066,0.00003107054,0.0001187702],"category_scores_gemma":[0.0000657514,0.00005955004,0.00006235592,0.003702385,0.00006472968,0.0003446449,0.0001857384,0.0001946916,0.0000238352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005078892,"about_ca_system_score_gemma":0.00007614063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005475908,"about_ca_topic_score_gemma":0.0002661988,"domain_scores_codex":[0.9983911,0.0002587383,0.0002243024,0.0002698756,0.000601711,0.0002542803],"domain_scores_gemma":[0.9988158,0.00006057218,0.0000162475,0.0004581886,0.0005712283,0.00007794423],"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.000003653012,0.0002081672,0.00005629125,0.000008453754,0.0001365765,0.00001118082,0.00121525,0.3575768,0.0002681065,0.6288533,0.0005089919,0.01115332],"study_design_scores_gemma":[0.0002133458,0.0001344146,0.005394295,0.00003109864,0.00002423769,9.095669e-7,0.0003514547,0.9899911,0.00016209,0.0004571158,0.003149252,0.00009072058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004288459,0.0001154333,0.9385695,0.008973265,0.00004440498,0.0005690242,0.00006067696,0.00006085455,0.0473184],"genre_scores_gemma":[0.8017977,0.0002815178,0.191967,0.000203487,0.00002416854,0.00001736022,0.00008816033,0.000004596295,0.005615989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7975093,"threshold_uncertainty_score":0.242838,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005801483,0.00003846565,0.00004949684,0.00002812527,0.00002336218,0.00003764011,0.0003366439,0.00002556808,0.001612214],"category_scores_gemma":[0.000004302577,0.00003070752,0.00001348904,0.0001556459,0.00001636,0.0002958449,0.00006043752,0.00003860433,0.00006604643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005030418,"about_ca_system_score_gemma":0.000004035775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002192988,"about_ca_topic_score_gemma":0.000002720056,"domain_scores_codex":[0.9995321,0.00002634464,0.00008389755,0.0001205219,0.0001400002,0.00009713252],"domain_scores_gemma":[0.9996331,0.000007534823,0.00001997794,0.0002292362,0.00004390336,0.00006627564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002454178,0.001205713,0.000521581,0.00003486097,0.00003180915,0.00001290542,0.009327414,0.01668021,0.003126353,0.0363667,0.7018468,0.2308432],"study_design_scores_gemma":[0.0001946411,0.00008164025,0.00003869787,0.000001989797,5.390201e-7,0.000002219824,0.00003956365,0.9731569,0.002272288,0.0001872059,0.02395226,0.00007201495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115992,0.0001393321,0.9098591,0.0009101257,0.0001320891,0.000266004,0.000003846873,0.000180442,0.07690991],"genre_scores_gemma":[0.9057087,0.00003971075,0.07356982,0.001153368,0.00001121361,0.00001256504,0.000004937072,0.00000551052,0.01949419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9564767,"threshold_uncertainty_score":0.9993004,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006440432,0.00006568097,0.0001049982,0.00004618281,0.0005830552,0.0003270646,0.001465887,0.00004756887,0.00004067759],"category_scores_gemma":[0.0003917491,0.00003460256,0.0001776758,0.0006530753,0.0001640694,0.001340176,0.0002607399,0.0005769152,0.000007318297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008815046,"about_ca_system_score_gemma":0.0006771036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000133376,"about_ca_topic_score_gemma":0.000008993135,"domain_scores_codex":[0.9968333,0.0006660608,0.0004024191,0.000117334,0.001760718,0.0002201739],"domain_scores_gemma":[0.9973949,0.0003618982,0.0001695427,0.0003515584,0.001630635,0.00009141807],"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.00004496202,0.0004288284,0.001429101,0.00003388603,0.0001484147,0.000002069614,0.01189772,0.6087373,0.02876027,0.2961444,0.01005429,0.04231872],"study_design_scores_gemma":[0.0004810817,0.0001740967,0.0155296,0.00005434648,0.000004046773,0.00003365753,0.000353213,0.9348413,0.007914087,0.003856014,0.03668044,0.00007808236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4104065,0.001348465,0.3066961,0.2761503,0.0006582207,0.00120032,0.00001015737,0.00003646342,0.003493485],"genre_scores_gemma":[0.6376398,0.0008617818,0.3558922,0.00233044,0.0005995004,0.000007388369,0.000002656788,0.00001309639,0.00265312],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.326104,"threshold_uncertainty_score":0.4484448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184078,0.0001345159,0.0001387454,0.0001096526,0.000403717,0.0004112386,0.0002075775,0.000060759,0.000009411956],"category_scores_gemma":[0.00002886475,0.000133177,0.00001273002,0.0006046844,0.00008001217,0.002050235,0.000150822,0.0001059757,0.00001341569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004579481,"about_ca_system_score_gemma":0.000137862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002375316,"about_ca_topic_score_gemma":0.00003672859,"domain_scores_codex":[0.9989539,0.00006131981,0.0002152553,0.0003576294,0.0001704485,0.000241467],"domain_scores_gemma":[0.9992878,0.00004931986,0.00008101256,0.0002645771,0.0001938546,0.0001234241],"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.00003374886,0.0003645573,0.01879417,0.00008626155,0.0001107624,0.00004698629,0.02235552,0.290313,0.001554508,0.1138495,0.00359809,0.5488929],"study_design_scores_gemma":[0.0004693256,0.0001798557,0.0190131,0.00001975631,0.000005057672,0.00003333252,0.0001400173,0.9689199,0.0001417792,0.001607287,0.009232225,0.0002383753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01338531,0.0004675955,0.9764757,0.006767383,0.0001744812,0.0003726247,0.000003358487,0.0002673357,0.002086272],"genre_scores_gemma":[0.4817141,0.004596059,0.5079327,0.001061176,0.00009769914,0.0001446604,0.00004476003,0.00002752566,0.004381313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6786069,"threshold_uncertainty_score":0.5430802,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189816,0.0001526979,0.0001603109,0.0001680182,0.0002651146,0.0006782161,0.002277082,0.00003642001,0.00002617412],"category_scores_gemma":[0.00003188966,0.0001037183,0.00002697996,0.001328212,0.001817904,0.0009817744,0.0008180934,0.0001567049,0.0002176335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007822368,"about_ca_system_score_gemma":0.0004560502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003087938,"about_ca_topic_score_gemma":5.92681e-7,"domain_scores_codex":[0.9976414,0.00008973702,0.0001857154,0.0006322242,0.0008912695,0.00055969],"domain_scores_gemma":[0.998017,0.00007663977,0.00004564873,0.0007857056,0.0004103258,0.0006646811],"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.000005378344,0.00005708278,0.00002278768,0.000001886329,0.000001954251,0.0000171192,0.0007716569,0.02340094,0.00002632455,0.9622304,0.0001354236,0.01332906],"study_design_scores_gemma":[0.0003572991,0.0007193605,0.00005825181,0.00001397807,0.000001545793,0.00006701438,0.000008123763,0.9412308,0.001168583,0.05526949,0.0008934426,0.0002121174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003843371,0.0000188183,0.9798011,0.0009918768,0.000297022,0.0002355756,3.210878e-7,0.0003454881,0.01446648],"genre_scores_gemma":[0.6118338,0.000001180034,0.3876382,0.0004133408,0.00004756423,0.00001291327,3.709993e-7,0.000005245649,0.00004740079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9178299,"threshold_uncertainty_score":0.6698142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162236,0.0002553512,0.0003386753,0.0001505119,0.000917098,0.0001476211,0.003254893,0.0002439986,0.00002098793],"category_scores_gemma":[0.0002636987,0.0001348756,0.0001757837,0.001380132,0.00156019,0.0004212059,0.000832397,0.0004846073,0.000008069427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001004499,"about_ca_system_score_gemma":0.0001919262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004413456,"about_ca_topic_score_gemma":0.0001357705,"domain_scores_codex":[0.9978638,0.00009151358,0.0004462027,0.0004158747,0.000618178,0.0005644483],"domain_scores_gemma":[0.9973584,0.0001422859,0.0004527819,0.001729228,0.0002547177,0.00006257741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004479499,0.0003234624,0.02198905,0.00005121923,0.0003492075,0.00002564462,0.001782394,0.00269603,0.004588443,0.5117404,0.0247248,0.4316846],"study_design_scores_gemma":[0.002080177,0.0002681553,0.004126821,0.0001621662,0.00005836344,0.00005357693,0.0003430097,0.05508412,0.07892814,0.02560767,0.8327128,0.0005749778],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.1138372,0.01007861,0.3478723,0.4983054,0.004406411,0.005645887,0.000218181,0.001859541,0.01777649],"genre_scores_gemma":[0.9826557,0.0004655996,0.01458427,0.0009591678,0.00003906222,0.00003640267,0.000007272586,0.00001584955,0.001236684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8688185,"threshold_uncertainty_score":0.7053669,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344309,0.0001222456,0.000130362,0.0001479813,0.0004458744,0.0002924493,0.003058756,0.00003237805,0.00003971893],"category_scores_gemma":[0.00003778734,0.0000793042,0.00003547247,0.001463397,0.001699279,0.0005515664,0.000613329,0.0002300269,0.00009621276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003396782,"about_ca_system_score_gemma":0.00007767962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005258614,"about_ca_topic_score_gemma":9.496126e-7,"domain_scores_codex":[0.9979109,0.0001665476,0.0002088561,0.0004687564,0.0007274841,0.0005174425],"domain_scores_gemma":[0.9988297,0.0002408788,0.00003213323,0.0006847105,0.0000736612,0.0001389153],"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.000002236766,0.00006725981,0.0001438224,0.00000291343,8.026436e-7,0.00005043462,0.003225646,0.01689081,0.0001365232,0.9710054,0.00007749901,0.008396606],"study_design_scores_gemma":[0.0002344182,0.0001901113,0.001548278,0.00001828717,5.777833e-7,0.0001749823,0.00002013502,0.9716216,0.0005579641,0.02515939,0.0002986756,0.0001755824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03452335,0.00002939739,0.9589333,0.001021073,0.0002015046,0.0002573262,3.250651e-7,0.0001138107,0.004919931],"genre_scores_gemma":[0.9007551,0.0000210857,0.09817092,0.0009598405,0.0000552092,0.0000183048,3.908847e-7,0.000004099161,0.0000150151],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9547308,"threshold_uncertainty_score":0.6261066,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005363119,0.000436891,0.0005992926,0.0002279836,0.0004976093,0.001036061,0.0003889365,0.0002168931,0.00002843546],"category_scores_gemma":[0.00001181324,0.0003884969,0.00007524486,0.0003438111,0.0002973577,0.00025175,0.00003057954,0.0005797932,0.00002845361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000391625,"about_ca_system_score_gemma":0.00004019161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001851711,"about_ca_topic_score_gemma":0.00006895803,"domain_scores_codex":[0.9972365,0.00031118,0.0006257269,0.0008042518,0.0004391012,0.000583273],"domain_scores_gemma":[0.9984687,0.0002521902,0.0001965107,0.000480008,0.0001542365,0.00044836],"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.0005045887,0.003141061,0.009204567,0.001080257,0.001699441,0.0002432004,0.05954119,0.1151226,0.004636089,0.06013171,0.003598311,0.741097],"study_design_scores_gemma":[0.002854781,0.001014602,0.0004748209,0.0003291614,0.0000711504,0.0003534306,0.001760757,0.8946415,0.0009403126,0.000387937,0.09622727,0.0009443009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05129623,0.001893066,0.9418432,0.0005537082,0.0005961871,0.0007825838,0.00001512817,0.0003222757,0.002697657],"genre_scores_gemma":[0.9855049,0.002953875,0.003521217,0.0001255691,0.00007388752,0.00007740525,0.000006118907,0.00004658327,0.007690417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9383219,"threshold_uncertainty_score":0.9998567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001815291,0.0002563669,0.0003281721,0.001028903,0.0009900427,0.0003822566,0.002387464,0.0000508864,0.0001947077],"category_scores_gemma":[0.00004181482,0.0002755409,0.00008525269,0.003289393,0.0004936216,0.001811001,0.001310071,0.0003963106,0.0001042413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002322854,"about_ca_system_score_gemma":0.0005276329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003430622,"about_ca_topic_score_gemma":0.000009348529,"domain_scores_codex":[0.996119,0.0002545129,0.0005934485,0.001010934,0.00138274,0.0006393283],"domain_scores_gemma":[0.9980744,0.0002092729,0.0001980198,0.00090464,0.0003453961,0.0002683152],"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.00004065012,0.00078786,0.0002793462,0.00002474084,0.00001939684,0.00002742349,0.006026563,0.922797,0.004211518,0.00748291,0.00455849,0.05374405],"study_design_scores_gemma":[0.0006928509,0.0006212774,0.0002974757,0.00001930947,0.000003564307,0.00003295368,0.00007044169,0.9885436,0.0005879065,0.0008897127,0.00793092,0.0003099363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04945556,0.00004829012,0.9315991,0.01064762,0.003136725,0.001670373,0.0002496254,0.0003282203,0.002864467],"genre_scores_gemma":[0.5239353,0.0001395753,0.4669846,0.004376112,0.0004693914,0.0005051045,0.0001289758,0.00009255576,0.003368368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4744797,"threshold_uncertainty_score":0.9999697,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003394283,0.0001378466,0.0006222902,0.0005716127,0.0002206001,0.000276266,0.001898534,0.00003168027,0.0009561434],"category_scores_gemma":[0.0000913379,0.0001053503,0.0002416257,0.004672198,0.003961053,0.0005201633,0.0003732544,0.0001283928,0.0000440105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002687346,"about_ca_system_score_gemma":0.00008809678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008084495,"about_ca_topic_score_gemma":6.004889e-7,"domain_scores_codex":[0.9973611,0.0003539698,0.0004511581,0.0005553968,0.0008573942,0.0004210245],"domain_scores_gemma":[0.998095,0.0006296893,0.00008463021,0.0006482695,0.0003227323,0.0002196596],"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.0001010339,0.00004594006,0.000007380757,0.000002047305,0.000069289,0.000002646904,0.0006670746,0.01135252,0.00003003765,0.9526325,0.000004016641,0.03508545],"study_design_scores_gemma":[0.00425428,0.0000456333,0.0001241082,0.00001275204,0.00005760959,0.000002842917,0.000004798731,0.9666694,0.0004384223,0.02817253,0.00008659009,0.0001309957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00242172,0.00002050614,0.9628409,0.0006763919,0.0001028411,0.0002150622,0.000002510626,0.0001084067,0.03361172],"genre_scores_gemma":[0.7388724,0.00002569932,0.2606899,0.0003484808,0.00001897886,0.000006356352,0.000001967511,0.000003233633,0.00003297355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9553169,"threshold_uncertainty_score":0.9999571,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000222414,0.0000829421,0.00008336161,0.00005207275,0.00008265109,0.000221999,0.0004461294,0.00003605474,0.00009301415],"category_scores_gemma":[0.00004235628,0.00007226675,0.00003212261,0.000264888,0.00001446436,0.0007376413,0.0002085951,0.00005156621,0.000395209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003517592,"about_ca_system_score_gemma":0.00003429427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001664719,"about_ca_topic_score_gemma":0.00001774348,"domain_scores_codex":[0.9990978,0.0000525056,0.00007835277,0.0001764072,0.0002270191,0.0003679751],"domain_scores_gemma":[0.9992915,0.00002861061,0.0000229525,0.0003226901,0.00006633575,0.0002678484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009892847,0.0004143891,0.009602456,0.00005385915,0.00004501528,0.00002235218,0.008919283,0.001912948,0.002044907,0.6121617,0.2395091,0.1253041],"study_design_scores_gemma":[0.0007616062,0.0002867932,0.007845374,0.00005216659,0.000006612293,0.00006155413,0.0001874247,0.04403705,0.004949328,0.002001552,0.9390094,0.0008011256],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003854929,0.0001516672,0.9549183,0.01225317,0.0004690951,0.0002128262,0.00000206784,0.0002122746,0.02792566],"genre_scores_gemma":[0.8576987,0.000006720255,0.1328993,0.001476129,0.000196105,0.00001924319,0.000001512723,0.000009714856,0.007692595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8538438,"threshold_uncertainty_score":0.5079744,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002247268,0.00008041508,0.0001089702,0.0002905868,0.0002240635,0.0005525541,0.003092048,0.00003735267,0.00003508897],"category_scores_gemma":[0.0002200315,0.00004567137,0.00009524811,0.000413061,0.0001277433,0.0007241775,0.0006275976,0.0007245406,0.00004741958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000237069,"about_ca_system_score_gemma":0.0001160309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009554155,"about_ca_topic_score_gemma":0.000003510139,"domain_scores_codex":[0.9970329,0.0003565399,0.0004568183,0.0001282953,0.001726895,0.0002985061],"domain_scores_gemma":[0.998147,0.0007336324,0.0001569549,0.0002864544,0.0005833189,0.000092644],"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.00005223062,0.0005030752,0.1943866,0.00001933688,0.0009095556,0.0001042784,0.012941,0.6956984,0.006060814,0.04215978,0.003226397,0.04393852],"study_design_scores_gemma":[0.001710567,0.000375633,0.2359043,0.0003868139,0.0000214507,0.00008922353,0.003701012,0.7017536,0.00109472,0.05016729,0.004465953,0.0003294148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2194513,0.0006234893,0.4724208,0.3032591,0.001596,0.0009580031,0.000004565842,0.00002530931,0.001661387],"genre_scores_gemma":[0.9647875,0.0004799463,0.0333924,0.00010206,0.0003179328,0.00001370166,0.00000173679,0.00001049171,0.0008942253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7453362,"threshold_uncertainty_score":0.5745847,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001754425,0.00006124166,0.00006236333,0.00006845957,0.00006812274,0.0001506096,0.0004743481,0.00002061053,0.00007834838],"category_scores_gemma":[0.00004917527,0.00005020265,0.00001970403,0.0003395483,0.000004490877,0.0001738826,0.00006519855,0.00005584141,0.0002844072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001708483,"about_ca_system_score_gemma":0.00002181413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006730498,"about_ca_topic_score_gemma":0.000002017106,"domain_scores_codex":[0.9992877,0.00002694291,0.0001005396,0.0002087495,0.0001906068,0.0001855023],"domain_scores_gemma":[0.9994917,0.00003593248,0.00001438503,0.0002984219,0.00004104279,0.000118515],"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.000002665832,0.00005816883,0.0000102914,0.000001365957,0.000001654767,0.000002866375,0.0003804237,0.03191161,0.00023273,0.8423287,0.005067459,0.1200021],"study_design_scores_gemma":[0.0008490082,0.0009722445,0.002145443,0.00004662786,0.00000137853,0.000008033446,0.00006173433,0.9057472,0.004440978,0.07688729,0.008312789,0.0005272541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004361969,0.000001981799,0.8846697,0.01042411,0.00006267878,0.0001072,8.958118e-8,0.0001960648,0.104102],"genre_scores_gemma":[0.5800691,0.000001612463,0.4028201,0.01288306,0.00001988955,0.00000564708,6.421515e-7,0.000003362398,0.004196567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8738356,"threshold_uncertainty_score":0.3655574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591745,0.0001377941,0.0001900497,0.0000915767,0.00008226962,0.0001194756,0.0005260108,0.0001123709,0.00002749706],"category_scores_gemma":[0.00004888247,0.0001329329,0.00003629206,0.000715758,0.00004373911,0.0003740758,0.0002443788,0.0002933242,0.00003722774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000043356,"about_ca_system_score_gemma":0.00002976759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006763393,"about_ca_topic_score_gemma":0.0001311606,"domain_scores_codex":[0.9982418,0.0003975539,0.0002612179,0.0002510909,0.0001820287,0.0006663038],"domain_scores_gemma":[0.9988132,0.0004050534,0.00007004106,0.0004261709,0.00008394171,0.0002016311],"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.00001704666,0.0001450907,0.08490147,0.000007029295,0.00001262519,0.00001943117,0.0004646814,0.8651366,0.000001388599,0.004162173,0.005886314,0.03924618],"study_design_scores_gemma":[0.0002553613,0.00003116453,0.1314565,0.00001615664,0.000001129706,0.000009636437,0.000005650948,0.8660055,4.958807e-7,0.00006561015,0.002009282,0.000143508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00292684,0.0009986884,0.9930311,0.00008212479,0.0008963253,0.0002130575,9.012442e-7,0.0001244251,0.001726542],"genre_scores_gemma":[0.9923629,0.0001485346,0.006394476,0.0006691801,0.0001978202,0.0000205942,0.00001658208,0.00001294714,0.0001770115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.989436,"threshold_uncertainty_score":0.5420845,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009994061,0.0001075839,0.0001546751,0.0001876654,0.0000893663,0.0003153437,0.0006096053,0.00004495295,0.00003202465],"category_scores_gemma":[0.000218262,0.00009403254,0.00005677161,0.0001173235,0.00004985859,0.0002967664,0.0002179645,0.0004246212,0.000005814538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004023879,"about_ca_system_score_gemma":0.00005124732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003528864,"about_ca_topic_score_gemma":0.000002030353,"domain_scores_codex":[0.9985635,0.0001563125,0.0004060304,0.0001562282,0.0005604637,0.0001575013],"domain_scores_gemma":[0.9987565,0.0001504576,0.000337917,0.00008225547,0.0005559831,0.0001168849],"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.00001266365,0.00009260042,0.0301444,0.00001184424,0.0001581645,0.00003627183,0.00107524,0.1354076,0.0003623756,0.01911705,0.00007481012,0.813507],"study_design_scores_gemma":[0.0002203328,0.0001434049,0.0005346833,0.00007344807,0.000008626439,0.0003392555,0.00002136298,0.9844632,0.0001675248,0.003462306,0.01045726,0.0001085577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004481908,0.0002737679,0.9925011,0.0007647392,0.0003543378,0.00004419719,6.219581e-7,0.00002623696,0.001553038],"genre_scores_gemma":[0.4801169,0.0005704763,0.5184655,0.0001853249,0.0002168648,5.867049e-7,0.00000206235,0.00001192971,0.0004303982],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8490556,"threshold_uncertainty_score":0.3834536,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481301,0.00009179881,0.00008988773,0.0001155979,0.0003116739,0.0006381684,0.003324376,0.00002490261,0.0001760687],"category_scores_gemma":[0.00004175498,0.00005833079,0.00002908403,0.001786183,0.00129415,0.0006255055,0.0002677643,0.0002124337,0.0002012451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000225149,"about_ca_system_score_gemma":0.00008527375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000266144,"about_ca_topic_score_gemma":4.936202e-7,"domain_scores_codex":[0.9981261,0.0001765683,0.0001820047,0.000416629,0.0006471419,0.0004515426],"domain_scores_gemma":[0.998967,0.0001896481,0.00001635153,0.0006576143,0.00005852716,0.0001108789],"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.000001502512,0.0000335409,0.00002790135,0.000001077666,3.404415e-7,0.00000731455,0.0008858589,0.009073423,0.00001853127,0.915225,0.00002453425,0.07470101],"study_design_scores_gemma":[0.0001247893,0.00005636322,0.0006375732,0.00001031411,3.625873e-7,0.00002078784,0.000006642367,0.873897,0.00006825905,0.124786,0.0003041976,0.00008764856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680027,0.00001376498,0.936141,0.004846807,0.0001123545,0.0001469755,1.647174e-7,0.00008987408,0.03184885],"genre_scores_gemma":[0.8048467,0.000007890613,0.1929836,0.002102933,0.00003675589,0.000005110765,1.790241e-7,0.000002319468,0.00001450669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8648236,"threshold_uncertainty_score":0.6177574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001128038,0.0003437829,0.0002667053,0.0003868614,0.001032034,0.0005554148,0.0006605943,0.0001516401,0.00002486808],"category_scores_gemma":[0.00001068555,0.0002867944,0.00007979531,0.001151049,0.0001290047,0.0001842329,0.00002100383,0.0005507061,0.0003246515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001433038,"about_ca_system_score_gemma":0.0001621378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001028294,"about_ca_topic_score_gemma":0.0002486078,"domain_scores_codex":[0.9968582,0.0002091911,0.0006156696,0.0007707629,0.0008569893,0.0006892118],"domain_scores_gemma":[0.9977531,0.0003199386,0.0001729955,0.0008118971,0.0003961341,0.0005458776],"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.00004961841,0.0002706652,0.00001900553,0.00003209281,0.00004807373,0.000002805698,0.00120659,0.98107,0.0001116208,0.005278312,0.001308188,0.010603],"study_design_scores_gemma":[0.0007199499,0.0008166942,0.0001789092,0.000135998,0.00004528743,0.00004893216,0.0005627222,0.5848849,0.0006827015,0.00002336704,0.4114213,0.0004791908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0012444,0.00004785169,0.9893129,0.004346452,0.0001943947,0.001963425,0.00002677393,0.0003610008,0.002502761],"genre_scores_gemma":[0.8767856,0.0000465206,0.1116961,0.001275626,0.0002623078,0.001031355,0.00003753728,0.00008336748,0.008781582],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8776168,"threshold_uncertainty_score":0.9999584,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002381861,0.000580209,0.000581112,0.000228337,0.0008789849,0.0005149517,0.00189891,0.0002610869,0.0001213663],"category_scores_gemma":[0.001191908,0.0005245631,0.0002535307,0.001191539,0.0001817766,0.0003922298,0.0006739539,0.0006520518,0.0001764764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002714751,"about_ca_system_score_gemma":0.00008779723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268366,"about_ca_topic_score_gemma":7.189345e-7,"domain_scores_codex":[0.9947594,0.001374896,0.0006749162,0.000852093,0.0007488757,0.001589846],"domain_scores_gemma":[0.9943663,0.003378731,0.0003642892,0.001145264,0.000201746,0.0005436568],"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.0001692004,0.002355155,0.001598406,0.0001414478,0.0005165609,0.00003181702,0.002486845,0.4552949,0.002142116,0.1756277,0.05642716,0.3032086],"study_design_scores_gemma":[0.002211187,0.0007209655,0.005480874,0.0007357742,0.0001602914,0.0001850366,0.00048695,0.8843901,0.05185901,0.01544295,0.03428577,0.004041072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01320329,0.0008867284,0.9818522,0.0004404587,0.00061876,0.0005422882,0.0002306137,0.001291894,0.0009337459],"genre_scores_gemma":[0.9898599,0.00001917458,0.008726035,0.0007384748,0.0002271854,0.0000333243,0.0002954233,0.00005514934,0.00004526603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766567,"threshold_uncertainty_score":0.9997206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006404269,0.000140856,0.0001619661,0.0002790088,0.0002601445,0.0006074772,0.0002818386,0.00006560025,0.00002213303],"category_scores_gemma":[0.000005108719,0.0001292612,0.00003785894,0.0001966209,0.00008864194,0.0009400735,0.0003222142,0.0002152997,0.000003684743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001035025,"about_ca_system_score_gemma":0.00004643123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001237704,"about_ca_topic_score_gemma":0.000008822469,"domain_scores_codex":[0.9986675,0.00008447968,0.0002126932,0.0004696496,0.0002231074,0.0003425707],"domain_scores_gemma":[0.999411,0.0001054709,0.00003892561,0.0002465937,0.0000284176,0.0001695342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002238505,0.001997342,0.002230833,0.0003414072,0.00006418948,0.0001018014,0.01738728,0.1010806,0.435396,0.0872547,0.0005285077,0.3533936],"study_design_scores_gemma":[0.0008467515,0.0005229365,0.0001468541,0.00002725889,0.000001603572,0.00001811186,0.0001543388,0.9964576,0.0005714523,0.0008988563,0.0001860565,0.0001681412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03720071,0.00001563198,0.9618695,0.0001067393,0.0001754285,0.0004840307,0.000001211425,0.00005800524,0.00008870682],"genre_scores_gemma":[0.5156657,0.00001628799,0.4841189,0.0001152888,0.00004750441,0.000009426366,0.000003503107,0.00001090777,0.00001249054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.895377,"threshold_uncertainty_score":0.5857916,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068446,0.0001693568,0.0002118744,0.0001242952,0.0002127669,0.0004404158,0.0007874536,0.00007565095,0.000005696114],"category_scores_gemma":[0.00003331737,0.0001775384,0.00008651515,0.000773529,0.0000477693,0.000315948,0.0002632925,0.0002652817,0.000008576883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008846001,"about_ca_system_score_gemma":0.00008774924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003923658,"about_ca_topic_score_gemma":0.000003575963,"domain_scores_codex":[0.9980365,0.0001256601,0.0004307605,0.0004713197,0.0002545684,0.0006811789],"domain_scores_gemma":[0.9991409,0.000181176,0.0001200235,0.0003477407,0.0001114417,0.00009875417],"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.000008784551,0.0001474263,0.0009739586,0.00003392355,0.00000530689,0.00001118204,0.0001683371,0.9849128,0.00003175967,0.008067607,0.0009016587,0.004737279],"study_design_scores_gemma":[0.0009270316,0.00009386793,0.001333949,0.0001098051,0.000001166569,0.000001752215,0.00003311459,0.9940535,0.0001372622,0.0006859876,0.002426452,0.0001961037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923591,0.0000192458,0.9724547,0.0001259404,0.00005364388,0.007478134,0.00001604434,0.0002337948,0.0003825811],"genre_scores_gemma":[0.8802769,0.000001153948,0.1173456,0.0001389187,0.0001431681,0.00177121,0.0002711594,0.000019581,0.00003226253],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.861041,"threshold_uncertainty_score":0.7239804,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617027,0.0002004084,0.00023238,0.0002593795,0.0001532676,0.0002850758,0.001143708,0.00008891807,0.000006806449],"category_scores_gemma":[0.0001094033,0.0002034379,0.00007512331,0.001137607,0.0000352286,0.0004051659,0.0004226143,0.0002003515,0.00001087049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006439949,"about_ca_system_score_gemma":0.00006771616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007866191,"about_ca_topic_score_gemma":0.00003955699,"domain_scores_codex":[0.9980858,0.0001304448,0.0002898492,0.000556711,0.0003027103,0.000634497],"domain_scores_gemma":[0.9988629,0.00006762162,0.0001060209,0.0005855592,0.0001297746,0.0002481019],"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.00005789202,0.0007456832,0.03668425,0.00009790109,0.0001039995,0.0003819234,0.02267364,0.0202812,0.0008151094,0.8465513,0.02365459,0.04795251],"study_design_scores_gemma":[0.001467893,0.0003615454,0.0140496,0.0001846331,0.000008803246,0.00004071819,0.0006371241,0.908446,0.003331227,0.06328729,0.007129476,0.001055754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046853,0.00006147606,0.9830145,0.002676431,0.0002296129,0.000307341,0.00002184628,0.000341751,0.002878531],"genre_scores_gemma":[0.8391864,0.000003364142,0.1602095,0.000448054,0.0000268747,0.000009272001,0.0000355004,0.0000139638,0.0000670857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8881648,"threshold_uncertainty_score":0.8295956,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418674,0.0000787512,0.00008015567,0.0000953558,0.0001537161,0.0002405541,0.0001527574,0.00004455107,0.00001487011],"category_scores_gemma":[0.00005707245,0.00005610393,0.00001863652,0.0001952314,0.00004128204,0.002708924,0.00007988635,0.00004148902,0.0001384827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003511434,"about_ca_system_score_gemma":0.00005186162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008980813,"about_ca_topic_score_gemma":0.000001615647,"domain_scores_codex":[0.9991816,0.00005069223,0.0002760012,0.0001246637,0.0002313189,0.0001356721],"domain_scores_gemma":[0.9994019,0.00007357955,0.0001035468,0.0001350685,0.0001846876,0.0001012319],"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.0000183458,0.00006721608,0.004740661,0.00002389,0.00001244648,4.045158e-7,0.002849367,0.005940105,0.00029732,0.03142291,0.009286766,0.9453406],"study_design_scores_gemma":[0.001185607,0.0001225923,0.007145034,0.00002449639,0.000002211328,0.00001142297,0.00005672436,0.97839,0.000336116,0.002646806,0.009887941,0.0001910471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02118596,0.00001222879,0.9746259,0.001693934,0.0001047622,0.000202242,0.000006559826,0.0001670745,0.002001274],"genre_scores_gemma":[0.9723319,0.00003259885,0.0267638,0.0006398954,0.00001000514,0.00001314651,0.00002671305,0.000002609055,0.0001793701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9724499,"threshold_uncertainty_score":0.2319668,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00779353,0.0003892467,0.001091139,0.0001751173,0.0006561689,0.0001950557,0.002391753,0.0001403952,0.00006086998],"category_scores_gemma":[0.0001116212,0.0001778721,0.0003054886,0.0006496154,0.0001342933,0.0004535676,0.0003770494,0.001652072,0.00003439675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007455842,"about_ca_system_score_gemma":0.0002799363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003295584,"about_ca_topic_score_gemma":8.687441e-7,"domain_scores_codex":[0.9962389,0.001079567,0.001554263,0.000255194,0.0004773182,0.0003947121],"domain_scores_gemma":[0.9965184,0.0003825878,0.002003078,0.0007020279,0.0002681331,0.0001257325],"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.000001852062,0.00007768323,0.000001221997,0.03860791,0.0003272372,0.000009956575,0.004176647,0.0001978289,0.000002427786,0.02042472,0.002265172,0.9339073],"study_design_scores_gemma":[0.000360987,0.0007883201,0.000007231984,0.4039489,0.000875462,0.002225803,0.00004017556,0.002483431,0.000001255581,0.003824092,0.5847664,0.0006778643],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000003182641,0.9919217,0.002256694,0.0006916156,0.0001234282,0.001200404,6.675922e-7,0.00003604142,0.003766238],"genre_scores_gemma":[0.00006150197,0.9963951,0.002702013,0.000252035,0.00006054565,0.00001932709,9.809239e-7,0.00003888236,0.0004696701],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9332294,"threshold_uncertainty_score":0.7253414,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115729,0.00007412877,0.00007077679,0.0000431936,0.00008926979,0.00007759473,0.0004556921,0.00002559209,0.0002468066],"category_scores_gemma":[0.000003666152,0.00006428649,0.00003113986,0.00006563845,0.00001848281,0.0003869645,0.0000803832,0.00003786247,0.00008355832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002967279,"about_ca_system_score_gemma":0.00001315185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007649845,"about_ca_topic_score_gemma":0.0000116255,"domain_scores_codex":[0.9992243,0.00002614502,0.0001383615,0.0002405809,0.0001657011,0.0002048979],"domain_scores_gemma":[0.9994939,0.00002045862,0.00002566063,0.000306767,0.00001890164,0.0001343066],"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":[8.848471e-7,0.0004743421,0.00001953653,0.000001378639,0.000006520645,5.382415e-7,0.0001785668,0.01079602,0.001301717,0.003061387,0.001972827,0.9821863],"study_design_scores_gemma":[0.0004430531,0.00008234517,0.0005579265,8.179305e-7,7.655672e-7,0.000001110943,0.00001169066,0.8787498,0.0004933497,0.00008322857,0.1194949,0.00008101289],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001516664,0.000008387781,0.9972062,0.00172829,0.00004284081,0.0002682264,0.00001422341,0.00009538338,0.0004847805],"genre_scores_gemma":[0.01078739,0.00001511805,0.9842894,0.002087932,0.00007498408,0.00001597127,0.00006595231,0.000006580286,0.002656695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9821053,"threshold_uncertainty_score":0.2702359,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629191,0.0002068653,0.0002008695,0.0001950263,0.0005625551,0.001037015,0.002485157,0.00007775513,0.00009419202],"category_scores_gemma":[0.0001279788,0.0001776159,0.00005020297,0.001145706,0.001723052,0.002061237,0.0009078998,0.0004100047,0.0001499478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004716269,"about_ca_system_score_gemma":0.000177529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006123936,"about_ca_topic_score_gemma":0.000007748739,"domain_scores_codex":[0.9972062,0.0001028881,0.0002979301,0.0008183122,0.000901968,0.0006727635],"domain_scores_gemma":[0.9981036,0.0001146892,0.00008154605,0.0009957108,0.0002724638,0.0004320079],"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.000004165557,0.00008164173,0.00004554117,0.00000518556,0.000002775319,0.000005234009,0.0006910068,0.00269417,0.01375427,0.8957092,0.0002973796,0.08670943],"study_design_scores_gemma":[0.0002842344,0.000160112,0.0000995937,0.00001297267,0.000002184715,0.00003145602,0.000005899404,0.9532411,0.01162307,0.03405494,0.0002142486,0.0002701602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01161023,0.000009330842,0.9751519,0.002097497,0.0009580393,0.0002544071,7.551283e-7,0.0004193301,0.009498495],"genre_scores_gemma":[0.7042872,0.000004915119,0.2951487,0.0003974149,0.0000992218,0.00001246865,0.000001636391,0.000009929271,0.0000385415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.950547,"threshold_uncertainty_score":0.9999959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827266,0.000120374,0.0001676952,0.0002017551,0.0003042694,0.00008155328,0.001506101,0.00002912575,0.00003038116],"category_scores_gemma":[0.00003344947,0.00009631783,0.00005180355,0.0009972791,0.001375493,0.0003305872,0.0006183593,0.0001356453,0.00007775616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004683021,"about_ca_system_score_gemma":0.000126901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001256333,"about_ca_topic_score_gemma":3.888028e-8,"domain_scores_codex":[0.99793,0.00009303863,0.0002522299,0.0004818307,0.0008384661,0.0004043714],"domain_scores_gemma":[0.9987146,0.000165736,0.00005931695,0.0006478276,0.0001856798,0.0002268607],"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.000003644845,0.0001481302,0.00004103337,0.000007289464,0.000002893008,0.00001304952,0.001294778,0.01100982,0.000206,0.9836702,0.00002653786,0.003576645],"study_design_scores_gemma":[0.0002267483,0.0005055055,0.000208142,0.00001980897,0.000001053321,0.00003824082,0.000004222444,0.9801518,0.01137175,0.007135409,0.0002020078,0.0001352763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09802427,0.000009383612,0.8933218,0.0002935956,0.0002199932,0.000233534,4.861388e-7,0.0002909403,0.007605962],"genre_scores_gemma":[0.7541283,0.00001526328,0.2455995,0.0002077318,0.00002451021,0.000006919143,1.036791e-7,0.000004564088,0.00001305752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9765348,"threshold_uncertainty_score":0.5068062,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001867603,0.0001162555,0.0001457769,0.0002242864,0.0002288482,0.0001502487,0.001529601,0.00004638466,0.00005669726],"category_scores_gemma":[0.00006344343,0.00009899014,0.00005019026,0.00107108,0.002948696,0.0005235983,0.000530092,0.0001309966,0.00003666134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003156983,"about_ca_system_score_gemma":0.0000672348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003911548,"about_ca_topic_score_gemma":5.743824e-7,"domain_scores_codex":[0.9979697,0.00006497555,0.0003187314,0.0004548858,0.0007164613,0.0004752235],"domain_scores_gemma":[0.9986632,0.000208043,0.00008581177,0.0004957786,0.0002747492,0.0002723527],"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.000005120755,0.00005627928,0.0003392832,0.00000633767,0.000002354878,0.000002005952,0.0001902355,0.0001525585,0.001264511,0.9679481,0.0001964916,0.0298367],"study_design_scores_gemma":[0.0004488461,0.0002055421,0.0007316648,0.00002231862,0.000002142585,0.0000183892,0.00001029701,0.8393288,0.0284041,0.1296229,0.0009966564,0.0002083234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0168092,0.0000149641,0.9794729,0.0004398478,0.0005698132,0.0001490553,0.000001632267,0.0001123258,0.002430257],"genre_scores_gemma":[0.6762913,0.000004046058,0.3234783,0.0001935502,0.00001536568,0.000001049191,9.999135e-7,0.000003187419,0.00001215404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8391763,"threshold_uncertainty_score":0.9997647,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059992,0.000151727,0.0001673873,0.00008273955,0.0003644186,0.0002398447,0.0008917155,0.00006617344,0.00001446341],"category_scores_gemma":[0.0000490021,0.0001531046,0.00004190999,0.0003528328,0.00005114435,0.001413827,0.0005065817,0.0002414075,0.0001421429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007262125,"about_ca_system_score_gemma":0.00003919824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004799557,"about_ca_topic_score_gemma":0.000002203424,"domain_scores_codex":[0.9984682,0.000187823,0.0002847956,0.0002495317,0.0002949962,0.0005146741],"domain_scores_gemma":[0.9987724,0.0001194614,0.0001351032,0.0006704113,0.00009720922,0.000205454],"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.000006606177,0.0009710619,0.005912788,0.00005634408,0.000106942,0.000004498025,0.01925843,0.02052229,0.003529559,0.04641407,0.008331243,0.8948862],"study_design_scores_gemma":[0.0003845353,0.00005567818,0.0002538968,0.00003024848,0.000004482351,0.00001774426,0.0000999264,0.992591,0.001846907,0.0003514478,0.00408585,0.0002782717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001573603,0.0004285835,0.9922288,0.0009726204,0.0002499804,0.0002157588,0.000001314583,0.0003796895,0.003949653],"genre_scores_gemma":[0.6475386,0.00003217605,0.3518794,0.0003086026,0.00009214487,0.0000119044,0.00001749644,0.00001525111,0.000104417],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9720687,"threshold_uncertainty_score":0.6243426,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009942668,0.0003914052,0.0003496221,0.0002001723,0.001257039,0.0007663502,0.0006904382,0.000185667,0.00002270246],"category_scores_gemma":[0.00001605363,0.0003294039,0.0001785277,0.0004413368,0.000189016,0.00026146,0.00001705631,0.0005415701,0.00007314231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379829,"about_ca_system_score_gemma":0.0001451658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009389623,"about_ca_topic_score_gemma":0.0001649557,"domain_scores_codex":[0.996927,0.000241257,0.0007151767,0.0007278298,0.0005831645,0.0008055462],"domain_scores_gemma":[0.9979375,0.0005849614,0.0002267194,0.0007168511,0.0002591727,0.0002747797],"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.00001038156,0.0002466236,0.00001854519,0.00004176693,0.00007594621,0.000002212412,0.0007938003,0.9468598,0.0000762245,0.006340145,0.0005665994,0.04496794],"study_design_scores_gemma":[0.0009568647,0.0003146413,0.00006465962,0.0001440683,0.0000665907,0.00002807079,0.0001679382,0.9620799,0.0001346667,0.00008195361,0.03557093,0.0003897094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003394617,0.0004122696,0.9933977,0.002146686,0.0006557608,0.001459198,0.00004239502,0.0004791051,0.001067416],"genre_scores_gemma":[0.9628459,0.0003832794,0.02948553,0.0002507862,0.0001115574,0.0005311331,0.00001492555,0.00006299873,0.006313903],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9639122,"threshold_uncertainty_score":0.9999158,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549318,0.0001164464,0.0001031784,0.0001354508,0.0002417188,0.0001494631,0.0008152099,0.00005264259,0.0001190057],"category_scores_gemma":[0.00002734742,0.0001092833,0.00007166502,0.0003694365,0.00002988458,0.0003334762,0.00001425688,0.0001970868,0.000291385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002473665,"about_ca_system_score_gemma":0.00002358037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000139678,"about_ca_topic_score_gemma":0.000006308415,"domain_scores_codex":[0.9989702,0.00007537731,0.0001544852,0.000302866,0.0002422401,0.0002548318],"domain_scores_gemma":[0.99888,0.000111178,0.00003002796,0.0007868238,0.0000560363,0.0001358887],"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.000002657425,0.0001112135,0.000005001024,0.00000635332,0.00001643874,0.000001890743,0.0004421088,0.02525038,0.0002647153,0.003835891,0.00005001499,0.9700133],"study_design_scores_gemma":[0.0006922196,0.0002638189,0.0003530522,0.00002725029,0.000006367176,0.00001808418,0.00002816649,0.9600946,0.003305144,0.006172979,0.02872701,0.0003112889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002968395,0.00001140847,0.9944302,0.002013207,0.0003122398,0.0001120098,0.000001615255,0.0003238785,0.002498571],"genre_scores_gemma":[0.1646015,0.00004948436,0.8324115,0.00102857,0.00005657956,0.00004133914,0.000001306703,0.00002051014,0.001789205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9697021,"threshold_uncertainty_score":0.4456443,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004359291,0.0001297796,0.0002067569,0.0001983512,0.0001553873,0.0001405303,0.0007150595,0.00004269465,0.000009520794],"category_scores_gemma":[0.0000530751,0.0001077708,0.00004496001,0.001294955,0.00004005414,0.0002600921,0.000185505,0.0001256396,0.000006740692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003418219,"about_ca_system_score_gemma":0.00004810598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004401472,"about_ca_topic_score_gemma":0.00000314029,"domain_scores_codex":[0.998621,0.00008062833,0.0002877124,0.000305811,0.000348129,0.0003567202],"domain_scores_gemma":[0.9988963,0.0002116582,0.0002014726,0.0003690815,0.0002201137,0.0001013656],"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.000003362621,0.0000981594,0.02372041,0.00007525365,0.00002309747,0.000006919071,0.0004117309,0.8573546,0.0002961677,0.005674541,0.00005605021,0.1122797],"study_design_scores_gemma":[0.0003662229,0.0002935193,0.004105759,0.00009492207,0.000004471084,0.00001655145,0.00006716981,0.9916887,0.002883217,0.0001227266,0.0001719909,0.0001847629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360677,0.00004023705,0.8633026,0.00005060884,0.00006506829,0.0001427786,0.00001007705,0.0001505325,0.0001703361],"genre_scores_gemma":[0.9597098,0.000005101317,0.04015734,0.0000506321,0.00002587805,0.000006150502,0.00003171774,0.000007462374,0.000005916609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8236421,"threshold_uncertainty_score":0.4394765,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004252938,0.0000241386,0.00002445228,0.00002658209,0.00004423965,0.00007132494,0.000132205,0.000008539148,0.00002006762],"category_scores_gemma":[0.00001508204,0.00001423859,0.000005815667,0.0001111283,0.00002769287,0.0002229273,0.00003892056,0.00002865748,0.000003582168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002659771,"about_ca_system_score_gemma":0.0000147578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004971077,"about_ca_topic_score_gemma":0.000005723989,"domain_scores_codex":[0.9996786,0.00001647176,0.000066263,0.0000673306,0.0001044767,0.00006691516],"domain_scores_gemma":[0.9996871,0.0001366097,0.00001947316,0.0001082336,0.00003239982,0.00001617155],"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":[8.294226e-7,0.000005032226,0.00005289101,0.000002371626,8.409468e-7,2.221014e-7,0.0003339919,0.000991212,0.0007043013,0.9919211,0.0001110237,0.005876168],"study_design_scores_gemma":[0.0002435341,0.0002274729,0.005729992,0.00003491736,0.0000013453,0.000004182966,0.001072547,0.8848283,0.0205139,0.08653931,0.0006610198,0.0001434525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01271768,0.00001064521,0.9064346,0.0008384979,0.0000185237,0.00005063569,5.354433e-8,0.00002221441,0.07990716],"genre_scores_gemma":[0.9869334,0.0000103547,0.01240633,0.0002312979,0.000003455575,6.546572e-7,9.725658e-8,7.582077e-7,0.0004136394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9742157,"threshold_uncertainty_score":0.0687788,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004159677,0.0002301541,0.0001794315,0.000100268,0.0009134074,0.0006755745,0.002557836,0.0001035571,0.00002092691],"category_scores_gemma":[0.001003869,0.000128125,0.0001110404,0.0006783449,0.0001628494,0.00009406786,0.0003017921,0.0008692647,0.00003489634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000536243,"about_ca_system_score_gemma":0.00008089968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000122389,"about_ca_topic_score_gemma":0.00003338343,"domain_scores_codex":[0.9969621,0.001109352,0.0003613434,0.0004675273,0.0004910581,0.0006086201],"domain_scores_gemma":[0.9936168,0.004977156,0.0001486355,0.001097556,0.00007914006,0.00008068337],"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.0000411558,0.0002167396,0.00008601043,0.00001599602,0.00004111373,0.00002453884,0.002152017,0.05937321,0.0004858601,0.6204184,0.001554251,0.3155907],"study_design_scores_gemma":[0.001136297,0.0004409212,0.006227405,0.0002987187,0.00003846196,0.0001645155,0.001076589,0.509304,0.01156768,0.3789071,0.0893532,0.001485139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03099917,0.000312587,0.9498494,0.005410093,0.0008608391,0.001436271,0.00002093432,0.0006379668,0.01047269],"genre_scores_gemma":[0.9937104,0.00001703524,0.005490917,0.0005252968,0.00009079885,0.0001078325,0.000006198576,0.00001598098,0.00003555527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9627112,"threshold_uncertainty_score":0.7025284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001259775,0.0005853934,0.0005695695,0.001411623,0.0002820418,0.0004835854,0.002961729,0.0005729771,0.0001061571],"category_scores_gemma":[0.0001631953,0.0005519023,0.0001233162,0.0009124369,0.0008812892,0.0007837472,0.001957457,0.002113605,0.0001187267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003041387,"about_ca_system_score_gemma":0.001176595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004490022,"about_ca_topic_score_gemma":0.0002179135,"domain_scores_codex":[0.9952202,0.00006096748,0.0007181956,0.00173983,0.001315014,0.0009457296],"domain_scores_gemma":[0.9971868,0.0005216413,0.0002572014,0.001396758,0.0003374371,0.0003001053],"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.00001591461,0.000130841,0.0001984888,0.0000406207,0.00001244157,0.0004454556,0.00160214,0.491669,0.0007069412,0.03554296,0.00002491674,0.4696102],"study_design_scores_gemma":[0.0006463666,0.0002299573,0.0002514995,0.0002745427,0.000002862052,0.0001498081,1.511164e-7,0.9730163,0.0009941882,0.01830184,0.005302721,0.0008298029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002648079,0.0001794644,0.9932141,0.0009261692,0.001804723,0.0004888502,0.00000751094,0.0001667565,0.002947652],"genre_scores_gemma":[0.04128716,0.0000746267,0.9562188,0.001592229,0.0003297707,0.00001633929,0.00001759061,0.00004611922,0.0004173744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4813472,"threshold_uncertainty_score":0.9996933,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211445,0.0000790566,0.00006383307,0.00007806507,0.0006621665,0.0001573746,0.0006134709,0.00004164457,0.0001418159],"category_scores_gemma":[0.000007089857,0.00004907797,0.00002888203,0.0003283346,0.00006393043,0.0002014918,0.00006275765,0.0001386563,0.0001110577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008635905,"about_ca_system_score_gemma":0.0006001842,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.05597939,"about_ca_topic_score_gemma":0.08172103,"domain_scores_codex":[0.9990873,0.00005031634,0.0001171346,0.0001923948,0.0002238125,0.0003290588],"domain_scores_gemma":[0.9993793,0.00004161422,0.00002109937,0.0002939804,0.0000713423,0.0001925971],"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.000001465838,0.00001787318,0.001093702,0.000002928433,0.00002199814,0.00003475547,0.006158547,0.6489363,0.00001391439,0.3079017,0.03282898,0.002987806],"study_design_scores_gemma":[0.000307821,0.00003920711,0.003342143,0.000009694036,0.000001504045,0.00006916778,0.0001723414,0.9004154,0.00003818339,0.004739662,0.09064132,0.0002235146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001211182,0.00004962818,0.7352248,0.02943897,0.0001455015,0.0003536854,0.000001371043,0.000191778,0.233383],"genre_scores_gemma":[0.940359,0.00001292322,0.03273845,0.007032581,0.00003392847,0.00001744536,0.000004065752,0.000007952165,0.01979365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9391478,"threshold_uncertainty_score":0.9503069,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001430493,0.0001490097,0.0001866673,0.0008326683,0.0002522944,0.0003834532,0.002141365,0.00004219154,0.00002418599],"category_scores_gemma":[0.0001679681,0.0001282851,0.00004810982,0.006179221,0.001533615,0.0007845749,0.0009841003,0.0002872534,0.00005779909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001302586,"about_ca_system_score_gemma":0.0002126587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145669,"about_ca_topic_score_gemma":0.000006099002,"domain_scores_codex":[0.9975571,0.00008785476,0.0003064604,0.0006554699,0.00072674,0.0006663959],"domain_scores_gemma":[0.9987944,0.0001800256,0.00005323183,0.0005092744,0.0002024863,0.0002605336],"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.000001763143,0.0001342516,0.0001426405,0.000002404693,0.000001026986,0.00001782862,0.0003802846,0.0074677,0.00006339829,0.9810023,0.000001500529,0.01078486],"study_design_scores_gemma":[0.0008000761,0.0002354839,0.005271269,0.00006688098,0.00000103959,0.00003071594,0.00002295338,0.6282299,0.001036537,0.3639921,0.00004008141,0.0002729342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02469453,0.00001255412,0.9681175,0.001873831,0.000257678,0.0001756468,0.000001333619,0.000169112,0.00469776],"genre_scores_gemma":[0.7265413,0.000008162863,0.272785,0.0006307288,0.00002397706,0.000002672924,0.000001032949,0.000004225313,0.000002909704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7018468,"threshold_uncertainty_score":0.5650669,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005227184,0.0001007111,0.0001031256,0.00005725978,0.0002426621,0.0001779038,0.0003891586,0.0000571518,0.00004715816],"category_scores_gemma":[0.0000109199,0.00008596221,0.00004738282,0.0003291511,0.00002586819,0.0004173799,0.0001109506,0.00004595061,0.00007358456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005539611,"about_ca_system_score_gemma":0.00004627232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002065331,"about_ca_topic_score_gemma":0.000009496817,"domain_scores_codex":[0.9989526,0.00002843696,0.0002128829,0.0002579032,0.0002046059,0.0003435422],"domain_scores_gemma":[0.9993617,0.0001060504,0.00006194087,0.0002753815,0.0001305585,0.00006437979],"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.000008077573,0.00006582261,0.00002431617,0.00001599383,0.000007159357,9.480617e-7,0.00009657642,0.7296503,0.0001111,0.1880013,0.06329425,0.01872418],"study_design_scores_gemma":[0.0003911562,0.00007414255,0.00003550821,0.000005036719,0.00000157479,0.000002746494,0.000002648298,0.9728427,0.0009606747,0.01889244,0.006668131,0.0001232588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001203211,0.0000119481,0.9866937,0.0007387809,0.0001632932,0.0006898509,9.991276e-7,0.0002003035,0.01148909],"genre_scores_gemma":[0.002915505,0.00000544971,0.9867674,0.0003274587,0.0001647626,0.0001088299,0.0000233038,0.000009668366,0.009677691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2431924,"threshold_uncertainty_score":0.3505437,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204078,0.0001681337,0.0001581742,0.000256046,0.0004953691,0.0007941385,0.002127306,0.00004880665,0.00002530623],"category_scores_gemma":[0.00004907724,0.0001396052,0.00005744112,0.001634782,0.001762733,0.002125158,0.0007582953,0.0001974022,0.0001954088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007014372,"about_ca_system_score_gemma":0.0002327116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003171603,"about_ca_topic_score_gemma":5.78501e-7,"domain_scores_codex":[0.9975075,0.00008220413,0.0002576732,0.0006907246,0.0008777613,0.0005842068],"domain_scores_gemma":[0.9985557,0.00005171568,0.0000567647,0.0007229359,0.0002596123,0.0003533313],"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.000003357403,0.00006172967,0.00001591863,0.000002733392,0.000001854835,0.000005531776,0.000634897,0.04910685,0.0002139394,0.9449003,0.00001707821,0.005035791],"study_design_scores_gemma":[0.0005564593,0.0003080375,0.00009912119,0.00002551363,0.000002080008,0.00003239748,0.00001115361,0.5301095,0.004377584,0.4640761,0.0001458346,0.0002561374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004293629,0.000009379895,0.9864643,0.003752229,0.0004076023,0.0002166605,8.689895e-7,0.0003523872,0.004502983],"genre_scores_gemma":[0.5613626,0.000005521653,0.4381086,0.0004492291,0.00004959959,0.000008042871,0.000001151448,0.000005086997,0.00001023508],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5570689,"threshold_uncertainty_score":0.7657896,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002034677,0.0001669349,0.0002070069,0.0002662605,0.00004264965,0.0001575423,0.0008802459,0.0001352988,0.0002475568],"category_scores_gemma":[0.000007639888,0.0001493558,0.00005241893,0.0001487149,0.00001327444,0.001264968,0.0002571456,0.0003334858,0.0001278745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009793798,"about_ca_system_score_gemma":0.0001244096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005149384,"about_ca_topic_score_gemma":0.0000411586,"domain_scores_codex":[0.9987159,0.00003693458,0.0002543576,0.0004043964,0.0003316235,0.0002567611],"domain_scores_gemma":[0.9993269,0.00006186052,0.00007063691,0.0004163585,0.00004901144,0.00007520126],"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.000001142167,0.00003318144,0.000002428161,0.00006406405,0.000004288369,0.00002739647,0.0003979617,0.05481681,4.730087e-7,0.5698556,0.04192105,0.3328756],"study_design_scores_gemma":[0.0001093684,0.00001267702,2.575764e-7,0.00007303773,4.987847e-7,0.000002286901,0.000001461722,0.7426635,4.880086e-7,0.1061244,0.1508503,0.0001617548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[1.642927e-8,0.0006735841,0.4788845,0.0002176775,0.00007607599,0.0001016612,3.635751e-7,0.00008204421,0.5199641],"genre_scores_gemma":[0.00003801826,0.00368132,0.1021987,0.0003973696,0.00003711551,0.00001155724,0.000004593664,0.0000143201,0.893617],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6878467,"threshold_uncertainty_score":0.6090552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}