{"meta":{"query_hash":"95578f84ce5a","filters":{"topic":"Optimization and Search Problems"},"cohort_total":892,"direct_labels_cover":0,"predictions_cover":892,"exported":892,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/95578f84ce5a","api":"https://metacan.xera.ac/api/v1/cohort?topic=Optimization+and+Search+Problems"},"results":[{"id":"W109938289","doi":"10.1007/978-3-642-22300-6_4","title":"Multi-target Ray Searching Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Multiplicative function; Mathematical optimization; Metric (unit); Disjoint sets; Heuristic; Computer science; Context (archaeology); Measure (data warehouse); Asymptotically optimal algorithm; Mathematics; Algorithm; Search problem; Discrete mathematics; Data mining","score_opus":0.04204162678421279,"score_gpt":0.26768997297691954,"score_spread":0.22564834619270674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109938289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035042049,0.00036527976,0.9889436,0.00059116585,0.0011240701,0.0006988199,0.0000041318676,0.0003042966,0.007965151],"genre_scores_gemma":[0.01328728,0.00011148005,0.9829533,0.0011570489,0.00020275272,0.000018512936,0.0000071669638,0.00005099806,0.0022114527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531627,0.00008222724,0.0005954021,0.0017817001,0.0012018232,0.001022562],"domain_scores_gemma":[0.99718183,0.00025873756,0.00026230348,0.0015659829,0.00037446097,0.0003566669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017176288,0.0005618843,0.00051815744,0.0011346737,0.00039929542,0.0008146253,0.004726614,0.00032854982,0.00012086646],"category_scores_gemma":[0.00011036081,0.00049954484,0.00014915853,0.0007217818,0.0007241214,0.0010214978,0.0021583233,0.0013142119,0.00019945671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053117974,0.000119178476,0.00010873566,0.00012496318,0.000024893345,0.000113634465,0.005210282,0.3999535,0.00029346495,0.025311753,0.00005612538,0.56867814],"study_design_scores_gemma":[0.0003393541,0.00014062694,0.00005487033,0.00031626876,0.0000025573918,0.000028513241,8.534372e-8,0.899881,0.00038817085,0.09442073,0.0037791396,0.00064868014],"about_ca_topic_score_codex":0.000042005933,"about_ca_topic_score_gemma":0.000046237466,"teacher_disagreement_score":0.56802946,"about_ca_system_score_codex":0.00022946428,"about_ca_system_score_gemma":0.0007667077,"threshold_uncertainty_score":0.9997456},"labels":[],"label_agreement":null},{"id":"W110884402","doi":"10.1007/978-3-642-34645-3_2","title":"Modeling a Teacher in a Tutorial-like System Using Learning Automata","year":2012,"lang":"en","type":"book-chapter","venue":"Transactions on computational science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Novelty; Process (computing); Benchmark (surveying); Adaptation (eye); Automaton; Domain (mathematical analysis); Artificial intelligence; Field (mathematics); Learning automata; Salient; Convergence (economics); Human–computer interaction; Programming language","score_opus":0.049692438302045436,"score_gpt":0.2845329200457956,"score_spread":0.23484048174375016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110884402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056899968,0.000052605974,0.97363585,0.00009236818,0.0007952737,0.00032098396,0.0000046789855,0.00033225756,0.024709107],"genre_scores_gemma":[0.7577261,0.00002834422,0.2233449,0.00009700493,0.00017696354,0.000027825958,0.0000116613455,0.00005769372,0.018529547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969023,0.00006754097,0.00048666046,0.00072556717,0.0013420569,0.0004758782],"domain_scores_gemma":[0.998879,0.00010301094,0.00013832483,0.00035573417,0.0003004393,0.00022347654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011948965,0.00028613547,0.00027831958,0.0009727224,0.00068243773,0.00036418345,0.0009402495,0.00016126606,0.00007926407],"category_scores_gemma":[0.000011246511,0.00029971005,0.00010206019,0.0005543535,0.0001756265,0.0011065206,0.000043094173,0.0007384367,0.00013116864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039913834,0.00003710159,9.991636e-7,0.000020117208,0.000007111657,0.0000040129435,0.0003577913,0.89478385,0.000010025787,0.0973518,0.0000021651442,0.007421024],"study_design_scores_gemma":[0.00027770904,0.000037997255,0.000005010815,0.00024137087,0.000008653509,0.000034415694,0.000022563663,0.9964011,0.0000021309797,0.002066623,0.0005960955,0.00030638752],"about_ca_topic_score_codex":0.00007056739,"about_ca_topic_score_gemma":0.000008035014,"teacher_disagreement_score":0.75766915,"about_ca_system_score_codex":0.000843552,"about_ca_system_score_gemma":0.0008604572,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W112014004","doi":"","title":"Optimal scheduling of contract algorithms for anytime problems","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Acceleration; Computation; Algorithm; Scheduling (production processes); Mathematical optimization; Schedule; Matching (statistics); Approximation algorithm; Mathematics","score_opus":0.14399056113021236,"score_gpt":0.3591819608483168,"score_spread":0.21519139971810441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112014004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015946723,0.000024505103,0.9902942,0.0015654975,0.00017280075,0.0005000458,0.00003135376,0.000086050626,0.0057308753],"genre_scores_gemma":[0.79548055,0.000008099284,0.20402831,0.00011902688,0.0000936854,0.00006213038,0.000024750583,0.00000815506,0.00017531244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979568,0.000054132095,0.00058431184,0.00041164027,0.0006944349,0.00029867783],"domain_scores_gemma":[0.9975334,0.00032592882,0.00021568256,0.00019620781,0.0016544092,0.00007436932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602522,0.00015547224,0.00020115369,0.00022013059,0.00015299978,0.00020322044,0.00064494973,0.00009376388,0.00011736468],"category_scores_gemma":[0.00027262044,0.0001519511,0.00009052898,0.00041667797,0.00011914448,0.0004022568,0.000059998507,0.00015026006,0.000053397474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015859705,0.00016251276,0.000008198255,0.000010217778,0.0000063656876,4.3814833e-7,0.000076028795,0.24576539,0.0035361764,0.73075575,0.000043216307,0.019619843],"study_design_scores_gemma":[0.000061275394,0.00017051355,0.00006959971,0.000034048207,0.000001960556,0.0000015356021,0.000017987084,0.83802557,0.027222631,0.13398497,0.0002610901,0.00014879846],"about_ca_topic_score_codex":0.000046344547,"about_ca_topic_score_gemma":0.000020143569,"teacher_disagreement_score":0.7938859,"about_ca_system_score_codex":0.00005762712,"about_ca_system_score_gemma":0.00037324242,"threshold_uncertainty_score":0.6196386},"labels":[],"label_agreement":null},{"id":"W114064698","doi":"10.1007/978-3-642-25591-5_57","title":"Input-Thrifty Extrema Testing","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Maxima and minima; Mathematics; Mathematical analysis","score_opus":0.05714484744274282,"score_gpt":0.26104418046016725,"score_spread":0.20389933301742444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114064698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000075563275,0.00023258915,0.9506551,0.00043912322,0.0011392658,0.00036535852,0.0000020506586,0.00031150467,0.04684742],"genre_scores_gemma":[0.02798958,0.000053725864,0.9683372,0.0019550961,0.00036030667,0.000011488322,0.0000036346917,0.00004866652,0.0012403331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959433,0.000045705798,0.0005644673,0.0016072978,0.0010203589,0.0008188599],"domain_scores_gemma":[0.9968856,0.00048361754,0.0002920878,0.0015724268,0.00048432278,0.00028192895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011099133,0.0005132744,0.00046855203,0.00090550166,0.0003312368,0.00064587436,0.004039736,0.00032032648,0.00009112689],"category_scores_gemma":[0.0002598106,0.00046732952,0.00010524675,0.0010045563,0.00067152106,0.0008572231,0.0019720893,0.00091572787,0.00016161015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021552814,0.000031128504,0.00009239942,0.000032055425,0.00000679649,0.00008831912,0.0008616605,0.0313262,0.000055646717,0.049977783,0.00003936475,0.9174865],"study_design_scores_gemma":[0.00023006678,0.00019093964,0.000099144374,0.0003818467,0.000003750716,0.00008307408,5.5998434e-8,0.7593708,0.00040966985,0.2357968,0.00271348,0.00072036166],"about_ca_topic_score_codex":0.000034642966,"about_ca_topic_score_gemma":0.000038713737,"teacher_disagreement_score":0.9167661,"about_ca_system_score_codex":0.0001796717,"about_ca_system_score_gemma":0.0007679389,"threshold_uncertainty_score":0.99977785},"labels":[],"label_agreement":null},{"id":"W116052530","doi":"10.1007/978-3-642-31585-5_45","title":"Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Normalization property; Node (physics); Theoretical computer science; Computer network","score_opus":0.02377643852343522,"score_gpt":0.24624049077504437,"score_spread":0.22246405225160915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116052530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003654689,0.00047633526,0.9959666,0.0003698984,0.0012283466,0.00059285195,0.00000233692,0.00019371742,0.0011333802],"genre_scores_gemma":[0.5987742,0.00015298578,0.39741507,0.001993503,0.00065657496,0.000048456983,0.000050118906,0.00007758371,0.0008315272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958089,0.00006228661,0.0006083825,0.0013567713,0.001271291,0.00089235994],"domain_scores_gemma":[0.99761015,0.00019362595,0.00041051343,0.0012033713,0.00024465832,0.00033768412],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091712933,0.0005033101,0.00044655162,0.00034062445,0.0003328396,0.00061705726,0.0014250416,0.00026294772,0.000050189123],"category_scores_gemma":[0.000029387598,0.00042254775,0.00007517821,0.0006162981,0.00061876327,0.0010790679,0.00058697455,0.00060555496,0.000035939174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004619184,0.000034987283,0.0000144502255,0.000018481984,0.000006680855,0.0001520365,0.0004848863,0.5950593,0.0000045100833,0.0005718517,0.00030697728,0.40334123],"study_design_scores_gemma":[0.00020774125,0.0003422548,0.000016766611,0.00026356304,0.000009903136,0.00024585423,2.5554792e-7,0.98658466,0.000079391655,0.0071329167,0.004488068,0.0006286129],"about_ca_topic_score_codex":0.0000059341455,"about_ca_topic_score_gemma":0.00004142934,"teacher_disagreement_score":0.59873766,"about_ca_system_score_codex":0.00027677306,"about_ca_system_score_gemma":0.000506538,"threshold_uncertainty_score":0.9998226},"labels":[],"label_agreement":null},{"id":"W1165108992","doi":"10.53846/goediss-5126","title":"Randomized Approximation and Online Algorithms for Assignment Problems","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Randomized rounding; Generalized assignment problem; Competitive analysis; Online algorithm; Randomized algorithm; Mathematics; Approximation algorithm; Assignment problem; Disjoint sets; Rounding; Mathematical optimization; Integer programming; Scheduling (production processes); Separable space; Generalization; Linear bottleneck assignment problem; Weapon target assignment problem; Algorithm; Computer science; Upper and lower bounds; Combinatorics","score_opus":0.0565866783259216,"score_gpt":0.3363461507125681,"score_spread":0.27975947238664656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1165108992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007742881,0.0003762963,0.9885042,0.00058473955,0.00043837,0.003317665,0.0000146839975,0.00018421326,0.0065024323],"genre_scores_gemma":[0.001170994,0.00048023436,0.9317666,0.00024333285,0.00013932114,0.0015442966,0.00457608,0.000047703994,0.060031395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00012563959,0.000455914,0.00046558146,0.00043355298,0.00022715086],"domain_scores_gemma":[0.9986933,0.00016703976,0.00024592687,0.00026743006,0.0004961104,0.0001302056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012875701,0.00022459814,0.0005005055,0.00018184382,0.00009226622,0.00030736957,0.00035213982,0.00018742248,0.000014642038],"category_scores_gemma":[0.00017036161,0.00017341548,0.00009544375,0.00016270204,0.000027230133,0.00034946325,0.000051321254,0.0001329879,0.0000061737232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00791652,0.0011792694,0.0000032594849,0.0029733733,0.00057966955,0.0000029323742,0.016179413,0.00674005,0.0002530488,0.32609937,0.02241447,0.61565864],"study_design_scores_gemma":[0.055394962,0.00008323635,0.0000018383045,0.00008106785,0.00002455006,0.0000014382679,0.00015713497,0.9088346,0.000100022524,0.03269296,0.0023749734,0.00025325164],"about_ca_topic_score_codex":0.000021080356,"about_ca_topic_score_gemma":0.000038457438,"teacher_disagreement_score":0.9020945,"about_ca_system_score_codex":0.00005056262,"about_ca_system_score_gemma":0.00019467314,"threshold_uncertainty_score":0.7071678},"labels":[],"label_agreement":null},{"id":"W117901136","doi":"10.1007/978-3-642-39212-2_49","title":"Learning a Ring Cheaply and Fast","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Ring (chemistry); Node (physics); Task (project management); Upper and lower bounds; Matching (statistics); Constant (computer programming); Computation; Class (philosophy); Time complexity; Construct (python library); Theoretical computer science; Algorithm; Discrete mathematics; Combinatorics; Mathematics; Computer network; Artificial intelligence","score_opus":0.01626947040187827,"score_gpt":0.2388798637032399,"score_spread":0.22261039330136165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117901136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062335734,0.00023865273,0.98475164,0.0008526953,0.00041963442,0.00029505393,4.5730766e-7,0.00017187707,0.013207627],"genre_scores_gemma":[0.09808491,0.00023552265,0.89509726,0.0015295724,0.0003132124,0.000016624203,0.000003336463,0.000047114107,0.0046724584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732375,0.00003501597,0.0003218419,0.001111783,0.0006591509,0.0005484318],"domain_scores_gemma":[0.998589,0.00023600622,0.00015279242,0.00060778216,0.00019979315,0.0002146283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006505792,0.0003372356,0.00032909485,0.0006033567,0.00031252403,0.0010640969,0.0015672744,0.00019846771,0.000056159926],"category_scores_gemma":[0.00008312414,0.0003065114,0.00005210131,0.0003911823,0.00046686237,0.0007700495,0.0014882021,0.0009184318,0.00009047578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.832667e-7,0.0000081834305,0.00005565354,0.000031008887,0.000004994181,0.00001982413,0.0013034166,0.07120517,0.000073691976,0.022707641,0.000011882867,0.9045777],"study_design_scores_gemma":[0.00017622806,0.00012936456,0.00009008749,0.00020910508,0.0000017534202,0.000043967535,2.450718e-7,0.9650005,0.00012293998,0.03167504,0.0021610295,0.0003897485],"about_ca_topic_score_codex":0.00002036333,"about_ca_topic_score_gemma":0.000012721048,"teacher_disagreement_score":0.9041879,"about_ca_system_score_codex":0.00010927359,"about_ca_system_score_gemma":0.00023234717,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W11899514","doi":"10.1007/978-1-4614-7079-3_2","title":"Decentralized Optimal Resource Allocation","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Resource allocation; Computer science; Computer network; Resource management (computing); Exploit; Wireless network; Radio resource management; Resource (disambiguation); Distributed computing; Wireless; Telecommunications; Computer security","score_opus":0.02138936483571038,"score_gpt":0.24800857359841974,"score_spread":0.22661920876270936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11899514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049379723,0.00014250855,0.8798369,0.0011234669,0.00071821135,0.000601571,0.0000012328262,0.00029268372,0.11723403],"genre_scores_gemma":[0.004479908,0.00037415468,0.9354865,0.0018196733,0.00030389376,0.00004804576,0.000011707435,0.0000752137,0.057400897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955686,0.000047429465,0.00066974247,0.0015217557,0.0013278885,0.0008646072],"domain_scores_gemma":[0.9972592,0.000106530984,0.0002887297,0.0015994742,0.00036831666,0.00037775244],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012972907,0.0004397804,0.00042837902,0.0008370296,0.00030693325,0.0011927198,0.0042014434,0.00023086708,0.00028943547],"category_scores_gemma":[0.00004411936,0.00045218942,0.00011537975,0.0005897496,0.0007021586,0.0014060528,0.0019955516,0.00061764923,0.0005920022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036652218,0.00003905886,0.000012785876,0.00003151067,0.000010275175,0.00003319379,0.0005384372,0.027561558,0.000061572224,0.80155975,0.0014190597,0.16872911],"study_design_scores_gemma":[0.00046731872,0.00010079974,0.00016298593,0.00024980278,0.000003610255,0.000026865551,0.0000012739742,0.8504878,0.00021532958,0.0082017025,0.13935557,0.0007268898],"about_ca_topic_score_codex":0.000027934473,"about_ca_topic_score_gemma":0.000006469279,"teacher_disagreement_score":0.8229263,"about_ca_system_score_codex":0.00036825,"about_ca_system_score_gemma":0.0006293826,"threshold_uncertainty_score":0.99984413},"labels":[],"label_agreement":null},{"id":"W119445844","doi":"10.1007/978-3-642-40273-9_17","title":"A Survey of Algorithms and Models for List Update","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Locality; Locality of reference; Context (archaeology); Algorithm; Theoretical computer science; Linked list; Cache; Parallel computing","score_opus":0.04485214655756037,"score_gpt":0.27540241918750563,"score_spread":0.23055027262994526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119445844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009799559,0.00039254772,0.99711466,0.00045023952,0.0004016883,0.00060833927,0.00002963976,0.000049099766,0.0009439647],"genre_scores_gemma":[0.022943042,0.00017876456,0.97537637,0.000738767,0.000069437134,0.00001962019,0.000017332392,0.000025282412,0.000631365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976437,0.000039472703,0.00042522614,0.00094414124,0.00053618307,0.00041128855],"domain_scores_gemma":[0.99767554,0.00052046496,0.00022277316,0.000744625,0.0006833095,0.00015327251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012755372,0.0002883334,0.00042858647,0.00047632938,0.00013179486,0.00040718445,0.0017523699,0.00018960853,0.000015265206],"category_scores_gemma":[0.00008952425,0.00025311921,0.00005682931,0.00036397332,0.0005555897,0.00070281664,0.00090687926,0.00028112848,0.000005485631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004831768,0.000026184945,0.00002797139,0.000080516,0.00001257453,0.0000033600556,0.00047960813,0.13643561,0.000021939342,0.05893915,0.0000979415,0.8038703],"study_design_scores_gemma":[0.00019914369,0.000103060665,0.000054390573,0.00008642136,0.0000017953407,0.0000055513756,2.6927044e-8,0.8648535,0.00011320457,0.13409287,0.0002488973,0.00024111987],"about_ca_topic_score_codex":0.00014246038,"about_ca_topic_score_gemma":0.00011369838,"teacher_disagreement_score":0.80362916,"about_ca_system_score_codex":0.000054415465,"about_ca_system_score_gemma":0.00034782663,"threshold_uncertainty_score":0.99999213},"labels":[],"label_agreement":null},{"id":"W12290988","doi":"","title":"The Mutual Visibility Problem for Oblivious Robots","year":2014,"lang":"en","type":"article","venue":"CINECA IRIS Institutial research information system (University of Pisa)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Correctness; Robot; Visibility; Computability; Computer science; Set (abstract data type); Euclidean geometry; Plane (geometry); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Geometry","score_opus":0.04677671382139172,"score_gpt":0.2907456539820823,"score_spread":0.24396894016069057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12290988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013969115,0.000010777207,0.96352875,0.0016409165,0.00022211224,0.0012058816,0.000014643527,0.00013904425,0.031840954],"genre_scores_gemma":[0.9615614,0.000019832654,0.03778141,0.000038725488,0.000055270797,0.000009942275,0.000018792423,0.0000045737834,0.00051006395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975092,0.00039680034,0.00036375262,0.00023166867,0.001022865,0.00047576003],"domain_scores_gemma":[0.99652654,0.00056142354,0.00021476582,0.0007292774,0.0017593433,0.00020864759],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005813863,0.00011160644,0.0002026407,0.00036620133,0.0017153991,0.00033054853,0.0016464426,0.000107133244,0.000007714023],"category_scores_gemma":[0.0007277694,0.0000979787,0.000101656275,0.0008915701,0.00042664414,0.0026853087,0.0005208418,0.0002412582,0.00016142122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001648591,0.000046543224,0.00018084874,0.00058477855,0.000038261638,0.0000012325378,0.0056634564,0.0116817225,0.00006083265,0.8860096,0.016426977,0.07914091],"study_design_scores_gemma":[0.0015913399,0.0003494163,0.0005768874,0.00009901996,0.0000042218267,0.0000067760807,0.0027923847,0.7620115,0.00006196684,0.00072665216,0.23162237,0.00015744106],"about_ca_topic_score_codex":0.00021440454,"about_ca_topic_score_gemma":0.00009243832,"teacher_disagreement_score":0.9601645,"about_ca_system_score_codex":0.00024277344,"about_ca_system_score_gemma":0.00047820012,"threshold_uncertainty_score":0.99958426},"labels":[],"label_agreement":null},{"id":"W126257098","doi":"10.1109/simsym.2000.844919","title":"Flow control and dynamic load balancing in Time Warp","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Load balancing (electrical power); Flow (mathematics); Scheme (mathematics); Algorithm; Parallel computing; Distributed computing; Control flow; Reduction (mathematics); Flow control (data); Real-time computing; Computer network","score_opus":0.006499084321241622,"score_gpt":0.2067399449095578,"score_spread":0.20024086058831617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126257098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042953338,0.00016716674,0.97197,0.0038183152,0.000049283623,0.00018407471,7.509353e-7,0.00014370118,0.019371344],"genre_scores_gemma":[0.9308845,0.000052630698,0.05978719,0.0011148994,0.000006473374,0.000005904187,4.5235237e-7,0.0000042000543,0.008143776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00003255571,0.00009418133,0.00015437067,0.00014664567,0.00015329059],"domain_scores_gemma":[0.9997317,0.00004031793,0.0000116798365,0.00013520443,0.000025719864,0.000055370623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019126917,0.00004829938,0.000073583826,0.000051734234,0.00002971675,0.00010182294,0.00019374168,0.000023671753,0.00025131425],"category_scores_gemma":[0.0000210348,0.000041046824,0.000010093899,0.00015354609,0.000013620615,0.00023093895,0.000058429137,0.00005742549,0.00023557284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026211457,0.00078304537,0.023924997,0.00010318757,0.000067971065,0.00020309161,0.01084099,0.15137345,0.0079735,0.03022224,0.026077824,0.7484035],"study_design_scores_gemma":[0.00058009016,0.000018743945,0.00085461466,0.0000057916955,3.1368603e-7,0.0000041619514,0.000002226148,0.9978208,0.0000069530665,0.00020739523,0.00044298108,0.000055926113],"about_ca_topic_score_codex":0.000013647048,"about_ca_topic_score_gemma":0.00002204182,"teacher_disagreement_score":0.92658913,"about_ca_system_score_codex":0.000030161204,"about_ca_system_score_gemma":0.000009989151,"threshold_uncertainty_score":0.3027891},"labels":[],"label_agreement":null},{"id":"W129093026","doi":"10.1007/978-3-319-07890-8_10","title":"Synchronized Dancing of Oblivious Chameleons","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Dance; Choreography; Computer science; Asynchronous communication; Sequence (biology); Visual arts; Art; Biology","score_opus":0.014815554599129825,"score_gpt":0.24394471304628135,"score_spread":0.2291291584471515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129093026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021477681,0.0002601848,0.991582,0.00058066985,0.00089655904,0.00035110305,0.0000025282513,0.00013911365,0.00616639],"genre_scores_gemma":[0.24144754,0.00011058608,0.7561806,0.0011452471,0.00027640708,0.000009402884,0.0000049468968,0.00004189094,0.00078337814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965634,0.000054175103,0.0005961274,0.0011267717,0.0010512904,0.0006082312],"domain_scores_gemma":[0.9971739,0.0004710505,0.0003667929,0.0014182667,0.00038428995,0.00018566998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012041724,0.00038882555,0.00060802593,0.000935401,0.00017670395,0.00029071036,0.0031753047,0.00025105706,0.000040483486],"category_scores_gemma":[0.00015308546,0.0003563156,0.00013191038,0.00069632713,0.0006734808,0.00033943926,0.0012352337,0.0006207191,0.00003433125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003869992,0.000028706902,0.000035247704,0.00010368364,0.000013936554,0.000027185017,0.0010908257,0.14292656,0.0002990625,0.09647718,0.000036407357,0.7589573],"study_design_scores_gemma":[0.0003542537,0.0001940161,0.000028742617,0.00045749827,0.000004364325,0.000031447187,8.515741e-8,0.94421124,0.001025605,0.051946335,0.0012874953,0.00045893335],"about_ca_topic_score_codex":0.000021852647,"about_ca_topic_score_gemma":0.00005192633,"teacher_disagreement_score":0.8012847,"about_ca_system_score_codex":0.0001925795,"about_ca_system_score_gemma":0.00067913265,"threshold_uncertainty_score":0.9998889},"labels":[],"label_agreement":null},{"id":"W129976106","doi":"","title":"Assigning Closely Spaced Targets to Multiple Autonomous Underwater Vehicles","year":2009,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Turning radius; Kinematics; Underwater; Constant (computer programming); Task (project management); Computer science; Mathematical optimization; Algorithm; Path (computing); Constant curvature; Curvature; Control theory (sociology); Mathematics; Engineering; Artificial intelligence; Aerospace engineering; Geometry","score_opus":0.014439750945576429,"score_gpt":0.21753179389921512,"score_spread":0.2030920429536387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129976106","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8745829,0.00019467656,0.10288024,0.013531131,0.001080796,0.0019320151,0.000042231124,0.0010190104,0.004737007],"genre_scores_gemma":[0.18152755,0.00007518734,0.22093068,0.00024113311,0.00005146516,0.0000015710363,0.0003812706,0.000046574096,0.5967446],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819034,0.000109224085,0.0001708159,0.00062354055,0.0004392174,0.00046685612],"domain_scores_gemma":[0.99869984,0.00004662834,0.00020798539,0.00050404744,0.00028530165,0.00025619532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002166062,0.00028816497,0.00040998176,0.00051430723,0.00031089233,0.00013289289,0.0011553086,0.0002799196,0.00006711649],"category_scores_gemma":[0.000020642443,0.00032993837,0.00016033677,0.00040300336,0.000035553974,0.00055574154,0.00017561339,0.00028927907,0.00020661629],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054717413,0.00080238725,0.0011112767,0.0007179119,0.0005041599,0.00043195733,0.7321413,0.037510626,0.063616194,0.005734779,0.034153704,0.122728504],"study_design_scores_gemma":[0.012558017,0.0044589373,0.07082073,0.0025442438,0.00044414433,0.000030534302,0.21198496,0.5103595,0.11989328,0.0067823743,0.051577702,0.0085455775],"about_ca_topic_score_codex":0.006780791,"about_ca_topic_score_gemma":0.01869748,"teacher_disagreement_score":0.69305533,"about_ca_system_score_codex":0.00012790466,"about_ca_system_score_gemma":0.00017891536,"threshold_uncertainty_score":0.99991524},"labels":[],"label_agreement":null},{"id":"W1472690358","doi":"10.1016/j.jnca.2016.07.010","title":"Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors","year":2016,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation","keywords":"Computer science; Network packet; Throughput; Queue; Network processor; Bounded function; Distributed computing; Computer network; Telecommunications; Wireless","score_opus":0.0280685812183043,"score_gpt":0.2860164329686443,"score_spread":0.25794785175034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1472690358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006141399,0.00017292911,0.99431384,0.0036321743,0.000045465044,0.0009538582,0.0000030062104,0.000051864383,0.00021275585],"genre_scores_gemma":[0.15374891,0.00046266682,0.8413175,0.0019263809,0.0014067552,0.0008413336,0.0000031860022,0.00003161456,0.00026166972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831164,0.000072730036,0.0005249605,0.00034270593,0.00028450403,0.0004634833],"domain_scores_gemma":[0.9985834,0.00016786852,0.00029028527,0.00036279188,0.00034549882,0.00025015636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535871,0.00016885895,0.00027586694,0.00014147087,0.0002526178,0.00019355104,0.0007156691,0.00005720894,0.000007323628],"category_scores_gemma":[0.0000052141204,0.000100808895,0.00004230379,0.0014569683,0.00004268381,0.00051365717,0.00025683947,0.0001795314,0.0000121243975],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017673003,0.0006711497,0.0119934995,0.00010225873,0.00013650542,0.00003070017,0.002365435,0.1950881,0.000030782157,0.28873974,0.012875928,0.48778915],"study_design_scores_gemma":[0.0046979766,0.0013894022,0.012283992,0.0013343933,0.000043547665,0.0005554608,0.00011479284,0.20221823,0.000017265085,0.025979523,0.7503663,0.000999162],"about_ca_topic_score_codex":0.0000013164786,"about_ca_topic_score_gemma":0.000034399003,"teacher_disagreement_score":0.7374903,"about_ca_system_score_codex":0.000049422546,"about_ca_system_score_gemma":0.00015255662,"threshold_uncertainty_score":0.41108674},"labels":[],"label_agreement":null},{"id":"W1480384904","doi":"10.1007/978-3-642-02568-6_53","title":"A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hierarchy; Automaton; Resource allocation; Theoretical computer science; Sampling (signal processing); Resource (disambiguation); Operations research; Mathematics; Telecommunications","score_opus":0.02930678080531624,"score_gpt":0.2897804976196341,"score_spread":0.26047371681431786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480384904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053111973,0.00012807499,0.9927671,0.0015382118,0.00027001268,0.00041472964,0.0000032912078,0.00020638145,0.0046190857],"genre_scores_gemma":[0.037854023,0.00003835112,0.96024525,0.0010505973,0.00018118357,0.000005404764,0.000016961023,0.000028941779,0.0005792961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959282,0.00005488809,0.0008422231,0.0012425118,0.0012324404,0.0006997248],"domain_scores_gemma":[0.9971974,0.00038855072,0.00054831133,0.0013200411,0.00035159575,0.0001940851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018546121,0.00039473115,0.0004981966,0.0010372554,0.0002304356,0.00043415147,0.0031713378,0.00025711826,0.000021181992],"category_scores_gemma":[0.0001915067,0.0003858174,0.00012694405,0.00083623565,0.00044829628,0.00067182875,0.0010932086,0.00068759156,0.000012771667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004124961,0.00002759459,0.000008688246,0.00003623459,0.000005802929,0.0000135729715,0.00086942484,0.36511412,0.00020261099,0.020935575,0.000017692846,0.61276454],"study_design_scores_gemma":[0.00025386296,0.00021932933,0.000046408266,0.00040005645,0.0000045912334,0.00003570267,3.0653868e-7,0.965414,0.0010058827,0.029677114,0.002525838,0.0004169442],"about_ca_topic_score_codex":0.000012144182,"about_ca_topic_score_gemma":0.000008869993,"teacher_disagreement_score":0.6123476,"about_ca_system_score_codex":0.0001924749,"about_ca_system_score_gemma":0.00067559414,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W1481888229","doi":"10.1007/978-3-540-74466-5_64","title":"Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Ring (chemistry); Black hole (networking); Computer science; Security token; Ring network; Constant (computer programming); Token ring; Physics; Computer network; Network topology","score_opus":0.06385829267549921,"score_gpt":0.3188294906459288,"score_spread":0.2549711979704296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481888229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012791757,0.00008562011,0.9855649,0.00017737102,0.00041417172,0.00047375768,0.0000019585764,0.0000676323,0.0004228258],"genre_scores_gemma":[0.63973993,0.000007737823,0.35931724,0.00078973186,0.000092802664,0.000002418504,0.0000016669395,0.000026957136,0.000021504464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696535,0.00009889472,0.00067733583,0.0009937901,0.0006423245,0.00062232587],"domain_scores_gemma":[0.99768776,0.00029668535,0.00034486922,0.0011896576,0.00033622017,0.00014478342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018951364,0.00033899542,0.00036237595,0.00092106906,0.0002619222,0.00032401225,0.0021096203,0.0001854261,0.000013065804],"category_scores_gemma":[0.000086646156,0.00027766044,0.00007132891,0.0013026003,0.000771922,0.0006832033,0.0011411553,0.00069465657,0.000005866523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004132346,0.000044643337,0.00020232242,0.00004439286,0.000005361469,0.00052065076,0.0047384896,0.7863626,0.00016550587,0.0040117493,8.6017315e-7,0.20389928],"study_design_scores_gemma":[0.00029181983,0.000079566904,0.000079077356,0.00034079436,0.000003602914,0.00015184481,0.0000036673148,0.99408346,0.0007193075,0.0039344085,0.000020527053,0.0002919391],"about_ca_topic_score_codex":0.00023636452,"about_ca_topic_score_gemma":0.0006350713,"teacher_disagreement_score":0.6269482,"about_ca_system_score_codex":0.0002312203,"about_ca_system_score_gemma":0.00031585674,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W1484932675","doi":"10.1007/978-3-642-02777-2_26","title":"A Theoretical Analysis of Search in GSAT","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristic; Algorithm; Distribution (mathematics); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.018391801256455245,"score_gpt":0.27934312240710363,"score_spread":0.2609513211506484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484932675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009021677,0.00012559863,0.98888755,0.0011530177,0.00014705773,0.00025811815,0.000003016057,0.000046148405,0.009289252],"genre_scores_gemma":[0.5946256,0.00009879145,0.4039456,0.0010414369,0.000060391474,0.0000034302348,0.000007305149,0.000015506981,0.0002019414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651605,0.00008308344,0.00056928705,0.0010745476,0.0011973733,0.00055966416],"domain_scores_gemma":[0.99785024,0.00047730358,0.00013050115,0.0011161393,0.00027180702,0.00015400036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016339703,0.0002923262,0.0006557349,0.0032425218,0.00007116425,0.00024448877,0.0028171774,0.00024161799,0.00013191169],"category_scores_gemma":[0.0000906043,0.00025615157,0.0001780528,0.0033912186,0.0010414114,0.00031055402,0.00082576164,0.00070210843,0.000010809458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000355062,0.000033345757,0.000102047685,0.000010049194,0.000020376716,0.000029264427,0.0006812743,0.3151607,0.000022381775,0.39787385,0.0000013852316,0.28606176],"study_design_scores_gemma":[0.00014088525,0.000110664645,0.00042899008,0.000098107565,0.000013123075,0.0000039788442,1.0083441e-7,0.84029007,0.00018932286,0.15845692,0.000042668726,0.00022516148],"about_ca_topic_score_codex":0.000019961157,"about_ca_topic_score_gemma":0.000080046004,"teacher_disagreement_score":0.5945354,"about_ca_system_score_codex":0.00017765751,"about_ca_system_score_gemma":0.0004651198,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W1485084509","doi":"10.1109/ictel.2003.1191680","title":"Minimum cost design of a parallel computing cluster","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Research Manitoba","funders":"","keywords":"Maxima and minima; Computer science; Mathematical optimization; Approximation algorithm; Function (biology); Linear approximation; Network planning and design; Representation (politics); Approximation error; Function approximation; Linear programming; Process (computing); Algorithm; Artificial neural network; Mathematics; Artificial intelligence; Nonlinear system","score_opus":0.05122015434431328,"score_gpt":0.28319298227882944,"score_spread":0.23197282793451615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485084509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077448814,0.000014746027,0.9792417,0.00031692898,0.00006553695,0.0002397195,1.0491248e-7,0.000056248547,0.01998754],"genre_scores_gemma":[0.18736404,0.000005430196,0.8107675,0.00060621276,0.0000044625717,0.0000032044775,3.1413265e-7,0.000003525001,0.001245338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991887,0.00015537364,0.00017427855,0.0001550967,0.00015231795,0.00017421917],"domain_scores_gemma":[0.9994452,0.00013762656,0.000046047957,0.00022415035,0.000084420004,0.00006255835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046404032,0.000058387646,0.0000904334,0.000055167286,0.00004733992,0.000052489304,0.0002987813,0.000026918162,0.00007297841],"category_scores_gemma":[0.000054983833,0.00004860634,0.000024714956,0.00023166405,0.000025084186,0.00015177067,0.00007001002,0.000047654634,0.000040587263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007376713,0.00015995462,0.0004773842,0.000021502552,0.000018803998,0.000003651004,0.0013311972,0.56049114,0.00038342466,0.41714466,0.011040485,0.008920412],"study_design_scores_gemma":[0.0004289542,0.000045179728,0.000039440973,0.0000066890098,7.081457e-7,0.0000047605904,0.000021044149,0.9959144,0.00053154345,0.0011067425,0.0018280986,0.00007242894],"about_ca_topic_score_codex":0.0000034948632,"about_ca_topic_score_gemma":6.2086843e-7,"teacher_disagreement_score":0.43542325,"about_ca_system_score_codex":0.000008847255,"about_ca_system_score_gemma":0.000057012985,"threshold_uncertainty_score":0.19821091},"labels":[],"label_agreement":null},{"id":"W1489544554","doi":"10.1007/11527954_19","title":"Algorithmic Foundations of the Internet: Roundup","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; The Internet; Field (mathematics); World Wide Web; Mathematics","score_opus":0.02369745416734363,"score_gpt":0.266378627808066,"score_spread":0.24268117364072236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489544554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010517415,0.00013328884,0.9882919,0.002063827,0.0011935321,0.00036899385,0.000002912862,0.000062606894,0.007872397],"genre_scores_gemma":[0.09667568,0.0000780151,0.8931324,0.0021721383,0.0004928249,0.000014341093,0.0000049580417,0.00003860455,0.0073910244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974908,0.000040966406,0.00045958036,0.00075976865,0.0008750297,0.0003738103],"domain_scores_gemma":[0.99787205,0.00022319178,0.0002745943,0.0012417458,0.00029871552,0.00008967758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059493503,0.00027393093,0.0002835642,0.0004508121,0.0001692544,0.00038191714,0.0041377987,0.00017051071,0.00007485588],"category_scores_gemma":[0.00007083033,0.00020254683,0.00013422192,0.0006681726,0.00075502903,0.00054268807,0.0015627597,0.0005948917,0.00003861085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012802311,0.000034821613,0.00004412321,0.00002017619,0.000011889829,0.000004125491,0.0010710517,0.10395308,0.00004757451,0.12435331,0.00006831216,0.7703903],"study_design_scores_gemma":[0.00016713997,0.00006115574,0.00010095887,0.00021663368,0.0000037145155,0.000023999652,8.8100855e-8,0.926793,0.0005242486,0.064650476,0.007182809,0.00027582314],"about_ca_topic_score_codex":0.00002728036,"about_ca_topic_score_gemma":0.00011070228,"teacher_disagreement_score":0.82283986,"about_ca_system_score_codex":0.00023080918,"about_ca_system_score_gemma":0.0006202065,"threshold_uncertainty_score":0.82596195},"labels":[],"label_agreement":null},{"id":"W1490637409","doi":"10.1007/978-3-540-24581-0_3","title":"On How to Learn from a Stochastic Teacher or a Stochastic Compulsive Liar of Unknown Identity","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Learning automata; Interval (graph theory); Point (geometry); Identity (music); Automaton; Artificial intelligence; Mechanism (biology); Space (punctuation); Stochastic process; Algorithm; Mathematics; Statistics","score_opus":0.024634053035175987,"score_gpt":0.2719790049346291,"score_spread":0.24734495189945313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490637409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010360174,0.00008852903,0.9951826,0.0017871434,0.0011975754,0.00089353276,0.000017636392,0.000108420725,0.000620984],"genre_scores_gemma":[0.2366237,0.000017553333,0.7510663,0.0060274447,0.00045431915,0.000046268484,0.000018979961,0.000116587194,0.005628788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503964,0.00010660071,0.0005561129,0.0017754327,0.0017977718,0.00072445587],"domain_scores_gemma":[0.9959541,0.0011924908,0.00037751914,0.0015299883,0.00056514423,0.0003807316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008883646,0.0006003862,0.0007785286,0.0011236331,0.00022896384,0.0007013651,0.0036500779,0.00034167184,0.000118146716],"category_scores_gemma":[0.00082829606,0.0005043586,0.00015232016,0.00116666,0.00057177845,0.0006877992,0.0012941853,0.0011053776,0.000088660156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003594737,0.00010655933,0.0000023011858,0.00003192316,0.000027491054,0.000041016763,0.0016227168,0.9013742,0.000062731015,0.03736456,0.00016248677,0.059168052],"study_design_scores_gemma":[0.0005965421,0.0007976687,0.000026571932,0.0009020719,0.00001376622,0.000018243749,8.6174896e-7,0.84309876,0.000105050785,0.15340772,0.00027613962,0.00075657794],"about_ca_topic_score_codex":0.000056610315,"about_ca_topic_score_gemma":0.00028441456,"teacher_disagreement_score":0.24411622,"about_ca_system_score_codex":0.0003317325,"about_ca_system_score_gemma":0.0006962775,"threshold_uncertainty_score":0.9997408},"labels":[],"label_agreement":null},{"id":"W1492783741","doi":"10.1023/a:1011688823715","title":"Robot Map Verification of a Graph World","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Vertex (graph theory); Robot; Traverse; Robotics; Artificial intelligence; Theory of computation; Combinatorics; Computer science; Orientation (vector space); Graph; Automation; Topology (electrical circuits); Mathematics; Algorithm; Geometry; Geography; Engineering; Cartography","score_opus":0.01678363309690364,"score_gpt":0.2575980775032374,"score_spread":0.24081444440633373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492783741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026700218,0.000095742864,0.9945013,0.0012455413,0.002565607,0.00012919867,3.8609073e-7,0.000026663818,0.0011685853],"genre_scores_gemma":[0.4037691,0.0003841625,0.5951508,0.000090094145,0.00028334447,0.0000035902062,0.0000056972317,0.000016220738,0.00029693285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839467,0.00014233503,0.0006608458,0.00012538809,0.0005287616,0.0001480253],"domain_scores_gemma":[0.99782705,0.00007319906,0.0007457397,0.00025772752,0.0009893078,0.0001069519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067467935,0.00009875642,0.00022934908,0.0005132093,0.000068735506,0.000101193276,0.0005630003,0.00005897051,0.000058939797],"category_scores_gemma":[0.00011475072,0.00009157608,0.00010684404,0.0011637835,0.00003640144,0.0010213441,0.000051541807,0.00015400484,0.000004145059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934693,0.00024055212,0.0004347005,0.000013189463,0.000026632557,0.000005807758,0.00021726225,0.8870621,0.0004165726,0.10899921,0.0009763952,0.0015382429],"study_design_scores_gemma":[0.005083735,0.0009574431,0.000784261,0.00017362693,0.00004339272,0.00006812456,0.000044153625,0.93855345,0.003923427,0.039927423,0.01006829,0.00037266698],"about_ca_topic_score_codex":0.0000036853603,"about_ca_topic_score_gemma":3.4016068e-7,"teacher_disagreement_score":0.4035021,"about_ca_system_score_codex":0.000053429823,"about_ca_system_score_gemma":0.00014184965,"threshold_uncertainty_score":0.37343642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015741446759445415,"score_gpt":0.25260131241725203,"score_spread":0.23685986565780662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493636406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026480792,0.00017946436,0.9932141,0.0009261692,0.0018047234,0.0004888502,0.0000075109397,0.00016675651,0.0029476522],"genre_scores_gemma":[0.041287158,0.0000746267,0.9562188,0.0015922287,0.00032977067,0.000016339287,0.000017590612,0.000046119225,0.00041737437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522024,0.000060967475,0.00071819563,0.0017398301,0.0013150135,0.0009457296],"domain_scores_gemma":[0.99718684,0.00052164134,0.0002572014,0.0013967578,0.0003374371,0.00030010525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012597749,0.0005853934,0.0005695695,0.0014116233,0.00028204182,0.00048358543,0.0029617292,0.0005729771,0.0001061571],"category_scores_gemma":[0.0001631953,0.00055190234,0.00012331625,0.00091243687,0.00088128925,0.0007837472,0.0019574566,0.0021136052,0.0001187267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015914611,0.00013084101,0.00019848878,0.000040620704,0.000012441568,0.00044545557,0.0016021405,0.49166903,0.00070694124,0.035542965,0.00002491674,0.46961024],"study_design_scores_gemma":[0.0006463666,0.00022995731,0.00025149947,0.00027454266,0.000002862052,0.00014980813,1.5111637e-7,0.97301626,0.0009941882,0.018301845,0.0053027207,0.00082980294],"about_ca_topic_score_codex":0.000044900222,"about_ca_topic_score_gemma":0.00021791348,"teacher_disagreement_score":0.4813472,"about_ca_system_score_codex":0.0003041387,"about_ca_system_score_gemma":0.0011765953,"threshold_uncertainty_score":0.9996933},"labels":[],"label_agreement":null},{"id":"W1495262204","doi":"10.1007/978-3-642-34862-4_18","title":"FIFO Queueing Policies for Packets with Heterogeneous Processing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"FIFO (computing and electronics); Network packet; Computer science; Queueing theory; Queue; FIFO and LIFO accounting; Bounded function; Throughput; Computer network; Distributed computing; Real-time computing; Telecommunications; Mathematics; Operating system; Wireless","score_opus":0.027340042047799384,"score_gpt":0.27158548266187577,"score_spread":0.24424544061407638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495262204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004014803,0.0008401644,0.99573326,0.00090473075,0.00037333602,0.0006589224,0.0000042568486,0.00019408455,0.0012510846],"genre_scores_gemma":[0.17293209,0.0000614729,0.82396686,0.002010152,0.0004984445,0.000041331987,0.000007552465,0.00006339017,0.00041871844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968848,0.000024106675,0.00037139308,0.0010304403,0.00078210153,0.00090712216],"domain_scores_gemma":[0.99807125,0.00024518787,0.0002541466,0.00079717516,0.00039646827,0.00023577195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006465351,0.0004497317,0.00041236635,0.0006190844,0.00042352662,0.000911171,0.002038587,0.00021431896,0.000012204899],"category_scores_gemma":[0.000043526674,0.00035883958,0.000087128916,0.00047625508,0.00050938845,0.0008882061,0.00064450846,0.00042131796,0.000012313092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000929445,0.000029411241,0.000053304888,0.00012660892,0.000010889361,0.000017196473,0.0020468738,0.123133816,0.00005989607,0.012795562,0.0000137212755,0.86170346],"study_design_scores_gemma":[0.00040923184,0.00034393233,0.000027159485,0.00063136965,0.000009577416,0.00015496071,2.966392e-7,0.9521788,0.001606507,0.040080506,0.0037093912,0.00084829004],"about_ca_topic_score_codex":0.000010996053,"about_ca_topic_score_gemma":0.00006397467,"teacher_disagreement_score":0.86085516,"about_ca_system_score_codex":0.0001935005,"about_ca_system_score_gemma":0.00060866505,"threshold_uncertainty_score":0.99988633},"labels":[],"label_agreement":null},{"id":"W1498202041","doi":"10.1007/978-3-642-24100-0_42","title":"Synchronous Rendezvous for Location-Aware Agents","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Simple (philosophy); Euclidean distance; Euclidean space; Euclidean geometry; Point (geometry); Combinatorics; Discrete mathematics; Mathematics; Topology (electrical circuits); Artificial intelligence; Computer network; Geometry; Physics; Spacecraft","score_opus":0.03711144743406031,"score_gpt":0.2726075377252521,"score_spread":0.23549609029119178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498202041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015582365,0.00022739862,0.9926741,0.00061128114,0.0014503454,0.0008176054,0.000007772967,0.00019445202,0.0040154518],"genre_scores_gemma":[0.07980346,0.00013239947,0.91334236,0.0028282695,0.0005173116,0.00008386483,0.000032589585,0.00007778703,0.0031819402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669355,0.000027160588,0.00048209567,0.0013950499,0.00072581845,0.0006763228],"domain_scores_gemma":[0.9972739,0.00027027406,0.00025733578,0.0013277227,0.0006507476,0.00022001866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007059639,0.00042251858,0.00039496174,0.0006864439,0.00032971022,0.00046649246,0.0033188807,0.00029094427,0.000065839224],"category_scores_gemma":[0.00009746456,0.0003990483,0.00011530498,0.00055246934,0.0004269918,0.0005885083,0.00086863973,0.00044340568,0.0000824888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007034951,0.000057684214,0.000018255156,0.00011447358,0.000018491879,0.00002817166,0.0013834044,0.09769165,0.0000074132618,0.05975582,0.00031177694,0.84060585],"study_design_scores_gemma":[0.00032283572,0.00024329117,0.000032709253,0.00025221263,0.0000059364,0.000029458988,1.0227862e-7,0.8377963,0.00019424067,0.15546593,0.0050901645,0.0005668439],"about_ca_topic_score_codex":0.00002139779,"about_ca_topic_score_gemma":0.00004786827,"teacher_disagreement_score":0.84003896,"about_ca_system_score_codex":0.0002957687,"about_ca_system_score_gemma":0.0009222638,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W1499381808","doi":"10.1007/978-3-540-69311-6_20","title":"Searching Trees with Sources and Targets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Monotonic function; Clearance; Set (abstract data type); Search problem; Computer science; Tree (set theory); Time complexity; Search algorithm; Search tree; Combinatorics; Mathematics; Theoretical computer science; Algorithm","score_opus":0.017028414232843833,"score_gpt":0.2362092110254312,"score_spread":0.21918079679258734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499381808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010856779,0.0007766609,0.9926998,0.0010139244,0.00014941469,0.00027822985,0.0000010083616,0.00013705765,0.00483531],"genre_scores_gemma":[0.08264146,0.000608731,0.91368425,0.0017091156,0.00022484765,0.000008437732,0.0000037778238,0.000041985346,0.0010773869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971049,0.00003713448,0.00025872287,0.0011211835,0.0009261069,0.0005519867],"domain_scores_gemma":[0.9985054,0.00029083842,0.00012873867,0.0006845366,0.00016892614,0.00022152581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004937172,0.00035379932,0.00034215098,0.00068659196,0.00042012447,0.0006291568,0.0016534555,0.00014347135,0.000012028822],"category_scores_gemma":[0.00003728,0.0002724297,0.000042604483,0.00042178974,0.0010103368,0.0006486419,0.0009696409,0.00065035536,0.000012058102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008589382,0.000027377364,0.0002569903,0.000040501156,0.000016346929,0.0002091871,0.004978021,0.19082247,0.000037577563,0.014710901,0.00005261741,0.7888394],"study_design_scores_gemma":[0.00039604853,0.000355559,0.00027310784,0.00033531283,0.0000032212902,0.00020653149,3.4342793e-7,0.96114314,0.00033008313,0.031774625,0.004499269,0.0006827471],"about_ca_topic_score_codex":0.000026137102,"about_ca_topic_score_gemma":0.000097837576,"teacher_disagreement_score":0.7881567,"about_ca_system_score_codex":0.000076800796,"about_ca_system_score_gemma":0.00040736224,"threshold_uncertainty_score":0.99997276},"labels":[],"label_agreement":null},{"id":"W1501234213","doi":"10.1007/11821069_2","title":"Tree Exploration with an Oracle","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Oracle; Traverse; Tree (set theory); Tree traversal; Competitive analysis; Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Combinatorics; Artificial intelligence; Upper and lower bounds; Geography","score_opus":0.02826344014817172,"score_gpt":0.25439264767817255,"score_spread":0.22612920753000082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501234213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012056532,0.00006508866,0.9859087,0.00092168583,0.00034335817,0.0003501661,0.0000018487309,0.00022769463,0.012169408],"genre_scores_gemma":[0.023990896,0.000022822042,0.9733865,0.000962457,0.0002936962,0.000014700659,0.000023975217,0.000038719307,0.0012662315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969465,0.000039780236,0.0003336099,0.0012001636,0.0009975391,0.00048237614],"domain_scores_gemma":[0.99807006,0.00010998243,0.00018305414,0.0011407292,0.00032492084,0.00017122824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005539524,0.00035824638,0.0002997325,0.0006519383,0.00024808568,0.0008941619,0.0021141078,0.00018418531,0.000023579785],"category_scores_gemma":[0.000017692579,0.00029259117,0.000045333712,0.0006707532,0.00042147192,0.0021970936,0.00042815047,0.00046913495,0.0000395615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073029823,0.00004637443,0.000022897917,0.000013977303,0.000003784004,0.00005280319,0.00052144,0.32067072,0.000026900028,0.023813697,0.00006313537,0.65475696],"study_design_scores_gemma":[0.00026416645,0.0004582383,0.00003920779,0.00011230305,0.0000026341324,0.000024628376,1.6488163e-7,0.92406666,0.00034124733,0.07283961,0.0013988087,0.00045235065],"about_ca_topic_score_codex":0.000030212948,"about_ca_topic_score_gemma":0.00035966924,"teacher_disagreement_score":0.6543046,"about_ca_system_score_codex":0.00012952054,"about_ca_system_score_gemma":0.00048555763,"threshold_uncertainty_score":0.9999526},"labels":[],"label_agreement":null},{"id":"W1508354613","doi":"10.1007/11764298_10","title":"Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Locality; Computer science; Locality of reference; Information retrieval; Operating system","score_opus":0.02173025080978708,"score_gpt":0.25813699526109396,"score_spread":0.23640674445130688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508354613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014731375,0.0000868721,0.99676853,0.0004307145,0.0002651298,0.00076698407,0.000012582242,0.00008580287,0.0014360574],"genre_scores_gemma":[0.15945019,0.00004202561,0.8393123,0.00082930404,0.000106686224,0.000022159047,0.000012932516,0.000037728234,0.00018667604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996042,0.000062517116,0.0006405876,0.0014824462,0.0011179511,0.0006544848],"domain_scores_gemma":[0.9972505,0.000754402,0.00041692346,0.001264885,0.00016343762,0.00014987186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009097324,0.000480969,0.0005777103,0.00065718446,0.00015257577,0.00029235106,0.002434863,0.00040094648,0.000010569769],"category_scores_gemma":[0.0001300649,0.00041598122,0.000071010974,0.00076421245,0.000510636,0.0004092073,0.0006634431,0.0008992325,0.0000098314085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010982436,0.0007150302,0.0013904818,0.0005177439,0.000042800486,0.00012271265,0.0037415188,0.5121147,0.00016895267,0.28823107,0.000078789446,0.19276635],"study_design_scores_gemma":[0.0012032305,0.0012450102,0.0015555107,0.0027197516,0.000012017372,0.000024044804,6.1240394e-7,0.73697525,0.0022642296,0.2496866,0.0029675246,0.0013462495],"about_ca_topic_score_codex":0.000059034366,"about_ca_topic_score_gemma":0.00012517594,"teacher_disagreement_score":0.22486052,"about_ca_system_score_codex":0.00051754905,"about_ca_system_score_gemma":0.0004624003,"threshold_uncertainty_score":0.9998292},"labels":[],"label_agreement":null},{"id":"W1516838788","doi":"10.1007/978-3-642-10684-2_72","title":"A Markov Model for Multiagent Patrolling in Continuous Time","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Patrolling; Computer science; Asynchronous communication; Multi-agent system; Markov chain; Artificial intelligence; Markov decision process; Distributed computing; Markov process; Machine learning; Computer network; Mathematics","score_opus":0.020520106502168504,"score_gpt":0.2563511251970211,"score_spread":0.23583101869485257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516838788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012463747,0.00019513139,0.99571466,0.0009917092,0.0003088711,0.0010362199,0.0000072802136,0.0001281474,0.0016055072],"genre_scores_gemma":[0.011971787,0.00005191248,0.98350316,0.0019900436,0.000135705,0.000028774612,0.000010147373,0.000030377209,0.002278064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653804,0.000033245484,0.00059030496,0.0013506856,0.00071360567,0.0007741352],"domain_scores_gemma":[0.9981218,0.00036067376,0.00020872662,0.00086697453,0.00026770137,0.00017411886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012430201,0.0004265612,0.0005564381,0.0009051024,0.00016514603,0.000494252,0.002382235,0.00028148582,0.000014750915],"category_scores_gemma":[0.00010201666,0.000403898,0.00014626673,0.00041526766,0.0002128945,0.00047810533,0.0005603106,0.00056385394,0.00002418255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006652062,0.000025577681,0.0000046591244,0.000013298042,0.0000025237619,0.000015749038,0.00045742682,0.55780977,0.00004059427,0.0017212126,0.000019068446,0.43988347],"study_design_scores_gemma":[0.0005838983,0.00013339748,0.00000770509,0.00021433124,0.0000025205466,0.000008848671,4.89494e-8,0.9419571,0.00007193031,0.056223053,0.00037203322,0.00042512166],"about_ca_topic_score_codex":0.00000824734,"about_ca_topic_score_gemma":0.00004484425,"teacher_disagreement_score":0.43945834,"about_ca_system_score_codex":0.0002746109,"about_ca_system_score_gemma":0.000515069,"threshold_uncertainty_score":0.9998413},"labels":[],"label_agreement":null},{"id":"W1520420558","doi":"","title":"Parallel Rollout for Online Solution of Dec-POMDPs.","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Scalability; Bounded function; Computer science; Dynamic programming; Mathematical optimization; Horizon; Online algorithm; Algorithm; Mathematics","score_opus":0.06884681804730829,"score_gpt":0.29775692275143795,"score_spread":0.22891010470412965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520420558","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028302064,0.000024646108,0.993836,0.0010493046,0.000056561523,0.00018687398,0.0000020204304,0.000102697246,0.0019117255],"genre_scores_gemma":[0.10611042,0.000063978325,0.8914168,0.0002512559,0.000018096001,0.000010581193,0.0000070547358,0.000003266872,0.0021185654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994434,0.000015647875,0.00014757954,0.00012863158,0.0001302076,0.00013449462],"domain_scores_gemma":[0.99956256,0.000038273643,0.00003813068,0.00018650232,0.00012654024,0.000047990932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010307522,0.000045477063,0.00007992527,0.000050699495,0.00006735711,0.000010155996,0.00027167512,0.00002791939,0.000020422756],"category_scores_gemma":[0.0000247563,0.000037931663,0.000044180742,0.00013956247,0.000021681459,0.0001898799,0.00006151686,0.000023412807,0.000007587785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001094272,0.003330375,0.007627316,0.00018265015,0.00014181396,0.000012491478,0.0045319083,0.09244703,0.0050921757,0.691179,0.10850528,0.08684055],"study_design_scores_gemma":[0.00057343557,0.000105616775,0.00085725414,0.0000030722222,0.0000010773081,0.0000048034876,0.0000042246306,0.98971426,0.00046665524,0.0011079103,0.0070994417,0.00006223461],"about_ca_topic_score_codex":0.000017955432,"about_ca_topic_score_gemma":0.000022904944,"teacher_disagreement_score":0.8972672,"about_ca_system_score_codex":0.000010305388,"about_ca_system_score_gemma":0.00006830572,"threshold_uncertainty_score":0.15468083},"labels":[],"label_agreement":null},{"id":"W1521899940","doi":"10.1109/robot.1999.770053","title":"Efficient topological exploration","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Traverse; Vertex (graph theory); Robot; Computer science; Compass; Planar graph; Feedback vertex set; Planar; Graph; Topology (electrical circuits); Undirected graph; Topological graph; Artificial intelligence; Combinatorics; Algorithm; Mathematics; Computer vision; Theoretical computer science; Physics; Geography; Computer graphics (images)","score_opus":0.054035900229201815,"score_gpt":0.2823753491163944,"score_spread":0.22833944888719257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521899940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079851033,0.0000060989587,0.88666356,0.0010376229,0.00008309483,0.000053748427,2.5590673e-8,0.00010566344,0.11125167],"genre_scores_gemma":[0.7926952,0.0000033273454,0.20521872,0.00050508685,0.000004952477,0.0000070335386,2.799636e-7,0.0000011777472,0.0015642162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995648,0.000054066863,0.00006364176,0.000114432194,0.000105787294,0.000097227676],"domain_scores_gemma":[0.99975705,0.000017905137,0.000009443451,0.00013771244,0.000034217897,0.00004366642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016971426,0.000029907067,0.000030043093,0.000026685806,0.000053617718,0.00006289703,0.0001313918,0.000017320552,0.00023931607],"category_scores_gemma":[0.000045152035,0.000021716422,0.000013031579,0.00016700104,0.000012207038,0.00008674287,0.000026452184,0.000029690591,0.00019056407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4022342e-7,0.000024750263,0.000017874414,3.4602888e-7,4.2644604e-7,6.831683e-7,0.000096070755,0.02323902,0.000047201098,0.97536016,0.00025084533,0.0009624981],"study_design_scores_gemma":[0.0001804807,0.000057323043,0.00006104944,0.0000010665775,2.953091e-7,0.0000040656687,0.000053575688,0.966419,0.0018193797,0.01853397,0.01278346,0.00008634612],"about_ca_topic_score_codex":0.0000011004047,"about_ca_topic_score_gemma":5.562955e-7,"teacher_disagreement_score":0.95682615,"about_ca_system_score_codex":0.00000809559,"about_ca_system_score_gemma":0.000016772081,"threshold_uncertainty_score":0.26203433},"labels":[],"label_agreement":null},{"id":"W1523671205","doi":"","title":"On-line Network Synthesis","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; A priori and a posteriori; Set (abstract data type); Line (geometry); Key (lock); Algorithm; Computer science; Matching (statistics); Mathematical optimization; Upper and lower bounds; Mathematics; Statistics","score_opus":0.03409576217455546,"score_gpt":0.28734709955784293,"score_spread":0.2532513373832875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523671205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009944697,0.0000064718906,0.8645839,0.0011595797,0.00011206419,0.000043305103,6.2392566e-8,0.0001402204,0.13385491],"genre_scores_gemma":[0.49598637,0.000014028395,0.49185774,0.0045741233,0.00013747599,0.0000049174996,5.0276725e-7,0.0000067517417,0.0074181105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999402,0.000017139524,0.000093147704,0.00013124902,0.00014646312,0.00020999799],"domain_scores_gemma":[0.9993631,0.00028137412,0.000014675992,0.0002299314,0.000032857653,0.00007802457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053748535,0.00004288618,0.00004740506,0.000039337618,0.00006352669,0.00005504111,0.00030810066,0.000021878168,0.0002392193],"category_scores_gemma":[0.0000586551,0.00003314947,0.000020119662,0.00028046532,0.000010657858,0.00009880408,0.00006485101,0.00004808468,0.00030339736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028730578,0.000031894364,0.000059443515,0.0000011852104,0.0000036427534,0.0000059042645,0.000031536332,0.048461407,0.000006985881,0.8753411,0.013478029,0.062575966],"study_design_scores_gemma":[0.0001730271,0.00012019563,0.0004678753,0.000016675445,0.0000011521395,0.000004164228,0.000006854015,0.9516295,0.00182414,0.022205178,0.023365738,0.00018548773],"about_ca_topic_score_codex":0.0000038167636,"about_ca_topic_score_gemma":0.0000076043752,"teacher_disagreement_score":0.9031681,"about_ca_system_score_codex":0.000009819583,"about_ca_system_score_gemma":0.000013231361,"threshold_uncertainty_score":0.38996604},"labels":[],"label_agreement":null},{"id":"W1527958811","doi":"","title":"Canadian traveler problem with remote sensing","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Computer science; Minification; Task (project management); Mathematical optimization; Graph; Total cost; Operations research; Theoretical computer science; Engineering; Mathematics; Systems engineering","score_opus":0.012325172932560882,"score_gpt":0.2222813787133415,"score_spread":0.2099562057807806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527958811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013257441,0.000003457038,0.8152093,0.012361949,0.000013784618,0.00010580787,1.1988324e-7,0.00010051392,0.17207247],"genre_scores_gemma":[0.16592005,0.000002758915,0.82499146,0.003741103,0.000011684931,5.45095e-8,9.366693e-7,0.0000033265112,0.0053285984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932516,0.000019679404,0.000075625474,0.00017623123,0.00013691939,0.0002664137],"domain_scores_gemma":[0.9994607,0.000004826391,0.000013820286,0.00021622637,0.000075994605,0.00022842002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011245381,0.00006204833,0.000056035937,0.00009979958,0.000097339784,0.00016381414,0.00020159649,0.000024923338,0.00003388804],"category_scores_gemma":[0.0000031782051,0.000045970683,0.000011416669,0.0003177991,0.000008868879,0.00021382721,0.000010253373,0.000068766596,0.00004390843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020201273,0.000007930883,0.000018084938,0.0000026887824,0.0000041141443,0.000051362273,0.00077734195,0.002986149,0.00012381596,0.061466347,0.003355954,0.9312042],"study_design_scores_gemma":[0.0002608579,0.00014944481,0.0004825966,0.000018613586,0.0000010761073,0.000058354708,0.00001763392,0.9761745,0.00026644452,0.0067821895,0.015599653,0.00018864211],"about_ca_topic_score_codex":0.02056,"about_ca_topic_score_gemma":0.05723026,"teacher_disagreement_score":0.97318834,"about_ca_system_score_codex":0.000051426647,"about_ca_system_score_gemma":0.0002492722,"threshold_uncertainty_score":0.98596215},"labels":[],"label_agreement":null},{"id":"W1537048078","doi":"10.1002/9781118884614.ch6","title":"Swarm Intelligence and the Evolution of Personality Traits","year":2014,"lang":"en","type":"other","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Swarm robotics; Swarm behaviour; Artificial intelligence; Robot; Computer science; Swarm intelligence; Robotics; Ant robotics; Personality psychology; Machine learning; Personality; Mobile robot; Robot control; Particle swarm optimization; Psychology","score_opus":0.021448062346671726,"score_gpt":0.2561666072956732,"score_spread":0.23471854494900146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537048078","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.826977e-7,0.00021424414,0.61079776,0.00039950316,0.000035204404,0.00011015776,9.0395235e-7,0.000042245854,0.38839948],"genre_scores_gemma":[0.029007142,0.00040653217,0.0627801,0.00035776204,0.00009099044,0.000015601105,0.0000017907925,0.000053330707,0.90728676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993301,0.00011429827,0.00011393876,0.00017647744,0.00017886877,0.00008632812],"domain_scores_gemma":[0.9995699,0.00006702323,0.000085142805,0.00020702064,0.000038046386,0.00003286758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044050836,0.00007494505,0.00013440917,0.00006525606,0.000025194706,0.000034294582,0.0004276632,0.00006622886,0.000358888],"category_scores_gemma":[0.0000341419,0.00004362013,0.000033263634,0.00013144447,0.00019310629,0.000036548205,0.000108064356,0.0000774298,0.000025013353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022713605,0.0000118500575,0.000011243079,0.00004569295,0.000012512401,7.74969e-8,0.00035696547,0.00009128392,9.1484816e-7,0.95564336,0.03347484,0.010348992],"study_design_scores_gemma":[0.000714372,0.00008693564,0.00035036806,0.0001709344,0.000014650287,0.000008165107,0.00013711838,0.7100337,0.000050354018,0.026140327,0.26193026,0.00036282348],"about_ca_topic_score_codex":0.0006720453,"about_ca_topic_score_gemma":0.00014452288,"teacher_disagreement_score":0.929503,"about_ca_system_score_codex":0.00001227835,"about_ca_system_score_gemma":0.000045292152,"threshold_uncertainty_score":0.3929572},"labels":[],"label_agreement":null},{"id":"W1537414353","doi":"10.1007/978-3-642-04128-0_23","title":"Optimality and Competitiveness of Exploring Polygons by Mobile Robots","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Computer science; Robot; Trajectory; Boundary (topology); Metric (unit); Point (geometry); Square (algebra); Convex polygon; Point in polygon; Motion planning; Computer vision; Artificial intelligence; Regular polygon; Mathematics; Computer graphics (images); Geometry; Engineering","score_opus":0.032012159208564914,"score_gpt":0.26406943252698734,"score_spread":0.2320572733184224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537414353","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020480041,0.0006577736,0.99602705,0.00034612056,0.0003150797,0.00035729806,0.000009878504,0.000082065184,0.001999919],"genre_scores_gemma":[0.1442689,0.00082264974,0.85324955,0.0008210047,0.00014467382,0.000049331087,0.000012638104,0.000036692287,0.00059456355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973765,0.00004712614,0.0004312358,0.0010168948,0.00068416557,0.0004440937],"domain_scores_gemma":[0.99831706,0.0002933611,0.0002062463,0.0007667764,0.00023587991,0.00018067667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070237654,0.00033210462,0.0004753827,0.00044417602,0.00016913717,0.00027554735,0.0016207428,0.00015371955,0.000025601083],"category_scores_gemma":[0.00003458499,0.00031781686,0.00006808599,0.00044184344,0.0006767518,0.0007310034,0.0008789226,0.00043985667,0.0000041419107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049209466,0.00005730319,0.00013629488,0.00005959348,0.000008734604,0.000020192898,0.00077172695,0.2043031,0.00030836227,0.018511098,0.0000064217456,0.77581227],"study_design_scores_gemma":[0.0006504444,0.00069366087,0.0006643701,0.00088475377,0.000009292326,0.00006324678,9.320592e-7,0.951264,0.007947455,0.03445644,0.0022564703,0.0011089345],"about_ca_topic_score_codex":0.000024155932,"about_ca_topic_score_gemma":0.000010604382,"teacher_disagreement_score":0.7747033,"about_ca_system_score_codex":0.0000973348,"about_ca_system_score_gemma":0.00024591928,"threshold_uncertainty_score":0.9999274},"labels":[],"label_agreement":null},{"id":"W1539553127","doi":"10.1007/978-3-540-45193-8_125","title":"Restart Strategies: Analysis and Simulation","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cutoff; Mathematical optimization; Algorithm; Mathematics","score_opus":0.02271104224915202,"score_gpt":0.2800543574949932,"score_spread":0.2573433152458412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539553127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030513947,0.00016811765,0.9944709,0.0005697569,0.00026606212,0.00023272482,0.0000018440438,0.00008764263,0.00417242],"genre_scores_gemma":[0.17653047,0.00013401893,0.82054186,0.0019750798,0.00010724606,0.000005576149,0.000009599085,0.000024406689,0.0006717627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973695,0.00004844359,0.00036254394,0.0011043324,0.00071602396,0.0003991072],"domain_scores_gemma":[0.99824685,0.0003465147,0.00016221372,0.00086380943,0.00024895303,0.00013168993],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007637202,0.00030098477,0.00037313427,0.0013270087,0.00021617749,0.0010670272,0.0011019001,0.00020058698,0.000033900214],"category_scores_gemma":[0.000059830814,0.00027740694,0.00008716845,0.0014318783,0.00040709027,0.0008677206,0.00043293223,0.00041511026,0.000010295285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010820507,0.0000074721834,0.00005350687,0.000010997387,0.000020536425,0.000012071475,0.00036602723,0.8998618,0.000006685551,0.022974325,0.0000041422186,0.07668135],"study_design_scores_gemma":[0.00010457122,0.00005912228,0.00009757487,0.000037471684,0.000015826994,0.0000042337874,1.7877421e-7,0.8842318,0.000026959427,0.11431306,0.0008302695,0.00027890026],"about_ca_topic_score_codex":0.00001399333,"about_ca_topic_score_gemma":0.00008775668,"teacher_disagreement_score":0.17649995,"about_ca_system_score_codex":0.00011034301,"about_ca_system_score_gemma":0.00031843243,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W1549492047","doi":"10.1007/978-3-540-77891-2_2","title":"Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closing (real estate); Line (geometry); Algorithm; Computer science; Mathematics; Political science; Law; Geometry","score_opus":0.07252690889965911,"score_gpt":0.33353765075610664,"score_spread":0.2610107418564475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549492047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012226144,0.00078824384,0.9917242,0.005447845,0.00032499572,0.00057287526,0.000010789062,0.000082807484,0.0010470015],"genre_scores_gemma":[0.0042937277,0.0004380929,0.98962134,0.0041438737,0.000714472,0.000010649595,0.0000119011165,0.000028691149,0.00073723466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996699,0.00019393086,0.0004216558,0.0011518436,0.0010382264,0.0004953719],"domain_scores_gemma":[0.9924512,0.005686961,0.00029117803,0.00097249745,0.00039348128,0.00020466842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034549516,0.0003769961,0.0004841865,0.0008257888,0.0006177164,0.0007417358,0.0020245218,0.00020683545,0.0000064565907],"category_scores_gemma":[0.0007929363,0.00026334068,0.00016908564,0.0010674966,0.00066264876,0.00054008537,0.00062395906,0.00062720355,0.000005910587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010544978,0.000012376742,0.0000050461904,0.000006206753,0.00009897902,0.000008764815,0.0011482738,0.11922767,0.0000023130883,0.018709708,0.00009766313,0.8606725],"study_design_scores_gemma":[0.0003220743,0.00028407466,0.000027057842,0.00008880706,0.000103932405,0.000037892027,5.9962326e-7,0.88675207,0.00010445856,0.102213785,0.009635501,0.00042977915],"about_ca_topic_score_codex":0.000015863056,"about_ca_topic_score_gemma":0.000014963973,"teacher_disagreement_score":0.86024266,"about_ca_system_score_codex":0.00011145523,"about_ca_system_score_gemma":0.0005651754,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W1550403096","doi":"10.1007/978-3-540-72870-2_4","title":"Digraph Strong Searching: Monotonicity and Complexity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Monotonic function; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0658866268132134,"score_gpt":0.3033950996447445,"score_spread":0.2375084728315311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550403096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009135863,0.0002680721,0.98739433,0.0007588767,0.00044100985,0.00046289785,0.000005084491,0.00017472135,0.010403618],"genre_scores_gemma":[0.09740877,0.00016276367,0.90035576,0.0014296591,0.00020379253,0.0000057881234,0.000007639731,0.00003603177,0.0003897788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612266,0.00005335337,0.0004526103,0.0014259696,0.0011210217,0.0008244004],"domain_scores_gemma":[0.9977583,0.00041885575,0.00018058416,0.0010500947,0.0002403065,0.00035182247],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016795268,0.00043539182,0.00044635218,0.0010370602,0.00042544396,0.0008510196,0.0024016476,0.0002462397,0.000025987252],"category_scores_gemma":[0.000068983674,0.00040339067,0.00009297062,0.0006301249,0.0015232048,0.00068494864,0.0019332122,0.0011373507,0.00001644988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007352595,0.000038796836,0.00027128504,0.000051523253,0.000013659068,0.00006421455,0.0010172715,0.029599363,0.000029445275,0.2996483,0.000014444421,0.66924435],"study_design_scores_gemma":[0.00025100049,0.00012635585,0.00049218937,0.00013710454,0.00000259636,0.000037732036,1.7902597e-7,0.826452,0.00015524206,0.170817,0.0010591262,0.0004694259],"about_ca_topic_score_codex":0.00005944856,"about_ca_topic_score_gemma":0.00018588247,"teacher_disagreement_score":0.7968527,"about_ca_system_score_codex":0.00017842204,"about_ca_system_score_gemma":0.00038571388,"threshold_uncertainty_score":0.9998418},"labels":[],"label_agreement":null},{"id":"W1550484269","doi":"","title":"Modeling a domain in a tutorial-like system using learning automata","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Benchmark (surveying); Domain (mathematical analysis); Process (computing); Representation (politics); Range (aeronautics); Action (physics); Artificial intelligence; Scaling; Theoretical computer science; Programming language; Mathematics","score_opus":0.02102450492435127,"score_gpt":0.26501057412391765,"score_spread":0.2439860691995664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550484269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07724698,0.0000037107984,0.9177536,0.000103344806,0.0007334765,0.00013204805,1.04355045e-7,0.00040493152,0.0036218215],"genre_scores_gemma":[0.66800624,7.39386e-7,0.3317668,0.000030324105,0.000053141022,0.00000485332,5.040505e-7,0.0000061232695,0.00013125889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989158,0.000093485556,0.00022278194,0.0002668399,0.00023781904,0.00026329624],"domain_scores_gemma":[0.99949175,0.000029951218,0.00003081732,0.00030314174,0.000061989645,0.000082353894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083255995,0.000083488434,0.000115613955,0.00016834449,0.00012308916,0.00026979006,0.00044369933,0.00006801406,0.000014144495],"category_scores_gemma":[0.000035471166,0.00007572098,0.00002706482,0.00040550734,0.000011728447,0.0004884011,0.00022053637,0.00031088328,0.000027885872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020765685,0.000022346883,0.00021779462,0.0000222361,0.0000028645034,0.00001297113,0.0010242625,0.83425534,0.004534914,0.15888554,0.000011667161,0.001007975],"study_design_scores_gemma":[0.00032913705,0.000010677875,0.000006203437,0.00002585949,5.0915395e-7,0.000017038665,0.00013632228,0.99870074,0.000027880105,0.00029649364,0.00034993782,0.00009918526],"about_ca_topic_score_codex":0.0003014445,"about_ca_topic_score_gemma":0.00007697933,"teacher_disagreement_score":0.5907593,"about_ca_system_score_codex":0.000049127175,"about_ca_system_score_gemma":0.00010743477,"threshold_uncertainty_score":0.3087812},"labels":[],"label_agreement":null},{"id":"W1553045544","doi":"10.1007/978-3-540-72792-7_24","title":"DINS, a MIP Improvement Heuristic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Solver; Heuristics; Computer science; Benchmark (surveying); Mathematical optimization; Neighbourhood (mathematics); Heuristic; Integer programming; Search tree; Algorithm; Mathematics; Search algorithm","score_opus":0.02662322317191979,"score_gpt":0.27321937636394344,"score_spread":0.24659615319202366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553045544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000076668,0.00025978344,0.9850357,0.0008233938,0.0014749866,0.00051434315,0.0000035744781,0.0002009184,0.011679638],"genre_scores_gemma":[0.028879717,0.00015580037,0.96176374,0.005580332,0.00057360146,0.000016637634,0.0000109877865,0.000058417667,0.0029607918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570465,0.00002320721,0.0005866263,0.0014782059,0.0013454937,0.0008618255],"domain_scores_gemma":[0.99745184,0.00032556205,0.00023563686,0.0013692314,0.00032025416,0.00029744607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001313799,0.00047329135,0.00042500132,0.0010354725,0.00026362282,0.0006887826,0.0033236938,0.000271591,0.000061843275],"category_scores_gemma":[0.00009886309,0.00042829337,0.00012158884,0.0007201186,0.00053039216,0.00047420367,0.0015532715,0.0008161713,0.00011851635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039659353,0.000042671203,0.00001732669,0.000045460238,0.000009368244,0.000114007424,0.00043128314,0.02636534,0.00009969963,0.04761256,0.00007282607,0.9251855],"study_design_scores_gemma":[0.0004084051,0.00040308642,0.00004103946,0.00029178834,0.0000052435594,0.000042844265,1.0871164e-7,0.8679409,0.000755814,0.1200059,0.009280665,0.00082419446],"about_ca_topic_score_codex":0.000021406608,"about_ca_topic_score_gemma":0.00005673467,"teacher_disagreement_score":0.9243613,"about_ca_system_score_codex":0.00036335379,"about_ca_system_score_gemma":0.0005774263,"threshold_uncertainty_score":0.9998169},"labels":[],"label_agreement":null},{"id":"W1555558392","doi":"10.1007/11930242_11","title":"A Fixed Structure Learning Automaton Micro-aggregation Technique for Secure Statistical Databases","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Automaton; Cellular automaton; Scheme (mathematics); Learning automata; Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Mathematics","score_opus":0.01717331659407111,"score_gpt":0.27487022260351857,"score_spread":0.25769690600944745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555558392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008676473,0.00011272354,0.99689054,0.00040694495,0.00048592853,0.0012564387,0.00010924679,0.0002943413,0.00043512843],"genre_scores_gemma":[0.010316818,0.0000151570775,0.98821145,0.00042975563,0.00022978694,0.00004502548,0.00026398757,0.000043670316,0.0004443277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965189,0.000069799025,0.0005356589,0.0014275387,0.00078423583,0.00066388334],"domain_scores_gemma":[0.99763507,0.00069309276,0.000305953,0.0008184242,0.0003927948,0.000154667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070825673,0.00048415488,0.00046102796,0.0007297384,0.00042161468,0.00061646657,0.0017324683,0.00031695532,0.00003804315],"category_scores_gemma":[0.00022768223,0.00044940953,0.00008852991,0.0005181297,0.00044394043,0.0006403704,0.0007398735,0.0009374344,0.0000076288106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002127073,0.000065040615,0.00014143722,0.00043656147,0.000024970068,0.00008557099,0.0007751594,0.4967178,0.0062302803,0.1503006,0.0011665628,0.3440347],"study_design_scores_gemma":[0.00034762805,0.0001907184,0.000035468616,0.00043593583,0.000007289954,0.00007320324,1.2656088e-7,0.91145015,0.010506534,0.06954125,0.006766574,0.00064511836],"about_ca_topic_score_codex":0.000027062557,"about_ca_topic_score_gemma":0.000051513736,"teacher_disagreement_score":0.41473234,"about_ca_system_score_codex":0.000242004,"about_ca_system_score_gemma":0.00061188074,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W1563914202","doi":"10.1007/11947950_1","title":"Distributed Security Algorithms by Mobile Agents","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Natural computing; Theoretical computer science; Mobile computing; Computer network","score_opus":0.013383201721492401,"score_gpt":0.2554056648301265,"score_spread":0.2420224631086341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563914202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014022242,0.00035753747,0.9933901,0.00040518536,0.0009765642,0.0005998764,0.00008834124,0.00025401035,0.003914388],"genre_scores_gemma":[0.10823354,0.00039049322,0.8785286,0.005056748,0.0010759574,0.00013936432,0.0008006301,0.00016970006,0.0056049656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957481,0.00005040495,0.000541587,0.0015642542,0.0012866226,0.0008090383],"domain_scores_gemma":[0.9977406,0.00020128733,0.00024466857,0.0012407396,0.0003136157,0.00025907558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971618,0.0005119357,0.00046625774,0.0004654247,0.00030724358,0.0008182402,0.0034273136,0.00034632478,0.00006900813],"category_scores_gemma":[0.000036264195,0.00048319335,0.00012910368,0.0007996426,0.0005863462,0.0006553527,0.0013929408,0.0008183662,0.00007375593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004232957,0.00015393947,0.000055906585,0.00006557458,0.000021850157,0.00017295,0.00069987384,0.44068852,0.000052533844,0.0060026264,0.0114059895,0.540676],"study_design_scores_gemma":[0.00027950943,0.00013152817,0.000014314302,0.00010001251,0.0000033122424,0.000023154958,6.648119e-8,0.9345199,0.00043990515,0.040343817,0.023568256,0.0005762657],"about_ca_topic_score_codex":0.000060616483,"about_ca_topic_score_gemma":0.000021558699,"teacher_disagreement_score":0.54009974,"about_ca_system_score_codex":0.00046030642,"about_ca_system_score_gemma":0.00045746763,"threshold_uncertainty_score":0.999762},"labels":[],"label_agreement":null},{"id":"W1566553893","doi":"10.1007/3-540-45253-2_7","title":"Online Algorithms for Caching Multimedia Streams","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Cache; Cache algorithms; False sharing; Competitive analysis; CPU cache; The Internet; Computer network; Online algorithm; Metric (unit); Smart Cache; Algorithm; Parallel computing; Operating system; Upper and lower bounds","score_opus":0.029720099908789127,"score_gpt":0.2885864229711798,"score_spread":0.25886632306239066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566553893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000082593015,0.00023429074,0.9948446,0.0010456691,0.0010912938,0.0007354366,0.00004028158,0.00021399229,0.0017861833],"genre_scores_gemma":[0.0025132739,0.00012887502,0.99425465,0.0015306261,0.0005781535,0.000017975452,0.00005634356,0.00004261347,0.00087751023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.0000306561,0.00052268413,0.0014669863,0.0008644179,0.0007685402],"domain_scores_gemma":[0.9976323,0.00057851244,0.00019047577,0.0010775919,0.0002634439,0.00025766462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006987557,0.00047702706,0.00047188066,0.0007538969,0.000315792,0.0005811883,0.0030573916,0.00030156958,0.000054567983],"category_scores_gemma":[0.00009263684,0.00043326293,0.00015394036,0.0004630051,0.00041640765,0.0006260856,0.0006559148,0.00072405546,0.000032474596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002244481,0.000043561045,0.0000034689933,0.000015776151,0.0000062472363,0.000015339689,0.00038537433,0.16998653,0.000009943427,0.002570368,0.000022415721,0.82693875],"study_design_scores_gemma":[0.00039532283,0.00016016874,0.000009781531,0.00017979444,0.0000040552027,0.000020677184,1.005091e-7,0.9374744,0.00012962638,0.0556607,0.0054911072,0.0004742178],"about_ca_topic_score_codex":0.000034022676,"about_ca_topic_score_gemma":0.00008864229,"teacher_disagreement_score":0.82646453,"about_ca_system_score_codex":0.00020762425,"about_ca_system_score_gemma":0.0005811708,"threshold_uncertainty_score":0.9998119},"labels":[],"label_agreement":null},{"id":"W1568409091","doi":"10.1007/978-3-540-68825-9_31","title":"A Stochastic Point-Based Algorithm for POMDPs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Benchmark (surveying); Operator (biology); Bellman equation; Markov decision process; Mathematical optimization; Markov process; Mathematics","score_opus":0.022704779862040107,"score_gpt":0.25775837026379134,"score_spread":0.23505359040175122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568409091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1248123e-7,0.00029935484,0.99494636,0.0016080328,0.0010920983,0.0009582835,0.000013689518,0.0003138767,0.00076802075],"genre_scores_gemma":[0.00060265453,0.000031696007,0.99563646,0.0028805365,0.00037402337,0.00004154162,0.000012406188,0.000040379487,0.00038032152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961838,0.000030023524,0.00048482444,0.0014739749,0.0009998071,0.0008275618],"domain_scores_gemma":[0.9971766,0.00068231305,0.00022566556,0.001158151,0.00049648876,0.00026077617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007539514,0.0004852218,0.0004810479,0.0009851076,0.000386038,0.00046330565,0.0029863229,0.00028544833,0.000020476888],"category_scores_gemma":[0.000080342885,0.0004537412,0.00018600559,0.00059730187,0.00049996056,0.0005023985,0.0006162832,0.0005650781,0.00004133346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002563712,0.000030387755,3.764088e-7,0.00002119278,0.0000071856393,0.00002684459,0.00034680916,0.14106461,0.0000050248877,0.0032892325,0.0001402355,0.8550655],"study_design_scores_gemma":[0.0005510624,0.00027183953,0.0000018119271,0.00016062436,0.0000041366843,0.000045115525,4.2421473e-8,0.9716779,0.00011314348,0.023007916,0.0036545496,0.0005118617],"about_ca_topic_score_codex":0.0000069825505,"about_ca_topic_score_gemma":0.000009590131,"teacher_disagreement_score":0.8545537,"about_ca_system_score_codex":0.00029099666,"about_ca_system_score_gemma":0.0013101122,"threshold_uncertainty_score":0.99979144},"labels":[],"label_agreement":null},{"id":"W1573954828","doi":"10.1007/11561071_29","title":"Cache-Oblivious Comparison-Based Algorithms on Multisets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache algorithms; Block (permutation group theory); CPU cache; Randomized algorithm; Context (archaeology); Cache-oblivious algorithm; Factor (programming language); Block size; Constant (computer programming); Algorithm; Upper and lower bounds; Parallel computing; Mathematics; Key (lock); Combinatorics","score_opus":0.03047518635121663,"score_gpt":0.28839035740204444,"score_spread":0.2579151710508278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573954828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000098913015,0.00024876976,0.9892107,0.0022711284,0.0012733699,0.00060142035,0.000009814511,0.00033634796,0.0060385326],"genre_scores_gemma":[0.07806682,0.000040494644,0.9144721,0.0058311457,0.00054411363,0.00002213192,0.000021652637,0.00006382328,0.0009377329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946288,0.000073646566,0.0006905333,0.0018701492,0.0017010815,0.0010357915],"domain_scores_gemma":[0.99658597,0.0006738345,0.00032394798,0.0017061837,0.00034350812,0.00036655966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010453428,0.0006645853,0.0006596304,0.0012951302,0.00039629373,0.00082962395,0.0039608134,0.00039904326,0.000097925804],"category_scores_gemma":[0.00010194534,0.0006084444,0.00017106302,0.00078316807,0.0006522019,0.00045985822,0.00089097384,0.0012710115,0.0003087443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037468324,0.00007686049,0.000026433025,0.000013087765,0.0000052578034,0.00003800772,0.00027791457,0.5019386,0.000008913331,0.004247311,0.00010327555,0.4932606],"study_design_scores_gemma":[0.0005424886,0.00029941747,0.000063693355,0.00026958785,0.0000039153824,0.000013367469,7.555534e-8,0.9861614,0.00053269626,0.006117547,0.005305945,0.00068985973],"about_ca_topic_score_codex":0.000026419195,"about_ca_topic_score_gemma":0.000089724155,"teacher_disagreement_score":0.49257073,"about_ca_system_score_codex":0.00047150228,"about_ca_system_score_gemma":0.00092938123,"threshold_uncertainty_score":0.9996367},"labels":[],"label_agreement":null},{"id":"W1577356920","doi":"10.1007/978-3-540-73545-8_38","title":"An Improved Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Cluster analysis; Computer science; Partition (number theory); Online algorithm; Dimension (graph theory); Upper and lower bounds; Algorithm; Randomized algorithm; Sequence (biology); Unit (ring theory); Combinatorics; Mathematics; Artificial intelligence","score_opus":0.04442696935424467,"score_gpt":0.3146518800575907,"score_spread":0.27022491070334603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577356920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030552599,0.00009485657,0.9966551,0.00034701597,0.0012478459,0.000751084,0.000022755676,0.00023746687,0.00064083224],"genre_scores_gemma":[0.0004869871,0.00002956084,0.99644977,0.0019181957,0.00052788155,0.000010214445,0.000038721904,0.00004123124,0.0004974413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965491,0.000027708182,0.0005281097,0.0014070614,0.0006736595,0.0008143264],"domain_scores_gemma":[0.9973382,0.00034817765,0.00021833928,0.0012677376,0.00051964575,0.00030791713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013483585,0.00044641833,0.00041718018,0.0009616802,0.00029765724,0.00069185084,0.003413003,0.00032922713,0.00001709325],"category_scores_gemma":[0.00005149441,0.00042184227,0.00011112486,0.0005850099,0.0003773981,0.0008253335,0.00085849396,0.0006464061,0.0000084646135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029578077,0.00003821274,0.0000016483342,0.000020010672,0.000004973948,0.000012123243,0.00021950102,0.051980205,0.00007134671,0.0017881255,0.000003279481,0.94585764],"study_design_scores_gemma":[0.0003965703,0.00038535488,0.00001103765,0.00011533061,0.000003300103,0.000025317246,1.6186763e-7,0.9757868,0.00022763295,0.019700255,0.002853055,0.00049516384],"about_ca_topic_score_codex":0.000020668058,"about_ca_topic_score_gemma":0.00022927446,"teacher_disagreement_score":0.94536245,"about_ca_system_score_codex":0.00017679,"about_ca_system_score_gemma":0.0005027739,"threshold_uncertainty_score":0.99982333},"labels":[],"label_agreement":null},{"id":"W1580603885","doi":"","title":"Mobile Facility Location","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Facility location problem; Engineering; Operations research","score_opus":0.03474948807836565,"score_gpt":0.26069029442504194,"score_spread":0.2259408063466763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580603885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019243385,0.00001892066,0.9775988,0.00013463991,0.000038849706,0.0000849167,2.3990302e-7,0.00015555201,0.020043751],"genre_scores_gemma":[0.9232451,0.000031352247,0.06861044,0.00029120265,0.0000058575583,0.000017583572,0.000002370806,8.5588033e-7,0.0077952784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962074,0.000019120771,0.000062436324,0.00011213348,0.00010744867,0.000078147496],"domain_scores_gemma":[0.9996534,0.000008850817,0.00000902527,0.00020707067,0.00008039052,0.000041244806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007828637,0.000027134176,0.000029311623,0.000023207274,0.00007543585,0.000020447875,0.00019748542,0.0000138491205,0.00011428747],"category_scores_gemma":[0.000010900627,0.000022712831,0.000010328366,0.00021248694,0.000020301944,0.00025521393,0.000050089264,0.000027875178,0.00044343818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009143905,0.00086520123,0.017053917,0.00006182809,0.000027422418,0.00003164125,0.016539495,0.14001477,0.0013761446,0.3684077,0.11269028,0.34292245],"study_design_scores_gemma":[0.00032676506,0.00014103719,0.00383484,0.0000021192513,3.9243537e-7,0.000024773819,0.000031345244,0.9133835,0.0025788238,0.0015158522,0.07798081,0.00017977151],"about_ca_topic_score_codex":0.000012782374,"about_ca_topic_score_gemma":0.0000012451551,"teacher_disagreement_score":0.92132074,"about_ca_system_score_codex":0.000009955639,"about_ca_system_score_gemma":0.000040455867,"threshold_uncertainty_score":0.5699648},"labels":[],"label_agreement":null},{"id":"W1581952794","doi":"10.1007/11424918_49","title":"Real-Time Decision Making for Large POMDPs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Time complexity; Machine learning; Algorithm","score_opus":0.020460163069960756,"score_gpt":0.2921280880127875,"score_spread":0.27166792494282677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581952794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000080952295,0.000115732255,0.99012166,0.0007178987,0.00082765793,0.00074082013,0.000010644712,0.0003219321,0.007135553],"genre_scores_gemma":[0.0042939633,0.0001101937,0.99288744,0.0012096136,0.000506316,0.000016890643,0.000007105026,0.000040840987,0.00092765986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960271,0.000028911381,0.00055141706,0.0014815356,0.0010324293,0.0008785946],"domain_scores_gemma":[0.99697524,0.0009463298,0.00024851577,0.0012556796,0.000395196,0.00017904287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015149437,0.00044021456,0.00046389623,0.00088485685,0.00040053276,0.00078208843,0.003299877,0.00032551956,0.00008830322],"category_scores_gemma":[0.0001414032,0.0004036632,0.00016551735,0.0005443854,0.0001548032,0.0007443628,0.0013709079,0.00046737806,0.00013160551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109622,0.000053911524,0.000007994901,0.000032263724,0.000009697145,0.000022253435,0.00069003616,0.057637773,0.000072410854,0.07839555,0.00026614234,0.862801],"study_design_scores_gemma":[0.00036222962,0.00013191366,0.00001595957,0.00034442876,0.000003741805,0.0000216271,4.3297142e-8,0.88345754,0.000080054364,0.10434662,0.010784959,0.00045087867],"about_ca_topic_score_codex":0.0000022142667,"about_ca_topic_score_gemma":0.00002057057,"teacher_disagreement_score":0.8623501,"about_ca_system_score_codex":0.00033986376,"about_ca_system_score_gemma":0.0005556378,"threshold_uncertainty_score":0.9998415},"labels":[],"label_agreement":null},{"id":"W1583311479","doi":"10.1007/3-540-46506-5_10","title":"Parallel Job Scheduling: A Performance Perspective","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Multiprocessing; Scheduling (production processes); Parallel computing; Distributed computing; Perspective (graphical); Range (aeronautics); Software; Multiprocessor scheduling; Dynamic priority scheduling; Two-level scheduling; Operating system; Mathematical optimization; Artificial intelligence","score_opus":0.02235564977128326,"score_gpt":0.26122483651582196,"score_spread":0.2388691867445387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583311479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000568743,0.00039840076,0.94134974,0.0015517507,0.0005975892,0.00042314397,0.0000020269586,0.00022734108,0.055393115],"genre_scores_gemma":[0.07110862,0.0006843754,0.9235063,0.0022903844,0.00040877663,0.000019208326,0.000003665959,0.000048618946,0.0019300539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591565,0.000038855804,0.00045899802,0.0016393174,0.0011463636,0.00080078514],"domain_scores_gemma":[0.9976686,0.00018622843,0.00017537788,0.0012912313,0.0004238826,0.00025466186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070381444,0.00051152456,0.00046416218,0.00091125444,0.00038321692,0.0007272268,0.0035608006,0.0003003441,0.00013712667],"category_scores_gemma":[0.000057863104,0.00047144177,0.00013227285,0.00079580204,0.00071893935,0.000975527,0.000897355,0.0010750837,0.00024229137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011192438,0.000033702785,0.00006380763,0.000024488605,0.000013427377,0.000049891274,0.0018182864,0.51449656,0.00001291236,0.13225177,0.000019335786,0.35120463],"study_design_scores_gemma":[0.00029352636,0.00017724333,0.00012148881,0.00021545778,0.000003157747,0.00005143016,3.5799567e-7,0.87963426,0.000045716606,0.11763382,0.0012716016,0.00055193715],"about_ca_topic_score_codex":0.000022155566,"about_ca_topic_score_gemma":0.00002445862,"teacher_disagreement_score":0.3651377,"about_ca_system_score_codex":0.0004389869,"about_ca_system_score_gemma":0.0009153238,"threshold_uncertainty_score":0.99977374},"labels":[],"label_agreement":null},{"id":"W1585579633","doi":"10.1007/978-3-540-74466-5_65","title":"A Decentralized Solution for Locating Mobile Agents","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Tree traversal; Mobile agent; Distributed computing; Path (computing); Tracking (education); Task (project management); Computer network; Artificial intelligence; Algorithm","score_opus":0.049261638637743486,"score_gpt":0.31638860147827047,"score_spread":0.267126962840527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585579633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069380517,0.00029164055,0.99525505,0.0003166269,0.0011561238,0.0011249932,0.00000398148,0.00016807622,0.0016765794],"genre_scores_gemma":[0.008550384,0.00008269614,0.9889792,0.0015713235,0.00021054891,0.000045709046,0.000014187128,0.000031512707,0.0005144419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966665,0.000025519335,0.0005096883,0.0011515603,0.0008193099,0.0008274066],"domain_scores_gemma":[0.9979361,0.00038773863,0.00024662653,0.0008111546,0.0004104813,0.00020789447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001419239,0.00035182716,0.0003527422,0.00068362284,0.00034312392,0.00049351266,0.00214334,0.00026218902,0.000030278565],"category_scores_gemma":[0.00011452989,0.0003378212,0.00012812644,0.0005641509,0.0003398916,0.00051158754,0.00069396757,0.00041589787,0.000027745024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067921433,0.000029724686,0.000011425494,0.000048581704,0.000007455673,0.00001093229,0.0006453579,0.10686525,0.00006719428,0.013473058,0.00006921962,0.878765],"study_design_scores_gemma":[0.0004237664,0.00015456259,0.000009230437,0.0001910092,0.000003539671,0.000014553065,1.0036548e-7,0.9576231,0.0004325933,0.033460002,0.0073099085,0.00037760797],"about_ca_topic_score_codex":0.00001318444,"about_ca_topic_score_gemma":0.00004382293,"teacher_disagreement_score":0.8783874,"about_ca_system_score_codex":0.00034319836,"about_ca_system_score_gemma":0.00047780375,"threshold_uncertainty_score":0.9999074},"labels":[],"label_agreement":null},{"id":"W1586507268","doi":"10.1007/978-3-642-12450-1_10","title":"Parameterized Analysis of Paging and List Update Algorithms","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Parameterized complexity; Locality; Cache; Locality of reference; Algorithm; Online algorithm; Set (abstract data type); Cache algorithms; Working set; Memory hierarchy; CPU cache; Theoretical computer science; Parallel computing","score_opus":0.017475784857701803,"score_gpt":0.2632109931213892,"score_spread":0.2457352082636874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586507268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017701533,0.00015531742,0.99757916,0.00064676086,0.00046702434,0.00021407123,0.000008831016,0.00007107269,0.0006807513],"genre_scores_gemma":[0.047608197,0.00015582344,0.9511716,0.0008265052,0.00006566203,0.0000045012657,0.000011942465,0.00001723827,0.0001385823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719924,0.00003881305,0.00050147646,0.001102275,0.0007390654,0.00041910924],"domain_scores_gemma":[0.9978235,0.00034018952,0.00030457127,0.0010806095,0.00027422333,0.00017694144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010017679,0.00032415305,0.0006603852,0.0017690966,0.00016832641,0.0005192497,0.0019021922,0.00023674648,0.000046634836],"category_scores_gemma":[0.000078663994,0.0002881458,0.00014083553,0.0015195194,0.0008744963,0.0004509516,0.0011699969,0.0006659786,0.000003972703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062047307,0.00004005701,0.00027583705,0.000051116276,0.00017993724,0.00004205393,0.0013139489,0.057171203,0.0012515086,0.020415494,0.0000041296503,0.9192485],"study_design_scores_gemma":[0.0001799433,0.0000550472,0.00014221454,0.00006465296,0.00004600452,0.000009346565,7.54126e-8,0.9720691,0.0008646017,0.025624836,0.0006189483,0.00032523673],"about_ca_topic_score_codex":0.00003388395,"about_ca_topic_score_gemma":0.00007908395,"teacher_disagreement_score":0.91892326,"about_ca_system_score_codex":0.0000475874,"about_ca_system_score_gemma":0.00021305647,"threshold_uncertainty_score":0.9999571},"labels":[],"label_agreement":null},{"id":"W1588435642","doi":"","title":"Exact Algorithms for the Canadian Traveller Problem on Paths and Trees","year":2008,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Traverse; Generalization; Approximation algorithm; Combinatorics; Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Exact solutions in general relativity; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.032464090857766255,"score_gpt":0.2568305085769395,"score_spread":0.22436641771917326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588435642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018632174,0.0022438776,0.7205409,0.22983167,0.0016686505,0.005882207,0.00025294765,0.0015276709,0.019419944],"genre_scores_gemma":[0.7558887,0.0006282569,0.24061912,0.00073664356,0.00005052648,0.000249167,0.000010677818,0.000029937448,0.0017869917],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984135,0.000022284723,0.00028022917,0.0004799948,0.00029275607,0.0005112079],"domain_scores_gemma":[0.9986921,0.00006995721,0.00012782481,0.0007649617,0.00017762877,0.00016752028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028489227,0.0002291719,0.00026562207,0.0006411384,0.0007760958,0.000072551746,0.0010904025,0.0002960685,0.000008541129],"category_scores_gemma":[0.00012763754,0.00016834169,0.000078852645,0.0007909318,0.00068953115,0.0003332676,0.00014856295,0.00033127933,0.000010240558],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040193892,0.00036723478,0.0047411527,0.00010396997,0.0003930169,0.00014393272,0.0032150282,0.006425051,0.0007323699,0.47232372,0.028507877,0.48300645],"study_design_scores_gemma":[0.0019852405,0.000783676,0.003545968,0.00010378884,0.000027855738,0.00012932863,0.00010383064,0.08968392,0.0033869306,0.005216583,0.89440715,0.00062573294],"about_ca_topic_score_codex":0.002317146,"about_ca_topic_score_gemma":0.019715602,"teacher_disagreement_score":0.86589926,"about_ca_system_score_codex":0.000095977506,"about_ca_system_score_gemma":0.00043844056,"threshold_uncertainty_score":0.99817204},"labels":[],"label_agreement":null},{"id":"W1591135906","doi":"10.1007/978-3-540-77891-2_19","title":"On Certain New Models for Paging with Locality of Reference","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Locality; Paging; Computer science; Locality of reference; Competitive analysis; Context (archaeology); Metric (unit); Reference model; Algorithm; Theoretical computer science; Mathematics; Upper and lower bounds; Engineering","score_opus":0.05689773143409504,"score_gpt":0.2729436992893933,"score_spread":0.21604596785529828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591135906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011571287,0.00009645095,0.99423856,0.00069463754,0.00019487385,0.0005647353,0.0000061417745,0.00008267746,0.004110346],"genre_scores_gemma":[0.07346183,0.000079653335,0.9243825,0.0012637074,0.000090271285,0.000011029512,0.0000074326003,0.000029030394,0.00067455217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695307,0.000028801554,0.00042521878,0.0011479431,0.0009410725,0.00050386885],"domain_scores_gemma":[0.9974945,0.00055564614,0.0002643009,0.001088246,0.00039806654,0.00019920962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052889826,0.00036302346,0.00045928886,0.0005353298,0.00018041291,0.00017385876,0.0022418746,0.00018913829,0.000008615106],"category_scores_gemma":[0.000058218062,0.00028848572,0.000076762895,0.00048399772,0.00049556966,0.0004952516,0.00043560922,0.00048040538,0.000004347542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017926015,0.000020913089,0.0000037478246,0.000034842444,0.0000059552767,0.000008278338,0.00053867005,0.72052824,0.000007792401,0.10199192,0.00007160335,0.17677009],"study_design_scores_gemma":[0.00032907526,0.00036080473,0.000004754882,0.0003157835,0.000002213012,0.0000130869485,6.7697485e-8,0.78205925,0.0003383001,0.21585347,0.00043340967,0.00028975398],"about_ca_topic_score_codex":0.000054460153,"about_ca_topic_score_gemma":0.00005712646,"teacher_disagreement_score":0.17648034,"about_ca_system_score_codex":0.00014799666,"about_ca_system_score_gemma":0.0011429507,"threshold_uncertainty_score":0.9999567},"labels":[],"label_agreement":null},{"id":"W1592266906","doi":"10.1007/978-3-642-14162-1_42","title":"Tell Me Where I Am So I Can Meet You Sooner","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Université du Québec à Montréal","funders":"","keywords":"Rendezvous; Computer science; Asynchronous communication; Visibility; Bounded function; Plane (geometry); Multi-agent system; Position (finance); Algorithm; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.01581950816149603,"score_gpt":0.24394778007968862,"score_spread":0.2281282719181926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592266906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002377876,0.000342129,0.9833186,0.0043376735,0.0022885844,0.0004976806,0.000009508869,0.00028494402,0.008897072],"genre_scores_gemma":[0.017525062,0.00022356368,0.9708019,0.004468754,0.0008963156,0.00002131596,0.0000137345705,0.000091725255,0.0059576645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950596,0.000054172353,0.00058238796,0.0018557053,0.001455881,0.00099227],"domain_scores_gemma":[0.9966027,0.00027516962,0.00028332823,0.0019776367,0.00045380683,0.00040732854],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010715943,0.00063258654,0.00057062606,0.00085680047,0.00055769243,0.001553164,0.0050083227,0.00057925965,0.00016857758],"category_scores_gemma":[0.00009004392,0.00055316143,0.0001639504,0.00074815756,0.0012812862,0.0006777216,0.0018872216,0.0015099775,0.00011822642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011703548,0.00015605724,0.00021618362,0.00016700957,0.000049419265,0.0002868567,0.0069745197,0.11975214,0.0020902348,0.14797676,0.00076073024,0.7215584],"study_design_scores_gemma":[0.00048781704,0.00023394608,0.000042869902,0.00033754102,0.000009577788,0.00010648559,3.2882485e-7,0.7927067,0.0021858362,0.15647642,0.045975015,0.0014374233],"about_ca_topic_score_codex":0.00007369712,"about_ca_topic_score_gemma":0.0009779439,"teacher_disagreement_score":0.72012097,"about_ca_system_score_codex":0.00020967225,"about_ca_system_score_gemma":0.0012165449,"threshold_uncertainty_score":0.99969196},"labels":[],"label_agreement":null},{"id":"W1593308833","doi":"10.1007/978-3-642-13036-6_13","title":"Secretary Problems via Linear Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Secretary problem; Linear programming; Context (archaeology); Set (abstract data type); Polytope; Order (exchange); Mathematical optimization; Common value auction; Operations research; Algorithm; Programming language; Mathematics; Optimal stopping","score_opus":0.018958559996648274,"score_gpt":0.25072657685951816,"score_spread":0.23176801686286988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593308833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008561069,0.00019183353,0.99245995,0.0014921218,0.0015308571,0.000838225,0.0000022231052,0.0003707125,0.0031055063],"genre_scores_gemma":[0.006367807,0.00005045147,0.9909204,0.0011726747,0.00048619005,0.000024186624,0.000014313683,0.00005003666,0.00091390713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546117,0.000040583778,0.0005991942,0.0016861341,0.0012854027,0.0009274986],"domain_scores_gemma":[0.9971334,0.00019840921,0.00027929767,0.0015867857,0.00046285536,0.0003392875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012596021,0.0005632737,0.0004991547,0.0008827765,0.000396823,0.00081240473,0.004007978,0.0005261382,0.00008160944],"category_scores_gemma":[0.000067700756,0.0005055268,0.00015057356,0.00082519447,0.00084661075,0.00091784954,0.001690924,0.0019108927,0.000119474316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002227085,0.000042133084,0.000023835786,0.00007067839,0.000010620487,0.00006231264,0.001019568,0.06364529,0.00040622175,0.007031662,0.000007374784,0.92767805],"study_design_scores_gemma":[0.00022012852,0.00017740099,0.00000813142,0.0002284678,0.000004224746,0.000083704435,5.5839646e-8,0.90303874,0.0007020946,0.08079757,0.014086258,0.0006532214],"about_ca_topic_score_codex":0.000023909784,"about_ca_topic_score_gemma":0.00011869748,"teacher_disagreement_score":0.92702484,"about_ca_system_score_codex":0.0001439366,"about_ca_system_score_gemma":0.0006419509,"threshold_uncertainty_score":0.99973965},"labels":[],"label_agreement":null},{"id":"W1594260854","doi":"10.1007/978-3-540-24677-0_26","title":"Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem","year":2004,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Yen's algorithm; Algorithm; Widest path problem; Floyd–Warshall algorithm; Learning automata; Graph; Euclidean shortest path; Constrained Shortest Path First; Automaton; Dijkstra's algorithm; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.017924304915619162,"score_gpt":0.2598657693234213,"score_spread":0.24194146440780215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594260854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016292681,0.00027390505,0.9946892,0.0019325716,0.0008272458,0.0016060724,0.000007149359,0.0004860285,0.00017616696],"genre_scores_gemma":[0.025215473,0.000008662796,0.97100294,0.0014151211,0.0002698019,0.00015967828,0.00004278598,0.0000772796,0.0018082769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547195,0.00009698088,0.0005715118,0.0015589718,0.0012467558,0.0010538077],"domain_scores_gemma":[0.9959772,0.0018384459,0.00034897905,0.0012074552,0.00042742668,0.0002004901],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016403359,0.0005550021,0.00047810166,0.0005978335,0.00089344993,0.0014202911,0.0042482098,0.00028151402,0.0000069841203],"category_scores_gemma":[0.00028204705,0.00042062261,0.0001816751,0.0013954121,0.00080278335,0.00048206374,0.0008696707,0.0011194466,0.000014521712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002401233,0.00005063347,0.0000013489284,0.000033615965,0.000006151826,0.0000053009444,0.0005464471,0.7150054,0.000014285511,0.00026382972,0.00002024271,0.28405035],"study_design_scores_gemma":[0.00056244707,0.00046967054,0.000010080636,0.00045287595,0.00001117357,0.000025988362,4.7155675e-7,0.98245966,0.000042367727,0.013483776,0.0019647693,0.00051673775],"about_ca_topic_score_codex":0.000014583779,"about_ca_topic_score_gemma":0.00003849635,"teacher_disagreement_score":0.2835336,"about_ca_system_score_codex":0.0013105611,"about_ca_system_score_gemma":0.004593493,"threshold_uncertainty_score":0.9998246},"labels":[],"label_agreement":null},{"id":"W1600549686","doi":"10.1007/11564751_110","title":"Scheduling with Uncertain Start Dates","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Tuple; Mathematical optimization; Schedule; Job shop scheduling; Sample (material); Operations research; Mathematics","score_opus":0.02581523720451846,"score_gpt":0.2610899292324612,"score_spread":0.23527469202794277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600549686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022010887,0.00029491354,0.9903998,0.0022446052,0.00039588058,0.00037568828,0.000003143547,0.00022007203,0.006043919],"genre_scores_gemma":[0.015825946,0.00008606352,0.9805581,0.002075656,0.00032813344,0.000008845063,0.0000089563155,0.00003586308,0.0010724532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621266,0.000033996483,0.00040969305,0.0014380779,0.0011676236,0.00073794136],"domain_scores_gemma":[0.9976753,0.00027170073,0.00020209374,0.0012731322,0.0003399608,0.00023783726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008305004,0.00047074805,0.00041429387,0.00075188297,0.0002961202,0.00087957433,0.0030801638,0.00021406714,0.00006597284],"category_scores_gemma":[0.000051488896,0.0003772475,0.00006743329,0.0007429012,0.0006354821,0.00096807384,0.0009798304,0.00081981655,0.00007779706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047491076,0.000020221558,0.000036890913,0.000020084815,0.000008985844,0.000052778665,0.00045311518,0.65120316,0.000026009964,0.025676249,0.000014487264,0.32248327],"study_design_scores_gemma":[0.0003012507,0.00019769055,0.000014027226,0.0003413275,0.0000037830644,0.000050554838,1.9480426e-7,0.9664493,0.0003865555,0.026997842,0.0046696262,0.0005878458],"about_ca_topic_score_codex":0.00001648436,"about_ca_topic_score_gemma":0.0001013564,"teacher_disagreement_score":0.32189542,"about_ca_system_score_codex":0.00024793347,"about_ca_system_score_gemma":0.00088172307,"threshold_uncertainty_score":0.9998679},"labels":[],"label_agreement":null},{"id":"W1602680134","doi":"10.1007/978-3-642-29116-6_13","title":"A New Perspective on List Update: Probabilistic Locality and Working Set","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Locality; Working set; Property (philosophy); Set (abstract data type); Perspective (graphical); Probabilistic logic; Context (archaeology); Theoretical computer science; Algorithm; Locality of reference; Data mining; Artificial intelligence; Parallel computing","score_opus":0.03294439704847021,"score_gpt":0.2807151596800382,"score_spread":0.24777076263156797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602680134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008492821,0.00061499595,0.98905385,0.0028393774,0.00068387686,0.00048821527,0.0000029175299,0.00014136583,0.0061669373],"genre_scores_gemma":[0.19674778,0.00020582732,0.7961034,0.0048346766,0.00096160575,0.00001406034,0.000008836667,0.000059053426,0.0010647642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966971,0.00006236346,0.000343654,0.0013860787,0.0008567875,0.00065400364],"domain_scores_gemma":[0.99784404,0.00037007596,0.00017924375,0.0009903845,0.00023509556,0.00038115907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009377858,0.00043074216,0.00039628483,0.0004991499,0.00027531738,0.0008270571,0.00173984,0.00023948109,0.000055794026],"category_scores_gemma":[0.00014525847,0.00037679932,0.000068499845,0.0005692861,0.0005890305,0.00049164233,0.0011706472,0.00085726444,0.00004343891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001008073,0.000030077039,0.00006651702,0.00003067828,0.00001059941,0.000024000954,0.0024997795,0.03033859,0.000005418639,0.4165588,0.00010568436,0.5503198],"study_design_scores_gemma":[0.00037884014,0.00021764789,0.000119172924,0.00048454647,0.000008678997,0.000055832657,8.8075194e-7,0.54346186,0.00007417602,0.44899613,0.005423458,0.0007787851],"about_ca_topic_score_codex":0.000075065975,"about_ca_topic_score_gemma":0.00010335628,"teacher_disagreement_score":0.549541,"about_ca_system_score_codex":0.0005203941,"about_ca_system_score_gemma":0.00060758466,"threshold_uncertainty_score":0.9998684},"labels":[],"label_agreement":null},{"id":"W1605516979","doi":"10.1007/978-3-642-14165-2_16","title":"Faster Algorithms for Semi-matching Problems (Extended Abstract)","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Matching (statistics); Theoretical computer science; Mathematics","score_opus":0.028262169147844112,"score_gpt":0.27737858354945577,"score_spread":0.24911641440161167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605516979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012928695,0.00012587452,0.9912228,0.00142466,0.002182561,0.0012020505,0.000013661273,0.00025899784,0.00355645],"genre_scores_gemma":[0.010723439,0.000042594398,0.9851084,0.0017280431,0.0005895434,0.00006150133,0.000020347923,0.00006838177,0.0016577886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995383,0.000021326505,0.0007091964,0.0017933926,0.0011091728,0.0009839075],"domain_scores_gemma":[0.9968448,0.00056132115,0.0003695968,0.0014078572,0.0005148316,0.0003015833],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014814761,0.00060622144,0.000566767,0.00081766065,0.0004696457,0.0012800955,0.00375274,0.0005443969,0.00006761834],"category_scores_gemma":[0.00008972427,0.0005403374,0.00019896784,0.0004450678,0.0005484224,0.0010573892,0.0011322467,0.0014681024,0.000047867667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062306126,0.000073097784,0.0000052297914,0.00016877339,0.000021119398,0.00003071046,0.0023495492,0.11722929,0.0014881783,0.022814536,0.00004179857,0.8557715],"study_design_scores_gemma":[0.00046259697,0.00016570199,0.00002453724,0.0003372062,0.000005461963,0.00005007238,2.2052433e-7,0.68424094,0.0012807561,0.30389178,0.008770638,0.000770096],"about_ca_topic_score_codex":0.00002081768,"about_ca_topic_score_gemma":0.00011040367,"teacher_disagreement_score":0.8550014,"about_ca_system_score_codex":0.00017091469,"about_ca_system_score_gemma":0.0006510854,"threshold_uncertainty_score":0.9997567},"labels":[],"label_agreement":null},{"id":"W163770788","doi":"10.1007/978-3-642-33651-5_24","title":"Position Discovery for a System of Bouncing Robots","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Position (finance); Bang-bang robot; Mobile robot; Computer science; Point (geometry); Algorithm; Artificial intelligence; Computer vision; Robot control; Control theory (sociology); Mathematics; Control (management); Geometry","score_opus":0.022518641598899238,"score_gpt":0.2526001113165232,"score_spread":0.23008146971762397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163770788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019394698,0.00042012337,0.9961518,0.00027944244,0.0011216444,0.00061449915,0.000010016919,0.000091903195,0.0012911687],"genre_scores_gemma":[0.2343419,0.00002903682,0.76452196,0.00035066422,0.00036930732,0.000023422555,0.000012081351,0.00003067422,0.0003209612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750775,0.000028510965,0.00046863,0.00074431166,0.00074695045,0.000503817],"domain_scores_gemma":[0.99808544,0.00033137033,0.0003151953,0.000778489,0.0003691026,0.00012039745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010743997,0.00028244389,0.0004063513,0.0005517776,0.00018178465,0.0004139773,0.0015945183,0.00019436644,0.0000032635041],"category_scores_gemma":[0.000049050926,0.00025224724,0.00013099401,0.0003585418,0.00026913334,0.0012035646,0.0005878065,0.00027026059,0.0000069002335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015101836,0.000051850606,0.000034013974,0.0006042272,0.000022540098,0.000010725468,0.0013899351,0.28395563,0.0012124506,0.41196206,0.000028608069,0.30071285],"study_design_scores_gemma":[0.00033966117,0.00020727832,0.000033150904,0.0010639644,0.000010698059,0.000048822487,3.901123e-7,0.9674079,0.0033103202,0.026838869,0.00028319465,0.00045578397],"about_ca_topic_score_codex":0.000012382336,"about_ca_topic_score_gemma":0.0000121274825,"teacher_disagreement_score":0.68345225,"about_ca_system_score_codex":0.0003601268,"about_ca_system_score_gemma":0.00046834713,"threshold_uncertainty_score":0.99999297},"labels":[],"label_agreement":null},{"id":"W1647172251","doi":"10.1109/icsmc.1999.812557","title":"A comparison of continuous and discretized pursuit learning schemes","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Indian Institute of Science","keywords":"Learning automata; Discretization; Computer science; Reinforcement learning; Automaton; Artificial intelligence; Action (physics); Class (philosophy); Term (time); Machine learning; Theoretical computer science; Mathematics","score_opus":0.02638279250675315,"score_gpt":0.31825700524902745,"score_spread":0.2918742127422743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1647172251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021491934,0.00016643596,0.93754184,0.00036506573,0.000032761112,0.000109052766,9.8959724e-8,0.00008506352,0.04020772],"genre_scores_gemma":[0.8514987,0.00001427303,0.14596967,0.00003760539,0.0000017600596,0.000002525358,4.2407893e-7,0.0000024211852,0.0024725953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999399,0.00007855951,0.00013660944,0.00012888128,0.0001429231,0.00011402174],"domain_scores_gemma":[0.99967706,0.0000557257,0.000047173045,0.00011214816,0.000055429835,0.000052483392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024356051,0.000047581925,0.00013053945,0.000041859235,0.000053300024,0.00008353793,0.00015752623,0.000021313357,0.000077932375],"category_scores_gemma":[0.00011534901,0.000038575803,0.000016480963,0.00014657844,0.000041286577,0.00014335471,0.0000675448,0.00007250295,0.000005634257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041948783,0.00008814612,0.04945072,0.000020667732,0.0000149323005,9.3506435e-7,0.0015787894,0.00062706065,0.003662322,0.92952424,0.0005272068,0.014500803],"study_design_scores_gemma":[0.0026233478,0.000570155,0.0028702558,0.00004810308,0.000008151243,0.00001239334,0.0012483029,0.85046554,0.037638266,0.00410484,0.09997759,0.00043305976],"about_ca_topic_score_codex":0.000005221669,"about_ca_topic_score_gemma":0.0000015236222,"teacher_disagreement_score":0.9254194,"about_ca_system_score_codex":0.0000031435297,"about_ca_system_score_gemma":0.00001931719,"threshold_uncertainty_score":0.15730755},"labels":[],"label_agreement":null},{"id":"W1655324574","doi":"10.1007/978-3-319-30139-6_6","title":"Optimal Distributed Searching in the Plane with and Without Uncertainty","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Visibility; Search and rescue; Drone; Robot; Task (project management); Plane (geometry); Artificial intelligence; Search problem; Algorithm; Mathematics","score_opus":0.017686002502897518,"score_gpt":0.2565475571251601,"score_spread":0.23886155462226258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1655324574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003276622,0.00008773921,0.9943827,0.0030540908,0.00012787699,0.00044966655,0.00001216234,0.000060090628,0.0014980389],"genre_scores_gemma":[0.5288227,0.00011426726,0.46828565,0.0021202266,0.00024331607,0.000027635202,0.000020168023,0.00003802889,0.0003280068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715316,0.00009199665,0.00028272482,0.000969163,0.0009173087,0.0005856424],"domain_scores_gemma":[0.9983224,0.00051391847,0.00012279447,0.0007879569,0.0001250196,0.0001278637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013701259,0.00032729423,0.00031113907,0.0004233209,0.00024191182,0.000705904,0.00224829,0.00013464817,0.000008685484],"category_scores_gemma":[0.000058828035,0.0001804143,0.000030582512,0.00047888036,0.00082756137,0.00047023018,0.0007211935,0.00073955103,0.000007125113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004635799,0.000047609694,0.0013923893,0.000057678415,0.000017339271,0.00017482856,0.0044835727,0.54281825,0.000038217953,0.06474583,0.00002518634,0.38615277],"study_design_scores_gemma":[0.0007386953,0.00031584222,0.00053861376,0.00058055983,0.0000033969482,0.0001904892,0.0000010819043,0.971096,0.000040456438,0.024874171,0.001105479,0.0005152318],"about_ca_topic_score_codex":0.000026348322,"about_ca_topic_score_gemma":0.00014463076,"teacher_disagreement_score":0.528495,"about_ca_system_score_codex":0.00012613052,"about_ca_system_score_gemma":0.00038608906,"threshold_uncertainty_score":0.7357082},"labels":[],"label_agreement":null},{"id":"W171011166","doi":"10.1007/978-3-642-27848-8_594-1","title":"Uniform Covering of Rings and Lines by Memoryless Mobile Sensors","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.008348345353350049,"score_gpt":0.22546899510173013,"score_spread":0.21712064974838008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171011166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000695179,0.0015333501,0.26667577,0.00014214145,0.00076559297,0.0008756587,0.00012283605,0.00016836077,0.72902113],"genre_scores_gemma":[0.0017143132,0.022044154,0.16500245,0.00011160094,0.00037340587,0.000037586185,0.000081066326,0.00013076386,0.8105047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839276,0.0000191397,0.0005155115,0.0004122613,0.00044215334,0.00021820074],"domain_scores_gemma":[0.99864894,0.0001337713,0.00038875395,0.00047070478,0.00022464081,0.0001331898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002922577,0.00026968456,0.00050855335,0.00018644612,0.00005012305,0.000036305737,0.0005556268,0.00020917384,0.000061013827],"category_scores_gemma":[0.000025029007,0.00025936397,0.00008695316,0.00006928371,0.00016426103,0.00018089336,0.00036421785,0.00023455506,0.000011093091],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035599493,0.00021844386,0.00019716083,0.0023579092,0.0004576635,0.00004523639,0.0069343485,0.010764042,0.00038850133,0.21344222,0.0141156735,0.7510432],"study_design_scores_gemma":[0.0011064938,0.00067656074,0.00004121271,0.00056568097,0.000050685445,0.00002579631,0.0000522789,0.12845656,0.0012868571,0.0058503808,0.8608112,0.0010763402],"about_ca_topic_score_codex":0.000034751985,"about_ca_topic_score_gemma":0.0000025708978,"teacher_disagreement_score":0.8466955,"about_ca_system_score_codex":0.00002065421,"about_ca_system_score_gemma":0.00007255503,"threshold_uncertainty_score":0.9999859},"labels":[],"label_agreement":null},{"id":"W1717727751","doi":"10.1016/j.dam.2015.07.036","title":"Contraction obstructions for connected graph searching","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mitacs; University of British Columbia","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Mathematics; Monotone polygon; Combinatorics; Connected component; Finite set; Bounded function; Discrete mathematics; Graph; Mixed graph; Strongly connected component; Induced subgraph; Contraction (grammar); Line graph; Voltage graph","score_opus":0.05334818489376948,"score_gpt":0.299537856910135,"score_spread":0.24618967201636555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717727751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001148484,0.000009844122,0.98494977,0.00046910284,0.00014811565,0.0006464099,0.000007224726,0.00027002936,0.012351008],"genre_scores_gemma":[0.1553358,0.0000060681014,0.8440547,0.00011655504,0.000050618848,0.00019151348,0.000029015313,0.000019045578,0.00019668526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990084,0.000015976811,0.00023873958,0.0002152001,0.00026819736,0.00025347708],"domain_scores_gemma":[0.9990094,0.00019655967,0.0001017956,0.00035024926,0.00017185319,0.00017017961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040892084,0.000109394896,0.0001533475,0.00010364663,0.00016668487,0.0002089959,0.00034581503,0.00005181698,0.000006948534],"category_scores_gemma":[0.00013926765,0.00009773372,0.00005144288,0.00029093184,0.000041160307,0.00026047142,0.00008108231,0.00011023641,0.000031945347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053292656,0.00004416929,0.000002151847,0.000039848124,0.000019463776,4.098905e-7,0.0019353313,0.0023872904,0.0013975183,0.9909111,0.00085972756,0.0023976376],"study_design_scores_gemma":[0.0011123891,0.000055932287,0.000013124662,0.000015995754,0.000012689686,0.000011885436,0.0011444277,0.54538524,0.0016615137,0.44762704,0.0027357265,0.00022404271],"about_ca_topic_score_codex":0.0000031605948,"about_ca_topic_score_gemma":0.00000273155,"teacher_disagreement_score":0.5432841,"about_ca_system_score_codex":0.00003390095,"about_ca_system_score_gemma":0.000069940244,"threshold_uncertainty_score":0.39854652},"labels":[],"label_agreement":null},{"id":"W1725687346","doi":"10.1007/s00453-011-9542-1","title":"Layered Working-Set Trees","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary search tree; Binary tree; Combinatorics; Element (criminal law); Mathematics; Upper and lower bounds; Amortized analysis; Multiplicative function; Theory of computation; Set (abstract data type); Ternary search tree; Tree (set theory); Search tree; Binary number; Data structure; Discrete mathematics; Logarithm; Computer science; Search algorithm; Algorithm; Tree structure; Interval tree; Arithmetic","score_opus":0.0813956022466798,"score_gpt":0.2568467713904636,"score_spread":0.17545116914378378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1725687346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003489546,0.000054473807,0.9482616,0.00066229515,0.0002930524,0.0001240018,0.0000014218941,0.00030821448,0.049945958],"genre_scores_gemma":[0.532722,0.000024274628,0.4645042,0.00061338674,0.00007710076,0.000019049747,0.000004082199,0.0000118325,0.002024086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.000045649573,0.000113124974,0.00023964258,0.00017005648,0.00024294476],"domain_scores_gemma":[0.99939716,0.000026700647,0.000037089587,0.00038699037,0.000047781992,0.000104261024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015006374,0.00008275829,0.00008756005,0.000076874385,0.000082735205,0.00007697998,0.0006977045,0.000042742,0.00019231455],"category_scores_gemma":[0.0000158184,0.00007394942,0.000039728704,0.00030812615,0.000033290915,0.00022648084,0.00017236367,0.0000918322,0.00031339124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013795937,0.00028163564,0.0013983132,0.000009027884,0.000075391246,0.000090444315,0.007946416,0.00023148165,0.00028682814,0.2571955,0.021781601,0.71068954],"study_design_scores_gemma":[0.0014640623,0.0003850411,0.0064825304,0.0000476788,0.000009370533,0.000051384613,0.00013483339,0.7982403,0.008502676,0.03261021,0.1512033,0.000868627],"about_ca_topic_score_codex":0.000028425338,"about_ca_topic_score_gemma":0.000007968317,"teacher_disagreement_score":0.7980088,"about_ca_system_score_codex":0.0000124634425,"about_ca_system_score_gemma":0.000033610042,"threshold_uncertainty_score":0.4028115},"labels":[],"label_agreement":null},{"id":"W1729082581","doi":"10.1023/a:1022985808959","title":"Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.06805300057024483,"score_gpt":0.3062754475526015,"score_spread":0.23822244698235667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729082581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014514449,0.00010247074,0.9366627,0.0423096,0.00034206582,0.0004711873,0.0000010644993,0.00001986946,0.005576589],"genre_scores_gemma":[0.8118578,0.00005720224,0.18556511,0.0021425074,0.00016163196,0.000018851857,7.6024304e-7,0.000008814745,0.00018730432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987012,0.00023209098,0.00033438546,0.000118289165,0.00044075417,0.00017324656],"domain_scores_gemma":[0.9975239,0.0014249407,0.00034943217,0.00019879863,0.00045697126,0.000045971807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027039626,0.00008736192,0.00011035068,0.000076895885,0.00062862644,0.0005078498,0.0006326638,0.000032353055,0.000018014813],"category_scores_gemma":[0.0006592978,0.00004386417,0.00007586001,0.000304348,0.000046768884,0.00055880466,0.00003356843,0.00033389672,0.000004966003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001730167,0.000036483685,0.0001902318,0.0000081865255,0.000028617113,0.0000014680716,0.00090997113,0.16688344,0.0006319404,0.8295258,0.00030976618,0.0014567596],"study_design_scores_gemma":[0.001032429,0.00092631654,0.00039720058,0.0005072649,0.00001758926,0.00003931746,0.002042071,0.93459463,0.010606912,0.034964837,0.014646916,0.00022450011],"about_ca_topic_score_codex":0.0000016650291,"about_ca_topic_score_gemma":0.0000032908854,"teacher_disagreement_score":0.7973434,"about_ca_system_score_codex":0.000059625323,"about_ca_system_score_gemma":0.00018135458,"threshold_uncertainty_score":0.48972073},"labels":[],"label_agreement":null},{"id":"W174485529","doi":"10.1007/978-3-642-38016-7_13","title":"Minimizing Cache Usage in Paging","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Cache; Cache algorithms; Competitive analysis; Page cache; Smart Cache; Cache invalidation; Cache-oblivious algorithm; Cache coloring; CPU cache; Parallel computing; Cache pollution; Online algorithm; Algorithm; Computer network; Upper and lower bounds; Mathematics","score_opus":0.027506684045857103,"score_gpt":0.2567483282238566,"score_spread":0.22924164417799953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174485529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045600053,0.00028832752,0.9832842,0.0014139233,0.00084328424,0.0004640589,0.0000011133744,0.00013497868,0.013524542],"genre_scores_gemma":[0.070235975,0.0001163969,0.9247645,0.0028024402,0.00025726826,0.000024630464,0.000004852482,0.00004697752,0.0017469537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618727,0.00006389076,0.0005695228,0.0014145371,0.0009285678,0.000836221],"domain_scores_gemma":[0.9978526,0.0004268072,0.00019934798,0.0011308765,0.00018510396,0.00020524397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012135302,0.00043730906,0.0004599734,0.0013079996,0.00018456353,0.0009309122,0.0032504878,0.0002727853,0.000102116515],"category_scores_gemma":[0.00010983847,0.00040624882,0.00008873921,0.00091023144,0.00041488852,0.0010588275,0.0015191534,0.0010126451,0.00015100824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016853476,0.000033145414,0.00017853665,0.000044242555,0.0000057654875,0.00011622537,0.0022963414,0.16771282,0.00011698864,0.02077433,0.00006813462,0.8086518],"study_design_scores_gemma":[0.00026542126,0.000056015117,0.00012784857,0.00038926068,0.0000015166148,0.00002608243,3.011141e-7,0.9470141,0.00023031,0.049703132,0.0016533288,0.00053267943],"about_ca_topic_score_codex":0.00006678126,"about_ca_topic_score_gemma":0.00009687583,"teacher_disagreement_score":0.8081191,"about_ca_system_score_codex":0.00032049234,"about_ca_system_score_gemma":0.0004892526,"threshold_uncertainty_score":0.99983895},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03879281381989205,"score_gpt":0.2616732478660249,"score_spread":0.22288043404613286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1751505773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013385308,0.00046759547,0.97647566,0.0067673833,0.0001744812,0.00037262472,0.0000033584874,0.00026733574,0.002086272],"genre_scores_gemma":[0.4817141,0.0045960587,0.5079327,0.0010611758,0.000097699136,0.00014466043,0.000044760032,0.000027525663,0.0043813135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989539,0.00006131981,0.00021525528,0.00035762935,0.00017044847,0.00024146705],"domain_scores_gemma":[0.9992878,0.000049319857,0.00008101256,0.0002645771,0.00019385463,0.00012342406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021840779,0.00013451588,0.00013874541,0.00010965255,0.00040371704,0.00041123858,0.00020757751,0.000060759,0.000009411956],"category_scores_gemma":[0.000028864746,0.00013317705,0.00001273002,0.0006046844,0.00008001217,0.002050235,0.00015082199,0.00010597575,0.0000134156935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003374886,0.00036455735,0.01879417,0.00008626155,0.00011076237,0.00004698629,0.022355525,0.290313,0.0015545075,0.1138495,0.0035980903,0.54889286],"study_design_scores_gemma":[0.00046932558,0.0001798557,0.019013096,0.00001975631,0.0000050576723,0.000033332522,0.00014001729,0.9689199,0.00014177916,0.0016072869,0.009232225,0.00023837535],"about_ca_topic_score_codex":0.000023753159,"about_ca_topic_score_gemma":0.00003672859,"teacher_disagreement_score":0.67860687,"about_ca_system_score_codex":0.000045794808,"about_ca_system_score_gemma":0.00013786198,"threshold_uncertainty_score":0.5430802},"labels":[],"label_agreement":null},{"id":"W1759574848","doi":"10.1007/978-3-642-31104-8_25","title":"Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Bounded function; Computer science; Node (physics); Tree (set theory); Upper and lower bounds; Randomized algorithm; Degree (music); Constant (computer programming); Tree traversal; Time complexity; Algorithm; Deterministic algorithm; Combinatorics; Mathematics","score_opus":0.015361322825506415,"score_gpt":0.24348352680076954,"score_spread":0.22812220397526312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1759574848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082878076,0.00037490367,0.99495304,0.00030657146,0.00053531985,0.00053654454,0.000004157058,0.00008447054,0.0031221197],"genre_scores_gemma":[0.38227797,0.00037598575,0.6135915,0.0013609661,0.00039123415,0.000028146436,0.00002090284,0.00007951549,0.0018737918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967542,0.000094741714,0.0007474991,0.0009104851,0.0008844688,0.00060857227],"domain_scores_gemma":[0.99782604,0.00045762715,0.0003767651,0.0010018647,0.00017645083,0.0001612736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013873242,0.00038338048,0.0006666383,0.0012669669,0.00009428817,0.00018759728,0.002187913,0.00031408205,0.00006935555],"category_scores_gemma":[0.0001306699,0.0003527464,0.00011397172,0.0007890783,0.00057151436,0.00075024617,0.0007455831,0.0004994958,0.00004893966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050749735,0.00009537383,0.00009258899,0.000051972966,0.000009940308,0.000045491342,0.0036287338,0.1668166,0.00026600563,0.0040380443,0.000022082415,0.8248824],"study_design_scores_gemma":[0.0016529969,0.00019611353,0.0001394908,0.00031873194,0.0000056021863,0.00003901102,1.5592333e-7,0.9789563,0.0009118318,0.016855568,0.00043077016,0.0004934576],"about_ca_topic_score_codex":0.000013794151,"about_ca_topic_score_gemma":0.000056983296,"teacher_disagreement_score":0.8243889,"about_ca_system_score_codex":0.00018593577,"about_ca_system_score_gemma":0.00046713708,"threshold_uncertainty_score":0.9998925},"labels":[],"label_agreement":null},{"id":"W1766799846","doi":"10.23638/dmtcs-22-4-4","title":"Evacuating Robots from a Disk Using Face-to-Face Communication","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Unit disk; Approx; Upper and lower bounds; Face (sociological concept); Boundary (topology); Computer science; Unit (ring theory); Algorithm; Combinatorics; Mathematics; Artificial intelligence; Mathematical analysis; Operating system","score_opus":0.055592122959191664,"score_gpt":0.3286861245468449,"score_spread":0.2730940015876533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766799846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004787519,0.000064100794,0.9861707,0.0055079143,0.00044187126,0.0011447613,0.000039416907,0.00045127847,0.0013924054],"genre_scores_gemma":[0.4118961,0.000011800107,0.58740795,0.0005363208,0.000068290894,0.000026672787,0.000019454512,0.000028906743,0.000004539942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940856,0.00041678635,0.0010014501,0.0017331622,0.0018753747,0.00088762067],"domain_scores_gemma":[0.9941882,0.0007215799,0.00046483747,0.003302927,0.00046575064,0.000856736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002117051,0.0006017826,0.00077441224,0.00030785447,0.00080123695,0.0031832051,0.009471524,0.00021789235,0.000058315385],"category_scores_gemma":[0.00063608726,0.0005349234,0.00021882882,0.0015211449,0.001439121,0.0006962842,0.018820204,0.0010908325,0.00015807238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041866974,0.00008530181,0.0000073819674,0.00009880312,0.00002875412,0.0000062998006,0.013955279,0.14663908,0.00070663134,0.8355038,0.00004515344,0.0029193338],"study_design_scores_gemma":[0.00012295946,0.00004927997,0.000017024584,0.00045653337,0.00001950452,0.0000038137932,0.00009505545,0.6790571,0.00044685826,0.31928387,0.0000093051785,0.00043864755],"about_ca_topic_score_codex":0.000026474365,"about_ca_topic_score_gemma":0.000001490807,"teacher_disagreement_score":0.5324181,"about_ca_system_score_codex":0.00019711691,"about_ca_system_score_gemma":0.0004639497,"threshold_uncertainty_score":0.9997102},"labels":[],"label_agreement":null},{"id":"W1779195044","doi":"10.1007/978-3-662-46078-8_23","title":"Efficient Online Strategies for Renting Servers in the Cloud","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Cloud computing; Renting; Database; Operating system","score_opus":0.05569048927228374,"score_gpt":0.3030071800178352,"score_spread":0.2473166907455515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779195044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013399677,0.00024577577,0.99329287,0.0025639983,0.0010885111,0.0007316726,0.000008184389,0.00007580509,0.0018591913],"genre_scores_gemma":[0.16894193,0.000031960375,0.82666034,0.0030266722,0.00080763525,0.000039856808,0.000032412365,0.00004564918,0.00041351822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694103,0.0000666099,0.00045235237,0.00094308436,0.0009959869,0.00060095417],"domain_scores_gemma":[0.9979301,0.00051606953,0.00019541991,0.00090381375,0.00035454557,0.00010001902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024611528,0.00032067267,0.000315617,0.00053918874,0.00020786525,0.00089513353,0.0035071766,0.00017450146,0.0000058762207],"category_scores_gemma":[0.00012352371,0.00023367413,0.000092313676,0.0007343323,0.00036318848,0.00028741104,0.0007145486,0.00061552366,0.000007526458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035583905,0.000039502447,0.0000062832914,0.000030439785,0.000002742807,0.000013637678,0.0024076423,0.85899454,0.0000065753493,0.07939266,0.000066573986,0.05903584],"study_design_scores_gemma":[0.00029673424,0.000113738985,0.000014681071,0.00016002424,0.0000020993104,0.000012234387,0.0000048366287,0.87029845,0.0000083934465,0.12691927,0.0019128657,0.0002566669],"about_ca_topic_score_codex":0.000025721638,"about_ca_topic_score_gemma":0.00023383234,"teacher_disagreement_score":0.16880794,"about_ca_system_score_codex":0.00019886397,"about_ca_system_score_gemma":0.0009349402,"threshold_uncertainty_score":0.9528954},"labels":[],"label_agreement":null},{"id":"W1784211297","doi":"10.1007/11604655_17","title":"Cleaning an Arbitrary Regular Network with Mobile Agents","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Graph; Relation (database); Mobile agent; Task (project management); Mobile genetic elements; Theoretical computer science; Distributed computing; Data mining","score_opus":0.018198049037657742,"score_gpt":0.2504142197784038,"score_spread":0.23221617074074605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784211297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007118315,0.00027923318,0.9908833,0.00031571573,0.00053593505,0.0005524296,0.000001619346,0.0002674401,0.007093149],"genre_scores_gemma":[0.014661026,0.00007997779,0.9802807,0.0031964718,0.0008300647,0.000019122599,0.000012216487,0.000053334308,0.0008671089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959129,0.000060977563,0.00042771472,0.0015692736,0.0011658195,0.00086330913],"domain_scores_gemma":[0.99753654,0.00014136522,0.000230906,0.001535012,0.00022841024,0.00032774522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009100437,0.00048441542,0.00043152532,0.00047112425,0.0003905953,0.0008092789,0.0032634232,0.00025603696,0.00007464618],"category_scores_gemma":[0.000013298201,0.00041286636,0.000076756485,0.0007739584,0.0005333567,0.0012821308,0.0009051382,0.0008714247,0.000042556065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047124904,0.000023959079,0.000031366788,0.000010598998,0.0000070338538,0.000064288804,0.00046439772,0.6888167,0.000003763393,0.011724946,0.000040719984,0.2988075],"study_design_scores_gemma":[0.00027701218,0.00047157478,0.00005563147,0.0003262201,0.0000047206345,0.00007271194,1.9716751e-7,0.95506245,0.00007309283,0.03558285,0.0074518872,0.0006216537],"about_ca_topic_score_codex":0.000008044467,"about_ca_topic_score_gemma":0.000058638816,"teacher_disagreement_score":0.29818586,"about_ca_system_score_codex":0.00018978001,"about_ca_system_score_gemma":0.0005422833,"threshold_uncertainty_score":0.99983233},"labels":[],"label_agreement":null},{"id":"W1793615280","doi":"10.1007/s00453-016-0224-x","title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Computing and Communication Foundations; Center for Massive Data Algorithmics; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Optimal binary search tree; Binary search tree; Binary tree; Random binary tree; Theory of computation; Mathematics; Tree (set theory); Self-balancing binary search tree; Search tree; Computer science; Algorithm; Entropy (arrow of time); Dynamic programming; Ternary search tree; K-ary tree; Combinatorics; Tree structure; Interval tree; Search algorithm","score_opus":0.030737890943844638,"score_gpt":0.25304085483676614,"score_spread":0.2223029638929215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793615280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020516774,0.0003275621,0.92453766,0.0451043,0.00012126905,0.00049394544,0.000012811908,0.00012630149,0.008759357],"genre_scores_gemma":[0.89858377,0.0004286635,0.0974253,0.00016832238,0.000011723223,0.000020356081,9.104741e-7,0.000010034058,0.0033508963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993597,0.000038732956,0.00010331614,0.00014053269,0.00019918341,0.00015849799],"domain_scores_gemma":[0.9987124,0.00082913856,0.000030448742,0.00024488918,0.00012688768,0.0000562271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020632325,0.000053919364,0.00006163236,0.000049462036,0.00013054286,0.000060577167,0.00026020117,0.000015998388,0.0000095496025],"category_scores_gemma":[0.00006537744,0.000025404705,0.00001329376,0.00020200838,0.00016527079,0.00021637678,0.0000986576,0.00004319933,0.000012101637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018968349,0.00010054081,0.00029542437,0.0000090587555,0.00005851044,0.000008734921,0.002944121,0.0002000082,0.0013276406,0.07963323,0.0027288261,0.91267496],"study_design_scores_gemma":[0.00815605,0.0071972734,0.077492826,0.00060058123,0.000054400334,0.000121884295,0.002497069,0.6965871,0.01301444,0.03305311,0.15956299,0.0016623063],"about_ca_topic_score_codex":0.0000066737202,"about_ca_topic_score_gemma":0.000010921614,"teacher_disagreement_score":0.91101265,"about_ca_system_score_codex":0.000007940688,"about_ca_system_score_gemma":0.000064496104,"threshold_uncertainty_score":0.10359738},"labels":[],"label_agreement":null},{"id":"W1801923375","doi":"10.1007/978-0-387-34735-6_5","title":"Distributed Algorithms for Autonomous Mobile Robots","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mobile robot; Robot; Robotics; Computer science; Artificial intelligence; Focus (optics); Variety (cybernetics); Set (abstract data type); Task (project management); Computability; Distributed computing; Human–computer interaction; Point (geometry); Algorithm; Engineering; Mathematics; Systems engineering","score_opus":0.029647890575216617,"score_gpt":0.2671263455842537,"score_spread":0.23747845500903708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801923375","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6982014e-8,0.00008187053,0.6621609,0.00021299167,0.00019234566,0.0006492871,0.00010583536,0.00030280315,0.33629397],"genre_scores_gemma":[0.000015997766,0.000027752625,0.21996887,0.00018860293,0.00010934901,0.0001205398,0.00058905623,0.0000309952,0.77894884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851847,0.000008267059,0.00033826765,0.0005470645,0.0002626939,0.00032522815],"domain_scores_gemma":[0.99885017,0.000078469886,0.00012885481,0.00057658774,0.000240891,0.00012504465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015087357,0.00026679135,0.0002904163,0.00012391004,0.00012497687,0.0002446824,0.0007867991,0.00025064914,0.00026807722],"category_scores_gemma":[0.0000063105335,0.00024263856,0.00017516546,0.00004871641,0.000045489272,0.00019208064,0.00022658278,0.00017050629,0.00016139413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018691917,0.00003647631,4.0175067e-7,0.000031816693,0.000034447872,0.000008512833,0.000020984862,0.04011683,0.0000021437897,0.76067525,0.15504861,0.04402264],"study_design_scores_gemma":[0.00024164472,0.00010509762,0.000001046504,0.000015825402,0.0000057748957,0.000004297181,4.8210154e-7,0.36262074,0.000017919416,0.016187178,0.62052286,0.00027715147],"about_ca_topic_score_codex":0.000017663984,"about_ca_topic_score_gemma":0.0000075259377,"teacher_disagreement_score":0.74448806,"about_ca_system_score_codex":0.00009746583,"about_ca_system_score_gemma":0.00016020941,"threshold_uncertainty_score":0.9894513},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016159626412135412,"score_gpt":0.2576801945142401,"score_spread":0.2415205681021047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802748673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038433708,0.000018818302,0.97980106,0.0009918768,0.000297022,0.00023557559,3.2108784e-7,0.0003454881,0.014466476],"genre_scores_gemma":[0.6118338,0.0000011800337,0.38763818,0.0004133408,0.000047564226,0.000012913271,3.709993e-7,0.000005245649,0.000047400794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976414,0.00008973702,0.00018571543,0.0006322242,0.0008912695,0.00055969],"domain_scores_gemma":[0.998017,0.00007663977,0.000045648732,0.0007857056,0.00041032583,0.0006646811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189816,0.00015269789,0.00016031085,0.00016801819,0.0002651146,0.0006782161,0.0022770818,0.00003642001,0.000026174117],"category_scores_gemma":[0.00003188966,0.000103718325,0.000026979964,0.0013282124,0.0018179037,0.0009817744,0.0008180934,0.00015670495,0.00021763348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005378344,0.000057082783,0.000022787683,0.0000018863294,0.0000019542513,0.000017119204,0.00077165687,0.023400942,0.000026324555,0.9622304,0.00013542364,0.013329064],"study_design_scores_gemma":[0.00035729914,0.0007193605,0.00005825181,0.000013978066,0.0000015457931,0.00006701438,0.000008123763,0.9412308,0.0011685834,0.055269495,0.0008934426,0.00021211736],"about_ca_topic_score_codex":0.0000030879378,"about_ca_topic_score_gemma":5.9268103e-7,"teacher_disagreement_score":0.9178299,"about_ca_system_score_codex":0.00007822368,"about_ca_system_score_gemma":0.00045605018,"threshold_uncertainty_score":0.6698142},"labels":[],"label_agreement":null},{"id":"W1803135286","doi":"10.1016/j.ic.2016.06.007","title":"On the list update problem with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Villum Fonden","keywords":"Advice (programming); Computer science; Information retrieval; Programming language","score_opus":0.0087912005124182,"score_gpt":0.2228605443273354,"score_spread":0.2140693438149172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803135286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027192913,0.000002720989,0.97115225,0.015876617,0.000030091243,0.00019058636,0.0000012773419,0.0001439024,0.009883261],"genre_scores_gemma":[0.96476144,0.000023400491,0.029856412,0.0051333522,0.000010161923,0.000028905179,0.000008973089,0.0000031559462,0.0001741767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946076,0.000037103364,0.00014258566,0.000073430056,0.00019364606,0.00009247762],"domain_scores_gemma":[0.99953336,0.00010100511,0.00008542682,0.00010813913,0.0001321356,0.000039915732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019794876,0.00005991457,0.000040461317,0.000068249356,0.00014731217,0.00026429482,0.00014463182,0.000017890121,0.000019037507],"category_scores_gemma":[0.000015930083,0.000027691043,0.00000865626,0.00018904496,0.000030402918,0.0015629377,0.000038718626,0.000039485934,0.00013924486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014018514,0.00001145179,0.000049390754,0.00000875754,0.0000058637306,2.4343834e-7,0.0008852858,0.004908631,0.0000070543965,0.7381646,0.0041843555,0.25176033],"study_design_scores_gemma":[0.0012742662,0.00028232526,0.0011803408,0.00009380623,0.0000026396283,0.000018506864,0.000094704614,0.91950285,0.00014903703,0.033740524,0.043444827,0.00021618663],"about_ca_topic_score_codex":0.0000045036604,"about_ca_topic_score_gemma":0.0000025726563,"teacher_disagreement_score":0.96204215,"about_ca_system_score_codex":0.000014321424,"about_ca_system_score_gemma":0.000029611205,"threshold_uncertainty_score":0.2548601},"labels":[],"label_agreement":null},{"id":"W181500213","doi":"10.1007/978-3-319-14472-6_18","title":"Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Rendezvous; Computer science; Node (physics); Oracle; Traverse; Network topology; Computer network; Theoretical computer science; Topology (electrical circuits); Mathematics; Combinatorics; Geography","score_opus":0.02409095994760135,"score_gpt":0.25103313663737603,"score_spread":0.22694217668977468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181500213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020575428,0.00013303611,0.9958908,0.0018012563,0.0002664712,0.0007152875,0.000014337883,0.000084088046,0.001074136],"genre_scores_gemma":[0.13356553,0.00026474954,0.8618515,0.003248154,0.0005135899,0.000052374733,0.000053661937,0.000037789487,0.0004126566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805164,0.000026289286,0.00037799907,0.00064394,0.0005002997,0.000399858],"domain_scores_gemma":[0.998453,0.00046730103,0.00018967489,0.00048509834,0.00020172884,0.0002031629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094416115,0.00029205182,0.00035652024,0.000539611,0.0002583072,0.00079638936,0.0008793473,0.00023731559,0.0000028150055],"category_scores_gemma":[0.00010599245,0.00025797385,0.000044444907,0.00022850106,0.0003884801,0.001109777,0.00043885293,0.00034757104,0.0000044194812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028724714,0.0000031392187,0.00008358852,0.00006021857,0.0000054194456,9.317545e-7,0.0006992514,0.0036795854,0.000003721035,0.02831461,0.000030982494,0.9671157],"study_design_scores_gemma":[0.00076641154,0.0003588737,0.0007096655,0.00022157318,0.000010870074,0.000035674893,2.5696087e-7,0.90942395,0.00011834796,0.056653507,0.03112059,0.00058025296],"about_ca_topic_score_codex":0.000008427773,"about_ca_topic_score_gemma":0.000018425584,"teacher_disagreement_score":0.96653545,"about_ca_system_score_codex":0.000081777005,"about_ca_system_score_gemma":0.00019272593,"threshold_uncertainty_score":0.99998724},"labels":[],"label_agreement":null},{"id":"W1853304843","doi":"10.1007/s10107-016-1079-2","title":"Tight MIP formulations for bounded up/down times and interval-dependent start-ups","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Interval (graph theory); Integer programming; Convex hull; Quadratic programming; Linear programming; Upper and lower bounds; Integer (computer science); Mathematical optimization; Combinatorics; Discrete mathematics; Regular polygon; Computer science","score_opus":0.03800690496063752,"score_gpt":0.2958300606662771,"score_spread":0.2578231557056396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853304843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008352377,0.00002463771,0.9934328,0.0038187997,0.00008181081,0.00071922905,0.0000028431025,0.00020629966,0.0008783275],"genre_scores_gemma":[0.22551256,0.000005935709,0.76801306,0.00011765485,0.000040223324,0.0002295107,0.0000036205736,0.000019238063,0.006058198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987707,0.00003375411,0.0003046956,0.00029439043,0.00023822083,0.00035819708],"domain_scores_gemma":[0.9990398,0.00032419802,0.000065842614,0.00029756234,0.000112318965,0.00016025195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047241006,0.00012622093,0.00017270872,0.00007634143,0.0001951703,0.00037072218,0.00031136963,0.000056281267,0.00009720669],"category_scores_gemma":[0.00025458698,0.000079349644,0.00006577399,0.000118461976,0.0000945159,0.0006046995,0.0001992358,0.000057591442,0.00006561714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066683733,0.00010797316,0.000044769007,0.00011139464,0.000024479277,0.0000012384477,0.0009342975,0.0000047525564,0.00015188557,0.7023038,0.00039078316,0.29591793],"study_design_scores_gemma":[0.0015961281,0.00031166655,0.000035992638,0.000231773,0.0000194155,0.00002354964,0.00007271228,0.25442678,0.000984258,0.7062507,0.035671126,0.0003758556],"about_ca_topic_score_codex":0.0000013007494,"about_ca_topic_score_gemma":0.0000039137135,"teacher_disagreement_score":0.2955421,"about_ca_system_score_codex":0.000035049175,"about_ca_system_score_gemma":0.00003091782,"threshold_uncertainty_score":0.35748827},"labels":[],"label_agreement":null},{"id":"W1854056485","doi":"10.1109/istcs.1993.253458","title":"The mortgage problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Line (geometry); Interest rate; Sequence (biology); Database transaction; Economics; Computer science; Upper and lower bounds; Mathematical economics; Actuarial science; Monetary economics; Mathematics; Chemistry; Database; Mathematical analysis","score_opus":0.027863168969227123,"score_gpt":0.22907029774901336,"score_spread":0.20120712877978625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854056485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022731092,0.00006822399,0.6036723,0.010511328,0.000054856577,0.00009753,5.495622e-8,0.00016577335,0.38540715],"genre_scores_gemma":[0.25148702,0.00058329606,0.41407305,0.0036022405,0.00006804265,0.00006183057,5.2363566e-7,0.000012843622,0.33011115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995147,0.000028592667,0.00007384903,0.00010046192,0.00013677297,0.00014562589],"domain_scores_gemma":[0.99959457,0.000044642977,0.000013241664,0.0002708907,0.000032956184,0.000043696014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016611525,0.00003350232,0.000025433428,0.000014790841,0.0002083473,0.00023323306,0.0005044588,0.00001140092,0.00022464423],"category_scores_gemma":[0.000011021327,0.000018482928,0.000016467055,0.00018017937,0.00002146593,0.00019388205,0.00010089273,0.000051884996,0.00048535882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.425535e-7,0.000022784387,0.00006146428,0.0000013603288,0.0000034612633,0.0000019657205,0.00033156076,0.0005081774,0.000022724225,0.83967894,0.066430256,0.092937134],"study_design_scores_gemma":[0.00007926885,0.000018647794,0.000052895168,0.000001110085,2.2210615e-7,0.0000031578156,0.000008469036,0.78406996,0.000074263124,0.004709478,0.21093391,0.000048622052],"about_ca_topic_score_codex":0.0000034970992,"about_ca_topic_score_gemma":0.000004721797,"teacher_disagreement_score":0.8349695,"about_ca_system_score_codex":0.000005576759,"about_ca_system_score_gemma":0.000004803399,"threshold_uncertainty_score":0.62384677},"labels":[],"label_agreement":null},{"id":"W1869091735","doi":"","title":"Sequential and parallel algorithms for frontier A* with delayed duplicate detection","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Workload; Computer science; Workstation; Sequence (biology); Parallel computing; Algorithm; Cluster (spacecraft); Real-time computing; Operating system","score_opus":0.01717291195064878,"score_gpt":0.24477512865869927,"score_spread":0.22760221670805048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869091735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009963183,0.000030911993,0.9969559,0.00053149613,0.000047561676,0.00027688636,0.0000011854454,0.000119572396,0.0010401824],"genre_scores_gemma":[0.1656206,0.000008183772,0.8299485,0.00012076088,0.000045697027,0.00007249523,0.0000062257236,0.000007262347,0.0041702725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.000013423192,0.000090958354,0.00021354633,0.00009728135,0.00015347054],"domain_scores_gemma":[0.99971294,0.000013454809,0.000026668486,0.00013096201,0.00007291552,0.000043077995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009729188,0.000063211344,0.00006162546,0.000043728352,0.00010717754,0.00014168785,0.00011646793,0.000029766576,0.000007464506],"category_scores_gemma":[0.0000018317704,0.00004723562,0.000016067659,0.00010692276,0.000024921745,0.00027169855,0.000036927362,0.000033597375,0.000004401099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003968815,0.00045333587,0.0013096066,0.00008095982,0.00019054055,0.000016983016,0.0006418435,0.10459506,0.011158892,0.3576015,0.016852517,0.5067019],"study_design_scores_gemma":[0.0007761996,0.00016159324,0.00035582704,0.0000014906456,0.0000032852743,0.000010273427,0.0000047918484,0.98826903,0.0014544191,0.0034440064,0.0054171984,0.00010189168],"about_ca_topic_score_codex":0.00015033143,"about_ca_topic_score_gemma":0.00011807314,"teacher_disagreement_score":0.88367397,"about_ca_system_score_codex":0.000011328536,"about_ca_system_score_gemma":0.000017098986,"threshold_uncertainty_score":0.19262126},"labels":[],"label_agreement":null},{"id":"W1871770614","doi":"10.1109/icsmc.1992.271804","title":"SEATER: a simulation environment using learning automata for telephone traffic routing","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Learning automata; Static routing; Routing (electronic design automation); Computer network; Equal-cost multi-path routing; Policy-based routing; Multipath routing; Distributed computing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Automaton; Dynamic Source Routing; Routing table; Cellular automaton; Telephone network; Routing protocol; Theoretical computer science; Algorithm","score_opus":0.04309256960504478,"score_gpt":0.283781803838169,"score_spread":0.2406892342331242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871770614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018186333,0.000008215456,0.980525,0.000084746665,0.000050478673,0.00026445405,2.2470837e-7,0.00019804359,0.000682469],"genre_scores_gemma":[0.6655642,0.0000026365185,0.3338264,0.000051274757,0.000008359591,0.000005888117,0.0000018513513,0.0000065445984,0.00053289096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991122,0.00008045828,0.0001641745,0.00024232171,0.00016390678,0.00023696375],"domain_scores_gemma":[0.9995971,0.00009643025,0.00005105224,0.00017042147,0.000024749143,0.00006029378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040448655,0.000079623744,0.0000810071,0.00006057411,0.00022943631,0.00014919529,0.0001498525,0.00003450029,0.000058122652],"category_scores_gemma":[0.0000616397,0.000074520125,0.000035891866,0.00013342983,0.000011346901,0.0003246827,0.00004581418,0.00006200097,0.000021990953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010633577,0.000022589094,0.00007492531,0.000004678843,0.0000038137607,3.880017e-7,0.00033305516,0.9863263,0.0004206257,0.0029251592,0.00000716663,0.009880258],"study_design_scores_gemma":[0.00040822607,0.00003841716,0.000034423818,0.000005647428,0.0000019599183,0.0000022716363,0.000036891503,0.99536633,0.00044812894,0.00008117285,0.0034760968,0.000100450154],"about_ca_topic_score_codex":0.000002298164,"about_ca_topic_score_gemma":2.9907494e-7,"teacher_disagreement_score":0.6473778,"about_ca_system_score_codex":0.000055709017,"about_ca_system_score_gemma":0.00003128992,"threshold_uncertainty_score":0.30388424},"labels":[],"label_agreement":null},{"id":"W1875516392","doi":"10.14778/2752939.2752950","title":"Viral marketing meets social advertising","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Viral marketing; Leverage (statistics); Click-through rate; Computer science; Advertising; Online advertising; Regret; Context (archaeology); Host (biology); Social network (sociolinguistics); Social media; Display advertising; Business; World Wide Web; The Internet; Artificial intelligence","score_opus":0.025921147798563318,"score_gpt":0.25511025738176607,"score_spread":0.22918910958320277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875516392","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30729544,0.000774723,0.060655292,0.08760607,0.0031998616,0.0033457219,0.0000084796975,0.001208893,0.53590554],"genre_scores_gemma":[0.9729325,0.000007718398,0.026052445,0.0002686141,0.000070780916,0.000015375625,2.0751449e-7,0.000008061623,0.000644298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988138,0.000020139152,0.00021234243,0.00019721163,0.0005171964,0.00023929655],"domain_scores_gemma":[0.9994023,0.00002114957,0.000153683,0.00008414202,0.00025860436,0.00008014893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091158,0.000091164584,0.00011385811,0.00005571134,0.00015294962,0.0001270083,0.0008413612,0.00003214479,0.00000606706],"category_scores_gemma":[0.00018544201,0.00006575007,0.000065328684,0.0002786363,0.00004796355,0.0004222389,0.0006255395,0.00009877778,0.0000069585644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022269765,0.00066867005,0.0121728545,0.00043838026,0.0001918536,0.0000032595026,0.031960398,0.001167125,0.10475737,0.60758346,0.10050219,0.14033175],"study_design_scores_gemma":[0.010938481,0.0008171936,0.021005396,0.0009889329,0.000105981984,0.000112164154,0.004267505,0.3915859,0.35330355,0.0896806,0.124926336,0.002267994],"about_ca_topic_score_codex":0.000012717615,"about_ca_topic_score_gemma":4.684597e-7,"teacher_disagreement_score":0.6656371,"about_ca_system_score_codex":0.00008390748,"about_ca_system_score_gemma":0.000050049322,"threshold_uncertainty_score":0.26812103},"labels":[],"label_agreement":null},{"id":"W188340665","doi":"10.1007/978-3-662-46018-4_1","title":"The Multi-source Beachcombers’ Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"","keywords":"Computer science","score_opus":0.04093236582003341,"score_gpt":0.2774382950420483,"score_spread":0.2365059292220149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188340665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011403047,0.00083959877,0.9857698,0.0030602836,0.0010501648,0.00062341825,0.0000018806459,0.00024543016,0.0084082885],"genre_scores_gemma":[0.0029840714,0.00012965957,0.98280334,0.0014721752,0.0003039925,0.00002488672,0.0000061257115,0.00005577396,0.012219977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957476,0.000080830665,0.0005374433,0.0013034507,0.0014728846,0.0008577905],"domain_scores_gemma":[0.9966152,0.0005077671,0.00027588388,0.0016996474,0.00057379855,0.0003277077],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023624469,0.00047401444,0.00037803064,0.00043751654,0.00065913534,0.0013838916,0.005495356,0.00027227344,0.0000136430235],"category_scores_gemma":[0.00015078626,0.0003341761,0.00011615273,0.0006904512,0.0010360029,0.0005992999,0.0021907974,0.0010614219,0.00012524813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034739953,0.00003233177,0.000022298223,0.000016521686,0.000011941153,0.000023234796,0.0015595054,0.17832871,0.000010376491,0.0473404,0.00046240346,0.7721888],"study_design_scores_gemma":[0.0003288001,0.00010921371,0.000007629073,0.00012192218,0.0000030360106,0.000038427144,2.8715635e-7,0.83000827,0.000043345713,0.08357436,0.08530887,0.00045585068],"about_ca_topic_score_codex":0.000025141804,"about_ca_topic_score_gemma":0.00012542831,"teacher_disagreement_score":0.7717329,"about_ca_system_score_codex":0.00034582173,"about_ca_system_score_gemma":0.0009429556,"threshold_uncertainty_score":0.999911},"labels":[],"label_agreement":null},{"id":"W1886363748","doi":"10.1007/978-3-540-69733-6_6","title":"On the Monotonicity of Weak Searching","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Monotonic function; Digraph; Computer science; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.02806827670807373,"score_gpt":0.26032164602651364,"score_spread":0.2322533693184399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886363748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098879755,0.000106440064,0.97991806,0.0020988632,0.0003902093,0.00040516394,0.0000024457822,0.00006737444,0.016912585],"genre_scores_gemma":[0.43208975,0.0005667572,0.56037563,0.004937373,0.00028702465,0.000021787875,0.0000040538143,0.00006358815,0.0016540556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969962,0.00007598473,0.00038880794,0.0008472682,0.0012237971,0.0004679402],"domain_scores_gemma":[0.99695957,0.0011551948,0.00021342859,0.001326358,0.00023178622,0.00011369387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011329466,0.0002954868,0.00033199432,0.0005378734,0.0003312744,0.00022511516,0.0036987206,0.00015392315,0.000034308516],"category_scores_gemma":[0.0001815942,0.00020302755,0.00011457634,0.0005726392,0.00088478776,0.00028870284,0.0011752896,0.00094388664,0.00003488457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069975786,0.000049030758,0.000020372594,0.000026894433,0.000012603675,0.000026628226,0.0019074255,0.3942575,0.000081664155,0.31186187,0.00020158272,0.29154745],"study_design_scores_gemma":[0.00013262528,0.00016744895,0.000049942333,0.00022524167,0.0000012356073,0.000021541226,1.1442839e-7,0.89617205,0.0010966641,0.100760564,0.0011070027,0.00026558572],"about_ca_topic_score_codex":0.000020597832,"about_ca_topic_score_gemma":0.000015215002,"teacher_disagreement_score":0.50191456,"about_ca_system_score_codex":0.00013224722,"about_ca_system_score_gemma":0.000558257,"threshold_uncertainty_score":0.8279223},"labels":[],"label_agreement":null},{"id":"W1921787617","doi":"10.1109/icsmc.1989.71244","title":"Epsilon-optimal discretized pursuit learning automata","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Learning automata; Discretization; Computer science; Action (physics); Automaton; Rendering (computer graphics); Mathematical optimization; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics","score_opus":0.01402014261147293,"score_gpt":0.2509054143074281,"score_spread":0.23688527169595514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921787617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052335806,0.000018811423,0.8732292,0.0012515426,0.00011105524,0.00010982575,1.7038953e-7,0.00050923467,0.12424681],"genre_scores_gemma":[0.20032865,0.000029660796,0.7660918,0.00045063032,0.000010772532,0.000016878828,0.0000038366443,0.000012947194,0.033054803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987812,0.00015384931,0.00015691237,0.0002848354,0.000315762,0.00030743238],"domain_scores_gemma":[0.9993656,0.00006154504,0.000037515783,0.00034178054,0.00005965538,0.00013387925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095012,0.00009681239,0.00010557688,0.00007739183,0.00017020617,0.00035610402,0.00058619375,0.00004030131,0.0006800467],"category_scores_gemma":[0.00015895629,0.000080332065,0.00004517486,0.00035250734,0.000032215892,0.00048092593,0.00015446072,0.0001553237,0.00040288785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032462858,0.000078072866,0.00070030603,0.000007807044,0.00001442552,0.000011498779,0.0005312166,0.03241169,0.00041795307,0.9526199,0.0045722993,0.008631561],"study_design_scores_gemma":[0.0006467746,0.00009407425,0.00022911206,0.000006187744,0.0000015865851,0.000015971467,0.000052857475,0.91332364,0.00067502947,0.0012434346,0.08351605,0.00019528256],"about_ca_topic_score_codex":0.0000069232156,"about_ca_topic_score_gemma":0.0000011436092,"teacher_disagreement_score":0.9513765,"about_ca_system_score_codex":0.000018422841,"about_ca_system_score_gemma":0.000067204644,"threshold_uncertainty_score":0.74460346},"labels":[],"label_agreement":null},{"id":"W1954494745","doi":"10.1007/3-540-44839-x_28","title":"Scheduling Intervals Using Independent Sets in Claw-Free Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Computer science; Scheduling (production processes); Time complexity; Combinatorics; Execution time; Running time; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Mathematical optimization","score_opus":0.03839137146645097,"score_gpt":0.28757377182614086,"score_spread":0.2491824003596899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954494745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035705554,0.0003964075,0.99420947,0.00080064463,0.0014703914,0.0005217465,0.0000033585602,0.00011270347,0.002128229],"genre_scores_gemma":[0.05347684,0.00009380739,0.94306564,0.0030783857,0.0000869178,0.000008679774,0.0000036556592,0.0000475384,0.00013852165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515563,0.00012861435,0.0007940802,0.001673495,0.0013297629,0.00091843156],"domain_scores_gemma":[0.99714863,0.00026622956,0.00030667346,0.0017523406,0.00028371654,0.00024241797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021035688,0.00054757553,0.00059738423,0.0019172323,0.00022525397,0.00085350237,0.0046035443,0.00042255112,0.000038931605],"category_scores_gemma":[0.00020646855,0.0005362929,0.00015112259,0.0013173393,0.00048983993,0.0009794008,0.0022176784,0.001356733,0.00001965303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057915267,0.00007123399,0.0003627204,0.00007038224,0.0000150341775,0.0002028267,0.0015061777,0.8100151,0.00015530831,0.050296806,0.000019614783,0.13727902],"study_design_scores_gemma":[0.00044612674,0.00007386457,0.000047161197,0.00054127787,0.0000028289974,0.0000660413,3.228882e-7,0.77594674,0.0002819375,0.22185962,0.00020198243,0.0005321364],"about_ca_topic_score_codex":0.000044921824,"about_ca_topic_score_gemma":0.0001842695,"teacher_disagreement_score":0.1715628,"about_ca_system_score_codex":0.0004933009,"about_ca_system_score_gemma":0.000625162,"threshold_uncertainty_score":0.99970883},"labels":[],"label_agreement":null},{"id":"W1964918537","doi":"10.1109/tac.2007.899024","title":"Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Point in polygon; Mathematics; Regular polygon; Rendezvous; Mobile robot; Curvature; Convex polygon; Robot; Mathematical analysis; Geometry; Topology (electrical circuits); Computer science; Combinatorics; Artificial intelligence; Engineering","score_opus":0.013095365309660732,"score_gpt":0.2599077172297869,"score_spread":0.24681235192012616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964918537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042947673,0.000062284686,0.9950627,0.001220523,0.00025326447,0.0020729993,0.000006951522,0.00040200053,0.00048978947],"genre_scores_gemma":[0.90447694,0.000013340406,0.09364926,0.0005413753,0.000022334561,0.0006552,6.7612916e-7,0.00001655515,0.0006243136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985326,0.00010880395,0.00041267928,0.00031639193,0.00024812194,0.00038139417],"domain_scores_gemma":[0.99824834,0.0010292757,0.000103465325,0.00038806646,0.00010813794,0.00012269667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014551351,0.00016521537,0.00026059127,0.00015033157,0.00043295813,0.00022146251,0.00037355247,0.00006962606,0.000026114882],"category_scores_gemma":[0.000012216718,0.00011743805,0.00012351248,0.0002633761,0.00011453607,0.00026147574,0.0000026951934,0.0001533574,0.000012482442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096502845,0.00018566768,0.0000040303444,0.000053516582,0.00013277163,0.0000048620395,0.0024065333,0.21074674,0.00021326805,0.00739775,0.00013579038,0.77862257],"study_design_scores_gemma":[0.003941656,0.00019801727,0.00003189486,0.000024664312,0.00003314989,0.000025764359,0.00005984399,0.99369884,0.000310578,0.0010966294,0.00043368497,0.00014529373],"about_ca_topic_score_codex":0.000019777915,"about_ca_topic_score_gemma":0.00005253078,"teacher_disagreement_score":0.9040475,"about_ca_system_score_codex":0.000053247382,"about_ca_system_score_gemma":0.00007660131,"threshold_uncertainty_score":0.4788985},"labels":[],"label_agreement":null},{"id":"W1965378629","doi":"10.1007/s00224-011-9349-0","title":"Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Speedup; Multiprocessing; Competitive analysis; Scaling; Parallel computing; Computer science; Upper and lower bounds; Constant (computer programming); Omega; Randomized algorithm; Mathematics; Algorithm; Physics; Mathematical analysis; Geometry","score_opus":0.05319425553936011,"score_gpt":0.25109109421144404,"score_spread":0.19789683867208394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965378629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23818547,0.001071224,0.7371658,0.000040348747,0.00024390151,0.00073063344,0.0000037694906,0.00028368135,0.022275168],"genre_scores_gemma":[0.980138,0.000022708482,0.019602215,0.000073196905,0.000030892126,0.0000020928023,0.0000012993747,0.000014832801,0.0001147698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983804,0.00022977343,0.00045891755,0.0002868623,0.00040923347,0.00023476637],"domain_scores_gemma":[0.99824864,0.00042182955,0.00043499743,0.00039332933,0.0004266429,0.00007458926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284251,0.00015503704,0.00035447034,0.0001651812,0.00007033991,0.000031591077,0.0007683503,0.000040802952,0.0000069013536],"category_scores_gemma":[0.00015781262,0.000116789415,0.000039319562,0.00062923296,0.00014144297,0.00021205432,0.00009717804,0.000113223854,0.0000070043657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006696766,0.0018172804,0.0058003515,0.031184055,0.00041222834,0.00003905256,0.073504195,0.08222129,0.0018712207,0.7933862,0.00020173925,0.008892682],"study_design_scores_gemma":[0.0045104288,0.003492009,0.0041048015,0.04756336,0.00007918215,0.00019182221,0.004608482,0.82636565,0.09448975,0.01277137,0.00009304844,0.0017300842],"about_ca_topic_score_codex":0.0000348302,"about_ca_topic_score_gemma":9.581643e-7,"teacher_disagreement_score":0.78061485,"about_ca_system_score_codex":0.000010551511,"about_ca_system_score_gemma":0.00018079825,"threshold_uncertainty_score":0.47625342},"labels":[],"label_agreement":null},{"id":"W1965412610","doi":"10.1155/2014/801791","title":"The High Contact Principle with Reward Functions Involving Initial Points","year":2014,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Postdoctoral Science Foundation; Social Sciences and Humanities Research Council of Canada; Central University of Finance and Economics; National Natural Science Foundation of China; Beijing Municipal Office of Philosophy and Social Science Planning","keywords":"Constant (computer programming); Point (geometry); Class (philosophy); Mathematics; Process (computing); Applied mathematics; Calculus (dental); Mathematical analysis; Computer science; Geometry; Artificial intelligence","score_opus":0.012976978155335052,"score_gpt":0.23150550161488448,"score_spread":0.21852852345954943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965412610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020447867,0.000019861674,0.9946752,0.00071814476,0.00014073368,0.00030385464,3.970973e-7,0.00022377261,0.0018732446],"genre_scores_gemma":[0.9168751,0.000006670614,0.08271453,0.00006729302,0.00004503759,0.000113379785,0.0000015526297,0.000022161445,0.00015427165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871206,0.00005531339,0.00031908558,0.00023393158,0.0002996777,0.00037990313],"domain_scores_gemma":[0.99885476,0.00050383044,0.00004850498,0.00043025787,0.000059900427,0.00010275017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093668944,0.00014141305,0.00016903332,0.00009582333,0.00014222963,0.00024719778,0.00048431288,0.000050291816,0.000015701886],"category_scores_gemma":[0.00039362654,0.0000930838,0.000029335219,0.0003721081,0.000031227748,0.00031794736,0.00017883132,0.00028112446,0.000051075636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023182956,0.000050420313,0.00009491783,0.00013320489,0.000012876396,0.0000024615965,0.0004140094,0.3057903,0.00011776513,0.69221616,0.000051554867,0.0011140214],"study_design_scores_gemma":[0.0004031401,0.0000977109,0.00014757662,0.00021181615,0.000002458703,0.000013406882,0.0000137181005,0.97756386,0.00007900342,0.019249689,0.00205376,0.00016384816],"about_ca_topic_score_codex":0.0000060377943,"about_ca_topic_score_gemma":0.000011642569,"teacher_disagreement_score":0.9148303,"about_ca_system_score_codex":0.000056100296,"about_ca_system_score_gemma":0.000028477925,"threshold_uncertainty_score":0.37958473},"labels":[],"label_agreement":null},{"id":"W1967767406","doi":"10.1007/s00453-011-9496-3","title":"Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; École de Technologie Supérieure; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Asynchronous communication; Topology (electrical circuits); Node (physics); Network topology; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network; Physics","score_opus":0.03662411861360209,"score_gpt":0.24606018609382008,"score_spread":0.20943606748021798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967767406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05194985,0.00006768494,0.93600214,0.0004589652,0.000079231584,0.00034383917,0.0000023693062,0.00020780657,0.010888114],"genre_scores_gemma":[0.43968078,0.00003711093,0.55959594,0.00021321497,0.000026674836,0.000022316288,0.0000043589744,0.000019878153,0.00039974332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985373,0.0000945416,0.00018521058,0.0004004611,0.0003216195,0.00046083852],"domain_scores_gemma":[0.99927044,0.00004092491,0.000037457994,0.00041157857,0.00010477883,0.0001348047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003551142,0.00013467927,0.00014840515,0.00026464585,0.00009007357,0.00012354135,0.0007242934,0.000055981414,0.000048963106],"category_scores_gemma":[0.000010937639,0.00011556858,0.000033354427,0.00078254193,0.00013145563,0.0005504839,0.00022734032,0.00023240093,0.0000837958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025767335,0.0024261707,0.020357203,0.0002587347,0.00030708214,0.0019499164,0.121433064,0.110603884,0.0016102247,0.2488809,0.0025444508,0.4893707],"study_design_scores_gemma":[0.0012822725,0.0005099066,0.0058295466,0.00010167252,0.000005230951,0.00003275378,0.0006168342,0.985168,0.0041935323,0.0011660808,0.0005824822,0.00051169423],"about_ca_topic_score_codex":0.00025535855,"about_ca_topic_score_gemma":0.000036791494,"teacher_disagreement_score":0.8745641,"about_ca_system_score_codex":0.000031777483,"about_ca_system_score_gemma":0.000092962546,"threshold_uncertainty_score":0.471275},"labels":[],"label_agreement":null},{"id":"W1968085493","doi":"10.2298/yjor0501005b","title":"Applications of a special polynomial class of TSP","year":2005,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Class (philosophy); Mathematics; Combinatorics; Time complexity; Treasure; Measure (data warehouse); Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence; Database","score_opus":0.05777407111335551,"score_gpt":0.39140864777529727,"score_spread":0.33363457666194174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968085493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023799136,0.00041884714,0.93732774,0.013537019,0.00021099563,0.00079225475,0.000019833571,0.000016442187,0.0238777],"genre_scores_gemma":[0.8547709,0.00023822681,0.14233969,0.000043623735,0.0010939917,0.000019658995,0.0000022129161,0.000009235523,0.0014824289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976003,0.0002902117,0.00072989555,0.00013975501,0.0009975955,0.00024220668],"domain_scores_gemma":[0.99678427,0.00017073599,0.0001218385,0.0003829399,0.0023884128,0.00015179324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00198421,0.000071396076,0.00021229034,0.0007846334,0.00020352587,0.00012945387,0.0011109988,0.000059964183,0.00029618657],"category_scores_gemma":[0.00021802203,0.000061423976,0.000101682825,0.0012024448,0.00020537614,0.0007050731,0.00018608077,0.00040709507,0.000035950354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015616638,0.0024877884,0.0008084934,0.000093242335,0.00021057317,0.00001397566,0.009622806,0.23811282,0.049132068,0.35061258,0.05888412,0.28986534],"study_design_scores_gemma":[0.004494753,0.002168665,0.0016774249,0.00017879577,0.00002495416,0.00023249042,0.0011977929,0.52124965,0.060239725,0.0018703011,0.40621135,0.00045409435],"about_ca_topic_score_codex":0.000024971816,"about_ca_topic_score_gemma":0.00006881854,"teacher_disagreement_score":0.8309718,"about_ca_system_score_codex":0.00008316164,"about_ca_system_score_gemma":0.00094109634,"threshold_uncertainty_score":0.32430354},"labels":[],"label_agreement":null},{"id":"W1968885544","doi":"10.1016/s0304-3975(03)00141-5","title":"On polynomial-time approximation algorithms for the variable length scheduling problem","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Approximation algorithm; Mathematics; Algorithm; Extension (predicate logic); Approximation error; Scheduling (production processes); Polynomial-time approximation scheme; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.016075939359333716,"score_gpt":0.2594672765588951,"score_spread":0.2433913371995614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968885544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016401432,0.000015280506,0.9890692,0.001736695,0.00038339332,0.00074225944,0.0000015456396,0.00017843461,0.0077091255],"genre_scores_gemma":[0.1393297,0.0000032456403,0.8595841,0.00086790795,0.00006900813,0.00005686034,0.0000010398445,0.000010166205,0.00007799782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761724,0.00016363415,0.00027885506,0.0006594496,0.00064861105,0.0006322049],"domain_scores_gemma":[0.9976789,0.0010204258,0.000078026766,0.00073727506,0.00028931227,0.00019606347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00388973,0.00017401343,0.00016265211,0.00014415671,0.0010050384,0.00088719,0.0019101634,0.00005422862,0.00006306524],"category_scores_gemma":[0.00034972365,0.00011523586,0.00005977938,0.0012084552,0.0009754163,0.00064101,0.00028668717,0.00019792905,0.000091929476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005056211,0.000057231595,6.336284e-7,0.0000058567366,0.000004224315,3.0805143e-7,0.00018502973,0.03939682,0.00023842603,0.94628674,0.00014142248,0.013678278],"study_design_scores_gemma":[0.0002878521,0.0001874856,0.0000029577138,0.00001668158,0.000002885526,0.000007706201,0.0000034402772,0.79422903,0.0014924947,0.20309901,0.0005327253,0.00013770665],"about_ca_topic_score_codex":0.0000012396554,"about_ca_topic_score_gemma":4.2559915e-8,"teacher_disagreement_score":0.7548322,"about_ca_system_score_codex":0.00006698177,"about_ca_system_score_gemma":0.00026174216,"threshold_uncertainty_score":0.85551935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020414413547268855,"score_gpt":0.260438264394177,"score_spread":0.24002385084690814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970322539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034523346,0.00002939739,0.9589333,0.0010210725,0.00020150465,0.00025732617,3.2506514e-7,0.00011381068,0.004919931],"genre_scores_gemma":[0.9007551,0.000021085702,0.09817092,0.0009598405,0.0000552092,0.000018304803,3.908847e-7,0.000004099161,0.000015015104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979109,0.00016654764,0.0002088561,0.00046875636,0.0007274841,0.0005174425],"domain_scores_gemma":[0.9988297,0.00024087877,0.00003213323,0.00068471045,0.0000736612,0.00013891526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443086,0.00012224556,0.00013036201,0.0001479813,0.0004458744,0.0002924493,0.0030587562,0.000032378048,0.000039718925],"category_scores_gemma":[0.000037787337,0.0000793042,0.000035472473,0.0014633966,0.0016992794,0.0005515664,0.000613329,0.00023002694,0.00009621276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002236766,0.00006725981,0.00014382241,0.0000029134296,8.0264357e-7,0.000050434617,0.0032256455,0.016890813,0.00013652323,0.97100544,0.00007749901,0.008396606],"study_design_scores_gemma":[0.00023441817,0.00019011126,0.0015482784,0.000018287174,5.777833e-7,0.00017498227,0.000020135016,0.9716216,0.00055796414,0.025159387,0.0002986756,0.00017558245],"about_ca_topic_score_codex":0.0000052586142,"about_ca_topic_score_gemma":9.496126e-7,"teacher_disagreement_score":0.9547308,"about_ca_system_score_codex":0.000033967815,"about_ca_system_score_gemma":0.00007767962,"threshold_uncertainty_score":0.62610656},"labels":[],"label_agreement":null},{"id":"W1970669897","doi":"10.1016/j.ipl.2011.07.018","title":"How many oblivious robots can explore a line","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Asynchronous communication; Robot; Impossibility; Computer science; Line (geometry); Theoretical computer science; Mobile robot; Node (physics); Combinatorics; Distributed computing; Artificial intelligence; Mathematics; Computer network; Physics","score_opus":0.056753769306573394,"score_gpt":0.23498676798739124,"score_spread":0.17823299868081785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970669897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027831504,0.000014497211,0.9806233,0.014045502,0.00012853945,0.0001521453,9.619714e-7,0.00036075994,0.001891144],"genre_scores_gemma":[0.8133296,0.000009370269,0.1706893,0.015681276,0.00004005836,0.00004852412,0.000020615214,0.000009482251,0.00017180291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.000024385256,0.00024377256,0.0001321099,0.00031647805,0.00027219733],"domain_scores_gemma":[0.99929523,0.00000849706,0.00017669077,0.00024761262,0.00016912598,0.000102821294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018236195,0.00012103622,0.00009545462,0.0002469417,0.0001881983,0.0008709763,0.0005447038,0.00004380798,0.000011594945],"category_scores_gemma":[0.00003730012,0.000109469256,0.000032368996,0.00045641256,0.00004436968,0.005991455,0.00010349857,0.00013465903,0.000050340055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023142635,0.00011864506,0.00068070606,0.0004285962,0.000035155706,0.000023828328,0.14540216,0.013229743,0.0011430068,0.014948903,0.010850443,0.81311566],"study_design_scores_gemma":[0.0014797873,0.00015330978,0.0015694927,0.00020060218,0.000010425459,0.000075838245,0.0012014658,0.9712354,0.005835868,0.0014566868,0.015917525,0.00086357776],"about_ca_topic_score_codex":0.000013935185,"about_ca_topic_score_gemma":0.0000017928348,"teacher_disagreement_score":0.95800567,"about_ca_system_score_codex":0.00004105688,"about_ca_system_score_gemma":0.00007358736,"threshold_uncertainty_score":0.83988446},"labels":[],"label_agreement":null},{"id":"W1971694274","doi":"10.1016/j.jcss.2009.07.002","title":"Communication algorithms with advice","year":2009,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Computer science; Dissemination; Node (physics); Broadcasting (networking); Computer network; Algorithm; Theoretical computer science; Telecommunications","score_opus":0.017505653996276998,"score_gpt":0.26672492767637895,"score_spread":0.24921927368010197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971694274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003853357,0.0004696364,0.98980874,0.0021716272,0.00012394988,0.00006056563,1.1144886e-7,0.00003742288,0.0034745662],"genre_scores_gemma":[0.59420365,0.000040700455,0.40547404,0.00021130677,0.000046760484,2.3681574e-7,5.459459e-8,8.949985e-7,0.000022377753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898046,0.00011851546,0.00026570272,0.00011142908,0.00040321023,0.000120687364],"domain_scores_gemma":[0.99922967,0.00006468091,0.00022722855,0.00015234294,0.00023137577,0.000094727846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011398426,0.00006347234,0.00014528494,0.00014785602,0.00022170504,0.00043019053,0.00077224214,0.000018267398,8.1396064e-7],"category_scores_gemma":[0.000002953844,0.0000383846,0.000024659726,0.00038611068,0.00007588607,0.0009353811,0.000053861364,0.00008497841,0.0000014135678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003258772,0.00026425798,0.0021791612,0.00008658784,0.00005626456,0.00008726205,0.007581928,0.04407561,0.00009050601,0.41839314,0.004552983,0.52259976],"study_design_scores_gemma":[0.00048916944,0.001322945,0.003858722,0.00024650135,0.000004171227,0.0010666611,0.00023941808,0.9908098,0.000028992734,0.0007544674,0.0010667633,0.00011237268],"about_ca_topic_score_codex":0.0000029588316,"about_ca_topic_score_gemma":6.007464e-7,"teacher_disagreement_score":0.9467342,"about_ca_system_score_codex":0.000014528806,"about_ca_system_score_gemma":0.000081628634,"threshold_uncertainty_score":0.41483372},"labels":[],"label_agreement":null},{"id":"W1972503266","doi":"10.1109/tsmcb.2012.2224339","title":"Learning-Automaton-Based Online Discovery and Tracking of Spatiotemporal Event Patterns","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Correctness; Machine learning; Adaptation (eye); Scheme (mathematics); Artificial intelligence; Theoretical computer science; Distributed computing; Data mining; Algorithm","score_opus":0.0221934737989136,"score_gpt":0.27142645665969445,"score_spread":0.24923298286078086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972503266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19959293,0.000025051688,0.79971147,0.0002371542,0.00019366773,0.000112384914,0.000020462752,0.00007097433,0.000035920886],"genre_scores_gemma":[0.98598415,0.000058049667,0.013592819,0.00009309613,0.000019886753,0.0000066325347,0.000006309131,0.000012984515,0.00022605338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00009427426,0.00024573135,0.00017083061,0.00027360715,0.00022663588],"domain_scores_gemma":[0.9993954,0.00011524713,0.00009102256,0.00022033999,0.000064269974,0.00011377377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018054685,0.00011691251,0.00013434084,0.00012854216,0.00008742279,0.00007138075,0.00017792171,0.00006098637,0.000023277771],"category_scores_gemma":[0.0000061078435,0.00011240487,0.00006109059,0.00018543338,0.000046646946,0.00041639246,0.0000030682806,0.00021780527,0.000004708248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029910394,0.0021272283,0.019812059,0.00016441975,0.00006604186,0.0000038017745,0.003335858,0.80066854,0.0011104001,0.001583789,0.00003729942,0.17106065],"study_design_scores_gemma":[0.00076030527,0.00039961038,0.018242393,0.000109981185,0.000020544901,0.0000067956635,0.000087573266,0.9501648,0.029496877,0.00005126408,0.00039245078,0.00026740483],"about_ca_topic_score_codex":0.0000473759,"about_ca_topic_score_gemma":0.000031779597,"teacher_disagreement_score":0.78639126,"about_ca_system_score_codex":0.000026708869,"about_ca_system_score_gemma":0.00004745474,"threshold_uncertainty_score":0.45837379},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035370928479806094,"score_gpt":0.2406513227041873,"score_spread":0.2052803942243812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972775782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010468527,0.000061476065,0.98301446,0.0026764313,0.0002296129,0.00030734105,0.000021846285,0.000341751,0.002878531],"genre_scores_gemma":[0.83918643,0.0000033641415,0.16020946,0.00044805396,0.0000268747,0.000009272001,0.0000355004,0.000013963795,0.0000670857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980858,0.0001304448,0.00028984924,0.00055671105,0.00030271034,0.000634497],"domain_scores_gemma":[0.9988629,0.000067621615,0.00010602093,0.00058555923,0.00012977459,0.00024810192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046170267,0.00020040835,0.00023237999,0.00025937948,0.0001532676,0.0002850758,0.0011437081,0.000088918074,0.0000068064487],"category_scores_gemma":[0.000109403256,0.00020343787,0.00007512331,0.0011376068,0.000035228604,0.0004051659,0.00042261428,0.00020035153,0.0000108704935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005789202,0.0007456832,0.03668425,0.00009790109,0.0001039995,0.0003819234,0.022673642,0.0202812,0.0008151094,0.8465513,0.023654593,0.04795251],"study_design_scores_gemma":[0.0014678931,0.00036154545,0.014049596,0.00018463311,0.000008803246,0.000040718187,0.00063712406,0.90844595,0.0033312272,0.06328729,0.007129476,0.0010557538],"about_ca_topic_score_codex":0.000078661906,"about_ca_topic_score_gemma":0.00003955699,"teacher_disagreement_score":0.88816476,"about_ca_system_score_codex":0.000064399486,"about_ca_system_score_gemma":0.00006771616,"threshold_uncertainty_score":0.82959557},"labels":[],"label_agreement":null},{"id":"W1973963219","doi":"10.1109/icsssm.2011.5959522","title":"Online routing of hazardous materials transportation based on risk equity","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Beijing University of Chemical Technology; National Natural Science Foundation of China; Beijing University of Technology; Ryerson University","keywords":"Hazardous waste; Equity (law); Computer science; Node (physics); Transport engineering; Flow network; Risk analysis (engineering); Operations research; Business; Engineering; Mathematical optimization; Mathematics","score_opus":0.06880667339669169,"score_gpt":0.29590137927632887,"score_spread":0.22709470587963718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973963219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0730575,9.238278e-7,0.9212195,0.00009314868,0.000096057265,0.00012304039,0.000026307354,0.00010126254,0.005282207],"genre_scores_gemma":[0.8364332,0.0000034034779,0.16331783,0.00014895802,0.000007106161,0.000002184533,0.000014157247,0.0000033430852,0.0000698425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992472,0.000066054825,0.000223347,0.00015142479,0.00018806146,0.00012392168],"domain_scores_gemma":[0.99952006,0.000029556319,0.000103919876,0.00022484588,0.00007828252,0.000043355867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929699,0.000058357833,0.00009531331,0.00006046809,0.00004002655,0.000023961431,0.00027657655,0.000029999457,0.00035160928],"category_scores_gemma":[0.000025464651,0.000047678073,0.000026789763,0.00014098309,0.000016849232,0.0001513153,0.000018233155,0.000041760544,0.000012126572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004018614,0.005106655,0.025600608,0.00029883432,0.00009141037,0.00003659024,0.015268156,0.090690255,0.040495444,0.6372765,0.00080961,0.1839241],"study_design_scores_gemma":[0.00090739335,0.0005164145,0.048589353,0.00004417611,0.000008461795,2.6777485e-7,0.000044896507,0.7866211,0.16052547,0.002490468,0.000050149767,0.00020185634],"about_ca_topic_score_codex":0.0002645935,"about_ca_topic_score_gemma":0.00004395506,"teacher_disagreement_score":0.7633757,"about_ca_system_score_codex":0.000008795301,"about_ca_system_score_gemma":0.000039379454,"threshold_uncertainty_score":0.38498753},"labels":[],"label_agreement":null},{"id":"W1974010905","doi":"10.1109/cdc.2014.7039415","title":"Robot monitoring for the detection and confirmation of stochastic events","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Patrolling; Event (particle physics); Robot; Traverse; Computer science; Path (computing); False positive paradox; Artificial intelligence; Simple (philosophy); Algorithm","score_opus":0.04424917438107049,"score_gpt":0.30155702493265635,"score_spread":0.25730785055158584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974010905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040665653,0.00005210643,0.99801457,0.00030269052,0.00057561335,0.0005495029,8.597025e-7,0.000040527553,0.000057461824],"genre_scores_gemma":[0.9609611,0.000020417052,0.038758405,0.000013669808,0.000051567342,0.0000808847,0.0000011907988,0.0000039920933,0.000108740125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942124,0.000037572325,0.00015979132,0.00016215464,0.00013804359,0.000081205624],"domain_scores_gemma":[0.9992623,0.00019429883,0.00011974767,0.00024879506,0.00014884143,0.000026048723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036804407,0.00006920304,0.00009397649,0.000054388318,0.00007997418,0.00007166373,0.00028375638,0.000062174666,0.0000020253],"category_scores_gemma":[0.00006141997,0.000049010272,0.000031276704,0.0000452282,0.000015816679,0.000081866,0.00028982843,0.00010063308,0.0000010536735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073902197,0.000018106075,0.00004363034,0.00021556053,0.00003848229,1.8985144e-8,0.0006369592,0.8657498,0.0007972421,0.006467502,0.000015094871,0.12601027],"study_design_scores_gemma":[0.00013788139,0.000029530218,0.0007800473,0.00004107887,0.000005919417,5.8115984e-7,0.000012624945,0.99425113,0.0010518408,0.0036055837,0.000030208354,0.000053594376],"about_ca_topic_score_codex":0.000031163243,"about_ca_topic_score_gemma":0.000003157803,"teacher_disagreement_score":0.9605545,"about_ca_system_score_codex":0.000013166495,"about_ca_system_score_gemma":0.00002451982,"threshold_uncertainty_score":0.1998581},"labels":[],"label_agreement":null},{"id":"W1974192323","doi":"10.1016/s0166-218x(03)00189-6","title":"Searching with mobile agents in networks with liars","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Hypercube; Node (physics); Computer science; Graph; Theoretical computer science; Shortest path problem; Path (computing); Mathematics; Combinatorics; Discrete mathematics; Topology (electrical circuits); Computer network","score_opus":0.018882787564954387,"score_gpt":0.26042773149044907,"score_spread":0.2415449439254947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974192323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063559227,0.000013680981,0.95049536,0.00003580537,0.000013509121,0.0005963728,3.9383806e-7,0.00008757518,0.042401355],"genre_scores_gemma":[0.42735955,0.000017723156,0.5721427,0.00011131589,0.000005792536,0.00015004215,0.0000034274804,0.00002285533,0.0001865606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877596,0.000030355475,0.00019992197,0.00027604066,0.0003454697,0.00037225927],"domain_scores_gemma":[0.9992512,0.00007630771,0.00007551068,0.00045452506,0.00003239504,0.00011009144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704094,0.00015095051,0.00018235933,0.000093014954,0.00008755957,0.00017691811,0.00039809634,0.000041914715,0.00002265245],"category_scores_gemma":[0.00000852143,0.00010497571,0.000017524519,0.0005610717,0.000052845528,0.00016980807,0.00007870472,0.0002079515,0.000019560426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007655205,0.00012978469,0.00016018715,0.000066215856,0.000019064208,0.000018523038,0.0032251975,0.42894715,0.000031670814,0.56589115,0.000056135035,0.0014472674],"study_design_scores_gemma":[0.0011503462,0.00016149189,0.00007836187,0.0001311116,0.0000069862936,0.000022271026,0.0007574062,0.98725176,0.00032030416,0.00874933,0.0009809682,0.0003896779],"about_ca_topic_score_codex":0.0000030786052,"about_ca_topic_score_gemma":0.000012531241,"teacher_disagreement_score":0.5583046,"about_ca_system_score_codex":0.00002958147,"about_ca_system_score_gemma":0.000056677476,"threshold_uncertainty_score":0.42807853},"labels":[],"label_agreement":null},{"id":"W1974563358","doi":"10.1155/2012/841291","title":"Market-Based Approach to Mobile Surveillance Systems","year":2012,"lang":"en","type":"article","venue":"Journal of Robotics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Software deployment; Interoperability; Computer security; Sensor fusion; Real-time computing; Artificial intelligence; Systems engineering; World Wide Web","score_opus":0.025783443565970055,"score_gpt":0.2628814565871655,"score_spread":0.23709801302119543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974563358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019207977,0.0003783122,0.9940591,0.0002788161,0.0008519844,0.00018053729,6.935696e-7,0.000020755995,0.0040377523],"genre_scores_gemma":[0.50606406,0.000021419222,0.4928439,0.00024479418,0.00023762196,0.0000072467583,4.3293653e-7,0.000009474736,0.00057106477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987402,0.00015841081,0.00032971325,0.000081538026,0.00041978544,0.0002703589],"domain_scores_gemma":[0.9988433,0.00010155662,0.00019547179,0.00024597955,0.00030767155,0.00030599302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014070541,0.00008082812,0.00018535242,0.00014412927,0.00005110152,0.00014481858,0.00056342426,0.000040309653,0.000006836926],"category_scores_gemma":[0.00007158236,0.00006395398,0.00006133514,0.00036051602,0.0000135176015,0.00035762496,0.000065755645,0.00014779152,0.000017631342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064791107,0.00015134623,0.0022190553,0.000025030164,0.00001023925,0.0000017052713,0.00013033811,0.98404485,0.000023824105,0.0034948192,0.009097989,0.00079431327],"study_design_scores_gemma":[0.0003681169,0.00021639756,0.0011321425,0.000032024287,0.0000035936494,0.000085367144,0.00005584631,0.97624356,0.000028828654,0.000018582732,0.021669973,0.00014554657],"about_ca_topic_score_codex":0.0000015306538,"about_ca_topic_score_gemma":1.2841585e-7,"teacher_disagreement_score":0.50587195,"about_ca_system_score_codex":0.000056549758,"about_ca_system_score_gemma":0.00009255219,"threshold_uncertainty_score":0.26079676},"labels":[],"label_agreement":null},{"id":"W1975011672","doi":"10.1007/s00446-008-0076-y","title":"Distributed computing with advice: information sensitivity of graph coloring","year":2009,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Computer science; Graph; Computation; Graph coloring; Sensitivity (control systems); Theoretical computer science; Greedy coloring; Algorithm; Line graph","score_opus":0.009462218466195972,"score_gpt":0.23770859518744922,"score_spread":0.22824637672125325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05178207,0.000013542274,0.9463267,0.00048288307,0.0000949243,0.00026927574,0.00006960071,0.00057647703,0.00038457333],"genre_scores_gemma":[0.9486211,0.000002635988,0.05069963,0.00019190584,0.000028953422,8.986331e-7,0.000448264,0.0000054972315,0.0000011439489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785614,0.00019842417,0.0005915082,0.0003167919,0.00050759,0.0005295643],"domain_scores_gemma":[0.9980598,0.00025431393,0.00045098158,0.0004558578,0.00061678287,0.00016223798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622462,0.00023133784,0.00033526355,0.00018811673,0.00035664946,0.00027933097,0.00048989995,0.00008597296,0.000002604914],"category_scores_gemma":[0.00013752223,0.00021795438,0.00008126787,0.001745491,0.0000656485,0.0010046558,0.00017507444,0.00028353292,0.0000075058697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045886503,0.00021929455,0.0062622465,0.000084412764,0.000064345426,0.00003150735,0.0013558856,0.8822149,0.00073748355,0.035492256,0.00055961555,0.07293217],"study_design_scores_gemma":[0.00075367733,0.00018688703,0.025744261,0.000132477,0.000008617884,0.000033476947,0.00014014717,0.9709319,0.0012467323,0.0002691793,0.00028389622,0.00026874477],"about_ca_topic_score_codex":0.000037157886,"about_ca_topic_score_gemma":0.0000026588186,"teacher_disagreement_score":0.896839,"about_ca_system_score_codex":0.00008520168,"about_ca_system_score_gemma":0.00010325377,"threshold_uncertainty_score":0.88879216},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011354233580310269,"score_gpt":0.22968399274611032,"score_spread":0.21832975916580005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975531816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083896,0.000050388604,0.98465955,0.0015905767,0.00030641974,0.00023935088,0.0000027180024,0.00038372647,0.0043776967],"genre_scores_gemma":[0.8455457,0.000043620767,0.15243077,0.0018637753,0.0000634902,0.000009900119,0.0000055275555,0.000009324222,0.00002785949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717176,0.00014132216,0.0003453802,0.00065915,0.0009624618,0.0007199518],"domain_scores_gemma":[0.9984288,0.00011861402,0.00008308946,0.00075801386,0.000215606,0.00039588386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319247,0.00020439594,0.00019782482,0.00021299774,0.00078570715,0.0004251479,0.0023511215,0.0000648234,0.00008717705],"category_scores_gemma":[0.0000366599,0.00017554729,0.000061690094,0.0011700409,0.0018663896,0.002069125,0.00080769946,0.00025014198,0.00023447683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053412314,0.00025413194,0.00024174567,0.000017989392,0.00000576817,0.000055545417,0.0018621123,0.0024667934,0.0009579968,0.8919352,0.0041014594,0.09809588],"study_design_scores_gemma":[0.00029226745,0.00024099309,0.00042799354,0.000018160528,0.000001426021,0.00023280598,0.000002902508,0.9799327,0.0032819558,0.015015024,0.00027144796,0.00028232805],"about_ca_topic_score_codex":0.000006660031,"about_ca_topic_score_gemma":5.597788e-7,"teacher_disagreement_score":0.9774659,"about_ca_system_score_codex":0.000090032954,"about_ca_system_score_gemma":0.00019223681,"threshold_uncertainty_score":0.7158611},"labels":[],"label_agreement":null},{"id":"W1976011284","doi":"10.1007/s00224-007-9085-7","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Online algorithm; Randomized algorithm; Cluster analysis; Partition (number theory); Upper and lower bounds; Extension (predicate logic); Computer science; Set (abstract data type); Mathematics; Combinatorics; Unit (ring theory); Algorithm; Artificial intelligence","score_opus":0.04092833779722757,"score_gpt":0.3136730632364606,"score_spread":0.272744725439233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976011284","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022373458,0.00019179356,0.9945263,0.0000464123,0.00069769955,0.0008611016,0.0000037742132,0.00019410634,0.0012414233],"genre_scores_gemma":[0.4292733,0.000005109,0.5697158,0.000088848254,0.0002034775,0.0000069665007,0.0000084746325,0.000017265193,0.00068073766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814636,0.00044448636,0.00063197326,0.00022197753,0.00023787143,0.0003173499],"domain_scores_gemma":[0.99681747,0.002218103,0.00028709942,0.00032534517,0.00026784258,0.000084112005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009720013,0.00012254524,0.0004702277,0.00018739636,0.00011512143,0.00007713279,0.00060150016,0.00005411366,0.0000021601375],"category_scores_gemma":[0.00017167864,0.000104834864,0.00012403201,0.0003077662,0.0000900528,0.00011170184,0.00016791119,0.00008661789,0.0000032868436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018041787,0.00014896494,0.000007124111,0.00029364348,0.00013678084,0.0000046594664,0.003795879,0.070012055,0.00017850309,0.5505238,0.00006368354,0.37303072],"study_design_scores_gemma":[0.025968688,0.00004934861,0.000008433529,0.00014476058,0.0000066544762,0.000013865027,0.00014001741,0.96996236,0.0001040875,0.0031096172,0.00037744522,0.000114747825],"about_ca_topic_score_codex":0.00001563032,"about_ca_topic_score_gemma":0.0000014233067,"teacher_disagreement_score":0.89995027,"about_ca_system_score_codex":0.000020449628,"about_ca_system_score_gemma":0.000041121846,"threshold_uncertainty_score":0.42750418},"labels":[],"label_agreement":null},{"id":"W1976290517","doi":"10.1007/s10846-010-9536-2","title":"Complex Task Allocation in Mobile Surveillance Systems","year":2011,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Task (project management); Computer science; Set (abstract data type); Tree (set theory); Mobile robot; Artificial intelligence; Distributed computing; Real-time computing; Robot; Data mining; Engineering","score_opus":0.07189908800088718,"score_gpt":0.2843704492275869,"score_spread":0.21247136122669974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976290517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023974956,0.0026642357,0.9902043,0.00008077923,0.0025650435,0.0005417461,8.14717e-7,0.000037390757,0.0015082362],"genre_scores_gemma":[0.99229556,0.00042774607,0.006752742,0.000036736743,0.00013203543,0.000021592707,0.0000017613925,0.000013869327,0.00031797696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714345,0.00044738513,0.001283408,0.00022198305,0.00058702915,0.0003167434],"domain_scores_gemma":[0.9979216,0.00013712946,0.0007100321,0.00040236453,0.00064900744,0.00017987535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019970317,0.00016449585,0.00046463808,0.00041226836,0.00005405855,0.00021744579,0.0010059455,0.000080183076,0.00002637057],"category_scores_gemma":[0.00007914967,0.00013416335,0.000101375044,0.00063905685,0.000037981106,0.00048801946,0.00008594177,0.00022619512,0.00007723044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002052473,0.00030952535,0.0068837553,0.0001552356,0.00006428564,0.00006829006,0.0033605173,0.96900046,0.00036150834,0.016441127,0.0014284711,0.0019062795],"study_design_scores_gemma":[0.00044861826,0.0005306345,0.0036862404,0.00044334188,0.000006086773,0.0004933175,0.0012223765,0.9885786,0.00012727913,0.00013300052,0.004056085,0.00027439892],"about_ca_topic_score_codex":0.0002438529,"about_ca_topic_score_gemma":0.000018347855,"teacher_disagreement_score":0.989898,"about_ca_system_score_codex":0.0002023056,"about_ca_system_score_gemma":0.00014184978,"threshold_uncertainty_score":0.5471023},"labels":[],"label_agreement":null},{"id":"W1977093483","doi":"10.1142/9789812776136_0002","title":"FRESCO: FLEXIBLE ALIGNMENT WITH RECTANGLE SCORING SCHEMES","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Rectangle; Fresco; Computer science; Artificial intelligence; Mathematics; Geometry; History","score_opus":0.017076907947766323,"score_gpt":0.2584471713434894,"score_spread":0.24137026339572307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977093483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021181356,0.00003079463,0.89679724,0.0004813504,0.000065541324,0.00010748178,9.558604e-8,0.00025791957,0.10014142],"genre_scores_gemma":[0.28722155,0.000012639477,0.7033283,0.00059399445,0.000034276567,0.0000065790955,9.107377e-7,0.000008082138,0.008793674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910915,0.000012079316,0.00011298616,0.00021493754,0.0002784032,0.000272471],"domain_scores_gemma":[0.9994873,0.00003140312,0.000024606756,0.00028924856,0.000057607536,0.00010983819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038225448,0.00006956957,0.000063027306,0.00008176744,0.000089646564,0.00012696284,0.00032785337,0.000021383901,0.00010081406],"category_scores_gemma":[0.000008930939,0.000051164458,0.000015654572,0.00037616724,0.000021274964,0.00034558406,0.00011555062,0.000058953494,0.000070484704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026576776,0.00020066285,0.006722694,0.000024765148,0.00004142495,0.000051833318,0.0009272595,0.00318591,0.0040175114,0.9132423,0.0041414136,0.06741768],"study_design_scores_gemma":[0.002849818,0.0011001308,0.0030635193,0.00018661158,0.000008422731,0.000070772345,0.000480639,0.1604123,0.6153424,0.0062565077,0.20904411,0.0011847755],"about_ca_topic_score_codex":0.000026787518,"about_ca_topic_score_gemma":0.00002537402,"teacher_disagreement_score":0.90698576,"about_ca_system_score_codex":0.00003408475,"about_ca_system_score_gemma":0.000040003604,"threshold_uncertainty_score":0.2086426},"labels":[],"label_agreement":null},{"id":"W1977603728","doi":"10.1016/j.tcs.2008.04.034","title":"Memoryless search algorithms in a network with faulty advice","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Advice (programming); Node (physics); Shortest path problem; Computer science; Network topology; Graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Path (computing); Discrete mathematics; Mathematics; Randomized algorithm; Algorithm; Theoretical computer science; Computer network; Artificial intelligence","score_opus":0.01864963886820921,"score_gpt":0.2649793731140586,"score_spread":0.24632973424584942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977603728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020740531,0.000017711074,0.9728495,0.0011326128,0.000170771,0.00025711692,4.6456992e-7,0.00024058476,0.0045907185],"genre_scores_gemma":[0.6049069,0.000010530281,0.39445662,0.0005177963,0.000066430206,0.000008172669,4.930879e-7,0.000006285919,0.000026742468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966659,0.00020424734,0.00026251172,0.00079579256,0.0011325489,0.00093899976],"domain_scores_gemma":[0.9983534,0.00020099817,0.000037445174,0.0007501576,0.00028820886,0.00036977237],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018314454,0.00017687066,0.00022202822,0.00022469356,0.00052757177,0.00026933008,0.0024781635,0.00004842264,0.000037988997],"category_scores_gemma":[0.00002765921,0.00013263516,0.000032168824,0.0033900929,0.0028755292,0.0008467724,0.00096605526,0.00035246296,0.00007033955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001505799,0.0001023079,0.00073295046,0.000005825206,0.0000025952531,0.00013879796,0.0014762135,0.06366836,0.000015474136,0.9208301,0.00009002022,0.012922303],"study_design_scores_gemma":[0.0004694206,0.00024384807,0.0029502122,0.00003467224,7.0979934e-7,0.00015726977,0.000008668375,0.9877713,0.00020329728,0.007863367,0.00007983658,0.00021740455],"about_ca_topic_score_codex":0.000015548265,"about_ca_topic_score_gemma":0.000004161977,"teacher_disagreement_score":0.92410296,"about_ca_system_score_codex":0.00007250013,"about_ca_system_score_gemma":0.00036363673,"threshold_uncertainty_score":0.99983805},"labels":[],"label_agreement":null},{"id":"W1977638907","doi":"10.1109/cse.2014.40","title":"On Utilizing Stochastic Non-linear Fractional Bin Packing to Resolve Distributed Web Crawling","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Crawling; Computer science; Scheme (mathematics); Task (project management); Resource allocation; Distributed computing; Bin packing problem; Bin; Knapsack problem; Software deployment; Web server; Linear programming; Mathematical optimization; Theoretical computer science; Algorithm; The Internet; Mathematics; World Wide Web; Computer network; Engineering","score_opus":0.028487858279956927,"score_gpt":0.29194799869205523,"score_spread":0.2634601404120983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977638907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014854554,0.0000017801684,0.99190414,0.002119376,0.00025507266,0.00017179106,0.000003970472,0.00021396493,0.003844424],"genre_scores_gemma":[0.8680921,8.4270465e-7,0.12999578,0.0014609487,0.00009400028,0.000013687676,0.000014414666,0.000010602185,0.00031759578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863297,0.00005804486,0.0002080245,0.00037561997,0.0004026331,0.00032272466],"domain_scores_gemma":[0.99891096,0.00034225677,0.00004831161,0.00035054854,0.00014661028,0.00020132588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047627377,0.00012029453,0.00012243418,0.00017170991,0.00023680196,0.00019832955,0.00042029287,0.000049668568,0.00010604095],"category_scores_gemma":[0.00039876535,0.000107177766,0.000044038403,0.00051036174,0.000017208326,0.00026595662,0.00018518767,0.00018849382,0.00038162095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015090717,0.00007714854,0.00005807669,0.0000074650266,0.000010798958,0.0000023413727,0.00021190273,0.90597904,0.0014340746,0.08619665,0.0024233393,0.0035840783],"study_design_scores_gemma":[0.0002767283,0.000105937324,0.0001426447,0.000041215782,0.0000012196023,0.0000020523578,0.000021665095,0.99528384,0.00036920424,0.0011472879,0.0024677769,0.00014042694],"about_ca_topic_score_codex":0.000015104079,"about_ca_topic_score_gemma":0.000010043182,"teacher_disagreement_score":0.86660665,"about_ca_system_score_codex":0.000054396583,"about_ca_system_score_gemma":0.000066403714,"threshold_uncertainty_score":0.49050924},"labels":[],"label_agreement":null},{"id":"W1977849109","doi":"10.1109/syscon.2014.6819239","title":"FPGA implementation of multiple Pursuit-Evasion games with decentralized Learning Automata","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Field-programmable gate array; Computer science; Learning automata; VHDL; Hardware description language; Markov chain; Reconfigurable computing; Embedded system; Automaton; Artificial intelligence; Machine learning","score_opus":0.015751810129448214,"score_gpt":0.28147534086640064,"score_spread":0.26572353073695243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977849109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019129064,0.0000064150518,0.9785461,0.00065403664,0.000035367568,0.00018906035,3.850858e-7,0.0001945017,0.0012450706],"genre_scores_gemma":[0.84140456,0.000023492908,0.15817803,0.000094172596,0.000005537119,0.000008509323,0.000009105566,0.000005627415,0.0002709694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901634,0.00011609635,0.00017276175,0.00019152084,0.00031482504,0.00018846316],"domain_scores_gemma":[0.99942464,0.00008568607,0.00009226799,0.00022283042,0.00010705424,0.000067546905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003697724,0.000072096096,0.000103283746,0.00007579956,0.000075205426,0.0000948988,0.00032680354,0.000021305937,0.0001495964],"category_scores_gemma":[0.0000438375,0.000053494125,0.000022538788,0.000233021,0.000023439321,0.00037732508,0.000106244006,0.000056009187,0.000015465122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042295065,0.00017578919,0.06695094,0.000082785155,0.00004882503,0.0000017563004,0.00328762,0.044053875,0.007939211,0.053160567,0.0018735222,0.8223828],"study_design_scores_gemma":[0.0024073885,0.0003708391,0.015738271,0.00002150182,0.0000041018197,0.0000033678978,0.00025216333,0.9431377,0.028945038,0.00022547701,0.008748996,0.00014515014],"about_ca_topic_score_codex":0.00010805452,"about_ca_topic_score_gemma":0.000066607034,"teacher_disagreement_score":0.89908385,"about_ca_system_score_codex":0.000013580938,"about_ca_system_score_gemma":0.000040348965,"threshold_uncertainty_score":0.21814272},"labels":[],"label_agreement":null},{"id":"W1979499253","doi":"","title":"Dynamic optimality for skip lists and B-trees","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Upper and lower bounds; Binary tree; Computer science; Binary search tree; Tree (set theory); Set (abstract data type); Weight-balanced tree; Branching (polymer chemistry); Combinatorics; Class (philosophy); Sequence (biology); Optimal binary search tree; Context (archaeology); Search tree; Ternary search tree; Binary number; Binary decision diagram; Discrete mathematics; Theoretical computer science; Mathematics; Interval tree; Algorithm; Search algorithm; Tree structure; Arithmetic; Artificial intelligence","score_opus":0.02942393810886324,"score_gpt":0.2859440844393497,"score_spread":0.2565201463304865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979499253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007285806,0.000038767834,0.9862455,0.0015365203,0.000042728087,0.00015771517,0.0000013514239,0.000112741254,0.0045788516],"genre_scores_gemma":[0.434523,0.00006446765,0.56028765,0.0003548953,0.0000055229684,0.000013849428,0.000002268977,0.0000030976873,0.0047452324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995128,0.000015537631,0.00008128793,0.00017445724,0.00008512466,0.00013082681],"domain_scores_gemma":[0.9996402,0.0000502523,0.000015487041,0.00017078425,0.00005646961,0.00006679334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012126106,0.000047825644,0.000060501072,0.000032531807,0.00012323954,0.000054936212,0.00019594912,0.00002190947,0.000018067045],"category_scores_gemma":[0.000024505936,0.000039509323,0.000019851293,0.00009122207,0.000042878062,0.0002505771,0.0000907029,0.000028242204,0.000008184326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034929955,0.00047168776,0.013468664,0.00012504574,0.000060724797,0.000030934665,0.004690917,0.013682948,0.0010677283,0.85890484,0.02505253,0.08240903],"study_design_scores_gemma":[0.00026078225,0.000049825412,0.006499034,0.0000020213165,5.1671157e-7,0.00001528278,0.0000055467945,0.9883134,0.00007386005,0.0018146009,0.0028903852,0.00007477407],"about_ca_topic_score_codex":0.000016382495,"about_ca_topic_score_gemma":0.000025903373,"teacher_disagreement_score":0.9746304,"about_ca_system_score_codex":0.000008610756,"about_ca_system_score_gemma":0.000027993752,"threshold_uncertainty_score":0.16111435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.018372535556696407,"score_gpt":0.2655600713819139,"score_spread":0.2471875358252175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980155648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042936285,0.000009379895,0.98646426,0.0037522286,0.00040760232,0.00021666054,8.689895e-7,0.00035238717,0.004502983],"genre_scores_gemma":[0.56136256,0.0000055216533,0.43810856,0.00044922912,0.000049599592,0.000008042871,0.0000011514483,0.000005086997,0.0000102350805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750745,0.000082204126,0.0002576732,0.0006907246,0.00087776134,0.0005842068],"domain_scores_gemma":[0.99855566,0.00005171568,0.000056764697,0.0007229359,0.00025961225,0.00035333133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012040782,0.00016813369,0.00015817423,0.00025604598,0.0004953691,0.00079413847,0.0021273063,0.00004880665,0.000025306234],"category_scores_gemma":[0.000049077244,0.00013960515,0.000057441124,0.0016347823,0.0017627333,0.0021251577,0.0007582953,0.00019740216,0.00019540881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033574026,0.00006172967,0.000015918633,0.0000027333924,0.0000018548349,0.000005531776,0.00063489703,0.04910685,0.00021393945,0.94490033,0.000017078208,0.0050357906],"study_design_scores_gemma":[0.0005564593,0.00030803753,0.000099121185,0.000025513633,0.0000020800076,0.00003239748,0.000011153607,0.5301095,0.0043775844,0.46407613,0.0001458346,0.0002561374],"about_ca_topic_score_codex":0.0000031716027,"about_ca_topic_score_gemma":5.7850104e-7,"teacher_disagreement_score":0.55706894,"about_ca_system_score_codex":0.00007014372,"about_ca_system_score_gemma":0.00023271162,"threshold_uncertainty_score":0.76578957},"labels":[],"label_agreement":null},{"id":"W1981392728","doi":"10.1007/s00446-014-0234-3","title":"Localization for a system of colliding robots","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Position (finance); Conjecture; Ring (chemistry); Mobile robot; Energy (signal processing); Motion (physics); Trajectory; Momentum (technical analysis); Physics; Topology (electrical circuits); Computer science; Mathematics; Control theory (sociology); Combinatorics; Classical mechanics; Artificial intelligence; Quantum mechanics; Control (management)","score_opus":0.017592758448582733,"score_gpt":0.2551770093600642,"score_spread":0.23758425091148147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981392728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057688495,0.000012143716,0.99840534,0.00008882922,0.00015990585,0.00023562307,0.000010910664,0.00020862084,0.0003017307],"genre_scores_gemma":[0.9093128,4.4991435e-7,0.09054113,0.00003519214,0.000034029603,0.0000054258917,0.00006088213,0.0000057717725,0.00000434376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.00008057814,0.0002851465,0.00020919337,0.00016103842,0.00021085276],"domain_scores_gemma":[0.99905103,0.00019588695,0.00016261206,0.00023885543,0.00029216264,0.000059472834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005611363,0.00007756975,0.00015653095,0.00006426013,0.00017458256,0.00009352442,0.00039755236,0.000041371277,7.121932e-7],"category_scores_gemma":[0.0001314092,0.000078187986,0.000049378512,0.00048166257,0.000015888323,0.0001113969,0.00008776983,0.000039660626,0.0000024587637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024265407,0.000020398655,0.00043500948,0.00013082798,0.000008486719,2.2529449e-7,0.00013919806,0.70859987,0.00017961382,0.28297558,0.00027517782,0.0072332015],"study_design_scores_gemma":[0.00035419647,0.000050483828,0.00008119364,0.00009413055,0.0000030560966,0.0000021590404,0.000040782816,0.9967276,0.0015329855,0.00027895896,0.0007525419,0.00008191239],"about_ca_topic_score_codex":0.0000052535515,"about_ca_topic_score_gemma":3.3381812e-7,"teacher_disagreement_score":0.9087359,"about_ca_system_score_codex":0.00004785628,"about_ca_system_score_gemma":0.000032307355,"threshold_uncertainty_score":0.31884137},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009257801723203448,"score_gpt":0.2502785384484939,"score_spread":0.24102073672529045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981643246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030999174,0.00031258704,0.9498494,0.005410093,0.0008608391,0.0014362715,0.000020934322,0.00063796685,0.010472687],"genre_scores_gemma":[0.9937104,0.000017035238,0.005490917,0.0005252968,0.00009079885,0.00010783252,0.0000061985756,0.000015980982,0.00003555527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969621,0.0011093515,0.00036134338,0.00046752728,0.0004910581,0.00060862006],"domain_scores_gemma":[0.9936168,0.0049771564,0.00014863552,0.0010975564,0.00007914006,0.00008068337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041596773,0.00023015405,0.0001794315,0.00010026798,0.0009134074,0.00067557447,0.0025578358,0.00010355711,0.00002092691],"category_scores_gemma":[0.0010038692,0.000128125,0.00011104037,0.0006783449,0.00016284936,0.00009406786,0.00030179214,0.00086926465,0.00003489634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041155796,0.00021673959,0.000086010434,0.000015996018,0.000041113726,0.000024538836,0.0021520166,0.059373215,0.0004858601,0.62041837,0.0015542508,0.31559074],"study_design_scores_gemma":[0.0011362968,0.0004409212,0.006227405,0.00029871872,0.000038461963,0.00016451548,0.0010765892,0.509304,0.011567679,0.3789071,0.089353204,0.001485139],"about_ca_topic_score_codex":0.000012238904,"about_ca_topic_score_gemma":0.000033383432,"teacher_disagreement_score":0.9627112,"about_ca_system_score_codex":0.000053624295,"about_ca_system_score_gemma":0.000080899685,"threshold_uncertainty_score":0.70252836},"labels":[],"label_agreement":null},{"id":"W1981710280","doi":"10.1145/1077464.1077467","title":"A maiden analysis of longest wait first","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Scheduling (production processes); Computer science; Competitive analysis; Combinatorics; Mathematics; Distributed computing; Mathematical optimization","score_opus":0.025029759575546602,"score_gpt":0.2748734465406962,"score_spread":0.24984368696514958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981710280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064903864,0.000030220413,0.9923614,0.005903878,0.00008674043,0.00011788228,0.000017761806,0.00012143674,0.00071160175],"genre_scores_gemma":[0.5084413,0.00017572955,0.48951998,0.00037597612,0.000029205185,0.000032196058,0.0000064646356,0.000011173607,0.00140795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883777,0.000041444964,0.0002662902,0.00030117712,0.00033774177,0.00021558268],"domain_scores_gemma":[0.9986904,0.000138672,0.00006220887,0.00088004116,0.00011529012,0.00011337762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019450943,0.00011259131,0.00020566782,0.00059513765,0.00015285172,0.00006951134,0.000876472,0.00006086992,0.00057068147],"category_scores_gemma":[0.00001778995,0.00010711752,0.0001850322,0.0020262531,0.000046386678,0.00040623147,0.00001573734,0.00014538693,0.00013895998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067960173,0.00044702334,0.000079397854,0.00000950843,0.0005653607,0.0000038292383,0.0011133549,0.52876705,0.00003940395,0.0014092966,0.00013041352,0.46742854],"study_design_scores_gemma":[0.00036531707,0.000113913535,0.0025629578,0.000010978622,0.00014176348,0.000003632725,0.000031007465,0.99000007,0.0010494663,0.000206146,0.005345894,0.00016885085],"about_ca_topic_score_codex":0.0000619455,"about_ca_topic_score_gemma":0.0002811868,"teacher_disagreement_score":0.5077923,"about_ca_system_score_codex":0.000055697503,"about_ca_system_score_gemma":0.000038210215,"threshold_uncertainty_score":0.62485623},"labels":[],"label_agreement":null},{"id":"W1983335618","doi":"10.1016/s0890-5401(03)00081-6","title":"Searching and on-line recognition of star-shaped polygons","year":2003,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Star (game theory); Competitive analysis; Combinatorics; Line (geometry); Rectilinear polygon; Visibility polygon; Polygon covering; Path (computing); Computer science; Upper and lower bounds; Mathematics; Artificial intelligence; Monotone polygon; Simple polygon; Geometry","score_opus":0.04476430482108747,"score_gpt":0.29182407910099006,"score_spread":0.2470597742799026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983335618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06378556,0.00001423288,0.93203336,0.00036232613,0.00004838862,0.0001533535,0.0000029104265,0.000048010843,0.003551847],"genre_scores_gemma":[0.95023173,0.000045124838,0.04926659,0.00040715237,0.0000037946506,0.0000040889427,0.000027787575,0.0000017887527,0.000011935337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994141,0.00006416132,0.00021235282,0.00007094437,0.00015717532,0.000081250095],"domain_scores_gemma":[0.99959636,0.000071966184,0.00009333768,0.00005747027,0.00012709822,0.000053786647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028575375,0.000053702544,0.00006340536,0.00017220703,0.00009172652,0.00012319842,0.00004709911,0.000025615198,0.0000073367846],"category_scores_gemma":[0.000065632936,0.000051193463,0.000010654945,0.0001854929,0.000023600503,0.0010908913,0.000022719816,0.00006120519,0.000010263977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001863313,0.00004997768,0.00010484752,0.00008432998,0.000012310506,3.5078173e-7,0.005183814,0.019506484,0.0001298209,0.14744297,0.000068920795,0.8273975],"study_design_scores_gemma":[0.00054234866,0.00015729146,0.0007268978,0.000023845334,0.0000014653831,0.000007139058,0.00015848166,0.98764753,0.00025920468,0.00971084,0.00069102494,0.00007390571],"about_ca_topic_score_codex":0.000008808095,"about_ca_topic_score_gemma":0.0000011390782,"teacher_disagreement_score":0.9681411,"about_ca_system_score_codex":0.000008533853,"about_ca_system_score_gemma":0.000032481803,"threshold_uncertainty_score":0.20876089},"labels":[],"label_agreement":null},{"id":"W1983693678","doi":"10.1016/j.tcs.2010.01.004","title":"Fast radio broadcasting with advice","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Broadcasting (networking); Advice (programming); Computer science; Constant (computer programming); Radio broadcasting; Radio networks; Computer network; Broadcast communication network; Theoretical computer science; Telecommunications; Wireless network; Wireless","score_opus":0.006882577268605463,"score_gpt":0.23766120430507173,"score_spread":0.23077862703646626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983693678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010912126,0.0000030769295,0.97136533,0.0014094482,0.0004347651,0.00014251485,4.1563817e-7,0.00042834476,0.015303973],"genre_scores_gemma":[0.5422846,6.295224e-7,0.4572464,0.00036116623,0.00007318702,0.0000033750764,2.445312e-7,0.000005102803,0.000025309011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976819,0.000058586305,0.00019140623,0.00066606305,0.00078445626,0.0006175567],"domain_scores_gemma":[0.9982364,0.00017234255,0.000054467073,0.00081885216,0.0003106295,0.00040729012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001272418,0.00015600992,0.00014294569,0.00017306834,0.0005238982,0.00080827135,0.002568799,0.00004278743,0.00009322182],"category_scores_gemma":[0.000082830826,0.00011203962,0.000030157977,0.001511045,0.0024996689,0.0009959606,0.00077655754,0.00042060745,0.000106821826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003611187,0.000033671935,0.000086508604,0.0000033103452,0.0000016038391,0.00001047087,0.0003836634,0.0010708843,0.0010956378,0.9566171,0.000034345165,0.0406592],"study_design_scores_gemma":[0.00025246025,0.00018038218,0.00044520426,0.000015280035,0.0000014683447,0.00013293752,0.000004680618,0.9831795,0.0014941624,0.013721055,0.00036712678,0.00020573362],"about_ca_topic_score_codex":0.0000033206877,"about_ca_topic_score_gemma":0.000002054211,"teacher_disagreement_score":0.98210865,"about_ca_system_score_codex":0.000018936276,"about_ca_system_score_gemma":0.0002033296,"threshold_uncertainty_score":0.9210134},"labels":[],"label_agreement":null},{"id":"W1983997639","doi":"10.1145/2090236.2090246","title":"Paging for multi-core shared caches","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Cache; CPU cache; Core (optical fiber); Multi-core processor; Metric (unit); Competitive analysis; Parallel computing; Cache algorithms; Computer network; Distributed computing; Upper and lower bounds; Telecommunications","score_opus":0.2318437048557492,"score_gpt":0.3587837408272864,"score_spread":0.12694003597153722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983997639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024167208,0.000044753182,0.9961762,0.0006254286,0.00013361781,0.00016437049,0.0000011369802,0.00014660414,0.002466238],"genre_scores_gemma":[0.18847302,0.0000027778651,0.80728877,0.00058279466,0.000041569117,0.000031707954,0.0000039548263,0.000004607152,0.0035707941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950063,0.000009262869,0.00007383677,0.00010488253,0.00007625356,0.00023510616],"domain_scores_gemma":[0.9996478,0.00003428378,0.000016124503,0.00016213396,0.000046962483,0.00009272719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002053599,0.00004552867,0.000047135407,0.00003690204,0.00007628357,0.000080644255,0.00023129354,0.000019136027,0.000058869133],"category_scores_gemma":[0.00003448041,0.000036434285,0.00002674499,0.00009990946,0.000008282408,0.00056110317,0.000087761735,0.00002943721,0.00005192921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062893796,0.0005016448,0.03466173,0.000087194625,0.00004078246,0.0000010838348,0.011597919,0.0017809356,0.0020788456,0.802231,0.03656026,0.11045228],"study_design_scores_gemma":[0.00031788912,0.000012806612,0.0016713368,0.000003815657,8.6849934e-7,0.0000012741089,0.0000414534,0.9830511,0.00071782694,0.00024894468,0.01384359,0.000089070854],"about_ca_topic_score_codex":0.000008214999,"about_ca_topic_score_gemma":0.0000033014142,"teacher_disagreement_score":0.9812702,"about_ca_system_score_codex":0.00001055448,"about_ca_system_score_gemma":0.000014770341,"threshold_uncertainty_score":0.1485747},"labels":[],"label_agreement":null},{"id":"W1984231426","doi":"10.1145/1711475.1714372","title":"On Developing New Models, with Paging as a Case Study","year":2010,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Paging; Contrast (vision); Cache; Theoretical computer science; Computation; Data science; Artificial intelligence; Algorithm; Parallel computing","score_opus":0.054009181967706786,"score_gpt":0.30892744113052567,"score_spread":0.2549182591628189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984231426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38847703,0.0000053370686,0.6040685,0.0032704328,0.00017003824,0.00044047507,1.8084029e-7,0.00021396921,0.003354026],"genre_scores_gemma":[0.8075356,0.0000027578126,0.1905315,0.0013374758,0.000038871778,0.000012805776,5.825175e-7,0.000012523598,0.0005278737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886775,0.000050807477,0.00015054522,0.00036727774,0.0002948007,0.00026881308],"domain_scores_gemma":[0.9986312,0.00014501724,0.000053660297,0.0009130354,0.00006899327,0.00018809075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020414733,0.00013493148,0.000120055374,0.0001140295,0.00018873897,0.0003197946,0.0008001079,0.00003633249,0.000030751187],"category_scores_gemma":[0.00011984773,0.0001031935,0.00002106268,0.00039036985,0.00001479716,0.0006277792,0.0002967789,0.00029287636,0.00007516445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008995629,0.0010891334,0.0062820963,0.000033370292,0.00018480545,0.011663814,0.0676529,0.073688336,0.00094140443,0.38143092,0.008369338,0.44857392],"study_design_scores_gemma":[0.007706406,0.0031229812,0.00055884465,0.00015988841,0.000034714576,0.005412847,0.005625154,0.8457701,0.0017540773,0.11756541,0.010146157,0.002143381],"about_ca_topic_score_codex":0.0015043436,"about_ca_topic_score_gemma":0.0012983285,"teacher_disagreement_score":0.7720818,"about_ca_system_score_codex":0.000021403757,"about_ca_system_score_gemma":0.00035674075,"threshold_uncertainty_score":0.42081088},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025111813245434718,"score_gpt":0.3120113948574338,"score_spread":0.2868995816119991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984719907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019235913,0.000019245801,0.9724547,0.00012594044,0.00005364388,0.007478134,0.000016044336,0.00023379475,0.00038258106],"genre_scores_gemma":[0.8802769,0.0000011539479,0.1173456,0.00013891872,0.00014316812,0.0017712101,0.00027115943,0.000019580999,0.000032262535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980365,0.00012566011,0.00043076053,0.00047131968,0.00025456838,0.0006811789],"domain_scores_gemma":[0.99914086,0.00018117602,0.00012002354,0.00034774074,0.00011144173,0.00009875417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068446004,0.00016935682,0.00021187439,0.00012429518,0.00021276693,0.00044041584,0.00078745355,0.00007565095,0.000005696114],"category_scores_gemma":[0.00003331737,0.00017753837,0.00008651515,0.000773529,0.000047769296,0.00031594795,0.00026329255,0.00026528168,0.000008576883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008784551,0.0001474263,0.00097395864,0.00003392355,0.00000530689,0.000011182042,0.00016833712,0.98491275,0.00003175967,0.008067607,0.0009016587,0.0047372794],"study_design_scores_gemma":[0.0009270316,0.00009386793,0.0013339493,0.0001098051,0.0000011665688,0.0000017522149,0.000033114586,0.9940535,0.00013726218,0.00068598764,0.0024264515,0.00019610375],"about_ca_topic_score_codex":0.000039236576,"about_ca_topic_score_gemma":0.0000035759626,"teacher_disagreement_score":0.861041,"about_ca_system_score_codex":0.00008846001,"about_ca_system_score_gemma":0.00008774924,"threshold_uncertainty_score":0.7239804},"labels":[],"label_agreement":null},{"id":"W1985522690","doi":"10.1016/j.dam.2008.11.011","title":"Edge searching weighted graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Pathwidth; Graph; Enhanced Data Rates for GSM Evolution; Monotonic function; Edge cover; Discrete mathematics; Line graph; Computer science; Artificial intelligence","score_opus":0.017714882409356578,"score_gpt":0.2656131470015109,"score_spread":0.2478982645921543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985522690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001282379,0.000018641587,0.88554925,0.00083751563,0.000038645576,0.00030584773,0.0000013632321,0.00033013851,0.11163622],"genre_scores_gemma":[0.24799407,0.000028192939,0.7509079,0.0006388096,0.000026330508,0.000020074483,0.0000098318715,0.000014244919,0.0003605376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868083,0.000018034923,0.00026738466,0.00027767604,0.0003949179,0.00036116978],"domain_scores_gemma":[0.9990516,0.00007199004,0.000080449296,0.00059619057,0.000048523194,0.00015129014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033453517,0.00015232121,0.00018443019,0.00013693348,0.00017280864,0.00025692364,0.00078955403,0.000054018925,0.00003979135],"category_scores_gemma":[0.000016725984,0.0001267739,0.00006260373,0.00049734995,0.000037171267,0.00022558717,0.00013597417,0.0001806961,0.00015173083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012381079,0.00006571688,0.0000013628737,0.000021883327,0.0000073373753,0.000002760385,0.0016082954,0.000101050384,0.0018983282,0.9832352,0.0006020522,0.012454771],"study_design_scores_gemma":[0.00038693115,0.00005515687,0.0000559064,0.000028713312,0.0000055551764,0.000007280164,0.00011798877,0.3081466,0.0023132071,0.6874291,0.0011745762,0.00027905763],"about_ca_topic_score_codex":7.281166e-7,"about_ca_topic_score_gemma":3.4916505e-7,"teacher_disagreement_score":0.30804554,"about_ca_system_score_codex":0.00001809527,"about_ca_system_score_gemma":0.000035776782,"threshold_uncertainty_score":0.51696897},"labels":[],"label_agreement":null},{"id":"W1985734068","doi":"10.1016/j.tcs.2014.02.026","title":"The Covering Canadian Traveller Problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Shortest path problem; Routing (electronic design automation); Competitive analysis; Computer science; Mathematical optimization; A priori and a posteriori; Set (abstract data type); Path (computing); Variation (astronomy); Operations research; Mathematics; Upper and lower bounds; Theoretical computer science; Computer network","score_opus":0.006748960221634481,"score_gpt":0.21944515269249248,"score_spread":0.212696192470858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985734068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049120537,0.000007459466,0.9477107,0.0062043667,0.000353154,0.00015282509,2.9112047e-7,0.000107160035,0.04497286],"genre_scores_gemma":[0.85304415,0.0000063442144,0.14551349,0.0012883795,0.00006773992,0.000006800523,2.2215444e-7,0.0000052568603,0.00006761875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793285,0.00012774197,0.00018665074,0.0004436464,0.0005574198,0.0007516862],"domain_scores_gemma":[0.99827224,0.0002619723,0.000031477502,0.0006994912,0.00018192023,0.00055288355],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026020189,0.00011485802,0.00009493804,0.00012473369,0.0013837377,0.0012439395,0.00294189,0.000032737928,0.000026368607],"category_scores_gemma":[0.000095281204,0.00007416559,0.00003534173,0.0009258762,0.0017246732,0.00042620106,0.0005030858,0.0001763203,0.00015128209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.5677335e-7,0.000005080237,0.000015449228,0.0000012626621,0.0000010237588,9.091128e-7,0.00020951322,0.0011925108,0.00003057776,0.93477064,0.00013147967,0.06364089],"study_design_scores_gemma":[0.00008995572,0.000070372094,0.00024828166,0.0000075175494,5.549247e-7,0.0000099238505,0.0000024291176,0.8529435,0.00026000015,0.13596255,0.01028789,0.000117068426],"about_ca_topic_score_codex":0.00028279104,"about_ca_topic_score_gemma":0.00031311772,"teacher_disagreement_score":0.85255295,"about_ca_system_score_codex":0.00007367177,"about_ca_system_score_gemma":0.00032521848,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W1986121630","doi":"10.1109/ssrr.2009.5424167","title":"Market-based dynamic task allocation in mobile surveillance systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Distributed computing; Mobile robot; Set (abstract data type); Tree (set theory); Mobile telephony; Volume (thermodynamics); Mobile computing; Real-time computing; Robot; Artificial intelligence; Computer network; Mobile radio; Engineering","score_opus":0.007869853526240122,"score_gpt":0.24824548131929575,"score_spread":0.24037562779305563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986121630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018739429,0.0001683974,0.9840355,0.0012018587,0.00012533048,0.0003851003,8.650698e-7,0.00019073092,0.012018301],"genre_scores_gemma":[0.9831487,0.000032175278,0.014648453,0.00037758434,0.000005953681,0.000031847856,0.000006870264,0.000003151181,0.0017452559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990599,0.0001268961,0.00018862712,0.00023897573,0.00019285691,0.00019270729],"domain_scores_gemma":[0.9994472,0.00005533441,0.0000380903,0.00033230314,0.00007209004,0.000054956756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052361726,0.000072738774,0.0000966097,0.00012599399,0.000034584646,0.00013971454,0.00037164186,0.000037956794,0.000033241606],"category_scores_gemma":[0.000019480429,0.00006569743,0.000018695047,0.0005513064,0.000010620774,0.00023468025,0.000021159925,0.000063719745,0.000038216847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018317181,0.00039869704,0.0044329823,0.000053495063,0.000005781401,0.000015336394,0.000286315,0.87589914,0.001240114,0.032580253,0.005619545,0.07945004],"study_design_scores_gemma":[0.00025162095,0.00006273544,0.010847776,0.000011193921,1.2804982e-7,8.3010525e-7,0.000009408792,0.98698705,0.000019167528,0.00011674728,0.0016055295,0.00008780461],"about_ca_topic_score_codex":0.000035737143,"about_ca_topic_score_gemma":0.00005683525,"teacher_disagreement_score":0.9812748,"about_ca_system_score_codex":0.00006637649,"about_ca_system_score_gemma":0.00006805803,"threshold_uncertainty_score":0.26790634},"labels":[],"label_agreement":null},{"id":"W1988381536","doi":"10.1007/s00453-013-9800-5","title":"Parameterized Analysis of Paging and List Update Algorithms","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Paging; Locality; Algorithm; Cache; Theory of computation; Locality of reference; Online algorithm; Cache algorithms; Set (abstract data type); Memory hierarchy; CPU cache; Theoretical computer science; Parallel computing","score_opus":0.011120576140118882,"score_gpt":0.2412701161776356,"score_spread":0.23014954003751673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988381536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142107075,0.00009172089,0.98309374,0.0016137188,0.000075329364,0.00019628649,0.0000065677136,0.00009622291,0.00061572454],"genre_scores_gemma":[0.35279962,0.00010611234,0.64622533,0.00054551166,0.000018696972,0.00003254899,0.00001888743,0.000009230007,0.00024402881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.00007344643,0.00026107676,0.00030536499,0.00021557415,0.00022707622],"domain_scores_gemma":[0.9991471,0.00008854899,0.00009463485,0.000401317,0.00014338335,0.00012502108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021365692,0.00010388562,0.0002627562,0.00032581578,0.00006926588,0.0001987595,0.00040776966,0.000040565534,0.00016529919],"category_scores_gemma":[0.000028792174,0.00009162376,0.00007709633,0.0011819949,0.00007853851,0.00047101537,0.00022810507,0.00008103963,0.000025797395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004584152,0.00019482925,0.0021894332,0.000037101167,0.00141079,0.000011833866,0.001624529,0.0018674156,0.0036045082,0.019381441,0.0015793301,0.9680942],"study_design_scores_gemma":[0.00022427301,0.000028896196,0.0024780873,0.000004643423,0.00005147976,0.0000020942418,0.000018856943,0.99421746,0.0006875182,0.0013484152,0.00081896386,0.00011932029],"about_ca_topic_score_codex":0.00021780442,"about_ca_topic_score_gemma":0.0000029875323,"teacher_disagreement_score":0.99235004,"about_ca_system_score_codex":0.000010204452,"about_ca_system_score_gemma":0.000020457861,"threshold_uncertainty_score":0.37363085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04834175643551917,"score_gpt":0.2885700570184015,"score_spread":0.24022830058288233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988551609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029268397,0.0009986884,0.9930311,0.00008212479,0.00089632533,0.00021305746,9.0124416e-7,0.00012442509,0.0017265425],"genre_scores_gemma":[0.99236286,0.00014853461,0.006394476,0.0006691801,0.00019782023,0.000020594196,0.00001658208,0.000012947137,0.0001770115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982418,0.0003975539,0.0002612179,0.00025109088,0.00018202873,0.0006663038],"domain_scores_gemma":[0.99881315,0.0004050534,0.00007004106,0.00042617094,0.00008394171,0.00020163115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065917446,0.0001377941,0.00019004966,0.0000915767,0.000082269624,0.00011947563,0.00052601076,0.00011237094,0.000027497055],"category_scores_gemma":[0.00004888247,0.00013293287,0.00003629206,0.00071575795,0.000043739106,0.00037407575,0.0002443788,0.0002933242,0.00003722774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017046656,0.00014509066,0.084901474,0.000007029295,0.000012625187,0.000019431165,0.0004646814,0.86513656,0.0000013885993,0.0041621733,0.005886314,0.03924618],"study_design_scores_gemma":[0.00025536132,0.00003116453,0.13145648,0.00001615664,0.0000011297061,0.000009636437,0.0000056509475,0.86600554,4.958807e-7,0.00006561015,0.0020092821,0.00014350799],"about_ca_topic_score_codex":0.00006763393,"about_ca_topic_score_gemma":0.0001311606,"teacher_disagreement_score":0.98943603,"about_ca_system_score_codex":0.000043355998,"about_ca_system_score_gemma":0.000029767589,"threshold_uncertainty_score":0.5420845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00716953051749322,"score_gpt":0.2238464719368621,"score_spread":0.21667694141936888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988889787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003561816,0.000102287595,0.96655774,0.0013563712,0.00029940502,0.0002207468,0.0000026740595,0.00027236392,0.027626568],"genre_scores_gemma":[0.8306001,0.000009849199,0.16778293,0.0002881532,0.000044487977,0.000022570286,0.0000062637137,0.000009199559,0.001236453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916464,0.0000422043,0.00017001525,0.0002267345,0.00016168086,0.00023473761],"domain_scores_gemma":[0.99958163,0.000045164987,0.000029318873,0.00026861997,0.000031080104,0.000044178152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013439196,0.00007182709,0.00008487681,0.00015103596,0.00004614204,0.00008710234,0.00040814033,0.000036350837,0.00001850493],"category_scores_gemma":[0.000014285566,0.00006976389,0.000028007078,0.00046340542,0.000029651776,0.00017612767,0.00008781982,0.0000888118,0.0000709498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060672783,0.00043861597,0.0019616685,0.000023651923,0.000010232147,0.00040166077,0.00046582153,0.005350041,0.00052184536,0.60463566,0.007916503,0.3782682],"study_design_scores_gemma":[0.0007011457,0.000089069734,0.006951891,0.000016439184,0.0000017439573,0.00003853677,0.00000802106,0.875914,0.0005620472,0.105946176,0.009487852,0.00028307314],"about_ca_topic_score_codex":0.00011148148,"about_ca_topic_score_gemma":0.000037714137,"teacher_disagreement_score":0.870564,"about_ca_system_score_codex":0.000021394504,"about_ca_system_score_gemma":0.000036490586,"threshold_uncertainty_score":0.2844889},"labels":[],"label_agreement":null},{"id":"W1989886714","doi":"10.1016/j.dam.2007.08.045","title":"Digraph searching, directed vertex separation and directed pathwidth","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Vertex (graph theory); Mathematics; Directed graph; Directed acyclic graph; Combinatorics; Strongly connected component; Graph","score_opus":0.01467820838175314,"score_gpt":0.2815725775623087,"score_spread":0.26689436918055554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989886714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015307262,0.00004580245,0.94614327,0.00014021593,0.0000630421,0.00050727685,0.000003956281,0.0008872418,0.036901955],"genre_scores_gemma":[0.48567635,0.00006930622,0.51358205,0.00018237623,0.000027345679,0.000035264995,0.000034475383,0.00002986665,0.000362958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845505,0.000026662308,0.00034618756,0.000349251,0.00042370358,0.00039916657],"domain_scores_gemma":[0.9989198,0.00023638304,0.00011579876,0.00044941588,0.000081356986,0.00019725788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007119578,0.0001843718,0.00021468432,0.00017688202,0.00021176477,0.00025902467,0.00037780832,0.00007867985,0.00001784445],"category_scores_gemma":[0.00006512707,0.00015887282,0.00004135755,0.00058700336,0.00007550732,0.0002474696,0.00020275792,0.00017365406,0.000034746106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021892034,0.00023008858,0.00017387277,0.00020200515,0.000067556924,0.000013828042,0.012176374,0.00018149006,0.014242568,0.93816614,0.0012665945,0.03325761],"study_design_scores_gemma":[0.0013388194,0.00010662831,0.0032024067,0.000084563326,0.000024520708,0.000021549118,0.00042748966,0.8894653,0.007423146,0.09494158,0.0022318647,0.00073216343],"about_ca_topic_score_codex":0.0000066347325,"about_ca_topic_score_gemma":0.000014700455,"teacher_disagreement_score":0.8892838,"about_ca_system_score_codex":0.000024440013,"about_ca_system_score_gemma":0.00003297235,"threshold_uncertainty_score":0.6478645},"labels":[],"label_agreement":null},{"id":"W1989900196","doi":"10.1007/s10878-007-9121-1","title":"Standard directed search strategies and their applications","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Directed acyclic graph; Directed graph; Computer science; Theory of computation; Search problem; Upper and lower bounds; Combinatorics; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01290475218289373,"score_gpt":0.2732350615311445,"score_spread":0.2603303093482508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989900196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061020645,0.0001774306,0.9965518,0.00038943795,0.000544782,0.0001942765,0.0000010296,0.00006401548,0.0014670056],"genre_scores_gemma":[0.53670204,0.00028739075,0.46260166,0.000057146488,0.00029719056,0.0000037276718,0.0000041870057,0.000014556678,0.00003213535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998814,0.00009275909,0.00042177516,0.0001270143,0.0003589408,0.0001855234],"domain_scores_gemma":[0.9982971,0.00016681253,0.00022708726,0.00016354572,0.0009895966,0.00015589196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505718,0.00009923328,0.0001810269,0.00026039258,0.00015347975,0.0004463598,0.00034947204,0.00007076067,0.000012595154],"category_scores_gemma":[0.00005586694,0.00007971993,0.000043880304,0.00060598954,0.000053114396,0.0013492884,0.00007535719,0.00019518645,9.786986e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015844686,0.00020044274,0.00016260693,0.000030315257,0.000062858075,0.000008970672,0.001916504,0.3636852,0.00054814,0.60472125,0.00031063825,0.028194638],"study_design_scores_gemma":[0.0061534327,0.0016774564,0.0005969231,0.00009783988,0.00002563811,0.0001640842,0.0017053728,0.8865085,0.005752544,0.0841487,0.012574109,0.0005954035],"about_ca_topic_score_codex":0.0000024463875,"about_ca_topic_score_gemma":4.1082123e-7,"teacher_disagreement_score":0.5360918,"about_ca_system_score_codex":0.00006177252,"about_ca_system_score_gemma":0.00026418432,"threshold_uncertainty_score":0.4304258},"labels":[],"label_agreement":null},{"id":"W1991356098","doi":"10.1016/j.tcs.2013.04.015","title":"Fast–mixed searching and related problems on graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Mixed graph; Combinatorics; Search algorithm; Graph; Degree (music); Search problem; Planar graph; Computer science; Discrete mathematics; Algorithm; Line graph","score_opus":0.01041735476262332,"score_gpt":0.23739648023326881,"score_spread":0.2269791254706455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991356098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044082463,0.000014190675,0.93707734,0.0040951,0.00033533282,0.00047109506,4.061821e-7,0.00032404516,0.013600005],"genre_scores_gemma":[0.8963643,0.000010622276,0.10298499,0.00054749905,0.000015398477,0.000016686014,5.1552036e-7,0.000007634318,0.000052366115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997438,0.00018706857,0.00025511917,0.000733455,0.0007492265,0.0006371342],"domain_scores_gemma":[0.9984501,0.00023898904,0.000048824677,0.0006102365,0.00020367673,0.00044819852],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014206858,0.00016695549,0.00015970299,0.00030861993,0.0005379007,0.001126589,0.0015561623,0.00005051049,0.00010519216],"category_scores_gemma":[0.000082528364,0.00012646666,0.000038600607,0.0013083403,0.0021602833,0.0010683362,0.0010248009,0.00032423655,0.00028100086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.410018e-7,0.000036450332,0.000040183564,0.000005685364,0.0000025651534,0.0000021844207,0.0005957309,0.001650996,0.00031380384,0.9332373,0.000063062864,0.064051285],"study_design_scores_gemma":[0.00016737869,0.00020759652,0.0013594254,0.000027326632,6.625203e-7,0.000019575951,0.000004730929,0.6646808,0.0002670436,0.33311197,0.000022288374,0.00013123249],"about_ca_topic_score_codex":0.0000065988424,"about_ca_topic_score_gemma":2.0157115e-7,"teacher_disagreement_score":0.8522818,"about_ca_system_score_codex":0.000027925864,"about_ca_system_score_gemma":0.000068597365,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W1991761577","doi":"10.1177/1548512913509033","title":"Solving the Impediment Induced Variable Shape Covering Problem","year":2013,"lang":"en","type":"article","venue":"The Journal of Defense Modeling and Simulation Applications Methodology Technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Variable (mathematics); Circle packing; Constant (computer programming); Operations research; Mathematical optimization; Norm (philosophy); Mathematics; Geometry; Law","score_opus":0.08250096892388886,"score_gpt":0.33068337045444046,"score_spread":0.2481824015305516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991761577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032810017,0.00037592978,0.95856345,0.007484053,0.0000610642,0.0004762785,2.4198698e-7,0.00007899628,0.0001499446],"genre_scores_gemma":[0.5804944,0.000116504074,0.4189929,0.00029202644,0.00003209847,0.00004725957,2.8896358e-7,0.000006622611,0.000017920607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984282,0.00048220038,0.00053510035,0.00016390566,0.00016790937,0.00022264876],"domain_scores_gemma":[0.997285,0.0012995652,0.00035607244,0.00045621902,0.0005507863,0.00005235495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031066367,0.0001133703,0.00020505204,0.00027560763,0.0004802115,0.00008400775,0.00075302704,0.00014943602,0.00001567483],"category_scores_gemma":[0.0002688003,0.00006778468,0.000036173627,0.0006445366,0.00009997039,0.00027098026,0.00026265718,0.00047346042,0.000008673797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050112444,0.000018648872,0.000026886297,0.0000048450447,0.000029126166,1.34298e-7,0.00064370205,0.89185387,0.0046156533,0.06871247,0.00001889908,0.03407073],"study_design_scores_gemma":[0.0001964415,0.00006119501,0.000007738101,0.000009478896,0.00001899414,0.00007669277,0.00029207306,0.8725707,0.00014476161,0.12612301,0.0004352314,0.0000636852],"about_ca_topic_score_codex":0.000018807765,"about_ca_topic_score_gemma":8.562294e-7,"teacher_disagreement_score":0.5476844,"about_ca_system_score_codex":0.000030464531,"about_ca_system_score_gemma":0.000076373755,"threshold_uncertainty_score":0.36934474},"labels":[],"label_agreement":null},{"id":"W1992712376","doi":"10.1007/s10951-009-0148-2","title":"Characterizing sets of jobs that admit optimal greedy-like algorithms","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Greedy algorithm; Computation; Algorithm; Set (abstract data type); Computer science; Mathematics; Combinatorics; Class (philosophy); Mathematical optimization; Discrete mathematics; Artificial intelligence","score_opus":0.0401982384900589,"score_gpt":0.29236549489283614,"score_spread":0.25216725640277726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992712376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2180816,0.00037907338,0.7769818,0.003503704,0.00054479885,0.00009011066,0.0000011505172,0.000033445227,0.00038433264],"genre_scores_gemma":[0.55167836,0.00011838177,0.44764793,0.0004190738,0.000095566524,2.5934e-7,4.6962515e-7,0.0000051873053,0.000034789984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984637,0.00006112556,0.000515429,0.00014591488,0.00055742334,0.00025644404],"domain_scores_gemma":[0.99865705,0.000051652838,0.00055927265,0.00020367892,0.00034129285,0.0001870387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088096753,0.00011666963,0.00027618156,0.00025108198,0.000092020346,0.00015868511,0.00071916776,0.00006435839,0.000025594582],"category_scores_gemma":[0.00006277209,0.000099571815,0.00014152082,0.0003121554,0.000026709222,0.0012637832,0.00008462779,0.00033508698,0.0000065619424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020637896,0.0010779477,0.0064082225,0.00016488941,0.00033439952,0.00063787017,0.012927332,0.23630843,0.13279687,0.0101583935,0.000583165,0.5983961],"study_design_scores_gemma":[0.0017805409,0.0011013536,0.015306015,0.00055646035,0.000026262092,0.0006422831,0.00033719017,0.95845884,0.018925473,0.00094684877,0.0015164983,0.00040224844],"about_ca_topic_score_codex":0.0000016803632,"about_ca_topic_score_gemma":1.632742e-7,"teacher_disagreement_score":0.7221504,"about_ca_system_score_codex":0.000034251618,"about_ca_system_score_gemma":0.00013890224,"threshold_uncertainty_score":0.40604207},"labels":[],"label_agreement":null},{"id":"W1993821074","doi":"10.1142/s0129054107004826","title":"OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Torus; Computer science; Enhanced Data Rates for GSM Evolution; Security token; Compass; Computation; Property (philosophy); Sense (electronics); Orientation (vector space); Task (project management); Mathematics; Algorithm; Artificial intelligence; Geometry; Computer network","score_opus":0.012770053744457445,"score_gpt":0.3117274546573193,"score_spread":0.2989574009128619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993821074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27444088,0.000026138052,0.7242029,0.00015964425,0.0008942258,0.0000707393,0.0000026965176,0.000005489457,0.0001973155],"genre_scores_gemma":[0.67406934,0.0000352181,0.3258353,0.00001663107,0.000031629726,7.2856534e-7,8.840316e-7,0.0000017630633,0.000008506699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978345,0.00004413016,0.00085405423,0.00015044502,0.0009825646,0.00013429816],"domain_scores_gemma":[0.99676806,0.00014426044,0.00080680114,0.0001678359,0.0020413348,0.00007170576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016718952,0.00007047707,0.00017210162,0.0009605295,0.000040059487,0.00006963748,0.00090109435,0.00002825105,0.000013678145],"category_scores_gemma":[0.000095627795,0.00006762861,0.00007573066,0.0009249262,0.0003883626,0.0012122334,0.00016751826,0.000102892365,8.217083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018725783,0.0015920914,0.007909157,0.000042585412,0.00014279688,0.00004127072,0.0051911925,0.29739133,0.104496986,0.06524675,0.0004360578,0.51732254],"study_design_scores_gemma":[0.003003076,0.0016341967,0.028510481,0.0004843793,0.000015595175,0.0009289095,0.00031855752,0.7783346,0.18081461,0.0031163134,0.002479254,0.0003600425],"about_ca_topic_score_codex":0.000039499453,"about_ca_topic_score_gemma":0.000005655035,"teacher_disagreement_score":0.51696247,"about_ca_system_score_codex":0.0001289216,"about_ca_system_score_gemma":0.0003466804,"threshold_uncertainty_score":0.27578148},"labels":[],"label_agreement":null},{"id":"W1993964758","doi":"10.1142/s0219265906001739","title":"EXPLORING PLANAR GRAPHS USING UNORIENTED MAPS","year":2006,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Overhead (engineering); Embedding; Planar graph; Node (physics); Graph; Traverse; Algorithm; Planar; Terrain; Planar straight-line graph; Book embedding; Theoretical computer science; Artificial intelligence; Line graph; Pathwidth","score_opus":0.06915790782859202,"score_gpt":0.2541455881890506,"score_spread":0.18498768036045857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993964758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0464191,0.0001265944,0.9503946,0.00026374357,0.0021410407,0.000051061976,2.661602e-7,0.000045087207,0.0005585251],"genre_scores_gemma":[0.96776366,0.00012336178,0.03140841,0.00014190034,0.00048007103,0.000001922719,0.0000014244695,0.0000106439475,0.000068582565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883986,0.00009980666,0.00048682376,0.00013001982,0.00023410346,0.00020937825],"domain_scores_gemma":[0.9990748,0.00006764042,0.00031841733,0.00014648956,0.0003100297,0.00008263445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047898473,0.000098185956,0.00015644728,0.0003547285,0.0001231586,0.00017385071,0.00032992422,0.00004592981,0.000016082535],"category_scores_gemma":[0.000026614802,0.00008601558,0.00012157488,0.00057582563,0.000021200742,0.0014403119,0.000042946147,0.00029666108,0.000002792049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042452426,0.000106678264,0.0013129134,0.000007789789,0.00005192037,0.000056335604,0.000283587,0.9432653,0.0007554488,0.042108115,0.0041281413,0.007881285],"study_design_scores_gemma":[0.0007437382,0.00025846434,0.0005804252,0.00018210468,0.000011638397,0.000546855,0.00016770557,0.98686934,0.00059955346,0.0050784647,0.0047719697,0.00018974944],"about_ca_topic_score_codex":0.000042353895,"about_ca_topic_score_gemma":0.000015649397,"teacher_disagreement_score":0.9213446,"about_ca_system_score_codex":0.00008704497,"about_ca_system_score_gemma":0.000031893123,"threshold_uncertainty_score":0.35076135},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14401273056313005,"score_gpt":0.3575397659671938,"score_spread":0.21352703540406373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995813020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21945131,0.0006234893,0.47242084,0.3032591,0.0015959999,0.0009580031,0.000004565842,0.000025309306,0.0016613872],"genre_scores_gemma":[0.9647875,0.00047994635,0.033392403,0.00010206,0.0003179328,0.000013701658,0.0000017367904,0.000010491709,0.0008942253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703294,0.00035653994,0.00045681826,0.00012829533,0.0017268946,0.0002985061],"domain_scores_gemma":[0.998147,0.00073363236,0.00015695492,0.00028645436,0.0005833189,0.000092644004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022472676,0.000080415084,0.00010897018,0.0002905868,0.00022406351,0.00055255415,0.0030920485,0.000037352667,0.000035088968],"category_scores_gemma":[0.00022003148,0.00004567137,0.00009524811,0.000413061,0.00012774327,0.0007241775,0.00062759756,0.00072454056,0.000047419577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005223062,0.0005030752,0.19438663,0.000019336878,0.00090955565,0.000104278435,0.012940996,0.6956984,0.0060608145,0.042159785,0.0032263973,0.04393852],"study_design_scores_gemma":[0.001710567,0.00037563304,0.23590434,0.00038681395,0.0000214507,0.00008922353,0.0037010119,0.70175356,0.0010947203,0.050167292,0.004465953,0.0003294148],"about_ca_topic_score_codex":0.000095541545,"about_ca_topic_score_gemma":0.0000035101393,"teacher_disagreement_score":0.7453362,"about_ca_system_score_codex":0.00023706902,"about_ca_system_score_gemma":0.00011603089,"threshold_uncertainty_score":0.57458466},"labels":[],"label_agreement":null},{"id":"W1996317753","doi":"10.1007/s00224-005-1252-0","title":"Efficient Exploration of Faulty Trees","year":2006,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Overhead (engineering); Node (physics); Competitive analysis; Tree (set theory); Computation; Algorithm; Situated; Enhanced Data Rates for GSM Evolution; Fault tree analysis; Mathematics; Artificial intelligence; Combinatorics; Engineering; Upper and lower bounds","score_opus":0.028762374305972335,"score_gpt":0.2608479320143923,"score_spread":0.23208555770842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996317753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08660263,0.00013184892,0.9078715,0.0000405742,0.0002604809,0.00018092903,0.000001171137,0.000092743496,0.004818152],"genre_scores_gemma":[0.9915378,8.458861e-7,0.008192117,0.0000060268458,0.000047412494,0.0000018619667,0.000002352858,0.0000052083055,0.00020635249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866414,0.0003094674,0.00043275874,0.00015816932,0.00029388483,0.00014159257],"domain_scores_gemma":[0.9990001,0.00020223322,0.00027867727,0.0003042863,0.00018873517,0.000026017546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925083,0.000077752054,0.00019438386,0.00012151228,0.000060644543,0.00003912418,0.00038266333,0.00003213549,0.0000022404756],"category_scores_gemma":[0.000027271684,0.00006801562,0.000047589416,0.0003333351,0.000061418395,0.00009747769,0.00008679322,0.00004470427,0.000006791165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002594298,0.00004224242,0.00004403478,0.00003561952,0.0000037842121,2.680334e-7,0.00078949507,0.563172,0.0008416718,0.43375236,0.00004306941,0.0012728801],"study_design_scores_gemma":[0.00023392068,0.000057390756,0.00050201896,0.000109251254,0.0000022051465,0.0000024412386,0.0001626777,0.99217707,0.0017456373,0.0048582214,0.00007316447,0.00007601627],"about_ca_topic_score_codex":0.00004638445,"about_ca_topic_score_gemma":0.0000010561863,"teacher_disagreement_score":0.9049352,"about_ca_system_score_codex":0.000016442003,"about_ca_system_score_gemma":0.00003078896,"threshold_uncertainty_score":0.27735963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008541897466011434,"score_gpt":0.26329504070959364,"score_spread":0.2547531432435822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998843748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024217202,0.000020506144,0.96284086,0.00067639194,0.00010284113,0.00021506217,0.0000025106258,0.00010840672,0.03361172],"genre_scores_gemma":[0.7388724,0.000025699319,0.26068988,0.00034848083,0.000018978862,0.000006356352,0.0000019675113,0.000003233633,0.000032973552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736106,0.00035396978,0.0004511581,0.0005553968,0.0008573942,0.00042102448],"domain_scores_gemma":[0.99809504,0.0006296893,0.000084630214,0.00064826955,0.00032273232,0.0002196596],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033942827,0.00013784658,0.0006222902,0.0005716127,0.00022060014,0.00027626604,0.0018985338,0.000031680265,0.00095614337],"category_scores_gemma":[0.0000913379,0.00010535027,0.0002416257,0.004672198,0.0039610527,0.00052016333,0.00037325436,0.00012839281,0.000044010496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010103392,0.00004594006,0.000007380757,0.0000020473049,0.000069288995,0.0000026469036,0.0006670746,0.011352518,0.000030037654,0.95263255,0.000004016641,0.035085455],"study_design_scores_gemma":[0.00425428,0.000045633296,0.00012410816,0.0000127520425,0.000057609588,0.0000028429165,0.0000047987314,0.96666944,0.00043842226,0.028172527,0.00008659009,0.00013099567],"about_ca_topic_score_codex":0.000008084495,"about_ca_topic_score_gemma":6.004889e-7,"teacher_disagreement_score":0.9553169,"about_ca_system_score_codex":0.000026873462,"about_ca_system_score_gemma":0.00008809678,"threshold_uncertainty_score":0.99995714},"labels":[],"label_agreement":null},{"id":"W1999004550","doi":"10.1016/j.disopt.2014.01.001","title":"The quadratic balanced optimization problem","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Quadratic equation; Sequential quadratic programming; Geometry","score_opus":0.007785666697622099,"score_gpt":0.23544298419849105,"score_spread":0.22765731750086896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999004550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009022885,0.000046293928,0.97639775,0.0039919843,0.00024012795,0.00047873834,0.0000012024024,0.00034193989,0.018492913],"genre_scores_gemma":[0.044151437,0.00027642617,0.95294875,0.0006275635,0.00009620572,0.00013180995,0.000094096584,0.000036053007,0.0016376871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801207,0.00030934307,0.00040377516,0.00042509398,0.00044316688,0.00040655542],"domain_scores_gemma":[0.9984979,0.00018224232,0.0002013131,0.0007050864,0.0002800428,0.00013341986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077048555,0.00019256346,0.00015771446,0.00009560929,0.00074812054,0.00085799,0.0008714455,0.00008404893,0.000051133822],"category_scores_gemma":[0.00022119384,0.00013920382,0.00006583469,0.00074150914,0.000082388244,0.0009862737,0.00016799304,0.00014131259,0.000041473377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048030465,0.000014714275,0.00003809469,0.0000075108183,0.00000782426,2.1504749e-7,0.00016971769,0.91652113,0.000010043775,0.07848099,0.00046418142,0.0042807595],"study_design_scores_gemma":[0.000400867,0.000074202275,0.00002498263,0.000018269682,0.0000051212805,0.0000027500612,0.000024147823,0.9949742,0.00005113534,0.0014492994,0.002776656,0.00019836017],"about_ca_topic_score_codex":0.000008087029,"about_ca_topic_score_gemma":0.000005786737,"teacher_disagreement_score":0.078453064,"about_ca_system_score_codex":0.000049310867,"about_ca_system_score_gemma":0.00006669731,"threshold_uncertainty_score":0.8273617},"labels":[],"label_agreement":null},{"id":"W1999760725","doi":"10.1007/s00453-004-1121-2","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Minimum spanning tree; Combinatorics; Spanning tree; Mathematics; Degree (music); k-minimum spanning tree; Bounded function; Gomory–Hu tree; Theory of computation; Steiner tree problem; Approximation algorithm; Shortest-path tree; Discrete mathematics; Graph; Node (physics); Kruskal's algorithm; Undirected graph; Connected dominating set; Algorithm; K-ary tree; Tree structure; Binary tree","score_opus":0.04624586313923365,"score_gpt":0.256247606757736,"score_spread":0.21000174361850235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999760725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008489597,0.00006788761,0.98054034,0.006563332,0.00015489092,0.00039561008,0.0000011017838,0.00025456297,0.011173303],"genre_scores_gemma":[0.07884693,0.0000070890205,0.9193835,0.0010201256,0.00011201462,0.0000724894,0.0000040641917,0.000019875746,0.0005338662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983756,0.00008767086,0.00031245608,0.00038897357,0.00038118748,0.0004540901],"domain_scores_gemma":[0.9989854,0.0001251206,0.0001134432,0.0005675566,0.00009853835,0.00010993724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005376485,0.00016186782,0.00015417652,0.000087031665,0.00036797512,0.00044839366,0.0010614485,0.000060636085,0.000016153264],"category_scores_gemma":[0.00006592167,0.0001124409,0.00008102244,0.000545387,0.000099413475,0.00048591016,0.0003195694,0.00024463868,0.00011034617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075874323,0.00027165507,0.00012424677,0.000053897045,0.00010313233,0.000043336982,0.010482673,0.007435221,0.0013045009,0.17871095,0.001337834,0.80012494],"study_design_scores_gemma":[0.0021611883,0.00027740208,0.0004613686,0.00013341627,0.00001846505,0.00009988651,0.0003126824,0.8737757,0.0052059256,0.10806475,0.008770165,0.0007190278],"about_ca_topic_score_codex":0.000046614397,"about_ca_topic_score_gemma":0.000012205014,"teacher_disagreement_score":0.8663405,"about_ca_system_score_codex":0.00006341445,"about_ca_system_score_gemma":0.00011956209,"threshold_uncertainty_score":0.4585207},"labels":[],"label_agreement":null},{"id":"W1999969615","doi":"10.5555/1283383.1283410","title":"Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Competitive analysis; Steiner tree problem; Upper and lower bounds; Mathematics; Bounded function; Binary logarithm; Online algorithm; Log-log plot; Discrete mathematics; Asymmetry; Algorithm","score_opus":0.022410622383360786,"score_gpt":0.28838452357988265,"score_spread":0.26597390119652187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999969615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028037496,0.00010279337,0.98847234,0.001977349,0.00014413534,0.0007602489,0.0000037141401,0.00007154418,0.005664126],"genre_scores_gemma":[0.43219048,0.00003919562,0.56229484,0.000919143,0.000041979853,0.000043381246,0.000011199396,0.000016245298,0.0044435794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987524,0.000030021472,0.00040070174,0.00025058084,0.00021371107,0.0003525659],"domain_scores_gemma":[0.9989059,0.00031585502,0.0000914896,0.00042908004,0.00018900745,0.00006867559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011974468,0.00010795951,0.00015162872,0.0002285549,0.00008704575,0.000097305885,0.0007418352,0.00006238659,0.000013759643],"category_scores_gemma":[0.000059630318,0.00006870605,0.00008181835,0.0009220584,0.00008161195,0.00026073278,0.00014178493,0.00012162364,0.0000013968164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099736724,0.00090627087,0.002398142,0.00010796255,0.00006638334,0.0000024605743,0.0012442038,0.0006832148,0.0058975937,0.6935656,0.0025607408,0.29246768],"study_design_scores_gemma":[0.003212635,0.00057174114,0.0057679964,0.000030336176,0.000008518601,0.0000041459084,0.00031888633,0.9441199,0.005773443,0.028777596,0.011102653,0.00031215715],"about_ca_topic_score_codex":0.00014567697,"about_ca_topic_score_gemma":0.0016744386,"teacher_disagreement_score":0.9434367,"about_ca_system_score_codex":0.00002859193,"about_ca_system_score_gemma":0.00010241607,"threshold_uncertainty_score":0.28017518},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031981909787465616,"score_gpt":0.32379853491843646,"score_spread":0.29181662513097084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001755298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01271768,0.000010645211,0.9064346,0.00083849794,0.000018523699,0.000050635692,5.3544333e-8,0.000022214406,0.07990716],"genre_scores_gemma":[0.9869334,0.000010354699,0.0124063315,0.0002312979,0.0000034555753,6.5465724e-7,9.725658e-8,7.582077e-7,0.00041363938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967855,0.000016471757,0.000066263,0.0000673306,0.00010447669,0.000066915156],"domain_scores_gemma":[0.99968714,0.00013660968,0.000019473162,0.00010823361,0.000032399817,0.000016171552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042529375,0.000024138597,0.000024452282,0.000026582093,0.00004423965,0.00007132494,0.00013220495,0.000008539148,0.000020067617],"category_scores_gemma":[0.000015082036,0.000014238585,0.0000058156666,0.00011112831,0.000027692871,0.00022292732,0.00003892056,0.000028657481,0.0000035821681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.294226e-7,0.0000050322265,0.000052891013,0.0000023716257,8.4094677e-7,2.2210142e-7,0.00033399192,0.000991212,0.00070430135,0.9919211,0.0001110237,0.0058761677],"study_design_scores_gemma":[0.00024353406,0.00022747288,0.005729992,0.000034917364,0.0000013452997,0.0000041829658,0.001072547,0.8848283,0.020513901,0.08653931,0.0006610198,0.00014345247],"about_ca_topic_score_codex":0.0000049710775,"about_ca_topic_score_gemma":0.000005723989,"teacher_disagreement_score":0.97421575,"about_ca_system_score_codex":0.0000026597713,"about_ca_system_score_gemma":0.000014757799,"threshold_uncertainty_score":0.0687788},"labels":[],"label_agreement":null},{"id":"W2002043779","doi":"10.1007/s446-002-8031-5","title":"The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy","year":2002,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Carleton University; University of Toronto","funders":"","keywords":"Computer science; Consistency (knowledge bases); Mathematical optimization; Dynamic programming; Function (biology); Path (computing); Linear programming; Zero (linguistics); Optimization problem; Algorithm; Mathematics; Computer network","score_opus":0.059305550587239415,"score_gpt":0.3061084122070256,"score_spread":0.2468028616197862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002043779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012546115,0.00028872222,0.98489213,0.0015536115,0.00006269715,0.0002080902,0.0000028653456,0.0000916274,0.00035415724],"genre_scores_gemma":[0.94638866,0.000030419626,0.05330833,0.00013974038,0.00009476651,0.0000031538318,0.000013418415,0.000007685759,0.00001381456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836975,0.00017187142,0.00045249486,0.00029301885,0.0002547074,0.00045816918],"domain_scores_gemma":[0.9986866,0.00023862037,0.00020719666,0.000542279,0.00025197834,0.000073304334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007236183,0.00010806442,0.00015862692,0.00008953804,0.0002421369,0.00018058115,0.000696437,0.000057680314,0.0000039168153],"category_scores_gemma":[0.0002610179,0.000097298696,0.000039253533,0.0023903772,0.00006120014,0.00016903004,0.0002589292,0.00018655058,0.000005285341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037352786,0.0000705622,0.0008436968,0.000015335221,0.000013299035,0.0000031854202,0.00054776017,0.94615513,0.00009674331,0.034569737,0.00025781067,0.017423004],"study_design_scores_gemma":[0.00024427316,0.00002998265,0.0008132493,0.00009114698,0.0000022144354,0.000008238987,0.00003161954,0.9976645,0.00006417422,0.00042515583,0.000526243,0.000099177516],"about_ca_topic_score_codex":0.00013668349,"about_ca_topic_score_gemma":0.0000067810274,"teacher_disagreement_score":0.93384254,"about_ca_system_score_codex":0.00011374412,"about_ca_system_score_gemma":0.00007241322,"threshold_uncertainty_score":0.3967726},"labels":[],"label_agreement":null},{"id":"W2002942860","doi":"10.5555/545381.545459","title":"Tree exploration with little memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Node (physics); Binary logarithm; Degree (music); Bounded function; Tree (set theory); Computer science; Task (project management); Upper and lower bounds; Time complexity; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science","score_opus":0.050559385432962685,"score_gpt":0.226879259790743,"score_spread":0.17631987435778032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002942860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008981455,0.000014584302,0.78847635,0.003282395,0.000028131291,0.000061169056,5.55458e-8,0.00014110336,0.20790638],"genre_scores_gemma":[0.3834441,0.00007574024,0.529465,0.0017867252,0.00006144898,0.00003835166,0.0000026341681,0.000011347987,0.085114636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955815,0.000020282656,0.00005821748,0.00012415528,0.00014320071,0.00009602065],"domain_scores_gemma":[0.9996781,0.000013115972,0.0000137868465,0.00020221807,0.000045129338,0.000047659767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060004568,0.000039142713,0.00003619246,0.000040776464,0.000049397935,0.00010157452,0.00018910105,0.000013339164,0.0005506924],"category_scores_gemma":[0.0000056263157,0.000027465221,0.0000092049195,0.00021977196,0.000012971745,0.0007833298,0.000032721164,0.000032632382,0.00036445973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005614809,0.0002950604,0.00020773271,0.000014820004,0.000019147257,0.000019862166,0.0067016566,0.013244058,0.0003284736,0.29036623,0.0972559,0.5915414],"study_design_scores_gemma":[0.00028134408,0.00010527385,0.00004878472,0.0000036536596,6.071487e-7,0.000003906365,0.000066339766,0.9915563,0.0009121059,0.0007527293,0.0061822836,0.0000867023],"about_ca_topic_score_codex":0.000004175147,"about_ca_topic_score_gemma":0.000015375352,"teacher_disagreement_score":0.9783122,"about_ca_system_score_codex":0.000005724326,"about_ca_system_score_gemma":0.0000067240244,"threshold_uncertainty_score":0.6029695},"labels":[],"label_agreement":null},{"id":"W2004438803","doi":"10.1093/comjnl/bxl067","title":"A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists","year":2006,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Locality; Computer science; Library science; World Wide Web; Information retrieval; Linguistics","score_opus":0.026993477283438618,"score_gpt":0.26322578882454256,"score_spread":0.23623231154110394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004438803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012452945,0.00003178489,0.9855896,0.0012953801,0.00016380394,0.00022772356,0.0000030700398,0.000029946328,0.00020574017],"genre_scores_gemma":[0.48091426,0.00001633732,0.5183717,0.0004555514,0.00017711504,0.00000538192,0.0000019463719,0.000011709981,0.000045999986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846965,0.00012847203,0.00038965975,0.00024644384,0.00044463688,0.00032114133],"domain_scores_gemma":[0.99891955,0.00025995343,0.0002456773,0.00040376282,0.00008648651,0.0000845702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083791115,0.00014995583,0.00020396902,0.00010658252,0.00018997812,0.0002256826,0.0009904717,0.00007249881,0.00000910062],"category_scores_gemma":[0.000017775928,0.000098182434,0.000049077353,0.00032235056,0.00006909879,0.000240624,0.00019449419,0.00047225025,0.0000061564206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028362699,0.0034033451,0.010601316,0.00015786433,0.00020408932,0.000074267846,0.007987537,0.42339748,0.0011529183,0.5148564,0.0036817088,0.034199446],"study_design_scores_gemma":[0.00408039,0.0010747054,0.053554848,0.000577585,0.000020454989,0.00041017303,0.000042192194,0.8725468,0.0011620158,0.06043506,0.005486841,0.0006089683],"about_ca_topic_score_codex":0.000020678142,"about_ca_topic_score_gemma":0.000008243497,"teacher_disagreement_score":0.4684613,"about_ca_system_score_codex":0.000109901805,"about_ca_system_score_gemma":0.00009562115,"threshold_uncertainty_score":0.40037635},"labels":[],"label_agreement":null},{"id":"W2006093991","doi":"10.5555/982792.982915","title":"A maiden analysis of Longest Wait First","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer science; Scheduling (production processes); Competitive analysis; Computer network; Mathematical optimization; Mathematics","score_opus":0.013779340519190672,"score_gpt":0.25979166195592013,"score_spread":0.24601232143672946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006093991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052969465,0.00009341816,0.96751803,0.012356493,0.00029922815,0.00040770133,0.000046464178,0.0002509874,0.013730708],"genre_scores_gemma":[0.9086021,0.0002871537,0.08917253,0.00061080075,0.00007897071,0.00004909026,0.000059370002,0.000028682529,0.0011113142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00005110464,0.0003502453,0.00048375007,0.00055332074,0.00034704385],"domain_scores_gemma":[0.998689,0.00006681802,0.00013260938,0.00080290326,0.00013152216,0.00017716252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278103,0.00017902175,0.00032530408,0.0005316924,0.000128565,0.00013778663,0.0009168108,0.0000760666,0.00007635251],"category_scores_gemma":[0.000022381766,0.00015438496,0.00023009646,0.0020642618,0.000084255604,0.00037937443,0.00020889207,0.00013248439,0.00010494552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024814637,0.00041175706,0.0010007747,0.00005154669,0.0010807416,0.00005797673,0.0033086746,0.8564544,0.00092100905,0.13278677,0.00028724526,0.00361433],"study_design_scores_gemma":[0.0020666658,0.0010080353,0.009919254,0.00012095616,0.00035277233,0.000010257533,0.00009886577,0.9733,0.005672678,0.003677977,0.0029754476,0.00079708867],"about_ca_topic_score_codex":0.00016244852,"about_ca_topic_score_gemma":0.00008453336,"teacher_disagreement_score":0.9033052,"about_ca_system_score_codex":0.00009125632,"about_ca_system_score_gemma":0.00007794376,"threshold_uncertainty_score":0.6295636},"labels":[],"label_agreement":null},{"id":"W2007652042","doi":"10.1109/crv.2014.31","title":"Asymmetric Rendezvous Search at Sea","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Drifter; Rendezvous; Position (finance); Marine engineering; Trajectory; Spiral (railway); Computer science; Underwater; Geodesy; Geology; Simulation; Aerospace engineering; Lagrangian; Engineering; Oceanography; Physics","score_opus":0.023458078164191876,"score_gpt":0.2612381506962305,"score_spread":0.23778007253203864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007652042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003483329,0.000017607925,0.76072705,0.0016859135,0.000085018095,0.00006710147,2.3836799e-7,0.00019352123,0.23687522],"genre_scores_gemma":[0.7122642,0.00004538566,0.22842771,0.001980938,0.0000703972,0.000009542515,0.000004984052,0.000012447132,0.057184443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989061,0.00010816224,0.000108312,0.00025147194,0.00035684768,0.0002691357],"domain_scores_gemma":[0.9992053,0.00010781033,0.00001571087,0.00043117657,0.0000911365,0.0001488725],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053132983,0.00006370229,0.000074433854,0.00018718065,0.0001285177,0.00013330208,0.00059354136,0.00003459715,0.0002119241],"category_scores_gemma":[0.000067025336,0.000051628846,0.000031114207,0.0008451748,0.000022161435,0.00021368644,0.0004169068,0.00008218772,0.0011637148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041260355,0.00010017492,0.00385309,0.000019722536,0.000013663389,0.0000058588525,0.00033441777,0.0058615464,0.00018866279,0.5736466,0.06205489,0.35391724],"study_design_scores_gemma":[0.0002647767,0.00008756494,0.0014885216,0.0000021302747,5.835862e-7,0.000008596031,0.000002925659,0.9237611,0.0015729774,0.0009784973,0.07171439,0.00011793581],"about_ca_topic_score_codex":0.0000337703,"about_ca_topic_score_gemma":0.000011931254,"teacher_disagreement_score":0.91789955,"about_ca_system_score_codex":0.000042091346,"about_ca_system_score_gemma":0.0000289666,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; Mathematics; Upper and lower bounds","score_opus":0.03568695878688269,"score_gpt":0.311284834257148,"score_spread":0.27559787547026526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008126942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013794527,0.000035724195,0.99144864,0.0034661992,0.00027371643,0.00044820944,0.000003851159,0.00011633476,0.004069372],"genre_scores_gemma":[0.17732555,0.00019821213,0.8151641,0.0035432023,0.00046532592,0.0001988801,0.00007560979,0.000046541692,0.0029825862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984811,0.000063639396,0.00027953056,0.00045028882,0.00025331386,0.00047213503],"domain_scores_gemma":[0.99887717,0.00038700484,0.00004673821,0.00032578444,0.00013187516,0.00023140262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539039,0.00015630934,0.00020180643,0.00014518433,0.00010262358,0.000100354184,0.00053762953,0.00011073882,0.00004174661],"category_scores_gemma":[0.00011436562,0.00013986656,0.00006720279,0.00047597536,0.0000476908,0.0002097879,0.00014598631,0.0002446227,0.00003897584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009655642,0.00070159265,0.00006439104,0.000011993406,0.000024767485,0.00013329006,0.00032033425,0.17547156,0.000030341736,0.35945448,0.0037331576,0.4599575],"study_design_scores_gemma":[0.0010793452,0.00039056447,0.00011370246,0.000040121045,0.0000018175558,0.000014782059,0.000011640645,0.98334265,0.00010489521,0.0034408674,0.011280809,0.00017881943],"about_ca_topic_score_codex":0.000012151853,"about_ca_topic_score_gemma":0.000007211533,"teacher_disagreement_score":0.8078711,"about_ca_system_score_codex":0.000067944005,"about_ca_system_score_gemma":0.00007151971,"threshold_uncertainty_score":0.5703593},"labels":[],"label_agreement":null},{"id":"W2008228566","doi":"10.1016/j.ins.2013.01.017","title":"Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Voronoi diagram; Computer science; Set (abstract data type); Mathematical optimization; Facility location problem; Function (biology); Space (punctuation); Class (philosophy); Mathematics; Artificial intelligence","score_opus":0.04730909891146549,"score_gpt":0.2722949613739627,"score_spread":0.22498586246249722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008228566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04976986,0.000004941997,0.9443525,0.0011932848,0.00007098211,0.0007205687,0.000008486592,0.00012333081,0.0037560288],"genre_scores_gemma":[0.7903904,0.000002333938,0.20864491,0.00065854867,0.000008759649,0.000117310396,0.000010353471,0.0000015182042,0.00016590262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846005,0.000035375124,0.00032585498,0.00021595015,0.0006447855,0.0003179673],"domain_scores_gemma":[0.99878013,0.000044187458,0.00013010035,0.00023423292,0.0006704696,0.0001408986],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061705214,0.00011663669,0.00010503119,0.00022979687,0.00042406068,0.0013879179,0.00062515185,0.000021953181,0.00006889879],"category_scores_gemma":[0.00006845156,0.00008490289,0.00002204,0.001005598,0.00020355731,0.010421106,0.00015836024,0.00006745778,0.0006618177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012157977,0.000092979055,0.0047661127,0.0001579217,0.000026645397,6.764387e-7,0.050232574,0.6153384,0.0002514287,0.043715343,0.002397673,0.2830081],"study_design_scores_gemma":[0.00023245218,0.0002249104,0.002551321,0.000037326357,0.0000016512705,0.000010523984,0.0027223756,0.9865118,0.00073055003,0.0017636091,0.004929556,0.00028389294],"about_ca_topic_score_codex":0.0006352212,"about_ca_topic_score_gemma":0.00003241491,"teacher_disagreement_score":0.7406205,"about_ca_system_score_codex":0.00006963223,"about_ca_system_score_gemma":0.00023514,"threshold_uncertainty_score":0.99964875},"labels":[],"label_agreement":null},{"id":"W2008628501","doi":"10.1109/acc.2013.6579839","title":"Distributed dominating sets on grids","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dominating set; Bounded function; Grid; Distributed algorithm; Computer science; Mathematics; Set (abstract data type); Combinatorics; Discrete mathematics; Distributed computing; Graph","score_opus":0.016087884653133336,"score_gpt":0.2553096493095414,"score_spread":0.2392217646564081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008628501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003539132,0.0000022293125,0.95035017,0.0047428436,0.00009307309,0.00015703538,0.0000010388569,0.00020842995,0.040906034],"genre_scores_gemma":[0.87027,0.0000027899728,0.12597133,0.0013446497,0.00001707199,0.000028134076,0.000009476331,0.000004257184,0.0023522724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.000029973451,0.00008907564,0.00014520751,0.00014876366,0.00015662579],"domain_scores_gemma":[0.9995661,0.000055372948,0.000018869241,0.00021100836,0.000074549636,0.00007411176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010497939,0.000049587674,0.000047431608,0.000036543264,0.00007220129,0.00020301034,0.0003140335,0.000020356818,0.0003909566],"category_scores_gemma":[0.000041740677,0.00003717194,0.000017601855,0.00019855361,0.00001148217,0.00033008307,0.00010167898,0.000059142756,0.0008588367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017871388,0.00018826466,0.00089783414,0.000014649593,0.000014402816,0.000006646513,0.0005827606,0.008086271,0.0008022025,0.622597,0.11771029,0.2490979],"study_design_scores_gemma":[0.00023432107,0.00006253229,0.002747276,0.0000071351187,2.8917174e-7,0.0000017970304,0.000017562494,0.9895831,0.0009924836,0.0037718145,0.0024825963,0.000099091994],"about_ca_topic_score_codex":0.000025808858,"about_ca_topic_score_gemma":0.0000010795567,"teacher_disagreement_score":0.9814968,"about_ca_system_score_codex":0.000015070705,"about_ca_system_score_gemma":0.000013542196,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W2008689719","doi":"10.1145/2612669.2612686","title":"On the online fault-tolerant server consolidation problem","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Competitive analysis; Round-robin DNS; Cloud computing; Load balancing (electrical power); Upper and lower bounds; Distributed computing; Online algorithm; Heuristics; Fault tolerance; Consolidation (business); Computer network; Algorithm; Operating system; The Internet; Mathematics","score_opus":0.02469024284429975,"score_gpt":0.2587300152619463,"score_spread":0.23403977241764654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008689719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006486654,0.0000023456028,0.9309865,0.023948736,0.00008287823,0.00025705257,8.83117e-7,0.00018039762,0.038054507],"genre_scores_gemma":[0.91463983,0.000007049061,0.068855815,0.011032436,0.00004382623,0.00001991428,0.000011736163,0.000007927413,0.005381459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918735,0.0001246561,0.00013063796,0.00018056096,0.00022780821,0.00014897957],"domain_scores_gemma":[0.9992699,0.00016559362,0.000036572575,0.0003830445,0.000094832445,0.000050030056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040346582,0.000067952045,0.00006130052,0.000037384507,0.00011904544,0.00016234034,0.00047078764,0.000026446567,0.00022222527],"category_scores_gemma":[0.00005216113,0.000038235554,0.00002482739,0.00019552624,0.000024360574,0.00019513983,0.00009230566,0.00009416394,0.0002683133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013995616,0.0000596712,0.000022590812,0.000003217429,0.0000033352253,2.1728421e-7,0.00016704906,0.009682017,0.000051073635,0.97865343,0.00462047,0.006735557],"study_design_scores_gemma":[0.00022102095,0.00007630484,0.00020030295,0.000011348748,7.4357325e-7,0.0000015544015,0.0000124247845,0.9669443,0.00036172534,0.017296487,0.0147943115,0.00007950942],"about_ca_topic_score_codex":0.000014276025,"about_ca_topic_score_gemma":0.000021162492,"teacher_disagreement_score":0.96135694,"about_ca_system_score_codex":0.000010790004,"about_ca_system_score_gemma":0.00002497599,"threshold_uncertainty_score":0.3448714},"labels":[],"label_agreement":null},{"id":"W2009831508","doi":"10.1016/j.tcs.2013.03.016","title":"Complexity of Canadian traveler problem variants","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"PSPACE; Combinatorics; Mathematics; Time complexity; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Travelling salesman problem; Computational complexity theory; Computer science; Algorithm","score_opus":0.03185590816938742,"score_gpt":0.24652722804301677,"score_spread":0.21467131987362936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009831508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035486452,0.0000046135456,0.9497665,0.0044159926,0.00017921474,0.00035836716,0.0000021088315,0.00008318095,0.04164134],"genre_scores_gemma":[0.61816,0.0000022151448,0.38133958,0.0004530946,0.000016677035,0.000006632292,5.2948235e-7,0.0000034720767,0.000017814691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785,0.00010282151,0.00029759915,0.00048393442,0.0005969263,0.0006687256],"domain_scores_gemma":[0.99807024,0.000057277706,0.000058206035,0.0006580012,0.00048443052,0.00067184493],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009900628,0.00013110893,0.00018227435,0.0006548804,0.00029708378,0.0003936777,0.002459718,0.000045626453,0.00051818544],"category_scores_gemma":[0.000041646897,0.00010671369,0.000042360953,0.00260386,0.0033351649,0.0008976835,0.0004819477,0.00015258115,0.00022767246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.225366e-7,0.000031085372,0.000038545506,0.0000056235276,0.0000016580385,0.0000015972585,0.00038694486,0.00023700354,0.00037943228,0.9863102,0.00022974906,0.012377671],"study_design_scores_gemma":[0.0001348214,0.00009925495,0.004468463,0.00001433136,8.756578e-7,0.000011312346,0.0000038268804,0.68195295,0.000790429,0.31226006,0.00012789688,0.00013578088],"about_ca_topic_score_codex":0.0046743983,"about_ca_topic_score_gemma":0.00027227085,"teacher_disagreement_score":0.68171597,"about_ca_system_score_codex":0.000051832103,"about_ca_system_score_gemma":0.00044587036,"threshold_uncertainty_score":0.9993772},"labels":[],"label_agreement":null},{"id":"W2009988763","doi":"10.1109/comsnets.2013.6465538","title":"Multi-queued network processors for packets with heterogeneous processing requirements","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Network packet; Queueing theory; Scheduling (production processes); Network processor; Distributed computing; Queue; Packet processing; Throughput; Priority queue; Computer network; Packet switching; Mathematical optimization","score_opus":0.045761079527912855,"score_gpt":0.28999556623787315,"score_spread":0.24423448670996029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009988763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027090847,0.000046599045,0.994195,0.00081244484,0.000049995087,0.0010963678,3.4833295e-7,0.00027046612,0.00081973925],"genre_scores_gemma":[0.3612999,0.0000048757893,0.63582087,0.00081529986,0.000033918277,0.00034046348,0.0000039994234,0.000015531186,0.0016651361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874264,0.000026583417,0.00019128635,0.00035997844,0.00023152858,0.0004479768],"domain_scores_gemma":[0.99914104,0.000023179782,0.00008361111,0.00024972463,0.0003645628,0.00013787739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017100685,0.0001323188,0.00012237534,0.000043879845,0.00022065527,0.00044101226,0.00046894627,0.00004149379,0.00005109662],"category_scores_gemma":[0.000018556173,0.000092522256,0.000026623893,0.00031824663,0.000032942553,0.0008801363,0.000093382645,0.00005383284,0.00004204379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012708042,0.0014440184,0.01039377,0.0011269049,0.000262887,0.000025018448,0.005925132,0.42634663,0.002711234,0.012576265,0.026795324,0.51226574],"study_design_scores_gemma":[0.00077685394,0.00017530845,0.00017834644,0.00004486346,0.0000025149347,0.0000066291072,0.000015061266,0.99626064,0.0007315393,0.00077969977,0.0008400546,0.00018846714],"about_ca_topic_score_codex":0.000009643124,"about_ca_topic_score_gemma":0.000020141382,"teacher_disagreement_score":0.56991404,"about_ca_system_score_codex":0.000023127885,"about_ca_system_score_gemma":0.00008989306,"threshold_uncertainty_score":0.42526913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01010129519343213,"score_gpt":0.24813068238141042,"score_spread":0.23802938718797828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010017329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037037574,0.000012574815,0.95800066,0.0010044976,0.000066601504,0.00015950821,4.0994328e-7,0.00014866739,0.0035694942],"genre_scores_gemma":[0.5803678,0.0000018782273,0.41943055,0.00016523789,0.000025262338,0.00000200388,1.5047432e-7,0.0000033921035,0.0000036867707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980201,0.0000830149,0.00025583952,0.0005420213,0.00066440617,0.00043461728],"domain_scores_gemma":[0.9984664,0.00013546908,0.000069491296,0.00080266624,0.0002954756,0.00023052347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011903004,0.0001293612,0.00017805405,0.00014492679,0.00018886666,0.00020465448,0.001747823,0.000031725773,0.00005641976],"category_scores_gemma":[0.000047061858,0.00009395608,0.000036501013,0.0012177263,0.002004258,0.00077133084,0.000617594,0.00013908764,0.000030566276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008432415,0.00010533006,0.00015289013,0.0000076153724,0.000003059466,0.0000021875617,0.0005332333,0.04179953,0.000566356,0.88952476,0.00000439432,0.067292206],"study_design_scores_gemma":[0.00025286962,0.00032837223,0.0012848079,0.000027773129,0.0000016135751,0.000017709772,0.0000030583171,0.981804,0.0070037246,0.009098463,0.000035346948,0.00014227067],"about_ca_topic_score_codex":0.0000021720211,"about_ca_topic_score_gemma":0.0000011625493,"teacher_disagreement_score":0.94000447,"about_ca_system_score_codex":0.00005692165,"about_ca_system_score_gemma":0.00016275415,"threshold_uncertainty_score":0.7384773},"labels":[],"label_agreement":null},{"id":"W2015639925","doi":"10.5555/1283383.1283392","title":"Improved bounds for the symmetric rendezvous value on the line","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rendezvous; Conjecture; Mathematics; Semidefinite programming; Value (mathematics); Markov decision process; Line (geometry); Mathematical optimization; Quadratic equation; Markov chain; Applied mathematics; Combinatorics; Markov process; Discrete mathematics; Physics; Statistics; Geometry","score_opus":0.023880501906073954,"score_gpt":0.2873125432453776,"score_spread":0.26343204133930365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015639925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012479925,0.00016178108,0.95599526,0.030500997,0.0010565931,0.0012198063,0.000019471043,0.0001954557,0.010725849],"genre_scores_gemma":[0.79632086,0.001034951,0.14148441,0.029880065,0.0029181389,0.0009803327,0.00008261863,0.00023997606,0.027058618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977428,0.00011168712,0.0003622431,0.00053494854,0.00059169595,0.0006566705],"domain_scores_gemma":[0.99676,0.001645499,0.00014167951,0.0011260654,0.00017128985,0.00015547794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022571508,0.0002488353,0.000178038,0.00020845502,0.0007318632,0.00047977307,0.0016079128,0.000099290075,0.000014411351],"category_scores_gemma":[0.0001991112,0.00012956084,0.00018437234,0.0011228449,0.000120324265,0.00020023707,0.00021327872,0.00034581884,0.000044076485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015830957,0.00029795372,0.000009387498,0.000028643717,0.0001707913,0.000012097409,0.0013463555,0.014767396,0.0021967099,0.84699094,0.0055217417,0.12849964],"study_design_scores_gemma":[0.00071489904,0.0010995603,0.000106328116,0.000020440293,0.000015166466,0.000006897799,0.00007481786,0.9639472,0.004289582,0.0027438477,0.026724026,0.00025728333],"about_ca_topic_score_codex":0.000045076573,"about_ca_topic_score_gemma":0.00000836168,"teacher_disagreement_score":0.94917977,"about_ca_system_score_codex":0.00009467161,"about_ca_system_score_gemma":0.000085399675,"threshold_uncertainty_score":0.56289744},"labels":[],"label_agreement":null},{"id":"W2017441966","doi":"10.1007/s00453-014-9884-6","title":"A Comparison of Performance Measures for Online Algorithms","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Irvine; University of Waterloo; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Bijection; Competitive analysis; Context (archaeology); Computer science; Theory of computation; Algorithm; Adaptability; Order (exchange); Greedy algorithm; Simple (philosophy); Online algorithm; Mathematics; Combinatorics; Upper and lower bounds","score_opus":0.05276604616838215,"score_gpt":0.3370390444198044,"score_spread":0.28427299825142227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017441966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009737045,0.000056392844,0.9972244,0.00061500125,0.0001838312,0.00022540624,0.000008249275,0.00009238639,0.00062063494],"genre_scores_gemma":[0.34341562,0.000012986615,0.6561015,0.00014130874,0.000084531006,0.000021623811,0.000014728203,0.000008941292,0.00019872616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988958,0.000049025926,0.00029512166,0.0002411345,0.00027988214,0.00023898705],"domain_scores_gemma":[0.99905795,0.00013039394,0.00010403635,0.00036338356,0.00026134597,0.00008290768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003797023,0.000100665704,0.0002255171,0.000092754046,0.00009062838,0.00004077666,0.000634015,0.000050230068,0.0000068281006],"category_scores_gemma":[0.00008118704,0.00008984338,0.000061921746,0.00024406421,0.000050544204,0.00021563447,0.00010128389,0.000088407745,0.000009934011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004126695,0.00017805344,0.00021416099,0.00003320219,0.0000143253155,7.5419536e-8,0.00029086394,0.0024647103,0.00023762387,0.009867284,0.00066520955,0.98603034],"study_design_scores_gemma":[0.00042184396,0.00030027013,0.00023822821,0.0000158529,0.0000036689607,0.0000014110606,0.000011197877,0.9309875,0.0062700696,0.00058503647,0.061057188,0.00010777366],"about_ca_topic_score_codex":0.000006073912,"about_ca_topic_score_gemma":0.0000025992424,"teacher_disagreement_score":0.9859226,"about_ca_system_score_codex":0.000013891918,"about_ca_system_score_gemma":0.000044960525,"threshold_uncertainty_score":0.36637068},"labels":[],"label_agreement":null},{"id":"W2018043895","doi":"10.5555/2133036.2133045","title":"Online scalable scheduling for the lk-norms of flow time without conservation of work","year":2011,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Cloud computing; Competitive analysis; Distributed computing; Flow shop scheduling; Job shop scheduling; Parallel computing; Mathematical optimization; Computer network; Mathematics; Upper and lower bounds; Operating system","score_opus":0.034947947273841026,"score_gpt":0.26552950854941215,"score_spread":0.2305815612755711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018043895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00421367,0.00009525689,0.990728,0.0023512084,0.00024830885,0.0007710353,0.00004559651,0.00008194035,0.001464945],"genre_scores_gemma":[0.08373391,0.000108108674,0.91389894,0.00036675917,0.000086194064,0.00007070971,0.000048804184,0.00003129458,0.0016552964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864835,0.00006348957,0.00040510722,0.0002883061,0.0003343641,0.00026039805],"domain_scores_gemma":[0.99860823,0.0001963735,0.00022919205,0.0005744899,0.00031728038,0.000074458825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572324,0.00014654487,0.00023846597,0.000097691474,0.00011954859,0.000041681174,0.00074200303,0.000072013165,0.000041247036],"category_scores_gemma":[0.000059131296,0.000097884105,0.00010845997,0.0004937997,0.00013496634,0.00030599337,0.00013305232,0.000114619535,0.000014305279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018105889,0.00527926,0.012908291,0.0012287082,0.0015792714,0.000010824659,0.026675645,0.62954056,0.043591514,0.124354154,0.005234735,0.14778642],"study_design_scores_gemma":[0.0006037694,0.0003459567,0.0006338934,0.00010468417,0.000016517866,0.0000011187165,0.000045175773,0.9886449,0.008396907,0.00075260893,0.00031873395,0.00013573973],"about_ca_topic_score_codex":0.000065581225,"about_ca_topic_score_gemma":0.000003217165,"teacher_disagreement_score":0.3591043,"about_ca_system_score_codex":0.00001864508,"about_ca_system_score_gemma":0.00008959039,"threshold_uncertainty_score":0.39915982},"labels":[],"label_agreement":null},{"id":"W2019146736","doi":"10.2139/ssrn.1001726","title":"General Theory of Cost Minimization Strategies of Continuous Audit of Databases","year":2007,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Audit; Minification; Computer science; Independence (probability theory); Process (computing); Database; General theory; Domain (mathematical analysis); Work (physics); Accounting; Algorithm; Data mining; Mathematics; Mathematical economics; Economics; Engineering","score_opus":0.018495714936868,"score_gpt":0.2813549039057231,"score_spread":0.2628591889688551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019146736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03531988,0.00063466106,0.9623432,0.000067580564,0.00007938875,0.00010279136,0.000004301912,0.000011345482,0.0014368242],"genre_scores_gemma":[0.9835016,0.0011755625,0.014929211,0.000015568894,0.000042554962,7.7735916e-7,0.00000613638,0.0000066901503,0.0003218859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983185,0.00012205145,0.0004562471,0.00011387442,0.00030331244,0.0006860327],"domain_scores_gemma":[0.998881,0.00011492254,0.00042036452,0.00020441622,0.00033259744,0.0000467342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002489358,0.00007879872,0.00018596795,0.00018018577,0.000047025584,0.000021480635,0.00044805367,0.00003093,0.000022681204],"category_scores_gemma":[0.00008187411,0.00006788678,0.00006120686,0.00031018496,0.000095104035,0.00045875597,0.000061421175,0.0003190515,8.085237e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035682184,0.00008353303,0.0005751297,0.000013278278,0.000049182123,9.814057e-7,0.00022810273,0.0043416,0.003502358,0.96928066,0.000036341746,0.02185314],"study_design_scores_gemma":[0.006648867,0.003936246,0.008876318,0.00035213673,0.00011964947,0.00065164303,0.01650453,0.07260304,0.11228123,0.7748258,0.0023206896,0.0008798562],"about_ca_topic_score_codex":0.00002798093,"about_ca_topic_score_gemma":0.000118817,"teacher_disagreement_score":0.94818175,"about_ca_system_score_codex":0.00007471142,"about_ca_system_score_gemma":0.0015867742,"threshold_uncertainty_score":0.28148693},"labels":[],"label_agreement":null},{"id":"W2019783787","doi":"10.1016/s0167-8191(03)00022-x","title":"The maximum flow problem: a real-time approach","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Flow (mathematics); Computer science; Mechanics; Physics","score_opus":0.019048448547801702,"score_gpt":0.24641333936502036,"score_spread":0.22736489081721867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019783787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015057749,0.00007564414,0.8349217,0.00047316847,0.000099636105,0.0003152537,2.098393e-7,0.00027950015,0.16368431],"genre_scores_gemma":[0.03147786,0.000053931093,0.9663239,0.00017593731,0.00004627435,0.000018165703,0.000003381214,0.00001708291,0.0018834538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.00034134727,0.0003119646,0.00041789186,0.00035017144,0.0005731177],"domain_scores_gemma":[0.9988549,0.00022355077,0.000108145876,0.00057058316,0.00011275779,0.00013008594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013766312,0.00016024626,0.00015661241,0.00005578987,0.00078002876,0.00052945607,0.00095169165,0.000051825173,0.000014663213],"category_scores_gemma":[0.00007787036,0.00011584512,0.000072484996,0.00049405027,0.00006149858,0.0002036286,0.00025941269,0.00020140015,0.00020838139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006282436,0.00014955217,0.00022433368,0.000034484012,0.000046360146,0.000008350929,0.0022434832,0.58598495,0.00015002243,0.36191416,0.006561696,0.042676356],"study_design_scores_gemma":[0.00030289305,0.000029231558,0.000056294113,0.000009674127,0.0000017337812,0.000024441117,0.000030403284,0.98020244,0.000013689921,0.008826457,0.010337709,0.00016502896],"about_ca_topic_score_codex":0.000013791258,"about_ca_topic_score_gemma":0.0000010728164,"teacher_disagreement_score":0.39421752,"about_ca_system_score_codex":0.000038740924,"about_ca_system_score_gemma":0.00010035584,"threshold_uncertainty_score":0.5999429},"labels":[],"label_agreement":null},{"id":"W2020291377","doi":"10.5555/545381.545437","title":"Broadcast scheduling: when fairness is fine","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Latency (audio); Online algorithm; Competitive analysis; Server; Computer network; Approximation algorithm; Distributed computing; Parallel computing; Operating system; Algorithm; Upper and lower bounds; Mathematical optimization","score_opus":0.05081797835851215,"score_gpt":0.25180055192917605,"score_spread":0.2009825735706639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020291377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022006163,0.00008682119,0.8987347,0.010904707,0.00009933204,0.00007945401,6.538601e-7,0.0002189054,0.08965537],"genre_scores_gemma":[0.23564567,0.00006211888,0.6724674,0.0042632027,0.000073124575,0.0000125469505,0.0000022409429,0.000012350523,0.08746132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992003,0.000023198718,0.00012449214,0.0002336593,0.00021278624,0.0002055564],"domain_scores_gemma":[0.99941057,0.000021646827,0.000022868731,0.0003594317,0.00008222726,0.00010325932],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001018138,0.000072931296,0.000074535936,0.00006544845,0.000083683226,0.00019945708,0.0005397048,0.00003416218,0.0046475735],"category_scores_gemma":[0.000019075062,0.000061144114,0.000032343214,0.0002446608,0.000021623175,0.0004187646,0.00016854213,0.00007719283,0.0017472892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024000647,0.00037811673,0.0009918743,0.0000335569,0.000032930624,0.000031659514,0.008155613,0.0065219305,0.0003221838,0.3115831,0.1941606,0.47778603],"study_design_scores_gemma":[0.00023371202,0.000029004637,0.000027562959,0.0000049855075,6.3733603e-7,0.000008380065,0.000011668282,0.9431652,0.00044908785,0.0016349735,0.05432577,0.0001090304],"about_ca_topic_score_codex":0.000013286151,"about_ca_topic_score_gemma":0.0000022375875,"teacher_disagreement_score":0.93664324,"about_ca_system_score_codex":0.000010877705,"about_ca_system_score_gemma":0.0000105118315,"threshold_uncertainty_score":0.99903},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03405175304668747,"score_gpt":0.2886569309033074,"score_spread":0.25460517785661996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020796742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001573603,0.00042858353,0.9922288,0.00097262044,0.00024998037,0.00021575882,0.0000013145825,0.00037968953,0.0039496534],"genre_scores_gemma":[0.6475386,0.00003217605,0.35187942,0.00030860258,0.000092144866,0.0000119044,0.000017496443,0.000015251107,0.00010441697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846816,0.00018782297,0.00028479556,0.0002495317,0.00029499622,0.0005146741],"domain_scores_gemma":[0.9987724,0.00011946138,0.00013510323,0.00067041133,0.000097209224,0.00020545395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059992,0.00015172703,0.0001673873,0.00008273955,0.0003644186,0.00023984467,0.00089171546,0.000066173445,0.000014463409],"category_scores_gemma":[0.0000490021,0.00015310464,0.000041909992,0.00035283284,0.000051144354,0.0014138272,0.00050658174,0.00024140748,0.00014214295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066061766,0.00097106193,0.005912788,0.000056344077,0.00010694204,0.0000044980247,0.019258428,0.020522285,0.0035295591,0.04641407,0.008331243,0.8948862],"study_design_scores_gemma":[0.0003845353,0.000055678178,0.00025389684,0.000030248477,0.0000044823505,0.000017744262,0.0000999264,0.992591,0.0018469072,0.00035144782,0.00408585,0.00027827173],"about_ca_topic_score_codex":0.000047995574,"about_ca_topic_score_gemma":0.000002203424,"teacher_disagreement_score":0.9720687,"about_ca_system_score_codex":0.000072621246,"about_ca_system_score_gemma":0.00003919824,"threshold_uncertainty_score":0.6243426},"labels":[],"label_agreement":null},{"id":"W2022437016","doi":"10.1142/s1793830911001346","title":"TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Focus (optics); Computer science; Black hole (networking); Algorithm; Ring (chemistry); Upper and lower bounds; Task (project management); Mathematics; Computer network; Engineering; Routing (electronic design automation); Physics","score_opus":0.045002723913948876,"score_gpt":0.2952494002916094,"score_spread":0.2502466763776605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022437016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010299816,0.000037817044,0.9934662,0.00030958393,0.000011539983,0.0011101718,0.000029338044,0.0000925435,0.0039128396],"genre_scores_gemma":[0.0064816717,0.00006542185,0.99129534,0.000070725335,0.000043441796,0.0006996539,0.000026274138,0.000024749861,0.0012927235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998749,0.000018489574,0.00032105125,0.00038465174,0.00019406354,0.00033272232],"domain_scores_gemma":[0.99913657,0.00009355567,0.00007190149,0.00043446454,0.00011866593,0.00014486874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044994664,0.00014960962,0.00019561202,0.00014324591,0.000156711,0.00014926298,0.0005297836,0.00006603293,0.00003350728],"category_scores_gemma":[0.000013971808,0.00013715115,0.00005297912,0.0003928651,0.00014480382,0.00027157718,0.00022021329,0.00011697433,0.00007517805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068918,0.0008691594,0.00004519851,0.00033653845,0.00006091823,0.000004072031,0.022691714,0.006130714,0.00039831785,0.89528,0.0004490627,0.07372741],"study_design_scores_gemma":[0.00035920722,0.000055474993,0.00006244279,0.000021126274,0.0000052768073,0.0000027658648,0.000309943,0.98368675,0.0003642524,0.013425265,0.0015224126,0.00018507677],"about_ca_topic_score_codex":0.0000145617005,"about_ca_topic_score_gemma":0.0000013640773,"teacher_disagreement_score":0.97755605,"about_ca_system_score_codex":0.000020200727,"about_ca_system_score_gemma":0.000040469622,"threshold_uncertainty_score":0.5592862},"labels":[],"label_agreement":null},{"id":"W2025264288","doi":"10.1016/j.dam.2007.11.001","title":"Impact of memory size on graph exploration capability","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Automaton; Theoretical computer science; Graph; Finite-state machine; Algorithm","score_opus":0.039807105362277787,"score_gpt":0.2876512014303654,"score_spread":0.2478440960680876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025264288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12652798,0.0000061814476,0.84930885,0.0001439167,0.00003673717,0.0005035459,0.000006384989,0.00014023566,0.023326172],"genre_scores_gemma":[0.83177185,0.000023462491,0.16801222,0.00004072277,0.0000115597395,0.0000370661,0.0000048962515,0.000010678584,0.00008753883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886966,0.00002369087,0.00032439857,0.00022392395,0.0003691489,0.00018917187],"domain_scores_gemma":[0.99882406,0.00020664,0.00014861453,0.00066319824,0.00006894865,0.00008855902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541827,0.00013633318,0.0002193731,0.00007192489,0.00009847966,0.000028436549,0.00040316654,0.000050906907,0.000046175333],"category_scores_gemma":[0.000076880664,0.00010465337,0.00011468679,0.00035629852,0.00009835714,0.0002264771,0.000084219704,0.00009819284,0.000041054813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005565655,0.0015301526,0.00023759283,0.00036378673,0.00014207547,0.000009123459,0.036933098,0.05423865,0.015094424,0.88380617,0.0020980756,0.005491204],"study_design_scores_gemma":[0.0028916178,0.0011551727,0.005417394,0.000115336,0.000031427502,0.00002983711,0.00091865606,0.3641902,0.031028083,0.5929572,0.00006367485,0.0012014109],"about_ca_topic_score_codex":0.0000071281743,"about_ca_topic_score_gemma":8.1343046e-7,"teacher_disagreement_score":0.7052439,"about_ca_system_score_codex":0.00003563574,"about_ca_system_score_gemma":0.00007150978,"threshold_uncertainty_score":0.42676407},"labels":[],"label_agreement":null},{"id":"W2026266551","doi":"10.1016/j.ipl.2011.12.001","title":"Optimal strategies for the list update problem under the MRM alternative cost model","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorics; Paging; Mathematics; Algorithm; Discrete mathematics","score_opus":0.05248951916879621,"score_gpt":0.2750355865265959,"score_spread":0.22254606735779967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026266551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037806417,0.00001594131,0.98034674,0.015566996,0.00009003286,0.00063055824,0.0000051337283,0.00012233194,0.0028441788],"genre_scores_gemma":[0.6274772,0.000021191174,0.33489218,0.03688581,0.000056559,0.0005158508,0.00002551814,0.000014701321,0.00011092891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999007,0.000026976075,0.00029764583,0.00012319513,0.00028432076,0.000260885],"domain_scores_gemma":[0.99917394,0.000057188226,0.00022542686,0.0002531907,0.00024915373,0.000041086583],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047804872,0.00012341212,0.000074329844,0.00007316274,0.0006170905,0.0013386495,0.0009698903,0.000031133157,0.000009285174],"category_scores_gemma":[0.000011319479,0.00007058557,0.000042300097,0.00023979189,0.00013832739,0.00574798,0.00011659837,0.00015091072,0.000021785574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011964747,0.000011061873,0.0000028136837,0.000033368677,0.00001536981,1.2792955e-7,0.017168183,0.8528907,0.000020530028,0.10853583,0.0034597162,0.01785038],"study_design_scores_gemma":[0.0002611398,0.00001470449,0.000013448612,0.00001728669,0.000005275853,0.00000360324,0.0010762053,0.98926836,0.00016724724,0.0046040136,0.004457148,0.00011157007],"about_ca_topic_score_codex":0.000023492898,"about_ca_topic_score_gemma":0.0000041528992,"teacher_disagreement_score":0.6454546,"about_ca_system_score_codex":0.000038480575,"about_ca_system_score_gemma":0.00018211226,"threshold_uncertainty_score":0.99969804},"labels":[],"label_agreement":null},{"id":"W2027982484","doi":"10.1145/1122480.1122499","title":"2005","year":2006,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Computer science; Column (typography); Information retrieval; Library science; Telecommunications; Geography; Archaeology","score_opus":0.018760005216208242,"score_gpt":0.25688321969390127,"score_spread":0.23812321447769302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027982484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043520494,0.00017977552,0.8513386,0.020204984,0.0003928934,0.00024955143,0.0000014810106,0.00053233485,0.122748315],"genre_scores_gemma":[0.49995518,0.000091110036,0.4566044,0.0050481865,0.0004581856,0.000029560933,0.000017124854,0.000025935367,0.037770323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927247,0.00003147065,0.00011896558,0.00017928326,0.00016531268,0.0002324888],"domain_scores_gemma":[0.9992035,0.00005714845,0.000030580053,0.0006139924,0.000030528736,0.00006423726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111853835,0.000063695144,0.000065170476,0.00005471072,0.00006683692,0.00014627469,0.0008336579,0.00003066487,0.00015189458],"category_scores_gemma":[0.000048836475,0.00005582403,0.00003223862,0.00019574276,0.00001535015,0.00035744475,0.0002056512,0.00006746545,0.0005048985],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004443715,0.00021921062,0.005146749,0.000011286971,0.0000126758805,0.000033682543,0.00031596352,0.0076397723,0.0042316155,0.23434164,0.6528672,0.09517579],"study_design_scores_gemma":[0.00061926356,0.00006195377,0.004647517,0.000009447052,0.0000022672389,0.000011631603,0.000013166755,0.056107737,0.0034103484,0.036908805,0.89788896,0.0003188783],"about_ca_topic_score_codex":0.0001596752,"about_ca_topic_score_gemma":0.000069168906,"teacher_disagreement_score":0.49560314,"about_ca_system_score_codex":0.000017185102,"about_ca_system_score_gemma":0.00004281545,"threshold_uncertainty_score":0.64896166},"labels":[],"label_agreement":null},{"id":"W2030705938","doi":"10.1007/s10707-008-0053-4","title":"A meeting scheduling problem respecting time and space","year":2008,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Schedule; Scheduling (production processes); Graph; Spacetime; Computer science; Interval (graph theory); Mathematics; Combinatorics; Operations research; Theoretical computer science; Mathematical optimization","score_opus":0.015988497943991063,"score_gpt":0.22784294180583203,"score_spread":0.21185444386184096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030705938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04514835,0.00014465561,0.6687288,0.0040776692,0.00007635038,0.0005965024,0.0000011953709,0.00084521127,0.28038123],"genre_scores_gemma":[0.07548883,0.000049036546,0.92274237,0.0003255968,0.000027221113,0.000008859575,0.0000017404117,0.000007574228,0.0013488003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990274,0.000029061779,0.00026117486,0.0001379197,0.00024381404,0.000300677],"domain_scores_gemma":[0.99939257,0.000090184796,0.000088633926,0.0002316917,0.00007748601,0.00011942339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004869728,0.00009196426,0.00011672795,0.000107554704,0.00039810644,0.00017726644,0.0002692425,0.000035205747,0.000025599129],"category_scores_gemma":[0.00010751506,0.000082790975,0.000023652727,0.00030481804,0.000047548572,0.0010304914,0.0002855082,0.00013366246,0.00029242886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054539785,0.0003959955,0.0028631394,0.0011234002,0.00022412941,0.0002034943,0.28633446,0.21430567,0.0031938464,0.35245776,0.012396227,0.12644733],"study_design_scores_gemma":[0.0002478338,0.000037044312,0.00008080629,0.00005564817,0.0000012451524,0.00014022579,0.00010825843,0.99599004,0.00022189772,0.0007174196,0.002267691,0.00013188386],"about_ca_topic_score_codex":0.000009334111,"about_ca_topic_score_gemma":0.000001020809,"teacher_disagreement_score":0.7816844,"about_ca_system_score_codex":0.00001768734,"about_ca_system_score_gemma":0.00007055968,"threshold_uncertainty_score":0.3758679},"labels":[],"label_agreement":null},{"id":"W2031025945","doi":"10.1007/s00224-007-9065-y","title":"Fault-Tolerant Sequential Scan","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Algorithm; Point (geometry); Line (geometry); Adversary; Construct (python library); Head (geology); Matching (statistics); Fault (geology); Order (exchange); Mathematics","score_opus":0.0263441281532681,"score_gpt":0.2829132204927016,"score_spread":0.25656909233943354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031025945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038481843,0.00015758518,0.9460511,0.00004785699,0.00094129896,0.0002089125,7.9966054e-7,0.00021626826,0.013894288],"genre_scores_gemma":[0.98656803,0.0000015763802,0.012727251,0.000060324895,0.00013625457,7.4469375e-7,0.0000014671365,0.000009713027,0.00049462233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998269,0.0002927866,0.00047768813,0.00024047946,0.00037747517,0.00034254146],"domain_scores_gemma":[0.9988,0.0002831073,0.0002089036,0.00042353835,0.0001765846,0.00010789968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042556073,0.000113302995,0.00022566508,0.00016326467,0.00013146493,0.00010481502,0.00075186486,0.000054169144,0.000008640684],"category_scores_gemma":[0.000038396276,0.000102577855,0.00006497642,0.00038569185,0.00008309708,0.00014600388,0.00018378494,0.000114262264,0.000030260066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014939124,0.000051083665,0.00014206208,0.00008630655,0.000030101097,0.000011668649,0.0033084713,0.055928618,0.001530301,0.91920525,0.00017836677,0.01951285],"study_design_scores_gemma":[0.00070987473,0.0001319421,0.0006801126,0.00026534696,0.000006103971,0.00007438334,0.00040999116,0.98798096,0.0026786972,0.004852584,0.0019089226,0.00030105023],"about_ca_topic_score_codex":0.000034618348,"about_ca_topic_score_gemma":0.0000013817057,"teacher_disagreement_score":0.9480862,"about_ca_system_score_codex":0.00003973158,"about_ca_system_score_gemma":0.000060851104,"threshold_uncertainty_score":0.41830036},"labels":[],"label_agreement":null},{"id":"W2031037037","doi":"10.1007/s12369-011-0102-2","title":"Regression Analysis of Multi-Rendezvous Recharging Route in Multi-Robot Environment","year":2011,"lang":"en","type":"article","venue":"International Journal of Social Robotics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Robot; Tree traversal; Robotics; Rendezvous; Computer science; Process (computing); Ordinary least squares; Mobile robot; Energy (signal processing); Real-time computing; Artificial intelligence; Simulation; Engineering; Machine learning; Algorithm; Mathematics; Statistics","score_opus":0.11217025211119643,"score_gpt":0.3399269234462845,"score_spread":0.2277566713350881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031037037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029629604,0.00005386877,0.99556786,0.00079897384,0.000405544,0.000051605042,0.0000041366725,0.000008414836,0.00014663534],"genre_scores_gemma":[0.6260862,0.00013537516,0.37354487,0.00006837912,0.000033451382,7.6470434e-7,0.0000030235217,0.000005649012,0.00012229457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983427,0.00011222208,0.00063540373,0.00013518672,0.0006281593,0.00014632267],"domain_scores_gemma":[0.99883676,0.000049147457,0.0006173039,0.000109113986,0.00032059033,0.00006710072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054119196,0.00009654933,0.00026577883,0.000707498,0.00004085124,0.00004063799,0.0008879239,0.00007114311,0.000051807347],"category_scores_gemma":[0.00007791401,0.00008553576,0.00019585571,0.00039258078,0.000049630773,0.00037037415,0.00018676186,0.00021994975,0.0000040801447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009576063,0.001759806,0.03923941,0.000010995808,0.0016939031,0.00021698057,0.023152247,0.87588423,0.002303799,0.025234759,0.00006840375,0.030339675],"study_design_scores_gemma":[0.0015740606,0.000080167534,0.08315302,0.00007321281,0.00009817675,0.000011881054,0.0002456604,0.91313523,0.0008048586,0.00053042354,0.00011926645,0.00017405194],"about_ca_topic_score_codex":0.000037716392,"about_ca_topic_score_gemma":0.000022999195,"teacher_disagreement_score":0.6231232,"about_ca_system_score_codex":0.00018628483,"about_ca_system_score_gemma":0.00007112218,"threshold_uncertainty_score":0.3488047},"labels":[],"label_agreement":null},{"id":"W2031698396","doi":"10.1002/net.20095","title":"Black hole search in common interconnection networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Hypercube; Star (game theory); Interconnection; Polygon mesh; Black hole (networking); Topology (electrical circuits); TRACE (psycholinguistics); Chordal graph; Network topology; Torus; Host (biology); Routing (electronic design automation); Theoretical computer science; Combinatorics; Computer network; Mathematics; Parallel computing; Routing protocol; Graph","score_opus":0.0211345147778055,"score_gpt":0.2741044860498077,"score_spread":0.2529699712720022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031698396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01100349,0.00016769137,0.98017746,0.0018659671,0.00026412273,0.00020812386,1.4327094e-7,0.00016007721,0.0061529367],"genre_scores_gemma":[0.99028945,0.00018437079,0.00764384,0.000986904,0.00032148155,0.000012190445,0.0000069039,0.000011484822,0.00054339913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864143,0.00017553594,0.00025485066,0.0003067177,0.00018537452,0.00043609398],"domain_scores_gemma":[0.9993265,0.00009214099,0.000037325066,0.00037812928,0.00005452598,0.00011137951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061622955,0.0001110375,0.00014508418,0.00013354767,0.00008019337,0.00019777195,0.0005546259,0.0001265669,0.000069606045],"category_scores_gemma":[0.0000074290615,0.00011084736,0.000042538457,0.0006935485,0.00005071003,0.00051985634,0.00024044243,0.00048620984,0.00008378975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051588413,0.000044942026,0.0012162788,0.0000017289402,0.0000029317387,0.000002391199,0.00031850554,0.89457697,0.0000020095363,0.0049827984,0.002370837,0.09647543],"study_design_scores_gemma":[0.00034435568,0.000049529666,0.001234119,0.000028025255,7.231311e-7,0.0000021572066,0.000022100015,0.9940071,0.0000143829575,0.00014895272,0.0040278262,0.0001207435],"about_ca_topic_score_codex":0.000042553984,"about_ca_topic_score_gemma":0.0004000237,"teacher_disagreement_score":0.97928596,"about_ca_system_score_codex":0.00009145994,"about_ca_system_score_gemma":0.00002230632,"threshold_uncertainty_score":0.4520224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Travelling salesman problem; Computer science; Operations research; Mathematics; Algorithm","score_opus":0.09076530393819074,"score_gpt":0.3128578328087348,"score_spread":0.22209252887054406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032767523","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003182641,0.9919217,0.002256694,0.00069161557,0.00012342817,0.0012004037,6.675922e-7,0.000036041423,0.0037662378],"genre_scores_gemma":[0.000061501974,0.99639505,0.0027020127,0.00025203498,0.000060545648,0.000019327088,9.809239e-7,0.000038882365,0.0004696701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99623895,0.0010795674,0.0015542633,0.00025519403,0.00047731816,0.0003947121],"domain_scores_gemma":[0.99651843,0.0003825878,0.0020030777,0.0007020279,0.00026813307,0.00012573252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077935304,0.00038924668,0.0010911389,0.00017511734,0.0006561689,0.00019505569,0.0023917535,0.00014039518,0.000060869985],"category_scores_gemma":[0.000111621215,0.00017787212,0.00030548862,0.0006496154,0.00013429331,0.00045356757,0.00037704944,0.0016520718,0.00003439675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018520623,0.00007768323,0.0000012219972,0.038607914,0.00032723718,0.000009956575,0.004176647,0.00019782888,0.0000024277863,0.020424724,0.0022651723,0.93390733],"study_design_scores_gemma":[0.000360987,0.0007883201,0.000007231984,0.40394893,0.000875462,0.0022258027,0.00004017556,0.0024834308,0.0000012555811,0.0038240917,0.58476645,0.0006778643],"about_ca_topic_score_codex":0.0000032955838,"about_ca_topic_score_gemma":8.687441e-7,"teacher_disagreement_score":0.93322945,"about_ca_system_score_codex":0.00007455842,"about_ca_system_score_gemma":0.0002799363,"threshold_uncertainty_score":0.72534144},"labels":[],"label_agreement":null},{"id":"W2032839108","doi":"10.1109/iros.2012.6386049","title":"Multi-robot exploration and rendezvous on graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rendezvous; Robot; Task (project management); Computer science; Set (abstract data type); Ranking (information retrieval); Artificial intelligence; Distributed computing; Engineering","score_opus":0.09137424760496787,"score_gpt":0.30284271101499727,"score_spread":0.2114684634100294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032839108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056218763,0.000038726965,0.9928641,0.0013351903,0.000129462,0.00008790065,1.5193098e-7,0.00012473726,0.0048575737],"genre_scores_gemma":[0.6725665,0.00007768363,0.32496804,0.0007407719,0.000018941815,0.0000117325435,0.0000017052971,0.0000039653332,0.00161068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995282,0.000035107034,0.00006828356,0.00011270045,0.0001104587,0.00014523615],"domain_scores_gemma":[0.999682,0.000021763075,0.000016418973,0.00015835515,0.000026264108,0.00009517153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016661447,0.000047540714,0.000040162475,0.000065402455,0.00006783873,0.000077434626,0.00011072862,0.000021787771,0.000021923333],"category_scores_gemma":[0.000015881395,0.000037446986,0.000010823302,0.0001417566,0.000013855095,0.00085339637,0.000055964232,0.000043415774,0.00007226769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056334425,0.00037361003,0.0024620425,0.000011699397,0.000011681555,0.0000015181527,0.0047310134,0.0032818888,0.0015973776,0.8607052,0.004079704,0.12273862],"study_design_scores_gemma":[0.0011561087,0.00026708408,0.0115543865,0.000016223603,0.0000028692434,0.000010923214,0.0001657098,0.9673602,0.0039993436,0.006052762,0.009020541,0.00039382357],"about_ca_topic_score_codex":0.000006601476,"about_ca_topic_score_gemma":0.000004020484,"teacher_disagreement_score":0.9640783,"about_ca_system_score_codex":0.000006120028,"about_ca_system_score_gemma":0.0000061272617,"threshold_uncertainty_score":0.15270437},"labels":[],"label_agreement":null},{"id":"W2032986039","doi":"10.1145/2632149","title":"Placing Sensors for Area Coverage in a Complex Environment by a Team of Robots","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Huawei Technologies (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Real-time computing; Mobile robot; Vertex (graph theory); Path (computing); Algorithm; Wireless sensor network; Computer vision; Artificial intelligence; Computer network; Theoretical computer science","score_opus":0.025516847205928898,"score_gpt":0.24283882030925394,"score_spread":0.21732197310332504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032986039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028746612,0.000012914851,0.9955592,0.00058866455,0.00007846869,0.00042712904,0.000018697614,0.0000602581,0.00038000007],"genre_scores_gemma":[0.8807375,0.00010167828,0.11843549,0.00031378726,0.00001683064,0.00004903603,0.000016472068,0.000016810012,0.0003124408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986961,0.00012436259,0.00031725722,0.00034186206,0.00020433599,0.00031612022],"domain_scores_gemma":[0.99872494,0.00048718444,0.00008588566,0.0005782182,0.000029678762,0.0000941207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847379,0.00014757554,0.00022814593,0.00012786622,0.00012077452,0.000045677003,0.0003912813,0.00009229128,0.000043828735],"category_scores_gemma":[0.000021998743,0.00014858964,0.00008890273,0.00023437141,0.00004557378,0.00014762045,0.000012617819,0.0001971868,0.0000067938495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024917232,0.0001686519,0.000041435425,0.00000945538,0.000013557189,4.4634888e-7,0.00019575085,0.9786703,0.00039048467,0.000167584,0.00048820506,0.019829184],"study_design_scores_gemma":[0.0009704577,0.00018825615,0.00014050686,0.000025988627,0.0000055643113,0.0000036066235,0.000029271629,0.9932167,0.00045770884,0.00022752036,0.0045794994,0.00015494252],"about_ca_topic_score_codex":0.000017700406,"about_ca_topic_score_gemma":0.000013037072,"teacher_disagreement_score":0.8778628,"about_ca_system_score_codex":0.00005499951,"about_ca_system_score_gemma":0.000011093532,"threshold_uncertainty_score":0.6059309},"labels":[],"label_agreement":null},{"id":"W2033427227","doi":"10.1145/1711475.1711499","title":"Introduction to the SIGACT news online algorithms column","year":2010,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paging; Column (typography); Computer science; Competitive analysis; Quarter (Canadian coin); Online algorithm; Algorithm; Operations research; Information retrieval; Telecommunications; History; Mathematics; Upper and lower bounds","score_opus":0.02205290292875095,"score_gpt":0.2866052760490196,"score_spread":0.26455237312026864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033427227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031234693,0.000045275607,0.48271874,0.4765758,0.0056321505,0.0013895867,0.000018067862,0.00061072945,0.0017749819],"genre_scores_gemma":[0.12309209,0.00020183586,0.82062286,0.027807174,0.0122885965,0.00017196828,0.0001132293,0.000094204595,0.015608059],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981909,0.00011779646,0.00030023995,0.0005472816,0.00042375768,0.00042004968],"domain_scores_gemma":[0.9973291,0.00017330943,0.00009465657,0.0019628087,0.00018242376,0.0002576742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953392,0.00017692645,0.00017281575,0.00012232686,0.0002757484,0.0004637927,0.0021781432,0.00009448152,0.00033287238],"category_scores_gemma":[0.0008771574,0.00012924206,0.00007879648,0.0008446472,0.000051749365,0.0006041939,0.0006229592,0.00052310276,0.0006850403],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012351017,0.0002708884,0.0006501491,0.0000074115214,0.000029425344,0.0000075205903,0.0016214534,0.0039924723,0.013130919,0.004738631,0.39008123,0.58545756],"study_design_scores_gemma":[0.00032093647,0.00018320969,0.0010667472,0.000004653922,0.0000053816793,0.000021436292,0.00014597666,0.045286585,0.0016619256,0.0010229464,0.95002824,0.00025194162],"about_ca_topic_score_codex":0.000503077,"about_ca_topic_score_gemma":0.0021077306,"teacher_disagreement_score":0.5852056,"about_ca_system_score_codex":0.000033649867,"about_ca_system_score_gemma":0.00013106511,"threshold_uncertainty_score":0.88050354},"labels":[],"label_agreement":null},{"id":"W2033561606","doi":"10.1145/2601071","title":"Faster Algorithms for Semi-Matching Problems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Combinatorics; Bipartite graph; Binary logarithm; Matching (statistics); Mathematics; Simple (philosophy); Running time; Time complexity; Scheduling (production processes); Upper and lower bounds; Computer science; Discrete mathematics; Graph; Mathematical optimization","score_opus":0.036387628298889294,"score_gpt":0.28501888826687455,"score_spread":0.24863125996798524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033561606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006897486,0.000019185878,0.9932738,0.0037996862,0.000734949,0.000677161,0.00001977749,0.0004618345,0.0009446255],"genre_scores_gemma":[0.035371076,0.000047836493,0.9592478,0.0015061588,0.000153935,0.00042173537,0.000014332542,0.000052432708,0.003184638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791294,0.00011146955,0.00037369103,0.00063808856,0.00042045407,0.0005433428],"domain_scores_gemma":[0.99804735,0.0003808646,0.00008838898,0.0010705593,0.00018883668,0.00022402752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006199311,0.00025637654,0.00024955728,0.00025490404,0.0004942336,0.0003332219,0.0012556647,0.00012953037,0.00008323667],"category_scores_gemma":[0.000044226043,0.00023723583,0.00017952095,0.0004839163,0.000053087733,0.00072001293,0.00002986062,0.0003102403,0.00012433165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008033939,0.0002604882,0.000002736902,0.00005184314,0.000054704073,0.0000011788987,0.0013154488,0.09022911,0.00029700046,0.0042004786,0.00025009015,0.9033289],"study_design_scores_gemma":[0.0012590016,0.00042313745,0.00003240682,0.000056555637,0.000014579092,0.000018612336,0.000058114296,0.9397352,0.0013954663,0.020593112,0.03599683,0.00041699936],"about_ca_topic_score_codex":0.00004304574,"about_ca_topic_score_gemma":0.000017973274,"teacher_disagreement_score":0.9029119,"about_ca_system_score_codex":0.000059364414,"about_ca_system_score_gemma":0.000055091576,"threshold_uncertainty_score":0.9674196},"labels":[],"label_agreement":null},{"id":"W2033661244","doi":"10.1145/1435375.1435378","title":"Competitive buffer management for shared-memory switches","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Competitive analysis; Computer science; Network packet; Queue; Buffer (optical fiber); Preemption; Constraint (computer-aided design); Partition (number theory); Upper and lower bounds; Online algorithm; Computer network; Operating system; Algorithm; Mathematics; Telecommunications","score_opus":0.03958810005221866,"score_gpt":0.2723584283068775,"score_spread":0.23277032825465885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033661244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077532866,0.000024270132,0.99054444,0.0023328313,0.000336561,0.0005750231,0.00002915686,0.0002645061,0.005815665],"genre_scores_gemma":[0.053415913,0.00028025758,0.9352186,0.0010857559,0.000054893007,0.00043430124,0.000015623173,0.000026539736,0.009468148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879545,0.000028885532,0.00019099837,0.0004010545,0.0002859655,0.00029765474],"domain_scores_gemma":[0.99895656,0.00012089001,0.000036388672,0.00064673106,0.00011993447,0.00011950596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012916682,0.00014960249,0.00014044931,0.00018565646,0.00045590175,0.00007598549,0.00078843447,0.00005402869,0.00016405189],"category_scores_gemma":[0.000008443783,0.0001443584,0.00011607142,0.0003465543,0.00006192013,0.00038776855,0.00002159741,0.00014201076,0.00014512407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006404904,0.0016343363,0.0000114917675,0.000114977855,0.00035635865,0.00007645862,0.0044354447,0.030373333,0.00015133827,0.04859621,0.0036396205,0.91054636],"study_design_scores_gemma":[0.011054945,0.0024357755,0.0046476945,0.00026418414,0.0001133488,0.00027661567,0.0017039675,0.7360203,0.01593788,0.018685741,0.20635685,0.0025026905],"about_ca_topic_score_codex":0.000010331818,"about_ca_topic_score_gemma":0.0000051508778,"teacher_disagreement_score":0.9080437,"about_ca_system_score_codex":0.000057057423,"about_ca_system_score_gemma":0.00003778173,"threshold_uncertainty_score":0.58867645},"labels":[],"label_agreement":null},{"id":"W2036433802","doi":"10.1016/j.dam.2009.03.003","title":"Counting feasible solutions of the traveling salesman problem with pickups and deliveries is <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>#</mml:mi><mml:mi>P</mml:mi></mml:math>-complete","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Algorithm; Mathematical optimization; Discrete mathematics","score_opus":0.02324561272859016,"score_gpt":0.2381692861386059,"score_spread":0.21492367341001575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036433802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7568701,0.00016506166,0.22373663,0.0009277242,0.0001528596,0.00023571582,0.000096552234,0.00020916772,0.017606212],"genre_scores_gemma":[0.88739586,0.00013015521,0.11157691,0.0005164802,0.00008798955,0.00011065537,0.000054267337,0.00007456085,0.00005314976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971894,0.000043524073,0.0006823741,0.00054242363,0.0008578045,0.0006844924],"domain_scores_gemma":[0.99791825,0.00025080098,0.0006211028,0.00091423705,0.00010631771,0.00018930782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006876081,0.0003153536,0.00023667676,0.00009729892,0.0008930325,0.000515126,0.0008899532,0.00024158605,0.00007008337],"category_scores_gemma":[0.00008510734,0.0003284273,0.000208978,0.00048441612,0.00040985807,0.00048210804,0.00056630245,0.00039493383,0.00006588553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041249186,0.000099592675,0.000004977567,0.00042322683,0.00011341548,0.0000111171485,0.00495048,0.0040758043,0.001675299,0.9875673,0.0004953492,0.00054219697],"study_design_scores_gemma":[0.0007529827,0.00026342776,0.00004270603,0.00051360845,0.00015209464,0.000109225875,0.0012596311,0.9698516,0.013621861,0.012690247,0.0003115085,0.0004310687],"about_ca_topic_score_codex":0.00006396583,"about_ca_topic_score_gemma":0.00008518768,"teacher_disagreement_score":0.97487706,"about_ca_system_score_codex":0.00001191058,"about_ca_system_score_gemma":0.00028261717,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W2038319432","doi":"10.1016/j.ic.2008.07.005","title":"Tree exploration with advice","year":2008,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Tree (set theory); Forestry; Computer science; Data science; Geography; Mathematics; Combinatorics","score_opus":0.024859649797871156,"score_gpt":0.24018585644940837,"score_spread":0.21532620665153723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038319432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004619237,0.0000081456465,0.98373234,0.0009998495,0.000040081643,0.0001339957,4.0081989e-7,0.00023738264,0.010228558],"genre_scores_gemma":[0.8486655,0.00006290391,0.15007414,0.0010099751,0.0000140544835,0.000020376021,0.00004904262,0.0000029148866,0.00010109101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994467,0.000023795252,0.00016741313,0.00007505824,0.00020256224,0.00008449782],"domain_scores_gemma":[0.9995908,0.000020623524,0.000081327365,0.00007825348,0.00017531206,0.00005366744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008734732,0.000060491104,0.00005295633,0.00012609863,0.0001840265,0.00013933242,0.000085777065,0.000023348917,0.0000046826094],"category_scores_gemma":[0.000008685276,0.0000507628,0.000008734214,0.00028289066,0.000025445874,0.0051724017,0.000027395556,0.0000457,0.00006028014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004242999,0.000059032296,0.00086087774,0.00004570771,0.000017540006,0.0000047789126,0.023364142,0.12086536,0.000018971126,0.09097617,0.0053928145,0.75835216],"study_design_scores_gemma":[0.0005424248,0.00010026858,0.0028064423,0.000006793694,9.500577e-7,0.0000455363,0.0001621181,0.9913503,0.00004538295,0.0008338022,0.004014935,0.00009108137],"about_ca_topic_score_codex":0.000008694933,"about_ca_topic_score_gemma":0.0000036287906,"teacher_disagreement_score":0.8704849,"about_ca_system_score_codex":0.0000101393625,"about_ca_system_score_gemma":0.00004681483,"threshold_uncertainty_score":0.37498662},"labels":[],"label_agreement":null},{"id":"W2038655901","doi":"10.1016/j.dam.2011.10.027","title":"Strong and weak edges of a graph and linkages with the vertex cover problem","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Edge cover; Vertex cover; Mathematics; Combinatorics; Vertex (graph theory); Neighbourhood (mathematics); Feedback vertex set; Time complexity; Graph; Discrete mathematics","score_opus":0.023108284779005294,"score_gpt":0.22237611605044405,"score_spread":0.19926783127143877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038655901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076229153,0.00008547292,0.9501754,0.0002414863,0.000009120017,0.0004997577,0.0000029833316,0.000052177504,0.041310664],"genre_scores_gemma":[0.64278203,0.0000839748,0.35685113,0.000053896398,0.0000044710155,0.0000413832,0.0000011900702,0.0000122734755,0.00016964918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999363,0.000011864206,0.00014400217,0.00016439658,0.00017205413,0.00014469116],"domain_scores_gemma":[0.99944574,0.00007649216,0.000098025695,0.00028664453,0.000038898543,0.000054176886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019727834,0.00010461442,0.0001453751,0.000041155417,0.00008189749,0.00006762815,0.0002648385,0.000031364678,0.000009899071],"category_scores_gemma":[0.0000047073154,0.000059030895,0.000014439174,0.00014583448,0.00018660953,0.000121397636,0.00017147974,0.000080554215,0.0000028363436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048291186,0.000049703645,0.00009937735,0.00019808259,0.000039482675,6.055616e-7,0.011401022,0.00004791418,0.00036872743,0.984564,0.00021443305,0.003011789],"study_design_scores_gemma":[0.005814305,0.0015550302,0.0065558995,0.0007581681,0.0002894633,0.000104374005,0.016440222,0.26688653,0.026297925,0.67107725,0.0022273592,0.001993494],"about_ca_topic_score_codex":0.0000032978094,"about_ca_topic_score_gemma":0.000002235299,"teacher_disagreement_score":0.63515913,"about_ca_system_score_codex":0.0000025712352,"about_ca_system_score_gemma":0.000018441719,"threshold_uncertainty_score":0.240721},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013465128249734063,"score_gpt":0.2579631548572839,"score_spread":0.24449802660754982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039936247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010176881,0.000021850343,0.9868971,0.007342363,0.00020315501,0.00015057673,0.0000011026467,0.00043038206,0.003935797],"genre_scores_gemma":[0.6760599,0.00001242065,0.32239148,0.0014256039,0.00005873931,0.000009546527,0.0000016822945,0.000005002157,0.00003564327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787575,0.00010054671,0.00024219566,0.000565295,0.0007259984,0.00049021776],"domain_scores_gemma":[0.9987361,0.0001419702,0.000050388666,0.00059829594,0.00018201144,0.00029127783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140794,0.00013633724,0.00012347949,0.00020251518,0.00039593678,0.00070065836,0.0018239318,0.00004139156,0.00007726756],"category_scores_gemma":[0.00006377375,0.00011474112,0.00004361604,0.0014388484,0.0011682167,0.0022993905,0.00056157477,0.00014759878,0.00028339776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015549876,0.00005458294,0.0000053868557,0.0000018623978,0.0000012041589,0.0000011460821,0.00046586385,0.0058667953,0.00032721309,0.9339461,0.00087496586,0.05845338],"study_design_scores_gemma":[0.00017241423,0.00009950474,0.00001839989,0.000008922168,8.4336085e-7,0.0000059984586,0.0000025158263,0.9257401,0.003574315,0.06817894,0.002044458,0.00015358695],"about_ca_topic_score_codex":0.0000010805636,"about_ca_topic_score_gemma":3.4340204e-7,"teacher_disagreement_score":0.9198733,"about_ca_system_score_codex":0.000045187557,"about_ca_system_score_gemma":0.000090718226,"threshold_uncertainty_score":0.6756465},"labels":[],"label_agreement":null},{"id":"W2041241584","doi":"10.1016/j.tcs.2014.07.013","title":"Exploring an unknown dangerous graph with a constant number of tokens","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Asynchronous communication; Security token; Computer science; Constant (computer programming); Graph; Node (physics); Protocol (science); Theoretical computer science; Simple (philosophy); Computer network","score_opus":0.040970488097334945,"score_gpt":0.2704389198655607,"score_spread":0.22946843176822573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041241584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057850413,0.000002185997,0.931842,0.00030280504,0.00016694401,0.00011981196,5.575396e-7,0.00014763304,0.009567633],"genre_scores_gemma":[0.6615997,0.000003969337,0.3381767,0.00017893898,0.000025999549,0.0000061502,3.2688814e-7,0.0000049098894,0.0000033080553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783516,0.0001666352,0.0002374871,0.00054916024,0.00073688745,0.00047464875],"domain_scores_gemma":[0.9982763,0.0001688401,0.00006867145,0.0008100077,0.00033594537,0.0003402369],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001411431,0.00014297511,0.0002011657,0.00014848773,0.0002382839,0.00026669537,0.0016972054,0.000023698027,0.000025656735],"category_scores_gemma":[0.000045272427,0.000102839826,0.00003345854,0.0013168668,0.0027797224,0.0013187643,0.00048358546,0.00014026156,0.00002202927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007025185,0.00006380834,0.00015115448,0.0000070611104,0.000002461621,0.000003295648,0.00075879664,0.0013243344,0.00015580507,0.96655965,0.0000029915211,0.0309636],"study_design_scores_gemma":[0.00043339957,0.00066697365,0.00033915116,0.00006406736,0.0000037919176,0.00007373205,0.000016585953,0.9186074,0.0034698967,0.07586296,0.00018528572,0.0002767609],"about_ca_topic_score_codex":0.0000051864376,"about_ca_topic_score_gemma":0.0000012659268,"teacher_disagreement_score":0.91728306,"about_ca_system_score_codex":0.000019580959,"about_ca_system_score_gemma":0.000104131315,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2041785607","doi":"10.1109/ccece.2006.277605","title":"Localization of a Team of Heterogeneous Robots for a Distributed Sensing Task","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Robot; Odometry; Computer science; Sonar; Task (project management); Context (archaeology); Mobile robot; Artificial intelligence; Computer vision; Collision avoidance; Process (computing); Position (finance); Human–computer interaction; Engineering; Collision","score_opus":0.013320595480649183,"score_gpt":0.24530126153545928,"score_spread":0.2319806660548101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041785607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006513974,0.000014949099,0.9984859,0.00009699378,0.0000296649,0.00020333428,0.000013158872,0.00004548719,0.00045909526],"genre_scores_gemma":[0.8002542,0.0000018963989,0.1995545,0.000039843555,0.000008383059,0.0000019234074,0.000035262605,0.000003854406,0.00010008483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939555,0.00002401719,0.00022098911,0.00012256141,0.0001259831,0.00011087896],"domain_scores_gemma":[0.99945533,0.000040625913,0.00008514361,0.00016489992,0.00023038559,0.00002359256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107012485,0.000048818376,0.00010160758,0.000055035707,0.000031767406,0.000021151749,0.00013111893,0.000028346465,0.000003887965],"category_scores_gemma":[0.000024347615,0.00004326031,0.000040307936,0.00025756858,0.00002573725,0.000093895855,0.000044561457,0.000014804591,7.4921104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057087695,0.00007282164,0.00019264843,0.000039495484,0.0000069249654,4.2798402e-7,0.00006776619,0.97542685,0.0030148397,0.01611957,0.001171638,0.0038813162],"study_design_scores_gemma":[0.0002627712,0.000060555994,0.00002030113,0.000010871821,0.0000019755912,0.0000030469726,0.0000038883004,0.96211505,0.034945678,0.0018740067,0.00065525284,0.00004661992],"about_ca_topic_score_codex":0.00006152179,"about_ca_topic_score_gemma":0.00002411701,"teacher_disagreement_score":0.79960287,"about_ca_system_score_codex":0.0000121465,"about_ca_system_score_gemma":0.00003170396,"threshold_uncertainty_score":0.1764104},"labels":[],"label_agreement":null},{"id":"W2042651328","doi":"10.1109/ieem.2012.6837983","title":"Virtual depot approximation for the transshipment problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transshipment (information security); Depot; Mathematical optimization; Computer science; On demand; Operations research; Mathematics","score_opus":0.03850969404749474,"score_gpt":0.2714792940498256,"score_spread":0.23296960000233088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042651328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101896934,0.00004131247,0.9905986,0.0038633083,0.00012390097,0.0006113975,4.6400112e-7,0.00009851239,0.0045605693],"genre_scores_gemma":[0.57007897,0.000013017079,0.42698857,0.00070495124,0.00006576378,0.000261491,0.0000032285966,0.0000056918047,0.0018783399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.000028761064,0.00011319569,0.000098500044,0.00015957931,0.0002195184],"domain_scores_gemma":[0.99957806,0.000113558286,0.000022996257,0.00017926403,0.00004409619,0.00006200119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005254776,0.000052875832,0.000042822197,0.000024838804,0.00014922814,0.00010278208,0.00032856152,0.000021589532,0.000035629524],"category_scores_gemma":[0.000011191503,0.00003095171,0.00003294533,0.00012687664,0.0000149820435,0.0005051615,0.000036385674,0.00003990727,0.00002945039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027258527,0.00007224609,0.00007764015,0.000008865725,0.00000937406,1.9577433e-8,0.002078212,0.0039725145,0.00016510295,0.90738636,0.0017730788,0.08445385],"study_design_scores_gemma":[0.00040328875,0.00008471696,0.00029661861,0.0000039708684,0.0000040848445,0.000002697812,0.00013005089,0.96807027,0.00246492,0.0026521073,0.025774127,0.00011312032],"about_ca_topic_score_codex":0.0000035420862,"about_ca_topic_score_gemma":0.0000026050645,"teacher_disagreement_score":0.9640978,"about_ca_system_score_codex":0.000014280143,"about_ca_system_score_gemma":0.000020546002,"threshold_uncertainty_score":0.12621741},"labels":[],"label_agreement":null},{"id":"W2042736474","doi":"10.1007/s11036-006-4470-z","title":"Competitive Algorithms for Maintaining a Mobile Center","year":2006,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Center (category theory); Euclidean geometry; Computer science; Euclidean distance; Set (abstract data type); Bounded function; Algorithm; Plane (geometry); Facility location problem; Mathematical optimization; Mathematics; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.010216024901648746,"score_gpt":0.2623748918661403,"score_spread":0.2521588669644916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042736474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007064246,0.00023776971,0.9938909,0.00013760793,0.00003529207,0.0013479639,0.000015284519,0.00011338017,0.0041511855],"genre_scores_gemma":[0.8775222,0.0002620244,0.1010102,0.0006618851,0.0006806202,0.018146662,0.00024725002,0.000029012208,0.0014401427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922234,0.000018212655,0.00015968832,0.00028974074,0.00007452082,0.00023550879],"domain_scores_gemma":[0.9994748,0.00010110967,0.00004945118,0.00021991451,0.00008852011,0.000066158595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013542055,0.00008790038,0.00009808688,0.00003813034,0.0002775259,0.00015919008,0.00021527601,0.000043003318,0.000011396719],"category_scores_gemma":[0.0000010617825,0.00008340418,0.000037976726,0.00021487568,0.000052111605,0.00012347192,0.00009517409,0.000072092254,0.000005802772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001559954,0.000114180795,0.00015379647,0.0000046420582,0.0000059735107,2.832596e-7,0.000032971435,0.35753828,0.000011545261,0.5914528,0.0015832875,0.0491007],"study_design_scores_gemma":[0.00028188882,0.00005299503,0.00008598413,0.000006167682,0.0000020929174,0.000003111036,0.000045134304,0.6250283,0.000011363142,0.0025859175,0.37180594,0.00009112752],"about_ca_topic_score_codex":0.000011052804,"about_ca_topic_score_gemma":0.000008976091,"teacher_disagreement_score":0.8928807,"about_ca_system_score_codex":0.00001660395,"about_ca_system_score_gemma":0.000014976969,"threshold_uncertainty_score":0.3401124},"labels":[],"label_agreement":null},{"id":"W2043815754","doi":"10.1007/s10878-013-9634-8","title":"An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Randomized algorithm; Theory of computation; Disjoint sets; Online algorithm; Shortest path problem; Computer science; Node (physics); Graph; Combinatorics; Path (computing); Algorithm; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Artificial intelligence; Computer network","score_opus":0.014345798641235114,"score_gpt":0.2585192954949509,"score_spread":0.24417349685371578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043815754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076079414,0.000052755302,0.9906677,0.0049569868,0.0023051465,0.0015714488,0.0000069685325,0.000034548346,0.00032835393],"genre_scores_gemma":[0.020331306,0.0001361288,0.9779619,0.00073587283,0.0006004316,0.00008416885,0.000025557243,0.000031260584,0.00009339024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975368,0.00037972652,0.0008437555,0.00023480157,0.0006351356,0.00036978073],"domain_scores_gemma":[0.9964847,0.00049091823,0.0005792229,0.00036772448,0.0016823778,0.0003950685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019235921,0.00021237029,0.00046432423,0.00033688053,0.00043531987,0.00079987047,0.0009811347,0.0001511675,0.00013740621],"category_scores_gemma":[0.00025206566,0.00013801124,0.00025009256,0.00039585467,0.00008854517,0.001222005,0.0000385528,0.00033898908,0.000009560694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058723544,0.00030449504,0.0000014843886,0.0000053026683,0.000070362476,0.0000023786204,0.000493466,0.947393,0.000008092514,0.018889936,0.0014097785,0.030834462],"study_design_scores_gemma":[0.032541543,0.00062464585,0.000010282627,0.000030111029,0.00002804741,0.0000129454165,0.000043931905,0.9615598,0.000060935916,0.0039388323,0.0009813634,0.0001675815],"about_ca_topic_score_codex":0.0004308694,"about_ca_topic_score_gemma":0.00003217256,"teacher_disagreement_score":0.03195431,"about_ca_system_score_codex":0.00017311724,"about_ca_system_score_gemma":0.0006198512,"threshold_uncertainty_score":0.7713169},"labels":[],"label_agreement":null},{"id":"W2043888881","doi":"10.1109/icma.2012.6283527","title":"New path planning scheme for complete coverage of mapped areas by single and multiple robots","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Terrain; Robot; Motion planning; Scheme (mathematics); Path (computing); Computer science; Energy consumption; Energy (signal processing); Mobile robot; Function (biology); Real-time computing; Power consumption; Work (physics); Power (physics); Simulation; Artificial intelligence; Engineering; Electrical engineering; Mathematics; Computer network; Geography","score_opus":0.05646474044229159,"score_gpt":0.2722371969291634,"score_spread":0.21577245648687182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043888881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032973138,0.00016986618,0.994524,0.00023729351,0.000058180154,0.00020425179,0.000009510717,0.00005265128,0.0014469029],"genre_scores_gemma":[0.46672702,0.0000060346783,0.53198546,0.00023460703,0.00002269625,0.0000035465516,0.000019108234,0.0000062581275,0.0009952935],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.000018628745,0.00013414846,0.00013474919,0.00011784987,0.00022351918],"domain_scores_gemma":[0.99948895,0.00011774505,0.00005187325,0.00014743351,0.000043390603,0.00015063267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014737638,0.00006958779,0.00010883194,0.000034899993,0.000058863963,0.000059794227,0.00016720628,0.000028851373,0.000023232655],"category_scores_gemma":[0.000039506875,0.00006121123,0.000021961669,0.000090754445,0.000014548834,0.00038468177,0.00010620711,0.000034959907,0.000003208962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001526625,0.0012803135,0.1991913,0.00045953388,0.00017577436,0.0000032750404,0.010941755,0.020897225,0.22900759,0.13027504,0.314183,0.093432516],"study_design_scores_gemma":[0.0021435616,0.00021005096,0.0023477068,0.000044216522,0.0000032846353,0.0000052593905,0.000053451524,0.95111877,0.0064231628,0.0006517109,0.03673654,0.0002623116],"about_ca_topic_score_codex":0.000032784683,"about_ca_topic_score_gemma":0.0000010637393,"teacher_disagreement_score":0.9302215,"about_ca_system_score_codex":0.000008828563,"about_ca_system_score_gemma":0.000018295277,"threshold_uncertainty_score":0.24961214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Interactivity; Theoretical computer science; Computation; Algorithm; Multimedia","score_opus":0.016146130903592883,"score_gpt":0.24518310904156276,"score_spread":0.2290369781379699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044712489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033092994,0.000017668446,0.9616089,0.0012269603,0.00006359188,0.00016623725,4.8752815e-7,0.00012169453,0.0037014957],"genre_scores_gemma":[0.6838351,0.0000067786796,0.31582186,0.00029507175,0.000015726884,0.000002799997,1.5504835e-7,0.0000059910662,0.000016490698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976901,0.000104531704,0.00019530894,0.0005229441,0.0009776748,0.00050944096],"domain_scores_gemma":[0.9986474,0.00018764896,0.00007061483,0.00062655937,0.00021792596,0.00024987332],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008411097,0.00012870348,0.00018833151,0.00021383887,0.00021029128,0.00030074027,0.0016737025,0.000027240247,0.000060843377],"category_scores_gemma":[0.00003883801,0.00009276959,0.000028039622,0.0015089002,0.0028365885,0.0007199949,0.0005063946,0.00020826829,0.000027100998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008313949,0.00006202642,0.00013899924,0.000012884714,0.0000054874927,0.000019520932,0.0019567239,0.008462408,0.00010850514,0.9564935,0.000033337365,0.03269828],"study_design_scores_gemma":[0.00038193373,0.00062077446,0.00065831566,0.00009229278,0.000002636812,0.00004999186,0.000012296845,0.98978364,0.0010553913,0.006978513,0.00016383955,0.00020039869],"about_ca_topic_score_codex":0.000005030017,"about_ca_topic_score_gemma":9.91158e-7,"teacher_disagreement_score":0.9813212,"about_ca_system_score_codex":0.000028076109,"about_ca_system_score_gemma":0.000085156134,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null},{"id":"W2044973122","doi":"10.1016/j.ic.2013.02.001","title":"Worst-case optimal exploration of terrains with obstacles","year":2013,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Terrain; Point (geometry); Artificial intelligence; Convex hull; Computer vision; Computer science; Robot; Mobile robot; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","score_opus":0.02538619896032181,"score_gpt":0.2494876185426832,"score_spread":0.22410141958236138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044973122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048111416,0.0000064014944,0.94992226,0.0005988821,0.00003060532,0.00025855328,9.713094e-7,0.00007443019,0.000996449],"genre_scores_gemma":[0.8524492,0.0000069990137,0.14728838,0.00018770131,0.0000051131474,0.000023758575,0.000022527396,0.0000020126874,0.000014313276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999404,0.000024000934,0.0002478946,0.00007181339,0.00016509883,0.00008716713],"domain_scores_gemma":[0.9994084,0.00003073727,0.00014133555,0.00008804868,0.0002766364,0.000054847358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010429022,0.00006560151,0.00006952539,0.00015387397,0.00008786787,0.00025959726,0.00007821161,0.000026962434,0.000010912481],"category_scores_gemma":[0.000011871751,0.00005370833,0.000011563335,0.00024433018,0.000034640198,0.0071696225,0.000037379217,0.000043156444,0.000029559742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013349713,0.00005386904,0.00019407652,0.000079644844,0.000019251938,0.0000045967663,0.02314336,0.24442393,0.000057748854,0.08299247,0.0005137766,0.64850396],"study_design_scores_gemma":[0.00041563215,0.00012289861,0.0006557199,0.000014475025,0.0000015795122,0.000068451125,0.0010009314,0.9954618,0.00012470482,0.001786116,0.0002650062,0.000082684535],"about_ca_topic_score_codex":0.000041537674,"about_ca_topic_score_gemma":0.000003867526,"teacher_disagreement_score":0.8043378,"about_ca_system_score_codex":0.000010488717,"about_ca_system_score_gemma":0.00003069963,"threshold_uncertainty_score":0.5197803},"labels":[],"label_agreement":null},{"id":"W2046312856","doi":"10.1109/secon.2010.5508232","title":"Back-Tracking Based Sensor Deployment by a Robot Team","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Mobile robot; Vertex (graph theory); Grid; Real-time computing; Software deployment; Path (computing); Occupancy grid mapping; Computer vision; Artificial intelligence; Algorithm; Computer network; Mathematics; Theoretical computer science","score_opus":0.01930627975446081,"score_gpt":0.264669835391092,"score_spread":0.2453635556366312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046312856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007881282,0.0000045829765,0.9681049,0.0034999156,0.00020750856,0.00016568053,9.19437e-7,0.00018681759,0.02704152],"genre_scores_gemma":[0.19918242,0.0000035936687,0.7863045,0.003393762,0.000037907113,0.000014519948,0.000005176758,0.000014263511,0.011043886],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990859,0.00003570483,0.00013808129,0.0002616772,0.0002318379,0.0002468234],"domain_scores_gemma":[0.9993043,0.00005408019,0.000031583775,0.00038618522,0.00007964065,0.00014424372],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022684754,0.00008667069,0.00007642899,0.000054511955,0.00008992502,0.00024928476,0.0004472645,0.00004719653,0.0010613955],"category_scores_gemma":[0.000025482132,0.000071013885,0.000035076486,0.00019751566,0.000024959676,0.00028968803,0.00009165561,0.00016819866,0.0005338571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001496991,0.0011642436,0.0067219553,0.000060937415,0.00004692698,0.0000152046205,0.0008673706,0.028216213,0.4609086,0.075196505,0.32773438,0.09905271],"study_design_scores_gemma":[0.00042948287,0.000047133926,0.00013956416,0.0000052097625,0.0000010600817,0.000004324364,0.000008152872,0.9038123,0.032085784,0.00009522306,0.063197985,0.0001738192],"about_ca_topic_score_codex":0.000030725056,"about_ca_topic_score_gemma":0.000026974656,"teacher_disagreement_score":0.87559605,"about_ca_system_score_codex":0.000011853618,"about_ca_system_score_gemma":0.000053717453,"threshold_uncertainty_score":0.99985176},"labels":[],"label_agreement":null},{"id":"W2049954052","doi":"10.1007/s00224-005-1223-5","title":"Rendezvous and Election of Mobile Agents: Impact of Sense of Direction","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Leader election; Correctness; Computer science; Constructive proof; Node (physics); Context (archaeology); Asynchronous communication; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Protocol (science); Theoretical computer science; Computer network; Distributed computing; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.015085414672775604,"score_gpt":0.2905820463513931,"score_spread":0.2754966316786175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049954052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6903936,0.00026755416,0.30777445,0.000005080551,0.00011793511,0.00020513442,0.0000022642887,0.000035897217,0.0011980861],"genre_scores_gemma":[0.9972191,0.000023003264,0.0026343085,0.0000018734064,0.000028000517,0.0000012668262,8.813063e-7,0.000005475968,0.00008607895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.00034711158,0.00048451568,0.00013640692,0.00020227394,0.00011418732],"domain_scores_gemma":[0.99880356,0.00018771618,0.0005032063,0.00023308123,0.00023691333,0.000035498633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013243702,0.00007725947,0.000283701,0.0001693187,0.00003290799,0.000011139181,0.0001363683,0.00004135877,0.0000041906733],"category_scores_gemma":[0.00004382272,0.00006709342,0.000068644054,0.00033148253,0.000074257994,0.00012495634,0.00006282636,0.000052202624,5.320526e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008647148,0.00032391492,0.0017307795,0.00068035384,0.00018074115,5.8331545e-7,0.010776562,0.8300089,0.05382067,0.03805307,0.00018166067,0.06415626],"study_design_scores_gemma":[0.0005038901,0.0006826978,0.0037337868,0.00030864569,0.000011044376,0.000038171678,0.00018580603,0.97690386,0.017008474,0.0004769669,0.00004331809,0.00010334941],"about_ca_topic_score_codex":0.00013592477,"about_ca_topic_score_gemma":0.0000013561921,"teacher_disagreement_score":0.30682552,"about_ca_system_score_codex":0.000032979224,"about_ca_system_score_gemma":0.000041175066,"threshold_uncertainty_score":0.27359903},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007596805078787223,"score_gpt":0.24335416124682405,"score_spread":0.23575735616803684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050063944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012342215,0.00001857522,0.9737111,0.0006469216,0.0002974503,0.00015754592,5.6306214e-7,0.00019086029,0.012634792],"genre_scores_gemma":[0.80579233,0.0000025849613,0.19388191,0.00026137824,0.000037203386,0.0000072093508,6.3011765e-7,0.0000051311986,0.000011618293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976315,0.000111355635,0.00031779095,0.00065347063,0.00062426034,0.0006616486],"domain_scores_gemma":[0.99884474,0.00016449482,0.000047880098,0.0006517049,0.00011523941,0.00017596202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133959,0.00015002259,0.00016960048,0.00037483338,0.00024168323,0.0004947863,0.0020403126,0.0000455588,0.00003805926],"category_scores_gemma":[0.000049594106,0.00013015774,0.000043955737,0.0018281485,0.0017549588,0.00056005083,0.0006528549,0.00018470064,0.00008401408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019644715,0.00007270684,0.00019788137,0.0000034317818,4.5594987e-7,0.00003771688,0.00009668663,0.0032012863,0.00011186963,0.97884244,0.000030514533,0.01740302],"study_design_scores_gemma":[0.00018814916,0.000103319515,0.0024791476,0.000012262563,5.966909e-7,0.000030501455,0.000001054393,0.6450401,0.00031228672,0.35164616,0.000045292953,0.00014116796],"about_ca_topic_score_codex":0.000016587299,"about_ca_topic_score_gemma":0.0000064838696,"teacher_disagreement_score":0.7934501,"about_ca_system_score_codex":0.00007546295,"about_ca_system_score_gemma":0.00016199096,"threshold_uncertainty_score":0.6466218},"labels":[],"label_agreement":null},{"id":"W2050134964","doi":"10.1109/vtcfall.2014.6966166","title":"Rollout Algorithm for Target Search in a Wireless Sensor Network","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Flooding (psychology); Wireless sensor network; Computer network; Node (physics); Heuristic; Mathematical optimization; Real-time computing; Mathematics; Artificial intelligence; Engineering","score_opus":0.018456732994868347,"score_gpt":0.2673638859269356,"score_spread":0.24890715293206725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050134964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022273822,0.000007306962,0.9931405,0.0014034002,0.00013163069,0.00033302268,0.0000010061023,0.000108396685,0.0046519786],"genre_scores_gemma":[0.023042446,0.0000071391096,0.9726313,0.00082636613,0.00011941124,0.00004368199,0.0000049753494,0.0000092129385,0.0033154744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883753,0.00011240558,0.0001642,0.00027565742,0.00019485556,0.0004153452],"domain_scores_gemma":[0.9993525,0.00016359275,0.00001927075,0.0002668029,0.00009638417,0.00010145724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089073763,0.0000796809,0.00013052752,0.000075741504,0.00008110183,0.00013013999,0.0004302477,0.00004837851,0.000037993235],"category_scores_gemma":[0.00001916686,0.000068593945,0.000038627077,0.00038627136,0.00002001917,0.00019355696,0.00012982366,0.00009527647,0.000043933112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009761672,0.0001524201,0.002085303,0.000029491857,0.000015449497,0.000004791684,0.00078689726,0.14994153,0.00008519572,0.24520193,0.008594142,0.5930931],"study_design_scores_gemma":[0.0005041805,0.00006518377,0.00014223358,0.000006738922,3.2628265e-7,0.0000012343373,0.00000996045,0.98825496,0.00014432753,0.0025607208,0.008212382,0.000097723125],"about_ca_topic_score_codex":0.000029540208,"about_ca_topic_score_gemma":0.000013135261,"teacher_disagreement_score":0.83831346,"about_ca_system_score_codex":0.000020109315,"about_ca_system_score_gemma":0.00004904111,"threshold_uncertainty_score":0.27971798},"labels":[],"label_agreement":null},{"id":"W2051092461","doi":"10.1016/j.tcs.2003.08.001","title":"On-line parallel heuristics, processor scheduling and robot searching under the competitive framework","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Heuristics; Computer science; Scheduling (production processes); Point (geometry); Robot; Heuristic; Path (computing); Line (geometry); Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Upper and lower bounds; Programming language","score_opus":0.0251432603993933,"score_gpt":0.3021206933952823,"score_spread":0.276977432995889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051092461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020911242,0.000043111195,0.98869514,0.0050624367,0.00024409896,0.0002534229,6.2719425e-7,0.00011713482,0.0034929186],"genre_scores_gemma":[0.5869942,0.000012898805,0.4111667,0.0017715773,0.000032565007,0.0000054671045,2.2157417e-7,0.0000057384445,0.000010656016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973632,0.0003169216,0.00023438316,0.0006825644,0.00079472084,0.0006081865],"domain_scores_gemma":[0.9973949,0.0013822237,0.000058559614,0.00060081895,0.0002616068,0.00030184342],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023224212,0.00018439181,0.00017440811,0.00012206953,0.0010014422,0.00096523826,0.001531834,0.000052457774,0.000036029844],"category_scores_gemma":[0.00062273064,0.00012008482,0.000035050158,0.0009595878,0.002957411,0.00036289947,0.00061591965,0.00055443536,0.00004615334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044858866,0.000046983554,0.000009596335,0.0000062745166,0.0000035095602,0.0000034876552,0.0005003916,0.097786315,0.000010548214,0.8997678,0.0000047856397,0.0018558005],"study_design_scores_gemma":[0.0001194463,0.00012738217,0.00005315637,0.00004268814,0.0000013371649,0.000012462835,0.00002867199,0.5623505,0.0001272772,0.43700397,0.000024879862,0.00010821183],"about_ca_topic_score_codex":0.0000010202184,"about_ca_topic_score_gemma":3.0255333e-7,"teacher_disagreement_score":0.58490306,"about_ca_system_score_codex":0.000036115725,"about_ca_system_score_gemma":0.00018797709,"threshold_uncertainty_score":0.999756},"labels":[],"label_agreement":null},{"id":"W2052232389","doi":"10.1109/cec.2013.6557978","title":"Binary decision automata modelling stress in the workplace","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Automaton; Covert; Representation (politics); Binary decision diagram; Productivity; String (physics); Machine learning; Artificial intelligence; Risk analysis (engineering); Theoretical computer science; Mathematics; Business","score_opus":0.029615587916060955,"score_gpt":0.2654160449431236,"score_spread":0.23580045702706265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052232389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009528109,0.000025623563,0.9782087,0.0029223196,0.000051749135,0.00020343695,1.4142857e-7,0.00008640336,0.008973488],"genre_scores_gemma":[0.6218614,0.000049612394,0.37633988,0.0006931847,0.000011894492,0.000028792618,0.0000012720484,0.0000038013125,0.0010101778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924934,0.00006771784,0.00012182338,0.0001619621,0.00023623722,0.00016292694],"domain_scores_gemma":[0.9993297,0.00018058284,0.000016600172,0.00039904917,0.000038230795,0.000035841254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031770027,0.000052321826,0.000048104033,0.000073341835,0.00006504922,0.00030881053,0.0008800474,0.000026606502,0.00010846619],"category_scores_gemma":[0.000011528646,0.000030849398,0.000015608632,0.00040126004,0.000011803769,0.0006031987,0.00016979959,0.0000924559,0.0002422732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010263342,0.00007089966,0.00026559882,0.000002850943,0.0000010270562,0.000003510515,0.00088055996,0.93655306,0.00001032108,0.029529026,0.0057755685,0.026906574],"study_design_scores_gemma":[0.000118835334,0.000015351972,0.0002565287,0.000016344793,1.5194139e-7,0.0000013265063,0.00007931598,0.9939849,0.000016004531,0.0050553284,0.00040880995,0.000047121965],"about_ca_topic_score_codex":0.0000991687,"about_ca_topic_score_gemma":0.000010556164,"teacher_disagreement_score":0.6123333,"about_ca_system_score_codex":0.000009959408,"about_ca_system_score_gemma":0.000019632696,"threshold_uncertainty_score":0.31140128},"labels":[],"label_agreement":null},{"id":"W2053218689","doi":"10.1016/j.ic.2012.08.004","title":"Connected graph searching","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Graph; Vertex (graph theory); Conjecture; Theoretical computer science; Connected component; Mathematics; Discrete mathematics","score_opus":0.019700056029231056,"score_gpt":0.2710275313583589,"score_spread":0.2513274753291278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053218689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013401759,0.000028578672,0.98063403,0.0005125519,0.00013103835,0.00010998062,6.209683e-7,0.00016219457,0.005019269],"genre_scores_gemma":[0.95332795,0.000015856318,0.045861125,0.00073037297,0.000017020722,0.000005908109,0.000025188978,0.0000015784535,0.00001500962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944115,0.000044186807,0.0001594137,0.000046113564,0.00016130888,0.0001478497],"domain_scores_gemma":[0.9996434,0.000043751294,0.000057649602,0.00006488001,0.00009320451,0.00009710392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029096758,0.000049982962,0.00004601328,0.00015790711,0.00013400051,0.00023883935,0.00008895879,0.000024051014,0.000008460664],"category_scores_gemma":[0.000027745222,0.00004673434,0.000012978566,0.00026061764,0.000014974426,0.0039520687,0.000056713627,0.000060672068,0.00007820108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045767088,0.00003294512,0.001902174,0.00003454121,0.00001060891,1.4935017e-7,0.011503231,0.012014662,0.000039904273,0.40355223,0.0011296098,0.56977534],"study_design_scores_gemma":[0.0003848782,0.000028320344,0.013014368,0.000007652571,0.0000011977568,0.000013561984,0.00017191087,0.97581303,0.00008060038,0.0034971263,0.00687607,0.00011130727],"about_ca_topic_score_codex":0.000007058308,"about_ca_topic_score_gemma":3.230006e-7,"teacher_disagreement_score":0.96379834,"about_ca_system_score_codex":0.000010816368,"about_ca_system_score_gemma":0.000017279448,"threshold_uncertainty_score":0.28651544},"labels":[],"label_agreement":null},{"id":"W2053680637","doi":"10.1007/s11590-015-0874-7","title":"An information theoretic based integer linear programming approach for the discrete search path planning problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal; Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Computer science; Motion planning; Heuristics; Integer programming; Heuristic; Entropy (arrow of time); Mathematics; Artificial intelligence","score_opus":0.03145900289209521,"score_gpt":0.2827877760298572,"score_spread":0.25132877313776203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053680637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035965684,0.000011913699,0.9927231,0.0051544295,0.00009024619,0.0013036268,0.000004552423,0.00023893648,0.00043722618],"genre_scores_gemma":[0.044609558,0.000002517141,0.95177644,0.002905487,0.00006395033,0.0003020165,0.00030122226,0.000018747707,0.000020065216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983854,0.00018817796,0.0003131207,0.000271612,0.00047523118,0.00036645087],"domain_scores_gemma":[0.9987579,0.0001163408,0.00012487338,0.00047026286,0.00035876036,0.00017187334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001395452,0.00016135542,0.00012017922,0.00017035371,0.00031690835,0.00078426884,0.0007744303,0.00006242877,0.000006942732],"category_scores_gemma":[0.00009105037,0.00011422224,0.000054226704,0.0005534575,0.00009941668,0.0020942176,0.00008392899,0.00017948562,0.000005625175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022108223,0.000029789433,0.00008442353,0.000029564813,0.000008663084,3.1555948e-7,0.002826318,0.9877267,0.000009406926,0.0055651073,0.0006557241,0.0030418925],"study_design_scores_gemma":[0.0006816826,0.000120581295,0.0000055203127,0.000017201373,0.000006860921,0.00000222032,0.00039632386,0.9964412,0.000048082413,0.000035604346,0.0020788054,0.00016591877],"about_ca_topic_score_codex":0.000009540416,"about_ca_topic_score_gemma":1.0836971e-7,"teacher_disagreement_score":0.04457359,"about_ca_system_score_codex":0.000065916734,"about_ca_system_score_gemma":0.00013707302,"threshold_uncertainty_score":0.7562722},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013007104593241791,"score_gpt":0.2663847769236825,"score_spread":0.25337767233044073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053806044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02680027,0.00001376498,0.93614095,0.004846807,0.000112354464,0.00014697552,1.6471742e-7,0.000089874084,0.03184885],"genre_scores_gemma":[0.8048467,0.000007890613,0.19298361,0.002102933,0.00003675589,0.0000051107645,1.7902413e-7,0.0000023194677,0.0000145066915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981261,0.00017656825,0.00018200466,0.00041662902,0.00064714195,0.00045154264],"domain_scores_gemma":[0.998967,0.00018964808,0.000016351532,0.0006576143,0.000058527155,0.00011087886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024813013,0.000091798815,0.000089887726,0.00011559788,0.0003116739,0.00063816836,0.0033243764,0.000024902607,0.00017606869],"category_scores_gemma":[0.00004175498,0.000058330792,0.000029084029,0.0017861832,0.0012941496,0.00062550546,0.00026776432,0.00021243368,0.00020124506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015025116,0.0000335409,0.000027901353,0.0000010776656,3.4044155e-7,0.00000731455,0.0008858589,0.009073423,0.000018531266,0.91522497,0.000024534249,0.07470101],"study_design_scores_gemma":[0.00012478934,0.000056363224,0.0006375732,0.000010314114,3.6258734e-7,0.000020787838,0.000006642367,0.873897,0.000068259054,0.124786034,0.0003041976,0.000087648565],"about_ca_topic_score_codex":0.0000026614396,"about_ca_topic_score_gemma":4.936202e-7,"teacher_disagreement_score":0.8648236,"about_ca_system_score_codex":0.000022514898,"about_ca_system_score_gemma":0.00008527375,"threshold_uncertainty_score":0.6177574},"labels":[],"label_agreement":null},{"id":"W2055943982","doi":"10.1002/net.10094","title":"Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Clique; Computer network; Advice (programming); Bounded function; Theoretical computer science; Pointer (user interface); Mathematics; Artificial intelligence","score_opus":0.007708517376898164,"score_gpt":0.21699970336270394,"score_spread":0.20929118598580576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055943982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084641185,0.000065644614,0.98912966,0.00023650817,0.000112743146,0.00029978695,9.685823e-7,0.000051875322,0.0016387139],"genre_scores_gemma":[0.9941987,0.000011327679,0.0053400956,0.00037364484,0.000016965794,0.000022609407,0.00001858698,0.0000043034847,0.000013766833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.00022398922,0.00033892866,0.00013344771,0.00011396703,0.00026650942],"domain_scores_gemma":[0.99901605,0.00019558077,0.00016416395,0.00035270653,0.00020341377,0.00006808224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074938557,0.00010202023,0.00012633057,0.00007434452,0.00010589963,0.00011078803,0.00032815995,0.000067848945,0.000017768454],"category_scores_gemma":[0.0001494861,0.00006876114,0.00002395384,0.0011453081,0.000062738705,0.0005615113,0.00007048803,0.00026786645,0.00000208672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009103344,0.000015839305,0.00017795373,0.0000069895677,0.000006578965,0.000023057435,0.0006745984,0.97335774,4.3567195e-7,0.009801008,0.0003176603,0.0156090455],"study_design_scores_gemma":[0.00047962458,0.00006337271,0.00009136444,0.000041918283,0.000002558326,0.00013413004,0.00047297665,0.99824995,0.000008942216,0.0001051468,0.00026192833,0.00008810705],"about_ca_topic_score_codex":0.00015810678,"about_ca_topic_score_gemma":0.00047128426,"teacher_disagreement_score":0.9857346,"about_ca_system_score_codex":0.000046936275,"about_ca_system_score_gemma":0.00009832165,"threshold_uncertainty_score":0.2803998},"labels":[],"label_agreement":null},{"id":"W2055960596","doi":"10.1006/jagm.1999.1068","title":"Distributed Online Frequency Assignment in Cellular Networks","year":2000,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Dalhousie University","funders":"","keywords":"Frequency assignment; Vertex (graph theory); Competitive analysis; Computer science; Online algorithm; Graph; Lattice (music); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Upper and lower bounds; Telecommunications","score_opus":0.014104128320367778,"score_gpt":0.24859558391952347,"score_spread":0.23449145559915568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055960596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042761946,0.00037458848,0.99310565,0.001614756,0.00022530292,0.00007094393,0.0000040493924,0.000016023636,0.00031247994],"genre_scores_gemma":[0.46941006,0.0014985893,0.5269703,0.00073681265,0.0006101255,0.000003631938,0.000027823487,0.00002113815,0.00072148134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987013,0.00010101428,0.00047710148,0.00012105322,0.00036384113,0.00023569047],"domain_scores_gemma":[0.9993777,0.00003891261,0.00014593198,0.00017799978,0.00011503534,0.00014437707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004970863,0.000088572284,0.00017578759,0.00011360865,0.000040075684,0.000093929186,0.00056282926,0.000055833138,0.0002460404],"category_scores_gemma":[0.000016991933,0.00007223809,0.000069314396,0.00046606187,0.000021821545,0.00043183568,0.00003722645,0.00032211214,0.000010133305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013581113,0.0007352435,0.00089598855,0.0000062348336,0.000037421123,0.0005551311,0.00036185753,0.68638474,0.00021384971,0.0009841485,0.0014134893,0.30839834],"study_design_scores_gemma":[0.0008583999,0.00024398697,0.002259699,0.000050924704,0.0000033812123,0.00006017464,0.000018758403,0.99128413,0.000082765386,0.0014291629,0.0035873582,0.000121283876],"about_ca_topic_score_codex":0.000011376284,"about_ca_topic_score_gemma":0.0000028349864,"teacher_disagreement_score":0.46613532,"about_ca_system_score_codex":0.00009329802,"about_ca_system_score_gemma":0.00008431043,"threshold_uncertainty_score":0.29457837},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09892549807221367,"score_gpt":0.36858711387949034,"score_spread":0.26966161580727666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056251021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4104065,0.0013484652,0.30669606,0.27615035,0.00065822067,0.0012003198,0.000010157367,0.00003646342,0.0034934848],"genre_scores_gemma":[0.6376398,0.0008617818,0.35589218,0.00233044,0.0005995004,0.000007388369,0.0000026567882,0.0000130963945,0.0026531196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683326,0.0006660608,0.0004024191,0.00011733403,0.0017607176,0.00022017388],"domain_scores_gemma":[0.9973949,0.00036189824,0.00016954266,0.0003515584,0.0016306349,0.00009141807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006440432,0.00006568097,0.00010499824,0.00004618281,0.0005830552,0.00032706457,0.0014658871,0.00004756887,0.000040677587],"category_scores_gemma":[0.00039174908,0.00003460256,0.00017767579,0.00065307535,0.00016406935,0.0013401757,0.00026073988,0.0005769152,0.000007318297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004496202,0.00042882844,0.0014291008,0.00003388603,0.00014841474,0.0000020696136,0.011897719,0.6087373,0.028760267,0.29614443,0.010054295,0.042318724],"study_design_scores_gemma":[0.0004810817,0.00017409671,0.015529597,0.00005434648,0.000004046773,0.00003365753,0.00035321296,0.93484133,0.007914087,0.0038560145,0.036680438,0.00007808236],"about_ca_topic_score_codex":0.0000133376025,"about_ca_topic_score_gemma":0.000008993135,"teacher_disagreement_score":0.32610402,"about_ca_system_score_codex":0.00008815046,"about_ca_system_score_gemma":0.00067710364,"threshold_uncertainty_score":0.4484448},"labels":[],"label_agreement":null},{"id":"W2057121017","doi":"10.1007/s00446-013-0201-4","title":"Time versus space trade-offs for rendezvous in trees","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Node (physics); Logarithm; Tree (set theory); Constant (computer programming); Computer science; Binary logarithm; Task (project management); Combinatorics; Line (geometry); Mathematics; Discrete mathematics; Algorithm; Physics; Geometry","score_opus":0.02343529895674592,"score_gpt":0.26424040785154046,"score_spread":0.24080510889479453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057121017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013183068,0.00004265402,0.98164755,0.0033102618,0.00023330559,0.0005058224,0.000019467316,0.00028790822,0.00076996477],"genre_scores_gemma":[0.94594216,0.0000027126189,0.053666584,0.00009954915,0.00005783082,0.000026059135,0.000118472264,0.0000116277,0.00007498762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866927,0.000069800786,0.0002619957,0.00035297617,0.00018294409,0.00046303714],"domain_scores_gemma":[0.99908614,0.00033135407,0.00008206448,0.00031684348,0.00007145182,0.00011215535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026012814,0.00013504678,0.00017787886,0.00009703777,0.00013541443,0.00025290696,0.00062648655,0.00006617559,0.0000239313],"category_scores_gemma":[0.00011379376,0.00013569363,0.00006407197,0.00056986394,0.000033863646,0.00029324542,0.00013015047,0.00013436041,0.000072175826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106483254,0.0008116948,0.001960839,0.0001066889,0.0001308964,0.000035842568,0.0042242263,0.5129594,0.0039804624,0.0930328,0.06659097,0.31605965],"study_design_scores_gemma":[0.0013788342,0.00009871519,0.002067086,0.000021697355,0.0000017881398,0.0000019973686,0.000053210515,0.99321085,0.0002490576,0.0005885724,0.002158708,0.0001694754],"about_ca_topic_score_codex":0.00003269019,"about_ca_topic_score_gemma":0.0000062569925,"teacher_disagreement_score":0.9327591,"about_ca_system_score_codex":0.000080579026,"about_ca_system_score_gemma":0.00005314161,"threshold_uncertainty_score":0.5533425},"labels":[],"label_agreement":null},{"id":"W2057272165","doi":"10.1007/s00224-014-9555-7","title":"Special Issue on Approximation and Online Algorithms","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.019501056301076253,"score_gpt":0.2620512783076757,"score_spread":0.24255022200659945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057272165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062257834,0.000025343668,0.9751028,0.00017355593,0.0009512045,0.00020551604,0.0000014129546,0.00011237882,0.017202016],"genre_scores_gemma":[0.92860025,0.0000075401585,0.06412532,0.00021176231,0.0060052886,0.0000024445555,0.000008894349,0.000016566923,0.0010219247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987473,0.0003955396,0.0002661553,0.00020832832,0.00023624163,0.00014642107],"domain_scores_gemma":[0.99913186,0.00030348625,0.00015026185,0.00027023713,0.000087324355,0.000056802794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015120757,0.00009030339,0.00018598142,0.00010520573,0.00008977509,0.00008838959,0.0003116328,0.00003973852,0.000006462338],"category_scores_gemma":[0.00007715617,0.00007891633,0.000022844128,0.00017004312,0.000054003915,0.000102487036,0.00010167255,0.000082202045,0.000019086783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056475924,0.00006628522,0.000025506406,0.000088598616,0.000009994091,4.3326747e-7,0.0019251596,0.02219502,0.000042916126,0.7274282,0.0007166665,0.24749556],"study_design_scores_gemma":[0.0002965413,0.00015272846,0.00022555448,0.000113964394,0.0000017832616,0.00000691653,0.000086731,0.98679644,0.00008857485,0.0041681426,0.007966601,0.00009599763],"about_ca_topic_score_codex":0.000005382012,"about_ca_topic_score_gemma":2.35096e-7,"teacher_disagreement_score":0.96460146,"about_ca_system_score_codex":0.000013162633,"about_ca_system_score_gemma":0.0000131802135,"threshold_uncertainty_score":0.32181147},"labels":[],"label_agreement":null},{"id":"W2058122117","doi":"10.1007/s00453-014-9939-8","title":"Convergecast and Broadcast by Power-Aware Mobile Agents","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Theory of computation; Atomic broadcast; Approximation algorithm; Distributed computing; Set (abstract data type); Computer network; Distributed algorithm; Mobile agent; Broadcasting (networking); Algorithm","score_opus":0.005753744172305512,"score_gpt":0.22708732742875873,"score_spread":0.22133358325645322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058122117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003089504,0.00013523684,0.99137187,0.0008510299,0.00028296604,0.00023382918,0.000012641149,0.00018186914,0.0038410798],"genre_scores_gemma":[0.94811964,0.00011760968,0.046073098,0.0020314064,0.00006612021,0.000052038333,0.000027077904,0.000024957366,0.003488036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.000067296176,0.00013744061,0.00031770737,0.00020214824,0.00024808166],"domain_scores_gemma":[0.99936223,0.000047871996,0.00004058604,0.00031375274,0.000064339285,0.0001711954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017410738,0.00010531274,0.00011443744,0.00004941713,0.00013037641,0.00015836982,0.00038427024,0.000049452326,0.00013435917],"category_scores_gemma":[0.000015219022,0.00009896473,0.000025007632,0.00017042783,0.000055946326,0.000278091,0.00022057397,0.00009443343,0.00014971105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006099138,0.00026574777,0.0005594557,0.000036920308,0.000051689658,0.0000143587085,0.0019138652,0.00033500296,0.00079258095,0.014187834,0.15474783,0.8270886],"study_design_scores_gemma":[0.0005479741,0.00020874376,0.00016991001,0.000009920014,0.000002212984,0.000016829617,0.000029723065,0.6781065,0.00074043294,0.0004739527,0.3194803,0.00021353466],"about_ca_topic_score_codex":0.000017433307,"about_ca_topic_score_gemma":4.5847074e-7,"teacher_disagreement_score":0.94529873,"about_ca_system_score_codex":0.00001333951,"about_ca_system_score_gemma":0.000018156446,"threshold_uncertainty_score":0.40356648},"labels":[],"label_agreement":null},{"id":"W2059543065","doi":"10.1145/1542362.1542412","title":"Cache-oblivious range reporting with optimal queries requires superlinear space","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Cache; Range (aeronautics); Range query (database); Block (permutation group theory); Upper and lower bounds; Space (punctuation); Block size; Query optimization; Theoretical computer science; Mathematics; Parallel computing; Combinatorics; Sargable; Web search query; Data mining; Information retrieval; Key (lock); Search engine","score_opus":0.027373880164629282,"score_gpt":0.2754844298772666,"score_spread":0.24811054971263735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059543065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02716077,0.00007833455,0.93458164,0.009934987,0.000057431163,0.00022977768,3.8571292e-7,0.00059892697,0.027357763],"genre_scores_gemma":[0.49336365,0.000021501164,0.5004526,0.0007665677,0.000046467114,0.000006365942,0.0000023719456,0.00000839331,0.0053321356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848753,0.00004908547,0.00040867887,0.00035851944,0.0003487931,0.00034739243],"domain_scores_gemma":[0.99899554,0.00003605471,0.00020258667,0.0004645185,0.00016785867,0.00013346274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005517557,0.00013276801,0.0001759456,0.00009053402,0.00016509632,0.0003258961,0.00037833187,0.000045905846,0.00006537195],"category_scores_gemma":[0.00017334035,0.0000955072,0.00004099263,0.00042298523,0.000054866265,0.0008402537,0.00008209527,0.00012829945,0.00002469875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017554652,0.00078337936,0.022064434,0.000085478096,0.000110813744,0.0014341376,0.01966967,0.112803854,0.0042171422,0.7257913,0.01842628,0.09443797],"study_design_scores_gemma":[0.0020857877,0.0023292643,0.009610504,0.00012415985,0.00001591732,0.0006298494,0.00080699055,0.95336366,0.009118246,0.0015406862,0.019099623,0.0012752977],"about_ca_topic_score_codex":0.000083567254,"about_ca_topic_score_gemma":0.000035362762,"teacher_disagreement_score":0.84055984,"about_ca_system_score_codex":0.000023228866,"about_ca_system_score_gemma":0.00011167389,"threshold_uncertainty_score":0.38946706},"labels":[],"label_agreement":null},{"id":"W2059952830","doi":"10.1080/10798587.2014.906377","title":"Anniversary Editorial–<i>Intelligent Automation and Soft Computing</i>is Twenty Years Old","year":2014,"lang":"en","type":"article","venue":"Intelligent Automation & Soft Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Centennial; Medal; Gold medal; China; Management; Computer science; Operations research; Art history; Engineering; Political science; History; Law; Archaeology","score_opus":0.01597650208399992,"score_gpt":0.26313500153064895,"score_spread":0.24715849944664903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059952830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017962713,0.00008599507,0.96907413,0.00095229386,0.009275211,0.0005351476,0.000005033756,0.0014970968,0.0006123504],"genre_scores_gemma":[0.89326763,0.00006256545,0.09995881,0.0017822544,0.004452909,0.000007771013,0.000052763724,0.000059663867,0.0003556442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614155,0.00034944387,0.00094613165,0.000893004,0.0010179862,0.00065190345],"domain_scores_gemma":[0.9973887,0.0006352272,0.00053398026,0.00063805794,0.00049324275,0.00031077667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017441356,0.00038366995,0.00040812424,0.00041978707,0.00050968135,0.00085614866,0.0009084067,0.0002201971,0.000058664165],"category_scores_gemma":[0.00032702487,0.00042067346,0.00015291697,0.0007565587,0.000120147626,0.0008521029,0.0006995674,0.00040527023,0.00033262832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017550597,0.0002987026,0.002627918,0.00021216541,0.00012594266,0.000009164004,0.01866768,0.15652952,0.00052338064,0.025061559,0.046196654,0.74972975],"study_design_scores_gemma":[0.00035102348,0.00011806014,0.0015925386,0.00015212905,0.000013605415,0.000014086957,0.00012211125,0.9465828,0.0016187149,0.0016149582,0.047390755,0.00042920437],"about_ca_topic_score_codex":0.00005705714,"about_ca_topic_score_gemma":0.0000044836574,"teacher_disagreement_score":0.87530494,"about_ca_system_score_codex":0.0001862477,"about_ca_system_score_gemma":0.000112083086,"threshold_uncertainty_score":0.9998245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08067230983721858,"score_gpt":0.3221294756271801,"score_spread":0.24145716578996151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061226732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001516664,0.000008387781,0.9972062,0.00172829,0.000042840813,0.00026822637,0.00001422341,0.00009538338,0.00048478047],"genre_scores_gemma":[0.010787386,0.000015118055,0.9842894,0.002087932,0.00007498408,0.000015971267,0.000065952314,0.0000065802865,0.0026566954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992243,0.000026145024,0.00013836149,0.00024058089,0.0001657011,0.00020489786],"domain_scores_gemma":[0.9994939,0.000020458621,0.000025660625,0.00030676697,0.000018901643,0.00013430661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011572902,0.00007412877,0.00007077679,0.0000431936,0.00008926979,0.000077594734,0.00045569206,0.000025592095,0.00024680662],"category_scores_gemma":[0.0000036661515,0.00006428649,0.000031139858,0.00006563845,0.000018482808,0.00038696453,0.0000803832,0.00003786247,0.00008355832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8484705e-7,0.00047434215,0.000019536526,0.0000013786395,0.0000065206455,5.3824147e-7,0.0001785668,0.010796015,0.001301717,0.0030613875,0.001972827,0.98218626],"study_design_scores_gemma":[0.00044305314,0.00008234517,0.00055792654,8.1793047e-7,7.6556717e-7,0.0000011109428,0.000011690662,0.8787498,0.00049334974,0.00008322857,0.1194949,0.00008101289],"about_ca_topic_score_codex":0.0000076498445,"about_ca_topic_score_gemma":0.000011625502,"teacher_disagreement_score":0.98210526,"about_ca_system_score_codex":0.000029672794,"about_ca_system_score_gemma":0.000013151847,"threshold_uncertainty_score":0.27023593},"labels":[],"label_agreement":null},{"id":"W2061436084","doi":"10.1016/j.dam.2008.01.027","title":"Constant memory routing in quasi-planar and quasi-polyhedral graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"","keywords":"Mathematics; Constant (computer programming); Planar graph; Combinatorics; Routing (electronic design automation); Planar; Discrete mathematics; Graph; Computer science","score_opus":0.02407151804749936,"score_gpt":0.249513418155564,"score_spread":0.22544190010806464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061436084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049382117,0.000079928555,0.91140723,0.0004974486,0.00006766818,0.00063440134,0.0000059240865,0.00024020846,0.037685063],"genre_scores_gemma":[0.785721,0.000094012794,0.21385099,0.00018060967,0.000010714544,0.000029850904,0.000005457687,0.000016099255,0.00009126575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855924,0.000028661925,0.0004059993,0.0003233424,0.0003135436,0.00036922688],"domain_scores_gemma":[0.9991675,0.00014794777,0.000120903314,0.0004040197,0.000028822375,0.00013079884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039182298,0.00017872639,0.00028690178,0.0001602885,0.00017673917,0.00009103159,0.00039516162,0.00007130076,0.000011960924],"category_scores_gemma":[0.000034832978,0.0001582673,0.000038021662,0.00039072646,0.00016158621,0.00019928846,0.00014593212,0.00018551691,0.000025713802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037281993,0.00013159426,0.00019330949,0.000065950764,0.000010326105,0.000029394138,0.00870313,0.0000624721,0.00073598215,0.988676,0.00009807316,0.0012900273],"study_design_scores_gemma":[0.0022703367,0.00017860043,0.000461335,0.00015258536,0.000013595352,0.00021845191,0.0038830636,0.78298825,0.0012724372,0.20754918,0.000106479354,0.0009056995],"about_ca_topic_score_codex":0.000017058677,"about_ca_topic_score_gemma":0.000012414702,"teacher_disagreement_score":0.7829258,"about_ca_system_score_codex":0.000023922223,"about_ca_system_score_gemma":0.00006191901,"threshold_uncertainty_score":0.6453953},"labels":[],"label_agreement":null},{"id":"W2061601299","doi":"10.1016/j.dam.2012.08.003","title":"Batching and delivery in semi-online distribution systems","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Distribution center; Instant; Distribution (mathematics); Order (exchange); Total cost; Line (geometry); Simple (philosophy); Computer science; Mathematics; Mathematical optimization; Operations research; Business; Upper and lower bounds; Marketing","score_opus":0.021888167250066887,"score_gpt":0.2541182552183995,"score_spread":0.23223008796833258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061601299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07649408,0.00015828857,0.92113477,0.00009515756,0.000070637565,0.00028364154,0.000014434762,0.00008404945,0.0016649354],"genre_scores_gemma":[0.9210801,0.00006536905,0.0786574,0.000036128382,0.000035681882,0.000026463287,0.000051645522,0.000008709752,0.00003849117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.00001877703,0.00024085658,0.00014288614,0.00018799346,0.0003054102],"domain_scores_gemma":[0.9994822,0.00008788425,0.00007132492,0.00023314073,0.000022240221,0.00010321441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360843,0.00010233183,0.00014929759,0.000048498066,0.000068337264,0.00011542977,0.00020464837,0.000050391587,0.0000029019222],"category_scores_gemma":[0.000020595506,0.000088325934,0.000015845522,0.00020085508,0.000023889794,0.00031513654,0.00020233972,0.00011139929,0.000014315458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023607618,0.00018355339,0.0008494121,0.00026857897,0.00001121722,0.0000014820146,0.0041416646,0.0022358852,0.001098662,0.9880604,0.0001467599,0.0029999998],"study_design_scores_gemma":[0.0004063391,0.000013518381,0.0011456733,0.000087938985,0.000006378147,0.000014161282,0.0010296747,0.99122864,0.00016642858,0.0050192615,0.0006351939,0.00024679297],"about_ca_topic_score_codex":0.0000086838545,"about_ca_topic_score_gemma":0.0000019271554,"teacher_disagreement_score":0.98899275,"about_ca_system_score_codex":0.000035151064,"about_ca_system_score_gemma":0.000014104776,"threshold_uncertainty_score":0.3601827},"labels":[],"label_agreement":null},{"id":"W2064766370","doi":"10.1007/pl00008935","title":"Assigning labels in an unknown anonymous network with a leader","year":2001,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Task (project management); Node (physics); A priori and a posteriori; Network topology; Protocol (science); Process (computing); Computer network; Quality (philosophy); Time complexity; Range (aeronautics); Theoretical computer science; Algorithm; Distributed computing","score_opus":0.026435736169659056,"score_gpt":0.27016343630201634,"score_spread":0.24372770013235728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064766370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046012245,0.000053469692,0.95194066,0.00047886136,0.000082161,0.0001723116,0.0000019035162,0.00031712366,0.0009412602],"genre_scores_gemma":[0.9344643,0.0000036496208,0.06502947,0.0003081371,0.00008802236,0.000004946898,0.000060179165,0.000012354396,0.000028976783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982025,0.00017316134,0.00027022758,0.00043960198,0.00026765524,0.0006468433],"domain_scores_gemma":[0.9991256,0.00009983741,0.000096537486,0.00039067565,0.00013636693,0.00015097928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048106295,0.00016029592,0.00019153676,0.00008827264,0.00022949354,0.0003711723,0.00065931043,0.00006492433,0.0000107300975],"category_scores_gemma":[0.000023074346,0.00014517872,0.000024700419,0.0016189216,0.000038952152,0.00046774038,0.00014467338,0.00027020194,0.000013084503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010590512,0.0001157993,0.055585895,0.0000067564774,0.000010252363,0.00014111205,0.0005622576,0.9057184,0.0000554653,0.009981291,0.00027330677,0.027538896],"study_design_scores_gemma":[0.00065354875,0.00013516698,0.008366898,0.000083100305,0.0000019755757,0.000035064768,0.000062652594,0.9888267,0.000036332644,0.0002977448,0.0012697546,0.00023104688],"about_ca_topic_score_codex":0.000022749637,"about_ca_topic_score_gemma":0.000041490708,"teacher_disagreement_score":0.888452,"about_ca_system_score_codex":0.00006708842,"about_ca_system_score_gemma":0.00008658072,"threshold_uncertainty_score":0.5920217},"labels":[],"label_agreement":null},{"id":"W2064871734","doi":"10.1016/j.tcs.2006.06.017","title":"Deterministic M2M multicast in radio networks","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Node (physics); Graph; Source-specific multicast; Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.007809796145720538,"score_gpt":0.24408707871843138,"score_spread":0.23627728257271086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064871734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004851473,0.000018575824,0.98785716,0.0006193071,0.00035814903,0.00018052527,3.6582196e-7,0.00016377552,0.0059506465],"genre_scores_gemma":[0.79299664,0.0000026507998,0.20660047,0.00027709824,0.00008958507,0.000006797228,7.093019e-7,0.000005644361,0.00002041514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763703,0.00012968884,0.0003342425,0.00064858026,0.0005267254,0.0007237129],"domain_scores_gemma":[0.998738,0.00025377446,0.000045621575,0.00063677283,0.00011710155,0.00020874196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757065,0.00015599054,0.00018176895,0.00026402553,0.00024050285,0.00057311234,0.0020197835,0.000053012944,0.000039852504],"category_scores_gemma":[0.000060600196,0.0001338655,0.00004198549,0.0016284348,0.0018159894,0.0005568155,0.000714288,0.000226505,0.00005880324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027184244,0.00007039489,0.00021094548,0.0000024925098,4.7885544e-7,0.000032259577,0.00007871595,0.049881537,0.000041376385,0.9354398,0.000046258265,0.014192993],"study_design_scores_gemma":[0.00029334406,0.00008098987,0.0035925077,0.000018044999,8.110515e-7,0.000028171027,0.0000011546666,0.9501393,0.00011209996,0.045479737,0.000079849386,0.00017397737],"about_ca_topic_score_codex":0.000011172308,"about_ca_topic_score_gemma":0.0000038235107,"teacher_disagreement_score":0.90025777,"about_ca_system_score_codex":0.000069742135,"about_ca_system_score_gemma":0.00010022283,"threshold_uncertainty_score":0.66910887},"labels":[],"label_agreement":null},{"id":"W2065444014","doi":"10.1016/j.tcs.2007.11.016","title":"The Magnus–Derek game","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Waterloo","keywords":"Security token; Combinatorial game theory; Mathematical game; Set (abstract data type); Mathematics; Game tree; Computer science; Repeated game; Combinatorics; Game theory; Mathematical economics; Simultaneous game; Computer network","score_opus":0.009851086488203221,"score_gpt":0.26878522570535635,"score_spread":0.25893413921715314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065444014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014764578,0.000031250172,0.9758431,0.003935033,0.00062593777,0.00015033023,1.8522495e-7,0.00021133956,0.017726406],"genre_scores_gemma":[0.82979095,0.00001201592,0.16885613,0.0011469597,0.00009554046,0.0000026555986,1.5830445e-7,0.0000051185375,0.00009047726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744177,0.00008119187,0.00026565557,0.000492539,0.00088619627,0.00083262014],"domain_scores_gemma":[0.9978508,0.00061151735,0.000047820162,0.00087327446,0.00026524076,0.00035136752],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004882241,0.00012419734,0.00010029088,0.00011968173,0.00084658834,0.0010152347,0.0035120696,0.000034370976,0.00003142217],"category_scores_gemma":[0.00014604039,0.00007713894,0.000047990226,0.001417183,0.0034007162,0.00055822654,0.0010941197,0.0002082681,0.00020284967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000325159,0.00001748532,0.000015141402,0.0000010232369,0.0000010977187,0.0000071032064,0.00023352637,0.00015981276,0.00008880171,0.8981915,0.000103214305,0.101178035],"study_design_scores_gemma":[0.00017354831,0.00013343897,0.00094902783,0.000007495282,9.506235e-7,0.00003680208,0.000009486364,0.7605459,0.0016581011,0.23198612,0.0043318607,0.00016724718],"about_ca_topic_score_codex":0.0000014621348,"about_ca_topic_score_gemma":0.0000013030698,"teacher_disagreement_score":0.8283145,"about_ca_system_score_codex":0.000048546524,"about_ca_system_score_gemma":0.00012693388,"threshold_uncertainty_score":0.99931145},"labels":[],"label_agreement":null},{"id":"W2066234959","doi":"10.1016/j.tcs.2012.11.022","title":"Exploring an unknown dangerous graph using tokens","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.1472886519647449,"score_gpt":0.3144289435516493,"score_spread":0.1671402915869044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066234959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08685297,0.000022617352,0.90978765,0.00021297378,0.0009421109,0.00012452019,4.0132286e-7,0.0002700512,0.0017867261],"genre_scores_gemma":[0.62271166,0.000006221144,0.37681744,0.00029092396,0.00015931559,0.000004715627,3.670715e-7,0.000006497791,0.0000028451825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973745,0.00017067867,0.0002302152,0.00051457743,0.000738842,0.000971224],"domain_scores_gemma":[0.99812305,0.00009523919,0.00004749752,0.0008270773,0.0001871396,0.0007200209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001974275,0.00016659334,0.00015722649,0.0002775882,0.00059113756,0.0005608813,0.0020148694,0.00003310594,0.000027778095],"category_scores_gemma":[0.00004750168,0.00014048256,0.00004878044,0.0016368135,0.0013564918,0.0050958195,0.0009766982,0.00019056255,0.000053151514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016120691,0.00008302499,0.00011410121,0.0000031776726,0.0000017068534,0.0000026301368,0.001508744,0.0023815047,0.00058804353,0.9613906,0.0000042271954,0.033920623],"study_design_scores_gemma":[0.00015112504,0.00013776962,0.0005177679,0.000018021894,0.0000030221165,0.00005469153,0.00001570766,0.97880703,0.0030255644,0.016697256,0.00028476244,0.00028726397],"about_ca_topic_score_codex":0.0000053308845,"about_ca_topic_score_gemma":2.7644856e-7,"teacher_disagreement_score":0.9764255,"about_ca_system_score_codex":0.00006336994,"about_ca_system_score_gemma":0.0000858961,"threshold_uncertainty_score":0.57287127},"labels":[],"label_agreement":null},{"id":"W2066302983","doi":"10.1109/cig.2007.368093","title":"Using Stochastic AI Techniques to Achieve Unbounded Resolution in Finite Player Goore Games and its Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Pruning; Automaton; Domain (mathematical analysis); Learning automata; Implementation; Theoretical computer science; Resolution (logic); Field (mathematics); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.04705829363744853,"score_gpt":0.3418484609963348,"score_spread":0.2947901673588863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066302983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008510553,0.00003190082,0.9954194,0.0013791578,0.000014975845,0.0005511081,0.0000010878259,0.00014462016,0.0016066992],"genre_scores_gemma":[0.6238624,0.000009661336,0.37452742,0.0012176895,0.00002218634,0.000049315437,0.0000023243817,0.000006952833,0.0003020223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991905,0.000026969781,0.00017849414,0.00024799962,0.00013498386,0.0002210605],"domain_scores_gemma":[0.99949944,0.00009981649,0.00002803558,0.000182924,0.000088752204,0.00010101912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044582752,0.00007505602,0.000076301076,0.00028027978,0.00009970585,0.000111400564,0.00020892889,0.000051858104,0.0000075141174],"category_scores_gemma":[0.00004809577,0.000071297065,0.000011195207,0.0006622506,0.000019280298,0.00031585907,0.00015748176,0.00010357739,0.000011349257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004888554,0.00023143797,0.00026459902,0.000043441738,0.0000123364025,0.0000070836436,0.0027939978,0.142742,0.011677895,0.7605414,0.00045752578,0.08117945],"study_design_scores_gemma":[0.00016240352,0.00006569311,0.00036162563,0.00003121598,0.0000013383292,0.0000063671537,0.00003965276,0.99054664,0.0013869213,0.005424778,0.0018182802,0.00015509903],"about_ca_topic_score_codex":0.000033432916,"about_ca_topic_score_gemma":0.00011108531,"teacher_disagreement_score":0.8478046,"about_ca_system_score_codex":0.000057409485,"about_ca_system_score_gemma":0.00004472402,"threshold_uncertainty_score":0.290741},"labels":[],"label_agreement":null},{"id":"W2066449891","doi":"10.1007/s00453-008-9208-9","title":"An Improved Algorithm for Online Unit Clustering","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Cluster analysis; Theory of computation; Online algorithm; Partition (number theory); Mathematics; Combinatorics; Dimension (graph theory); Upper and lower bounds; Randomized algorithm; Algorithm; Sequence (biology); Unit (ring theory); Approximation algorithm; Computer science; Discrete mathematics; Statistics","score_opus":0.041953442326293944,"score_gpt":0.2997598735524124,"score_spread":0.25780643122611846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066449891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041531926,0.000027925711,0.9978885,0.0005391608,0.00025694643,0.00035698357,0.000031319898,0.00031360541,0.00017020541],"genre_scores_gemma":[0.003910469,0.000032000436,0.994266,0.000655176,0.00021066297,0.000043150492,0.00007011587,0.000020759744,0.00079168763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876976,0.00004937756,0.00022650039,0.00039548613,0.00017920026,0.00037965743],"domain_scores_gemma":[0.99894476,0.00006567279,0.00005897268,0.00052369904,0.00020586498,0.00020105654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018727167,0.00013999501,0.0001552485,0.00011384263,0.00027859723,0.00009098003,0.000810815,0.00006980863,0.000018094546],"category_scores_gemma":[0.000021241165,0.00013569483,0.000061995925,0.00031320564,0.00005347885,0.00060419575,0.0001474911,0.00012379551,0.000017032105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003580853,0.00022206454,0.0000096282,0.000007730828,0.000017617012,0.000011890006,0.00040147698,0.00096158864,0.00064327486,0.0005582544,0.00040030986,0.9967626],"study_design_scores_gemma":[0.0006704311,0.00026253765,0.00011282457,0.0000047925855,0.000002270713,0.000044189088,0.000016067925,0.98744637,0.00059911003,0.0003858162,0.010269552,0.00018604577],"about_ca_topic_score_codex":0.000035977446,"about_ca_topic_score_gemma":0.000010497711,"teacher_disagreement_score":0.99657655,"about_ca_system_score_codex":0.00002428577,"about_ca_system_score_gemma":0.00010467021,"threshold_uncertainty_score":0.55334747},"labels":[],"label_agreement":null},{"id":"W2067257332","doi":"10.1080/15326340701470937","title":"Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem","year":2007,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Optimal stopping; Context (archaeology); Infinity; Markov process; Function (biology); Stopping time; Markov chain; Poisson distribution; Mathematical optimization; Value (mathematics); Applied mathematics; Statistics; Mathematical analysis","score_opus":0.03384811400664647,"score_gpt":0.26438307362821,"score_spread":0.23053495962156353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067257332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004953998,0.000031008516,0.98812693,0.0035106984,0.00016470933,0.0005902427,0.0000056692443,0.00016682615,0.0069084824],"genre_scores_gemma":[0.6883248,0.000007536974,0.30815244,0.0023517006,0.00018016715,0.00009418169,0.000024523923,0.000024957015,0.0008396951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982429,0.000050344242,0.0003732006,0.00026896608,0.0005782907,0.00048629046],"domain_scores_gemma":[0.99863183,0.00030292792,0.00016653941,0.0005272778,0.00021039807,0.00016101716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008727398,0.00017993721,0.00014262692,0.00018619433,0.00036416255,0.00036729465,0.0008755732,0.000075174066,0.000021416621],"category_scores_gemma":[0.00009161878,0.00013379188,0.000061806124,0.00029295872,0.00006759579,0.0014656106,0.0002221879,0.0002614356,0.00016827846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017203667,0.000038808776,0.0000035307646,0.000016092079,0.0000115891025,0.0000017055962,0.0020913708,0.9110304,0.000009724089,0.07272727,0.00093308475,0.013119227],"study_design_scores_gemma":[0.00035917948,0.00011358078,0.000027149048,0.00007926628,0.0000050322187,0.000011182203,0.00022000444,0.99099004,0.000005015322,0.007264414,0.00074727315,0.00017788696],"about_ca_topic_score_codex":0.00002133815,"about_ca_topic_score_gemma":0.000035343157,"teacher_disagreement_score":0.6878294,"about_ca_system_score_codex":0.000075137956,"about_ca_system_score_gemma":0.000086507986,"threshold_uncertainty_score":0.5455874},"labels":[],"label_agreement":null},{"id":"W2067326981","doi":"10.5555/545381.545481","title":"Incremental) priority algorithms","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Computer science; Simplicity; Greedy randomized adaptive search procedure; Mathematical optimization; Algorithm; Scheduling (production processes); Limit (mathematics); Approximation algorithm; Theoretical computer science; Mathematics","score_opus":0.024356093509823745,"score_gpt":0.26322250264118136,"score_spread":0.23886640913135762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067326981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014819298,0.00052330684,0.82118505,0.020703092,0.0022508737,0.0014931689,0.00005944268,0.001663774,0.15063936],"genre_scores_gemma":[0.40719742,0.0027303165,0.552513,0.008768098,0.0013655345,0.00039854785,0.00009320662,0.00021453132,0.026719335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968771,0.00018779768,0.0004352275,0.0008535386,0.0009198871,0.0007264537],"domain_scores_gemma":[0.99820256,0.00008300958,0.00012891999,0.0010766886,0.00012800844,0.0003808221],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044634705,0.0003428609,0.00029090833,0.0002336546,0.00037243843,0.00045240187,0.0013781467,0.000132617,0.00042916168],"category_scores_gemma":[0.000029816705,0.0003071682,0.00015880154,0.0007427223,0.00011361401,0.00090059993,0.00043833716,0.00036536134,0.0011737631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006150902,0.0031620208,0.0011173299,0.00020443866,0.00051585835,0.0005529934,0.011241486,0.010549039,0.013515585,0.21592182,0.06389142,0.6792665],"study_design_scores_gemma":[0.001357668,0.0006127447,0.0003741068,0.00004569947,0.000010964082,0.000035634574,0.000050405888,0.95536613,0.0034779455,0.0012130417,0.03674391,0.0007117513],"about_ca_topic_score_codex":0.000047731675,"about_ca_topic_score_gemma":0.000003503183,"teacher_disagreement_score":0.94481707,"about_ca_system_score_codex":0.00014314493,"about_ca_system_score_gemma":0.000034302902,"threshold_uncertainty_score":0.9999381},"labels":[],"label_agreement":null},{"id":"W2068825173","doi":"10.1016/j.tcs.2010.12.065","title":"Fast edge searching and fast searching on graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search problem; Mathematics; Combinatorics; Graph; Enhanced Data Rates for GSM Evolution; Search algorithm; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.027501399335166436,"score_gpt":0.2653047214923998,"score_spread":0.23780332215723338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068825173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02545168,0.0000093035405,0.94771534,0.0006018439,0.0002465658,0.00019974032,0.0000010384472,0.00021686051,0.025557652],"genre_scores_gemma":[0.78003615,0.000009361271,0.21928354,0.0006039484,0.0000340315,0.0000045381785,3.3078382e-7,0.000008049769,0.000020068866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971007,0.00023430758,0.00022331259,0.0008197061,0.00085568894,0.00076628],"domain_scores_gemma":[0.9983443,0.0002249001,0.0000428339,0.00069029565,0.00015125926,0.0005463811],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022179063,0.00018626676,0.00017254113,0.00040510605,0.0007636506,0.00070785696,0.0021197328,0.000041709878,0.00005420376],"category_scores_gemma":[0.000081540755,0.0001482325,0.000047134534,0.0011213325,0.0027204014,0.00088421174,0.0016350057,0.0004120724,0.0000867016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068469562,0.000055773387,0.00010780699,0.0000066429307,0.000002557658,0.000011731666,0.0032081432,0.0002004332,0.00015692481,0.9058883,0.000015056568,0.09033976],"study_design_scores_gemma":[0.00024317375,0.00043166228,0.0026287558,0.00004981223,0.0000014406044,0.000034891316,0.000025389789,0.78477573,0.00137385,0.21015772,0.000034746947,0.00024281646],"about_ca_topic_score_codex":0.000008202784,"about_ca_topic_score_gemma":6.1706163e-7,"teacher_disagreement_score":0.7845753,"about_ca_system_score_codex":0.000030651627,"about_ca_system_score_gemma":0.000106115454,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W2068905681","doi":"10.1145/1139113.1139123","title":"Online pricing for web service providers","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Service provider; Online algorithm; Web service; Service (business); Overtime; Variation (astronomy); World Wide Web; Algorithm; Business","score_opus":0.023813752150149147,"score_gpt":0.2679550919869116,"score_spread":0.24414133983676245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068905681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012931083,0.000010795806,0.97725636,0.012439943,0.000061659994,0.0002943951,0.0000016674818,0.00022190955,0.008420169],"genre_scores_gemma":[0.07979805,0.000002274283,0.90920734,0.0044724043,0.00007629969,0.0000252026,0.000018378858,0.000008090391,0.006391969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994601,0.000011022149,0.00010769135,0.00015776951,0.00010354899,0.00015988166],"domain_scores_gemma":[0.9996127,0.00004206943,0.000023222803,0.00016299414,0.00012664835,0.00003237804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103314705,0.000048169295,0.00005026271,0.00004696016,0.00006569007,0.000112568836,0.0002745865,0.000019739815,0.000016684042],"category_scores_gemma":[0.000010635944,0.00003967439,0.000019682428,0.00026938427,0.0000053845506,0.00030426693,0.00006503691,0.000029950617,0.000017204353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010712104,0.00074547646,0.0009775467,0.00023884216,0.000019761495,0.0000037565642,0.00067136815,0.10574245,0.008003386,0.7647749,0.077398024,0.041413736],"study_design_scores_gemma":[0.00029843714,0.00002479805,0.00024340843,0.0000047288404,7.206809e-7,0.0000010636362,0.000016597045,0.9690379,0.0003351313,0.00220659,0.02776309,0.000067526256],"about_ca_topic_score_codex":0.00011240872,"about_ca_topic_score_gemma":0.00029710057,"teacher_disagreement_score":0.86329544,"about_ca_system_score_codex":0.000013335902,"about_ca_system_score_gemma":0.00006698518,"threshold_uncertainty_score":0.16178747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06650966170180576,"score_gpt":0.3477666385531639,"score_spread":0.28125697685135814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069552341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037200708,0.000015631982,0.96186954,0.0001067393,0.00017542855,0.0004840307,0.0000012114252,0.000058005244,0.000088706816],"genre_scores_gemma":[0.5156657,0.000016287986,0.48411888,0.000115288814,0.000047504414,0.000009426366,0.0000035031067,0.000010907769,0.000012490536],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986675,0.00008447968,0.00021269315,0.00046964956,0.00022310742,0.0003425707],"domain_scores_gemma":[0.99941105,0.00010547094,0.00003892561,0.0002465937,0.000028417599,0.00016953418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064042694,0.00014085598,0.0001619661,0.00027900876,0.00026014453,0.00060747715,0.00028183858,0.00006560025,0.000022133034],"category_scores_gemma":[0.000005108719,0.0001292612,0.000037858943,0.00019662088,0.000088641944,0.0009400735,0.00032221415,0.00021529972,0.000003684743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022385047,0.0019973423,0.0022308328,0.00034140723,0.00006418948,0.0001018014,0.017387284,0.101080574,0.43539596,0.0872547,0.00052850775,0.35339355],"study_design_scores_gemma":[0.0008467515,0.00052293646,0.00014685414,0.000027258895,0.0000016035724,0.000018111856,0.00015433885,0.99645764,0.00057145226,0.0008988563,0.00018605652,0.00016814121],"about_ca_topic_score_codex":0.00001237704,"about_ca_topic_score_gemma":0.000008822469,"teacher_disagreement_score":0.89537704,"about_ca_system_score_codex":0.00010350253,"about_ca_system_score_gemma":0.000046431232,"threshold_uncertainty_score":0.5857916},"labels":[],"label_agreement":null},{"id":"W2070382302","doi":"10.1109/ccece.2014.6900990","title":"Cellular automata and Mobile Wireless Sensor Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless sensor network; Computer science; Automaton; Cellular automaton; Learning automata; Key distribution in wireless sensor networks; Set (abstract data type); Point (geometry); Wireless; Wireless network; Computer network; Real-time computing; Algorithm; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.00754208984604546,"score_gpt":0.21569169498196583,"score_spread":0.20814960513592037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070382302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057477094,0.00002326504,0.98628265,0.00032983764,0.00008422026,0.000105168096,1.2339656e-7,0.00023985878,0.0071871816],"genre_scores_gemma":[0.8995111,0.000045435616,0.09714794,0.0006022583,0.000044020053,0.000012514061,0.0000019665442,0.00000645177,0.002628316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938387,0.000057383495,0.000089001864,0.00019690934,0.00010837345,0.0001644403],"domain_scores_gemma":[0.9995053,0.000051323237,0.000019160876,0.00029490233,0.000034452638,0.00009486632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023677458,0.000059148228,0.0000727765,0.000031076666,0.000075614495,0.00015952089,0.0002470735,0.000034857003,0.00003819539],"category_scores_gemma":[0.0000059800122,0.000048219485,0.000013457643,0.00012781449,0.000027375476,0.00018014357,0.0001717789,0.000057684974,0.000034851677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043534274,0.00015611567,0.0011824679,0.000046692898,0.000023155595,0.000011520804,0.0010580729,0.14688589,0.0017677156,0.41436404,0.010313943,0.42418602],"study_design_scores_gemma":[0.00015688519,0.000041083,0.0000701178,0.0000031171128,5.726561e-7,0.000002632695,0.0000065361987,0.987747,0.00028942456,0.0001805344,0.011430278,0.00007178803],"about_ca_topic_score_codex":0.000008910637,"about_ca_topic_score_gemma":0.0000013437717,"teacher_disagreement_score":0.89376336,"about_ca_system_score_codex":0.0000042633424,"about_ca_system_score_gemma":0.000008273859,"threshold_uncertainty_score":0.19663335},"labels":[],"label_agreement":null},{"id":"W2070441373","doi":"10.1109/tsmcb.2013.2238230","title":"Modeling the “Learning Process” of the Teacher in a Tutorial-Like System Using Learning Automata","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Component (thermodynamics); Computer science; Process (computing); Field (mathematics); Domain (mathematical analysis); Task (project management); Software; Tutorial system; Automaton; Human–computer interaction; Artificial intelligence; Mathematics education; Software engineering; Programming language; Psychology","score_opus":0.02394945484910472,"score_gpt":0.26045155844835355,"score_spread":0.23650210359924884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070441373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083650224,0.000015793365,0.9146716,0.00020276835,0.00046891868,0.00038396832,3.7944366e-7,0.00012609233,0.00048022944],"genre_scores_gemma":[0.99612457,0.000011463778,0.0032341885,0.000026612239,0.000025731073,0.00003626267,1.5700734e-7,0.000016734579,0.0005242789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847263,0.0003190974,0.0003282677,0.00022904793,0.00040469304,0.00024626259],"domain_scores_gemma":[0.99925065,0.0000851852,0.00009593686,0.00036975945,0.00015254664,0.000045912377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042348314,0.00012502939,0.00013849355,0.00010366824,0.00031219877,0.00015419538,0.0006364788,0.00008054491,0.000016981647],"category_scores_gemma":[0.000017591652,0.00008244885,0.00006920553,0.0006328962,0.00005186109,0.00025965224,0.000009378338,0.0006461549,0.000015620295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018562163,0.00004530393,0.000055353,0.000026857948,0.000008712463,2.854835e-7,0.0028902993,0.99440616,0.0002793546,0.00025427935,0.0000028003146,0.002028706],"study_design_scores_gemma":[0.00024410746,0.00003349089,0.000031959902,0.00012527964,0.000008430341,0.000006180627,0.0007595068,0.99815035,0.0004383132,0.000060525203,0.000047690453,0.00009414978],"about_ca_topic_score_codex":0.0004343058,"about_ca_topic_score_gemma":0.00002907875,"teacher_disagreement_score":0.91247433,"about_ca_system_score_codex":0.00008857287,"about_ca_system_score_gemma":0.000114318136,"threshold_uncertainty_score":0.33621666},"labels":[],"label_agreement":null},{"id":"W2070526994","doi":"10.1016/j.tcs.2008.02.035","title":"Time constrained graph searching","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Visibility; Computer science; Graph; Combinatorics; Theoretical computer science; Mathematics; Geography","score_opus":0.015721146206224182,"score_gpt":0.2531572785783627,"score_spread":0.2374361323721385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070526994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012264555,0.00000769871,0.9705285,0.0015649502,0.00017665791,0.00015186972,7.8725293e-7,0.00035554232,0.014949452],"genre_scores_gemma":[0.7038587,0.000006278718,0.29537117,0.00065556297,0.000044249544,0.000002992779,5.7839407e-7,0.0000048705374,0.000055632307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975052,0.00014495986,0.00022174644,0.00060052477,0.00088163454,0.0006459465],"domain_scores_gemma":[0.998452,0.0002182115,0.000037963964,0.0006507965,0.00022339646,0.00041761564],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013958408,0.00014042245,0.00016172002,0.00027180222,0.0008504889,0.00029278675,0.0023650518,0.00003568075,0.00015856928],"category_scores_gemma":[0.00009541131,0.000115755625,0.0000609759,0.0015739284,0.0064986297,0.0008231164,0.00093009503,0.00022414523,0.0004253817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021601516,0.000039057624,0.000018329498,0.0000020860216,0.0000022143272,0.00003129462,0.0006814873,0.0013073084,0.0006170187,0.98891276,0.0001344714,0.008251815],"study_design_scores_gemma":[0.00021648155,0.00012979547,0.0001967565,0.00001080748,6.9974874e-7,0.00017738246,0.000002259078,0.9379362,0.0009408384,0.06010943,0.0001050965,0.00017428138],"about_ca_topic_score_codex":0.0000013214751,"about_ca_topic_score_gemma":5.0560942e-8,"teacher_disagreement_score":0.9366289,"about_ca_system_score_codex":0.00003112128,"about_ca_system_score_gemma":0.00026480516,"threshold_uncertainty_score":0.9962051},"labels":[],"label_agreement":null},{"id":"W2071941627","doi":"10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n","title":"Impact of topographic information on graph exploration efficiency","year":2000,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Graph; A priori and a posteriori; Computer science; Biconnected graph; Theoretical computer science; Strength of a graph; Knowledge graph; Combinatorics; Algorithm; Line graph; Artificial intelligence; Mathematics; Voltage graph; Geography","score_opus":0.013144953852214782,"score_gpt":0.2557916865583918,"score_spread":0.242646732706177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071941627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025882242,0.00002594144,0.96084034,0.00011404139,0.000087615095,0.00016862057,7.389932e-7,0.000093268085,0.012787165],"genre_scores_gemma":[0.99751693,0.00019338075,0.0020645796,0.00012579032,0.000022574419,0.000008453488,0.0000131834795,0.0000024169044,0.0000526675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993313,0.000043589665,0.00018755981,0.00009202863,0.00019230189,0.00015321057],"domain_scores_gemma":[0.99954337,0.000026939448,0.000057854046,0.0002460407,0.00007330083,0.00005247805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017547708,0.0000669471,0.000072567505,0.00015319188,0.00006643061,0.000080560436,0.0002538073,0.0000483667,0.00015310191],"category_scores_gemma":[0.0000070749156,0.00005423251,0.00007301579,0.0008391016,0.000023778106,0.0011323432,0.000016308113,0.00008975801,0.000035890367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008133295,0.00003685107,0.00033179676,0.0000015852579,0.0000041068165,1.4010779e-7,0.0002990592,0.86309606,0.0000016364203,0.005501406,0.00079817657,0.12992108],"study_design_scores_gemma":[0.00022943468,0.00034214254,0.0051717428,0.000013831546,0.000001013527,7.5561815e-7,0.0000041686926,0.9926738,0.0000099658655,0.0009961664,0.0004854059,0.00007157239],"about_ca_topic_score_codex":0.000016242358,"about_ca_topic_score_gemma":0.0000013036108,"teacher_disagreement_score":0.9716347,"about_ca_system_score_codex":0.00001302924,"about_ca_system_score_gemma":0.000024050945,"threshold_uncertainty_score":0.22115377},"labels":[],"label_agreement":null},{"id":"W2072269078","doi":"10.1007/s00453-009-9361-9","title":"Trade-offs Between the Size of Advice and Broadcasting Time in Trees","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Advice (programming); Competitive analysis; Computer science; Tree (set theory); Node (physics); Theory of computation; Dissemination; Oracle; Network topology; Computer network; Theoretical computer science; Distributed computing; Upper and lower bounds; Mathematics; Algorithm; Telecommunications; Combinatorics","score_opus":0.012749794725829575,"score_gpt":0.24902462796678823,"score_spread":0.23627483324095866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072269078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23248325,0.0020670786,0.56318176,0.14234054,0.000332799,0.0026115172,0.00004114676,0.0011165414,0.055825364],"genre_scores_gemma":[0.9113154,0.00002289105,0.08781569,0.00047445612,0.000054884775,0.0000027310305,0.0000014253401,0.00000483234,0.00030769283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992651,0.000072450224,0.0001832981,0.00016421425,0.00015158454,0.00016337397],"domain_scores_gemma":[0.9993646,0.00033009006,0.00005068615,0.00019060516,0.000018925244,0.000045060282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029586995,0.00006666239,0.00011997795,0.00004651493,0.00005308804,0.000046687157,0.00036710151,0.00003230266,0.000009332854],"category_scores_gemma":[0.00006444497,0.000049135026,0.000020439282,0.00034563543,0.000040725816,0.00018382096,0.000065031934,0.00010582177,0.0000055198025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033442693,0.00006409326,0.0011994147,0.0000077212235,0.0000118917005,0.0000067830574,0.002645723,0.0005081799,0.0009088893,0.0021072847,0.0006741097,0.9918626],"study_design_scores_gemma":[0.0008383925,0.00026981928,0.13707078,0.000056666253,0.0000070281917,0.000014406381,0.000055649045,0.8530559,0.0011202585,0.004888128,0.0024035736,0.00021939803],"about_ca_topic_score_codex":0.00002159796,"about_ca_topic_score_gemma":0.0000018819579,"teacher_disagreement_score":0.9916432,"about_ca_system_score_codex":0.000008081041,"about_ca_system_score_gemma":0.00002369567,"threshold_uncertainty_score":0.20036682},"labels":[],"label_agreement":null},{"id":"W2072577896","doi":"10.1145/1383369.1383379","title":"The relative worst order ratio applied to seat reservation","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reservation; Order (exchange); Competitive analysis; Computer science; Online algorithm; Measure (data warehouse); Quality (philosophy); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Data mining; Computer network","score_opus":0.04390905179000232,"score_gpt":0.27495948158162753,"score_spread":0.2310504297916252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072577896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017714709,0.000011805665,0.9779905,0.018309293,0.00025786628,0.0004791648,0.000003327522,0.00019778912,0.0025730876],"genre_scores_gemma":[0.09827909,0.00027817776,0.883805,0.00264839,0.00008355641,0.00042727395,0.000008967006,0.000032659435,0.014436913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.000086528955,0.0002271256,0.00034444692,0.00043800383,0.0002828835],"domain_scores_gemma":[0.9983793,0.0003321175,0.00004301167,0.000873375,0.00023506171,0.00013711763],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002947668,0.00013159485,0.00010264103,0.00013533681,0.0013401161,0.00014634265,0.00087583606,0.000063624866,0.00004733812],"category_scores_gemma":[0.00007568448,0.000099884055,0.000048463895,0.0014035203,0.00007252896,0.0005012304,0.000024365654,0.00027842115,0.00033123998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104391904,0.00045834752,0.00003202123,0.000008931174,0.00015099072,0.000016665821,0.0116626555,0.2775945,0.0005204697,0.091855384,0.004872617,0.612723],"study_design_scores_gemma":[0.0026528684,0.00078712817,0.0044834614,0.00004749101,0.000023948123,0.000055703404,0.00047275017,0.83873314,0.0067738253,0.025196254,0.119647704,0.0011257192],"about_ca_topic_score_codex":0.000025349209,"about_ca_topic_score_gemma":0.00003310384,"teacher_disagreement_score":0.6115973,"about_ca_system_score_codex":0.000076662436,"about_ca_system_score_gemma":0.00010992792,"threshold_uncertainty_score":0.99996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015550064127749272,"score_gpt":0.2578851609787024,"score_spread":0.2423350968509531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073076713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09802427,0.0000093836115,0.8933218,0.00029359557,0.00021999322,0.00023353397,4.861388e-7,0.00029094034,0.007605962],"genre_scores_gemma":[0.75412834,0.000015263278,0.24559951,0.00020773178,0.000024510215,0.000006919143,1.0367911e-7,0.0000045640877,0.00001305752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793005,0.00009303863,0.00025222995,0.00048183074,0.0008384661,0.00040437139],"domain_scores_gemma":[0.99871457,0.00016573595,0.00005931695,0.0006478276,0.0001856798,0.00022686068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827266,0.00012037401,0.00016769517,0.0002017551,0.00030426943,0.000081553284,0.0015061012,0.000029125755,0.00003038116],"category_scores_gemma":[0.000033449465,0.00009631783,0.00005180355,0.0009972791,0.0013754932,0.00033058724,0.0006183593,0.00013564533,0.00007775616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036448453,0.00014813022,0.000041033374,0.0000072894636,0.000002893008,0.0000130495155,0.0012947777,0.011009817,0.00020600001,0.9836702,0.000026537862,0.0035766447],"study_design_scores_gemma":[0.00022674832,0.00050550554,0.00020814198,0.000019808973,0.0000010533211,0.000038240818,0.0000042224437,0.98015183,0.011371754,0.0071354094,0.00020200775,0.00013527628],"about_ca_topic_score_codex":0.0000012563326,"about_ca_topic_score_gemma":3.8880277e-8,"teacher_disagreement_score":0.9765348,"about_ca_system_score_codex":0.000046830213,"about_ca_system_score_gemma":0.00012690102,"threshold_uncertainty_score":0.5068062},"labels":[],"label_agreement":null},{"id":"W2073089651","doi":"10.1111/j.1475-3995.2006.00558.x","title":"On‐orbit servicing: a time‐dependent, moving‐target traveling salesman problem","year":2006,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"","keywords":"Spacecraft; Spare part; Travelling salesman problem; Consumables; Computer science; Orbit (dynamics); Real-time computing; Aerospace engineering; Simulation; Operations management; Algorithm; Engineering; Business","score_opus":0.041835978915175695,"score_gpt":0.347755440408976,"score_spread":0.3059194614938003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073089651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030094907,0.000024328405,0.88796383,0.013730076,0.0002812452,0.0005757638,0.000038382586,0.00013238426,0.09424452],"genre_scores_gemma":[0.89419705,0.00003087235,0.07533669,0.0004172413,0.0001586477,0.00026128485,0.000110671346,0.00002922114,0.029458355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616843,0.0003075418,0.00051343214,0.0006070728,0.0019202807,0.00048322757],"domain_scores_gemma":[0.99811554,0.0005487468,0.000042349056,0.0003227057,0.00086339586,0.00010727904],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018350539,0.00017152913,0.00014753747,0.0008553377,0.0004477177,0.00065430405,0.0012113819,0.00011023093,0.0019828107],"category_scores_gemma":[0.000067797424,0.00017519077,0.00007554026,0.0009376337,0.000089751586,0.0009798437,0.00006137611,0.0007625936,0.0006416781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035014025,0.0005464057,0.00021005249,0.000009281597,0.000025587742,0.00002854966,0.00028877563,0.7517424,0.0013388792,0.24251248,0.00090577244,0.0023567763],"study_design_scores_gemma":[0.0009777742,0.00009509707,0.0007077206,0.00007554587,0.0000011257005,0.00004019779,0.00003590041,0.948558,0.0014119787,0.043139827,0.004723348,0.00023353005],"about_ca_topic_score_codex":0.00046561612,"about_ca_topic_score_gemma":0.00028071893,"teacher_disagreement_score":0.89118755,"about_ca_system_score_codex":0.0004329695,"about_ca_system_score_gemma":0.0004479348,"threshold_uncertainty_score":0.9989295},"labels":[],"label_agreement":null},{"id":"W2074771880","doi":"10.1016/j.tcs.2008.08.025","title":"Monotonicity in digraph search problems","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Monotonic function; Mathematics; Combinatorics; Computer science; Discrete mathematics","score_opus":0.023210485426576315,"score_gpt":0.2634368297401455,"score_spread":0.24022634431356918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074771880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07559487,0.000020214005,0.9169735,0.0012583262,0.00015530616,0.0002933953,4.266134e-7,0.00018588851,0.00551811],"genre_scores_gemma":[0.85763735,0.000034129745,0.14188439,0.0003837203,0.000024477516,0.000011460152,3.6822544e-7,0.0000053234457,0.000018766623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700475,0.00016920794,0.00030087415,0.0008023429,0.0009361948,0.00078662473],"domain_scores_gemma":[0.99845916,0.00014871682,0.000031468087,0.0008312575,0.00020055861,0.0003288118],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019767866,0.00015171824,0.00019121484,0.00043440238,0.0004431572,0.0002579154,0.0026860426,0.000050230232,0.000040080162],"category_scores_gemma":[0.000058628506,0.00012675517,0.00005213844,0.0029205743,0.002996806,0.0009766101,0.0011346514,0.00032437153,0.00009841879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029285322,0.000106646876,0.0013656111,0.000005202786,0.0000011268943,0.000027250675,0.0014053205,0.010087682,0.00018049085,0.980511,0.000022655951,0.006284083],"study_design_scores_gemma":[0.00029807707,0.00013915056,0.006245607,0.000018833947,3.3501777e-7,0.000054750795,0.0000031343482,0.95182246,0.0012514399,0.03990779,0.00007348329,0.00018491174],"about_ca_topic_score_codex":0.000017927665,"about_ca_topic_score_gemma":0.0000022058045,"teacher_disagreement_score":0.9417348,"about_ca_system_score_codex":0.00007164761,"about_ca_system_score_gemma":0.0002679432,"threshold_uncertainty_score":0.99971646},"labels":[],"label_agreement":null},{"id":"W2076965738","doi":"10.1007/s10878-007-9042-z","title":"Monotonicity of strong searching on digraphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Monotonic function; Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.015271290622068032,"score_gpt":0.2832409714051561,"score_spread":0.267969680783088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076965738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058092494,0.0000276286,0.98888755,0.00022274227,0.0015148388,0.00013090041,5.223363e-7,0.000020753636,0.0033858358],"genre_scores_gemma":[0.8092666,0.000054203167,0.19048779,0.000040295214,0.00012468945,4.527737e-7,0.0000010815661,0.000008657275,0.000016188895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.00012611209,0.00063811423,0.00012052792,0.00072109496,0.00021109227],"domain_scores_gemma":[0.99814224,0.00022913294,0.0005962446,0.00021238587,0.00067877653,0.00014124179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935529,0.00009918689,0.00022503566,0.00044112524,0.00008647009,0.000088037894,0.00055266125,0.00007162761,0.000013471043],"category_scores_gemma":[0.00024490195,0.00008751806,0.00011363517,0.00060279144,0.000037030193,0.0007255424,0.000071383845,0.0002763564,0.0000012323834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009913997,0.00020843587,0.00032047663,0.000009051159,0.0000230954,0.000006713098,0.00033479172,0.77122706,0.0001459402,0.224834,0.00008262708,0.0027086916],"study_design_scores_gemma":[0.003991438,0.002040171,0.0009499192,0.00015942704,0.000017554694,0.000023583312,0.00008677304,0.9664499,0.010286319,0.0151968915,0.000535287,0.00026270296],"about_ca_topic_score_codex":0.000004838543,"about_ca_topic_score_gemma":2.2788322e-7,"teacher_disagreement_score":0.8034574,"about_ca_system_score_codex":0.000072945324,"about_ca_system_score_gemma":0.00014249473,"threshold_uncertainty_score":0.3568883},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012430973757408781,"score_gpt":0.2426073737867117,"score_spread":0.23017640002930292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078130991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360677,0.000040237046,0.86330265,0.000050608836,0.00006506829,0.00014277862,0.00001007705,0.00015053246,0.00017033615],"genre_scores_gemma":[0.9597098,0.0000051013167,0.040157344,0.0000506321,0.00002587805,0.0000061505025,0.00003171774,0.000007462374,0.000005916609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.00008062833,0.0002877124,0.00030581097,0.00034812896,0.00035672018],"domain_scores_gemma":[0.9988963,0.00021165817,0.00020147262,0.00036908148,0.00022011365,0.00010136559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043592913,0.00012977955,0.00020675694,0.00019835122,0.00015538732,0.00014053028,0.00071505946,0.000042694646,0.000009520794],"category_scores_gemma":[0.0000530751,0.00010777078,0.000044960012,0.0012949554,0.000040054136,0.00026009206,0.00018550502,0.00012563962,0.0000067406922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033626209,0.0000981594,0.023720413,0.00007525365,0.000023097475,0.0000069190705,0.00041173087,0.8573546,0.00029616768,0.005674541,0.00005605021,0.11227969],"study_design_scores_gemma":[0.0003662229,0.00029351935,0.004105759,0.00009492207,0.0000044710837,0.000016551452,0.00006716981,0.99168867,0.0028832168,0.00012272657,0.00017199086,0.00018476292],"about_ca_topic_score_codex":0.000044014716,"about_ca_topic_score_gemma":0.0000031402897,"teacher_disagreement_score":0.8236421,"about_ca_system_score_codex":0.000034182194,"about_ca_system_score_gemma":0.000048105983,"threshold_uncertainty_score":0.4394765},"labels":[],"label_agreement":null},{"id":"W2078479354","doi":"10.1007/s00446-013-0196-x","title":"Leader election for anonymous asynchronous agents in arbitrary networks","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Université du Québec en Outaouais","keywords":"Leader election; Asynchronous communication; Computer science; Adversarial system; Adversary; Graph; Theoretical computer science; Computer network; Distributed computing; Computer security; Artificial intelligence","score_opus":0.02571712385047296,"score_gpt":0.27218891363136144,"score_spread":0.2464717897808885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078479354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014964041,0.00005521298,0.9831005,0.0005573628,0.00024091825,0.0005714511,0.0000029818364,0.00022160696,0.00028596752],"genre_scores_gemma":[0.9633964,0.0000049798787,0.035872456,0.00044126666,0.000086645945,0.00004019554,0.00012677175,0.000010923158,0.000020383173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986342,0.000072303075,0.00029321044,0.0003496537,0.00014080919,0.0005097983],"domain_scores_gemma":[0.999327,0.00011578469,0.00008743888,0.00024264942,0.00013305372,0.000094056355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473144,0.00013003805,0.00015125834,0.00010130453,0.00017532033,0.00029397933,0.00045230566,0.00008507768,0.00002091949],"category_scores_gemma":[0.000040266797,0.00013495503,0.00005556806,0.0006371299,0.000020532678,0.0003658398,0.00010015002,0.00019982575,0.00002622066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055593046,0.00019208725,0.0064295153,0.000030971547,0.00002305493,0.0000067703218,0.00034854736,0.89161485,0.00010892744,0.0065487768,0.006307293,0.088383615],"study_design_scores_gemma":[0.00046729608,0.000058511392,0.009239513,0.000022803268,0.0000013168319,0.000005521842,0.00002303132,0.9886977,0.00010460728,0.0008509746,0.00037683704,0.00015187262],"about_ca_topic_score_codex":0.00006558423,"about_ca_topic_score_gemma":0.000004486258,"teacher_disagreement_score":0.9484323,"about_ca_system_score_codex":0.00010292724,"about_ca_system_score_gemma":0.000052071624,"threshold_uncertainty_score":0.55033064},"labels":[],"label_agreement":null},{"id":"W2078597682","doi":"10.1109/robio.2012.6491290","title":"Multi-robot repeated boundary coverage under uncertainty","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Boundary (topology); Robot; Event (particle physics); Computer science; Heuristic; Travelling salesman problem; Artificial intelligence; Path (computing); Mobile robot; Mathematical optimization; Algorithm; Mathematics","score_opus":0.045193919496528165,"score_gpt":0.29688644021853877,"score_spread":0.2516925207220106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078597682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011734862,0.00007704457,0.9833258,0.0010989063,0.00030298598,0.00013662712,8.6136066e-7,0.0003167903,0.013567517],"genre_scores_gemma":[0.7978194,0.000032820833,0.18698768,0.003033259,0.000046590612,0.000009903644,0.000009815049,0.00000950407,0.012051044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.000083903826,0.00015477857,0.00020074207,0.00021313108,0.00037250097],"domain_scores_gemma":[0.9992255,0.000060557086,0.000034318302,0.00040661226,0.00007952602,0.00019348286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034747442,0.000093535215,0.00008965327,0.000061879444,0.00015396129,0.00019549242,0.00038295373,0.000048778395,0.00037523097],"category_scores_gemma":[0.000041354728,0.000075362455,0.00003988906,0.00029360768,0.000039093735,0.0007943626,0.00019747388,0.000107737214,0.00032352144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030619478,0.0018790541,0.017771184,0.000060142225,0.00016481728,0.000022220063,0.005744946,0.46904525,0.007725176,0.39472398,0.037649445,0.06518317],"study_design_scores_gemma":[0.0009845853,0.00005135112,0.011702299,0.000009388069,0.0000030042193,0.000017026792,0.000050284612,0.9434508,0.00054733455,0.00091007666,0.041941203,0.0003326238],"about_ca_topic_score_codex":0.00006727945,"about_ca_topic_score_gemma":0.000013358386,"teacher_disagreement_score":0.7966459,"about_ca_system_score_codex":0.000052557472,"about_ca_system_score_gemma":0.00007035206,"threshold_uncertainty_score":0.41583216},"labels":[],"label_agreement":null},{"id":"W2078850190","doi":"10.1145/1132516.1132609","title":"Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Simple (philosophy); Computer science; Mathematical optimization; Tree (set theory); Mathematics; Combinatorics","score_opus":0.04752247368256846,"score_gpt":0.30300298513530827,"score_spread":0.2554805114527398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078850190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041030813,0.000020520863,0.9934812,0.0005027706,0.000047388665,0.0004373869,0.000004569284,0.00014138552,0.0012616488],"genre_scores_gemma":[0.8442139,0.0000031917684,0.150355,0.00024013063,0.00006172793,0.00007822987,0.000019885378,0.000011300703,0.005016612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991201,0.000013585893,0.00016378022,0.00029298323,0.00013578282,0.0002737272],"domain_scores_gemma":[0.99940497,0.00013553978,0.000035034223,0.0002643327,0.00008052236,0.00007959193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900839,0.00009315586,0.000109474975,0.00006302632,0.0001644541,0.00024084107,0.0003129023,0.00003371568,0.000044991284],"category_scores_gemma":[0.000056809542,0.000070679416,0.0000265694,0.00013330836,0.000032248197,0.00034284775,0.00026676446,0.000055042314,0.000007437594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010699285,0.00064412603,0.0076028253,0.00019358071,0.000056651737,0.000008615628,0.00054936536,0.07927346,0.0021913357,0.6969586,0.028886879,0.18352753],"study_design_scores_gemma":[0.0008544845,0.000052136624,0.0007997509,0.000007168522,0.0000023934558,0.000001938596,0.000012324239,0.99038213,0.000250125,0.0028235347,0.0046950066,0.00011902712],"about_ca_topic_score_codex":0.00008761004,"about_ca_topic_score_gemma":0.0002325392,"teacher_disagreement_score":0.9111087,"about_ca_system_score_codex":0.000019045761,"about_ca_system_score_gemma":0.000024713674,"threshold_uncertainty_score":0.28822228},"labels":[],"label_agreement":null},{"id":"W2078856178","doi":"10.1007/s10878-008-9156-y","title":"The canadian traveller problem and its competitive analysis","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Theory of computation; Vertex (graph theory); Computer science; Competitive analysis; Adaptive strategies; Graph; Grid; Mathematical optimization; Shortest path problem; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Upper and lower bounds; Artificial intelligence; Geography","score_opus":0.014219725251747941,"score_gpt":0.2319537224110097,"score_spread":0.21773399715926176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078856178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013504444,0.0008027229,0.9654975,0.008935316,0.0024678994,0.00053821877,0.0000035973203,0.000044496217,0.02035982],"genre_scores_gemma":[0.9248303,0.0012640712,0.07331842,0.00014560501,0.00013716314,0.000003449101,0.0000032868172,0.000009351854,0.00028834183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987197,0.0001651579,0.0003811427,0.00011682179,0.00042021464,0.00019694485],"domain_scores_gemma":[0.99821705,0.00012211232,0.00028777754,0.00012821292,0.0009952759,0.00024954684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065411243,0.0000913264,0.00018980564,0.00034539853,0.00072257593,0.00024350715,0.0004075766,0.00006601939,0.000016386106],"category_scores_gemma":[0.000107617845,0.000065651,0.000082969396,0.0010232853,0.00005818233,0.0005610033,0.000042813033,0.00018621385,0.0000022597542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016147764,0.00003796671,0.00031683396,0.000002646632,0.00019129731,0.000019484545,0.0009697797,0.4659965,0.000004585108,0.5316869,0.00044856375,0.00030931685],"study_design_scores_gemma":[0.0012947308,0.00025930456,0.0010580932,0.000013287982,0.00007276633,0.000090400456,0.000046407265,0.98535836,0.00007697709,0.003910818,0.0076491567,0.00016968424],"about_ca_topic_score_codex":0.00031009142,"about_ca_topic_score_gemma":0.0006136157,"teacher_disagreement_score":0.92347986,"about_ca_system_score_codex":0.000103534054,"about_ca_system_score_gemma":0.0005212546,"threshold_uncertainty_score":0.5557543},"labels":[],"label_agreement":null},{"id":"W2080610036","doi":"10.1007/s10479-008-0337-y","title":"Efficient solution approaches for a discrete multi-facility competitive interaction model","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.5969619837764057,"score_gpt":0.47512096968329526,"score_spread":0.12184101409311049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080610036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018500539,0.00004228961,0.9757621,0.0037822463,0.00003248258,0.0007892613,0.00005530624,0.00003639263,0.0009993826],"genre_scores_gemma":[0.8817366,0.00006078245,0.11709501,0.00004468314,0.000012374067,0.00021029772,0.000043950513,0.0000043928753,0.0007919575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983284,0.00025864,0.00027009792,0.0003300263,0.00048448762,0.00032835943],"domain_scores_gemma":[0.9978892,0.00013286616,0.000024473375,0.00036239857,0.0014890924,0.00010194555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125868,0.00008135835,0.00012686066,0.0002761139,0.0007082225,0.00009876609,0.00040050203,0.00004961136,0.000011575588],"category_scores_gemma":[0.0003671561,0.00007358801,0.00007665064,0.0004857657,0.00022538612,0.00037509282,0.0001934257,0.00019707248,0.00002329158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021439795,0.0002917554,0.000018753597,0.000017676835,0.000011643512,3.796694e-7,0.002359781,0.9434327,0.00073311257,0.05125589,0.00040983257,0.0014470181],"study_design_scores_gemma":[0.00026950106,0.00012621505,0.00018972604,0.000012182749,6.086251e-7,0.0000025145425,0.00017729063,0.9961651,0.0026199196,0.0001409526,0.00022186358,0.00007415681],"about_ca_topic_score_codex":0.00007502993,"about_ca_topic_score_gemma":0.000049665254,"teacher_disagreement_score":0.863236,"about_ca_system_score_codex":0.000034683104,"about_ca_system_score_gemma":0.0002684955,"threshold_uncertainty_score":0.5447146},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01071225163422513,"score_gpt":0.2594873612681509,"score_spread":0.2487751096339258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080745503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016809197,0.000014964098,0.97947294,0.00043984776,0.0005698132,0.00014905533,0.0000016322673,0.000112325826,0.0024302574],"genre_scores_gemma":[0.67629135,0.000004046058,0.32347828,0.00019355024,0.000015365678,0.0000010491914,9.999135e-7,0.0000031874195,0.0000121540415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796975,0.00006497555,0.0003187314,0.0004548858,0.00071646133,0.00047522353],"domain_scores_gemma":[0.99866325,0.000208043,0.00008581177,0.00049577863,0.00027474924,0.00027235268],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001867603,0.00011625553,0.0001457769,0.00022428636,0.00022884824,0.00015024868,0.0015296012,0.000046384655,0.000056697256],"category_scores_gemma":[0.00006344343,0.00009899014,0.00005019026,0.0010710801,0.002948696,0.0005235983,0.00053009205,0.00013099663,0.00003666134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005120755,0.000056279277,0.00033928323,0.00000633767,0.0000023548785,0.000002005952,0.00019023549,0.00015255851,0.0012645109,0.96794814,0.0001964916,0.029836703],"study_design_scores_gemma":[0.00044884614,0.00020554209,0.00073166477,0.000022318622,0.0000021425851,0.000018389199,0.000010297009,0.8393288,0.0284041,0.12962288,0.0009966564,0.00020832343],"about_ca_topic_score_codex":0.000003911548,"about_ca_topic_score_gemma":5.743824e-7,"teacher_disagreement_score":0.8391763,"about_ca_system_score_codex":0.000031569827,"about_ca_system_score_gemma":0.000067234796,"threshold_uncertainty_score":0.9997647},"labels":[],"label_agreement":null},{"id":"W2081055073","doi":"","title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","year":2011,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Exponential function; Exponential growth; Tree (set theory); Parallel computing; Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.21363344366847736,"score_gpt":0.20982607274773118,"score_spread":0.003807370920746178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081055073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2866283,0.000006638858,0.70599496,0.000028338249,0.0001331168,0.00020988513,0.000002060916,0.00010877506,0.0068878895],"genre_scores_gemma":[0.98846287,0.000012387713,0.0102998,0.00007656768,0.000019113662,0.0000014323633,0.0000037873808,0.000007686512,0.0011163371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00009046616,0.00011276172,0.00043389702,0.000051704268,0.00027074854],"domain_scores_gemma":[0.9992886,0.00003389264,0.000053636424,0.00041412737,0.00007545169,0.00013430111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022897162,0.00009962339,0.00010738922,0.00022231825,0.00009716446,0.000036727368,0.00075956015,0.00007212258,0.00005744223],"category_scores_gemma":[0.000017304792,0.00011301379,0.000050983665,0.0004865106,0.00004835334,0.0009349592,0.00015125985,0.00010000993,0.00002486936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023133426,0.0009153607,0.0065833926,0.000027355165,0.000044465633,0.0003474876,0.008185133,0.073675826,0.00091850886,0.9014532,0.00057978457,0.0070381495],"study_design_scores_gemma":[0.001714868,0.00034746662,0.0036087024,0.00001352483,0.000009545305,0.0000050343515,0.00041836695,0.9689822,0.0011089756,0.02314942,0.00030856734,0.000333334],"about_ca_topic_score_codex":0.00016041243,"about_ca_topic_score_gemma":0.0003338022,"teacher_disagreement_score":0.89530635,"about_ca_system_score_codex":0.00004927855,"about_ca_system_score_gemma":0.0000662077,"threshold_uncertainty_score":0.46085688},"labels":[],"label_agreement":null},{"id":"W2081264158","doi":"10.2316/journal.206.2010.4.206-3325","title":"REACHABLE GRASPS ON A POLYGON OF A ROBOT ARM: FINDING CONVEX ROPES WITHOUT TRIANGULATION","year":2010,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Simple polygon; Vertex (graph theory); Polygon (computer graphics); Convex hull; Convex polygon; Polygon covering; Combinatorics; Mathematics; Robot; Minimum-weight triangulation; Computer science; Artificial intelligence; Delaunay triangulation; Geometry; Constrained Delaunay triangulation","score_opus":0.020892876619404244,"score_gpt":0.2969573623987184,"score_spread":0.27606448577931414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081264158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118154235,0.000021742457,0.8763492,0.0037638678,0.0010412979,0.00010571612,0.000001987636,0.00002569186,0.0005362671],"genre_scores_gemma":[0.8985166,0.00003352696,0.101169504,0.00008320508,0.00010271517,7.968832e-7,0.0000040766977,0.000005157525,0.000084432555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884117,0.000045781417,0.00042702918,0.00010243073,0.00049553945,0.00008802796],"domain_scores_gemma":[0.99866074,0.000106693195,0.0005303363,0.000102219674,0.00053724844,0.00006277444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544747,0.00007777922,0.00014709432,0.00034400157,0.000048707538,0.00016007178,0.00033544927,0.000053204025,0.000018907827],"category_scores_gemma":[0.00022233672,0.00006538662,0.000052695945,0.00012690695,0.000033886274,0.0005684965,0.00005069902,0.00017947267,0.0000027087353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014600065,0.0005601953,0.0062111686,0.00003526152,0.00021556832,0.000022877275,0.0022435235,0.44968158,0.078019574,0.3539675,0.00036407725,0.10853268],"study_design_scores_gemma":[0.0011707804,0.00027897145,0.009750361,0.0001557442,0.000010273387,0.00009372145,0.0000273256,0.973694,0.008288609,0.0062257736,0.00020076497,0.00010362454],"about_ca_topic_score_codex":0.000009155118,"about_ca_topic_score_gemma":0.000004369291,"teacher_disagreement_score":0.78036237,"about_ca_system_score_codex":0.000024614867,"about_ca_system_score_gemma":0.00006976473,"threshold_uncertainty_score":0.2666389},"labels":[],"label_agreement":null},{"id":"W2082940000","doi":"10.1145/1989493.1989513","title":"Brief announcement","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Cache; Competitive analysis; CPU cache; Cache algorithms; Parallel computing; Multi-core processor; Metric (unit); Time complexity; Online algorithm; Upper and lower bounds; Operating system; Algorithm; Mathematics","score_opus":0.0693261546613576,"score_gpt":0.24316357650580536,"score_spread":0.17383742184444778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082940000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044938184,0.0000040191267,0.6633022,0.00023566971,0.00004898355,0.000032365195,6.586535e-8,0.0000821193,0.33624965],"genre_scores_gemma":[0.2013026,0.000017815635,0.77949864,0.002747012,0.000015681866,0.000010496427,9.621617e-7,0.0000033570948,0.016403424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996452,0.000011068519,0.00005478745,0.000098264965,0.00009463176,0.00009608661],"domain_scores_gemma":[0.99971956,0.0000034943434,0.000008998411,0.00018545706,0.000037294074,0.00004519681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009399497,0.000026686941,0.000024910663,0.000023430002,0.000030653468,0.000034774836,0.00028204295,0.000009215449,0.00063309213],"category_scores_gemma":[0.0000037263335,0.000021052505,0.000010578489,0.00011052023,0.000009723598,0.00021418682,0.00008942934,0.000021126818,0.00021195214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.751642e-7,0.000045041692,0.0003061132,0.0000011908417,0.0000026905395,0.0000023757655,0.0008651744,0.000020487547,0.000044066157,0.9772123,0.0072086165,0.014291349],"study_design_scores_gemma":[0.0010889353,0.0004864728,0.007983307,0.000011645444,0.0000022765014,0.000016292095,0.00010292755,0.49599636,0.008418652,0.048526376,0.43682256,0.0005442082],"about_ca_topic_score_codex":0.000027671638,"about_ca_topic_score_gemma":0.000002769009,"teacher_disagreement_score":0.92868596,"about_ca_system_score_codex":0.0000054851816,"about_ca_system_score_gemma":0.000017513545,"threshold_uncertainty_score":0.69319147},"labels":[],"label_agreement":null},{"id":"W2084046657","doi":"10.1016/j.disopt.2012.01.001","title":"Emergency path restoration problems","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Scheduling (production processes); Computer science; Path (computing); Time complexity; Node (physics); Computer network; Distributed computing; Mathematical optimization; Mathematics; Algorithm; Engineering","score_opus":0.024719906679499283,"score_gpt":0.27085628613100643,"score_spread":0.24613637945150715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084046657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015969684,0.00022445046,0.98644334,0.0006331061,0.0005907208,0.0003215567,0.0000022778645,0.00026940877,0.011355455],"genre_scores_gemma":[0.41316062,0.0006472453,0.5833369,0.00021254571,0.00025747225,0.0001153531,0.0002190646,0.00003685572,0.0020139525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986262,0.00012638443,0.00029705817,0.00024547373,0.00033226653,0.0003726293],"domain_scores_gemma":[0.99911106,0.000013119586,0.00013014281,0.0004044706,0.00016477091,0.00017646584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004384249,0.00013510272,0.000102211,0.00012366204,0.00020163815,0.00012271572,0.0003541439,0.00007312315,0.00025791215],"category_scores_gemma":[0.00006793436,0.00012537107,0.00004775721,0.0006464201,0.000018380175,0.0025496327,0.00011275467,0.000093105984,0.00009888375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002932874,0.00008609896,0.0029206316,0.00002203896,0.000009745966,3.3624312e-7,0.0016889881,0.91582215,0.00013750551,0.074061215,0.003189594,0.0020587516],"study_design_scores_gemma":[0.00018918501,0.000041442225,0.0005430616,0.000011345195,0.0000041347225,0.0000026148111,0.000027442726,0.9946676,0.00008001074,0.00042434732,0.0038081799,0.00020061954],"about_ca_topic_score_codex":0.000009646862,"about_ca_topic_score_gemma":0.0000015899009,"teacher_disagreement_score":0.41300094,"about_ca_system_score_codex":0.00004621119,"about_ca_system_score_gemma":0.000033122113,"threshold_uncertainty_score":0.5112484},"labels":[],"label_agreement":null},{"id":"W2085216434","doi":"10.1016/s0304-3975(00)00144-4","title":"The ultimate strategy to search on m rays?","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Upper and lower bounds; Mathematics; Combinatorics; Algorithm; Computer science; Mathematical analysis","score_opus":0.02509891212686544,"score_gpt":0.30945091024063853,"score_spread":0.2843519981137731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085216434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006260154,0.0000073256274,0.963291,0.013379597,0.00032141528,0.0002712617,4.5511868e-7,0.00018437652,0.016284425],"genre_scores_gemma":[0.92931026,0.00002413489,0.06626538,0.004201418,0.000059715152,0.000010950063,2.5011065e-7,0.0000069291964,0.00012097107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970982,0.00016928179,0.0002110426,0.00062394066,0.0010732375,0.0008242729],"domain_scores_gemma":[0.99786276,0.00040301407,0.000023130991,0.00096520095,0.00027053,0.00047537824],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026047896,0.00014140195,0.000111731766,0.00015539285,0.0011046054,0.0015034955,0.0035998244,0.000026116148,0.000044547454],"category_scores_gemma":[0.00009602021,0.000087177985,0.000040401923,0.0018672507,0.0014558717,0.0004109303,0.00096492545,0.00023514303,0.00070242904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010319283,0.000030282843,0.000008934234,6.818801e-7,0.0000011846618,0.000008619133,0.00018458888,0.014820109,0.000100989586,0.87358654,0.00033260696,0.11091516],"study_design_scores_gemma":[0.00014816747,0.0005666081,0.00031103846,0.00001337596,4.5908195e-7,0.000021492218,0.000006815375,0.9557635,0.0010791067,0.03895973,0.0029770755,0.00015260703],"about_ca_topic_score_codex":0.000002842444,"about_ca_topic_score_gemma":6.293136e-7,"teacher_disagreement_score":0.9409434,"about_ca_system_score_codex":0.000056418405,"about_ca_system_score_gemma":0.0001391997,"threshold_uncertainty_score":0.99953306},"labels":[],"label_agreement":null},{"id":"W2085532579","doi":"10.1109/hpcs.2010.5547101","title":"Hardware acceleration of Scatter Search","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Software; High-level programming language; Implementation; Gate array; Heuristic; Parallel computing; Computer engineering; Computer architecture; Parallelism (grammar); Programming language; Computer hardware; Programming paradigm; Artificial intelligence","score_opus":0.02614716184700726,"score_gpt":0.2827352670658159,"score_spread":0.25658810521880865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085532579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018824572,0.0000015520085,0.9461012,0.0032244204,0.00014611427,0.000100683166,4.5100666e-7,0.00006904097,0.031532004],"genre_scores_gemma":[0.8478204,0.000001933776,0.14914794,0.00032708945,0.000020796246,0.0000031689547,0.0000018479654,0.0000023526156,0.002674461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995226,0.000018073242,0.00008826218,0.000109465574,0.00016794004,0.00009365495],"domain_scores_gemma":[0.99953145,0.000018083996,0.000013705355,0.00024998732,0.00014356743,0.00004319254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018501678,0.000031260515,0.000041365263,0.00005895737,0.000036927133,0.00008023297,0.0003436029,0.000026277705,0.000641708],"category_scores_gemma":[0.000012428992,0.000025113322,0.000017144906,0.00016369951,0.000022171573,0.00035115794,0.00009952257,0.00009337515,0.000093841314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038197218,0.00016772935,0.008268387,0.000036194204,0.000012725744,0.000001955636,0.0017591126,0.0018128849,0.17195283,0.6963757,0.013608216,0.1060004],"study_design_scores_gemma":[0.00045353186,0.00008338092,0.011026332,0.0000064979668,0.0000010561695,0.0000061709816,0.000029481385,0.77411604,0.20202464,0.001817456,0.010256005,0.00017942315],"about_ca_topic_score_codex":0.000016459171,"about_ca_topic_score_gemma":0.000016384634,"teacher_disagreement_score":0.8289958,"about_ca_system_score_codex":0.0000024173094,"about_ca_system_score_gemma":0.00003913077,"threshold_uncertainty_score":0.7026252},"labels":[],"label_agreement":null},{"id":"W2086312880","doi":"10.1016/j.tcs.2014.03.028","title":"Multi-target ray searching problems","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Multiplicative function; Context (archaeology); Mathematics; Mathematical optimization; Metric (unit); Measure (data warehouse); Disjoint sets; Linear search; Asymptotically optimal algorithm; Competitive analysis; Beam search; Computer science; Algorithm; Search algorithm; Discrete mathematics; Upper and lower bounds; Data mining","score_opus":0.017390947517490634,"score_gpt":0.26955533553006034,"score_spread":0.2521643880125697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086312880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010235971,0.000010468328,0.9912401,0.0019520343,0.00040035223,0.00024340604,4.788731e-7,0.00038828354,0.0047412934],"genre_scores_gemma":[0.49721348,0.0000020695297,0.50206476,0.0006229805,0.000054737528,0.0000061673936,4.9045957e-7,0.0000060250095,0.000029274748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671763,0.00031308108,0.00028946516,0.000896132,0.00094553217,0.0008381798],"domain_scores_gemma":[0.9978909,0.00026229816,0.000058415495,0.0010321253,0.00026362442,0.0004926635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044064433,0.00018289567,0.00019928743,0.00025524077,0.00065166125,0.000949925,0.003307925,0.000048005848,0.00006554386],"category_scores_gemma":[0.00025320452,0.00014522551,0.000062414365,0.0012986897,0.0019379207,0.000995146,0.0014954488,0.00030852805,0.00025614008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013379506,0.00006812483,0.00006565531,0.000009567195,0.000002009459,0.0000018177593,0.00063558394,0.019697644,0.00091581617,0.9522068,0.000038829377,0.026356844],"study_design_scores_gemma":[0.00029500196,0.00014680794,0.0003605627,0.000022868791,7.955686e-7,0.000009688258,0.0000019424306,0.93329567,0.0009886298,0.06381169,0.00086440507,0.00020195622],"about_ca_topic_score_codex":0.0000032025623,"about_ca_topic_score_gemma":3.550445e-7,"teacher_disagreement_score":0.913598,"about_ca_system_score_codex":0.00004584235,"about_ca_system_score_gemma":0.0001303278,"threshold_uncertainty_score":0.91601485},"labels":[],"label_agreement":null},{"id":"W2086702855","doi":"10.1145/1978782.1978789","title":"Randomized rendezvous with limited memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Corollary; Computer science; Node (physics); State (computer science); Ring (chemistry); Discrete mathematics; Mathematics; Combinatorics; Algorithm; Physics","score_opus":0.04869198837809187,"score_gpt":0.25294687808002886,"score_spread":0.204254889701937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086702855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017406131,0.000026377023,0.9885726,0.0008832695,0.00023921099,0.00045010867,0.0000032868843,0.0004403355,0.00921075],"genre_scores_gemma":[0.11604435,0.00013892332,0.8796575,0.00073419843,0.000023965857,0.00019944429,0.0000031165787,0.000027787206,0.003170728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985074,0.00019998528,0.0002496109,0.00039280526,0.00035202535,0.0002982223],"domain_scores_gemma":[0.99844164,0.00020056489,0.0000682842,0.000979711,0.00014260555,0.00016717653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042006042,0.00017671345,0.00027826117,0.00024781804,0.00021800224,0.00008525153,0.0008801475,0.00007344406,0.0003555002],"category_scores_gemma":[0.000034256394,0.00013179264,0.00011778335,0.0006246612,0.0001373829,0.0004516283,0.000013587571,0.00025566143,0.00014785702],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010205487,0.0014317053,0.000004170239,0.0000287513,0.00050066534,0.000121757614,0.010677647,0.01045199,0.00006342117,0.009797874,0.0002414575,0.9564751],"study_design_scores_gemma":[0.27864823,0.0015992305,0.00021104033,0.00012966176,0.0001649783,0.00026482035,0.00045781492,0.6874491,0.0129756555,0.014475479,0.0020936334,0.0015303562],"about_ca_topic_score_codex":0.00008365669,"about_ca_topic_score_gemma":0.000014303956,"teacher_disagreement_score":0.95494473,"about_ca_system_score_codex":0.000029948547,"about_ca_system_score_gemma":0.00007454791,"threshold_uncertainty_score":0.53743476},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020587912109694226,"score_gpt":0.2554402453622562,"score_spread":0.23485233325256194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087097376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011599203,0.00013933206,0.90985906,0.00091012573,0.00013208909,0.00026600403,0.000003846873,0.00018044202,0.07690991],"genre_scores_gemma":[0.9057087,0.00003971075,0.07356982,0.0011533678,0.000011213606,0.0000125650395,0.000004937072,0.0000055105197,0.019494189],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995321,0.00002634464,0.00008389755,0.00012052189,0.00014000022,0.00009713252],"domain_scores_gemma":[0.9996331,0.000007534823,0.000019977944,0.00022923622,0.000043903365,0.000066275636],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005801483,0.000038465645,0.000049496844,0.000028125267,0.000023362176,0.000037640115,0.00033664386,0.000025568075,0.0016122143],"category_scores_gemma":[0.000004302577,0.000030707517,0.000013489037,0.00015564592,0.00001636,0.00029584495,0.00006043752,0.000038604332,0.00006604643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024541778,0.0012057135,0.00052158104,0.00003486097,0.00003180915,0.000012905419,0.0093274135,0.016680213,0.0031263528,0.036366705,0.7018468,0.23084319],"study_design_scores_gemma":[0.00019464106,0.000081640246,0.00003869787,0.0000019897973,5.390201e-7,0.000002219824,0.000039563645,0.9731569,0.0022722876,0.00018720592,0.023952259,0.00007201495],"about_ca_topic_score_codex":0.000021929878,"about_ca_topic_score_gemma":0.0000027200558,"teacher_disagreement_score":0.95647675,"about_ca_system_score_codex":0.000005030418,"about_ca_system_score_gemma":0.0000040357754,"threshold_uncertainty_score":0.9993004},"labels":[],"label_agreement":null},{"id":"W2088456596","doi":"10.1016/j.orl.2014.12.008","title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Computer science; Speedup; Commodity; Parallel computing; Mathematics; Mathematical optimization; Simulation; Business; Mathematical analysis","score_opus":0.14718004806790977,"score_gpt":0.38045640621018106,"score_spread":0.2332763581422713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088456596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018410683,0.000009813156,0.8574906,0.121374145,0.0002960552,0.0012215157,0.000018933611,0.000070322596,0.0011079537],"genre_scores_gemma":[0.7341527,0.000060903894,0.22658615,0.028385486,0.0007670646,0.0011119017,0.00013368836,0.00007355413,0.008728599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971449,0.0008655532,0.00021875293,0.00045656948,0.00073815143,0.00057607185],"domain_scores_gemma":[0.9975804,0.00089644676,0.000018660654,0.0009978486,0.0003808529,0.00012575396],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002608342,0.00013699073,0.00012946186,0.00015365989,0.0018922443,0.0013618569,0.0013520274,0.000053815624,0.000073483556],"category_scores_gemma":[0.0008517723,0.00009483849,0.000074118376,0.0005961963,0.0002254182,0.00071606267,0.00024298119,0.00048240533,0.00034563174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024131004,0.00039594056,0.000023475297,0.00003323665,0.00004560646,0.0000049364676,0.006673654,0.30476066,0.016086688,0.41826752,0.24984697,0.0038371778],"study_design_scores_gemma":[0.0005347258,0.00011920851,0.000049360504,0.000014053067,0.0000010658466,0.0000012834554,0.000053052256,0.88096476,0.0010011243,0.00026591576,0.11687551,0.000119960896],"about_ca_topic_score_codex":0.00016267142,"about_ca_topic_score_gemma":0.00035902366,"teacher_disagreement_score":0.715742,"about_ca_system_score_codex":0.000120278535,"about_ca_system_score_gemma":0.00014037162,"threshold_uncertainty_score":0.9996748},"labels":[],"label_agreement":null},{"id":"W2088810319","doi":"10.1007/s10878-013-9614-z","title":"Generalized Canadian traveller problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Tsing Hua University; National Science Council","keywords":"Competitive analysis; Theory of computation; Combinatorics; Constant (computer programming); Upper and lower bounds; Bounded function; Online algorithm; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Generalization; Discrete mathematics; Mathematical optimization; Graph; Algorithm; Telecommunications","score_opus":0.013212597777398477,"score_gpt":0.2240957758642578,"score_spread":0.21088317808685933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088810319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089268846,0.0000913671,0.9860761,0.004329685,0.0036778708,0.00040427284,6.4369993e-7,0.00003913103,0.0044882516],"genre_scores_gemma":[0.29870978,0.00028996152,0.6988647,0.0008396737,0.0005510161,0.00002098797,0.000008799733,0.00003346739,0.0006815955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984717,0.00014177209,0.00053711166,0.00013525695,0.00043429103,0.00027988432],"domain_scores_gemma":[0.9978805,0.00003662764,0.00032507733,0.0002116814,0.0011358119,0.00041025708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004724387,0.00012117741,0.00021120494,0.00038879286,0.00013401256,0.00042330538,0.00063989504,0.00010340046,0.00041546018],"category_scores_gemma":[0.00010470933,0.0001040635,0.000087641885,0.00053747796,0.000024443169,0.0014787674,0.000040760264,0.0001895243,0.000040521285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050384506,0.000080213635,0.00010182985,0.000007847273,0.000031246567,0.000005805915,0.00048631296,0.9065456,0.000117901014,0.080968335,0.00962259,0.002027313],"study_design_scores_gemma":[0.0021722503,0.0002771165,0.0001506386,0.00003065359,0.000008504367,0.000040167997,0.00001751136,0.97122675,0.00020521967,0.016447175,0.00921045,0.00021354432],"about_ca_topic_score_codex":0.001844694,"about_ca_topic_score_gemma":0.0000406465,"teacher_disagreement_score":0.29781708,"about_ca_system_score_codex":0.00014149975,"about_ca_system_score_gemma":0.0005376439,"threshold_uncertainty_score":0.4548998},"labels":[],"label_agreement":null},{"id":"W2089187143","doi":"10.1145/2594581","title":"Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Normalization property; Computer network; Theoretical computer science","score_opus":0.02026235510793927,"score_gpt":0.24898517807918782,"score_spread":0.22872282297124855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089187143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051665993,0.00001577718,0.9971406,0.00094671495,0.00044408944,0.00030869714,0.0000033739627,0.0003053488,0.00031872877],"genre_scores_gemma":[0.8277739,0.00004250022,0.17064421,0.00061968854,0.00006370594,0.00012623536,0.00002043567,0.000027571541,0.0006817188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998157,0.00013739473,0.00032587253,0.000525808,0.00047561806,0.00037829095],"domain_scores_gemma":[0.99857455,0.000113383416,0.00010878678,0.00089765294,0.00010173332,0.00020389004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003231418,0.00019767231,0.00017919295,0.000097330594,0.000357267,0.00019413386,0.0004540602,0.00008299865,0.00007363873],"category_scores_gemma":[0.000016696988,0.00017298252,0.000059709975,0.0005042962,0.00007737677,0.0005441345,0.000011825356,0.00021947334,0.00005735141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009059708,0.00016694493,0.0000021976725,0.0000062494996,0.000017447874,0.000024453895,0.0002442129,0.54569256,0.0000073055494,0.000054585213,0.0008913937,0.45288357],"study_design_scores_gemma":[0.0004621021,0.0006791621,0.000043082106,0.000032462078,0.000015302128,0.00008675994,0.000036284437,0.99049073,0.00021134198,0.00055071415,0.007130246,0.00026183043],"about_ca_topic_score_codex":0.000011615674,"about_ca_topic_score_gemma":0.000021248266,"teacher_disagreement_score":0.8272573,"about_ca_system_score_codex":0.000063085354,"about_ca_system_score_gemma":0.00006598339,"threshold_uncertainty_score":0.7054022},"labels":[],"label_agreement":null},{"id":"W2089845008","doi":"10.1007/s00453-015-9982-0","title":"Anonymous Meeting in Networks","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Node (physics); Computer science; Theory of computation; Deterministic algorithm; Upper and lower bounds; Time complexity; Algorithm; Construct (python library); Existential quantification; Theoretical computer science; Mathematics; Discrete mathematics; Computer network","score_opus":0.028371181002250098,"score_gpt":0.2560131383583552,"score_spread":0.2276419573561051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089845008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000450756,0.00015139025,0.97892207,0.0011610495,0.00025236513,0.00010514041,2.0799085e-7,0.0001321176,0.018824894],"genre_scores_gemma":[0.50885165,0.000028018656,0.4887587,0.0011655291,0.00018364264,0.000023308115,0.0000050097033,0.000015283125,0.0009688363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991813,0.000068777415,0.0001399777,0.00019387288,0.00017276431,0.00024335532],"domain_scores_gemma":[0.99951345,0.000038538463,0.000028190767,0.00022730452,0.0000670942,0.00012542719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045222483,0.000061909755,0.000081387545,0.0000792361,0.000030392977,0.00009300731,0.00042464916,0.000040998464,0.0000060983693],"category_scores_gemma":[0.00005255019,0.000059119888,0.00001673051,0.00044255628,0.000017406535,0.00025539674,0.00017173465,0.00011686734,0.000051912793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009685884,0.00022567436,0.00246202,0.000008543024,0.000016516964,0.00016824098,0.0032863014,0.40233582,0.000043112916,0.046251528,0.01788076,0.5273118],"study_design_scores_gemma":[0.00029923007,0.00003036375,0.000100335914,0.000007867326,3.5070065e-7,0.000006630535,0.000022565579,0.99317247,0.000046142613,0.0014956547,0.0047366424,0.00008172021],"about_ca_topic_score_codex":0.000058622347,"about_ca_topic_score_gemma":0.000012838276,"teacher_disagreement_score":0.59083664,"about_ca_system_score_codex":0.00003659708,"about_ca_system_score_gemma":0.00006222107,"threshold_uncertainty_score":0.2410839},"labels":[],"label_agreement":null},{"id":"W2091712762","doi":"10.1002/rsa.20504","title":"Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Edge cover; Vertex (graph theory); Degree (music); Discrete mathematics; Random walk; Random regular graph; Regular graph; Upper and lower bounds; Graph; Graph power; Line graph; 1-planar graph; Physics","score_opus":0.03572688288415451,"score_gpt":0.2431883776456975,"score_spread":0.207461494761543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091712762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3544288,0.0010481097,0.63571745,0.0026725668,0.0012258199,0.002916172,0.000016340138,0.00051979313,0.001454923],"genre_scores_gemma":[0.92027223,0.0006971826,0.077203624,0.00032733774,0.00026499244,0.00023636608,0.00003923958,0.000040930445,0.0009181167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790156,0.00021040798,0.00041466558,0.0005751289,0.00038813092,0.0005101329],"domain_scores_gemma":[0.9988411,0.0002479552,0.000092487,0.00041387253,0.00017748293,0.00022711932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857959,0.00028040694,0.0004663724,0.00025011547,0.00019283721,0.00036173238,0.0005038946,0.00012392741,0.0002876191],"category_scores_gemma":[0.0001032441,0.0002148275,0.000069543894,0.0005673682,0.000060064976,0.0009748501,0.00023159942,0.0003072775,0.0000452247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008077577,0.00021549735,0.00195357,0.00021845817,0.00032850655,0.000053625816,0.010298801,0.056100994,0.0028424482,0.0038626108,0.0026310452,0.92068666],"study_design_scores_gemma":[0.035369564,0.00018096036,0.019657468,0.00009641872,0.000014657151,0.00002580943,0.00017425284,0.93239665,0.00082396116,0.009399432,0.0011216777,0.00073916186],"about_ca_topic_score_codex":0.0003011285,"about_ca_topic_score_gemma":0.000022510309,"teacher_disagreement_score":0.9199475,"about_ca_system_score_codex":0.000031025225,"about_ca_system_score_gemma":0.00005416912,"threshold_uncertainty_score":0.87604105},"labels":[],"label_agreement":null},{"id":"W2091878431","doi":"10.1177/026455050104800112","title":"Stop and Search","year":2001,"lang":"en","type":"article","venue":"Probation Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Humber College","funders":"","keywords":"Psychology; History","score_opus":0.02940339629854249,"score_gpt":0.2747926312209453,"score_spread":0.24538923492240283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091878431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009747276,0.00008949156,0.9791397,0.0066173724,0.00008927306,0.00006810384,7.669017e-8,0.00003716376,0.004211531],"genre_scores_gemma":[0.7819195,0.0012124407,0.21179928,0.00085483684,0.00020772842,0.000006177187,0.0000013196636,0.000009320075,0.003989405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993949,0.00006696968,0.0001102865,0.000089616224,0.00020807578,0.00013013127],"domain_scores_gemma":[0.9996073,0.000017642,0.00003225558,0.00007996443,0.00014679841,0.000116014664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005002987,0.00003708492,0.00003978789,0.00009712912,0.0001860646,0.0003594473,0.00017782999,0.000017824093,0.00008170857],"category_scores_gemma":[0.00002908228,0.000031144344,0.000012389953,0.00020325738,0.000017053528,0.00061378017,0.00005480378,0.00013708865,0.000028507555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013728418,0.000101843565,0.014375776,0.00001432797,0.00002086298,0.000050748065,0.005041951,0.010630286,0.0007786143,0.18410225,0.0032386307,0.781631],"study_design_scores_gemma":[0.0012155138,0.00023852591,0.014486128,0.00003371948,0.0000028271033,0.0019012707,0.00012875632,0.9065064,0.0002948619,0.032078892,0.042879533,0.00023355782],"about_ca_topic_score_codex":9.579965e-7,"about_ca_topic_score_gemma":4.880982e-7,"teacher_disagreement_score":0.8958761,"about_ca_system_score_codex":0.000017618759,"about_ca_system_score_gemma":0.000054987366,"threshold_uncertainty_score":0.34661585},"labels":[],"label_agreement":null},{"id":"W2091969952","doi":"10.1142/s0129054111008295","title":"UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Grid; Asynchronous communication; Occupancy grid mapping; Mobile robot; Constructive proof; Distributed computing; Artificial intelligence; Mathematics; Computer network; Geometry","score_opus":0.035633509501549594,"score_gpt":0.30527993390190744,"score_spread":0.26964642440035785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091969952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06217171,0.00001713053,0.9347096,0.00029509366,0.0016987048,0.00008453686,0.0000016368998,0.000009609679,0.0010119452],"genre_scores_gemma":[0.655788,0.000017195054,0.34408957,0.00004056538,0.000052689906,0.0000016324288,4.220177e-7,0.0000021247693,0.000007816337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982107,0.000031370626,0.0007071073,0.00015597261,0.0007439344,0.00015090032],"domain_scores_gemma":[0.99757946,0.0000618313,0.00055827777,0.00023937241,0.00148304,0.00007805174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845681,0.0000749787,0.00016239974,0.001065643,0.00004452371,0.000109724846,0.0026967328,0.000020788568,0.00003558811],"category_scores_gemma":[0.00005015195,0.00006904388,0.00007060815,0.00078534294,0.00032959713,0.0020934592,0.0003974027,0.00011073442,0.000003962083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006748098,0.0017057855,0.014810319,0.00004341396,0.00013281372,0.00007238142,0.016587805,0.45783666,0.011178769,0.19165854,0.00023250653,0.30567354],"study_design_scores_gemma":[0.0015410346,0.00090040755,0.054779667,0.00038437766,0.0000068393692,0.0003600334,0.000092063645,0.90849584,0.02243109,0.00988723,0.00082864176,0.00029278328],"about_ca_topic_score_codex":0.000044128796,"about_ca_topic_score_gemma":0.000007366124,"teacher_disagreement_score":0.59361625,"about_ca_system_score_codex":0.00010295218,"about_ca_system_score_gemma":0.00055718166,"threshold_uncertainty_score":0.50112456},"labels":[],"label_agreement":null},{"id":"W2092863347","doi":"10.1007/s00224-011-9379-7","title":"Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Terrain; Asynchronous communication; Polygon (computer graphics); Computer science; Bounded function; Trajectory; Point (geometry); Algorithm; Mathematics; Geometry; Geography; Frame (networking); Mathematical analysis; Engineering","score_opus":0.06548969616562526,"score_gpt":0.28180400628514773,"score_spread":0.21631431011952246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092863347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23103444,0.00017991112,0.73643994,0.000012964273,0.0006412656,0.00037366318,0.0000038361763,0.00010866157,0.031205311],"genre_scores_gemma":[0.9872465,0.0000026030068,0.012499042,0.000029387693,0.000031056596,0.00000317235,0.0000013672656,0.000011872327,0.00017495689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979378,0.00050152617,0.00066935096,0.00027179823,0.00031519416,0.00030431213],"domain_scores_gemma":[0.9987611,0.00021431899,0.0003636722,0.000481952,0.000099331315,0.00007961873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016702639,0.0001393138,0.00035051588,0.000269358,0.00006250358,0.000033368975,0.0008898957,0.0000658962,0.000019517993],"category_scores_gemma":[0.00005826415,0.00013485645,0.00006694516,0.00033737684,0.00017657202,0.00013071657,0.00024001233,0.00012293202,0.000011787048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104325234,0.0008810199,0.0050072363,0.0009909216,0.00013010883,0.000100885634,0.070863955,0.021147951,0.00084082095,0.84294575,0.00014116189,0.05684585],"study_design_scores_gemma":[0.0018813807,0.00077617436,0.021958565,0.0011219092,0.000016232909,0.00016227024,0.0011723838,0.94599044,0.0012080185,0.025053464,0.000073440264,0.0005857204],"about_ca_topic_score_codex":0.00012645668,"about_ca_topic_score_gemma":0.000004993771,"teacher_disagreement_score":0.9248425,"about_ca_system_score_codex":0.00005021862,"about_ca_system_score_gemma":0.00013251463,"threshold_uncertainty_score":0.54992867},"labels":[],"label_agreement":null},{"id":"W2093015753","doi":"10.1016/j.tcs.2009.04.023","title":"On the relative dominance of paging algorithms","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Austrian Science Fund","keywords":"Paging; Computer science; Algorithm; Thrashing; Demand paging; Interval (graph theory); Mathematics; Virtual memory; Parallel computing; Combinatorics; Operating system; Memory management","score_opus":0.013791904763709497,"score_gpt":0.2660141089415978,"score_spread":0.2522222041778883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093015753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029653367,0.000010887717,0.97765464,0.008572972,0.00015295307,0.0001564105,4.883189e-7,0.00006284616,0.01042349],"genre_scores_gemma":[0.8128402,0.0000041360336,0.18562579,0.0014883089,0.000021232518,0.0000019620195,1.1045023e-7,0.0000019907977,0.000016241429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982455,0.00013207627,0.00020935619,0.0004007666,0.0006640766,0.00034827096],"domain_scores_gemma":[0.99839884,0.0005517773,0.00007299562,0.0006706001,0.00019438844,0.00011138186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017035231,0.000107124586,0.00013085411,0.00011122826,0.00032677824,0.00018312542,0.0021378424,0.000024876446,0.000032432265],"category_scores_gemma":[0.00018361335,0.000064526794,0.00004819613,0.0012584665,0.001717044,0.0005096245,0.00031170156,0.00019673978,0.000033665507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002997049,0.000037619353,0.0000018851775,7.7818714e-7,0.0000010511992,0.0000020007699,0.000523705,0.0008650797,0.00017499158,0.9656553,0.000053965312,0.032680627],"study_design_scores_gemma":[0.00007893254,0.00020326371,0.00017283519,0.000022075721,5.702056e-7,0.0000033072483,0.0000019184904,0.5526247,0.0023111622,0.4445014,0.000020405845,0.00005945117],"about_ca_topic_score_codex":5.997046e-7,"about_ca_topic_score_gemma":3.2497184e-8,"teacher_disagreement_score":0.8098749,"about_ca_system_score_codex":0.00002694425,"about_ca_system_score_gemma":0.00007740049,"threshold_uncertainty_score":0.63265204},"labels":[],"label_agreement":null},{"id":"W2093224514","doi":"10.1007/s10878-005-1778-8","title":"Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Travelling salesman problem; Theory of computation; Scheduling (production processes); Mathematics; Computer science; Implementation; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.015425101370619199,"score_gpt":0.2412177868623189,"score_spread":0.2257926854916997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093224514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023233064,0.00028021587,0.95718545,0.0036959765,0.007266866,0.00083919935,0.0000038079565,0.000073093805,0.007422341],"genre_scores_gemma":[0.65428907,0.0001993364,0.34322852,0.0001133203,0.0019653426,0.0000026340044,0.0000023642174,0.000024386596,0.00017500856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976575,0.00021714185,0.00088294514,0.00019705722,0.00078585936,0.0002595386],"domain_scores_gemma":[0.9975929,0.00017134869,0.0010477724,0.00029930545,0.0007600244,0.0001286512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007336813,0.00018084727,0.00033299948,0.00023289691,0.00022450487,0.00023375842,0.0009668889,0.00012505795,0.000047018522],"category_scores_gemma":[0.00018139846,0.00013663838,0.00018376349,0.0006950668,0.000053339976,0.0009233813,0.00012051452,0.00034177114,0.000005171157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863035,0.00036877356,0.000098813965,0.00001987705,0.000020676693,0.0000048566185,0.00046000764,0.9820893,0.00030794562,0.015445494,0.00047679886,0.00062884984],"study_design_scores_gemma":[0.0031971459,0.00073422585,0.00009655448,0.00016308986,0.000044588454,0.000047267455,0.000058916936,0.9874484,0.0057723275,0.0013201818,0.00088025077,0.00023705467],"about_ca_topic_score_codex":0.0000064582555,"about_ca_topic_score_gemma":0.0000013759401,"teacher_disagreement_score":0.631056,"about_ca_system_score_codex":0.00013835171,"about_ca_system_score_gemma":0.0004332616,"threshold_uncertainty_score":0.5571952},"labels":[],"label_agreement":null},{"id":"W2093995619","doi":"10.1016/j.tcs.2005.11.023","title":"Efficient algorithms for robustness in resource allocation and scheduling problems","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Robustness (evolution); Scheduling (production processes); Algorithm; Mathematical optimization; Distributed computing; Mathematics","score_opus":0.019938166810192462,"score_gpt":0.27476555904362915,"score_spread":0.2548273922334367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093995619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016679918,0.000042624593,0.9765691,0.005706551,0.00008853475,0.0004623808,4.948387e-7,0.000106268984,0.00034410812],"genre_scores_gemma":[0.50899047,0.000002534488,0.49065876,0.00027099895,0.000045876925,0.000020580634,5.497246e-7,0.00000418095,0.000006051942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798495,0.00009752601,0.0002791798,0.0006936491,0.00043897162,0.0005057377],"domain_scores_gemma":[0.9989006,0.00026066334,0.00004942813,0.00041092298,0.0001770628,0.00020132173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034565278,0.00012772097,0.00014537846,0.00025670105,0.00029219207,0.00042310279,0.001021086,0.00004633433,0.00000477272],"category_scores_gemma":[0.00013015461,0.0001107953,0.000025537072,0.0009908208,0.00092644617,0.00032505856,0.00051477127,0.00013900409,0.0000054699826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028981801,0.00003903628,0.0000064893984,0.0000072858984,5.242265e-7,3.1824825e-7,0.00035440375,0.4906004,0.00007666724,0.46464235,0.0000034037748,0.04426622],"study_design_scores_gemma":[0.00042361883,0.00009262903,0.00012457882,0.00004143852,0.0000010171512,0.000009998148,0.000008986473,0.9929695,0.00042843353,0.0055262465,0.00021983244,0.00015372054],"about_ca_topic_score_codex":0.0000010871416,"about_ca_topic_score_gemma":0.0000010029743,"teacher_disagreement_score":0.5023691,"about_ca_system_score_codex":0.00007060005,"about_ca_system_score_gemma":0.00009359331,"threshold_uncertainty_score":0.45181012},"labels":[],"label_agreement":null},{"id":"W2094391659","doi":"10.1016/j.tcs.2013.12.023","title":"Price of asynchrony in mobile agents computing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchrony (computer programming); Asynchronous communication; Rendezvous; Computer science; Distributed computing; Task (project management); Context (archaeology); Grid; Node (physics); Synchronization (alternating current); Distributed algorithm; Integer (computer science); Computer network; Mathematics; Spacecraft","score_opus":0.01074761978554087,"score_gpt":0.27420456160855056,"score_spread":0.26345694182300966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094391659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039623566,0.000010637441,0.9523421,0.00020530996,0.0002256456,0.00018569642,2.3903024e-7,0.00008057635,0.007326239],"genre_scores_gemma":[0.7697731,0.0000030508256,0.22992173,0.00026451927,0.000026505286,0.0000026729833,2.4924285e-7,0.0000037154537,0.000004453231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978119,0.00018996398,0.00034849157,0.00051129493,0.0006485929,0.0004897358],"domain_scores_gemma":[0.9986622,0.00028519396,0.00008420511,0.0006046833,0.00017655792,0.00018717759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026447256,0.000117140466,0.0002039676,0.00026642665,0.00013944732,0.00016648878,0.0021694477,0.000037369304,0.000041217412],"category_scores_gemma":[0.00012132332,0.00010119992,0.00003861184,0.0016138498,0.0012889382,0.0004507572,0.0011023799,0.00015852271,0.000036017016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016178723,0.00007566001,0.00028400132,0.000011549312,9.3690636e-7,0.0000015123965,0.0006447243,0.017602269,0.00019701544,0.92847246,0.000015900472,0.052692365],"study_design_scores_gemma":[0.0002510884,0.00019473404,0.002157657,0.000037729806,5.214281e-7,0.000005120971,0.0000040096807,0.97037184,0.0012063502,0.0254911,0.00016072569,0.00011912365],"about_ca_topic_score_codex":0.0000030947272,"about_ca_topic_score_gemma":3.519614e-7,"teacher_disagreement_score":0.9527696,"about_ca_system_score_codex":0.000046315898,"about_ca_system_score_gemma":0.00009370767,"threshold_uncertainty_score":0.47491467},"labels":[],"label_agreement":null},{"id":"W2094695631","doi":"10.3166/jesa.38.1097-1119","title":"Optimisation par colonies de fourmis d'un site de génération d'énergie","year":2004,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biology; Physics","score_opus":0.029775887218448163,"score_gpt":0.27065585013503735,"score_spread":0.2408799629165892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094695631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14479446,0.003997768,0.83445,0.012322007,0.001236991,0.00038806387,0.000014334098,0.00034593,0.0024504121],"genre_scores_gemma":[0.46882516,0.0038131485,0.52084184,0.0009480701,0.0006645741,0.000022715023,0.000010786668,0.00007496261,0.004798734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525434,0.001268292,0.0010258902,0.00045271998,0.0008438746,0.0011548763],"domain_scores_gemma":[0.99719083,0.00019578551,0.00073054666,0.0004550401,0.00071785005,0.0007099548],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002412614,0.0004041006,0.00043479056,0.0003613986,0.0013057486,0.0026022436,0.00083045196,0.0002782184,0.00034809197],"category_scores_gemma":[0.00061984593,0.0004255818,0.00025329884,0.00093724066,0.00032308107,0.0026328394,0.00022765045,0.0007468063,0.00040164427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026810263,0.0003402248,0.0015021064,0.00029033696,0.00016303411,0.00091659726,0.01688191,0.69081414,0.0027461413,0.03307088,0.0028315464,0.25041625],"study_design_scores_gemma":[0.0024182415,0.0008683394,0.09966943,0.00136696,0.00012322802,0.0109771015,0.00022006605,0.80287766,0.004882482,0.06929792,0.0065345643,0.0007640054],"about_ca_topic_score_codex":0.00024657728,"about_ca_topic_score_gemma":0.000074587,"teacher_disagreement_score":0.3240307,"about_ca_system_score_codex":0.0015882328,"about_ca_system_score_gemma":0.001698567,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2095553101","doi":"10.1016/j.orl.2006.03.014","title":"A list heuristic for vertex cover","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Heuristic; Cover (algebra); Sequence (biology); Degree (music); Mathematics; Approximation algorithm; Order (exchange); Discrete mathematics; Mathematical optimization; Graph; Physics","score_opus":0.051379162552689324,"score_gpt":0.35267193164324034,"score_spread":0.301292769090551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095553101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046898853,0.000028612249,0.9545683,0.035899356,0.0001240596,0.0006738988,0.000012936346,0.000085282925,0.003917651],"genre_scores_gemma":[0.80389905,0.000021984431,0.1746785,0.004239854,0.00027367176,0.00075585063,0.00013038487,0.00003127751,0.015969412],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983925,0.00017878148,0.00017554239,0.00031702462,0.0004954627,0.0004406872],"domain_scores_gemma":[0.9988736,0.0002369567,0.000008137975,0.00041953672,0.0003732904,0.000088510584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079077383,0.000077164186,0.00008163972,0.00024238476,0.00068545353,0.0009095464,0.00061242626,0.00003212672,0.000105630104],"category_scores_gemma":[0.00022886187,0.00007198337,0.00004446897,0.00061444484,0.00011214147,0.00052992604,0.00013294841,0.00017726062,0.00025886923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007970447,0.00014683834,0.00007646306,0.000021480351,0.0000112800935,0.000011153533,0.00025274057,0.1894481,0.019003937,0.30967963,0.4799956,0.0013447889],"study_design_scores_gemma":[0.00045453195,0.00006488632,0.00020970209,0.000009704652,0.0000010124297,0.0000033677186,0.000009644294,0.9215925,0.000603679,0.00083076494,0.07609924,0.00012100723],"about_ca_topic_score_codex":0.000322417,"about_ca_topic_score_gemma":0.00011453895,"teacher_disagreement_score":0.7992092,"about_ca_system_score_codex":0.00008920071,"about_ca_system_score_gemma":0.00014184722,"threshold_uncertainty_score":0.87707764},"labels":[],"label_agreement":null},{"id":"W2095682406","doi":"10.1109/tnsm.2009.03.090304","title":"Distributed adaptive diverse routing for voice-over-IP in service overlay networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computer network; Overlay network; Voice over IP; Scalability; Overlay; Quality of service; Routing (electronic design automation); Node (physics); Distributed computing; Learning automata; Path (computing); Automaton; The Internet","score_opus":0.020859724117424518,"score_gpt":0.24558526346121773,"score_spread":0.22472553934379322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095682406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061179214,0.00003247574,0.9931024,0.0037753372,0.00034680837,0.0008722037,0.000014019704,0.00015752863,0.0010874902],"genre_scores_gemma":[0.9562642,0.0004779817,0.030919056,0.011839388,0.00010678272,0.0001273534,0.000026367978,0.000019252151,0.00021960541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983189,0.000083957595,0.0003051747,0.000512069,0.00023366243,0.0005462207],"domain_scores_gemma":[0.9992038,0.00011284823,0.00008210775,0.0003616298,0.00010246525,0.00013716833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003627533,0.00022686987,0.00021395311,0.0001270765,0.00038709765,0.00019336323,0.00044009447,0.00008787696,0.000013564249],"category_scores_gemma":[7.113637e-7,0.00023291369,0.00006280668,0.0013464848,0.000010952839,0.000404744,0.000015692485,0.00022311053,0.000010375905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008257556,0.00013626553,0.000010089143,0.00002785097,0.000041586027,0.000009015856,0.0003299523,0.9351047,0.000001028212,0.0048139836,0.0004283712,0.059014536],"study_design_scores_gemma":[0.0013869557,0.00017268884,0.0017098878,0.00010384834,0.000029344325,0.000001516491,0.00020708617,0.99267507,0.00000449336,0.0007390922,0.0027142207,0.00025581074],"about_ca_topic_score_codex":0.00009371882,"about_ca_topic_score_gemma":0.00080806826,"teacher_disagreement_score":0.9621833,"about_ca_system_score_codex":0.00008609141,"about_ca_system_score_gemma":0.000016765018,"threshold_uncertainty_score":0.9497945},"labels":[],"label_agreement":null},{"id":"W2096909102","doi":"10.1109/icnp.2008.4697038","title":"Competitive analysis of buffer policies with SLA commitments","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Conference on Network Protocols","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network packet; Computer science; Competitive analysis; Computer network; Revenue; Abstraction; Bandwidth (computing); Task (project management); Online algorithm; Algorithm; Upper and lower bounds; Business; Engineering","score_opus":0.07694593558326353,"score_gpt":0.3318369077999769,"score_spread":0.25489097221671336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096909102","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024084307,0.000012680578,0.026227836,0.003749718,0.00021186449,0.031423315,0.00004845731,0.0006925747,0.91354924],"genre_scores_gemma":[0.95561975,0.00004355009,0.027138228,0.0006742936,0.00018424372,0.015190291,0.0000242561,0.00003307586,0.0010923273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652135,0.000014622576,0.0006782427,0.0007726105,0.0014189841,0.00059420173],"domain_scores_gemma":[0.9958004,0.000065141336,0.0006646176,0.00019366946,0.0030478851,0.00022828234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910662,0.0004041254,0.0006351798,0.0007637483,0.00033380312,0.0004584562,0.0019372863,0.00012934844,0.0002475358],"category_scores_gemma":[0.00007886896,0.0003385762,0.00017738994,0.0024193497,0.000318829,0.0011727733,0.00041887886,0.00039052515,0.000024924428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018612057,0.00026232743,0.04464384,0.0000359397,0.00070756895,0.0000035236903,0.0014461849,0.00077356014,0.00031618716,0.9492935,0.0020324623,0.00029879075],"study_design_scores_gemma":[0.008669197,0.0063539064,0.13088562,0.0029765337,0.00048761847,0.00017790786,0.0018281853,0.7397127,0.009787164,0.021832393,0.07391604,0.0033726967],"about_ca_topic_score_codex":0.000026704798,"about_ca_topic_score_gemma":0.0000071589902,"teacher_disagreement_score":0.9315354,"about_ca_system_score_codex":0.00013752929,"about_ca_system_score_gemma":0.0001861228,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W2097621701","doi":"10.1109/tsmcb.2007.913602","title":"A Solution to the Stochastic Point Location Problem in Metalevel Nonstationary Environments","year":2008,"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":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Point (geometry); Computer science; Rendering (computer graphics); Learning automata; Discretization; Space (punctuation); Point location; Interval (graph theory); Automaton; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.029084022566893915,"score_gpt":0.23439888387207194,"score_spread":0.20531486130517804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097621701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028743988,0.0002101912,0.9923309,0.002004587,0.00045642996,0.0013284426,0.000016272486,0.000075002725,0.00070374785],"genre_scores_gemma":[0.9879845,0.00024766894,0.0062660277,0.0004537971,0.00005327038,0.00038430435,0.0000072847656,0.000027802022,0.0045753676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974735,0.0002701074,0.00059403776,0.0005891982,0.0006218588,0.00045133173],"domain_scores_gemma":[0.99882674,0.000136262,0.00012860152,0.000583287,0.00009222991,0.00023288632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005098805,0.0002722445,0.00025128495,0.0003029464,0.0003876093,0.00015291364,0.0004502372,0.00011276905,0.000022454184],"category_scores_gemma":[0.000008608425,0.00023680655,0.000059396396,0.0006256182,0.00014716464,0.00032185984,0.000017407647,0.0002983382,0.0002670048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026731932,0.0003380947,0.00002861477,0.00003888786,0.000047556558,0.000011289575,0.0048258994,0.98093563,0.0002647735,0.005179001,0.0012654391,0.0070380946],"study_design_scores_gemma":[0.0016127729,0.00057558843,0.0019591697,0.000282638,0.000042082553,0.00023221827,0.00038450342,0.9773367,0.0004605791,0.0005718203,0.015810214,0.00073172647],"about_ca_topic_score_codex":0.0002218664,"about_ca_topic_score_gemma":0.00017046812,"teacher_disagreement_score":0.9860649,"about_ca_system_score_codex":0.00014241523,"about_ca_system_score_gemma":0.000091747854,"threshold_uncertainty_score":0.9656691},"labels":[],"label_agreement":null},{"id":"W2099745962","doi":"10.1016/j.tcs.2011.09.002","title":"Asynchronous deterministic rendezvous in bounded terrains","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Robot; Asynchronous communication; Computer science; Terrain; Bounded function; Mobile robot; Polygon (computer graphics); A priori and a posteriori; Trajectory; Algorithm; Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Spacecraft; Engineering; Geography","score_opus":0.027579630914106534,"score_gpt":0.2618971261887515,"score_spread":0.23431749527464496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099745962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009516098,0.000008081905,0.96300393,0.00028558797,0.00037729018,0.00018476268,5.157317e-7,0.00019576063,0.026427988],"genre_scores_gemma":[0.7039677,0.0000027815468,0.29557097,0.00041106358,0.00002455368,0.000008015121,2.6779745e-7,0.000005540499,0.000009125388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975468,0.00013831261,0.00032540187,0.0007071367,0.0005591459,0.00072322006],"domain_scores_gemma":[0.99859035,0.00010749424,0.000054687956,0.00081871566,0.000116435636,0.00031234504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359113,0.00016693716,0.00018896427,0.0003371782,0.00026063286,0.00035422313,0.0026836211,0.00005357682,0.00013104326],"category_scores_gemma":[0.00010219886,0.00014353641,0.000043762942,0.001318344,0.00244408,0.00071119994,0.0009692255,0.00022136277,0.00013318253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047297913,0.00010185143,0.00012755195,0.000004015557,0.0000011816894,0.00005205142,0.0022031192,0.00008025988,0.000054427095,0.9688717,0.000008952221,0.028490162],"study_design_scores_gemma":[0.00027360985,0.00029342296,0.002752874,0.00002132053,0.00000112566,0.000055221655,0.0000074744867,0.74851084,0.000566311,0.24726154,0.000040100706,0.00021616332],"about_ca_topic_score_codex":0.000010668602,"about_ca_topic_score_gemma":0.000005561537,"teacher_disagreement_score":0.7484306,"about_ca_system_score_codex":0.00009609868,"about_ca_system_score_gemma":0.0002517576,"threshold_uncertainty_score":0.9005315},"labels":[],"label_agreement":null},{"id":"W2099943113","doi":"10.1287/opre.1070.0439","title":"Improved Bounds for the Symmetric Rendezvous Value on the Line","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rendezvous; Conjecture; Mathematics; Value (mathematics); Semidefinite programming; Line (geometry); Markov decision process; Markov chain; Combinatorics; Mathematical optimization; Quadratic equation; Applied mathematics; Discrete mathematics; Markov process; Statistics; Physics; Geometry","score_opus":0.1417237002608727,"score_gpt":0.42065610245908586,"score_spread":0.27893240219821314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099943113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055623474,0.00012845096,0.9485522,0.04042914,0.00017203904,0.0012914187,0.0000048567504,0.000051225208,0.008814427],"genre_scores_gemma":[0.9180812,0.00020098184,0.047747478,0.0019696378,0.00038344623,0.0006060337,0.000013453368,0.000025475852,0.030972248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812406,0.00024547445,0.00020263412,0.00027817985,0.0006589455,0.00049069227],"domain_scores_gemma":[0.9957291,0.0025685998,0.00001249926,0.00083106844,0.00076644315,0.0000923193],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.007661143,0.0000776038,0.00006594704,0.00031694965,0.0021500138,0.0010205811,0.0013216657,0.000050316456,0.000049297436],"category_scores_gemma":[0.001670515,0.000040296025,0.000050360908,0.0022556072,0.00013844579,0.00020854187,0.00023805634,0.00042835865,0.00007630039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013097324,0.00009640879,0.000003938098,0.000003532154,0.000015463454,0.0000010048709,0.00050409656,0.020757243,0.0008173231,0.9376081,0.0057462943,0.034433473],"study_design_scores_gemma":[0.00021717623,0.00028257864,0.0000881464,0.0000045133656,0.0000011849468,0.000002139504,0.00011951521,0.96506023,0.001615435,0.0010109103,0.031538535,0.0000596538],"about_ca_topic_score_codex":0.0001457585,"about_ca_topic_score_gemma":0.0002159871,"teacher_disagreement_score":0.944303,"about_ca_system_score_codex":0.00008699696,"about_ca_system_score_gemma":0.00026603744,"threshold_uncertainty_score":0.999149},"labels":[],"label_agreement":null},{"id":"W2100580556","doi":"10.1137/1.9781611973075.3","title":"How to meet asynchronously (almost) everywhere","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Computer science","score_opus":0.010235277045089258,"score_gpt":0.23684898590267645,"score_spread":0.2266137088575872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100580556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002527636,0.000004392173,0.904707,0.023764897,0.00038583434,0.00018175985,6.617896e-7,0.00025924275,0.06816859],"genre_scores_gemma":[0.4275562,0.0000021036817,0.54610527,0.0023609146,0.00007687121,0.000017022325,8.3396384e-7,0.00000831081,0.02387248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991847,0.000021607893,0.000079358,0.000258647,0.00021559873,0.00024004218],"domain_scores_gemma":[0.99914753,0.000029864332,0.000017628165,0.0004883887,0.0001074675,0.00020913659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018093095,0.000078564306,0.00007415071,0.00006742973,0.00008571923,0.0005021384,0.0007368492,0.000046019024,0.00027802424],"category_scores_gemma":[0.000062937695,0.0000639665,0.000028535758,0.00030842822,0.000017482602,0.0005333069,0.00023081769,0.00009235734,0.00024165599],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023127059,0.00007960489,0.00056920067,0.000008255675,0.00001038324,0.000010940913,0.0007573056,0.00057903735,0.010321463,0.8086944,0.13085309,0.04811397],"study_design_scores_gemma":[0.0006487472,0.0003027931,0.0012214067,0.00001086252,0.0000024100832,0.000039747552,0.00009365533,0.2429172,0.0099402275,0.0070440522,0.73714155,0.00063735474],"about_ca_topic_score_codex":0.000020135387,"about_ca_topic_score_gemma":0.00027748768,"teacher_disagreement_score":0.8016504,"about_ca_system_score_codex":0.0000108729355,"about_ca_system_score_gemma":0.000069440495,"threshold_uncertainty_score":0.48421317},"labels":[],"label_agreement":null},{"id":"W2101083305","doi":"10.1007/s10951-008-0078-4","title":"Minimizing the stretch when scheduling flows of divisible requests","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Heuristics; Computer science; Preemption; Scheduling (production processes); Mathematical optimization; Pareto principle; Linear programming; Algorithm; Mathematics","score_opus":0.04646876579966042,"score_gpt":0.27423315951744676,"score_spread":0.22776439371778634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101083305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49037567,0.0008968729,0.50569874,0.002167827,0.00032502698,0.00008319595,4.0002325e-7,0.000022565628,0.00042969044],"genre_scores_gemma":[0.56122744,0.00021459303,0.43829685,0.00010917029,0.000115164126,6.664624e-7,1.6081924e-7,0.000006929386,0.000029045841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980427,0.00013734808,0.00073010114,0.0001546176,0.000667268,0.00026793522],"domain_scores_gemma":[0.99814034,0.00022869921,0.00058446266,0.00033304968,0.00057845935,0.00013496763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014160482,0.00012098855,0.0002744863,0.00027656392,0.00024281838,0.000111825175,0.0011118386,0.00006274037,0.00004216176],"category_scores_gemma":[0.0003457642,0.000083224826,0.00015855633,0.0005272298,0.00007748496,0.0009674386,0.00019395328,0.00045130565,0.0000067961387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075250486,0.00039795993,0.015174889,0.00014639359,0.0002899961,0.00025650472,0.023467511,0.8702514,0.024139266,0.021170639,0.0005240524,0.044106115],"study_design_scores_gemma":[0.0008255773,0.00020346025,0.0006900322,0.00034839913,0.000015353624,0.00038327894,0.00042485987,0.9865844,0.006615984,0.0031695322,0.00055812165,0.00018099078],"about_ca_topic_score_codex":0.0000074103655,"about_ca_topic_score_gemma":0.0000015565852,"teacher_disagreement_score":0.116332985,"about_ca_system_score_codex":0.000036769572,"about_ca_system_score_gemma":0.00029495574,"threshold_uncertainty_score":0.33938098},"labels":[],"label_agreement":null},{"id":"W2101179918","doi":"10.1109/hpcsa.2002.1019137","title":"The characterization of parallel real-time optimization problems","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Class (philosophy); Computer science; Bounded function; Matroid; Optimization problem; Independence (probability theory); Characterization (materials science); Property (philosophy); Mathematical optimization; Tree (set theory); Parallel algorithm; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.014041623754439082,"score_gpt":0.2281642024924671,"score_spread":0.21412257873802804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101179918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033685978,0.0000066916264,0.9655625,0.00067358156,0.000071149814,0.00028648684,5.643625e-7,0.00010590597,0.03295625],"genre_scores_gemma":[0.06375741,0.0021600705,0.90077096,0.0003436135,0.00003344779,0.00011471613,0.000058738024,0.000035257675,0.03272578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902743,0.00014398538,0.0002588149,0.00017031988,0.00022310256,0.00017635553],"domain_scores_gemma":[0.99922127,0.000058470134,0.00011963529,0.00035675522,0.000192431,0.000051471503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000480782,0.00007483041,0.00008567768,0.000049519498,0.00016487346,0.0001345094,0.00036986326,0.00003752257,0.000114994466],"category_scores_gemma":[0.000055469627,0.000050164912,0.000030229823,0.0004117717,0.00004021272,0.00041970052,0.00004727821,0.000042533888,0.000035498822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038487015,0.000086519816,0.00015463457,0.000014172646,0.000015817543,3.6173816e-7,0.0004228076,0.3302698,0.017885393,0.6476957,0.0003209609,0.0031299398],"study_design_scores_gemma":[0.00023012009,0.000049385315,0.00019784852,0.0000074293393,0.0000015062781,0.0000022735644,0.0000067051737,0.99289805,0.0016240835,0.0010682086,0.0038223616,0.0000920363],"about_ca_topic_score_codex":0.0000056342665,"about_ca_topic_score_gemma":0.000001018711,"teacher_disagreement_score":0.66262823,"about_ca_system_score_codex":0.000013337308,"about_ca_system_score_gemma":0.000065823064,"threshold_uncertainty_score":0.20456658},"labels":[],"label_agreement":null},{"id":"W2101721652","doi":"10.1109/ipdps.2005.23","title":"A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automaton; Focus (optics); Heuristic; Theoretical computer science; Set (abstract data type); Learning automata; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.013602729269242195,"score_gpt":0.24385453666194873,"score_spread":0.23025180739270654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101721652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012130346,0.000014271025,0.97761124,0.019114373,0.00006542529,0.00038075107,6.0381575e-7,0.00037035006,0.0012299651],"genre_scores_gemma":[0.5778235,0.000001396072,0.41818574,0.0015330401,0.00005086212,0.00002389871,0.000002669645,0.000007679919,0.0023711862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988434,0.00009857421,0.00018630731,0.00025515855,0.00029592466,0.00032064877],"domain_scores_gemma":[0.9994427,0.00006366133,0.000050403127,0.0002573601,0.00008228989,0.000103581486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031149705,0.00010165332,0.0000857666,0.0001074628,0.00032488018,0.00027836865,0.0005136224,0.000033774537,0.00012515011],"category_scores_gemma":[0.00006157905,0.00006820268,0.000027165772,0.00051636004,0.000017277913,0.0003714351,0.00022937237,0.00019733203,0.00022049551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.511439e-7,0.000011094917,0.000019987508,0.000008625988,0.0000064252577,4.6920832e-7,0.004491206,0.9384121,0.0006117202,0.016880447,0.0029175822,0.036639437],"study_design_scores_gemma":[0.00012882349,0.000035551082,0.00019708887,0.000020590338,0.0000012528809,0.000009908737,0.000077088254,0.98670816,0.000080143785,0.0005908849,0.012044638,0.00010585399],"about_ca_topic_score_codex":0.000017448037,"about_ca_topic_score_gemma":0.00004332781,"teacher_disagreement_score":0.5766105,"about_ca_system_score_codex":0.000061002367,"about_ca_system_score_gemma":0.0000667659,"threshold_uncertainty_score":0.2834097},"labels":[],"label_agreement":null},{"id":"W2101810678","doi":"10.1109/icde.2009.105","title":"On Efficient Recommendations for Online Exchange Markets","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Popularity; Database transaction; Focus (optics); Social network (sociolinguistics); Probabilistic logic; Value (mathematics); User modeling; World Wide Web; Class (philosophy); Recommender system; User interface; Social media; Database; Artificial intelligence; Machine learning","score_opus":0.11157168128214941,"score_gpt":0.34177713795701203,"score_spread":0.23020545667486264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101810678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018775045,0.000015029677,0.945475,0.039507627,0.00088409084,0.000556957,0.0004358993,0.0004266079,0.010821277],"genre_scores_gemma":[0.62867284,0.00017386423,0.36630374,0.002245554,0.00031745087,0.000084070256,0.0013630103,0.000026640326,0.0008128375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879354,0.0000035630767,0.00020827507,0.00045069444,0.00031919056,0.00022475822],"domain_scores_gemma":[0.9991839,0.000071535374,0.00007126602,0.00026988247,0.00031014514,0.000093284274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030408488,0.00014342292,0.00010233293,0.00026333614,0.0000710872,0.0003463846,0.0016652178,0.000040744562,0.00010357836],"category_scores_gemma":[0.00036445263,0.00014226616,0.00002730993,0.0001871018,0.0000075558337,0.0005287891,0.0002247147,0.00015967684,0.00001976869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026468837,0.00023752189,0.0000026204655,0.00001893164,0.0000208598,7.980512e-7,0.00015126854,0.004284178,0.0005552167,0.9323687,0.014497563,0.047835857],"study_design_scores_gemma":[0.0003478687,0.00012664936,0.0001306037,0.00011371977,0.0000019879183,0.0000027516476,0.000012498786,0.9671756,0.00016011923,0.0013070266,0.030468784,0.00015238354],"about_ca_topic_score_codex":0.0000010288303,"about_ca_topic_score_gemma":3.226184e-7,"teacher_disagreement_score":0.9628914,"about_ca_system_score_codex":0.000068707384,"about_ca_system_score_gemma":0.000030010257,"threshold_uncertainty_score":0.5801445},"labels":[],"label_agreement":null},{"id":"W2102172432","doi":"10.1142/s0218195910003232","title":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Mathematics; Approximation algorithm; Combinatorics; Boundary (topology); Viewpoints; Time complexity; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","score_opus":0.012058966365115536,"score_gpt":0.2997036074054154,"score_spread":0.28764464104029985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102172432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024319093,0.00008145079,0.987161,0.0071629807,0.00031295867,0.000591258,0.000033124907,0.00006827158,0.0021570553],"genre_scores_gemma":[0.36500823,0.00006909467,0.6328094,0.00090535166,0.00053548784,0.00018411265,0.00010737201,0.000022667704,0.00035828695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972548,0.00006719116,0.0007566184,0.00031731103,0.0013547717,0.00024929267],"domain_scores_gemma":[0.9959777,0.00023525394,0.000644736,0.00030490448,0.0025718317,0.00026559248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057878625,0.00020051128,0.0002528681,0.00059374917,0.0001838306,0.00050997006,0.0019508727,0.0000719303,0.00016584851],"category_scores_gemma":[0.000029205514,0.00016360905,0.00014511879,0.0008930348,0.00012728908,0.0010023521,0.00020067336,0.0005024945,0.00007356269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006042469,0.00046014084,0.002090128,0.000022911643,0.00040609858,0.000029707253,0.00022262284,0.26087883,0.0005320079,0.62245446,0.0013677512,0.111474924],"study_design_scores_gemma":[0.0039013335,0.00028323333,0.0066420003,0.00010409211,0.000055178763,0.0013862127,0.000042816373,0.10495318,0.0005079027,0.14007698,0.7413187,0.00072837656],"about_ca_topic_score_codex":0.000010742207,"about_ca_topic_score_gemma":0.000012171179,"teacher_disagreement_score":0.73995095,"about_ca_system_score_codex":0.00008641062,"about_ca_system_score_gemma":0.00043333127,"threshold_uncertainty_score":0.66717833},"labels":[],"label_agreement":null},{"id":"W2104796709","doi":"10.1109/sccc.1997.637100","title":"On the optimal search problem: the case when the target distribution is unknown","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Unobservable; Object (grammar); Computer science; Bin; Probability distribution; Mathematical optimization; Function (biology); Set (abstract data type); Probability density function; Distribution (mathematics); Algorithm; Data mining; Mathematics; Artificial intelligence; Statistics","score_opus":0.04116817572183037,"score_gpt":0.252364553691546,"score_spread":0.2111963779697156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104796709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009430807,0.000048665115,0.78386694,0.18467736,0.00008534518,0.00075342995,0.000013286323,0.00012481282,0.029487057],"genre_scores_gemma":[0.90682447,0.00009272408,0.03286544,0.014409588,0.00013219741,0.0001799627,0.000014674936,0.000021393249,0.045459554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983954,0.000359805,0.00017324364,0.000281397,0.00042074293,0.00036942418],"domain_scores_gemma":[0.99848884,0.0004342893,0.000037840076,0.0008189923,0.00014560361,0.000074424075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010956898,0.00012208,0.00007205232,0.000022439795,0.0011518187,0.00057991466,0.0012199566,0.000041679363,0.002084411],"category_scores_gemma":[0.000056538036,0.000046730307,0.00006479214,0.00043345892,0.0001586637,0.00024768576,0.000339152,0.0003443824,0.00049794605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020998518,0.00007292403,0.000006218754,0.0000030793135,0.000014746725,0.00003131801,0.0054622823,0.008407726,0.000005329484,0.7202596,0.25952247,0.0062121833],"study_design_scores_gemma":[0.00013537402,0.00008354804,0.000010410438,0.000005069501,0.0000023252046,0.0001234644,0.00025838483,0.93594515,0.00021867793,0.005425796,0.057700314,0.0000914543],"about_ca_topic_score_codex":0.00011282316,"about_ca_topic_score_gemma":0.000009421371,"teacher_disagreement_score":0.92753744,"about_ca_system_score_codex":0.000039315368,"about_ca_system_score_gemma":0.000031472475,"threshold_uncertainty_score":0.9988278},"labels":[],"label_agreement":null},{"id":"W2104859809","doi":"10.1007/978-3-319-08404-6_9","title":"Competitive Online Routing on Delaunay Triangulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Computer science; Bowyer–Watson algorithm; Combinatorics; Competitive analysis; Pitteway triangulation; Shortest path problem; Algorithm; Graph; Mathematics; Theoretical computer science","score_opus":0.026425287501370364,"score_gpt":0.27531310677312987,"score_spread":0.24888781927175951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010462253,0.000043928532,0.97758377,0.0020322108,0.00096869003,0.0004136465,0.000010546056,0.00020572061,0.01873101],"genre_scores_gemma":[0.16161849,0.000036562164,0.82931316,0.005873586,0.0007923079,0.000010552934,0.000049570106,0.000056957397,0.0022488432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964947,0.00007897305,0.00053335325,0.0012886936,0.0010078852,0.0005964115],"domain_scores_gemma":[0.99713784,0.0008682363,0.00027953341,0.0011420087,0.0003616891,0.00021066681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094025343,0.00042924768,0.00046045362,0.000887321,0.00037024074,0.0005429669,0.0023997868,0.0002484171,0.00005267894],"category_scores_gemma":[0.0002256996,0.00038921373,0.00012996266,0.000649485,0.00044515895,0.0003079065,0.00082096655,0.000870096,0.00010544569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031844688,0.000030740004,0.000010684397,0.000008634688,0.000006452387,0.000015752601,0.00037880786,0.20614791,0.000015174235,0.50430393,0.000018365963,0.28906035],"study_design_scores_gemma":[0.0003872223,0.00022537838,0.00008194453,0.00036697116,0.0000038379485,0.000016740705,1.9080541e-7,0.94262457,0.00012893473,0.05032235,0.005360794,0.00048103783],"about_ca_topic_score_codex":0.000011266653,"about_ca_topic_score_gemma":0.00009385951,"teacher_disagreement_score":0.73647666,"about_ca_system_score_codex":0.00026314403,"about_ca_system_score_gemma":0.000428867,"threshold_uncertainty_score":0.999856},"labels":[],"label_agreement":null},{"id":"W2105159972","doi":"10.1142/s0129054114500129","title":"EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Security token; Node (physics); Computer science; Grid; Port (circuit theory); Degree (music); Traverse; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Geography; Engineering; Geometry; Physics","score_opus":0.020309873665442287,"score_gpt":0.2950705856064975,"score_spread":0.2747607119410552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105159972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014829524,0.000007337495,0.97946084,0.0036926155,0.0012818269,0.00008099595,0.0000017087331,0.000020505771,0.00062465214],"genre_scores_gemma":[0.58984303,0.000006397106,0.40980205,0.00017304329,0.0001558964,0.0000018733183,0.0000022060904,0.0000029443895,0.000012581515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758804,0.00006865982,0.0004972242,0.00019438866,0.0015043454,0.00014731767],"domain_scores_gemma":[0.9955053,0.00015639576,0.00053463015,0.0002552029,0.0034373808,0.000111129775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012078868,0.00008811618,0.00013081313,0.00072550273,0.00013706589,0.00038033925,0.0019483946,0.000017128554,0.000014876405],"category_scores_gemma":[0.00012535224,0.00007018076,0.000051838822,0.00076734327,0.0002739513,0.0018256181,0.00020969837,0.00010279091,0.000009586118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002414379,0.00020487896,0.00026434346,0.000004578931,0.00003379722,0.000004967631,0.0011865548,0.77173156,0.0005926234,0.14472567,0.00024569902,0.0809812],"study_design_scores_gemma":[0.00062296423,0.00038170748,0.0024703909,0.000063416264,0.0000038178323,0.000100246376,0.000021747948,0.9899451,0.0009879762,0.003314682,0.0019883316,0.000099582714],"about_ca_topic_score_codex":0.0000049990476,"about_ca_topic_score_gemma":0.0000016339459,"teacher_disagreement_score":0.5750135,"about_ca_system_score_codex":0.000087836575,"about_ca_system_score_gemma":0.0005429475,"threshold_uncertainty_score":0.366762},"labels":[],"label_agreement":null},{"id":"W2105334284","doi":"10.1016/j.tcs.2014.12.007","title":"Searching on a line: A complete characterization of the optimal solution","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Competitive analysis; Parameterized complexity; Mathematics; Position (finance); Upper and lower bounds; Mathematical optimization; Characterization (materials science); Line (geometry); Search problem; Combinatorics","score_opus":0.02262614493001695,"score_gpt":0.2660139534981598,"score_spread":0.24338780856814288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105334284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04117672,5.539282e-7,0.95396954,0.0027932853,0.00029671617,0.00017906532,0.0000010515269,0.00007366514,0.0015093877],"genre_scores_gemma":[0.92749757,0.0000011408888,0.07171003,0.0007089375,0.00006279731,0.0000036011593,0.0000012137232,0.000004475701,0.000010222422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979576,0.00028592534,0.00022806972,0.000392072,0.0007825936,0.00035376978],"domain_scores_gemma":[0.9987222,0.00016778731,0.00009064459,0.0006819654,0.00020870935,0.00012871854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017010433,0.00010508167,0.0001286807,0.00013387477,0.00043650647,0.00023852393,0.002023841,0.000029783952,0.0000125183515],"category_scores_gemma":[0.00014103229,0.000069285525,0.00005488655,0.0010330327,0.0014579268,0.0003874384,0.00089990936,0.00018880794,0.000025736335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005037922,0.000038089238,0.000010734713,0.0000052661144,0.0000011560521,1.5687999e-7,0.00030099505,0.0077484758,0.013829035,0.95685893,0.0000025182521,0.021199603],"study_design_scores_gemma":[0.00018908468,0.00024663657,0.0011854251,0.000039704883,0.0000010575126,0.0000044677017,7.125641e-7,0.9742018,0.0066542076,0.017285436,0.00010595328,0.000085489206],"about_ca_topic_score_codex":0.0000019774257,"about_ca_topic_score_gemma":1.563626e-7,"teacher_disagreement_score":0.9664534,"about_ca_system_score_codex":0.000031083837,"about_ca_system_score_gemma":0.00007694588,"threshold_uncertainty_score":0.5371792},"labels":[],"label_agreement":null},{"id":"W2105439786","doi":"10.1109/tsmcb.2009.2032528","title":"Solving Multiconstraint Assignment Problems Using Learning Automata","year":2009,"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":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Universitetet i Oslo","keywords":"Set (abstract data type); Computer science; Class (philosophy); Theoretical computer science; Constraint (computer-aided design); Automaton; Artificial intelligence; Algorithm; Information retrieval; Mathematics; Programming language","score_opus":0.03392984717873745,"score_gpt":0.25925422343491816,"score_spread":0.2253243762561807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105439786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067642466,0.00025760802,0.98671263,0.00041410624,0.00080483494,0.00087284384,0.000008593312,0.00048443614,0.0036806904],"genre_scores_gemma":[0.9839025,0.0003989516,0.012432636,0.00019068627,0.00007892995,0.000041922114,0.0000035053372,0.00003878118,0.0029120839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656165,0.00033758808,0.0007769966,0.0008217356,0.00074853364,0.0007534718],"domain_scores_gemma":[0.99831384,0.00014198081,0.00024928516,0.000689282,0.00017076654,0.00043484027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000656887,0.00044075327,0.00044385708,0.00030429658,0.00057148124,0.00088591146,0.0005655058,0.00021650128,0.000039807306],"category_scores_gemma":[0.000011768788,0.0004407155,0.0001294353,0.0004019944,0.00015417587,0.00035131126,0.000015544536,0.00061315286,0.000072461655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012086288,0.0005068597,0.000055691507,0.0000997003,0.000091920825,0.00002666758,0.0025819011,0.94013745,0.0029786974,0.008413772,0.00018660801,0.04490867],"study_design_scores_gemma":[0.0010335983,0.00051991694,0.00011053482,0.00036658815,0.00004083524,0.00011140206,0.00023642137,0.98994553,0.0011548966,0.00022062093,0.0056994525,0.0005601798],"about_ca_topic_score_codex":0.00009969933,"about_ca_topic_score_gemma":0.000014855294,"teacher_disagreement_score":0.9771383,"about_ca_system_score_codex":0.00015494335,"about_ca_system_score_gemma":0.000101080666,"threshold_uncertainty_score":0.99980444},"labels":[],"label_agreement":null},{"id":"W2105687001","doi":"10.1007/978-3-642-13731-0_1","title":"Optimal Exploration of Terrains with Obstacles","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Terrain; Computer science; Point (geometry); Artificial intelligence; Computer vision; Mobile robot; Robot; Convex hull; Trajectory; Regular polygon; Algorithm; Mathematics; Geography; Geometry; Cartography","score_opus":0.02995620708004124,"score_gpt":0.2577156093518895,"score_spread":0.22775940227184824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105687001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008535238,0.000053630385,0.99546546,0.00081495714,0.00044982866,0.00034202376,0.0000033097294,0.00009494692,0.002690481],"genre_scores_gemma":[0.056040157,0.000033070242,0.94311315,0.00033935384,0.00012083351,0.000008391478,0.0000064573587,0.000023298653,0.0003152933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974043,0.000024036945,0.00038885305,0.0008751907,0.00091609336,0.00039156427],"domain_scores_gemma":[0.99802125,0.00017777369,0.0002731613,0.0009977587,0.000395473,0.00013457719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005363522,0.0003152006,0.00035033197,0.0006690718,0.00015875896,0.0003221816,0.0020663925,0.00023258266,0.000028658362],"category_scores_gemma":[0.000047443627,0.00025202625,0.0000616507,0.00051158044,0.0008885846,0.0013105433,0.00059703947,0.0006833309,0.000012223875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001544902,0.0000712986,0.000045073757,0.00006737627,0.000016455951,0.00004604792,0.004837013,0.5266239,0.0014625821,0.060273815,0.00000990364,0.40653107],"study_design_scores_gemma":[0.00047280555,0.00057319144,0.00005038755,0.00037541564,0.000006068509,0.00004028079,7.08485e-7,0.93200874,0.009324643,0.054738447,0.0017257794,0.0006835468],"about_ca_topic_score_codex":0.000010403264,"about_ca_topic_score_gemma":0.00009347769,"teacher_disagreement_score":0.40584752,"about_ca_system_score_codex":0.000070076734,"about_ca_system_score_gemma":0.0005677156,"threshold_uncertainty_score":0.9999932},"labels":[],"label_agreement":null},{"id":"W2105783854","doi":"10.1007/s00446-015-0248-5","title":"Getting close without touching: near-gathering for autonomous mobile robots","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mobile robot; Robot; Computer science; Human–computer interaction; Artificial intelligence","score_opus":0.03433678672213519,"score_gpt":0.29931038085304124,"score_spread":0.26497359413090604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105783854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034022663,0.000088905195,0.96347797,0.00030500712,0.0003677686,0.0005402386,0.000014625724,0.00068460417,0.00049824105],"genre_scores_gemma":[0.7124917,7.695915e-7,0.28709218,0.00015502083,0.000109499786,0.00002909895,0.00006517993,0.000019444225,0.000037121215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981133,0.00009052849,0.00039095507,0.00051013037,0.0002875182,0.0006076066],"domain_scores_gemma":[0.99858254,0.00015704361,0.00018278841,0.00048242928,0.00030768762,0.00028753543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072006,0.00019999486,0.00024931255,0.00005858792,0.00044892984,0.0007510396,0.0008674082,0.00007843703,0.000002935116],"category_scores_gemma":[0.00021287755,0.0002037771,0.00009287671,0.0004195844,0.000040683,0.000370164,0.00036752777,0.00020496105,0.000021186983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008386176,0.000082841325,0.0016118496,0.000029705918,0.000026521462,0.000007575644,0.0023484933,0.92614746,0.0002685127,0.0085304715,0.0007634101,0.060174763],"study_design_scores_gemma":[0.00076488825,0.00011927669,0.0001443379,0.00004034642,0.0000044991284,0.000013669045,0.00013747653,0.9906602,0.00038771125,0.0010749956,0.0063876477,0.00026494026],"about_ca_topic_score_codex":0.000025262592,"about_ca_topic_score_gemma":0.0000014362304,"teacher_disagreement_score":0.678469,"about_ca_system_score_codex":0.00014666456,"about_ca_system_score_gemma":0.0002320579,"threshold_uncertainty_score":0.8309789},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.058927334232751656,"score_gpt":0.2637952815795497,"score_spread":0.20486794734679803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108234048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001211182,0.000049628175,0.73522484,0.029438972,0.00014550152,0.00035368538,0.0000013710428,0.00019177805,0.23338301],"genre_scores_gemma":[0.940359,0.000012923217,0.032738455,0.007032581,0.000033928474,0.00001744536,0.000004065752,0.000007952165,0.019793648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990873,0.00005031634,0.00011713458,0.00019239476,0.00022381247,0.00032905876],"domain_scores_gemma":[0.99937934,0.00004161422,0.000021099368,0.00029398035,0.0000713423,0.00019259714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021144496,0.0000790566,0.00006383307,0.000078065066,0.0006621665,0.00015737463,0.00061347085,0.000041644573,0.00014181592],"category_scores_gemma":[0.000007089857,0.00004907797,0.000028882028,0.00032833463,0.00006393043,0.00020149184,0.00006275765,0.00013865631,0.0001110577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014658376,0.00001787318,0.0010937023,0.000002928433,0.000021998138,0.000034755474,0.0061585475,0.64893633,0.0000139143895,0.30790168,0.03282898,0.0029878062],"study_design_scores_gemma":[0.00030782097,0.000039207105,0.0033421426,0.000009694036,0.0000015040448,0.00006916778,0.00017234145,0.9004154,0.00003818339,0.004739662,0.09064132,0.00022351462],"about_ca_topic_score_codex":0.055979393,"about_ca_topic_score_gemma":0.08172103,"teacher_disagreement_score":0.93914783,"about_ca_system_score_codex":0.000086359054,"about_ca_system_score_gemma":0.0006001842,"threshold_uncertainty_score":0.9503069},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022965798842747593,"score_gpt":0.25349352982921325,"score_spread":0.23052773098646565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108540055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05129623,0.0018930659,0.94184315,0.00055370823,0.0005961871,0.00078258384,0.000015128174,0.0003222757,0.0026976569],"genre_scores_gemma":[0.9855049,0.0029538753,0.0035212175,0.00012556913,0.000073887524,0.000077405246,0.000006118907,0.00004658327,0.0076904166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972365,0.00031118002,0.0006257269,0.0008042518,0.00043910125,0.000583273],"domain_scores_gemma":[0.9984687,0.00025219025,0.00019651071,0.000480008,0.00015423654,0.00044836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053631194,0.00043689102,0.0005992926,0.00022798362,0.0004976093,0.001036061,0.0003889365,0.00021689311,0.000028435463],"category_scores_gemma":[0.00001181324,0.00038849693,0.00007524486,0.0003438111,0.0002973577,0.00025175003,0.00003057954,0.00057979324,0.000028453609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050458865,0.003141061,0.009204567,0.001080257,0.0016994405,0.00024320044,0.059541192,0.11512264,0.0046360893,0.060131706,0.0035983115,0.741097],"study_design_scores_gemma":[0.0028547815,0.001014602,0.00047482087,0.0003291614,0.000071150396,0.00035343063,0.0017607566,0.89464146,0.00094031263,0.00038793698,0.096227266,0.0009443009],"about_ca_topic_score_codex":0.00018517111,"about_ca_topic_score_gemma":0.00006895803,"teacher_disagreement_score":0.93832195,"about_ca_system_score_codex":0.000039162504,"about_ca_system_score_gemma":0.000040191608,"threshold_uncertainty_score":0.9998567},"labels":[],"label_agreement":null},{"id":"W2108990830","doi":"10.1016/j.ic.2010.09.005","title":"Optimality and competitiveness of exploring polygons by mobile robots","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Mobile robot; Focus (optics); Robot; Trajectory; Computer science; Boundary (topology); Metric (unit); Square (algebra); Point (geometry); Convex polygon; Computer vision; Artificial intelligence; Algorithm; Mathematics; Regular polygon; Geometry; Engineering","score_opus":0.01863673248393834,"score_gpt":0.2608629734210505,"score_spread":0.24222624093711217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108990830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23803557,0.000014630588,0.7608501,0.00015799025,0.00008917443,0.00012458129,0.000004515401,0.00004770486,0.0006757469],"genre_scores_gemma":[0.9599159,0.000042757132,0.039875295,0.000094464725,0.000005386328,0.000031136347,0.000024983236,0.0000016206643,0.000008459363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949694,0.000023150593,0.00020385718,0.000073759016,0.00012572193,0.00007655099],"domain_scores_gemma":[0.9995978,0.00004833888,0.00009288069,0.00007424632,0.000128778,0.000057948553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019385075,0.000054989432,0.00007411581,0.00008222977,0.00008575377,0.00013606618,0.00008496087,0.000027867136,0.000009514292],"category_scores_gemma":[0.000014459373,0.000054292734,0.00001044234,0.00013679237,0.000046729925,0.0020503758,0.00007058947,0.00007403917,0.0000036475824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015786505,0.00008867019,0.005527451,0.00016903902,0.000017700533,4.0237148e-7,0.008776342,0.063925594,0.0022681057,0.12738277,0.00014255993,0.7916856],"study_design_scores_gemma":[0.00048711157,0.00007413991,0.015117906,0.000014262495,0.0000018218398,0.000009573546,0.00024167655,0.97933954,0.0019559711,0.0005413324,0.002101244,0.000115417606],"about_ca_topic_score_codex":0.000024006562,"about_ca_topic_score_gemma":0.0000021369515,"teacher_disagreement_score":0.915414,"about_ca_system_score_codex":0.0000042433885,"about_ca_system_score_gemma":0.000020885831,"threshold_uncertainty_score":0.22139935},"labels":[],"label_agreement":null},{"id":"W2109827459","doi":"10.5555/1496770.1496845","title":"Scalably scheduling processes with arbitrary speedup curves","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Speedup; Computer science; Scheduling (production processes); Parallel computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.014995589229568347,"score_gpt":0.24497026472642597,"score_spread":0.22997467549685763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109827459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001350842,0.00047628678,0.9114103,0.0115534635,0.000027046728,0.00017424488,2.386908e-7,0.00040086213,0.07460672],"genre_scores_gemma":[0.20520231,0.0004544628,0.78167623,0.009907371,0.000036912068,0.0000053846643,0.0000030022702,0.0000064467404,0.0027078632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991788,0.000017890034,0.00010822906,0.00023265115,0.00025642666,0.00020598574],"domain_scores_gemma":[0.9994575,0.000033954264,0.000028825918,0.00022542628,0.00015576121,0.000098529126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012688983,0.00008365778,0.00008458127,0.00006160345,0.00007995436,0.00017726925,0.00042921578,0.000021353135,0.00006237025],"category_scores_gemma":[0.000047501573,0.000057962236,0.000013370077,0.0006589623,0.000023896957,0.0008179457,0.00003639716,0.000087975954,0.000051294777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006897222,0.0017221784,0.008769945,0.0017619577,0.0000953368,0.00016847446,0.0024288902,0.04187235,0.0013942423,0.7994339,0.024387123,0.11789666],"study_design_scores_gemma":[0.004257904,0.0037492055,0.0120646935,0.0040476224,0.000032168708,0.00035804874,0.00042804022,0.8694082,0.031213092,0.05561746,0.015759032,0.0030645607],"about_ca_topic_score_codex":0.0000035730188,"about_ca_topic_score_gemma":0.000003905332,"teacher_disagreement_score":0.8275358,"about_ca_system_score_codex":0.0000068485124,"about_ca_system_score_gemma":0.00023311326,"threshold_uncertainty_score":0.23636314},"labels":[],"label_agreement":null},{"id":"W2110483583","doi":"10.1287/opre.2015.1349","title":"Technical Note—Trading Off Quick versus Slow Actions in Optimal Search","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterative deepening depth-first search; Set (abstract data type); Search algorithm; Order (exchange); Computer science; Beam stack search; Search engine; Search problem; Search cost; Linear search; Best-first search; Beam search; Algorithm; Information retrieval; Economics","score_opus":0.2697715929038695,"score_gpt":0.4593099383107204,"score_spread":0.18953834540685094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110483583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012261606,0.00012715801,0.91698426,0.01862567,0.00043320746,0.0010947853,0.000007859181,0.00025738214,0.05020805],"genre_scores_gemma":[0.71812177,0.00008325345,0.277724,0.000051804444,0.00011084504,0.0001950387,0.000019642637,0.000019091598,0.0036745826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966734,0.00062389305,0.000291679,0.00048729376,0.0012223823,0.0007013715],"domain_scores_gemma":[0.9978011,0.00031030952,0.000008331345,0.00068256306,0.00079523097,0.00040243354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003321874,0.00011152569,0.00013939201,0.0008389642,0.00053361175,0.0008031879,0.0011149109,0.00012437775,0.000118129414],"category_scores_gemma":[0.00083314616,0.00010954267,0.00004032931,0.002724499,0.00019545337,0.0011677494,0.0005656601,0.0009825297,0.00050024944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012314573,0.00073749595,0.00024151952,0.000015130888,0.0000118476855,0.00006882645,0.0048533864,0.69424736,0.0061714347,0.24035588,0.01750903,0.03566493],"study_design_scores_gemma":[0.0010615411,0.00027231875,0.0001471874,0.00001484991,6.946721e-7,0.00001080706,0.00037017497,0.987769,0.00052075554,0.000095598305,0.009603978,0.00013305695],"about_ca_topic_score_codex":0.00038684995,"about_ca_topic_score_gemma":0.0008322579,"teacher_disagreement_score":0.70586014,"about_ca_system_score_codex":0.0005187173,"about_ca_system_score_gemma":0.0013727364,"threshold_uncertainty_score":0.7745159},"labels":[],"label_agreement":null},{"id":"W2111339397","doi":"10.1007/s00453-010-9420-2","title":"Nonclairvoyant Speed Scaling for Flow and Energy","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Pittsburgh; National Science Foundation","keywords":"Competitive analysis; Scaling; Function (biology); Theory of computation; Mathematics; Energy (signal processing); Constant (computer programming); Power function; Combinatorics; Power (physics); Flow (mathematics); Power flow; Algorithm; Mathematical analysis; Physics; Computer science; Geometry; Electric power system; Statistics; Upper and lower bounds; Thermodynamics","score_opus":0.009830635981841078,"score_gpt":0.2407282012606789,"score_spread":0.2308975652788378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111339397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007089385,0.000022972763,0.9958364,0.0017087294,0.00039896814,0.00007229512,0.0000039878228,0.00009515117,0.0011525962],"genre_scores_gemma":[0.044978414,0.000017417773,0.9531868,0.0006333993,0.00018971565,0.000013635643,0.000007396645,0.000010893848,0.0009623233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.000013680361,0.0001125658,0.00024029175,0.00011462416,0.00020610463],"domain_scores_gemma":[0.99946517,0.00007961338,0.00002676411,0.00023027221,0.00008440815,0.00011376978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018078616,0.00007355962,0.00008633076,0.000057953446,0.00012833341,0.00014788691,0.0002929831,0.00005198696,0.000017614992],"category_scores_gemma":[0.00003480898,0.00006584004,0.000029288085,0.0001239809,0.000039540333,0.0002002365,0.00011923407,0.00008773855,0.00000686227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039382794,0.00004474324,0.000020126954,0.000010102418,0.0000138826035,0.000004008439,0.00030224415,0.00041783124,0.005181047,0.12602666,0.0016987013,0.86627674],"study_design_scores_gemma":[0.00029765716,0.00003212292,0.000028486877,0.0000032298144,0.0000015883603,0.000010545132,0.000004211718,0.9467324,0.0028959543,0.004088815,0.04580952,0.00009546115],"about_ca_topic_score_codex":0.000020447218,"about_ca_topic_score_gemma":0.000010594351,"teacher_disagreement_score":0.9463146,"about_ca_system_score_codex":0.0000050379176,"about_ca_system_score_gemma":0.000038200516,"threshold_uncertainty_score":0.26848787},"labels":[],"label_agreement":null},{"id":"W2111429343","doi":"10.1109/robot.2004.1307520","title":"Autonomous initialization of robot formations","year":2004,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Robot; Initialization; Computer science; Conductor; Mobile robot; Artificial intelligence; Software deployment; Robot kinematics; Pruning; Computer vision; Simulation; Mathematics","score_opus":0.02606091034358685,"score_gpt":0.269254351191673,"score_spread":0.24319344084808617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111429343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029351003,0.0000049949717,0.9719313,0.0008441896,0.000052785057,0.00007992229,4.1138463e-7,0.00009809573,0.026694821],"genre_scores_gemma":[0.6428858,0.000015440788,0.35659528,0.00027461845,0.0000065166223,0.000005230554,0.0000050625554,0.0000020518023,0.00021001672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996173,0.000010442824,0.00013402793,0.000064248656,0.00010061099,0.000073418356],"domain_scores_gemma":[0.99968624,0.000008886248,0.000034461922,0.00014719531,0.00009209736,0.00003110895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007373349,0.000030205898,0.00004175402,0.000074056596,0.000043645156,0.000038631388,0.00019769688,0.000017487862,0.00004605307],"category_scores_gemma":[0.000011905942,0.000027021053,0.000017290911,0.00026822963,0.000014302953,0.0005173021,0.0000346904,0.00002168157,0.000035558023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2155969e-7,0.00004400022,0.000015910004,0.000003877175,0.0000018132729,1.8038816e-7,0.000732124,0.18421008,0.00010117775,0.81162614,0.000061659324,0.0032028172],"study_design_scores_gemma":[0.0011621129,0.00021603896,0.0009801447,0.000021391403,0.000002780866,0.000008086438,0.00007054439,0.9071556,0.018579375,0.06714977,0.0044544623,0.00019969727],"about_ca_topic_score_codex":0.000019202711,"about_ca_topic_score_gemma":0.0000081446415,"teacher_disagreement_score":0.7444764,"about_ca_system_score_codex":0.000017209375,"about_ca_system_score_gemma":0.00006949064,"threshold_uncertainty_score":0.110188656},"labels":[],"label_agreement":null},{"id":"W2111880148","doi":"10.1007/978-3-642-22212-2_15","title":"Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Bipartite graph; Asynchronous communication; Theoretical computer science; Distributed computing; Computer network; Graph","score_opus":0.01815095563036638,"score_gpt":0.24187740175512792,"score_spread":0.22372644612476156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111880148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021396144,0.0002450123,0.99476784,0.00022600776,0.0004549594,0.00048020764,0.0000012431261,0.0001476077,0.0034631672],"genre_scores_gemma":[0.53446954,0.0001884632,0.4637314,0.0010782839,0.00009359867,0.000022197339,0.000005535723,0.00006860595,0.0003423328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961782,0.00005992223,0.00048559083,0.0014731309,0.0010133238,0.0007898234],"domain_scores_gemma":[0.9979982,0.00011997962,0.00021264554,0.0012437913,0.00019283556,0.00023255494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008708708,0.00048048605,0.00045946543,0.0012498654,0.00018743737,0.00045651183,0.0025496662,0.00026564387,0.000056115805],"category_scores_gemma":[0.000021583171,0.00040097913,0.00008208028,0.0010963845,0.0008375786,0.00080856244,0.0010351693,0.00075254636,0.000048899783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017005957,0.00009209944,0.00029225094,0.000052381863,0.000012218319,0.00035054638,0.002113481,0.28709084,0.000040745825,0.018811945,0.000017414191,0.69110906],"study_design_scores_gemma":[0.0005162102,0.00053783506,0.00046623693,0.0008410181,0.0000037933642,0.000076291275,2.8506165e-7,0.9171524,0.00034722366,0.078724176,0.00065499515,0.00067953835],"about_ca_topic_score_codex":0.000070495415,"about_ca_topic_score_gemma":0.00031300826,"teacher_disagreement_score":0.69042957,"about_ca_system_score_codex":0.0002794923,"about_ca_system_score_gemma":0.00042921517,"threshold_uncertainty_score":0.9998442},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015221881860332234,"score_gpt":0.26273411756851334,"score_spread":0.2475122357081811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114871659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002146554,0.000022520744,0.99484575,0.00053431926,0.00034358652,0.0015205856,0.000049568098,0.00035234223,0.00018477382],"genre_scores_gemma":[0.9789946,0.000004899899,0.019822622,0.00042241745,0.000011259061,0.0006491823,0.0000012421615,0.000016358525,0.00007743846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984767,0.00007546978,0.0005035077,0.00030174982,0.0003062007,0.00033636534],"domain_scores_gemma":[0.99887514,0.00025758005,0.00014334527,0.00043661104,0.00015857971,0.00012875622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000297628,0.00018664698,0.0003628509,0.00019475618,0.00017142722,0.00012720714,0.00047886386,0.000088468776,0.0000869534],"category_scores_gemma":[0.0000059493186,0.00017219248,0.00020575318,0.00025852406,0.000104398474,0.00046564767,0.000001298494,0.000108406195,0.000038326736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026747444,0.00041166926,5.52843e-7,0.000063084735,0.00009969186,0.0000025623212,0.0007287445,0.93694556,0.0005214568,0.009512327,0.00002903053,0.05165857],"study_design_scores_gemma":[0.007054112,0.0006960113,0.000031241776,0.000043524797,0.000039224717,0.0000073012066,0.00016643992,0.98623425,0.0014089587,0.0040361346,0.000112417976,0.0001703923],"about_ca_topic_score_codex":0.00003698292,"about_ca_topic_score_gemma":0.00002917006,"teacher_disagreement_score":0.976848,"about_ca_system_score_codex":0.00011086281,"about_ca_system_score_gemma":0.00036190252,"threshold_uncertainty_score":0.70218056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046450555433268786,"score_gpt":0.29112199498195773,"score_spread":0.24467143954868895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118877434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012679268,0.00025096152,0.9798263,0.0042668427,0.00015122133,0.00022560266,0.000008274761,0.00025855724,0.0023330175],"genre_scores_gemma":[0.07194244,0.00041017082,0.9255467,0.0005331247,0.00021280143,0.000011498966,0.000018592411,0.000021553484,0.0013031077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983335,0.0000851215,0.00022979557,0.0004737741,0.000398934,0.00047884558],"domain_scores_gemma":[0.99913555,0.00008460279,0.000029616844,0.00037469264,0.00010888057,0.00026667936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035002033,0.00015139222,0.00018097165,0.00017439766,0.00020884711,0.00026596905,0.0005877695,0.000075981356,0.000089963265],"category_scores_gemma":[0.00002437209,0.00014914553,0.000044452274,0.00054786965,0.00008969039,0.00055555126,0.00028618233,0.00026390288,0.000043524993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072279736,0.0003524673,0.00021381227,0.000017061659,0.000051095845,0.00010199757,0.0013886291,0.0023729838,0.0003997603,0.01928258,0.0005824047,0.97523],"study_design_scores_gemma":[0.00050188013,0.00013473361,0.0005494249,0.000017024535,0.0000037944528,0.0001024155,0.00006260281,0.991249,0.00040070404,0.0007511341,0.006017497,0.00020973785],"about_ca_topic_score_codex":0.00005342602,"about_ca_topic_score_gemma":0.000005581212,"teacher_disagreement_score":0.98887604,"about_ca_system_score_codex":0.000036768095,"about_ca_system_score_gemma":0.00007451346,"threshold_uncertainty_score":0.6081978},"labels":[],"label_agreement":null},{"id":"W2119064581","doi":"","title":"The optimal searcher path problem with a visibility criterion in discrete time and space","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Mathematical optimization; Path (computing); Visibility; Discretization; Motion planning; Any-angle path planning; Computer science; Grid; Object (grammar); Integer programming; Mathematics; Algorithm; Topology (electrical circuits); Artificial intelligence","score_opus":0.009406986349011976,"score_gpt":0.2568604366521286,"score_spread":0.24745345030311663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119064581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07919849,0.00013367519,0.8381141,0.05412898,0.000020573247,0.0013214312,0.000001733303,0.00027618202,0.026804876],"genre_scores_gemma":[0.6479871,0.00005986434,0.3448104,0.0005052598,0.00001225517,0.000015338213,0.000001808687,0.0000071458194,0.006600846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990007,0.00012297499,0.00011792039,0.00028154394,0.00021743287,0.00025938882],"domain_scores_gemma":[0.99947435,0.000058670863,0.000021693355,0.00030006608,0.00005772029,0.00008751657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070672727,0.00008231937,0.00008061808,0.000037767943,0.00012151975,0.00037784816,0.0002830037,0.00002618505,0.000023041373],"category_scores_gemma":[0.00001771507,0.000044388147,0.000012419756,0.0002915391,0.00006792577,0.00044089177,0.000113340764,0.00012721324,0.000012503087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063223054,0.00095157936,0.012673707,0.00009584039,0.000054587355,0.00013210933,0.019708594,0.03355645,0.005966786,0.54807454,0.0048827003,0.37327087],"study_design_scores_gemma":[0.0005123847,0.00050799263,0.012387156,0.000026476084,8.0985353e-7,0.000010059883,0.000044297907,0.98236585,0.00012619345,0.002838997,0.0010359283,0.00014388307],"about_ca_topic_score_codex":0.000033339973,"about_ca_topic_score_gemma":0.000028139126,"teacher_disagreement_score":0.9488094,"about_ca_system_score_codex":0.000023885714,"about_ca_system_score_gemma":0.00005581823,"threshold_uncertainty_score":0.36435986},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014311499595550056,"score_gpt":0.2694103437007924,"score_spread":0.25509884410524236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119251691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024694527,0.000012554125,0.96811754,0.0018738309,0.00025767795,0.00017564684,0.0000013336187,0.000169112,0.00469776],"genre_scores_gemma":[0.7265413,0.000008162863,0.272785,0.0006307288,0.000023977063,0.0000026729235,0.0000010329493,0.0000042253128,0.0000029097043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975571,0.00008785476,0.0003064604,0.0006554699,0.00072674,0.0006663959],"domain_scores_gemma":[0.99879444,0.00018002558,0.000053231834,0.00050927437,0.0002024863,0.0002605336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001430493,0.0001490097,0.00018666727,0.00083266833,0.0002522944,0.00038345324,0.0021413653,0.000042191536,0.000024185987],"category_scores_gemma":[0.00016796814,0.0001282851,0.00004810982,0.0061792214,0.0015336152,0.0007845749,0.0009841003,0.0002872534,0.00005779909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017631435,0.00013425159,0.00014264049,0.0000024046929,0.0000010269862,0.000017828621,0.00038028465,0.0074677,0.000063398285,0.98100233,0.0000015005292,0.0107848635],"study_design_scores_gemma":[0.00080007606,0.00023548388,0.005271269,0.00006688098,0.0000010395902,0.00003071594,0.00002295338,0.6282299,0.0010365372,0.3639921,0.00004008141,0.0002729342],"about_ca_topic_score_codex":0.000014566897,"about_ca_topic_score_gemma":0.000006099002,"teacher_disagreement_score":0.7018468,"about_ca_system_score_codex":0.00013025859,"about_ca_system_score_gemma":0.0002126587,"threshold_uncertainty_score":0.5650669},"labels":[],"label_agreement":null},{"id":"W2120954276","doi":"10.1016/j.tcs.2010.03.014","title":"Randomized priority algorithms","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Randomized algorithm; Job shop scheduling; Class (philosophy); Approximation algorithm; Computer science; Scheduling (production processes); Algorithm; Context (archaeology); Deterministic algorithm; Mathematical optimization; Mathematics; Schedule; Artificial intelligence","score_opus":0.010635678378934522,"score_gpt":0.2768811115611415,"score_spread":0.26624543318220695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120954276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050280876,0.0000051908246,0.97936934,0.0025692475,0.0013645734,0.00032940516,4.444442e-7,0.0003329505,0.011000743],"genre_scores_gemma":[0.54095054,0.000003349431,0.45842573,0.0004853396,0.0000985989,0.000008974416,2.910572e-7,0.0000038693634,0.000023271821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974248,0.0001944275,0.00029781205,0.0006582314,0.000851386,0.0005733572],"domain_scores_gemma":[0.99780357,0.00044880252,0.00006079729,0.0009322286,0.00033451113,0.0004201014],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0050887577,0.00015482596,0.00029232347,0.00019016868,0.00045501642,0.0008011068,0.0029953148,0.00006264178,0.00014820308],"category_scores_gemma":[0.00039757555,0.00011354951,0.00009815667,0.0011467709,0.005248009,0.0008621216,0.0011273529,0.00044286557,0.0001691323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008075407,0.000038712544,0.0000046574155,0.0000018624537,0.000002114128,0.000003827153,0.0002383207,0.00006255174,0.0004837177,0.97268736,0.00002481563,0.026371293],"study_design_scores_gemma":[0.008871719,0.000033274842,0.00003302364,0.0000036072022,0.0000016106156,0.000022113993,7.2641876e-7,0.780111,0.001253579,0.20933512,0.00019358765,0.0001406546],"about_ca_topic_score_codex":0.0000029152145,"about_ca_topic_score_gemma":5.555229e-7,"teacher_disagreement_score":0.78004843,"about_ca_system_score_codex":0.000017553897,"about_ca_system_score_gemma":0.00020689807,"threshold_uncertainty_score":0.9974591},"labels":[],"label_agreement":null},{"id":"W2121154134","doi":"10.1142/s0218195901000559","title":"LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Metric (unit); Simple (philosophy); Online algorithm; Line (geometry); Cross-ratio; Discrete mathematics; Mathematical optimization; Statistics; Geometry; Mathematical analysis; Pure mathematics","score_opus":0.019899946799461558,"score_gpt":0.31829916885142107,"score_spread":0.2983992220519595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121154134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00737675,0.00031084218,0.986402,0.004507915,0.00032708823,0.00035042374,0.000030466428,0.000036544,0.0006580022],"genre_scores_gemma":[0.5926896,0.0002523635,0.40487334,0.0009903321,0.0006065032,0.000114029936,0.000065382155,0.000016493781,0.0003919657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821305,0.00003934638,0.0005815586,0.00024205366,0.00074003823,0.00018396424],"domain_scores_gemma":[0.9969447,0.00037158353,0.0003969308,0.00016151942,0.0019489581,0.00017629097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040792357,0.00013538374,0.00018143172,0.00056911807,0.00015595109,0.00036424657,0.000953624,0.0000563361,0.00006090362],"category_scores_gemma":[0.000058795085,0.00013157101,0.00012715206,0.00048589846,0.00007355274,0.0006593656,0.00013786247,0.00013799821,0.000011917532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014307456,0.00074875,0.0025233408,0.000022316914,0.00047951195,0.00002823714,0.000210171,0.21467572,0.00024933994,0.46607384,0.004169438,0.31067625],"study_design_scores_gemma":[0.0037206016,0.00032772307,0.0065631373,0.00004711333,0.00003299207,0.0006827855,0.000049783295,0.22724149,0.0001026139,0.27143183,0.48938462,0.00041529597],"about_ca_topic_score_codex":0.0000035677367,"about_ca_topic_score_gemma":0.0000024095195,"teacher_disagreement_score":0.58531284,"about_ca_system_score_codex":0.00007838957,"about_ca_system_score_gemma":0.00020095815,"threshold_uncertainty_score":0.53653103},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013258734075760496,"score_gpt":0.24577319728864783,"score_spread":0.23251446321288732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121824931","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113837235,0.010078613,0.34787226,0.4983054,0.004406411,0.0056458875,0.00021818104,0.0018595414,0.017776486],"genre_scores_gemma":[0.9826557,0.00046559965,0.0145842675,0.00095916784,0.000039062223,0.000036402667,0.000007272586,0.000015849546,0.0012366837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786377,0.00009151358,0.00044620273,0.00041587467,0.000618178,0.0005644483],"domain_scores_gemma":[0.9973584,0.00014228595,0.00045278188,0.0017292278,0.0002547177,0.00006257741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061622355,0.00025535116,0.00033867525,0.00015051191,0.00091709796,0.00014762107,0.0032548935,0.00024399857,0.000020987925],"category_scores_gemma":[0.00026369866,0.0001348756,0.00017578375,0.0013801317,0.0015601899,0.00042120594,0.00083239697,0.00048460733,0.000008069427],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004479499,0.00032346236,0.02198905,0.000051219227,0.00034920755,0.000025644616,0.0017823942,0.00269603,0.0045884433,0.5117404,0.024724802,0.43168455],"study_design_scores_gemma":[0.0020801774,0.00026815533,0.0041268207,0.00016216621,0.000058363436,0.000053576932,0.00034300965,0.05508412,0.07892814,0.025607672,0.8327128,0.00057497784],"about_ca_topic_score_codex":0.00004413456,"about_ca_topic_score_gemma":0.00013577048,"teacher_disagreement_score":0.86881846,"about_ca_system_score_codex":0.00010044989,"about_ca_system_score_gemma":0.00019192617,"threshold_uncertainty_score":0.7053669},"labels":[],"label_agreement":null},{"id":"W2122684646","doi":"10.1016/j.comgeo.2011.12.005","title":"Memoryless routing in convex subdivisions: Random walks are optimal","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Vertex (graph theory); Subdivision; Regular polygon; Mathematics; Routing (electronic design automation); Discrete mathematics; Computer science; Graph","score_opus":0.04721833308990548,"score_gpt":0.26880988363864333,"score_spread":0.22159155054873786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122684646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03974634,0.000069650516,0.95591927,0.0002680955,0.00024352057,0.00022614452,0.0000037474626,0.00013075685,0.003392488],"genre_scores_gemma":[0.8483044,0.000007255152,0.15106368,0.00037382837,0.00002627995,0.000015818136,0.0000142315275,0.000009421355,0.00018507901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983384,0.00014110946,0.00037329018,0.00040397278,0.0004269841,0.0003162139],"domain_scores_gemma":[0.99891233,0.00035353124,0.00013305683,0.00025189886,0.00021908335,0.0001300939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007448742,0.00013724917,0.00022215582,0.00047714554,0.00013841834,0.00012415198,0.00067042495,0.00006890113,0.0002972569],"category_scores_gemma":[0.0002041141,0.0001373306,0.00006443457,0.0011439563,0.00006211683,0.00049658417,0.00029908115,0.00021803794,0.00023952944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010507415,0.00083411136,0.05966558,0.000072404684,0.000076777396,0.00019729607,0.0064680306,0.70671225,0.00002707428,0.19387388,0.0021409185,0.02982659],"study_design_scores_gemma":[0.0017391273,0.00002907687,0.069939405,0.000046527264,0.0000020397504,0.000014715153,0.00017117122,0.9220565,0.000048361297,0.005637407,0.00011006943,0.00020557766],"about_ca_topic_score_codex":0.000022332433,"about_ca_topic_score_gemma":0.0000031139323,"teacher_disagreement_score":0.80855805,"about_ca_system_score_codex":0.00004878152,"about_ca_system_score_gemma":0.0001029969,"threshold_uncertainty_score":0.56001794},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020456454354735594,"score_gpt":0.28159667870495475,"score_spread":0.26114022435021916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123976299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004361969,0.000001981799,0.8846697,0.010424108,0.00006267878,0.00010720003,8.958118e-8,0.00019606481,0.10410198],"genre_scores_gemma":[0.5800691,0.000001612463,0.4028201,0.012883063,0.000019889545,0.00000564708,6.421515e-7,0.0000033623978,0.0041965675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928766,0.000026942915,0.00010053955,0.00020874948,0.00019060676,0.00018550233],"domain_scores_gemma":[0.9994917,0.000035932477,0.000014385029,0.00029842195,0.000041042786,0.000118515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017544252,0.000061241655,0.00006236333,0.000068459565,0.00006812274,0.00015060963,0.00047434805,0.000020610525,0.000078348385],"category_scores_gemma":[0.000049175265,0.00005020265,0.000019704032,0.00033954828,0.000004490877,0.0001738826,0.00006519855,0.000055841407,0.00028440717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026658322,0.000058168833,0.0000102914,0.0000013659575,0.000001654767,0.0000028663749,0.00038042373,0.031911608,0.00023272996,0.84232867,0.0050674593,0.120002076],"study_design_scores_gemma":[0.0008490082,0.00097224454,0.0021454433,0.000046627858,0.0000013785303,0.000008033446,0.00006173433,0.90574723,0.004440978,0.076887295,0.008312789,0.00052725413],"about_ca_topic_score_codex":0.0000067304977,"about_ca_topic_score_gemma":0.0000020171058,"teacher_disagreement_score":0.8738356,"about_ca_system_score_codex":0.000017084833,"about_ca_system_score_gemma":0.000021814134,"threshold_uncertainty_score":0.36555737},"labels":[],"label_agreement":null},{"id":"W2124402683","doi":"10.1145/2229163.2229172","title":"Scalably scheduling processes with arbitrary speedup curves","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Speedup; Scheduling (production processes); Computer science; Parallel computing; Algorithm; Mathematics; Mathematical optimization","score_opus":0.03193889738509934,"score_gpt":0.2722814381290204,"score_spread":0.24034254074392106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124402683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000547256,0.00065165514,0.99301654,0.0034200044,0.00023840881,0.0002596128,0.0000061108335,0.00036016907,0.0015002472],"genre_scores_gemma":[0.12685293,0.0009926329,0.8694719,0.0016952883,0.00008897529,0.000076767996,0.0000054654915,0.000027499911,0.00078851124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985645,0.00005382113,0.00018644502,0.000306451,0.00043565859,0.00045316995],"domain_scores_gemma":[0.9987359,0.00016426865,0.00005163692,0.00062855246,0.00016857474,0.00025103646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500429,0.00017618896,0.00014923136,0.00016501108,0.00027635696,0.00013180064,0.0007389693,0.00005917541,0.00013222403],"category_scores_gemma":[0.00004940868,0.00014220456,0.00004514128,0.0010389474,0.00006908988,0.0015707728,0.0000145312915,0.00029657976,0.00015711138],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011506997,0.0057571945,0.002023934,0.002197348,0.0005560522,0.00004939233,0.0064930078,0.069265306,0.00043821323,0.008478162,0.0010539482,0.9035724],"study_design_scores_gemma":[0.017248878,0.0073086666,0.017575229,0.011117856,0.000655138,0.0023116316,0.00399614,0.7216121,0.12164743,0.016433977,0.06826883,0.011824118],"about_ca_topic_score_codex":0.000014465931,"about_ca_topic_score_gemma":0.0000054882357,"teacher_disagreement_score":0.89174825,"about_ca_system_score_codex":0.000030805644,"about_ca_system_score_gemma":0.00020709424,"threshold_uncertainty_score":0.57989335},"labels":[],"label_agreement":null},{"id":"W2124571279","doi":"10.1109/icis.2007.87","title":"Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Network topology; Visibility; Computer science; Computer network; Distributed computing; Mobile computing; Mobile agent; Topology (electrical circuits); Mathematics","score_opus":0.02216368570263773,"score_gpt":0.28998584504371383,"score_spread":0.2678221593410761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124571279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25346237,0.000012798328,0.7422395,0.0000060934085,0.000023133674,0.00018987911,3.1384363e-7,0.000026544954,0.0040394147],"genre_scores_gemma":[0.82855433,0.000004149697,0.17131466,0.000057926944,0.0000051695843,0.0000016276381,0.0000017972823,0.000003028957,0.00005734035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991838,0.000039551156,0.00026880213,0.00016301773,0.00020201688,0.00014283092],"domain_scores_gemma":[0.99928606,0.00007476953,0.00012058749,0.00025952206,0.00020437206,0.000054671436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485287,0.00005820731,0.000114188035,0.00010693936,0.000028725002,0.000016127553,0.00021839667,0.000039388757,0.000035938163],"category_scores_gemma":[0.0000148112595,0.00004606795,0.000026037416,0.0005052242,0.000043039865,0.00030805214,0.00006613308,0.00005857801,5.063019e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020556615,0.0021841126,0.11945621,0.0002268301,0.00013685098,0.000013048773,0.005443971,0.68968886,0.004847903,0.02878338,0.00039441834,0.14861885],"study_design_scores_gemma":[0.0002970175,0.0001840212,0.0144279795,0.000021697511,0.000002430521,0.000002116192,0.00005687678,0.98037046,0.004453827,0.000103202314,0.000024526173,0.00005581905],"about_ca_topic_score_codex":0.00004320805,"about_ca_topic_score_gemma":0.000039789793,"teacher_disagreement_score":0.57509196,"about_ca_system_score_codex":0.000024237072,"about_ca_system_score_gemma":0.00004951634,"threshold_uncertainty_score":0.18785965},"labels":[],"label_agreement":null},{"id":"W2126261522","doi":"10.1145/1367497.1367719","title":"Offline matching approximation algorithms in exchange markets","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristics; Matching (statistics); Computer science; Approximation algorithm; Probabilistic logic; Algorithm; Online and offline; Online algorithm; Foreign exchange market; Artificial intelligence; Foreign exchange; Economics; Mathematics","score_opus":0.03528139091037791,"score_gpt":0.2620805598819794,"score_spread":0.22679916897160152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126261522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034424833,0.000030522566,0.97244287,0.0012128401,0.00007442114,0.0001503986,3.0092002e-7,0.00013351472,0.022512669],"genre_scores_gemma":[0.18635045,0.0001733675,0.8071232,0.00074429763,0.00004149505,0.00002882173,0.000008012831,0.000008327984,0.0055220597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923503,0.00005880812,0.0001527944,0.00018411173,0.00019812664,0.00017112236],"domain_scores_gemma":[0.9996577,0.000031224787,0.00002717724,0.00019344816,0.00003920102,0.000051268104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033110005,0.0000610017,0.00007448879,0.00014150867,0.0000651993,0.000042616513,0.00027652897,0.000030766394,0.0001295102],"category_scores_gemma":[0.000014970989,0.000054071475,0.000017641116,0.00037750468,0.000014755031,0.00054028607,0.00011696781,0.00007732023,0.000063597035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002685834,0.00093692547,0.0038948155,0.00018056245,0.000023859739,0.00024318222,0.024850434,0.019643862,0.00093643117,0.15453126,0.014221979,0.7805098],"study_design_scores_gemma":[0.00035547325,0.000015564636,0.0052383905,0.000008734432,1.8922972e-7,0.000020667021,0.000015967034,0.9910342,0.00017049845,0.0017929818,0.0012513761,0.00009595186],"about_ca_topic_score_codex":0.000041725212,"about_ca_topic_score_gemma":0.000013142009,"teacher_disagreement_score":0.97139037,"about_ca_system_score_codex":0.000025036994,"about_ca_system_score_gemma":0.000027248936,"threshold_uncertainty_score":0.22049707},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02765532918134312,"score_gpt":0.27859192003920896,"score_spread":0.25093659085786585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127104083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01525009,0.000007936883,0.98244125,0.0013980514,0.00012156417,0.0005123486,0.0000056025465,0.00012847979,0.0001346997],"genre_scores_gemma":[0.641587,0.000034432258,0.3580833,0.00015568963,0.000010655984,0.00004875212,0.0000047583308,0.000009237497,0.0000661802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989615,0.000054440075,0.00024195232,0.00031160438,0.00019432527,0.00023618419],"domain_scores_gemma":[0.999408,0.00009495499,0.000055789373,0.0002307592,0.0001072995,0.00010319399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024062453,0.00013303744,0.00013564616,0.00022824194,0.00022289212,0.00036676205,0.00013410939,0.00007865458,0.000038334278],"category_scores_gemma":[0.000005561971,0.00012001062,0.000029618961,0.00030851006,0.00007726148,0.0010252113,0.0000016593491,0.00013386601,0.000006493202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003690611,0.00017811566,0.000028708282,0.00001446116,0.000007628015,0.000003997049,0.00045300988,0.95149606,0.00008249968,0.002785538,0.000008289167,0.044904802],"study_design_scores_gemma":[0.001206568,0.0004359276,0.0010709021,0.00006527844,0.000007671338,0.00003788181,0.00006825047,0.9962489,0.00031641556,0.00035783375,0.000016460983,0.00016791228],"about_ca_topic_score_codex":0.0000066677476,"about_ca_topic_score_gemma":0.0000634198,"teacher_disagreement_score":0.62633693,"about_ca_system_score_codex":0.000039517112,"about_ca_system_score_gemma":0.0001085969,"threshold_uncertainty_score":0.4893891},"labels":[],"label_agreement":null},{"id":"W2127629365","doi":"10.1016/j.ic.2015.07.005","title":"Position discovery for a system of bouncing robots","year":2015,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Agence Nationale de la Recherche; Royal Society","keywords":"Robot; Position (finance); Computer science; Mobile robot; Point (geometry); Line segment; Artificial intelligence; Constant (computer programming); Task (project management); Computer vision; Line (geometry); Ring (chemistry); Algorithm; Topology (electrical circuits); Mathematics; Geometry; Combinatorics; Engineering","score_opus":0.02835690603338894,"score_gpt":0.26699115665965323,"score_spread":0.23863425062626428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127629365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007302597,0.000014996958,0.99086326,0.00025316185,0.00012969975,0.00023245218,0.0000033154215,0.000069437236,0.0011310646],"genre_scores_gemma":[0.9273192,0.0000019297033,0.07246639,0.00012474904,0.000010845042,0.000014811412,0.00004671376,0.0000015669193,0.000013773004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945414,0.00002177908,0.00023403374,0.000054770808,0.00016707207,0.00006821998],"domain_scores_gemma":[0.9993957,0.000030752883,0.00013490388,0.000058850066,0.00033314846,0.00004661291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030337938,0.00004388071,0.00006744005,0.000106608284,0.000054360633,0.0002207404,0.00007191312,0.000024371993,1.3067526e-7],"category_scores_gemma":[0.000027607572,0.00004112409,0.00001699131,0.00014162537,0.000010873482,0.0030558433,0.000030689196,0.00002051855,0.0000038254375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039306968,0.00002499856,0.00010811262,0.00032303866,0.000013670867,2.0712929e-7,0.0073904945,0.37897646,0.000097953525,0.527002,0.001065934,0.084957875],"study_design_scores_gemma":[0.0005842192,0.00009141733,0.00022778836,0.00003160623,0.0000020179236,0.000007636576,0.0004543272,0.9963929,0.00022484193,0.0016548552,0.00027674533,0.000051638253],"about_ca_topic_score_codex":0.000011710924,"about_ca_topic_score_gemma":7.1956725e-7,"teacher_disagreement_score":0.92001665,"about_ca_system_score_codex":0.000044306573,"about_ca_system_score_gemma":0.00007593094,"threshold_uncertainty_score":0.22154126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011927809311469183,"score_gpt":0.28050205294589786,"score_spread":0.26857424363442867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128105951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004481908,0.00027376786,0.99250114,0.00076473923,0.00035433783,0.00004419719,6.2195807e-7,0.000026236956,0.001553038],"genre_scores_gemma":[0.48011693,0.0005704763,0.51846546,0.00018532491,0.00021686484,5.867049e-7,0.0000020623504,0.000011929713,0.0004303982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856347,0.00015631248,0.0004060304,0.00015622817,0.0005604637,0.00015750134],"domain_scores_gemma":[0.9987565,0.00015045759,0.00033791704,0.00008225547,0.0005559831,0.0001168849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009994061,0.00010758395,0.00015467513,0.00018766536,0.0000893663,0.00031534367,0.0006096053,0.000044952954,0.000032024647],"category_scores_gemma":[0.00021826201,0.00009403254,0.000056771605,0.0001173235,0.000049858587,0.00029676643,0.00021796447,0.00042462122,0.000005814538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012663652,0.00009260042,0.030144397,0.000011844237,0.00015816455,0.00003627183,0.0010752404,0.13540758,0.0003623756,0.019117052,0.000074810116,0.813507],"study_design_scores_gemma":[0.00022033276,0.00014340489,0.0005346833,0.00007344807,0.000008626439,0.0003392555,0.000021362985,0.9844632,0.00016752482,0.0034623055,0.010457263,0.0001085577],"about_ca_topic_score_codex":0.000035288638,"about_ca_topic_score_gemma":0.0000020303528,"teacher_disagreement_score":0.84905565,"about_ca_system_score_codex":0.000040238792,"about_ca_system_score_gemma":0.000051247323,"threshold_uncertainty_score":0.38345358},"labels":[],"label_agreement":null},{"id":"W2128419582","doi":"10.1613/jair.4360","title":"Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Dynamic programming; Schedule; Mathematical optimization; Computation; Acceleration; Scheduling (production processes); Conjecture; Matching (statistics); Algorithm; Class (philosophy); Job shop scheduling; Mathematics; Discrete mathematics","score_opus":0.16732274216625714,"score_gpt":0.4248170278948427,"score_spread":0.25749428572858557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128419582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008919497,0.00013035488,0.98844737,0.0014430837,0.00020563042,0.00035316177,0.0000015625865,0.000015621608,0.00048371794],"genre_scores_gemma":[0.47749558,0.00007257335,0.5221122,0.000022542257,0.00023237447,0.0000059430135,4.2597026e-7,0.000010628531,0.000047742815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658275,0.00039140868,0.0010450083,0.0002484485,0.0011422739,0.00059012225],"domain_scores_gemma":[0.9942555,0.0014945632,0.00040016606,0.00030846297,0.0032919357,0.00024936488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011183342,0.00011721062,0.00033577814,0.00061727705,0.00024607708,0.0003285653,0.0013465642,0.000095487994,0.000051600215],"category_scores_gemma":[0.0021183991,0.00009762182,0.00017698035,0.00084028166,0.00021437445,0.0007761155,0.00019438445,0.0005977102,0.000019851772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001787214,0.00046001447,0.000080295686,0.00011766212,0.00006964593,0.000010921738,0.002680016,0.25307906,0.030629601,0.17229244,0.00019680326,0.5402048],"study_design_scores_gemma":[0.00008729207,0.001091472,0.000018275701,0.00012975374,0.0000037833863,0.000020662814,0.00029175964,0.9135448,0.060250655,0.023869814,0.0005899808,0.00010177958],"about_ca_topic_score_codex":0.000021285703,"about_ca_topic_score_gemma":0.000004366805,"teacher_disagreement_score":0.6604657,"about_ca_system_score_codex":0.000069911584,"about_ca_system_score_gemma":0.00044262956,"threshold_uncertainty_score":0.39809024},"labels":[],"label_agreement":null},{"id":"W2128513449","doi":"","title":"Curves of Width One and the River Shore Problem","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Shore; Unit (ring theory); Plane (geometry); Mathematics; Exploit; Line (geometry); Computer science; Mathematical optimization; Algorithm; Geometry; Geology; Telecommunications","score_opus":0.01789507405513871,"score_gpt":0.22693721706937725,"score_spread":0.20904214301423854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128513449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034935703,0.0006610359,0.89218295,0.0077982442,0.000026838361,0.00036471145,4.1288527e-7,0.000048354577,0.09856809],"genre_scores_gemma":[0.43131855,0.0014111863,0.55988026,0.0022254519,0.000006422226,0.000018931025,7.590003e-7,0.0000055340092,0.005132903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994954,0.00009043846,0.00009467204,0.000100114325,0.00013589034,0.000083507155],"domain_scores_gemma":[0.9996462,0.000058763726,0.000025362117,0.00017808993,0.00006119225,0.000030427707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000407833,0.00003651422,0.00007157859,0.000019886991,0.00003665496,0.000028472343,0.00019468046,0.000012304401,0.00006837483],"category_scores_gemma":[0.00003194276,0.000020761932,0.000015186885,0.00016024505,0.0001402336,0.00014787256,0.00006398489,0.0000390723,0.0000049635264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016055016,0.000026783779,0.0003370535,0.00002902668,0.0000075203498,1.7076763e-7,0.0008815072,0.0001189898,0.000019802492,0.9940023,0.0013540188,0.0032212138],"study_design_scores_gemma":[0.00861591,0.00045585414,0.0057101836,0.00046287477,0.00003434051,0.00003886867,0.00028063657,0.3870284,0.0076245405,0.5553807,0.033601683,0.0007660216],"about_ca_topic_score_codex":0.00001399142,"about_ca_topic_score_gemma":0.000003931255,"teacher_disagreement_score":0.4386216,"about_ca_system_score_codex":0.0000022075342,"about_ca_system_score_gemma":0.00002430682,"threshold_uncertainty_score":0.0846647},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020241239274524116,"score_gpt":0.2543549482875596,"score_spread":0.2341137090130355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128634904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029683945,0.000011408473,0.99443024,0.0020132072,0.00031223978,0.00011200975,0.0000016152546,0.0003238785,0.0024985706],"genre_scores_gemma":[0.16460148,0.000049484355,0.8324115,0.0010285702,0.000056579564,0.000041339143,0.000001306703,0.00002051014,0.0017892049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989702,0.00007537731,0.00015448518,0.00030286596,0.00024224007,0.00025483177],"domain_scores_gemma":[0.99888,0.000111178,0.00003002796,0.0007868238,0.000056036304,0.00013588865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025493177,0.00011644645,0.00010317841,0.00013545083,0.0002417188,0.00014946314,0.0008152099,0.000052642594,0.0001190057],"category_scores_gemma":[0.000027347422,0.00010928328,0.000071665025,0.0003694365,0.00002988458,0.00033347623,0.000014256884,0.0001970868,0.00029138505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002657425,0.00011121354,0.0000050010235,0.0000063533203,0.000016438738,0.0000018907432,0.0004421088,0.025250385,0.00026471532,0.003835891,0.000050014987,0.9700133],"study_design_scores_gemma":[0.0006922196,0.0002638189,0.00035305216,0.000027250293,0.0000063671764,0.000018084178,0.000028166492,0.96009463,0.0033051437,0.0061729793,0.028727008,0.0003112889],"about_ca_topic_score_codex":0.0000139678,"about_ca_topic_score_gemma":0.000006308415,"teacher_disagreement_score":0.96970206,"about_ca_system_score_codex":0.000024736653,"about_ca_system_score_gemma":0.000023580367,"threshold_uncertainty_score":0.4456443},"labels":[],"label_agreement":null},{"id":"W2130941032","doi":"10.1109/crv.2007.5","title":"A non-myopic approach to visual search","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Object (grammar); Computer science; Artificial intelligence; Object detection; Computer vision; Visual search; Prior probability; Greedy algorithm; Pattern recognition (psychology); Algorithm; Bayesian probability","score_opus":0.02985815868770078,"score_gpt":0.3199826247710285,"score_spread":0.29012446608332776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130941032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033672708,0.000002206875,0.8110821,0.0004541865,0.000051444662,0.00017975332,6.663856e-8,0.000107007196,0.18475597],"genre_scores_gemma":[0.5419302,0.0000012070308,0.44959354,0.0014298414,0.000040947914,0.0000064921146,0.0000011138541,0.0000052019254,0.0069914646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893165,0.000016722159,0.00012407356,0.00025816495,0.00032377953,0.00034563852],"domain_scores_gemma":[0.99939114,0.00002896278,0.000008231327,0.0002471858,0.00009019838,0.00023428848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072425656,0.00006325128,0.00006804914,0.00016978908,0.00007714057,0.0001448,0.0005227412,0.000032353055,0.00004249327],"category_scores_gemma":[0.000011717087,0.00005258945,0.000023632494,0.00071409094,0.000014622938,0.00020176661,0.0002632189,0.0000895025,0.0004036182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026342612,0.0012340476,0.004238317,0.00006507814,0.000035863864,0.000026490672,0.010139719,0.020105263,0.003452561,0.69812983,0.020672569,0.24187393],"study_design_scores_gemma":[0.00037773434,0.00019977104,0.0063203145,0.000005039875,6.264727e-7,0.000008498104,0.00016590806,0.9816716,0.0037195103,0.00024382766,0.007068838,0.00021835364],"about_ca_topic_score_codex":0.000029953972,"about_ca_topic_score_gemma":0.0000045204606,"teacher_disagreement_score":0.9615663,"about_ca_system_score_codex":0.00002440839,"about_ca_system_score_gemma":0.00004862084,"threshold_uncertainty_score":0.518783},"labels":[],"label_agreement":null},{"id":"W2131679923","doi":"10.1109/spdp.1991.218285","title":"Boolean theory of coteries","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Boolean function; Boolean data type; Set (abstract data type); Computer science; Function (biology); Decomposition; Theoretical computer science; True quantified Boolean formula; Variable (mathematics); Combinatorics; Discrete mathematics; Mathematics; Algorithm; Biology; Programming language","score_opus":0.03830592162255064,"score_gpt":0.22619755261733668,"score_spread":0.18789163099478604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131679923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020500133,0.000029198383,0.86102164,0.0008881808,0.00002908689,0.000027767514,1.7268037e-7,0.00005550815,0.13774343],"genre_scores_gemma":[0.71673745,0.000055697124,0.21745369,0.0011522991,0.000014186689,0.0000031442496,3.5558162e-7,0.0000043422206,0.06457885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969476,0.000029164623,0.000066035434,0.00006483106,0.000080467646,0.000064727705],"domain_scores_gemma":[0.9997408,0.000025699943,0.0000146017865,0.00016407887,0.00002978996,0.000025020703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010005117,0.000024389004,0.000037221405,0.000028762597,0.000020609014,0.000022101676,0.00023066316,0.0000102387685,0.0010123928],"category_scores_gemma":[0.000006935035,0.000018781546,0.000014128277,0.0001007221,0.000031486416,0.0001601635,0.00006372647,0.000019920106,0.000078982426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6797977e-7,0.000018126431,0.00003642808,0.0000032772177,0.000001975289,4.492721e-7,0.00064244214,0.00006340183,0.00016439453,0.9677183,0.0016901745,0.02966063],"study_design_scores_gemma":[0.0006651017,0.0002898306,0.00063812814,0.000020178439,0.0000024463654,0.000014757645,0.00023896768,0.75863457,0.01300204,0.11544986,0.11073596,0.00030817586],"about_ca_topic_score_codex":0.0000029886355,"about_ca_topic_score_gemma":7.827744e-7,"teacher_disagreement_score":0.85226846,"about_ca_system_score_codex":0.0000019631846,"about_ca_system_score_gemma":0.0000031563795,"threshold_uncertainty_score":0.9999008},"labels":[],"label_agreement":null},{"id":"W2132813033","doi":"10.1016/j.dam.2013.03.004","title":"Three-fast-searchable graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej","keywords":"Mathematics; Combinatorics","score_opus":0.019420457476262504,"score_gpt":0.2452834164866836,"score_spread":0.22586295901042108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132813033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000946303,0.000017265666,0.9260095,0.000663119,0.000044719593,0.00064360147,0.0000014227604,0.0002724354,0.07140164],"genre_scores_gemma":[0.082034834,0.000022538932,0.9165656,0.00036091043,0.000024415349,0.00029860172,0.0000080763775,0.00002979518,0.00065524434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855053,0.0000091576685,0.00027523586,0.00029468103,0.00043822746,0.00043217783],"domain_scores_gemma":[0.99882567,0.00008522682,0.000081543156,0.00074113306,0.00008206347,0.00018436658],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025427103,0.00015997607,0.00018922478,0.00011409977,0.0001535512,0.00037557055,0.0009160648,0.000060705337,0.0003615254],"category_scores_gemma":[0.000019216657,0.00012957172,0.000060748796,0.00044724753,0.00007673721,0.0003681309,0.00036493002,0.0001574111,0.0014862401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5835193e-7,0.000055597797,0.0000110326,0.00005484121,0.000013094629,8.628403e-7,0.0008012406,0.00019531431,0.001489076,0.98745316,0.0029296302,0.006995672],"study_design_scores_gemma":[0.00024753762,0.000027428532,0.00007178108,0.000014970689,0.0000032183455,0.00000356482,0.00015665333,0.38013834,0.0008836257,0.6175988,0.00064000394,0.00021410057],"about_ca_topic_score_codex":0.000019458685,"about_ca_topic_score_gemma":0.000004676802,"teacher_disagreement_score":0.379943,"about_ca_system_score_codex":0.000017428652,"about_ca_system_score_gemma":0.000038185135,"threshold_uncertainty_score":0.99929124},"labels":[],"label_agreement":null},{"id":"W2133402615","doi":"10.1007/978-3-319-03089-0_21","title":"Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Line (geometry); Mathematics; Telecommunications; Geometry","score_opus":0.023383649100682028,"score_gpt":0.268899586946496,"score_spread":0.245515937845814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133402615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014664526,0.00009806401,0.99446565,0.0003684083,0.0003799505,0.0006613238,0.0000018364693,0.00018852504,0.0023697638],"genre_scores_gemma":[0.31345853,0.00012267452,0.6844915,0.0012836508,0.00019794442,0.000025298677,0.000015976153,0.00006223172,0.0003421738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962108,0.00007358069,0.0005321296,0.0014231914,0.0010329237,0.00072734064],"domain_scores_gemma":[0.9976352,0.0002177956,0.00024488737,0.001296776,0.00033254386,0.00027278424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053429184,0.0004764568,0.00044470935,0.001359485,0.00018645052,0.0010206096,0.0026899388,0.0002833973,0.000076111275],"category_scores_gemma":[0.000051865678,0.00039398661,0.000048614114,0.001299179,0.0003887504,0.0014240466,0.00097494264,0.0009027967,0.000067070796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009640391,0.000090291556,0.00024040036,0.000029874815,0.0000054195193,0.00015802264,0.001312369,0.50086796,0.00009682397,0.0021682298,0.000011074487,0.49500987],"study_design_scores_gemma":[0.0004940337,0.0007966341,0.001149687,0.0004979817,0.0000020278783,0.00003355464,1.995749e-7,0.9869409,0.00008943893,0.00917609,0.0002936174,0.00052582653],"about_ca_topic_score_codex":0.00007968872,"about_ca_topic_score_gemma":0.0003114822,"teacher_disagreement_score":0.49448404,"about_ca_system_score_codex":0.00029695494,"about_ca_system_score_gemma":0.0005330085,"threshold_uncertainty_score":0.9998512},"labels":[],"label_agreement":null},{"id":"W2136642745","doi":"10.1287/trsc.1050.0139","title":"Dispatching Buses in a Depot Using Block Patterns","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Transport engineering; Block (permutation group theory); Computer science; Operations research; Engineering; Geography; Mathematics","score_opus":0.02247243372626171,"score_gpt":0.28256554367405795,"score_spread":0.2600931099477962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136642745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52523524,0.0000066849557,0.47429767,0.00012377655,0.000054426204,0.0000735903,0.0000016037588,0.000047139427,0.00015984692],"genre_scores_gemma":[0.9544916,0.0000043039845,0.04536253,0.000093883085,0.000010946396,0.0000049371206,0.000002798496,0.0000037263967,0.000025233547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985966,0.000020955984,0.00025587852,0.0003407227,0.00050037703,0.00028547665],"domain_scores_gemma":[0.99955624,0.000026806767,0.000061523504,0.00019885741,0.000094199604,0.0000623552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004187557,0.000077021185,0.00007885916,0.00026947065,0.00016548361,0.00019565076,0.00055536005,0.00002038697,0.000008741716],"category_scores_gemma":[0.0000107136475,0.000074290976,0.0000219918,0.0014137529,0.000085935586,0.001352298,0.000011444412,0.0000761077,0.0000052662476],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002707428,0.00011138941,0.46004224,0.000020393452,9.688058e-7,0.0000316341,0.002223807,0.47944507,0.017700478,0.038293198,0.0000058218197,0.0021222816],"study_design_scores_gemma":[0.00025140113,0.000011884171,0.5641766,0.000034113058,0.0000011132427,0.0000026741775,0.000047860533,0.43120584,0.0029538753,0.0011371318,0.000036753176,0.00014074762],"about_ca_topic_score_codex":0.0011940618,"about_ca_topic_score_gemma":0.0014180429,"teacher_disagreement_score":0.42925638,"about_ca_system_score_codex":0.000043264077,"about_ca_system_score_gemma":0.0001553077,"threshold_uncertainty_score":0.30294982},"labels":[],"label_agreement":null},{"id":"W2136868932","doi":"10.1109/iccis.2004.1460420","title":"Generalized TSE: a new generalized estimator-based learning automaton","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Estimator; Learning automata; Representation (politics); Computer science; Algorithm; Automaton; Artificial intelligence; Scheme (mathematics); Mathematics; Theoretical computer science; Statistics","score_opus":0.024473304481145253,"score_gpt":0.28528604330927665,"score_spread":0.2608127388281314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136868932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037891068,0.00009435578,0.9766233,0.009791685,0.00010734313,0.00020551767,2.5532324e-7,0.0013676813,0.008020775],"genre_scores_gemma":[0.029956916,0.000016795186,0.9463958,0.0026828202,0.00010508203,0.000018017434,0.000009333367,0.000019819123,0.02079539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833256,0.00014154715,0.00029870294,0.00040765599,0.0003982867,0.00042124998],"domain_scores_gemma":[0.99902624,0.000046734523,0.0000797886,0.0004366307,0.00009116774,0.0003194618],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031210232,0.00017684899,0.00019869696,0.00016472448,0.00022028085,0.00038413113,0.00066300714,0.00007688826,0.00135434],"category_scores_gemma":[0.00006116563,0.0001552404,0.000091875634,0.0004892259,0.00002529711,0.0005382763,0.000141129,0.00016905885,0.0004961699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008862974,0.00009915129,0.0003320397,0.000009989939,0.000017019256,0.000008017877,0.00025223836,0.74811155,0.0013900368,0.17659312,0.035176013,0.038001962],"study_design_scores_gemma":[0.0014336538,0.0000384005,0.000072138246,0.000007727574,0.0000019908362,0.0000057994735,0.0000018426272,0.86464304,0.002638923,0.0003267008,0.13063678,0.000193034],"about_ca_topic_score_codex":0.00008912369,"about_ca_topic_score_gemma":0.000013456393,"teacher_disagreement_score":0.17626643,"about_ca_system_score_codex":0.00006076933,"about_ca_system_score_gemma":0.0003267977,"threshold_uncertainty_score":0.99955857},"labels":[],"label_agreement":null},{"id":"W2138178581","doi":"10.1007/978-3-642-29344-3_31","title":"Decidability Classes for Mobile Agents Computing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Decidability; Computer science; Certificate; Decision problem; Focus (optics); Protocol (science); Mobile agent; Existential quantification; Theoretical computer science; Artificial intelligence; Algorithm; Distributed computing; Mathematics; Discrete mathematics","score_opus":0.03967317163642082,"score_gpt":0.3066049741150857,"score_spread":0.2669318024786649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138178581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060904847,0.00040288296,0.9940494,0.0002724064,0.001646206,0.0013380481,0.000008112286,0.0002082361,0.0020138104],"genre_scores_gemma":[0.12985112,0.000054807555,0.86778486,0.0013385923,0.00052342,0.000044418663,0.000012502869,0.000041140447,0.00034914614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960963,0.000050409337,0.0006023369,0.0013988423,0.0008905339,0.0009615514],"domain_scores_gemma":[0.99664557,0.0010010033,0.00028814244,0.0012862881,0.00047907577,0.0002999128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017465164,0.00046130185,0.00050890277,0.0005514857,0.0004144613,0.00064854266,0.003073681,0.00030741727,0.0000491686],"category_scores_gemma":[0.00016841273,0.00042579172,0.00017800034,0.00051978766,0.0005335018,0.00076790043,0.001500022,0.000566222,0.00004438388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004487038,0.00006839994,0.00020033287,0.000084509134,0.000010829387,0.000005304065,0.0008021794,0.12601171,0.000029660767,0.018084781,0.000076474054,0.85462135],"study_design_scores_gemma":[0.0003262744,0.00018971458,0.0001860472,0.00016347122,0.000005843319,0.000016278871,1.9544727e-7,0.9323878,0.0003655538,0.055357076,0.010428825,0.0005728921],"about_ca_topic_score_codex":0.000007677719,"about_ca_topic_score_gemma":0.000020852227,"teacher_disagreement_score":0.85404843,"about_ca_system_score_codex":0.00034886916,"about_ca_system_score_gemma":0.00053340796,"threshold_uncertainty_score":0.9998194},"labels":[],"label_agreement":null},{"id":"W2140995153","doi":"10.1115/imece2010-38914","title":"An Optimal Orthogonal Recharging Route Planner: A Multi-Robots, Multi-Rendezvous Recharging Scheme","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rendezvous; Robot; Tree traversal; Planner; Computer science; Scheme (mathematics); Orthogonal array; Work (physics); Real-time computing; Simulation; Mathematical optimization; Engineering; Mathematics; Artificial intelligence; Algorithm","score_opus":0.04297016576045565,"score_gpt":0.3196854649808724,"score_spread":0.27671529922041677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140995153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013258301,0.000029083234,0.9825922,0.0009602706,0.00066070916,0.00033546748,0.000009114149,0.0010010632,0.0011537523],"genre_scores_gemma":[0.095229715,0.000019492774,0.9017603,0.000641964,0.000114434,0.00003754451,0.000037914397,0.000033735454,0.0021249037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729586,0.00013735087,0.0004307513,0.0008807155,0.00047431915,0.000781025],"domain_scores_gemma":[0.9980971,0.00008012172,0.00013076229,0.0009665038,0.00023597303,0.0004895462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010021462,0.00030644203,0.00026267098,0.00029905568,0.00041505488,0.0006202259,0.001492613,0.00020730236,0.0003799156],"category_scores_gemma":[0.00011857965,0.00028027233,0.00010291325,0.00054733944,0.00007284662,0.0016626925,0.0003747516,0.000848727,0.00021223108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122458,0.0036352302,0.017797006,0.00013278658,0.00025096608,0.0004338581,0.011478248,0.15203877,0.23027383,0.28761816,0.002949347,0.29324058],"study_design_scores_gemma":[0.0011018295,0.00007089533,0.0006374805,0.000018451568,0.000002926618,0.000060849907,0.00006617805,0.9922267,0.0026003283,0.000045600023,0.0027471716,0.00042155798],"about_ca_topic_score_codex":0.0000631153,"about_ca_topic_score_gemma":0.00014541067,"teacher_disagreement_score":0.84018797,"about_ca_system_score_codex":0.000042663843,"about_ca_system_score_gemma":0.00020446362,"threshold_uncertainty_score":0.99996495},"labels":[],"label_agreement":null},{"id":"W2141168954","doi":"10.1109/cimca.2005.1631525","title":"A General Cache Partition Model for Multiple QoS Classes: Algorithm and Simulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Cache; Partition (number theory); Quality of service; Cache algorithms; Popularity; Algorithm; Parallel computing; CPU cache; Distributed computing; Computer network; Mathematics","score_opus":0.038482076230223934,"score_gpt":0.2908025213047491,"score_spread":0.25232044507452517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141168954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012143754,0.000011331209,0.99746454,0.00039076945,0.00004250699,0.00028453843,0.0000046905616,0.00010803038,0.0004792096],"genre_scores_gemma":[0.28478312,0.0000030173217,0.7129016,0.00018653805,0.00005839325,0.000037472673,0.000021638161,0.0000041899457,0.0020040341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994291,0.000017946946,0.00012102747,0.00018673133,0.00010315322,0.00014205281],"domain_scores_gemma":[0.99966407,0.00006153913,0.000026341088,0.000113755515,0.00009366425,0.00004064242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117868265,0.000057917572,0.00005673678,0.00004345629,0.0000996289,0.00013178786,0.000086408996,0.0000364861,0.0000045441043],"category_scores_gemma":[0.0000142921335,0.000051374445,0.000021229213,0.000086619664,0.000013602387,0.00042269146,0.000038263093,0.000026227117,0.0000031169302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012642222,0.000025503074,0.00008475381,0.0000037326563,0.0000014304801,1.248058e-7,0.00006144585,0.97320926,0.0001263549,0.01513894,0.00073813973,0.010609061],"study_design_scores_gemma":[0.00045450657,0.00002340465,0.00013718207,0.0000016053726,0.0000013505478,4.91632e-7,0.0000032231812,0.99180144,0.00016955788,0.006536786,0.00079686637,0.000073588606],"about_ca_topic_score_codex":0.000047640602,"about_ca_topic_score_gemma":0.00003721544,"teacher_disagreement_score":0.28456298,"about_ca_system_score_codex":0.00001611867,"about_ca_system_score_gemma":0.0000248527,"threshold_uncertainty_score":0.20949891},"labels":[],"label_agreement":null},{"id":"W2142094448","doi":"10.1007/s00453-009-9311-6","title":"Stochastic Models for Budget Optimization in Search-Based Advertising","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Theory of computation; Probabilistic logic; Stochastic optimization; Mathematical optimization; Simple (philosophy); Budget constraint; Online advertising; Prefix; The Internet; Operations research; Mathematics; Algorithm; Economics; World Wide Web; Artificial intelligence","score_opus":0.021913556786185527,"score_gpt":0.2746936839958445,"score_spread":0.252780127209659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142094448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050623843,0.00003518183,0.99592996,0.0029426764,0.000067131514,0.00046104824,0.0000034723375,0.00012755768,0.00038232387],"genre_scores_gemma":[0.24007292,0.000003412503,0.7588964,0.00087410933,0.00002794162,0.000024477968,0.000019625675,0.00000883725,0.000072238865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.000053741394,0.00021437957,0.00032094755,0.00023530526,0.00034248084],"domain_scores_gemma":[0.99936575,0.000092882205,0.00003504658,0.00027158548,0.00013761494,0.000097148826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003010346,0.00010518768,0.00012805907,0.00022590252,0.00009641713,0.00012879386,0.00041963437,0.000057262496,0.000007893232],"category_scores_gemma":[0.00004255808,0.000108394896,0.000043462744,0.00047503505,0.000022836466,0.0005668239,0.000037519476,0.00010227335,0.000005152373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068414593,0.000057332458,6.3779834e-7,0.0000040259865,0.0000015209906,0.0000015368395,0.00014040826,0.9523855,0.000025115163,0.009538709,0.000074951895,0.03776344],"study_design_scores_gemma":[0.0007891485,0.0001289541,0.000016319565,0.000026343538,0.0000013961956,0.0000014516891,0.0000064774113,0.9904012,0.00018802943,0.008282904,0.000027761414,0.00012999584],"about_ca_topic_score_codex":0.000010957159,"about_ca_topic_score_gemma":0.0000017220013,"teacher_disagreement_score":0.2400223,"about_ca_system_score_codex":0.000068411275,"about_ca_system_score_gemma":0.00012816954,"threshold_uncertainty_score":0.44202155},"labels":[],"label_agreement":null},{"id":"W2143059072","doi":"10.1109/icmlc.2006.259048","title":"Competitive Analysis for the On-Line Fuzzy Most Connective Path Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Ontario Federation for Cerebral Palsy","keywords":"Fuzzy logic; Path (computing); Line (geometry); Mathematical proof; Computer science; Competitive analysis; Domain (mathematical analysis); Mathematical optimization; Fuzzy set; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02605275785397674,"score_gpt":0.27363436764726834,"score_spread":0.2475816097932916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143059072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032934313,0.000018278164,0.8953268,0.004863564,0.000041644435,0.0005242987,0.00001470951,0.00010279534,0.09907496],"genre_scores_gemma":[0.8438107,0.000016471731,0.14703017,0.002150082,0.00008570281,0.00018787358,0.000045241854,0.000010156313,0.006663599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903274,0.000057968802,0.00017545352,0.0002984641,0.00021453584,0.00022087133],"domain_scores_gemma":[0.9986876,0.0005805696,0.000061407976,0.00032706794,0.00030041614,0.00004290651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033096212,0.0001007022,0.00014110186,0.00011827203,0.0002418398,0.00017765666,0.00045640543,0.000029304932,0.000059594135],"category_scores_gemma":[0.000028817758,0.000060705155,0.00010283545,0.0010901776,0.000049079707,0.00014752349,0.0000846146,0.00007383291,0.00003452484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049117943,0.000064593696,0.000108066124,0.0000018316221,0.000080681646,5.4587497e-7,0.00010177337,0.16835657,0.000008270992,0.82894987,0.0014046748,0.00091821793],"study_design_scores_gemma":[0.0005057269,0.00021821889,0.0009901781,0.0000048243533,0.000037468595,6.736077e-7,0.00011532415,0.9657499,0.00032953086,0.0168496,0.015060077,0.00013843874],"about_ca_topic_score_codex":0.00016026937,"about_ca_topic_score_gemma":0.0003533895,"teacher_disagreement_score":0.8437778,"about_ca_system_score_codex":0.000029744771,"about_ca_system_score_gemma":0.000048532416,"threshold_uncertainty_score":0.24754843},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009868126200166685,"score_gpt":0.26984641937393045,"score_spread":0.25997829317376375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144182788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050478958,0.000032051215,0.94176424,0.00015472934,0.0003042003,0.00023768136,1.3817007e-7,0.00021196512,0.006816026],"genre_scores_gemma":[0.7524164,0.000005166674,0.24727657,0.00023719107,0.00004476683,0.0000070626274,1.4335019e-7,0.0000063612742,0.0000063808425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743205,0.0000664212,0.00032983048,0.0006480204,0.0006419096,0.0008817366],"domain_scores_gemma":[0.9986827,0.00022533815,0.00004720778,0.0006139838,0.00011763047,0.0003131812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034375119,0.00015241269,0.00017226057,0.00040038698,0.00024924584,0.0004319532,0.0020313128,0.00004959562,0.00003853445],"category_scores_gemma":[0.00006059222,0.00013619337,0.000041137308,0.0019706108,0.0010543413,0.0007551633,0.0010364148,0.00025389207,0.00007666907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034729667,0.00007397059,0.00021391339,0.000005133061,0.0000010384266,0.000043866075,0.001070733,0.02661947,0.0005327346,0.8828974,0.0000018859281,0.08853641],"study_design_scores_gemma":[0.00027600708,0.00017744108,0.0021560758,0.00003792884,5.8073357e-7,0.00003911735,0.000012777692,0.97190887,0.0020626737,0.023080518,0.00003784794,0.0002101693],"about_ca_topic_score_codex":0.0000079113815,"about_ca_topic_score_gemma":0.0000056911485,"teacher_disagreement_score":0.9452894,"about_ca_system_score_codex":0.00014083143,"about_ca_system_score_gemma":0.00011804324,"threshold_uncertainty_score":0.5553804},"labels":[],"label_agreement":null},{"id":"W2144303191","doi":"10.1109/tsmcb.2002.1049616","title":"Discretized learning automata solutions to the capacity assignment problem for prioritized networks","year":2002,"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":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Discretization; Learning automata; Computer science; Heuristic; Mathematical optimization; Simulated annealing; Network packet; Genetic algorithm; Set (abstract data type); Automaton; Class (philosophy); Focus (optics); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0454457620888802,"score_gpt":0.24205965216824274,"score_spread":0.19661389007936253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144303191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005196766,0.00023495858,0.9895129,0.003929817,0.0010073498,0.002371665,0.00003555299,0.00037133473,0.0020167208],"genre_scores_gemma":[0.96554875,0.0007414499,0.013172165,0.0003638359,0.00019144538,0.0010738675,0.0000074475715,0.00006048917,0.018840576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667734,0.0004394815,0.0006806279,0.000755519,0.00060815015,0.0008388796],"domain_scores_gemma":[0.9980123,0.00036394753,0.00018207957,0.0007990639,0.00021313642,0.00042946625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000907991,0.00038236985,0.00040812246,0.00017275999,0.0011227671,0.00081620493,0.000733756,0.00018611008,0.000049733168],"category_scores_gemma":[0.000019376454,0.00031384642,0.00016670409,0.00050462346,0.00015282276,0.00019669792,0.000028044875,0.00051551964,0.00010314645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032184722,0.00041271292,0.00002103077,0.00009230118,0.00014780024,0.0000033219437,0.0031430118,0.9399972,0.00011131081,0.027974838,0.008476302,0.019587968],"study_design_scores_gemma":[0.0012436558,0.0004092117,0.0000390984,0.00014332181,0.000050234896,0.000025545742,0.00012669046,0.9148915,0.000082243154,0.00018712156,0.08239583,0.00040555146],"about_ca_topic_score_codex":0.00008845381,"about_ca_topic_score_gemma":0.000089071495,"teacher_disagreement_score":0.9763408,"about_ca_system_score_codex":0.00011708658,"about_ca_system_score_gemma":0.00003265917,"threshold_uncertainty_score":0.99993134},"labels":[],"label_agreement":null},{"id":"W2146625634","doi":"10.1007/978-3-540-24698-5_59","title":"On the Competitiveness of AIMD-TCP within a General Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bottleneck; Computer science; Multiplicative function; Scheduling (production processes); Distributed computing; Mathematical optimization; Mathematics","score_opus":0.019571879034526476,"score_gpt":0.24416942167640399,"score_spread":0.2245975426418775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146625634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008065669,0.000106353415,0.9897682,0.0017543309,0.0011385676,0.00045145256,0.0000035822231,0.00007422163,0.0066226204],"genre_scores_gemma":[0.2276228,0.000078800666,0.7618314,0.008438364,0.0006999827,0.000025595717,0.000008704053,0.00006264892,0.0012316941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968141,0.000089356996,0.0005112084,0.0009471838,0.0011096604,0.00052852527],"domain_scores_gemma":[0.9973245,0.0006845015,0.0003392104,0.001216173,0.00031254024,0.00012303286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013685462,0.00037924247,0.00043755316,0.00035313843,0.0002928132,0.00031779,0.0033838747,0.000193407,0.00009956375],"category_scores_gemma":[0.00008510791,0.00026269033,0.00012512294,0.0007953707,0.00095616654,0.00024531013,0.00095777947,0.00076512864,0.00002820044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031055022,0.000013281888,0.000011559689,0.000010092071,0.000005185316,0.000010455288,0.00030656176,0.5287145,0.0000105256995,0.46128187,0.0000073388305,0.0096255625],"study_design_scores_gemma":[0.0002180834,0.00019218835,0.00006077823,0.0005560804,0.0000027829349,0.000012997407,1.04844005e-7,0.5749532,0.0005021756,0.42290756,0.00028856,0.00030551406],"about_ca_topic_score_codex":0.00002271578,"about_ca_topic_score_gemma":0.000039339055,"teacher_disagreement_score":0.22793682,"about_ca_system_score_codex":0.00018984464,"about_ca_system_score_gemma":0.00084716245,"threshold_uncertainty_score":0.99998254},"labels":[],"label_agreement":null},{"id":"W2149450544","doi":"10.1109/crv.2011.18","title":"Combining Multi-robot Exploration and Rendezvous","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rendezvous; Computer science; Robot; Ranking (information retrieval); Probabilistic logic; Task (project management); Mobile robot; Constraint (computer-aided design); Set (abstract data type); Uniqueness; Distributed computing; Artificial intelligence; Engineering; Mathematics; Spacecraft","score_opus":0.1897041099319295,"score_gpt":0.2846901288087703,"score_spread":0.09498601887684083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149450544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019795269,0.000014780458,0.98445857,0.00032178042,0.00006397286,0.00006525635,6.454529e-8,0.00014405827,0.014733598],"genre_scores_gemma":[0.39553043,0.000033329525,0.60294586,0.00023999323,0.000004222439,0.0000068306636,7.564374e-7,0.000002932943,0.0012356621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957997,0.000028188402,0.00008105619,0.00013966729,0.000074697935,0.0000964392],"domain_scores_gemma":[0.99972695,0.000011279259,0.00001983217,0.00014492447,0.000040014107,0.00005698632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012787289,0.000041588228,0.000042768013,0.000044772067,0.00006664995,0.000069781825,0.00014854339,0.000019394969,0.000039942806],"category_scores_gemma":[0.00001335225,0.000035456094,0.000007871864,0.000107075684,0.000017859833,0.00068028166,0.00010073694,0.000039325,0.000034372035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006686898,0.00025730798,0.0020631468,0.000015899424,0.000016808906,0.000013616676,0.028821941,0.0009860378,0.001042595,0.80923575,0.0010468801,0.15649335],"study_design_scores_gemma":[0.00053365587,0.000104006416,0.001841469,0.000006655782,0.00000105538,0.0000063418506,0.00017297683,0.98914593,0.0019089311,0.005693873,0.0004529929,0.0001321329],"about_ca_topic_score_codex":0.000029656716,"about_ca_topic_score_gemma":0.00001369564,"teacher_disagreement_score":0.9881599,"about_ca_system_score_codex":0.000004149335,"about_ca_system_score_gemma":0.000011372194,"threshold_uncertainty_score":0.14458576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03388222873633773,"score_gpt":0.2617209479277961,"score_spread":0.22783871919145837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149929647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001203211,0.000011948101,0.9866937,0.00073878095,0.00016329323,0.00068985095,9.991276e-7,0.0002003035,0.011489087],"genre_scores_gemma":[0.0029155049,0.0000054497095,0.98676735,0.00032745866,0.00016476259,0.000108829874,0.000023303797,0.000009668366,0.009677691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989526,0.000028436962,0.00021288288,0.0002579032,0.00020460594,0.00034354217],"domain_scores_gemma":[0.9993617,0.000106050386,0.00006194087,0.00027538146,0.00013055853,0.00006437979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052271836,0.000100711055,0.00010312556,0.00005725978,0.00024266208,0.00017790378,0.00038915855,0.000057151803,0.00004715816],"category_scores_gemma":[0.000010919902,0.00008596221,0.000047382822,0.00032915108,0.000025868188,0.00041737992,0.000110950605,0.00004595061,0.00007358456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008077573,0.00006582261,0.00002431617,0.000015993826,0.000007159357,9.4806165e-7,0.00009657642,0.72965026,0.00011109998,0.1880013,0.063294254,0.018724175],"study_design_scores_gemma":[0.00039115618,0.000074142554,0.00003550821,0.0000050367194,0.0000015747903,0.0000027464944,0.0000026482983,0.9728427,0.00096067466,0.018892443,0.0066681313,0.00012325877],"about_ca_topic_score_codex":0.000020653313,"about_ca_topic_score_gemma":0.000009496817,"teacher_disagreement_score":0.2431924,"about_ca_system_score_codex":0.000055396107,"about_ca_system_score_gemma":0.00004627232,"threshold_uncertainty_score":0.35054374},"labels":[],"label_agreement":null},{"id":"W2150541902","doi":"10.1145/336154.336225","title":"Optimal robot localization in trees","year":2000,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robot; Artificial intelligence; Computer vision","score_opus":0.016562985999989604,"score_gpt":0.2554649911040864,"score_spread":0.2389020051040968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150541902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010670648,0.00001163248,0.9496588,0.000977591,0.00002040869,0.000068119305,8.3547086e-8,0.000102198996,0.04809406],"genre_scores_gemma":[0.6501263,0.000100141275,0.33059195,0.0016955844,0.000022361624,0.000014090609,0.0000054670318,0.000007347652,0.01743681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00003226052,0.00010411365,0.00014180066,0.00011207715,0.00012822733],"domain_scores_gemma":[0.99977213,0.000011609726,0.0000076808055,0.0001497012,0.000018756198,0.00004013383],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010273709,0.00004166208,0.000046829446,0.0000646982,0.000030470685,0.0000805449,0.00024002063,0.000023136761,0.0013602914],"category_scores_gemma":[0.0000051043075,0.000036327663,0.000012201473,0.00037542047,0.000012017789,0.0003630601,0.0000273479,0.000036948823,0.00021200004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012982493,0.000032572767,0.00040754722,8.7360854e-7,6.5952986e-7,0.000002183329,0.00024157375,0.93928903,0.000011271799,0.016302636,0.0006658722,0.04304447],"study_design_scores_gemma":[0.00017541395,0.000021195801,0.0005580914,0.000003189949,1.3926973e-7,0.0000013288592,0.0000069042685,0.992409,0.000118957825,0.0002475704,0.0064060083,0.000052206036],"about_ca_topic_score_codex":0.00004941985,"about_ca_topic_score_gemma":0.00006167097,"teacher_disagreement_score":0.6490592,"about_ca_system_score_codex":0.000013133536,"about_ca_system_score_gemma":0.000020067982,"threshold_uncertainty_score":0.9995526},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031070097432292325,"score_gpt":0.26320034852747093,"score_spread":0.2321302510951786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152324445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033946167,0.00041226958,0.9933977,0.0021466864,0.00065576076,0.0014591978,0.000042395015,0.0004791051,0.0010674159],"genre_scores_gemma":[0.96284586,0.00038327937,0.02948553,0.00025078616,0.00011155745,0.0005311331,0.000014925554,0.00006299873,0.006313903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996927,0.00024125699,0.00071517675,0.0007278298,0.0005831645,0.00080554624],"domain_scores_gemma":[0.9979375,0.00058496144,0.00022671939,0.0007168511,0.00025917272,0.00027477965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009942668,0.00039140516,0.00034962207,0.00020017233,0.0012570389,0.0007663502,0.0006904382,0.00018566701,0.000022702457],"category_scores_gemma":[0.000016053627,0.0003294039,0.00017852768,0.00044133683,0.00018901599,0.00026146002,0.000017056305,0.0005415701,0.000073142306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010381563,0.00024662356,0.000018545188,0.000041766925,0.00007594621,0.0000022124118,0.0007938003,0.94685984,0.0000762245,0.006340145,0.00056659937,0.044967942],"study_design_scores_gemma":[0.00095686474,0.0003146413,0.000064659616,0.00014406833,0.0000665907,0.00002807079,0.00016793821,0.9620799,0.0001346667,0.00008195361,0.035570934,0.0003897094],"about_ca_topic_score_codex":0.000093896226,"about_ca_topic_score_gemma":0.00016495572,"teacher_disagreement_score":0.9639122,"about_ca_system_score_codex":0.00013798295,"about_ca_system_score_gemma":0.00014516576,"threshold_uncertainty_score":0.9999158},"labels":[],"label_agreement":null},{"id":"W2152623377","doi":"10.1145/1921659.1921663","title":"Tree exploration with logarithmic memory","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Royal Society","keywords":"Tree traversal; Node (physics); Traverse; Binary logarithm; Computer science; Tree (set theory); Logarithm; Graph; Upper and lower bounds; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.0695535220691234,"score_gpt":0.2535367779472618,"score_spread":0.1839832558781384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152623377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012961577,0.000009739053,0.99053663,0.0010280678,0.00021319228,0.00025645792,0.0000030044905,0.00034519852,0.007478113],"genre_scores_gemma":[0.10068177,0.00006379067,0.8968768,0.00044451907,0.000027712691,0.00013216071,0.0000038923695,0.0000217825,0.0017475857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884325,0.000067443485,0.00017312191,0.000362276,0.00030501647,0.00024887978],"domain_scores_gemma":[0.9988551,0.00004321708,0.000047466845,0.00080759765,0.000117622636,0.00012896217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015780788,0.00014729271,0.00011743196,0.00021766023,0.00022339313,0.0000857399,0.0007362236,0.000064112064,0.00026666652],"category_scores_gemma":[0.000007790118,0.00012246087,0.000050506762,0.0005401477,0.000062620056,0.0011352884,0.000011150163,0.00020670582,0.0002222672],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030039937,0.00037379473,0.0000052012806,0.0000069683097,0.00004248137,0.000022204575,0.0032197027,0.0029895166,0.00006859488,0.0017133099,0.00009367929,0.9914345],"study_design_scores_gemma":[0.0062688068,0.004485484,0.0021328568,0.00014193005,0.00008568359,0.0002220401,0.0020264976,0.9080893,0.04564631,0.025405113,0.0035621577,0.001933816],"about_ca_topic_score_codex":0.000055689245,"about_ca_topic_score_gemma":0.00005985586,"teacher_disagreement_score":0.9895007,"about_ca_system_score_codex":0.00003134851,"about_ca_system_score_gemma":0.000071811635,"threshold_uncertainty_score":0.49938095},"labels":[],"label_agreement":null},{"id":"W2152948384","doi":"10.1109/tro.2008.2007459","title":"A Distributed Heuristic for Energy-Efficient Multirobot Multiplace Rendezvous","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rendezvous; Heuristic; Mobile robot; Robot; Computer science; Set (abstract data type); Bounded function; Mathematical optimization; Population; Controller (irrigation); Quality of service; Simple (philosophy); Distributed computing; Artificial intelligence; Mathematics; Engineering; Computer network","score_opus":0.036768076272069655,"score_gpt":0.2553220708945491,"score_spread":0.21855399462247946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152948384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097212614,0.000019965784,0.99757004,0.00078710064,0.0006961376,0.00032935425,0.00007305481,0.0003529902,0.0000741257],"genre_scores_gemma":[0.65568984,0.00006844183,0.3422813,0.00026113374,0.000029205126,0.00010062439,0.000017200104,0.000026304153,0.0015259328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984115,0.00007204467,0.0003139739,0.00044046176,0.00033743566,0.00042460076],"domain_scores_gemma":[0.99866366,0.0003063755,0.000074810756,0.0005324529,0.00021482394,0.00020786138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012153153,0.00020399292,0.0002015027,0.0001685744,0.0005994958,0.00007050961,0.00047779878,0.000100800564,0.000012365148],"category_scores_gemma":[0.000021961618,0.00020112796,0.0001503628,0.0005121465,0.000089205496,0.0001225997,0.0000042841057,0.00018710303,0.000030708117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022498898,0.00046635687,0.0000014848098,0.000010699282,0.000021235106,0.000010994777,0.00025933806,0.9937377,0.000093124225,0.0021293266,0.000603053,0.0026442166],"study_design_scores_gemma":[0.001033097,0.0001766676,0.000016188398,0.000015040662,0.000012345573,0.00003743798,0.000014937481,0.9956366,0.0021703106,0.00007949204,0.00057470525,0.00023319993],"about_ca_topic_score_codex":0.00002106987,"about_ca_topic_score_gemma":0.000016074573,"teacher_disagreement_score":0.6555926,"about_ca_system_score_codex":0.00010795691,"about_ca_system_score_gemma":0.00011435407,"threshold_uncertainty_score":0.820176},"labels":[],"label_agreement":null},{"id":"W2154244688","doi":"10.1007/978-3-540-77120-3_43","title":"On the Relative Dominance of Paging Algorithms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Paging; Computer science; Algorithm; Demand paging; Thrashing; Interval (graph theory); Virtual memory; Mathematics; Parallel computing; Operating system; Combinatorics; Memory management","score_opus":0.03338256575521329,"score_gpt":0.2782120725851762,"score_spread":0.24482950682996293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154244688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009600901,0.00017017427,0.98099864,0.0015485635,0.00066994864,0.0003808536,0.0000028310924,0.000052236748,0.016167147],"genre_scores_gemma":[0.03792384,0.00009911874,0.9571382,0.0032838213,0.00019680084,0.000009334483,0.0000025392046,0.000033839984,0.0013125312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997047,0.000050379,0.00045415462,0.000888545,0.0010836136,0.00047628398],"domain_scores_gemma":[0.9965068,0.0016319668,0.0003236971,0.0011330344,0.00031227374,0.00009220904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018677477,0.00031647118,0.00034099043,0.00059947406,0.00023620708,0.00020052135,0.0028524948,0.00018120006,0.00003598791],"category_scores_gemma":[0.0002054981,0.00021876406,0.000106733525,0.0008020201,0.0008919111,0.00041227735,0.00079778844,0.000870894,0.000030484152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041228236,0.000019409625,0.000005948901,0.000012644562,0.000007516541,0.000023903567,0.0011226373,0.04558287,0.000019238229,0.55748254,0.00002803995,0.3956911],"study_design_scores_gemma":[0.00015564694,0.00014665889,0.000024139223,0.00039190162,0.0000021530939,0.000011315108,1.5332117e-7,0.6511449,0.001017272,0.34605187,0.000783739,0.00027021117],"about_ca_topic_score_codex":0.000011688802,"about_ca_topic_score_gemma":0.000013586622,"teacher_disagreement_score":0.6055621,"about_ca_system_score_codex":0.00015198425,"about_ca_system_score_gemma":0.00031532912,"threshold_uncertainty_score":0.892094},"labels":[],"label_agreement":null},{"id":"W2154430520","doi":"10.5267/j.ijiec.2012.05.006","title":"Introducing mass balancing theorem for network flow maximization","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Leverhulme Trust","keywords":"Maximization; Flow (mathematics); Flow network; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Geometry","score_opus":0.025559305693846873,"score_gpt":0.2647144740999841,"score_spread":0.23915516840613724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154430520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006461262,0.00007011861,0.99078727,0.0016516559,0.0065670228,0.00014225018,0.000004836551,0.000056143486,0.00007454967],"genre_scores_gemma":[0.3345004,0.0000104749,0.6609801,0.000108094704,0.0043416386,0.0000068362424,0.000016457563,0.000015298909,0.000020658852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986991,0.000045496214,0.0005009588,0.00010508437,0.00039130216,0.00025800776],"domain_scores_gemma":[0.9983937,0.00037850544,0.00026981995,0.00010553887,0.00071892445,0.00013350745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874431,0.00010754006,0.00015297811,0.00027965775,0.00007791866,0.00025598955,0.00059249904,0.0000707095,0.000014392249],"category_scores_gemma":[0.000660163,0.000104795276,0.000103965955,0.0003083531,0.000010641988,0.0009376916,0.00006405501,0.00023273956,0.0000036778358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010900305,0.000026193393,0.00035959182,0.0000023135171,0.00007899798,0.0000014075652,0.00022818962,0.94601333,0.000110107685,0.039702892,0.0014857195,0.011980361],"study_design_scores_gemma":[0.00086114416,0.00004669213,0.00011104235,0.00007817797,0.000009711639,0.00004745731,0.000014521519,0.9923503,0.00016924254,0.0012346422,0.004968259,0.00010881713],"about_ca_topic_score_codex":0.0000013509298,"about_ca_topic_score_gemma":1.3955503e-7,"teacher_disagreement_score":0.3338543,"about_ca_system_score_codex":0.0001419998,"about_ca_system_score_gemma":0.000118536205,"threshold_uncertainty_score":0.4273427},"labels":[],"label_agreement":null},{"id":"W2154903757","doi":"10.5555/2095116.2095161","title":"Gathering despite mischief","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Byzantine fault tolerance; Theoretical computer science; Combinatorics; Mathematics; Distributed computing; Fault tolerance; Physics","score_opus":0.018282125697853154,"score_gpt":0.2676465739180216,"score_spread":0.24936444822016846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154903757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028977923,0.00028824116,0.9321342,0.003466149,0.0011596692,0.00037353378,0.0000064151855,0.0005371552,0.05913684],"genre_scores_gemma":[0.6709684,0.0002987124,0.31763715,0.0026621204,0.0008876772,0.00012287794,0.000021224785,0.0000865507,0.007315294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831563,0.00009842888,0.00021388767,0.0003323712,0.0004023577,0.00063730724],"domain_scores_gemma":[0.99888444,0.000055321747,0.00006488777,0.00060845824,0.000050191702,0.00033667823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042515472,0.00018945368,0.00015021418,0.0001224261,0.00018580131,0.00020918397,0.0006936507,0.00006827224,0.00006986094],"category_scores_gemma":[0.000017418834,0.0001601772,0.00009001925,0.000352597,0.00004213738,0.0008707475,0.00022658474,0.00018637792,0.00049705163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007972529,0.0016542412,0.005764138,0.00019486273,0.00034999516,0.00007382613,0.025303252,0.029247276,0.044131372,0.67020804,0.00926118,0.21373212],"study_design_scores_gemma":[0.002271391,0.00090355397,0.0051045637,0.0001728472,0.000026571808,0.0000860542,0.00021745755,0.80152804,0.02243518,0.0025813156,0.16273178,0.0019412567],"about_ca_topic_score_codex":0.000010553651,"about_ca_topic_score_gemma":7.4188625e-7,"teacher_disagreement_score":0.77228075,"about_ca_system_score_codex":0.000046601228,"about_ca_system_score_gemma":0.000029426254,"threshold_uncertainty_score":0.65318364},"labels":[],"label_agreement":null},{"id":"W2155019050","doi":"10.5555/1070432.1070485","title":"Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Steiner tree problem; Mathematical optimization; Computer science; Provisioning; Terminal (telecommunication); Facility location problem; Mathematics; Computer network","score_opus":0.05440469364136382,"score_gpt":0.3212056976264048,"score_spread":0.266801003985041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155019050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011143992,0.000008885813,0.98841035,0.007572743,0.00012553495,0.0011112371,0.0000028166087,0.0001936505,0.0014603729],"genre_scores_gemma":[0.4206207,0.000011178788,0.57079995,0.002382352,0.00017644824,0.00036821462,0.000026062737,0.000017143135,0.005597962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900717,0.000026820335,0.00020011669,0.0002884001,0.00018288783,0.00029462072],"domain_scores_gemma":[0.99911153,0.00013037355,0.000061754625,0.0005008322,0.0001244332,0.00007108492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057571835,0.00009310736,0.00008547475,0.000049308983,0.0003199934,0.0003220007,0.0008226651,0.00003822598,0.00004671465],"category_scores_gemma":[0.00009955136,0.000054768858,0.000049564096,0.00022338374,0.00003600873,0.0004289358,0.00029129907,0.000092072885,0.0000260992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008014307,0.0006642976,0.00024676946,0.00009679407,0.000043175296,6.8847487e-7,0.0060474286,0.19938076,0.002462805,0.24522394,0.011339891,0.53441334],"study_design_scores_gemma":[0.0005800593,0.000029229637,0.00010544711,0.0000054584652,0.0000020478856,0.0000013964224,0.00004592615,0.98582304,0.0012323892,0.00017230546,0.011913896,0.00008881257],"about_ca_topic_score_codex":0.000014471209,"about_ca_topic_score_gemma":0.0000311292,"teacher_disagreement_score":0.7864423,"about_ca_system_score_codex":0.0000520572,"about_ca_system_score_gemma":0.000040921208,"threshold_uncertainty_score":0.31050602},"labels":[],"label_agreement":null},{"id":"W2156452360","doi":"10.1109/iccis.2006.252228","title":"Determining Optimal Polling Frequency Using a Learning Automata-based Solution to the Fractional Knapsack Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Knapsack problem; Mathematical optimization; Discretization; Learning automata; Computer science; Function (biology); Resource allocation; Polling; Mathematics; Automaton; Theoretical computer science","score_opus":0.027641683471281864,"score_gpt":0.27590614067623437,"score_spread":0.2482644572049525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156452360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046132966,0.000014579448,0.9891339,0.0027305628,0.00011669932,0.00027110972,0.0000011379749,0.00039229242,0.002726431],"genre_scores_gemma":[0.39845222,5.498804e-7,0.6008035,0.00035491926,0.00008018968,0.00001731727,0.000006646831,0.000009649165,0.0002750111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983698,0.00013138549,0.0002958948,0.0003561173,0.00043800654,0.00040875844],"domain_scores_gemma":[0.9992873,0.00010593302,0.00010436568,0.0002605378,0.00015508609,0.000086757485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020352,0.00013815836,0.0001083607,0.00016817017,0.0007066155,0.00046554988,0.00047717572,0.00005638922,0.00007484143],"category_scores_gemma":[0.000044412103,0.00010742091,0.00006080933,0.00060789566,0.000028968892,0.00063545635,0.00013509556,0.0002334027,0.0000805415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018630981,0.000030597894,0.00054990407,0.0000050980843,0.0000038012658,0.0000030880087,0.00012968747,0.9850126,0.0018231058,0.009345999,0.00028119225,0.0028130831],"study_design_scores_gemma":[0.00022602735,0.00006389129,0.00031533637,0.00002674991,0.0000030820463,0.000014856813,0.000023040313,0.99626505,0.0006082101,0.00030224535,0.0019955274,0.0001559994],"about_ca_topic_score_codex":0.00023498331,"about_ca_topic_score_gemma":0.000029676945,"teacher_disagreement_score":0.39383894,"about_ca_system_score_codex":0.000112902206,"about_ca_system_score_gemma":0.00022378909,"threshold_uncertainty_score":0.54347867},"labels":[],"label_agreement":null},{"id":"W2156655069","doi":"10.1109/icra.2013.6630995","title":"Fair subdivision of multi-robot tasks","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Task (project management); Robot; Subdivision; Computer science; Fair division; Function (biology); Division (mathematics); Motion planning; Preference; Task analysis; Robot kinematics; Mathematical optimization; Artificial intelligence; Mobile robot; Mathematics; Engineering","score_opus":0.03386560444709738,"score_gpt":0.2758191579590691,"score_spread":0.2419535535119717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156655069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017721473,0.000011243438,0.99074274,0.000709612,0.000060626622,0.00014918392,1.9829756e-7,0.0000887483,0.006465516],"genre_scores_gemma":[0.6706099,0.000008459787,0.32595655,0.00021003593,0.0000044820936,0.0000070310894,8.7984137e-7,0.0000026620608,0.0031999978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943227,0.000028546232,0.0001290734,0.0001350336,0.00015167652,0.0001234315],"domain_scores_gemma":[0.9994839,0.000027003014,0.000030716936,0.0002646818,0.00012891291,0.000064774526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107504624,0.000046014724,0.00006586851,0.000056775745,0.00003040441,0.000061871855,0.0003934882,0.00002534902,0.00046469137],"category_scores_gemma":[0.00002061139,0.000034383036,0.000025270934,0.00018425674,0.000021765856,0.00041423293,0.00016723975,0.000041629915,0.00037207606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033473302,0.0009388302,0.010977572,0.00008785195,0.00003827241,0.000004245808,0.0024863963,0.02165386,0.036907874,0.5096111,0.04551038,0.37178022],"study_design_scores_gemma":[0.00020889113,0.000038739592,0.005381564,0.0000048377465,2.8940715e-7,6.4966724e-7,0.000013994059,0.9894211,0.0037039884,0.0006229568,0.00054480904,0.000058180533],"about_ca_topic_score_codex":0.00016201164,"about_ca_topic_score_gemma":0.00000678249,"teacher_disagreement_score":0.96776724,"about_ca_system_score_codex":0.000005539907,"about_ca_system_score_gemma":0.000018363202,"threshold_uncertainty_score":0.5088045},"labels":[],"label_agreement":null},{"id":"W2156885983","doi":"10.1007/978-3-319-18263-6_22","title":"Primal-Dual Algorithms for Precedence Constrained Covering Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Cover (algebra); Bounded function; Upper and lower bounds; Antichain; Order (exchange); Discrete mathematics; Integer (computer science); Algorithm; Partially ordered set; Computer science","score_opus":0.05693307988904808,"score_gpt":0.29515101427188606,"score_spread":0.23821793438283798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156885983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031917596,0.0003118093,0.989921,0.0008829045,0.0013781633,0.001464786,0.000025996582,0.0002721072,0.0057400665],"genre_scores_gemma":[0.0074208314,0.00005399611,0.98983794,0.0007008679,0.00040798896,0.000070428716,0.000020958367,0.000050680937,0.0014362828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542284,0.00004151853,0.00064248056,0.001679736,0.0012945922,0.0009188475],"domain_scores_gemma":[0.99682504,0.00049856276,0.0003279033,0.0010843236,0.000902412,0.00036177863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019805976,0.00054953696,0.00057233084,0.00063126005,0.0002990279,0.0009191557,0.002789613,0.0003402721,0.000027341184],"category_scores_gemma":[0.0002584258,0.0005130053,0.00013237602,0.0005880072,0.0008306286,0.0009973824,0.0012626018,0.0006627464,0.000029415924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009538337,0.00004654566,0.000009596238,0.00013280599,0.000019098408,0.000026825894,0.0012699236,0.41389945,0.00016204626,0.05356215,0.00014224432,0.53071976],"study_design_scores_gemma":[0.00059301924,0.00035818826,0.0000036818,0.00033635873,0.0000051063885,0.00007107959,2.2799591e-7,0.8715338,0.00035065057,0.12035859,0.0057709576,0.0006183329],"about_ca_topic_score_codex":0.000011615236,"about_ca_topic_score_gemma":0.000028602224,"teacher_disagreement_score":0.5301014,"about_ca_system_score_codex":0.00040204314,"about_ca_system_score_gemma":0.0016815828,"threshold_uncertainty_score":0.99973214},"labels":[],"label_agreement":null},{"id":"W2157076224","doi":"10.5555/1661445.1661506","title":"Interruptible algorithms for multiproblem solving","year":2009,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Schedule; Foreknowledge; Scheduling (production processes); Computation; Algorithm; Processor scheduling; Job shop scheduling; Quality (philosophy); Mathematical optimization; Mathematics","score_opus":0.024700001194537267,"score_gpt":0.2634747051448908,"score_spread":0.23877470395035352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157076224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064742885,0.00015564464,0.95497185,0.018709227,0.00009381097,0.00038003165,0.0000049813743,0.0003422626,0.024694735],"genre_scores_gemma":[0.22085917,0.00007785277,0.7713165,0.00045777718,0.00001329421,0.000035086836,0.000037893333,0.000013575988,0.007188836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755114,0.00095751695,0.00033032976,0.0005030896,0.00026990875,0.0003880173],"domain_scores_gemma":[0.996565,0.0006504812,0.0001576245,0.0010716558,0.0013802476,0.00017498372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033458495,0.00016064264,0.00017051441,0.00016017293,0.00038670746,0.0005568031,0.0013582737,0.00007966514,0.000033820856],"category_scores_gemma":[0.0006967683,0.00016380576,0.00011410635,0.0004913929,0.000062379244,0.00055724353,0.00026683087,0.00016572043,0.000038790608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046291634,0.00039377433,0.00011890363,0.00002398914,0.000016555576,0.0000016530712,0.0069362824,0.00036004916,0.005038173,0.64094365,0.0017902497,0.3443721],"study_design_scores_gemma":[0.0008930696,0.0000021849883,0.00047334275,0.00027429484,0.0000049271357,0.000008782714,0.00005019759,0.9348958,0.029667834,0.01218068,0.021251462,0.0002974013],"about_ca_topic_score_codex":0.00007171386,"about_ca_topic_score_gemma":0.000085089654,"teacher_disagreement_score":0.9345358,"about_ca_system_score_codex":0.000054258264,"about_ca_system_score_gemma":0.00010674372,"threshold_uncertainty_score":0.6679805},"labels":[],"label_agreement":null},{"id":"W2157321916","doi":"10.1109/tsmcb.2005.863379","title":"Parameter learning from stochastic teachers and stochastic compulsive liars","year":2006,"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":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Learning automata; Computer science; Point (geometry); Artificial intelligence; Interval (graph theory); Mechanism (biology); Automaton; Machine learning; Mathematics; Epistemology","score_opus":0.0175080524577038,"score_gpt":0.22762643723040316,"score_spread":0.21011838477269934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157321916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04540367,0.0005528017,0.95145565,0.00022621047,0.0007432708,0.0006394605,0.000025540941,0.0002514608,0.0007019383],"genre_scores_gemma":[0.99146205,0.00009448988,0.003217395,0.00011080674,0.000119133416,0.00008514738,0.00001444298,0.00005204124,0.0048444816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970235,0.0003222401,0.000623055,0.0008743328,0.00056811614,0.00058872],"domain_scores_gemma":[0.99821824,0.00056141085,0.00020832515,0.0005223186,0.00014330297,0.000346407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028961955,0.00044003903,0.00047491162,0.00026026965,0.00040548714,0.0007162131,0.00039876284,0.0002237743,0.00003432323],"category_scores_gemma":[0.000015703532,0.00044298306,0.00009827674,0.0003083598,0.0002753461,0.00023228675,0.000020666603,0.0006407308,0.00009695503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024326242,0.00023272488,0.00008718977,0.00003557633,0.00011188169,0.000015168086,0.0023309814,0.9836252,0.00018819363,0.003584643,0.0005681139,0.009196002],"study_design_scores_gemma":[0.0015126895,0.00042896272,0.0005919376,0.00024564553,0.00009384694,0.00005315244,0.0003959925,0.99250364,0.0001581435,0.0011628437,0.0021260327,0.0007271234],"about_ca_topic_score_codex":0.0009334852,"about_ca_topic_score_gemma":0.00014392917,"teacher_disagreement_score":0.94823825,"about_ca_system_score_codex":0.00007343944,"about_ca_system_score_gemma":0.000050353505,"threshold_uncertainty_score":0.9998022},"labels":[],"label_agreement":null},{"id":"W2157761976","doi":"10.1016/j.ejor.2004.01.049","title":"Data dependent worst case bounds for weighted set packing","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Set (abstract data type); Computer science; Mathematical optimization; Set packing; Combinatorics; Mathematics; Algorithm","score_opus":0.28979600900726327,"score_gpt":0.4341920657037415,"score_spread":0.14439605669647826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157761976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008357499,0.0001698317,0.97814506,0.009901764,0.00023159587,0.00026737066,0.000053422278,0.000016983542,0.0028564436],"genre_scores_gemma":[0.7691954,0.00008248173,0.22914721,0.000350051,0.00049481174,0.0000030430617,0.000047128076,0.000023503631,0.0006563968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969243,0.0007860482,0.0004806639,0.00027839647,0.0011891709,0.00034144495],"domain_scores_gemma":[0.9970936,0.00029932312,0.00010413183,0.0005315699,0.0017191961,0.00025217954],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010513001,0.00008953226,0.00011923264,0.00034170708,0.0006380405,0.0010979716,0.0018731317,0.000017989558,0.00006460175],"category_scores_gemma":[0.0007882438,0.00007254595,0.000046171623,0.00044469905,0.00008231606,0.0014503687,0.00067575084,0.00046856905,0.000066686414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051463867,0.0015025435,0.00051714806,0.00015571371,0.00050054933,0.043080516,0.010397879,0.15819131,0.0059137153,0.56167096,0.1168615,0.10069351],"study_design_scores_gemma":[0.016537752,0.00460376,0.0012184527,0.000624902,0.000029332461,0.027008342,0.0013954403,0.61896306,0.002415611,0.022921324,0.30313405,0.0011479341],"about_ca_topic_score_codex":0.0000065343906,"about_ca_topic_score_gemma":0.000016972108,"teacher_disagreement_score":0.76083785,"about_ca_system_score_codex":0.00012048087,"about_ca_system_score_gemma":0.0008411993,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W2160650170","doi":"","title":"Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex hull; Cache; Cache-oblivious algorithm; Parallel computing; Combinatorics; Computer science; Cache algorithms; Block size; CPU cache; Algorithm; Mathematics; Regular polygon; Geometry; Key (lock)","score_opus":0.03535666633472642,"score_gpt":0.27830733210590486,"score_spread":0.24295066577117844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160650170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0283744,0.000038291535,0.89288235,0.0077708266,0.0010229242,0.000525817,0.00009343937,0.00025180294,0.06904016],"genre_scores_gemma":[0.96045655,0.0000015382915,0.030504731,0.0070222793,0.00009696586,0.0000058916867,0.000121190074,0.000016954913,0.0017739149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974022,0.00010334598,0.00037199285,0.0006392716,0.000735965,0.00074721855],"domain_scores_gemma":[0.997021,0.00051704014,0.000110351975,0.00035749882,0.00092116196,0.001072943],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008239604,0.00024823908,0.00024184068,0.001191236,0.00035747807,0.00029950123,0.0006301748,0.00012020368,0.00042510268],"category_scores_gemma":[0.00015460933,0.00026702805,0.0000796156,0.0011414874,0.00014998292,0.000312355,0.00010239743,0.0003742547,0.0012710418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021097005,0.000105886895,0.00064900314,0.000011577365,0.00006793236,0.0004553143,0.000585801,0.24561827,0.000046607805,0.6999415,0.009012252,0.043484736],"study_design_scores_gemma":[0.0012823895,0.00019542554,0.017395493,0.00006466841,0.000007328268,0.00013690404,0.000113309296,0.95546144,0.0001857817,0.019448439,0.0049608033,0.00074803084],"about_ca_topic_score_codex":0.005117494,"about_ca_topic_score_gemma":0.008995122,"teacher_disagreement_score":0.9320821,"about_ca_system_score_codex":0.00034710765,"about_ca_system_score_gemma":0.0019602578,"threshold_uncertainty_score":0.9999782},"labels":[],"label_agreement":null},{"id":"W2161327891","doi":"10.1109/mass.2011.90","title":"On the Complexity of the Multi-Robot, Multi-Depot Map Visitation Problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Robot; Computer science; Focus (optics); Variety (cybernetics); Graph; Boundary (topology); Mobile robot; Artificial intelligence; Computational complexity theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.20354168223318253,"score_gpt":0.2978061462751105,"score_spread":0.09426446404192795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161327891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061236176,0.0000061784494,0.9876211,0.0037124834,0.00012642796,0.00070001034,0.0000014809079,0.00008601103,0.0071339016],"genre_scores_gemma":[0.5098899,0.000002146092,0.48764798,0.0007871071,0.0000050504545,0.000029177683,7.86246e-7,0.0000057759853,0.0016320987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989731,0.00019543724,0.00020595088,0.00019993114,0.00025904787,0.00016654412],"domain_scores_gemma":[0.99907315,0.000081260136,0.00010454072,0.0005524662,0.0001461308,0.000042472842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003960017,0.00008895726,0.00008361128,0.00003837676,0.00018272534,0.000051468618,0.0009754699,0.000032816024,0.00017171465],"category_scores_gemma":[0.00004806158,0.000043657965,0.000060467537,0.0002595141,0.00019553621,0.00018751464,0.00024555842,0.00012436302,0.00009267672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050634576,0.00031418208,0.0005208976,0.000015616019,0.000013300425,3.815141e-7,0.0038861702,0.0021168042,0.0005507589,0.99002814,0.0009019867,0.0016466747],"study_design_scores_gemma":[0.00061144994,0.00010199567,0.020811379,0.000033210017,0.0000031581544,0.0000014926529,0.00013031825,0.94847995,0.0066702254,0.022745894,0.00027181464,0.00013909511],"about_ca_topic_score_codex":0.00014089991,"about_ca_topic_score_gemma":0.000122043995,"teacher_disagreement_score":0.9672823,"about_ca_system_score_codex":0.00001526655,"about_ca_system_score_gemma":0.000038506067,"threshold_uncertainty_score":0.1880155},"labels":[],"label_agreement":null},{"id":"W2161493293","doi":"10.1109/crv.2009.30","title":"Optimal Online Data Sampling or How to Hire the Best Secretaries","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Generalization; Sampling (signal processing); Sample (material); Selection (genetic algorithm); Secretary problem; Simple (philosophy); Artificial intelligence; Machine learning; Online algorithm; Sequence (biology); Data mining; Mathematical optimization; Algorithm; Mathematics; Computer vision","score_opus":0.17328021812413524,"score_gpt":0.3577267200153544,"score_spread":0.18444650189121914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161493293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081340224,0.000026799042,0.9001545,0.09776248,0.00007033352,0.00017150948,0.0000127575495,0.000112988426,0.00087524],"genre_scores_gemma":[0.040852938,0.000033626042,0.9451671,0.0069416272,0.00008438875,0.000002356754,0.000052552637,0.000004690057,0.0068606837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990754,0.000033252072,0.00010731181,0.00031649496,0.00023458856,0.00023292452],"domain_scores_gemma":[0.99862504,0.000087906716,0.000023052118,0.0010751446,0.00007934464,0.00010948453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002624671,0.000085650696,0.00008508806,0.00004268623,0.00020456596,0.00064469886,0.0020919957,0.000025633008,0.000073659],"category_scores_gemma":[0.00015633882,0.00004662543,0.000015284611,0.000382459,0.00002559697,0.0007435672,0.0006515063,0.0001054011,0.00004524158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065806125,0.0006059946,0.00027855992,0.000020221929,0.00005652435,0.00003695158,0.0049762847,0.17679833,0.0005063056,0.16146874,0.092715465,0.5624708],"study_design_scores_gemma":[0.0001480642,0.00019947662,0.00028322492,0.000012165436,0.0000026698754,0.000010759228,0.0003358472,0.8994213,0.00005665726,0.00022108859,0.099170595,0.00013819136],"about_ca_topic_score_codex":0.0000209593,"about_ca_topic_score_gemma":0.00010575278,"teacher_disagreement_score":0.72262293,"about_ca_system_score_codex":0.000010159007,"about_ca_system_score_gemma":0.0000896837,"threshold_uncertainty_score":0.6216846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02106864386116119,"score_gpt":0.2554649759567687,"score_spread":0.2343963320956075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162964807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012443998,0.00004785169,0.98931295,0.004346452,0.00019439468,0.0019634254,0.000026773925,0.00036100077,0.0025027606],"genre_scores_gemma":[0.8767856,0.000046520596,0.11169612,0.0012756261,0.0002623078,0.0010313554,0.000037537284,0.00008336748,0.008781582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968582,0.00020919109,0.00061566965,0.0007707629,0.0008569893,0.0006892118],"domain_scores_gemma":[0.99775314,0.00031993864,0.00017299545,0.0008118971,0.00039613413,0.0005458776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001128038,0.00034378291,0.00026670526,0.00038686136,0.0010320344,0.00055541476,0.00066059426,0.00015164005,0.000024868083],"category_scores_gemma":[0.000010685548,0.00028679444,0.00007979531,0.0011510489,0.00012900466,0.00018423292,0.000021003832,0.00055070606,0.0003246515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004961841,0.00027066516,0.000019005534,0.00003209281,0.000048073733,0.0000028056977,0.0012065896,0.98107004,0.00011162083,0.005278312,0.001308188,0.010603004],"study_design_scores_gemma":[0.0007199499,0.0008166942,0.00017890916,0.000135998,0.00004528743,0.000048932165,0.00056272215,0.58488494,0.00068270153,0.000023367043,0.41142133,0.00047919078],"about_ca_topic_score_codex":0.00010282937,"about_ca_topic_score_gemma":0.00024860783,"teacher_disagreement_score":0.8776168,"about_ca_system_score_codex":0.00014330384,"about_ca_system_score_gemma":0.00016213782,"threshold_uncertainty_score":0.9999584},"labels":[],"label_agreement":null},{"id":"W2163134916","doi":"10.1016/j.tcs.2015.09.025","title":"Fast rendezvous with advice","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Oracle; Advice (programming); Set (abstract data type); Node (physics); Upper and lower bounds; Integer (computer science); String (physics); Algorithm; Mathematics","score_opus":0.01677587884675006,"score_gpt":0.25703540298749517,"score_spread":0.2402595241407451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163134916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011110288,0.000010735262,0.96248776,0.0021576774,0.00024479243,0.00012611071,4.1771975e-7,0.00042347927,0.033438027],"genre_scores_gemma":[0.55570155,0.0000011452021,0.44344917,0.00072985963,0.00004876093,0.0000042786373,3.8564102e-7,0.0000051247175,0.000059690305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975357,0.00009609945,0.00017096724,0.00059892156,0.001056554,0.0005417253],"domain_scores_gemma":[0.99798524,0.00007773457,0.00004439159,0.0007732126,0.0004818431,0.00063755683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013787809,0.00014046885,0.00013947829,0.00015972333,0.00023942841,0.0006047863,0.0023395915,0.000031394397,0.00002574274],"category_scores_gemma":[0.00006406738,0.00009783491,0.000022756276,0.001627628,0.0019035524,0.00096657604,0.0008611476,0.00016842168,0.00017917443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008043766,0.000040342566,0.00003416284,0.0000019598997,0.0000017389657,0.000016317083,0.00071316835,0.0040686396,0.000016892871,0.9772207,0.00029361175,0.017584387],"study_design_scores_gemma":[0.00040063195,0.0004676999,0.000095475676,0.0000150094,0.0000015100261,0.000087805965,0.00001565206,0.9507339,0.00038300853,0.046894692,0.0007082392,0.00019636602],"about_ca_topic_score_codex":0.00000398102,"about_ca_topic_score_gemma":9.0293184e-7,"teacher_disagreement_score":0.9466653,"about_ca_system_score_codex":0.000060759598,"about_ca_system_score_gemma":0.0003661549,"threshold_uncertainty_score":0.70137185},"labels":[],"label_agreement":null},{"id":"W2164204765","doi":"10.1108/17563780911005881","title":"Graph exploration with robot swarms","year":2009,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Swarm behaviour; Swarm robotics; Computer science; Robot; Correctness; Ant robotics; Graph; Simultaneous localization and mapping; Artificial intelligence; Robotics; Theoretical computer science; Algorithm; Mobile robot; Robot control","score_opus":0.021746895593147433,"score_gpt":0.2855692519064286,"score_spread":0.2638223563132812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164204765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013214396,0.00019152003,0.98155415,0.0038118497,0.00037670735,0.000047560534,2.6842088e-7,0.000026424575,0.00077713514],"genre_scores_gemma":[0.8921097,0.00040892125,0.106710605,0.00055327296,0.00014464826,1.6419108e-7,0.0000012872941,0.000004100616,0.000067302564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.000043914344,0.00037534727,0.00013068326,0.0005208214,0.00012738361],"domain_scores_gemma":[0.99869436,0.00006470438,0.00027274256,0.00010039399,0.0007656827,0.000102127706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032370258,0.00009809942,0.000120442804,0.00021535209,0.00005102071,0.00030529147,0.0005739642,0.00003097749,0.000005598251],"category_scores_gemma":[0.000040575622,0.00007468639,0.00004723644,0.00016029939,0.000034052853,0.0003689006,0.0000632463,0.00017333582,0.0000038836533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007169308,0.0002972109,0.0009610526,0.000005028308,0.0001411324,0.000113466485,0.004477413,0.26857606,0.0004042268,0.099679634,0.0006444718,0.6246286],"study_design_scores_gemma":[0.0021689779,0.0034747021,0.0053446703,0.00070195866,0.00003605511,0.0017700214,0.0007241097,0.8898689,0.01269575,0.073103644,0.00939453,0.00071667077],"about_ca_topic_score_codex":0.0000032805588,"about_ca_topic_score_gemma":0.0000011661941,"teacher_disagreement_score":0.8788953,"about_ca_system_score_codex":0.000029731442,"about_ca_system_score_gemma":0.000049020466,"threshold_uncertainty_score":0.30456224},"labels":[],"label_agreement":null},{"id":"W2164399703","doi":"10.1007/978-3-540-92862-1_11","title":"Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Asynchronous communication; Visibility; Computer science; RADIUS; Software deployment; Mobile robot; Space (punctuation); Distributed computing; Real-time computing; Robot; Artificial intelligence; Computer network; Physics; Operating system","score_opus":0.018289782234800583,"score_gpt":0.23551771006421018,"score_spread":0.2172279278294096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164399703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033580625,0.00027097602,0.99646175,0.00032616514,0.00063059095,0.00043855977,0.0000018757925,0.00004565295,0.0014886017],"genre_scores_gemma":[0.3414918,0.00092162035,0.6555316,0.00088405964,0.00020487701,0.00001720177,0.000010919084,0.00006252176,0.0008754169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962774,0.00006323242,0.00067498913,0.0011597225,0.0012063999,0.00061826],"domain_scores_gemma":[0.9982817,0.00024266483,0.00027509392,0.00095446454,0.000072839815,0.00017322853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056403707,0.00040530832,0.00053307327,0.0009339886,0.0001169175,0.00010626725,0.0020495583,0.00023541266,0.000037564798],"category_scores_gemma":[0.00004380182,0.0003857793,0.00010640467,0.00056410494,0.0007285219,0.000389159,0.0010216319,0.00062751194,0.00003699348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036692106,0.00008044222,0.0002887032,0.000023782957,0.000007872756,0.000086717846,0.00070689776,0.8805655,0.00007127001,0.0040636626,0.00001047328,0.11409097],"study_design_scores_gemma":[0.0005092304,0.00023823635,0.0008976361,0.00031484096,0.0000035140954,0.00008182794,1.223139e-7,0.9879836,0.0007232171,0.0075809592,0.0011134678,0.00055334397],"about_ca_topic_score_codex":0.00001567245,"about_ca_topic_score_gemma":0.000053868564,"teacher_disagreement_score":0.341156,"about_ca_system_score_codex":0.00038295588,"about_ca_system_score_gemma":0.000523728,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W2165056932","doi":"10.1109/tsmcb.2007.912744","title":"Video-on-Demand Network Design and Maintenance Using Fuzzy Optimization","year":2008,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Research Manitoba","funders":"","keywords":"Computer science; Problem statement; Fuzzy logic; Process (computing); Function (biology); Heuristic; Bundle; Cache; Mathematical optimization; Statement (logic); Optimization problem; Order (exchange); Operations research; Algorithm; Artificial intelligence; Computer network; Mathematics; Engineering; Management science","score_opus":0.042047637074989576,"score_gpt":0.24412478032640683,"score_spread":0.20207714325141726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165056932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002980266,0.0004876518,0.99300444,0.00019802577,0.0008977432,0.00088652753,0.000008431792,0.00019530999,0.0013416251],"genre_scores_gemma":[0.90442985,0.0037446548,0.087023616,0.0004563452,0.00018715205,0.00009065117,0.0000036333972,0.00007138787,0.0039927107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969714,0.00041292034,0.000615231,0.0008070287,0.0005450089,0.0006483938],"domain_scores_gemma":[0.998313,0.00026877713,0.00019758122,0.00063284184,0.00020048617,0.0003872884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005693708,0.00041062504,0.0004305727,0.00022035863,0.00070856937,0.00037287237,0.00037623176,0.00021594473,0.000020389523],"category_scores_gemma":[0.0000101876785,0.00039771874,0.00007998618,0.0005015103,0.00026601477,0.00029966809,0.000015527923,0.00035663188,0.00003575251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003441987,0.00010430151,0.00004372022,0.00003526372,0.000046331206,0.000023003166,0.00054580165,0.99347264,0.000037814134,0.00345755,0.001352099,0.0008470599],"study_design_scores_gemma":[0.0010479328,0.00041050254,0.000065731925,0.00025523407,0.00003333978,0.00024747374,0.000044525525,0.99460036,0.00025768136,0.00026852582,0.00228351,0.00048518664],"about_ca_topic_score_codex":0.00006076906,"about_ca_topic_score_gemma":0.000008749129,"teacher_disagreement_score":0.9059808,"about_ca_system_score_codex":0.000078234574,"about_ca_system_score_gemma":0.000086933316,"threshold_uncertainty_score":0.9998475},"labels":[],"label_agreement":null},{"id":"W2165265954","doi":"10.1109/ccc.1997.612318","title":"On randomization in online computation","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomized algorithm; Bounding overwatch; Online algorithm; Computer science; Maximization; Bounded function; Equivalence (formal languages); Competitive analysis; Randomized experiment; Computation; Theoretical computer science; Algorithm; Mathematics; Mathematical optimization; Artificial intelligence; Discrete mathematics; Upper and lower bounds; Statistics","score_opus":0.033799906852864846,"score_gpt":0.27200543788645154,"score_spread":0.2382055310335867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165265954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025445651,0.000008076557,0.9788845,0.0021011352,0.000058176134,0.00012963888,2.286861e-7,0.00009114285,0.016182536],"genre_scores_gemma":[0.90528065,0.000030087027,0.09177245,0.0013297753,0.000011418884,0.000005171707,0.000008243793,0.0000035521086,0.0015586794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.000055902365,0.00011831824,0.00012441633,0.00012561407,0.00008655657],"domain_scores_gemma":[0.9997561,0.000074127915,0.000019637375,0.00009021618,0.000031915533,0.000028029963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011083554,0.00003955149,0.000055926008,0.00012766727,0.000024536821,0.00005247815,0.0001274134,0.000019207937,0.00015609134],"category_scores_gemma":[0.000040611085,0.000033645978,0.000012582833,0.00034583203,0.000006171348,0.00021214092,0.000022674141,0.000047648202,0.00011495009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130520875,0.0004064736,0.00018508206,0.000004428031,0.0000024984547,0.0000043307055,0.0006128028,0.71312267,0.00002723054,0.18950664,0.0048892954,0.09122551],"study_design_scores_gemma":[0.0018210235,0.0000321416,0.00026190138,0.0000050390086,1.4720078e-7,6.076306e-7,0.0000039595775,0.99504507,0.000020110008,0.0026226912,0.00014505109,0.000042252494],"about_ca_topic_score_codex":0.0000057280035,"about_ca_topic_score_gemma":0.000012744181,"teacher_disagreement_score":0.90273607,"about_ca_system_score_codex":0.000017422966,"about_ca_system_score_gemma":0.000004058685,"threshold_uncertainty_score":0.17090908},"labels":[],"label_agreement":null},{"id":"W2168718726","doi":"10.1109/spdp.1995.530717","title":"Competitive dynamic multiprocessor allocation for parallel applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Preemption; Multiprocessor scheduling; Multiprocessing; Computer science; Parallel computing; Scheduling (production processes); Job shop scheduling; Competitive analysis; Processor scheduling; Execution time; Distributed computing; Upper and lower bounds; Flow shop scheduling; Mathematical optimization; Operating system; Schedule; Mathematics","score_opus":0.026572515656617446,"score_gpt":0.27737270082422893,"score_spread":0.2508001851676115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168718726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058743426,0.00004512007,0.97537017,0.0040807123,0.000024160408,0.0006963072,0.0000027074718,0.00019314255,0.019581797],"genre_scores_gemma":[0.19169764,0.0000769827,0.79698783,0.0008149159,0.000016859234,0.0009542404,0.000021774817,0.000007636957,0.009422093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993824,0.000014065205,0.00012318278,0.00022408488,0.000106622996,0.00014967294],"domain_scores_gemma":[0.9994209,0.00007372662,0.00003677471,0.00022437118,0.00018498044,0.000059286693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008243123,0.000061729734,0.00006113524,0.00005451998,0.00013422185,0.000087825974,0.0003633801,0.000028062079,0.000084873216],"category_scores_gemma":[0.000016528695,0.000056478948,0.000028557753,0.0002219145,0.000023512275,0.00028543887,0.00004239174,0.000037381487,0.00018547392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.645436e-7,0.00010884667,0.000009900597,0.000015511543,0.0000062017657,8.1139156e-8,0.00029969914,0.004237613,0.00011856519,0.9602798,0.0009133819,0.03400943],"study_design_scores_gemma":[0.00031861884,0.00002619531,0.000047145615,0.000002540507,0.0000011379447,9.690322e-7,0.000030262301,0.9517855,0.000060591905,0.0027640236,0.044882372,0.000080661564],"about_ca_topic_score_codex":0.0000025941363,"about_ca_topic_score_gemma":0.000016696584,"teacher_disagreement_score":0.9575158,"about_ca_system_score_codex":0.00002272016,"about_ca_system_score_gemma":0.000011999179,"threshold_uncertainty_score":0.2383954},"labels":[],"label_agreement":null},{"id":"W2168975199","doi":"10.5555/1898699.1898769","title":"Optimal map construction of an unknown torus","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Torus; Security token; Node (physics); Enhanced Data Rates for GSM Evolution; Computer science; Multi-agent system; Mathematics; Algorithm; Combinatorics; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Geometry; Computer network; Physics","score_opus":0.009185106305420774,"score_gpt":0.23622643331773757,"score_spread":0.2270413270123168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168975199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012159462,0.000010328018,0.9540278,0.0005249103,0.00015034222,0.00006766093,5.7717705e-7,0.00011183298,0.03294713],"genre_scores_gemma":[0.16985206,0.000001732803,0.82819796,0.000046730554,0.000030415342,0.0000019967356,0.000003755392,0.0000024538724,0.001862928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994975,0.000026654103,0.00012139129,0.0001245746,0.00012982932,0.000100060985],"domain_scores_gemma":[0.9996589,0.000010060789,0.00003162614,0.00018484022,0.0000785374,0.00003604935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009563942,0.00003996563,0.000054430995,0.00005092283,0.000034876844,0.000049148442,0.00021076584,0.00002428108,0.00009624605],"category_scores_gemma":[0.000002810489,0.000034771216,0.000017483488,0.00013926727,0.000041890566,0.00038008488,0.00004721138,0.000030496638,0.000019811867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024688595,0.00007377298,0.00025720467,0.0000065877416,0.0000026334305,0.0000015772646,0.000058004167,0.030095633,0.00068753277,0.94812924,0.0013785084,0.019306835],"study_design_scores_gemma":[0.0004072999,0.0001522445,0.000794959,0.000005030755,0.0000013853165,0.000015347683,0.00003045286,0.96393955,0.014848305,0.00570934,0.013965516,0.00013056217],"about_ca_topic_score_codex":0.00008998844,"about_ca_topic_score_gemma":0.000012673,"teacher_disagreement_score":0.9424199,"about_ca_system_score_codex":0.000008501775,"about_ca_system_score_gemma":0.00002964782,"threshold_uncertainty_score":0.1417929},"labels":[],"label_agreement":null},{"id":"W2170631384","doi":"10.1007/978-3-642-17461-2_5","title":"Time Optimal Algorithms for Black Hole Search in Rings","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Computer science; Focus (optics); Black hole (networking); Ring (chemistry); Algorithm; Upper and lower bounds; Search problem; Ring network; Asymptotically optimal algorithm; Time complexity; Mathematics; Physics; Routing (electronic design automation); Network topology; Computer network","score_opus":0.02585653393387138,"score_gpt":0.28064994063781584,"score_spread":0.25479340670394446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170631384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013677427,0.000058771788,0.9946448,0.0014592569,0.0006246313,0.0009123293,0.000009248205,0.00012939685,0.0020247633],"genre_scores_gemma":[0.0043599843,0.000030242223,0.9918269,0.00092119176,0.00033002286,0.000024810979,0.000012381004,0.00004570086,0.0024487781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592507,0.000036039066,0.00051377335,0.001573707,0.0009903787,0.0009610568],"domain_scores_gemma":[0.9976307,0.00049506855,0.00014160802,0.0011034902,0.0003842666,0.00024486778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017801565,0.00044222613,0.0004930494,0.0011609065,0.00021919557,0.00071506994,0.0036544388,0.00044656248,0.00006313241],"category_scores_gemma":[0.00010110114,0.00042270822,0.00012757731,0.00073434087,0.0011270074,0.00070532784,0.0014303527,0.0013406046,0.00014817948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009390536,0.000057543,0.000011396733,0.000057747984,0.000006976599,0.00004445012,0.0019497413,0.7127439,0.000525885,0.007811911,0.000038685237,0.27674237],"study_design_scores_gemma":[0.00045218412,0.00018866533,0.0000190306,0.00015849972,0.0000017383467,0.000010740077,1.6919103e-7,0.9801475,0.0014447728,0.014773489,0.0023179206,0.00048529718],"about_ca_topic_score_codex":0.000018026562,"about_ca_topic_score_gemma":0.000035213743,"teacher_disagreement_score":0.27625707,"about_ca_system_score_codex":0.00021055796,"about_ca_system_score_gemma":0.00072024047,"threshold_uncertainty_score":0.9998225},"labels":[],"label_agreement":null},{"id":"W2171151410","doi":"10.1142/s021819590200089x","title":"ONLINE ROUTING IN CONVEX SUBDIVISIONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Delaunay triangulation; Mathematics; Combinatorics; Destination-Sequenced Distance Vector routing; Discrete mathematics; Computer science; Mathematical optimization; Link-state routing protocol; Routing (electronic design automation); Computer network","score_opus":0.030471045598837843,"score_gpt":0.3160281218117496,"score_spread":0.28555707621291176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171151410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003782296,0.00022415609,0.98823506,0.0058118496,0.00025298397,0.00021719304,0.000022363032,0.000040522133,0.0014135871],"genre_scores_gemma":[0.84572583,0.00012971053,0.15281211,0.0007877955,0.0002800515,0.000025144918,0.000032513504,0.0000104566325,0.00019640097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768585,0.00007319826,0.00083533756,0.00022539686,0.0009810976,0.0001991445],"domain_scores_gemma":[0.99744105,0.0004537349,0.00044676237,0.00018464094,0.0013280639,0.0001457565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044314674,0.0001268354,0.00019831184,0.0010294203,0.00009129278,0.00021243819,0.0014896414,0.000055993278,0.00025259008],"category_scores_gemma":[0.00010948189,0.00012702824,0.000120813536,0.0011728911,0.00005799036,0.00072908186,0.00018753797,0.00033017105,0.00009612517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011504025,0.002134141,0.0064289793,0.000011527477,0.00016842573,0.000058075348,0.00060778705,0.46453473,0.00009693671,0.3252828,0.0019743135,0.19869079],"study_design_scores_gemma":[0.0016555529,0.00009212703,0.0135160955,0.000071865165,0.000008590011,0.0003280585,0.000096792886,0.88636637,0.000042778927,0.04899436,0.048540596,0.00028680483],"about_ca_topic_score_codex":0.000005274352,"about_ca_topic_score_gemma":0.0000029169494,"teacher_disagreement_score":0.8419435,"about_ca_system_score_codex":0.00014073045,"about_ca_system_score_gemma":0.00010097241,"threshold_uncertainty_score":0.51800615},"labels":[],"label_agreement":null},{"id":"W2172011606","doi":"10.1109/tencon.1990.152584","title":"The ship model-a new computational model for distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Washington","keywords":"Computer science; Locality; Code (set theory); Computation; Distributed computing; Telecommunications network; Work (physics); Computer network; Programming language; Engineering","score_opus":0.09684850345121622,"score_gpt":0.2785134781629585,"score_spread":0.1816649747117423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172011606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000085691645,0.000080474754,0.9915241,0.005811409,0.00007946132,0.00032422427,0.000013065169,0.00015022518,0.002008459],"genre_scores_gemma":[0.36453927,0.000027474925,0.59706324,0.000621271,0.000040962874,0.00007105076,0.000033122804,0.000011441079,0.037592206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991402,0.000023118231,0.00017906944,0.00018651648,0.00024483085,0.00022625591],"domain_scores_gemma":[0.99929523,0.0001618468,0.00003895872,0.0002349456,0.00015103066,0.00011796532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020101965,0.00007367058,0.00007142125,0.00002520776,0.00029623543,0.00042547847,0.0005561937,0.000031654512,0.0000079236615],"category_scores_gemma":[0.000030060191,0.00004913544,0.000042231677,0.00018069857,0.000021410411,0.0002606281,0.00007601841,0.000053452804,0.00002840595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.924918e-7,0.000008454446,0.0000016014619,0.000002041082,0.0000030350898,5.1812513e-8,0.00009048935,0.6205037,5.039031e-7,0.34298208,0.03564697,0.0007603169],"study_design_scores_gemma":[0.00027459938,0.0000135718055,0.000001987433,0.0000028276224,0.0000010532988,0.0000014110268,0.000005562819,0.9668709,9.522334e-7,0.03135159,0.0014041343,0.0000714074],"about_ca_topic_score_codex":0.000006939557,"about_ca_topic_score_gemma":0.000003823456,"teacher_disagreement_score":0.3944609,"about_ca_system_score_codex":0.000027745979,"about_ca_system_score_gemma":0.00006682861,"threshold_uncertainty_score":0.41028988},"labels":[],"label_agreement":null},{"id":"W2174619083","doi":"10.1016/j.tcs.2012.07.033","title":"On the competitiveness of AIMD-TCP within a general network","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Computer science; Router; Competitive analysis; Scheduling (production processes); Multiplicative function; Computer network; Distributed computing; Set (abstract data type); Mathematical optimization; Upper and lower bounds; Mathematics","score_opus":0.016616668126334232,"score_gpt":0.2587536619840035,"score_spread":0.2421369938576693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174619083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028725399,0.000017867138,0.96189433,0.0015257311,0.0007038321,0.00018161067,7.4280723e-7,0.0000734918,0.0068770032],"genre_scores_gemma":[0.87024057,0.0000021763587,0.12805603,0.0015156117,0.00015054719,0.000006575626,3.210643e-7,0.0000049468695,0.000023236465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977332,0.0003081533,0.00025891603,0.0003233239,0.00076475076,0.00061168766],"domain_scores_gemma":[0.99818593,0.0005762246,0.000088973444,0.0007116144,0.00019328849,0.00024397121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034315782,0.00013269829,0.00016675585,0.00008254649,0.00039702942,0.00018688242,0.00219479,0.00003339046,0.00013513134],"category_scores_gemma":[0.0001032111,0.00007981748,0.000055304317,0.0012657096,0.0023957994,0.00045126758,0.0008235894,0.00019560971,0.0000637675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005206586,0.000063980995,0.00023244148,0.0000028726802,0.000003048912,6.525487e-7,0.0005755405,0.014275291,0.00008951272,0.9833664,0.000059974926,0.001325108],"study_design_scores_gemma":[0.00013325163,0.00015698762,0.001578294,0.0000362868,0.0000018896104,0.000009727103,0.000005549127,0.86697876,0.0023599574,0.12846404,0.00013650043,0.00013878118],"about_ca_topic_score_codex":0.0000018578387,"about_ca_topic_score_gemma":1.7874389e-7,"teacher_disagreement_score":0.8549023,"about_ca_system_score_codex":0.000028188704,"about_ca_system_score_gemma":0.00009875814,"threshold_uncertainty_score":0.8827423},"labels":[],"label_agreement":null},{"id":"W2174851824","doi":"10.1016/j.tcs.2012.01.035","title":"More efficient periodic traversal in anonymous undirected graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Tree traversal; Undirected graph; Combinatorics; Graph; Set (abstract data type); Node (physics); Computer science; Mathematics; Period length; Discrete mathematics; Time complexity; Integer (computer science); Binary logarithm; Algorithm","score_opus":0.010685658302965768,"score_gpt":0.2572362291670868,"score_spread":0.24655057086412105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174851824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14842808,0.00003817551,0.84656507,0.0009541232,0.0005691954,0.00022090571,6.7754104e-7,0.00021888915,0.003004859],"genre_scores_gemma":[0.9063234,0.0000037976965,0.09313408,0.00047180912,0.000041860585,0.00000782481,7.8684275e-7,0.0000066977004,0.000009756997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972143,0.00016504893,0.00027141292,0.0005329737,0.00081855623,0.0009977033],"domain_scores_gemma":[0.9986118,0.00013753107,0.00004376307,0.0005997982,0.0001261014,0.00048098472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017604603,0.00017393785,0.00018838332,0.00044413333,0.000296245,0.0003524221,0.0017753761,0.000055935427,0.00007995266],"category_scores_gemma":[0.00007297395,0.00014445714,0.000056015804,0.0026786393,0.00213558,0.00060263235,0.0006791117,0.0002426716,0.00009587863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046858163,0.00017396444,0.0008655295,0.000003823864,0.0000014988397,0.000007045658,0.003078297,0.0037837317,0.00025222942,0.98407817,0.000020158768,0.0077308947],"study_design_scores_gemma":[0.00034607152,0.0000940325,0.010761337,0.000018302533,0.0000015417982,0.000031462932,0.000022977954,0.97917336,0.0007692759,0.008479576,0.000066785375,0.00023528418],"about_ca_topic_score_codex":0.0000063790053,"about_ca_topic_score_gemma":7.156308e-7,"teacher_disagreement_score":0.9755986,"about_ca_system_score_codex":0.000094634255,"about_ca_system_score_gemma":0.00014386271,"threshold_uncertainty_score":0.78686327},"labels":[],"label_agreement":null},{"id":"W2177060007","doi":"10.1609/icaps.v21i1.13467","title":"Closing the Gap: Improved Bounds on Optimal POMDP Solutions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology; University of Waterloo","funders":"","keywords":"Upper and lower bounds; Sawtooth wave; Benchmark (surveying); Partially observable Markov decision process; Mathematical optimization; Bellman equation; Function (biology); Interpolation (computer graphics); Computer science; Grid; Linear programming; Mathematics; Markov decision process; Markov process; Artificial intelligence","score_opus":0.11260743891545368,"score_gpt":0.30147540917280535,"score_spread":0.1888679702573517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177060007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8598687,0.00008353071,0.023065211,0.0109382365,0.0011090444,0.0005159429,0.000012947897,0.0009956917,0.10341069],"genre_scores_gemma":[0.97831064,0.000013270377,0.021097474,0.0003544672,0.000025907471,0.000012320784,0.0000013778593,0.000007765836,0.0001767685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888146,0.000014983254,0.0002460893,0.0002675651,0.0003596199,0.00023026133],"domain_scores_gemma":[0.99915874,0.00006344059,0.00021648445,0.00012446582,0.00037933863,0.0000575308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053640344,0.00013594571,0.00011233352,0.0001253541,0.00042152515,0.00040370572,0.0011372479,0.000061847844,0.000016157497],"category_scores_gemma":[0.00018339758,0.000086157146,0.00005162337,0.00019968985,0.00011261952,0.0003298883,0.00030297687,0.00030575428,0.000004783108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008717289,0.00012219335,0.0018137656,0.000022843864,0.00009960067,0.0000015907015,0.0063575343,0.0045111035,0.01823592,0.9666668,0.00039323955,0.0016882333],"study_design_scores_gemma":[0.00022540313,0.000100671,0.0014229657,0.00027129348,0.000005753807,0.000016374852,0.00047093123,0.9887826,0.0054954775,0.0030393465,0.000058087953,0.0001111159],"about_ca_topic_score_codex":0.00002599469,"about_ca_topic_score_gemma":5.2033715e-7,"teacher_disagreement_score":0.98427147,"about_ca_system_score_codex":0.000030976822,"about_ca_system_score_gemma":0.00006888214,"threshold_uncertainty_score":0.38929436},"labels":[],"label_agreement":null},{"id":"W2179376195","doi":"10.1016/j.tcs.2012.07.004","title":"Gathering asynchronous oblivious agents with local vision in regular bipartite graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Snapshot (computer storage); Asynchronous communication; Bipartite graph; Existential quantification; Theoretical computer science; Graph; Algorithm; Mathematics; Combinatorics; Computer network","score_opus":0.010246317737841494,"score_gpt":0.2581444462834714,"score_spread":0.2478981285456299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179376195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640166,0.000040301617,0.93321526,0.00039733644,0.00022809465,0.00020020283,2.5917316e-7,0.00014647875,0.0017554507],"genre_scores_gemma":[0.84852934,0.000007663413,0.15107128,0.00033722227,0.000031390733,0.000008231487,4.28175e-7,0.0000088064835,0.0000056221447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972992,0.00015163017,0.0002501384,0.00054361165,0.00082099234,0.0009344541],"domain_scores_gemma":[0.9986184,0.000090950336,0.000051731313,0.00067977567,0.000109936875,0.00044916812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001842299,0.00017777718,0.0001822401,0.00032916144,0.00025629823,0.0003647132,0.0015129895,0.00004893265,0.000054008862],"category_scores_gemma":[0.000023746974,0.00013300557,0.00003647187,0.0020108647,0.0019982944,0.0015059008,0.0007722815,0.00021235962,0.00008239033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009043951,0.00016962785,0.0013487065,0.000007606585,0.0000024569836,0.000015049858,0.0010977916,0.007429241,0.00013779834,0.9494287,0.000020822048,0.040333163],"study_design_scores_gemma":[0.00036883433,0.00031637528,0.006356165,0.00006816031,0.000001658091,0.000046373432,0.000011179558,0.97325605,0.0009289398,0.018302264,0.00010425146,0.00023976305],"about_ca_topic_score_codex":0.0000062849535,"about_ca_topic_score_gemma":0.0000019566703,"teacher_disagreement_score":0.9658268,"about_ca_system_score_codex":0.00009562178,"about_ca_system_score_gemma":0.0000930449,"threshold_uncertainty_score":0.7362799},"labels":[],"label_agreement":null},{"id":"W2180374207","doi":"","title":"Competitive Online Routing in Geometric Graphs.","year":2001,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Discrete mathematics","score_opus":0.03010317574189894,"score_gpt":0.2796664929349582,"score_spread":0.24956331719305927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180374207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013923414,0.00002978723,0.8788866,0.0019576398,0.00008861854,0.0001350003,7.582402e-7,0.00017238826,0.10480583],"genre_scores_gemma":[0.91615516,0.00009979353,0.081509426,0.0007818211,0.000011044312,0.0000027997128,0.000004261707,0.0000033592569,0.0014323217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992808,0.000039546852,0.00014027892,0.00017824628,0.00015592162,0.00020520281],"domain_scores_gemma":[0.9996345,0.00006921697,0.000023086719,0.00015835608,0.000058190806,0.000056631558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021428402,0.000053634532,0.00007482521,0.00044768216,0.00003851226,0.000071308204,0.0003347759,0.000022202377,0.00012259973],"category_scores_gemma":[0.00005281549,0.000047002886,0.000021486967,0.0025707635,0.000015122159,0.00027294474,0.00012705087,0.000094016905,0.000047354766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013427384,0.00016205854,0.024817144,0.0000019465554,0.0000029960643,0.000025450523,0.00022481907,0.00203107,0.000021852196,0.9410757,0.00015182534,0.031483795],"study_design_scores_gemma":[0.0009810695,0.00009951,0.06994532,0.000025854475,7.8356493e-7,0.000021896185,0.00021937935,0.9136705,0.00011628643,0.004808478,0.00985116,0.0002597772],"about_ca_topic_score_codex":0.000093595016,"about_ca_topic_score_gemma":0.00017040785,"teacher_disagreement_score":0.9362672,"about_ca_system_score_codex":0.00002136746,"about_ca_system_score_gemma":0.000023157238,"threshold_uncertainty_score":0.1916722},"labels":[],"label_agreement":null},{"id":"W2184486309","doi":"10.1109/trustcom-bigdatase-ispa.2015.436","title":"RLTE: A Reinforcement Learning Based Trust Establishment Model","year":2015,"lang":"en","type":"article","venue":"Trust, Security And Privacy In Computing And Communications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Honesty; Reputation; Reinforcement learning; Computer science; Trustworthiness; Order (exchange); Reinforcement; Work (physics); Artificial intelligence; Psychology; Social psychology; Computer security; Business; Law; Political science; Engineering; Finance","score_opus":0.07272068516223065,"score_gpt":0.32425605605119723,"score_spread":0.2515353708889666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184486309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700414,0.0011046036,0.93151647,0.010597342,0.00005767917,0.0004294988,0.000001642263,0.0002627584,0.00902589],"genre_scores_gemma":[0.91528004,0.00036043595,0.08381725,0.0004187927,0.000009479454,0.000013928765,0.000017317334,0.000006353634,0.000076376855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865746,0.0002778581,0.00032328223,0.00026939978,0.00021284062,0.00025912691],"domain_scores_gemma":[0.99845046,0.00021284232,0.00010140683,0.0009251139,0.00011428324,0.00019589486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386405,0.00013353731,0.00016966683,0.00012422442,0.00043313493,0.00033001552,0.0009958001,0.00006294428,0.0000028356553],"category_scores_gemma":[0.00015055378,0.0001387762,0.000024448083,0.00036880802,0.00011374386,0.00034319545,0.001412517,0.00044856247,0.0000027784724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015616406,0.00023419436,0.0070960415,0.00004627324,0.000014213099,0.0000018793884,0.033935823,0.79480654,0.0000055797063,0.14507394,0.00038759754,0.018382328],"study_design_scores_gemma":[0.000843367,0.000070608556,0.00022520867,0.000055002067,0.0000036671977,0.0000041270546,0.00035855907,0.9859885,0.000008133975,0.007260612,0.005022672,0.00015952993],"about_ca_topic_score_codex":0.0001302242,"about_ca_topic_score_gemma":0.000017523716,"teacher_disagreement_score":0.86827594,"about_ca_system_score_codex":0.000051722083,"about_ca_system_score_gemma":0.00015152452,"threshold_uncertainty_score":0.56591296},"labels":[],"label_agreement":null},{"id":"W2187039192","doi":"10.1007/978-3-642-40450-4_54","title":"Better Approximation Algorithms for Technology Diffusion","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Cascade; Algorithm; Computer science; Vertex (graph theory); Graph; Upgrade; Approximation algorithm; Combinatorics; Binary logarithm; Discrete mathematics; Mathematics; Theoretical computer science","score_opus":0.020519532145419746,"score_gpt":0.2565089051580965,"score_spread":0.23598937301267675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187039192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001575627,0.00011484234,0.99091804,0.0050340528,0.00091696787,0.0011107929,0.0000037344564,0.00026216637,0.001623649],"genre_scores_gemma":[0.0024922972,0.000034582656,0.99464476,0.0015173762,0.0002466092,0.00008602432,0.000013746539,0.000030367388,0.0009342429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970196,0.000018368213,0.00044637054,0.0012469467,0.0006600288,0.00060872565],"domain_scores_gemma":[0.9979123,0.00022553529,0.00023165192,0.00104828,0.00045876496,0.00012347013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055907265,0.00037639844,0.00038284672,0.0013025922,0.0002820136,0.00055300357,0.0025403732,0.0004437009,0.0000438329],"category_scores_gemma":[0.0000841706,0.00032778867,0.00009515338,0.00066301774,0.0004750146,0.00068594835,0.0010667092,0.0005347068,0.00008812355],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012514557,0.000021788252,0.000008830825,0.000033468656,0.0000045774595,0.0000038081516,0.00019230413,0.0075115236,0.000186349,0.046292834,0.00008418577,0.9456591],"study_design_scores_gemma":[0.00022620657,0.000116357834,0.0000072356584,0.0001003064,0.0000020360176,0.000013059941,7.129552e-8,0.7164662,0.0006346046,0.27919662,0.0029411528,0.0002961899],"about_ca_topic_score_codex":0.000004756396,"about_ca_topic_score_gemma":0.0000056831523,"teacher_disagreement_score":0.94536287,"about_ca_system_score_codex":0.00018307255,"about_ca_system_score_gemma":0.00024045883,"threshold_uncertainty_score":0.9999174},"labels":[],"label_agreement":null},{"id":"W2188070220","doi":"10.22215/etd/2014-10430","title":"Swarms of Bouncing Robots","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Mobile robot; Task (project management); Visibility; Computer science; Position (finance); Collision; Simulation; Real-time computing; Artificial intelligence; Engineering; Geography; Computer security","score_opus":0.013545356539366601,"score_gpt":0.2669274243338533,"score_spread":0.2533820677944867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188070220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006755909,0.00006694887,0.76145816,0.000118418306,0.000653694,0.00015974458,4.562248e-7,0.00012635118,0.23674066],"genre_scores_gemma":[0.23254316,0.00022571167,0.43705365,0.00071411335,0.00018417943,0.000050082777,0.00045184605,0.00006889817,0.32870835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903864,0.000033808592,0.00023306232,0.00022417007,0.00033043307,0.00013986442],"domain_scores_gemma":[0.9991856,0.000036398284,0.00013874825,0.0003484124,0.00023691189,0.000053901917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023643597,0.000101739504,0.00017684067,0.000129039,0.000040706385,0.000077890065,0.0005918082,0.00010730081,0.0001106725],"category_scores_gemma":[0.00004467916,0.00008688709,0.000060183316,0.00020570194,0.000008237739,0.00015034362,0.000040315976,0.00011287915,0.00006316653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018163744,0.0001693914,0.00013308939,0.0010069348,0.0000991758,0.000004797908,0.0060013705,0.030920908,0.0033363646,0.80471575,0.023905946,0.12968811],"study_design_scores_gemma":[0.0013009674,0.00045230787,0.0022580137,0.00076579343,0.00003343885,0.000005565036,0.0005144618,0.89143777,0.053484894,0.020271085,0.027944487,0.0015312441],"about_ca_topic_score_codex":0.000052575182,"about_ca_topic_score_gemma":0.00008139662,"teacher_disagreement_score":0.86051685,"about_ca_system_score_codex":0.000015319332,"about_ca_system_score_gemma":0.00014040075,"threshold_uncertainty_score":0.35431528},"labels":[],"label_agreement":null},{"id":"W2202720387","doi":"10.1007/978-3-662-46078-8_16","title":"Deterministic Rendezvous in Restricted Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Traverse; Robot; Computer science; Asynchronous communication; Graph; Discrete mathematics; Topology (electrical circuits); Mobile robot; Theoretical computer science; Node (physics); Combinatorics; Reachability; Algorithm; Mathematics; Artificial intelligence; Computer network; Physics","score_opus":0.03973797012185137,"score_gpt":0.28057701449587374,"score_spread":0.24083904437402237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202720387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024366012,0.00042798527,0.9877825,0.0005871407,0.0010487335,0.00042461662,0.0000038196063,0.00017396804,0.009526889],"genre_scores_gemma":[0.1720243,0.00030706654,0.8229571,0.0019119023,0.0003182448,0.000036606456,0.000022094588,0.00008874375,0.002333927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588555,0.00007426171,0.00061774015,0.0014224731,0.0012486227,0.0007513689],"domain_scores_gemma":[0.9974184,0.00035520486,0.00022637496,0.0013469352,0.00036027146,0.00029279426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096532615,0.0004415425,0.00049215154,0.0018562619,0.00013478783,0.00053751725,0.0034326261,0.0003329314,0.000021915379],"category_scores_gemma":[0.00026927033,0.00041533174,0.00008163602,0.0016175885,0.00054341863,0.00054441835,0.0012404463,0.000947405,0.000055025128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109255025,0.00006477519,0.00010417839,0.000040949933,0.0000067995747,0.0005779301,0.001039282,0.1585537,0.000034893124,0.05573885,0.00017396669,0.78365374],"study_design_scores_gemma":[0.00041704823,0.0002044711,0.00011485111,0.00023377994,0.0000023617365,0.000062502404,9.8066806e-8,0.70637,0.000032280077,0.2900402,0.0020059138,0.0005165215],"about_ca_topic_score_codex":0.000034853496,"about_ca_topic_score_gemma":0.00013830699,"teacher_disagreement_score":0.7831372,"about_ca_system_score_codex":0.00033743828,"about_ca_system_score_gemma":0.0011630903,"threshold_uncertainty_score":0.9998298},"labels":[],"label_agreement":null},{"id":"W2207300025","doi":"10.1016/j.comgeo.2010.04.003","title":"A general approach for cache-oblivious range reporting and approximate range counting","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Range (aeronautics); Range query (database); Cache; Upper and lower bounds; Computer science; Mathematics; Linear space; Corollary; Data structure; Block (permutation group theory); Combinatorics; Web search query; Parallel computing; Sargable; Search engine; Information retrieval","score_opus":0.03599642114052546,"score_gpt":0.29118629184087824,"score_spread":0.25518987070035276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207300025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06707317,0.000067373,0.93030417,0.00029328314,0.0002064605,0.00042319094,0.000007870522,0.00015675717,0.0014677107],"genre_scores_gemma":[0.34975424,0.000002565845,0.64937323,0.00029608395,0.00013603845,0.00006217244,0.000053995587,0.0000136748085,0.00030796183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982571,0.00003739467,0.0005383534,0.0004849113,0.0003596574,0.00032258482],"domain_scores_gemma":[0.9986352,0.00024536494,0.00042058804,0.00023468942,0.0003336458,0.00013052355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590919,0.00014349801,0.00020941274,0.00026356196,0.0003121657,0.00037192728,0.00033591926,0.00008469745,0.000015654912],"category_scores_gemma":[0.0005675862,0.00013988189,0.000067908084,0.0005452997,0.000071932984,0.00040228857,0.00019709242,0.0002286131,0.00000572029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022906,0.00062268175,0.06284695,0.00078017334,0.0001778752,0.000033550747,0.0031533996,0.54437953,0.0014767977,0.28919223,0.004864408,0.09242217],"study_design_scores_gemma":[0.00063792133,0.000020408923,0.0054488787,0.000005343919,0.0000047470803,0.00007999277,0.000018464565,0.9883607,0.000019480925,0.004668746,0.00055908796,0.00017625022],"about_ca_topic_score_codex":0.000012156219,"about_ca_topic_score_gemma":0.0000015942129,"teacher_disagreement_score":0.44398114,"about_ca_system_score_codex":0.000017163757,"about_ca_system_score_gemma":0.00009109616,"threshold_uncertainty_score":0.57042176},"labels":[],"label_agreement":null},{"id":"W2211969678","doi":"10.1007/s10878-015-9915-5","title":"Towards the price of leasing online","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Theory of computation; Order (exchange); Set cover problem; Integer programming; Online algorithm; Computer science; Integer (computer science); Randomized rounding; Operations research; Set (abstract data type); Mathematical economics; Facility location problem; Service (business); Mathematics; Combinatorics; Approximation algorithm; Economics; Algorithm; Business; Marketing; Finance","score_opus":0.04894002924072742,"score_gpt":0.2914331280640873,"score_spread":0.24249309882335984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211969678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011827823,0.00013317658,0.99169147,0.0028227335,0.0027082264,0.000107089494,6.900277e-7,0.00001643661,0.0013373732],"genre_scores_gemma":[0.37469327,0.00012792666,0.62443894,0.00018585591,0.00047357232,0.0000010157721,0.00000308754,0.000013222669,0.000063117885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842775,0.00019916349,0.0005069735,0.000079424,0.0006657359,0.00012095998],"domain_scores_gemma":[0.9973953,0.000077564844,0.0006065996,0.00020748013,0.0015939444,0.000119108736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182563,0.000077383535,0.0001837241,0.00013555345,0.00007087592,0.00014530389,0.00069622946,0.000052353123,0.000008334252],"category_scores_gemma":[0.0006085757,0.000052220592,0.000070019574,0.00059726206,0.000052951786,0.0007542818,0.000107335436,0.00017303479,0.0000010748905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041383133,0.000195924,0.00005700784,0.000006645144,0.00002087274,0.0000028867871,0.0010832646,0.9354973,0.000033933688,0.059648573,0.0010372853,0.0023749368],"study_design_scores_gemma":[0.002318894,0.0006120329,0.00009778821,0.00005143943,0.000016256221,0.000047719368,0.00014132769,0.9772213,0.0005697016,0.014605492,0.0042072725,0.000110778514],"about_ca_topic_score_codex":0.000006477958,"about_ca_topic_score_gemma":1.2118589e-7,"teacher_disagreement_score":0.37351048,"about_ca_system_score_codex":0.00006816941,"about_ca_system_score_gemma":0.00060641137,"threshold_uncertainty_score":0.2129494},"labels":[],"label_agreement":null},{"id":"W2216175676","doi":"10.1109/cit/iucc/dasc/picom.2015.254","title":"Distributed Black Virus Decontamination and Rooted Acyclic Orientations","year":2015,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Asynchronous communication; Network topology; Computer science; Topology (electrical circuits); Graph; Distributed computing; Computer network; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.03641267515240541,"score_gpt":0.2880084743089313,"score_spread":0.25159579915652586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216175676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016176837,0.000011397651,0.97709346,0.0017662129,0.000070047405,0.00012574495,0.00000422836,0.00013959981,0.0046124673],"genre_scores_gemma":[0.94660497,0.000017585817,0.051569965,0.0003318525,0.00001435105,0.000011213615,0.000054981145,0.0000042195584,0.0013908561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.0000446344,0.000113452974,0.00016195962,0.0001510191,0.0001181879],"domain_scores_gemma":[0.9994631,0.00003520052,0.00002939295,0.00015869092,0.00016272702,0.00015091439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017004373,0.000053004977,0.000054339016,0.00006246298,0.000060660186,0.00016865564,0.00016611561,0.000027059128,0.000022538097],"category_scores_gemma":[0.00009292583,0.000046943722,0.000010118289,0.00033876067,0.000033368342,0.00056711264,0.000092395676,0.000041965995,0.000070940034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014440449,0.00033146804,0.007160888,0.000016213748,0.000038626895,0.000012540798,0.007747551,0.010829987,0.0010171932,0.8769404,0.034101684,0.061788958],"study_design_scores_gemma":[0.0009613295,0.00008764568,0.012700911,0.000003955863,0.0000030822328,0.000005388895,0.00020621657,0.9691939,0.0009709934,0.0059606456,0.009757675,0.0001482654],"about_ca_topic_score_codex":0.000043830067,"about_ca_topic_score_gemma":0.00008168295,"teacher_disagreement_score":0.9583639,"about_ca_system_score_codex":0.000030713025,"about_ca_system_score_gemma":0.00004794611,"threshold_uncertainty_score":0.19143094},"labels":[],"label_agreement":null},{"id":"W2231632241","doi":"10.1145/2611462.2611473","title":"Time versus cost tradeoffs for deterministic rendezvous in networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Node (physics); Idle; Set (abstract data type); Integer (computer science); Distributed computing; Computer network; Integer programming; Algorithm; Engineering","score_opus":0.03129674999225843,"score_gpt":0.2795022712355432,"score_spread":0.2482055212432848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231632241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009815982,0.00000617537,0.98426455,0.0006155477,0.00022603283,0.00027333567,5.0983147e-7,0.00009764699,0.014418036],"genre_scores_gemma":[0.8295044,0.000012737927,0.16297299,0.0010206135,0.00013880714,0.00013075898,0.000015286842,0.000019297955,0.0061851246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924517,0.000049118764,0.0001447897,0.00021125727,0.00009662967,0.0002530407],"domain_scores_gemma":[0.999294,0.00033339587,0.000025901247,0.00023920166,0.000029074472,0.000078422134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031378522,0.000068532776,0.00009722562,0.000060827784,0.000050150826,0.00009257574,0.00038409725,0.000045380253,0.000035502613],"category_scores_gemma":[0.00008631008,0.00006181347,0.000028799415,0.00018237112,0.000025099574,0.00014099345,0.000058858048,0.00006361448,0.0000470322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013850736,0.00019428224,0.00008825234,0.00002651332,0.000017057382,0.000008093783,0.00059715466,0.2869379,0.00005301758,0.21387583,0.017633079,0.48043033],"study_design_scores_gemma":[0.0010395331,0.00016249657,0.00006858349,0.000004573615,9.573758e-7,0.0000011782076,0.0000027256037,0.9860331,0.000012387124,0.00044309668,0.012145024,0.00008636273],"about_ca_topic_score_codex":0.0000040587324,"about_ca_topic_score_gemma":0.000024288767,"teacher_disagreement_score":0.8294062,"about_ca_system_score_codex":0.000022688375,"about_ca_system_score_gemma":0.000025904348,"threshold_uncertainty_score":0.25206804},"labels":[],"label_agreement":null},{"id":"W2245527669","doi":"10.1007/978-3-319-19662-6_14","title":"Rendezvous of Many Agents with Different Speeds in a Cycle","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Generalization; Combinatorics; Domain (mathematical analysis); Mathematics; Computer science; Discrete mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.03558802351668162,"score_gpt":0.27119062136414945,"score_spread":0.23560259784746784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245527669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044210468,0.00015589008,0.9909219,0.00044092064,0.00037037965,0.00038517936,0.0000032287749,0.00005907828,0.0072213337],"genre_scores_gemma":[0.66518205,0.0000784666,0.3327282,0.00062157144,0.000136097,0.000012672683,0.000007763953,0.00004720798,0.0011859717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673104,0.000044916087,0.0004676472,0.0009603303,0.0012817325,0.000514313],"domain_scores_gemma":[0.99814427,0.00012756104,0.00024134335,0.0010174738,0.00027638552,0.00019296631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065118616,0.00036272162,0.00050582894,0.0009551768,0.00006106154,0.00020117665,0.00239821,0.00017977967,0.00003597487],"category_scores_gemma":[0.00003811758,0.0002791704,0.00005825832,0.00071709405,0.00047077192,0.0003758218,0.001017941,0.0005526496,0.000011084165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036911668,0.00022873636,0.00079937506,0.00013012688,0.00002485094,0.00027985455,0.0038505772,0.5068001,0.000058492646,0.039994504,0.00011838569,0.4476781],"study_design_scores_gemma":[0.0006607961,0.00038141056,0.0006078466,0.0004929689,0.0000033889569,0.000035022123,3.094005e-7,0.93452114,0.0002954334,0.06216985,0.00039645398,0.00043535474],"about_ca_topic_score_codex":0.00003770391,"about_ca_topic_score_gemma":0.00016974068,"teacher_disagreement_score":0.66473997,"about_ca_system_score_codex":0.0002683238,"about_ca_system_score_gemma":0.000457194,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W2267848830","doi":"10.1287/ijoc.2015.0668","title":"An AO<sup>*</sup> Based Exact Algorithm for the Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Vertex (graph theory); Computer science; Pruning; Mathematical optimization; Algorithm; Markov decision process; Vertex cover; Graph; Graph traversal; Time complexity; Markov process; Theoretical computer science; Mathematics","score_opus":0.025870594288043298,"score_gpt":0.2749130858102049,"score_spread":0.2490424915221616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267848830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005521196,0.000010981888,0.9919884,0.0054028737,0.0002323994,0.00037819392,0.000005838507,0.00007354375,0.0013556518],"genre_scores_gemma":[0.51065165,0.000011357773,0.48258048,0.005800942,0.0005694406,0.000012805369,0.0000034479026,0.00003002758,0.00033986717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811566,0.00006314988,0.00045245897,0.00021817948,0.0004649135,0.0006856466],"domain_scores_gemma":[0.9981426,0.00036344584,0.00020155465,0.00037509095,0.00038181298,0.0005354749],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018178433,0.00017842237,0.00015679582,0.0002891267,0.0012713136,0.0011010305,0.0012753707,0.0000811968,0.000047312737],"category_scores_gemma":[0.00007141686,0.00008953969,0.000118367374,0.0003031796,0.000051879393,0.00096514216,0.000048862537,0.00032840832,0.0000391636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004038415,0.000019871573,0.000077819706,0.0000033027188,0.000013979892,0.000007159108,0.00058935967,0.09859261,0.0000062476583,0.0026935914,0.000985259,0.89700675],"study_design_scores_gemma":[0.0009106914,0.0003186751,0.0003097921,0.000085516716,0.0000028285522,0.000067384484,0.000036903286,0.9625893,0.00006176507,0.00075525034,0.034685634,0.00017622174],"about_ca_topic_score_codex":0.0005837413,"about_ca_topic_score_gemma":0.00077349105,"teacher_disagreement_score":0.89683056,"about_ca_system_score_codex":0.00025504176,"about_ca_system_score_gemma":0.00090820267,"threshold_uncertainty_score":0.9999359},"labels":[],"label_agreement":null},{"id":"W2273888011","doi":"10.1007/s13675-015-0059-2","title":"Models for video-on-demand scheduling with costs","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Video on demand; Flexibility (engineering); Server; Scheduling (production processes); On demand; Service provider; Bandwidth (computing); Duration (music); Computer network; Service (business); Multimedia; Operations management","score_opus":0.02936711467459411,"score_gpt":0.2708885565075921,"score_spread":0.24152144183299798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273888011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031426162,0.000017322816,0.9904282,0.0075648054,0.00024250307,0.00031907248,0.000006689411,0.000095006915,0.0010121482],"genre_scores_gemma":[0.13439141,0.000035515175,0.8626408,0.0025246076,0.0001520192,0.000018846107,0.000011259615,0.000029921373,0.00019559156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982453,0.0001373952,0.0003564944,0.00034551477,0.00064600894,0.00026931587],"domain_scores_gemma":[0.997875,0.0006777882,0.00026917516,0.00017537228,0.0008056645,0.00019700207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202586,0.00017685765,0.00015701797,0.00030294497,0.00039026816,0.00037972227,0.00039589338,0.000040288738,0.000025529482],"category_scores_gemma":[0.00014135132,0.00011408262,0.000068892194,0.00032547428,0.000036600737,0.0011534832,0.000039174658,0.0001429544,0.000026692036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107200794,0.00007187335,0.0000138547275,0.000003227359,0.000020760262,0.0000072502885,0.00004814709,0.88948405,0.000007803845,0.10520027,0.0005109323,0.0045246365],"study_design_scores_gemma":[0.0021025154,0.0006944296,0.00003286934,0.00015825684,0.000004516286,0.000074162046,0.0000037816576,0.9833651,0.000044678683,0.012879234,0.0004601493,0.00018026729],"about_ca_topic_score_codex":1.9092667e-7,"about_ca_topic_score_gemma":1.4356385e-7,"teacher_disagreement_score":0.13407715,"about_ca_system_score_codex":0.0001449705,"about_ca_system_score_gemma":0.00019999957,"threshold_uncertainty_score":0.4652154},"labels":[],"label_agreement":null},{"id":"W2274293958","doi":"10.1142/s0129054116500313","title":"Exploration of Faulty Hamiltonian Graphs","year":2016,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Node (physics); Overhead (engineering); Competitive analysis; Situated; Hamiltonian path; Algorithm; Mathematics; Theoretical computer science; Graph; Engineering; Upper and lower bounds; Artificial intelligence","score_opus":0.05308547114641386,"score_gpt":0.3491501009345286,"score_spread":0.2960646297881147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274293958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054267687,0.000047357782,0.98461276,0.0042694425,0.004748333,0.00015721751,0.000019238641,0.00002147427,0.00069743476],"genre_scores_gemma":[0.6539325,0.00016428337,0.34559622,0.00007976717,0.0001771939,0.0000036077593,0.0000049923933,0.0000065388244,0.000034882694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958836,0.0001053566,0.0012843148,0.0003604034,0.0021635846,0.00020272906],"domain_scores_gemma":[0.9896031,0.00017556663,0.0021215186,0.0006333791,0.0073229345,0.00014348769],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0016397566,0.0001811818,0.0003564312,0.0017569198,0.00009934555,0.00044949685,0.005825776,0.00008668114,0.000022578435],"category_scores_gemma":[0.00022990159,0.00014768656,0.0002504672,0.0006880499,0.0006396945,0.003717748,0.0016669581,0.00029240508,0.0000060000034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005252797,0.00070893497,0.0010084779,0.00008779481,0.00037756818,0.000023524086,0.0041714036,0.123707354,0.006989647,0.59164166,0.0011973218,0.2700338],"study_design_scores_gemma":[0.001930632,0.0006827607,0.0073287375,0.0019465801,0.000036402882,0.00015375509,0.000044300195,0.4502169,0.01854598,0.5150799,0.0033807682,0.000653282],"about_ca_topic_score_codex":0.00001239234,"about_ca_topic_score_gemma":0.000003392717,"teacher_disagreement_score":0.64850575,"about_ca_system_score_codex":0.00016161503,"about_ca_system_score_gemma":0.0017480683,"threshold_uncertainty_score":0.9995532},"labels":[],"label_agreement":null},{"id":"W2274319803","doi":"10.48550/arxiv.1602.05546","title":"Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering - Feasibility Study -","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Robot; Stateless protocol; Distributed computing; Probabilistic logic; Scheduling (production processes); Robotics; Fault tolerance; Byzantine fault tolerance; Mobile robot; Set (abstract data type); Bounded function; Swarm robotics; Crash; Artificial intelligence; Algorithm; Mathematical optimization; Mathematics","score_opus":0.08451719605257647,"score_gpt":0.22370100604437393,"score_spread":0.13918380999179747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274319803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63371265,0.00005714043,0.36314958,0.00005497238,0.00022768303,0.0011411123,0.000006745249,0.00039467667,0.001255448],"genre_scores_gemma":[0.9956771,0.00012672345,0.0036324952,0.000033439235,0.00003490711,0.000005476332,0.000002636884,0.000019701634,0.0004675107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997372,0.00030660562,0.0002715507,0.001480339,0.00015125168,0.00041827606],"domain_scores_gemma":[0.9978706,0.00012885069,0.00019202134,0.0013479897,0.00022053347,0.0002399705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006605441,0.00032751885,0.00038912398,0.00019456545,0.00024348884,0.00023730106,0.0012268774,0.0002264465,0.000037818263],"category_scores_gemma":[0.000035937974,0.00030729044,0.000111216585,0.0003868125,0.000086500506,0.0005377656,0.0030517164,0.0005598737,0.000024816249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008961638,0.0024589724,0.18856488,0.00041804268,0.0003531042,0.0005011641,0.0064353626,0.7506708,0.0002647217,0.047596812,0.000070044836,0.0025764662],"study_design_scores_gemma":[0.001692264,0.00029140548,0.007149571,0.00013371056,0.000048087022,0.000005811773,0.00042321955,0.9834286,0.000073455616,0.0058127088,0.0002455308,0.00069565565],"about_ca_topic_score_codex":0.000056753022,"about_ca_topic_score_gemma":0.00003024332,"teacher_disagreement_score":0.36196446,"about_ca_system_score_codex":0.00013011329,"about_ca_system_score_gemma":0.00014866785,"threshold_uncertainty_score":0.9999379},"labels":[],"label_agreement":null},{"id":"W2283577276","doi":"10.1007/978-3-642-35261-4_38","title":"The Canadian Traveller Problem Revisited","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.02169896923223257,"score_gpt":0.2440577603377054,"score_spread":0.22235879110547283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283577276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4741844e-7,0.001150104,0.95240545,0.004715155,0.0007457734,0.00058589847,0.0000034049533,0.000094827556,0.040298928],"genre_scores_gemma":[0.038318373,0.0009720709,0.9379174,0.008214883,0.0011399757,0.00004680345,0.000021146545,0.000104252686,0.013265058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964768,0.000059181366,0.000444427,0.00092507375,0.0009906274,0.00110386],"domain_scores_gemma":[0.99722505,0.0003341454,0.00017802956,0.0013619782,0.00037211363,0.0005286864],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018468116,0.0003881263,0.00029967446,0.00065425545,0.00114837,0.0015042329,0.0039536855,0.00029616948,0.00006364875],"category_scores_gemma":[0.0000669055,0.0002763109,0.00009762486,0.00075423066,0.00070822006,0.0005365153,0.00068992504,0.0009311336,0.00017695523],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012916358,0.000007941029,0.00002298184,0.000016194579,0.000008767765,0.000017746564,0.0007534569,0.008492703,0.000005620531,0.18649483,0.0002649227,0.80391353],"study_design_scores_gemma":[0.00026618503,0.00010784381,0.000116211326,0.00030733523,0.0000069125153,0.00007277745,1.5673744e-7,0.5644968,0.00011877317,0.23186268,0.20170121,0.00094309804],"about_ca_topic_score_codex":0.0012924463,"about_ca_topic_score_gemma":0.02570283,"teacher_disagreement_score":0.80297047,"about_ca_system_score_codex":0.0005184055,"about_ca_system_score_gemma":0.0017267397,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2284684210","doi":"10.1016/j.tcs.2020.01.031","title":"Paid exchanges are worth the price","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Business; Economics","score_opus":0.03455886438842057,"score_gpt":0.2758827443001755,"score_spread":0.24132387991175494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284684210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003571463,0.00011425142,0.9479861,0.044339996,0.0012733589,0.0005713646,0.0000052527685,0.00048704512,0.004865431],"genre_scores_gemma":[0.75750977,0.00008718809,0.23563819,0.0061719194,0.00047409942,0.000053966764,0.000003199528,0.000020365474,0.00004129684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953672,0.00038440002,0.00039051202,0.0015095699,0.0015341647,0.00081410736],"domain_scores_gemma":[0.9964005,0.00038594494,0.00023615248,0.0020287829,0.00043098535,0.0005176479],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023288229,0.00036810775,0.00037780814,0.00018087,0.00070222566,0.0021538013,0.009715055,0.00013941816,0.00008418571],"category_scores_gemma":[0.00024514584,0.00023991657,0.00014389324,0.001618556,0.0033217377,0.00040842508,0.0137624005,0.001147765,0.00018737534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003674454,0.000039041228,0.00002508864,0.000040379182,0.000008453672,0.000019626716,0.0014190916,0.0034034417,0.000013559448,0.98125744,0.0007610693,0.013009116],"study_design_scores_gemma":[0.000097234806,0.000077399614,0.0004982958,0.00008580064,0.000004678111,0.000011264177,0.000011615149,0.7832932,0.00015365468,0.21433215,0.0011296875,0.00030503268],"about_ca_topic_score_codex":0.0000033711312,"about_ca_topic_score_gemma":9.566313e-7,"teacher_disagreement_score":0.77988976,"about_ca_system_score_codex":0.00008443689,"about_ca_system_score_gemma":0.0004683401,"threshold_uncertainty_score":0.99939066},"labels":[],"label_agreement":null},{"id":"W2288393983","doi":"10.1016/j.tcs.2016.01.025","title":"Rendezvous with constant memory","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rendezvous; Constant (computer programming); Robot; Computer science; Asynchronous communication; Transmission (telecommunications); State (computer science); Mobile robot; Theoretical computer science; Algorithm; Artificial intelligence; Computer network; Telecommunications; Programming language","score_opus":0.009871011720561236,"score_gpt":0.23466240848243702,"score_spread":0.2247913967618758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288393983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016981955,0.0000086174805,0.9732334,0.004831745,0.00019972924,0.00013764226,9.0798005e-7,0.00027067668,0.019619096],"genre_scores_gemma":[0.752451,0.0000058290625,0.24683456,0.00058969617,0.000033872686,0.0000048468405,8.324176e-8,0.0000049549544,0.000075148055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977703,0.00008947438,0.00017881933,0.0006237436,0.00078142644,0.0005562451],"domain_scores_gemma":[0.9983278,0.00022553613,0.00004559146,0.0007996049,0.00025917045,0.0003423169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010523122,0.00013523629,0.00013831943,0.00015103036,0.0002943418,0.00031940488,0.0019726322,0.00002910251,0.0001208693],"category_scores_gemma":[0.00005947828,0.00006889104,0.000027782182,0.0009295258,0.0039663264,0.00080978434,0.0006804274,0.00009031622,0.0001553386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064559817,0.000025043679,0.000022156515,0.0000017663184,0.0000019953586,0.000017205983,0.0001291342,0.000072853225,0.00061466603,0.92496216,0.00006710278,0.07407947],"study_design_scores_gemma":[0.0018728495,0.0013469825,0.00043479097,0.00020172013,0.000005616418,0.00035058972,0.000013439506,0.6336013,0.018599415,0.341669,0.0010895022,0.00081476814],"about_ca_topic_score_codex":9.185632e-7,"about_ca_topic_score_gemma":4.2915212e-7,"teacher_disagreement_score":0.7507528,"about_ca_system_score_codex":0.00005442118,"about_ca_system_score_gemma":0.00024484386,"threshold_uncertainty_score":0.9987443},"labels":[],"label_agreement":null},{"id":"W2290715051","doi":"10.1007/978-3-642-45346-5_17","title":"Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Asynchronous communication; Mobile robot; Computer science; Visibility; State space; RADIUS; Point (geometry); State (computer science); Space (punctuation); Distributed computing; Topology (electrical circuits); Algorithm; Artificial intelligence; Mathematics; Computer network; Geometry; Combinatorics; Physics","score_opus":0.014945474727716263,"score_gpt":0.2465486846677044,"score_spread":0.23160320993998815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290715051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003953706,0.00027004673,0.9959797,0.00014195952,0.00039288178,0.00066970487,0.000009009604,0.000043443604,0.0020978446],"genre_scores_gemma":[0.55379826,0.0002556516,0.44526073,0.00017536336,0.000054276297,0.00002722449,0.0000061213127,0.00002913763,0.00039324304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679196,0.00004952589,0.00075423566,0.0009248741,0.00092898525,0.0005504369],"domain_scores_gemma":[0.9972925,0.0006875748,0.00041090135,0.0010930676,0.00037611203,0.00013983763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007204889,0.00035674835,0.0005836819,0.0009854618,0.000065832035,0.00016793818,0.0030348261,0.00019781939,0.000053995573],"category_scores_gemma":[0.00012982484,0.00031555002,0.00009944842,0.0008587373,0.0012481235,0.00076865,0.0012624766,0.0005427982,0.000019964375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033892018,0.00004828861,0.000102007405,0.000074722906,0.00000452515,0.000017759965,0.00146552,0.79045206,0.00009143664,0.0074557313,0.0000044807966,0.20028009],"study_design_scores_gemma":[0.00026935153,0.000285461,0.0001251878,0.0005014351,0.0000018371721,0.000008530352,5.886692e-7,0.969369,0.00147387,0.027560327,0.00007687456,0.00032753256],"about_ca_topic_score_codex":0.00017104228,"about_ca_topic_score_gemma":0.0002101228,"teacher_disagreement_score":0.5534029,"about_ca_system_score_codex":0.00013979367,"about_ca_system_score_gemma":0.00061490317,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W2293590087","doi":"10.1007/978-3-319-30303-1_1","title":"Optimization Problems in Infrastructure Security","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Task (project management); Critical infrastructure; Computer security; Process (computing); Order (exchange); Risk analysis (engineering); Management science; Systems engineering","score_opus":0.011637329829563964,"score_gpt":0.237086179571458,"score_spread":0.22544884974189403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293590087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006947478,0.00017435773,0.98652136,0.0013302673,0.0009138915,0.00066132186,0.0000061431674,0.0001676593,0.0102180755],"genre_scores_gemma":[0.0634252,0.00043159528,0.9325056,0.002052107,0.0004662269,0.000037936694,0.00001636827,0.000078540026,0.0009864391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959873,0.0000662709,0.000637259,0.0015217762,0.001024561,0.000762848],"domain_scores_gemma":[0.997783,0.0002386753,0.00027965644,0.0011737478,0.00032140018,0.00020351038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009657171,0.0004992917,0.00048123684,0.0013257191,0.00016395091,0.0005578465,0.002952935,0.00044496462,0.00011685725],"category_scores_gemma":[0.00011140746,0.00040633496,0.00008807872,0.0009829177,0.00051443157,0.0011639481,0.0012773246,0.0008755772,0.000035854988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018586447,0.000016549273,0.00011447658,0.000033136155,0.0000032705607,0.000018823144,0.0007377223,0.83997464,0.000013105405,0.020734686,0.000020117115,0.1383316],"study_design_scores_gemma":[0.0003586365,0.00007462787,0.000046896665,0.0004090533,0.0000013262153,0.000021201231,6.73167e-8,0.7789652,0.000057027464,0.21872202,0.0008843899,0.00045955658],"about_ca_topic_score_codex":0.0000095500745,"about_ca_topic_score_gemma":0.00007292635,"teacher_disagreement_score":0.19798733,"about_ca_system_score_codex":0.00047416645,"about_ca_system_score_gemma":0.0007082731,"threshold_uncertainty_score":0.9998388},"labels":[],"label_agreement":null},{"id":"W2293719789","doi":"10.1145/2733693.2733713","title":"A Relaxed Algorithm for Online Matrix Inversion","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inversion (geology); Algorithm; Computer science; Matrix (chemical analysis); Geology; Chemistry","score_opus":0.1002151269805669,"score_gpt":0.3613357831181379,"score_spread":0.261120656137571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293719789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005166189,0.00030947322,0.98536193,0.0126429945,0.00025719547,0.000486269,0.000010493201,0.00023217525,0.00018287326],"genre_scores_gemma":[0.0056557846,0.00016491425,0.9927431,0.0009956997,0.000055418648,0.000073274685,0.00012954412,0.0000141601995,0.00016815157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985667,0.00024069884,0.00037652385,0.0003146768,0.00022869192,0.00027272978],"domain_scores_gemma":[0.99532574,0.00050129875,0.000098109966,0.0035969291,0.0003181358,0.00015977571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068570004,0.0001346559,0.0001809189,0.00028294633,0.00015859981,0.00016648025,0.0052184924,0.00008490729,0.0000033537249],"category_scores_gemma":[0.00015456234,0.00013903451,0.00006293621,0.00080430234,0.0000852977,0.000587433,0.0034748712,0.00025373374,0.00004805448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061921037,0.0006912574,0.00032314484,0.000012986943,0.00002684718,0.0000030817935,0.002185475,0.0033575543,0.000011783185,0.072667904,0.021981556,0.89873224],"study_design_scores_gemma":[0.00109189,0.000107268184,0.00014140297,0.000027329432,0.000002600076,0.000006522135,0.000028142023,0.9360948,0.000011116064,0.027393898,0.034939513,0.0001554749],"about_ca_topic_score_codex":0.00004393329,"about_ca_topic_score_gemma":0.000043141532,"teacher_disagreement_score":0.9327373,"about_ca_system_score_codex":0.00012140855,"about_ca_system_score_gemma":0.00017776161,"threshold_uncertainty_score":0.9697344},"labels":[],"label_agreement":null},{"id":"W2294012348","doi":"","title":"Almost Online Square Packing","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Logarithm; Square (algebra); Online algorithm; Advice (programming); Oracle; Packing problems; Computer science; Algorithm; Sequence (biology); Mathematics; Mathematical optimization; Upper and lower bounds","score_opus":0.039339746340765196,"score_gpt":0.2710083307283992,"score_spread":0.231668584387634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294012348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045295972,0.00001149892,0.9517449,0.010426512,0.00033606373,0.00016234443,0.000047898415,0.00013129688,0.032609895],"genre_scores_gemma":[0.94826984,0.000003746447,0.045521274,0.005284698,0.00008290416,0.0000062494155,0.0001568045,0.000011072385,0.0006634105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850374,0.000102933,0.00020587548,0.00040688028,0.00038713822,0.00039344197],"domain_scores_gemma":[0.99841183,0.00021551848,0.00006206378,0.00032343276,0.00041515037,0.0005719737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028757734,0.0001461308,0.00014394739,0.0005981618,0.00024204218,0.00033070808,0.0006725352,0.000072185416,0.00054429186],"category_scores_gemma":[0.00018831111,0.00015409205,0.000044914475,0.0007896189,0.00005066859,0.0002437956,0.000060802602,0.0002067071,0.0005884965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014377988,0.000037999354,0.0008663604,0.000010797969,0.00001088339,0.0000101064725,0.00014766684,0.09301045,0.0000041852877,0.8215846,0.0029431742,0.08137234],"study_design_scores_gemma":[0.00026574824,0.00006503382,0.008659016,0.00004191135,0.0000013605755,0.000009233502,0.00003063626,0.9522459,0.0000062684944,0.021267777,0.017179754,0.00022737004],"about_ca_topic_score_codex":0.0017860271,"about_ca_topic_score_gemma":0.005818189,"teacher_disagreement_score":0.94374025,"about_ca_system_score_codex":0.00012727919,"about_ca_system_score_gemma":0.0007814654,"threshold_uncertainty_score":0.75641286},"labels":[],"label_agreement":null},{"id":"W2294592207","doi":"","title":"ONLINE COLORING CO-INTERVAL GRAPHS","year":2009,"lang":"en","type":"article","venue":"Scientia Iranica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interval (graph theory); Combinatorics; Competitive analysis; Interval graph; Mathematics; Unit interval; Online algorithm; Indifference graph; Upper and lower bounds; Class (philosophy); Chordal graph; Discrete mathematics; Unit (ring theory); Complete coloring; Graph coloring; Algorithm; Computer science; Graph; Line graph; 1-planar graph; Artificial intelligence","score_opus":0.031509720431470045,"score_gpt":0.3059202773334071,"score_spread":0.27441055690193705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294592207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06721383,0.00018786389,0.86201644,0.014787385,0.0018426153,0.00060648646,0.000016695385,0.0010781226,0.052250583],"genre_scores_gemma":[0.8939674,0.00002490412,0.10263289,0.001855871,0.000041679985,0.0000026356226,0.000010450474,0.0000056215554,0.0014585814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986702,0.00005106745,0.000193071,0.00036824957,0.00038200384,0.00033540122],"domain_scores_gemma":[0.99923295,0.000023347027,0.00004786797,0.00044920237,0.000090204005,0.00015644282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000412294,0.0000902941,0.00010909342,0.00015443808,0.00020774342,0.00030864496,0.0010560614,0.000034127395,0.000102931925],"category_scores_gemma":[0.000035448997,0.00008164602,0.00007626397,0.0007688786,0.00006150635,0.00049073825,0.00011198055,0.00012433682,0.00014827745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026771548,0.0016338567,0.00080761634,0.000024102475,0.000043004376,0.00007954662,0.002383909,0.0035977915,0.019314533,0.81565696,0.047366403,0.109065525],"study_design_scores_gemma":[0.0028744352,0.00125626,0.02293207,0.00011860105,0.00001649995,0.00007604063,0.000102228034,0.75263345,0.007940566,0.049383108,0.16160169,0.0010650222],"about_ca_topic_score_codex":0.000003934817,"about_ca_topic_score_gemma":0.0000063871435,"teacher_disagreement_score":0.82675356,"about_ca_system_score_codex":0.000019804898,"about_ca_system_score_gemma":0.000059330087,"threshold_uncertainty_score":0.3329428},"labels":[],"label_agreement":null},{"id":"W2295522973","doi":"10.1007/s00446-015-0259-2","title":"Rendezvous in networks in spite of delay faults","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Upper and lower bounds; Bounded function; Node (physics); Leader election; Algorithm; Mathematics; Computer network","score_opus":0.029227116691228003,"score_gpt":0.27477104107005124,"score_spread":0.24554392437882322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295522973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043669406,0.00010273264,0.95510197,0.00017515026,0.00013273438,0.00012023853,0.000003769612,0.00006576076,0.0006282159],"genre_scores_gemma":[0.98267096,0.000004454535,0.017203512,0.000053962536,0.000018271468,0.0000017985213,0.000037334437,0.0000046123023,0.0000050726603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00012614107,0.00038989598,0.00024888667,0.00021543614,0.00032753238],"domain_scores_gemma":[0.99930227,0.000082641236,0.000109814486,0.00027826312,0.00012500775,0.00010198462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007433728,0.00009320734,0.0001809837,0.00014529453,0.00002375474,0.000042438747,0.00054784527,0.00006442237,0.0000014653202],"category_scores_gemma":[0.00010664865,0.00009611452,0.000027408658,0.0012480048,0.00002418458,0.00016754224,0.00022654097,0.00020129119,0.0000036337779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053160725,0.000067545974,0.01968241,0.000005570132,0.0000026176922,0.00003128167,0.0005239443,0.96431506,0.000007788364,0.0054458026,0.00021955393,0.009693131],"study_design_scores_gemma":[0.0007043689,0.000040686144,0.008336372,0.000058437578,4.8824666e-7,0.000005102342,0.000056855184,0.99005944,0.00003659937,0.00042851517,0.00017449092,0.000098630764],"about_ca_topic_score_codex":0.00011433427,"about_ca_topic_score_gemma":0.000035189827,"teacher_disagreement_score":0.93900156,"about_ca_system_score_codex":0.0000862563,"about_ca_system_score_gemma":0.00007956142,"threshold_uncertainty_score":0.39194363},"labels":[],"label_agreement":null},{"id":"W2304936616","doi":"10.1137/16m1107899","title":"The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme","keywords":"Matroid; Minor (academic); Combinatorics; Graphic matroid; Matroid partitioning; Mathematics; Conjecture; Prime (order theory); Constant (computer programming); Discrete mathematics; Oriented matroid; Computer science; Law; Political science","score_opus":0.03167635855695254,"score_gpt":0.28859968637436695,"score_spread":0.2569233278174144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304936616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070512824,0.0010389794,0.97014934,0.02241802,0.0005612524,0.0019544568,0.00004551824,0.0001611107,0.0029662203],"genre_scores_gemma":[0.023351613,0.0036408368,0.96917367,0.0010429358,0.00060608797,0.0002608818,0.000038624145,0.00013062079,0.0017547124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968358,0.0002494722,0.0010140479,0.00052437803,0.00080801616,0.0005682782],"domain_scores_gemma":[0.99664927,0.0010548526,0.00084675726,0.00075919233,0.00028703455,0.00040290592],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015765744,0.00048184575,0.00068756123,0.00014489533,0.000739737,0.0025572632,0.0018429334,0.00021599328,0.00001524471],"category_scores_gemma":[0.00033780746,0.00030306535,0.00039832195,0.0001756187,0.00014542289,0.00026529955,0.0010455713,0.0012676914,0.000020377896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090624706,0.00057019957,0.000078492725,0.008483971,0.0020232012,0.00020350194,0.015892368,0.021815415,0.00088079803,0.85638934,0.06285024,0.029906228],"study_design_scores_gemma":[0.0021285766,0.0004436691,0.000018987212,0.00065598125,0.00008235404,0.00018918855,0.00029861202,0.5187194,0.00011365953,0.46787244,0.008975671,0.0005014715],"about_ca_topic_score_codex":0.0000012447944,"about_ca_topic_score_gemma":0.000002471443,"teacher_disagreement_score":0.49690396,"about_ca_system_score_codex":0.00007785059,"about_ca_system_score_gemma":0.00032898693,"threshold_uncertainty_score":0.9999421},"labels":[],"label_agreement":null},{"id":"W2309145395","doi":"10.1007/978-3-319-24729-8_5","title":"The Rendezvous Problem: Limited Camera Range","year":2015,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rendezvous; Visibility; Computer science; Range (aeronautics); Computer vision; Graph; Lipschitz continuity; Artificial intelligence; Mathematics; Theoretical computer science; Engineering; Physics; Mathematical analysis; Optics","score_opus":0.016221490765313106,"score_gpt":0.20912155345327896,"score_spread":0.19290006268796586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309145395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024114597,0.008642329,0.9599593,0.0012447994,0.0005682012,0.00068907544,0.0000021487015,0.0005577708,0.02831225],"genre_scores_gemma":[0.016725838,0.016702894,0.64077145,0.0027448863,0.00398175,0.00042704048,0.000054625965,0.0007593255,0.31783217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997914,0.000027159496,0.00043596857,0.00059276004,0.0004548378,0.000575257],"domain_scores_gemma":[0.99887055,0.00019186917,0.00009228885,0.00048570335,0.00013104075,0.0002285367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004447538,0.0003712721,0.00037407133,0.00028442562,0.000111183166,0.000359451,0.0008279202,0.00022880117,0.000004592066],"category_scores_gemma":[0.000022434513,0.00030075453,0.000083662664,0.0002517361,0.00004660041,0.00017647221,0.0005437991,0.00090228964,0.000019243706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011784003,0.000028835133,0.000028427328,0.000056311335,0.00007549651,0.00010327871,0.00021027567,0.0165688,0.0000062211957,0.69544053,0.0026697223,0.28480032],"study_design_scores_gemma":[0.00037043606,0.0001227617,0.00010678439,0.00010878991,0.000006235711,0.000044970886,1.8832299e-7,0.72002363,0.000003490917,0.0057010897,0.27309102,0.00042058766],"about_ca_topic_score_codex":0.00001985243,"about_ca_topic_score_gemma":0.000007391581,"teacher_disagreement_score":0.70345485,"about_ca_system_score_codex":0.00014263044,"about_ca_system_score_gemma":0.00009816523,"threshold_uncertainty_score":0.99994445},"labels":[],"label_agreement":null},{"id":"W2338647221","doi":"10.13053/rcs-107-1-15","title":"3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows","year":2015,"lang":"en","type":"article","venue":"Research in Computing Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unit (ring theory); Computer science; Algorithm; Mathematics","score_opus":0.1528335924436866,"score_gpt":0.38960855446794607,"score_spread":0.23677496202425946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338647221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014276664,0.00004534382,0.9920811,0.0024058218,0.00007285633,0.0012906874,8.574241e-7,0.00012477589,0.0025509102],"genre_scores_gemma":[0.14435779,0.000007100074,0.8549803,0.00008210392,0.000082525316,0.000065357024,0.0000019372699,0.000012463682,0.0004104528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960657,0.00029803097,0.00028269368,0.0006273342,0.0018056675,0.0009206229],"domain_scores_gemma":[0.9967378,0.0010030248,0.000078746256,0.0006107122,0.0013163657,0.00025335053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021160347,0.000113715476,0.00012956385,0.00053935614,0.0009442776,0.00093882537,0.002360152,0.00003759238,0.0000019903084],"category_scores_gemma":[0.0003187819,0.00007551146,0.000024349547,0.004705349,0.000672801,0.00084162795,0.0005204371,0.00041379148,0.000032337506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019218924,0.00017407884,0.0004885749,0.000045771667,0.000008899891,0.000012923804,0.006780063,0.36215797,0.00034739787,0.034044005,0.00055164844,0.59536946],"study_design_scores_gemma":[0.0004331014,0.00024920117,0.00014412508,0.00008160262,6.2439625e-7,0.000014418728,0.00021178582,0.9936938,0.0004226879,0.003657472,0.0009789459,0.000112187394],"about_ca_topic_score_codex":0.00006788774,"about_ca_topic_score_gemma":0.000008947544,"teacher_disagreement_score":0.6315359,"about_ca_system_score_codex":0.00018391907,"about_ca_system_score_gemma":0.001330895,"threshold_uncertainty_score":0.90531147},"labels":[],"label_agreement":null},{"id":"W2338813786","doi":"10.1007/978-3-319-41168-2_9","title":"Know When to Persist: Deriving Value from a Stream Buffer","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Data stream; Scheduling (production processes); Random permutation; Competitive analysis; Buffer (optical fiber); Online algorithm; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics; Discrete mathematics","score_opus":0.017708914270618627,"score_gpt":0.24411503559238928,"score_spread":0.22640612132177065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338813786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030277919,0.00026886913,0.98410267,0.004810498,0.0012766063,0.0004640219,0.000016179374,0.00021242586,0.008818454],"genre_scores_gemma":[0.02228264,0.00006352248,0.96865517,0.0048834737,0.0006666426,0.000018450608,0.0000060215225,0.000055346325,0.0033687088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956696,0.00006147622,0.0004533573,0.0018374092,0.0011681409,0.0008100334],"domain_scores_gemma":[0.9969215,0.0005872004,0.000166372,0.0015891149,0.0003094889,0.0004263418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006359543,0.0005181097,0.0004982359,0.00079821184,0.00029846132,0.0009126708,0.0041309935,0.00028410877,0.0001976326],"category_scores_gemma":[0.0001561123,0.00041933957,0.0001441678,0.00042773937,0.00036508983,0.00072026486,0.0022705232,0.00053729495,0.00030576356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000557282,0.000031809057,0.00007336378,0.000016806054,0.000021629528,0.000054784326,0.0030814495,0.032657947,0.0003078969,0.030871864,0.0002380877,0.93263876],"study_design_scores_gemma":[0.0005190184,0.00031423816,0.0001495783,0.0014539416,0.0000109475195,0.000025505336,4.841423e-7,0.692411,0.0011480639,0.281974,0.020591652,0.0014016203],"about_ca_topic_score_codex":0.000063108666,"about_ca_topic_score_gemma":0.000106431806,"teacher_disagreement_score":0.93123716,"about_ca_system_score_codex":0.00039074584,"about_ca_system_score_gemma":0.00060050626,"threshold_uncertainty_score":0.99982584},"labels":[],"label_agreement":null},{"id":"W2342108770","doi":"10.1016/j.tcs.2016.04.016","title":"An alternative proof for the equivalence of ∞-searcher and 2-searcher","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Visibility; Equivalence (formal languages); Conjecture; Computer science; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.03990573698417783,"score_gpt":0.33345797334618205,"score_spread":0.2935522363620042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342108770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057678344,0.000028212806,0.9886567,0.004592671,0.0001143679,0.000431971,0.0000028381871,0.000039920033,0.0003655079],"genre_scores_gemma":[0.8491029,0.000021823495,0.15057331,0.00019365385,0.000049948696,0.000023339899,9.0503e-8,0.0000051918873,0.00002974187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801594,0.0001613174,0.00019305186,0.0005185814,0.0006558916,0.00045520088],"domain_scores_gemma":[0.9972827,0.0012770514,0.00005516636,0.00068572257,0.00046974543,0.0002296256],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030943467,0.00010618605,0.00012557919,0.00010338419,0.00028815217,0.00028181254,0.0024907715,0.000028490336,0.00003545347],"category_scores_gemma":[0.00028309476,0.000051597573,0.000034046232,0.00050592225,0.004976913,0.0010522205,0.00078607205,0.00008895531,0.0000052732703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010782944,0.000036005655,0.00003692339,0.0000069777407,0.0000033368553,4.483843e-7,0.0005384496,0.00012498857,0.002780168,0.834769,0.000011370865,0.16168156],"study_design_scores_gemma":[0.00031376435,0.00048135934,0.00040732985,0.000031085558,0.0000017885029,0.000004955906,0.000009524446,0.794253,0.016830169,0.18747488,0.000093062554,0.00009908713],"about_ca_topic_score_codex":0.0000030774354,"about_ca_topic_score_gemma":4.125854e-7,"teacher_disagreement_score":0.84333503,"about_ca_system_score_codex":0.000025935577,"about_ca_system_score_gemma":0.00014323994,"threshold_uncertainty_score":0.997731},"labels":[],"label_agreement":null},{"id":"W2342411541","doi":"10.1109/tkde.2016.2527003","title":"Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Computer science; Scalability; Matching (statistics); Scheduling (production processes); The Internet; Time complexity; Approximation algorithm; Blossom algorithm; Context (archaeology); Theoretical computer science; Data mining; Graph; Combinatorics; Algorithm; Mathematics; World Wide Web; Mathematical optimization; Database","score_opus":0.030657586213925878,"score_gpt":0.28427757784468977,"score_spread":0.2536199916307639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342411541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025410517,0.00014416012,0.9959306,0.0007453961,0.00013001781,0.00019197345,0.000052742238,0.00018751118,0.000076526776],"genre_scores_gemma":[0.98792285,0.00035973106,0.011159675,0.000106549414,0.00003176548,0.00004904829,0.000006958998,0.000015526546,0.00034786813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.000018009949,0.0001368488,0.00036585671,0.00008075119,0.00017344083],"domain_scores_gemma":[0.99918765,0.00011164772,0.000015411988,0.00046407196,0.0000473919,0.00017385506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000155416,0.0001116036,0.000100475736,0.0001607541,0.00011827398,0.00007300693,0.0003511543,0.000041314317,0.000008947444],"category_scores_gemma":[0.000003999195,0.00008972786,0.000011566997,0.00025132348,0.000008907464,0.0006697907,0.00002203906,0.00008518409,0.000078747384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024703173,0.00024000599,0.000021854536,0.00020954738,0.00009532113,0.00000388224,0.0033171629,0.023289166,0.07247821,0.015084025,0.0007280586,0.8845081],"study_design_scores_gemma":[0.00042036062,0.00004913561,0.00007621282,0.00010801941,0.000007879756,0.000008720339,0.000008687533,0.9459383,0.009311027,0.00003180513,0.043811772,0.00022810043],"about_ca_topic_score_codex":0.000004447699,"about_ca_topic_score_gemma":0.000010155222,"teacher_disagreement_score":0.98538184,"about_ca_system_score_codex":0.000016094873,"about_ca_system_score_gemma":0.000014968351,"threshold_uncertainty_score":0.3658996},"labels":[],"label_agreement":null},{"id":"W2345197515","doi":"10.1142/s1793830916500427","title":"Survivability of bouncing robots","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Survivability; Swarm behaviour; Position (finance); Trajectory; Swarm robotics; Mobile robot; Computer science; Robotics; Control theory (sociology); Artificial intelligence; Physics; Control (management)","score_opus":0.02190954584372441,"score_gpt":0.27330321417213055,"score_spread":0.25139366832840615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345197515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057588174,0.00003875418,0.99636346,0.00089719373,0.00001277953,0.00027892936,0.000013610581,0.000052941905,0.0017664604],"genre_scores_gemma":[0.19324876,0.0001505481,0.8057599,0.000042677064,0.00003604868,0.0002061429,0.0000039507186,0.000013253237,0.0005387215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992371,0.000017602999,0.0002441465,0.00020055586,0.00017217935,0.0001284011],"domain_scores_gemma":[0.9990973,0.0001617225,0.000096892145,0.0004438271,0.00012515557,0.000075108794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032756515,0.00007476689,0.00012775892,0.00004116322,0.00009260479,0.000051775503,0.00029106846,0.000028546538,0.000014732066],"category_scores_gemma":[0.000036779213,0.000048157493,0.000032533655,0.00020318633,0.00008844911,0.00017446933,0.00014592808,0.000030361934,0.000009720791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1578793e-7,0.00008392341,0.00012714091,0.00006634635,0.000011625048,1.1795585e-7,0.00044105537,0.00007451194,0.002058882,0.9228118,0.000037110578,0.07428715],"study_design_scores_gemma":[0.0008613114,0.00009379853,0.0012494994,0.00015250758,0.000019575054,0.000012957367,0.00026294205,0.46827373,0.0075832466,0.514999,0.005977941,0.00051349733],"about_ca_topic_score_codex":0.0000069129687,"about_ca_topic_score_gemma":0.0000019437864,"teacher_disagreement_score":0.46819922,"about_ca_system_score_codex":0.000012095944,"about_ca_system_score_gemma":0.000029695138,"threshold_uncertainty_score":0.19638056},"labels":[],"label_agreement":null},{"id":"W2354503817","doi":"","title":"Research on Strategy for Stochastic Blockage Recovery time in Canadian Travel Problem Based on Exponential Distribution","year":2011,"lang":"en","type":"article","venue":"Shuxue de shijian yu renshi","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Exponential function; Exponential distribution; Mathematical optimization; Computer science; Distribution (mathematics); Point (geometry); Operations research; Gamma distribution; Time point; Mathematics; Statistics","score_opus":0.09138370380683074,"score_gpt":0.3169595890350093,"score_spread":0.22557588522817856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354503817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019671261,0.000022058297,0.9328683,0.0033079966,0.00038102246,0.003640109,0.0005781034,0.0002213033,0.03930985],"genre_scores_gemma":[0.9915542,0.0000020692366,0.0068287323,0.00022687169,0.000064546155,0.00020064958,0.00018923088,0.000026258338,0.0009074309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706715,0.00040970038,0.00031242057,0.00059097516,0.00046470153,0.001155051],"domain_scores_gemma":[0.99839604,0.00028222962,0.000058965674,0.00054581615,0.00018829593,0.00052867713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022661788,0.0001900738,0.00019323359,0.0006661449,0.00027694058,0.00023129075,0.00072889094,0.00019264131,0.0001398648],"category_scores_gemma":[0.00018023093,0.00019550741,0.00007995147,0.0008255463,0.00008117022,0.00022767579,0.00004600402,0.00050287973,0.00015385497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016684401,0.0019814596,0.00059333106,0.00025631665,0.00007826612,0.00042260098,0.0052063586,0.4438204,0.0013609364,0.46334255,0.03357474,0.047694635],"study_design_scores_gemma":[0.0014329443,0.0017084744,0.0053043114,0.0001927129,0.0000044136336,0.0000052417677,0.00007474027,0.9791081,0.00088337826,0.010217661,0.0006649695,0.00040304018],"about_ca_topic_score_codex":0.016654503,"about_ca_topic_score_gemma":0.029073965,"teacher_disagreement_score":0.97188294,"about_ca_system_score_codex":0.0006296922,"about_ca_system_score_gemma":0.0013552823,"threshold_uncertainty_score":0.9898937},"labels":[],"label_agreement":null},{"id":"W2371255390","doi":"","title":"Online Canadian Traveler Problem with Stochastic Blockages Recovery Time","year":2005,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Point (geometry); Operations research; Process (computing); Accident (philosophy); Travel time; Mathematical optimization; Transport engineering; Mathematics; Engineering","score_opus":0.009456256601901239,"score_gpt":0.21090978062566035,"score_spread":0.2014535240237591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371255390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016826784,0.000030214747,0.9350635,0.017615268,0.00003599684,0.0004173205,0.000011841695,0.00026529457,0.0448779],"genre_scores_gemma":[0.15949614,0.000009882493,0.7678894,0.004001755,0.00011231755,0.00002129699,0.000027929613,0.000023674878,0.06841763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990291,0.000026294905,0.0001341593,0.00025926548,0.00019722327,0.00035393127],"domain_scores_gemma":[0.99927163,0.00002251904,0.000026454787,0.0002752304,0.00009712721,0.0003070198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012505529,0.00010581749,0.00009835749,0.00016897538,0.00010075454,0.0001512963,0.00040930707,0.000040360945,0.0006315732],"category_scores_gemma":[0.000008862167,0.00007977618,0.000020864578,0.00032362127,0.00002563753,0.00040868373,0.00003993814,0.00010621236,0.00041402763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014860929,0.00042240013,0.0000609676,0.000017879007,0.000060667902,0.000029828438,0.0013643259,0.71175003,0.00021342405,0.023657823,0.03516663,0.22724116],"study_design_scores_gemma":[0.00044737695,0.00021607346,0.00027202096,0.000024079589,0.0000036380698,0.00003295084,0.000015654588,0.9815465,0.00006548626,0.00034942324,0.016755095,0.00027170542],"about_ca_topic_score_codex":0.0042463816,"about_ca_topic_score_gemma":0.06853139,"teacher_disagreement_score":0.26979646,"about_ca_system_score_codex":0.000076541204,"about_ca_system_score_gemma":0.00040391652,"threshold_uncertainty_score":0.94846547},"labels":[],"label_agreement":null},{"id":"W2382551251","doi":"","title":"The Research on Swarm Intelligence Based on 0/1 Knapsack Problem Solution","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Swarm intelligence; Computer science; Mathematical optimization; Cutting stock problem; Particle swarm optimization; Robustness (evolution); Polynomial-time approximation scheme; Generalized assignment problem; Ant colony optimization algorithms; Combinatorial optimization; Swarm behaviour; Convergence (economics); Optimization problem; Mathematics","score_opus":0.0695622077182088,"score_gpt":0.3686154180933716,"score_spread":0.2990532103751628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382551251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005126379,0.000032803633,0.9800274,0.007085532,0.00003326445,0.001310608,0.0000018719282,0.0002123949,0.0112449005],"genre_scores_gemma":[0.111828394,0.00005456956,0.8830909,0.0025464476,0.00027237186,0.0008412707,0.000021822012,0.00003195324,0.0013122567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764097,0.00016436943,0.00035573833,0.0005925836,0.0006015593,0.000644789],"domain_scores_gemma":[0.997394,0.0009992059,0.000075527525,0.0009493803,0.00041541096,0.00016647333],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002721097,0.0001512705,0.00009551639,0.00031708967,0.0012968362,0.00046387626,0.0017670933,0.000081116865,0.000006561342],"category_scores_gemma":[0.000004533885,0.00011551662,0.00006507137,0.0015287775,0.00017345438,0.00013841683,0.00027309332,0.00049495394,0.00090850523],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016875932,0.00036592456,0.000013703565,0.0000127767025,0.000007862269,0.000001629011,0.0002929946,0.034848712,0.00053052726,0.36988503,0.0101782335,0.58384573],"study_design_scores_gemma":[0.00016966791,0.00020431602,0.00016809799,0.000031488482,0.0000012187744,0.0000034313753,0.000023955985,0.34373587,0.010680483,0.010895604,0.63389665,0.00018923884],"about_ca_topic_score_codex":0.000012247314,"about_ca_topic_score_gemma":0.00001724959,"teacher_disagreement_score":0.6237184,"about_ca_system_score_codex":0.00016490166,"about_ca_system_score_gemma":0.00012601471,"threshold_uncertainty_score":0.9998694},"labels":[],"label_agreement":null},{"id":"W23905021","doi":"10.1007/978-3-642-39212-2_45","title":"Localization for a System of Colliding Robots","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Mobile robot; Visibility; Trajectory; Position (finance); Obstacle; Computer science; Simulation; Control theory (sociology); Topology (electrical circuits); Physics; Engineering; Artificial intelligence; Geography; Control (management); Electrical engineering; Optics","score_opus":0.02593684835541053,"score_gpt":0.25550442466648365,"score_spread":0.22956757631107313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23905021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002336018,0.00013322334,0.9952167,0.00021559522,0.0008250813,0.00095592724,0.000004334761,0.0001163686,0.0025304216],"genre_scores_gemma":[0.0516455,0.00002603601,0.947151,0.0003522219,0.00016519937,0.000041883697,0.000008463526,0.000031521755,0.00057817827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753064,0.000028035862,0.0005277076,0.0008352786,0.00066891545,0.00040939552],"domain_scores_gemma":[0.99777204,0.00034639103,0.00033731083,0.00074659137,0.0006774185,0.00012026952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007696428,0.00027527034,0.0004213607,0.0006599684,0.0001862378,0.00034164524,0.0018332927,0.00021811549,0.0000118395],"category_scores_gemma":[0.00008279032,0.0002503926,0.00009634686,0.00056940905,0.0002667146,0.0005092365,0.0005233264,0.0002080662,0.000016897999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024765463,0.000012829936,0.000008983755,0.00023686269,0.000007037772,0.0000030101285,0.00039898828,0.7003196,0.00006116979,0.17710543,0.000052263196,0.12179137],"study_design_scores_gemma":[0.00022264766,0.00012393341,0.0000028801594,0.00055804517,0.0000035764792,0.000010776296,2.3519722e-7,0.97632295,0.0009136962,0.020990813,0.00059813645,0.0002523232],"about_ca_topic_score_codex":0.000013535782,"about_ca_topic_score_gemma":0.000008954948,"teacher_disagreement_score":0.27600336,"about_ca_system_score_codex":0.00024429886,"about_ca_system_score_gemma":0.00042684644,"threshold_uncertainty_score":0.9999948},"labels":[],"label_agreement":null},{"id":"W2393415573","doi":"10.1177/0278364915620848","title":"Reliable confirmation of an object identity by a mobile robot: A mixed appearance/localization-driven motion approach","year":2016,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Mobile robot; Novelty; Computer science; Artificial intelligence; Computer vision; Robot; Identity (music); Object (grammar); Motion (physics); Novelty detection; False positive paradox; Process (computing); Psychology","score_opus":0.05191870500519372,"score_gpt":0.36006660591655976,"score_spread":0.308147900911366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393415573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004659389,0.00011682771,0.9919564,0.0022583394,0.00033260725,0.00026202513,0.0000062475456,0.000016388594,0.00039173893],"genre_scores_gemma":[0.9599333,0.00040303086,0.039130036,0.00006118133,0.00011967339,0.000013036732,0.00000804852,0.000012589812,0.00031910167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607986,0.0005052273,0.0005974572,0.00019008188,0.0023773296,0.0002500246],"domain_scores_gemma":[0.995488,0.00022020772,0.00038843145,0.00036215526,0.0034203192,0.00012092444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003674709,0.00009556753,0.00017614612,0.00039568386,0.00015716245,0.00031558948,0.0025386035,0.00006585744,0.000031838754],"category_scores_gemma":[0.0003567097,0.0000588463,0.00008430862,0.0005697825,0.00019928203,0.0019267342,0.00031627654,0.0002823344,0.000018868954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008859551,0.0005083845,0.0004781705,0.00002579889,0.00011566022,0.000007658893,0.0010458115,0.9310289,0.012416964,0.037315458,0.0026746928,0.014293883],"study_design_scores_gemma":[0.0011855189,0.00037430722,0.0003525,0.0001676963,0.000006571992,0.00008466734,0.00023135029,0.98081917,0.007898766,0.008177476,0.0005884802,0.0001135276],"about_ca_topic_score_codex":0.000052608477,"about_ca_topic_score_gemma":0.000009038656,"teacher_disagreement_score":0.9552739,"about_ca_system_score_codex":0.00018034446,"about_ca_system_score_gemma":0.00024555883,"threshold_uncertainty_score":0.47173992},"labels":[],"label_agreement":null},{"id":"W2395192821","doi":"10.1007/978-3-662-48971-0_30","title":"When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Patrolling; Computer science; Eulerian path; Enhanced Data Rates for GSM Evolution; Mobile robot; Domain (mathematical analysis); Robot; Graph; Line segment; Point (geometry); Algorithm; Robotics; Line (geometry); Combinatorics; Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.05845675204202838,"score_gpt":0.305469587630638,"score_spread":0.2470128355886096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395192821","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013468425,0.0007824934,0.9939736,0.00021650485,0.0025084345,0.0006875326,0.00000678064,0.00026993288,0.0014200478],"genre_scores_gemma":[0.041924104,0.00009105888,0.95617074,0.00039578974,0.0006500689,0.000028882563,0.000008558767,0.000066592176,0.00066421623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950004,0.00009000287,0.00063941366,0.0016469948,0.0016731035,0.00095007685],"domain_scores_gemma":[0.9967722,0.00027053533,0.00034015434,0.0015011868,0.0006783271,0.00043759443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015696188,0.00060383475,0.0006257731,0.0011511502,0.0004264178,0.0009834869,0.0036611254,0.00037375724,0.000035259174],"category_scores_gemma":[0.0000821879,0.00056712795,0.00015540271,0.00082077377,0.00049157534,0.0011429284,0.0019433277,0.0011684881,0.00004584644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004023394,0.000030009725,0.0001833609,0.000026295267,0.000015581978,0.000057486926,0.0013853299,0.7654031,0.000114018345,0.0015162512,0.000034102897,0.23123047],"study_design_scores_gemma":[0.00040944893,0.00022912287,0.000022516577,0.00036249118,0.000009849231,0.00006101024,9.1838666e-7,0.9315049,0.00026576247,0.06510577,0.0012670847,0.0007611351],"about_ca_topic_score_codex":0.000075072894,"about_ca_topic_score_gemma":0.000021732525,"teacher_disagreement_score":0.23046933,"about_ca_system_score_codex":0.00058328855,"about_ca_system_score_gemma":0.0008744312,"threshold_uncertainty_score":0.999678},"labels":[],"label_agreement":null},{"id":"W2397069087","doi":"","title":"Minimum degree and nowhere-zero 3-flows.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Zero (linguistics); Physics; Philosophy","score_opus":0.021657299920637,"score_gpt":0.23882028423757679,"score_spread":0.21716298431693978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397069087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85473996,0.00068646413,0.07149956,0.009958182,0.004284783,0.0014380291,0.0000022863574,0.0008932056,0.05649756],"genre_scores_gemma":[0.9797181,0.000044547538,0.018513378,0.0004203566,0.000004213387,0.00003434085,0.0000015231562,0.000010421768,0.001253106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990285,0.00005590163,0.0001558254,0.00027953146,0.00021007749,0.00027018762],"domain_scores_gemma":[0.999179,0.00007462786,0.000040984178,0.00039732238,0.00012915909,0.00017888978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015231759,0.0001092043,0.00011920551,0.00006864306,0.000117638905,0.00028986565,0.00048866676,0.00005955663,0.0001014065],"category_scores_gemma":[0.00004231029,0.00009981694,0.000026363392,0.00025398185,0.00004194535,0.00062822225,0.0002737192,0.00011405578,0.00041126346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013286608,0.00008365965,0.001900112,0.000014502001,0.000014329744,0.0000060529323,0.00048597262,0.000028379876,0.00048452758,0.9518044,0.021806464,0.023370285],"study_design_scores_gemma":[0.0013094629,0.00018944072,0.0065288427,0.000022225844,0.0000035650255,0.00001403945,0.000025200477,0.16263832,0.00039787445,0.82144564,0.0070784106,0.00034699452],"about_ca_topic_score_codex":0.00005734879,"about_ca_topic_score_gemma":0.0000032708767,"teacher_disagreement_score":0.16260995,"about_ca_system_score_codex":0.000018092505,"about_ca_system_score_gemma":0.000037879705,"threshold_uncertainty_score":0.5286097},"labels":[],"label_agreement":null},{"id":"W2398465054","doi":"10.1007/978-3-319-28472-9_7","title":"Deterministic Rendezvous with Detection Using Beeps","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Node (physics); Logarithm; Mobile agent; Real-time computing; Integer (computer science); Computer network; Distributed computing; Algorithm; Mathematics; Operating system","score_opus":0.047112980001445294,"score_gpt":0.27870269572671186,"score_spread":0.23158971572526657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398465054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055936835,0.00013875503,0.9955468,0.00015125939,0.00079726893,0.00035336654,0.0000021296837,0.00017977478,0.0027747115],"genre_scores_gemma":[0.2148846,0.000017125134,0.78365093,0.00051650865,0.0003196729,0.000008137829,0.0000033616543,0.000051942094,0.0005477095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965611,0.00004447571,0.00037850853,0.0012267383,0.0011995902,0.0005896017],"domain_scores_gemma":[0.99776775,0.00016130312,0.0002494577,0.0010589549,0.0004984289,0.0002640839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079911907,0.00041559152,0.00038721206,0.0008135339,0.0002815123,0.0006532638,0.0019231874,0.00024015713,0.000013613962],"category_scores_gemma":[0.0000763691,0.00035110582,0.000058266985,0.00073656865,0.0005557923,0.0006519088,0.0007586094,0.0006539665,0.000026710646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010705121,0.00002059282,0.000013078141,0.000028903412,0.000009156587,0.00014739035,0.0005408499,0.42691803,0.00012034147,0.0033111617,0.0000045911397,0.5688752],"study_design_scores_gemma":[0.00027624378,0.0003468177,0.000010101682,0.00020354887,0.0000071900026,0.00027117747,1.2714524e-7,0.96259093,0.00033526367,0.034695704,0.0007810014,0.00048186438],"about_ca_topic_score_codex":0.000024487168,"about_ca_topic_score_gemma":0.00013471465,"teacher_disagreement_score":0.56839335,"about_ca_system_score_codex":0.00046007484,"about_ca_system_score_gemma":0.0009847198,"threshold_uncertainty_score":0.9998941},"labels":[],"label_agreement":null},{"id":"W2402513160","doi":"","title":"Competitive Routing on a Bounded-Degree Plane Spanner","year":2012,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Danmarks Frie Forskningsfond","keywords":"Degree (music); Bounded function; Spanner; Plane (geometry); Routing (electronic design automation); Combinatorics; Computer science; Mathematics; Computer network; Physics; Distributed computing; Geometry; Mathematical analysis","score_opus":0.05395445164663279,"score_gpt":0.2570213218994755,"score_spread":0.20306687025284273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402513160","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46284556,0.00023573004,0.037615962,0.001287947,0.00025451873,0.001365894,0.001136483,0.00026130848,0.49499658],"genre_scores_gemma":[0.9695187,0.00006677598,0.008432487,0.000033081218,0.00005953958,1.4024641e-7,0.000035625097,0.000030392972,0.021823263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9955343,0.00071010523,0.00026566378,0.00064950687,0.0017289582,0.0011114597],"domain_scores_gemma":[0.99690866,0.0004642893,0.0003770741,0.0008874412,0.00074645894,0.00061605405],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0023375305,0.0003059542,0.00051026896,0.00082988356,0.00094474404,0.00006843343,0.002311301,0.0002732431,0.0052877557],"category_scores_gemma":[0.00012443255,0.00037078033,0.00030138833,0.0011790117,0.0011551348,0.00063721644,0.0012144978,0.00081896526,0.0035380619],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037196542,0.005569764,0.12745045,0.00082008465,0.0022912538,0.0021604623,0.376511,0.0012446857,0.0036869175,0.41591182,0.02248791,0.038146004],"study_design_scores_gemma":[0.009328274,0.0016516601,0.0129577825,0.0011604547,0.00018393417,0.00010719141,0.90242463,0.016350457,0.00048937654,0.0028495037,0.05016224,0.0023344979],"about_ca_topic_score_codex":0.0023431443,"about_ca_topic_score_gemma":0.0010138405,"teacher_disagreement_score":0.5259136,"about_ca_system_score_codex":0.00013343513,"about_ca_system_score_gemma":0.00032506208,"threshold_uncertainty_score":0.9998744},"labels":[],"label_agreement":null},{"id":"W2404009953","doi":"10.1080/03155986.2001.11732437","title":"Le Stockage Massif De L’Énergie Hydroélectrique : Modèle D’Investissement Et Méthode De Solution Par Décomposition","year":2001,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Hydroelectricity; Energy storage; Environmental science; Mathematics; Mathematical optimization; Computer science; Electrical engineering; Engineering; Physics; Thermodynamics","score_opus":0.14738548314368705,"score_gpt":0.3633482117204766,"score_spread":0.21596272857678955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404009953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050679864,0.0007537689,0.9331336,0.025054386,0.0003096364,0.00123639,0.00004942042,0.00008361532,0.03431122],"genre_scores_gemma":[0.95032865,0.0020584112,0.03443613,0.0019085611,0.0002792154,0.0005834422,0.0003519411,0.00002030206,0.010033324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543023,0.0011211524,0.0008956846,0.0002739152,0.0013584419,0.0009205984],"domain_scores_gemma":[0.9971654,0.00034436883,0.00017427753,0.00033187543,0.0015025183,0.00048159712],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008030145,0.00022435567,0.00023056657,0.00060904614,0.0013376443,0.003315764,0.0004318382,0.0002869188,0.00006663028],"category_scores_gemma":[0.00038956135,0.0002398995,0.000061897386,0.0008782191,0.00021941146,0.007903993,0.00027833928,0.00065549935,0.00016328438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000396655,0.000080826045,0.0003553321,0.00017134666,0.000028026141,0.000008432591,0.0043737805,0.24978106,0.0010118645,0.72892517,0.010332775,0.004891694],"study_design_scores_gemma":[0.00071522786,0.00021760711,0.0011380753,0.00020431684,0.0000031161376,0.0002303317,0.0003913466,0.7936556,0.00037446053,0.0017627968,0.20109539,0.00021176806],"about_ca_topic_score_codex":0.00385944,"about_ca_topic_score_gemma":0.00015217104,"teacher_disagreement_score":0.9452607,"about_ca_system_score_codex":0.00060801144,"about_ca_system_score_gemma":0.0033430508,"threshold_uncertainty_score":0.99996245},"labels":[],"label_agreement":null},{"id":"W2405214329","doi":"10.1080/03155986.2003.11732679","title":"A Logarithmic Barrier Approach To Solving The Dashboard Planning Problem","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dashboard; Workload; Computer science; Logarithm; Mathematical optimization; Mathematics; Operating system; Data science","score_opus":0.07240547268433704,"score_gpt":0.3360515189362072,"score_spread":0.26364604625187016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405214329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009155204,0.00010151504,0.7976987,0.00092845195,0.00014560799,0.0016884222,0.000008321061,0.00007171573,0.19844174],"genre_scores_gemma":[0.915958,0.000027072643,0.07703997,0.0017771967,0.00010046397,0.001090251,0.00004586015,0.000012423251,0.003948758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752504,0.00025744212,0.0004752111,0.00017492757,0.0011669273,0.000400485],"domain_scores_gemma":[0.99822533,0.00022701194,0.000057748002,0.0003098166,0.0009719197,0.0002081772],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0044963504,0.00011176793,0.000118737415,0.00038971065,0.0010611617,0.002836672,0.000522913,0.00007211877,0.00001212631],"category_scores_gemma":[0.0004699304,0.000075646036,0.000025093193,0.00075903063,0.000070041155,0.0031059054,0.00021631276,0.0003180012,0.00015119389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048038933,0.000010637323,0.00025300073,0.00005407026,0.000011275797,3.2295497e-7,0.008306328,0.106279664,0.000019451163,0.87721384,0.0063269883,0.0015196366],"study_design_scores_gemma":[0.0003351235,0.00006641716,0.00026291175,0.000045042143,6.9886175e-7,0.000046661717,0.0020703804,0.5869334,0.000031102823,0.00031688745,0.40974587,0.0001455277],"about_ca_topic_score_codex":0.000066354616,"about_ca_topic_score_gemma":0.0000013929302,"teacher_disagreement_score":0.91504246,"about_ca_system_score_codex":0.00008288093,"about_ca_system_score_gemma":0.00041569414,"threshold_uncertainty_score":0.99819845},"labels":[],"label_agreement":null},{"id":"W2463954311","doi":"10.1145/3280823","title":"Deterministic Graph Exploration with Advice","year":2018,"lang":"en","type":"preprint","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Oracle; Advice (programming); Graph; Computer science; Theoretical computer science; Time complexity; Combinatorics; A priori and a posteriori; Node (physics); Discrete mathematics; Mathematics; Algorithm","score_opus":0.04404600970732654,"score_gpt":0.2913510131177562,"score_spread":0.24730500341042966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463954311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007666213,0.000020804859,0.9946108,0.0019655875,0.0009661822,0.0005675322,0.000033461714,0.0007446687,0.0010143222],"genre_scores_gemma":[0.043238174,0.0002683033,0.9539878,0.0006046419,0.00015240593,0.00049054966,0.000046600886,0.00005696418,0.0011546082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765456,0.00014147413,0.00035132992,0.0008868216,0.00059932296,0.0003664774],"domain_scores_gemma":[0.9971314,0.00012441739,0.00016592817,0.0020035172,0.0003729852,0.00020177434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025381873,0.0003570387,0.0002796038,0.0004438204,0.00036168768,0.00047073467,0.0017295361,0.00024515903,0.000109850356],"category_scores_gemma":[0.000022921085,0.0003164621,0.00012573443,0.00061393954,0.00013472945,0.00061385526,0.0000845701,0.0007091679,0.00022457722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009247544,0.0009552923,0.0000072841754,0.00023783643,0.00033685053,0.00008197261,0.0039476487,0.27996084,0.00002483569,0.0012794902,0.0008235754,0.7122519],"study_design_scores_gemma":[0.001106549,0.0012211187,0.00011446935,0.00036186745,0.00008356968,0.000050873114,0.000104774575,0.9609646,0.0007748778,0.030858802,0.0032871393,0.0010713275],"about_ca_topic_score_codex":0.000045387715,"about_ca_topic_score_gemma":0.000047276157,"teacher_disagreement_score":0.71118057,"about_ca_system_score_codex":0.00008023737,"about_ca_system_score_gemma":0.00027561205,"threshold_uncertainty_score":0.9999288},"labels":[],"label_agreement":null},{"id":"W2465741342","doi":"10.4230/dagsemproc.10071.6","title":"Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold","year":2010,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Sublinear function; Competitive analysis; Omega; Fixed point; Scheduling (production processes); Mathematics; Upper and lower bounds; Computer science; Discrete mathematics; BETA (programming language); Combinatorics; Algorithm; Mathematical optimization","score_opus":0.02426286062609075,"score_gpt":0.2645023520200533,"score_spread":0.24023949139396253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465741342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13121079,0.00003684613,0.8400231,0.0019780197,0.0035324541,0.0023600145,0.00026119497,0.00084972824,0.01974783],"genre_scores_gemma":[0.78936607,0.000020389305,0.20694031,0.0021486632,0.00022056141,0.00019700523,0.00014615523,0.00005950425,0.0009013744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961548,0.000032975095,0.0011945764,0.00046574348,0.0009868912,0.0011650241],"domain_scores_gemma":[0.9968508,0.0001619864,0.00039522725,0.0014162529,0.0006781316,0.00049761316],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010239034,0.00049817783,0.00049058866,0.0003170342,0.00069451885,0.0016164343,0.0021554541,0.0003477482,0.00015539181],"category_scores_gemma":[0.00021523343,0.00044198398,0.0003020033,0.00049263623,0.00032410765,0.0027911835,0.00082346174,0.0009875797,0.00060426566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012179761,0.0066508763,0.030874055,0.004505228,0.0015320914,0.00031271926,0.08574109,0.01448552,0.006981354,0.62386465,0.09153006,0.13230437],"study_design_scores_gemma":[0.0033144183,0.00037548726,0.00061566546,0.0000937712,0.000025789826,0.00017017928,0.00018304768,0.88788325,0.0011630857,0.0013695158,0.103945844,0.0008599542],"about_ca_topic_score_codex":0.000013771741,"about_ca_topic_score_gemma":0.000055658908,"teacher_disagreement_score":0.8733977,"about_ca_system_score_codex":0.00012259974,"about_ca_system_score_gemma":0.0005815603,"threshold_uncertainty_score":0.9998032},"labels":[],"label_agreement":null},{"id":"W2467644617","doi":"10.1007/s00224-015-9649-x","title":"On the Advice Complexity of the k-server Problem Under Sparse Metrics","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Binary logarithm; Competitive analysis; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Sequence (biology); Metric (unit); Tree (set theory); Deterministic algorithm; Path (computing); Time complexity; Graph; Algorithm; Computer science; Pathwidth; Line graph","score_opus":0.12073271240766795,"score_gpt":0.2864676065370435,"score_spread":0.16573489412937556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467644617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072680704,0.00022931915,0.89254093,0.0017679544,0.0010982202,0.001039974,0.0000043587142,0.0001946433,0.030443912],"genre_scores_gemma":[0.99504334,0.000001114534,0.0041814144,0.0002503586,0.00003345194,0.000002990459,5.720328e-7,0.000009691045,0.0004770835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695647,0.0014188524,0.00046400065,0.00021241045,0.00072104303,0.00022723788],"domain_scores_gemma":[0.99709815,0.0010349861,0.00044692986,0.0009122823,0.0004322305,0.000075428856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052017425,0.00012919748,0.00025463625,0.00010033923,0.00014991066,0.00007741629,0.0016980786,0.000048645925,0.0000055420883],"category_scores_gemma":[0.00025416855,0.00007089526,0.00008743115,0.0010941825,0.00029205752,0.0001013075,0.00047873877,0.00018431233,0.000017950551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072756316,0.000054037024,0.00009663063,0.000045333607,0.000021522457,1.8779275e-7,0.0014591124,0.13475934,0.000017210172,0.8624151,0.0009310208,0.00019322835],"study_design_scores_gemma":[0.00056089094,0.00015744928,0.0007733759,0.0003131739,0.000010461126,0.000010250635,0.00077705,0.7714335,0.0003530453,0.22501306,0.0004299005,0.00016784198],"about_ca_topic_score_codex":0.00008796351,"about_ca_topic_score_gemma":0.0000033462948,"teacher_disagreement_score":0.9223626,"about_ca_system_score_codex":0.000049903894,"about_ca_system_score_gemma":0.0001356371,"threshold_uncertainty_score":0.31554806},"labels":[],"label_agreement":null},{"id":"W2472280164","doi":"10.1007/s00224-016-9691-3","title":"Multi-processor Search and Scheduling Problems with Setup Cost","year":2016,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Schedule; Scheduling (production processes); Mathematical optimization; Set (abstract data type); Multiprocessing; Dynamic programming; Computation; Multiprocessor scheduling; Job shop scheduling; Parallel computing; Algorithm; Mathematics; Flow shop scheduling","score_opus":0.03973861380122752,"score_gpt":0.273707058850325,"score_spread":0.23396844504909747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472280164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06403606,0.0002600367,0.93433553,0.00019796555,0.000106180974,0.00050691876,0.0000022850902,0.00017157906,0.0003834177],"genre_scores_gemma":[0.93776333,0.00001822837,0.061713006,0.000026411451,0.000034869936,0.000008799926,6.6247264e-7,0.000015561425,0.0004191322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982808,0.00033959473,0.000325562,0.0003667071,0.0003430786,0.00034422064],"domain_scores_gemma":[0.99861515,0.0003830669,0.00014014432,0.00037039508,0.0003612342,0.00013000505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136775,0.00014610731,0.00025761986,0.00013961553,0.00016235921,0.00014616936,0.0005495311,0.000051668892,0.0000031048316],"category_scores_gemma":[0.0000671075,0.00008885897,0.000020790234,0.0004070331,0.00018946269,0.00029746402,0.00023301525,0.00010115256,0.000013238806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008961882,0.0002815122,0.0070833135,0.0019093767,0.00019764985,0.000016697026,0.015524822,0.26222512,0.018618595,0.60626805,0.000042849697,0.08774241],"study_design_scores_gemma":[0.0016158777,0.0002096613,0.000703388,0.0015061547,0.0000057272946,0.00006536574,0.00027526543,0.9935846,0.0011428092,0.00044670008,0.00017371349,0.000270793],"about_ca_topic_score_codex":0.00001643831,"about_ca_topic_score_gemma":0.0000017304136,"teacher_disagreement_score":0.87372726,"about_ca_system_score_codex":0.00002436573,"about_ca_system_score_gemma":0.00010046705,"threshold_uncertainty_score":0.36235636},"labels":[],"label_agreement":null},{"id":"W2474482100","doi":"10.1007/978-3-319-30139-6_12","title":"A General Framework for Searching on a Line","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Computer science; Line (geometry); Mathematical optimization; Search problem; Alpha (finance); Upper and lower bounds; Mathematics; Statistics; Geometry","score_opus":0.041626329975788655,"score_gpt":0.3133174656662515,"score_spread":0.2716911356904629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474482100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000047609046,0.00007516048,0.98988694,0.0046413136,0.0011935292,0.000662497,0.000010730789,0.00016230745,0.0033627793],"genre_scores_gemma":[0.004079147,0.000043058528,0.98916876,0.0038573118,0.00092050276,0.000028511737,0.0000032181085,0.000037989375,0.0018615247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965271,0.00003904812,0.00038227608,0.0013656225,0.0009229597,0.0007630083],"domain_scores_gemma":[0.9969487,0.0012098326,0.00017028466,0.0011649547,0.00027708875,0.00022910273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010608085,0.00039315733,0.00038124967,0.00078364863,0.00031647115,0.00061670993,0.0028617457,0.00030081903,0.00002892717],"category_scores_gemma":[0.00029566707,0.00029688896,0.00014473154,0.00037834008,0.00037340602,0.00038048552,0.000888271,0.00074789365,0.00005919752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007054909,0.000014791264,0.0000019864913,0.000017720846,0.0000050303497,0.000010516956,0.00023774854,0.052168556,0.000026223011,0.45930177,0.000019777875,0.48818883],"study_design_scores_gemma":[0.00018649497,0.00028114332,0.000002242813,0.00040562992,0.0000011798231,0.0000071409627,1.5096502e-8,0.51769274,0.00028689465,0.4788247,0.002038083,0.00027374778],"about_ca_topic_score_codex":0.0000024232531,"about_ca_topic_score_gemma":0.0000066964176,"teacher_disagreement_score":0.48791507,"about_ca_system_score_codex":0.00022198471,"about_ca_system_score_gemma":0.00052327407,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W2475185878","doi":"10.1007/11664550_7","title":"Getting Mobile Autonomous Robots to Rendezvous","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Rendezvous; Task (project management); Robot; Computer science; Mobile robot; Global Positioning System; Human–computer interaction; Event (particle physics); Artificial intelligence; Real-time computing; Engineering; Telecommunications; Systems engineering","score_opus":0.018963955019881244,"score_gpt":0.24749992572950008,"score_spread":0.22853597070961884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475185878","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2469986e-7,0.00006150171,0.434009,0.00036803298,0.00015732426,0.00030613164,0.0000023972832,0.00034334869,0.56475204],"genre_scores_gemma":[0.000106995794,0.000013961621,0.16943675,0.0010574572,0.00011274223,0.000030634415,0.00001648824,0.000033970497,0.82919097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982108,0.000014701178,0.00036647884,0.0006448854,0.0004000473,0.00036307503],"domain_scores_gemma":[0.99873155,0.00004762519,0.00011061115,0.00075803546,0.00015095592,0.00020121186],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002045792,0.00027462,0.00027334588,0.00025963542,0.00012434703,0.00030822252,0.0009590849,0.00020400708,0.0005793804],"category_scores_gemma":[0.000008822712,0.00026111238,0.00010930471,0.00007531897,0.000024305229,0.00018718188,0.0005495695,0.0002713347,0.0012958847],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011822062,0.000023054898,0.0000010852252,0.00002177564,0.000021246637,0.00004962725,0.00017047394,0.1396844,0.000021067295,0.6467142,0.1141094,0.099182494],"study_design_scores_gemma":[0.00014774267,0.00015458718,0.0000045224874,0.00006189955,0.000005046727,0.000018784582,0.0000017909358,0.07574125,0.00004594871,0.009164876,0.9140489,0.0006046577],"about_ca_topic_score_codex":0.000043781733,"about_ca_topic_score_gemma":0.000024756233,"teacher_disagreement_score":0.7999395,"about_ca_system_score_codex":0.0001155035,"about_ca_system_score_gemma":0.00014892417,"threshold_uncertainty_score":0.9999841},"labels":[],"label_agreement":null},{"id":"W2475215202","doi":"10.1145/2875441","title":"Multiagent Resource Allocation for Dynamic Task Arrivals with Preemption","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Computer science; Leverage (statistics); Task (project management); Distributed computing; Proxy (statistics); Resource (disambiguation); Resource allocation; Multi-agent system; Computer network; Artificial intelligence; Machine learning","score_opus":0.018738801178144377,"score_gpt":0.2621758147648627,"score_spread":0.2434370135867183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475215202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022529908,0.00013359376,0.98873293,0.0075027635,0.000143876,0.0008606632,0.000011219113,0.00032873548,0.000033217857],"genre_scores_gemma":[0.9707201,0.00026919285,0.02711931,0.000043138938,0.000008783862,0.0005224281,0.0000031627503,0.000014766275,0.0012990986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989232,0.000042436837,0.0002498116,0.00040918487,0.0001471558,0.00022822116],"domain_scores_gemma":[0.9988815,0.00014332212,0.00008895039,0.00067171734,0.00014976386,0.00006473627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021340798,0.00013338107,0.00014862875,0.00039495702,0.000193914,0.00006270034,0.0004375778,0.00014879754,0.0000074827744],"category_scores_gemma":[0.00003431697,0.00008697102,0.000030415584,0.00033408258,0.00009273369,0.00018116602,0.0000141377295,0.00009197072,0.000021403926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008690571,0.0003081404,0.00018954641,0.00013623836,0.00016935442,0.0000033018846,0.0004781565,0.010879912,0.0091578,0.08310211,0.00017923779,0.8953093],"study_design_scores_gemma":[0.0050309105,0.0062296903,0.00028620096,0.0016022603,0.00011297112,0.00030326052,0.0016160709,0.67280865,0.07387286,0.020855285,0.21560505,0.0016767748],"about_ca_topic_score_codex":0.0000138268715,"about_ca_topic_score_gemma":0.00002545103,"teacher_disagreement_score":0.9684671,"about_ca_system_score_codex":0.00007322496,"about_ca_system_score_gemma":0.000028874598,"threshold_uncertainty_score":0.3546575},"labels":[],"label_agreement":null},{"id":"W2477849570","doi":"10.1145/2933057.2933102","title":"Search on a Line with Faulty Robots","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Mobile robot; Line (geometry); Computer science; Competitive analysis; Real-time computing; Artificial intelligence; Mathematics","score_opus":0.05193294596895519,"score_gpt":0.2997933968503015,"score_spread":0.24786045088134628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477849570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077768887,0.0000018206998,0.9536832,0.023322938,0.000024238932,0.00008936098,4.0295578e-7,0.00014082354,0.021959543],"genre_scores_gemma":[0.6779037,0.000031233587,0.27414206,0.0053487145,0.00003313897,0.000015065796,8.7242773e-7,0.0000111147765,0.042514075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992692,0.00003277893,0.00006139717,0.00019969826,0.00025887543,0.0001780819],"domain_scores_gemma":[0.99945754,0.00005660893,0.000009659427,0.00029848007,0.000085632135,0.0000920791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015308044,0.000052429816,0.000049281563,0.000055817334,0.0000470998,0.00006393046,0.0003236016,0.000015508927,0.00017140253],"category_scores_gemma":[0.000012097181,0.00002365217,0.000012073294,0.00020184433,0.000025408328,0.00021377754,0.000081821905,0.00004412583,0.00043828145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000541357,0.0002944055,0.00151492,0.000008653454,0.000024970048,0.000033433622,0.0004329008,0.0347502,0.0016894285,0.54987925,0.019719731,0.391598],"study_design_scores_gemma":[0.005142124,0.0041670655,0.0025175249,0.00021676558,0.0000024095596,0.000033689616,0.000033893073,0.8699702,0.050171703,0.0025129833,0.064428456,0.0008032007],"about_ca_topic_score_codex":0.0000080328355,"about_ca_topic_score_gemma":0.000006540223,"teacher_disagreement_score":0.83522,"about_ca_system_score_codex":0.000015501279,"about_ca_system_score_gemma":0.000045041288,"threshold_uncertainty_score":0.56333673},"labels":[],"label_agreement":null},{"id":"W2479012228","doi":"10.1007/978-3-540-31595-7_8","title":"Pursuit Strategies for Autonomous Agents","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mobile robot; Task (project management); Autonomous agent; Control (management); Artificial intelligence; Robot; Group (periodic table); Computer science; Subject (documents); Engineering; Distributed computing; Control engineering; Human–computer interaction; Systems engineering","score_opus":0.02463485298370909,"score_gpt":0.2696630236527044,"score_spread":0.2450281706689953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479012228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003295368,0.00021831635,0.89950204,0.0030098197,0.0002198426,0.0005862839,0.000019184214,0.00006425009,0.096377],"genre_scores_gemma":[0.83995736,0.0010468208,0.12632698,0.027672548,0.0003199087,0.0002721854,0.00011334176,0.00003355132,0.0042573093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986772,0.000011803668,0.00040921557,0.00024164673,0.00039915752,0.00026097547],"domain_scores_gemma":[0.99917084,0.00021504954,0.00022775451,0.00016750442,0.00015028198,0.00006857085],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000589649,0.00019759315,0.00023836581,0.00038825712,0.0002423447,0.0013069945,0.00065371644,0.00018456533,0.000045809582],"category_scores_gemma":[0.000098279095,0.00015515213,0.00005868667,0.00011971341,0.00020471866,0.0036940002,0.00007758274,0.00017737648,0.00001769396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005718132,0.0000035211888,0.000005268241,0.00003990247,0.00000753516,4.4416004e-7,0.0008806106,0.06934297,0.0000019375598,0.8227507,0.000053375108,0.106908],"study_design_scores_gemma":[0.0011440224,0.0002464867,0.00004579442,0.000085977495,0.000005516323,0.0000057904126,0.000012669695,0.4088212,0.000007925136,0.52436286,0.064967185,0.00029458094],"about_ca_topic_score_codex":0.000021017779,"about_ca_topic_score_gemma":0.000032295797,"teacher_disagreement_score":0.8399541,"about_ca_system_score_codex":0.00005705958,"about_ca_system_score_gemma":0.0005512228,"threshold_uncertainty_score":0.99972975},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Markov chain; Computer science; Machine learning","score_opus":0.024007311892284295,"score_gpt":0.24729614016398255,"score_spread":0.22328882827169824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488817718","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6429269e-8,0.0006735841,0.47888446,0.00021767752,0.00007607599,0.000101661164,3.6357508e-7,0.00008204421,0.5199641],"genre_scores_gemma":[0.000038018257,0.0036813202,0.1021987,0.00039736956,0.000037115507,0.000011557239,0.0000045936636,0.000014320103,0.89361703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871594,0.00003693458,0.0002543576,0.0004043964,0.00033162348,0.00025676106],"domain_scores_gemma":[0.99932694,0.00006186052,0.00007063691,0.0004163585,0.000049011443,0.00007520126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020346775,0.00016693491,0.00020700689,0.0002662605,0.000042649648,0.00015754231,0.0008802459,0.00013529882,0.00024755683],"category_scores_gemma":[0.000007639888,0.00014935578,0.000052418927,0.00014871485,0.000013274438,0.001264968,0.00025714564,0.00033348578,0.00012787452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011421672,0.000033181444,0.0000024281608,0.00006406405,0.000004288369,0.000027396472,0.00039796173,0.054816812,4.730087e-7,0.56985563,0.041921046,0.3328756],"study_design_scores_gemma":[0.00010936844,0.000012677021,2.5757643e-7,0.00007303773,4.987847e-7,0.0000022869006,0.0000014617217,0.7426635,4.880086e-7,0.106124364,0.15085028,0.00016175477],"about_ca_topic_score_codex":0.0000051493844,"about_ca_topic_score_gemma":0.0000411586,"teacher_disagreement_score":0.6878467,"about_ca_system_score_codex":0.000097937984,"about_ca_system_score_gemma":0.00012440962,"threshold_uncertainty_score":0.6090552},"labels":[],"label_agreement":null},{"id":"W2489221610","doi":"10.1109/acc.2016.7526682","title":"Stochastic patrolling in adversarial settings","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Patrolling; Markov chain; Computer science; Adversarial system; Mathematical optimization; Markov process; Path (computing); Mathematics; Artificial intelligence; Computer network; Machine learning; Statistics","score_opus":0.010353518433518975,"score_gpt":0.2301791471882417,"score_spread":0.21982562875472272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489221610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009125919,0.0000036898189,0.99206215,0.003987935,0.000118277174,0.000077572666,2.5434645e-7,0.0000873485,0.0027501825],"genre_scores_gemma":[0.93179756,0.0000027319013,0.06659524,0.00042626905,0.000032912587,0.0000064627925,1.9144849e-7,0.0000033079698,0.001135345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.000027564045,0.00010733368,0.00015902029,0.00012480984,0.00016733355],"domain_scores_gemma":[0.99967164,0.0000893527,0.000018337521,0.0001459416,0.000027789833,0.000046950867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285961,0.000042327432,0.000052952753,0.00007676427,0.0000255479,0.00004026004,0.0002651154,0.000021678943,0.000092179056],"category_scores_gemma":[0.00006834074,0.000026160658,0.00001637693,0.00016623568,0.000012224661,0.00032307647,0.00009180442,0.000034436063,0.00011899272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004091622,0.00017739472,0.0019899248,0.000017071925,0.000018475504,0.00002892351,0.0027457252,0.059984725,0.006930826,0.5856495,0.0046733725,0.33774313],"study_design_scores_gemma":[0.0024485253,0.00007940127,0.0004120174,0.000059798,8.732384e-7,0.0000035576768,0.000027040625,0.9837605,0.00043468404,0.010551629,0.002002219,0.00021975201],"about_ca_topic_score_codex":0.000010587081,"about_ca_topic_score_gemma":0.0000075210223,"teacher_disagreement_score":0.93088496,"about_ca_system_score_codex":0.0000224818,"about_ca_system_score_gemma":0.00003572887,"threshold_uncertainty_score":0.15294504},"labels":[],"label_agreement":null},{"id":"W2491829515","doi":"10.1016/j.tcs.2015.09.011","title":"The Beachcombers' Problem: Walking and searching with mobile robots","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Schedule; Mobile robot; Set (abstract data type); Computer science; Algorithm; Line segment; Real-time computing; Artificial intelligence","score_opus":0.012996402439254037,"score_gpt":0.26030036725639494,"score_spread":0.2473039648171409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491829515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056109163,0.00007250896,0.9860474,0.0020690935,0.00012747436,0.00032104828,1.747239e-7,0.0001584771,0.005592926],"genre_scores_gemma":[0.63437474,0.00000953459,0.36529648,0.00023348791,0.000032629145,0.000017035962,2.0979597e-7,0.0000057662974,0.00003012518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976159,0.00019107322,0.00017520493,0.00051602704,0.0009016862,0.0006001367],"domain_scores_gemma":[0.9982991,0.00032317132,0.000045666995,0.00056886167,0.00028500587,0.00047816068],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003435091,0.00013484035,0.00012124213,0.000095233176,0.0009111874,0.0015552572,0.0017563899,0.000025418014,0.0000029591292],"category_scores_gemma":[0.00006165352,0.00007597502,0.000017621825,0.00089469313,0.0028904558,0.0008456242,0.0013196799,0.0002481622,0.000016063575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000662908,0.000018959408,0.000077681456,0.0000033189676,0.0000026426223,0.000005110553,0.0020539232,0.0076995273,0.0000193013,0.9253128,0.000046815818,0.06475327],"study_design_scores_gemma":[0.00029696856,0.00042251352,0.00010897233,0.000026551239,0.0000016576854,0.00007030575,0.00005449115,0.90813726,0.00016278753,0.090061605,0.0005001109,0.00015674904],"about_ca_topic_score_codex":0.0000050109993,"about_ca_topic_score_gemma":0.000001773061,"teacher_disagreement_score":0.9004378,"about_ca_system_score_codex":0.000045248114,"about_ca_system_score_gemma":0.00023364958,"threshold_uncertainty_score":0.9998231},"labels":[],"label_agreement":null},{"id":"W2497949436","doi":"10.1016/j.ejor.2016.07.057","title":"A new lift-and-project operator","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Operator (biology); Lift (data mining); Mathematics; Set (abstract data type); Hull; Binary number; Combinatorics; Integer (computer science); Computer science; Discrete mathematics; Data mining; Arithmetic; Engineering","score_opus":0.1280800995088859,"score_gpt":0.38667762288483915,"score_spread":0.2585975233759532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497949436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052558514,0.00034295785,0.9459765,0.03125538,0.00019607843,0.00017917562,0.0000022953848,0.000021679765,0.016770106],"genre_scores_gemma":[0.62336457,0.0009925357,0.3509143,0.00086729915,0.0010962893,0.0000027898525,9.008288e-7,0.000037149217,0.02272417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969893,0.0012211717,0.00034731682,0.00018311139,0.001007879,0.00025122406],"domain_scores_gemma":[0.9980643,0.00028692937,0.000056863068,0.0001990332,0.0011095179,0.00028339977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052453196,0.0000745308,0.000105196275,0.00035830578,0.000211577,0.0005255338,0.00085018843,0.000014076289,0.00023323848],"category_scores_gemma":[0.00088245404,0.000043111577,0.000039870236,0.00040654163,0.00007553708,0.0010064063,0.00032749874,0.00025908323,0.00021722727],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113121525,0.00013064862,0.0009867593,0.000013243275,0.000080570404,0.000512779,0.0022472122,0.0003299227,0.030452177,0.30231223,0.27673885,0.3860825],"study_design_scores_gemma":[0.0070278747,0.003707689,0.014075023,0.0005115901,0.000005988474,0.001175718,0.00017902146,0.012806189,0.0042628804,0.0031738607,0.9524819,0.0005922257],"about_ca_topic_score_codex":0.000003945197,"about_ca_topic_score_gemma":8.017321e-7,"teacher_disagreement_score":0.6757431,"about_ca_system_score_codex":0.00004543855,"about_ca_system_score_gemma":0.00097427925,"threshold_uncertainty_score":0.5067734},"labels":[],"label_agreement":null},{"id":"W25030497","doi":"10.1007/978-3-642-25873-2_29","title":"Asynchronous Rendezvous of Anonymous Agents in Arbitrary Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Graph; Theoretical computer science; Algorithm; Computer network","score_opus":0.03403932489494358,"score_gpt":0.2595617817778395,"score_spread":0.22552245688289593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25030497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013364406,0.00038940657,0.98053944,0.0001668619,0.0008108648,0.0004441171,0.000004751476,0.000094264724,0.017416626],"genre_scores_gemma":[0.31609395,0.0003629194,0.68158007,0.0013591113,0.000108426895,0.00001599458,0.000009285505,0.000054745466,0.0004154749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635535,0.00006247548,0.000717906,0.0012606053,0.00092983997,0.00067383394],"domain_scores_gemma":[0.9977767,0.00019364413,0.00033471323,0.0012978992,0.00021380157,0.00018324773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085960084,0.00043408072,0.0005773923,0.001629963,0.00010102182,0.00017126957,0.0034289812,0.00032359542,0.00008043712],"category_scores_gemma":[0.00005545985,0.00041342966,0.00013339247,0.0010318263,0.00070452114,0.0005888854,0.001141594,0.00080739765,0.000028062555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019644931,0.00025357882,0.0007794723,0.00016288385,0.000026730673,0.00043508896,0.004733409,0.075424895,0.00009741142,0.15963829,0.00006358759,0.75836504],"study_design_scores_gemma":[0.0006659014,0.00047715218,0.00096574525,0.0006249965,0.0000058643545,0.000081449725,2.5071583e-7,0.41543928,0.0009947201,0.57932234,0.0005248029,0.00089749816],"about_ca_topic_score_codex":0.000082463834,"about_ca_topic_score_gemma":0.00012143238,"teacher_disagreement_score":0.7574675,"about_ca_system_score_codex":0.00018232122,"about_ca_system_score_gemma":0.00072574074,"threshold_uncertainty_score":0.99983174},"labels":[],"label_agreement":null},{"id":"W2513559281","doi":"10.1007/s10878-016-0079-8","title":"On the online multi-agent O–D k-Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Computer science; Focus (optics); Theory of computation; Graph; A priori and a posteriori; Enhanced Data Rates for GSM Evolution; Node (physics); Competitive analysis; Combinatorics; Theoretical computer science; Mathematics; Upper and lower bounds; Artificial intelligence; Algorithm","score_opus":0.026356182436590086,"score_gpt":0.2547440991462963,"score_spread":0.22838791670970623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513559281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047494072,0.000020362484,0.9793867,0.016951714,0.0020266229,0.0002498068,0.0000037419152,0.000023720031,0.0008624191],"genre_scores_gemma":[0.5095323,0.00031638745,0.48676494,0.0018773909,0.0005367285,0.00001075854,0.000004376613,0.00003950434,0.0009176325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984496,0.00021028437,0.0004589932,0.00014440595,0.0004883524,0.00024832255],"domain_scores_gemma":[0.99832076,0.00017107363,0.00033294887,0.00026789823,0.000654121,0.00025321226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865075,0.00012395148,0.00016041861,0.00026124285,0.00016844105,0.00016453228,0.00077083043,0.00007956372,0.00014847987],"category_scores_gemma":[0.00032983813,0.0000645117,0.00009213024,0.00038934549,0.00003875685,0.0005713632,0.000044818975,0.00018028285,0.000023613562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051088282,0.0005281401,0.00008963898,0.0000062401878,0.000051474013,0.000021309954,0.000508977,0.3671167,0.00019861452,0.61081266,0.008053963,0.012561187],"study_design_scores_gemma":[0.009646433,0.0018922177,0.00057490467,0.0004032884,0.00003258165,0.000074726144,0.000060625825,0.90773034,0.0008676885,0.051242534,0.026849346,0.0006253157],"about_ca_topic_score_codex":0.000055310156,"about_ca_topic_score_gemma":0.000029298155,"teacher_disagreement_score":0.55957013,"about_ca_system_score_codex":0.00019399603,"about_ca_system_score_gemma":0.00042045937,"threshold_uncertainty_score":0.2630711},"labels":[],"label_agreement":null},{"id":"W2517199428","doi":"10.1145/2970398.2970430","title":"Total Recall","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mars Exploration Program; Recall; Cache; Information retrieval; Martian; Latency (audio); World Wide Web; Computer network; Astrobiology; Telecommunications","score_opus":0.01610766868185716,"score_gpt":0.2363649852544086,"score_spread":0.22025731657255143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517199428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028776578,0.0000026060732,0.9133018,0.0073831263,0.000068661146,0.000026131655,1.0147165e-7,0.00012359547,0.078806214],"genre_scores_gemma":[0.49091488,0.00002144639,0.36719462,0.0012946931,0.000042444968,0.000007316915,1.9024601e-7,0.0000045132642,0.14051992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968076,0.000013298369,0.000044819804,0.0000932852,0.00007848729,0.000089351626],"domain_scores_gemma":[0.9997359,0.000025046073,0.0000064080727,0.00015953572,0.000026352323,0.000046780795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072645045,0.000022419605,0.000022723041,0.000020179788,0.00001970764,0.000034089673,0.00019077444,0.000011226469,0.00036952092],"category_scores_gemma":[0.000016392192,0.000011582395,0.000011637187,0.00007368302,0.000009499826,0.00023876448,0.000080332284,0.000011582688,0.0005940901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.502753e-7,0.000017162063,0.0001765443,7.7621894e-7,0.0000021224034,0.000001965587,0.000058980506,0.000025129008,0.001962014,0.73605585,0.012907435,0.24879138],"study_design_scores_gemma":[0.0038203665,0.0006228176,0.010227068,0.00007711998,0.0000024097296,0.00009946799,0.000023131835,0.41002887,0.03299617,0.093497984,0.4474455,0.0011591002],"about_ca_topic_score_codex":0.0000020615475,"about_ca_topic_score_gemma":8.554902e-7,"teacher_disagreement_score":0.64255786,"about_ca_system_score_codex":0.000006442568,"about_ca_system_score_gemma":0.000014210331,"threshold_uncertainty_score":0.76360244},"labels":[],"label_agreement":null},{"id":"W2519829944","doi":"10.1002/net.20233","title":"Approximation bounds for Black Hole Search problems","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Computer science; Black hole (networking); Black box; Set (abstract data type); Time complexity; Process (computing); Task (project management); Approximation algorithm; Theoretical computer science; Algorithm; Computer network; Artificial intelligence; Physics","score_opus":0.04569803779833919,"score_gpt":0.2672764333897557,"score_spread":0.2215783955914165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519829944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011239807,0.00007986391,0.99258286,0.0007538281,0.00015400306,0.00057607354,8.106447e-7,0.00018093402,0.0045476635],"genre_scores_gemma":[0.78662646,0.0002594457,0.20634697,0.00073162286,0.0003625832,0.00017939621,0.000052226686,0.000027882137,0.0054134238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988818,0.000052564832,0.00017739808,0.0002816035,0.00024179605,0.00036480316],"domain_scores_gemma":[0.99928886,0.000068643996,0.000041484825,0.000327701,0.00017116884,0.000102170474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004001357,0.000091781076,0.00010608064,0.00006862138,0.0002807684,0.00014742186,0.0004563572,0.00008270552,0.000016334036],"category_scores_gemma":[0.000015940024,0.0000860114,0.000052455245,0.000402575,0.00008417564,0.0004065779,0.00010659459,0.00014437207,0.000038367358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004298219,0.00005183093,0.000139866,0.000021302565,0.0000072407756,0.0000012442433,0.0009354009,0.95442,0.000019485022,0.02264177,0.012139921,0.009617659],"study_design_scores_gemma":[0.00037819985,0.00008263224,0.00013567146,0.000011459676,0.0000010071795,0.0000034509967,0.0000072385174,0.9875761,0.000043380838,0.00090696197,0.0107475165,0.000106343454],"about_ca_topic_score_codex":0.0000058047935,"about_ca_topic_score_gemma":0.0000028433478,"teacher_disagreement_score":0.78623587,"about_ca_system_score_codex":0.00003175992,"about_ca_system_score_gemma":0.000069480484,"threshold_uncertainty_score":0.3507443},"labels":[],"label_agreement":null},{"id":"W2521963297","doi":"","title":"Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem","year":2000,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Centrum Wiskunde and Informatica; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Reservation; Competitive analysis; Upper and lower bounds; Matching (statistics); Combinatorics; Line (geometry); Asymptotically optimal algorithm; Computer science; Mathematics; Discrete mathematics; Mathematical optimization; Computer network; Statistics","score_opus":0.11407420941787147,"score_gpt":0.36277077989047674,"score_spread":0.24869657047260527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521963297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015235959,0.000049679,0.82495093,0.12504117,0.00045916383,0.00740223,0.00006854474,0.00009275318,0.026699577],"genre_scores_gemma":[0.91282666,0.00032983732,0.074391805,0.009309046,0.00054625596,0.0018859346,0.00004644488,0.00002884057,0.00063519616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951217,0.00023466266,0.000611749,0.00036608538,0.002911616,0.0007541554],"domain_scores_gemma":[0.99123037,0.0068221036,0.00019190466,0.0005931981,0.0010639715,0.00009842455],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.017650211,0.00022845603,0.00019384793,0.00025839795,0.0038781925,0.0028523807,0.0037137836,0.000067850924,0.000022222132],"category_scores_gemma":[0.0010492831,0.000099407924,0.00008705799,0.0015811382,0.0014329249,0.0014842274,0.00033854536,0.00057204044,0.00002218692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003248296,0.00010470491,0.000009735351,0.00005079814,0.000017620283,3.214684e-7,0.008604621,0.030615691,0.0000071897016,0.93986356,0.0028186927,0.017874602],"study_design_scores_gemma":[0.00043358808,0.00030699832,0.00011953804,0.00014588592,0.0000034449317,0.000011877294,0.00059788366,0.85549146,0.00005001452,0.12252714,0.020187175,0.00012500104],"about_ca_topic_score_codex":0.00001669343,"about_ca_topic_score_gemma":0.000042118267,"teacher_disagreement_score":0.8975907,"about_ca_system_score_codex":0.00022436258,"about_ca_system_score_gemma":0.00068351015,"threshold_uncertainty_score":0.9981828},"labels":[],"label_agreement":null},{"id":"W2526250255","doi":"10.1007/978-3-540-28629-5_34","title":"Graph Exploration by a Finite Automaton","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Planar graph; Graph; Combinatorics; Discrete mathematics; Butterfly graph; Book embedding; Mathematics; Computer science; Voltage graph; Topology (electrical circuits); Line graph; 1-planar graph","score_opus":0.022123243478462947,"score_gpt":0.25036453029300454,"score_spread":0.2282412868145416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526250255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035923765,0.0002479451,0.99211633,0.0021996978,0.0008691955,0.00042284504,0.000006034553,0.0003484507,0.0037859047],"genre_scores_gemma":[0.04777187,0.00037100568,0.9457841,0.0043455334,0.0002772649,0.000040252813,0.000051017596,0.000070602095,0.0012883904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650866,0.00003712138,0.00047450676,0.0012944608,0.0010952918,0.0005899432],"domain_scores_gemma":[0.998007,0.00022837543,0.00023011245,0.0010672993,0.00025890808,0.00020832532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006617435,0.00042800567,0.00036249284,0.00088856457,0.0002807385,0.00085831404,0.0025062643,0.00028790307,0.000051853287],"category_scores_gemma":[0.00007268404,0.00040326564,0.00010731065,0.00091105734,0.0004598254,0.0014748822,0.00075624464,0.0006420053,0.000102476995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032195915,0.000051542873,0.000007999729,0.000041799623,0.000009487085,0.000045090077,0.0014448812,0.55144954,0.00011076817,0.10360881,0.00021142751,0.34301543],"study_design_scores_gemma":[0.0002731462,0.00013163559,0.0000037829168,0.00021822006,0.0000022170234,0.00001121406,8.22421e-8,0.63560176,0.00068413035,0.3607855,0.001840677,0.0004476596],"about_ca_topic_score_codex":0.00001888438,"about_ca_topic_score_gemma":0.000022736373,"teacher_disagreement_score":0.34256777,"about_ca_system_score_codex":0.00028026575,"about_ca_system_score_gemma":0.0006774475,"threshold_uncertainty_score":0.9998419},"labels":[],"label_agreement":null},{"id":"W2530140542","doi":"","title":"Dynamic Storage Provisioning with SLO Guarantees","year":2010,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Provisioning; Computer science; Computer network","score_opus":0.0056564532632080895,"score_gpt":0.20024668093763975,"score_spread":0.19459022767443165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530140542","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546377,0.0000542285,0.04178104,0.0006904073,0.00035664486,0.0005113428,0.00001109185,0.00023974158,0.0017178218],"genre_scores_gemma":[0.107489884,0.00009839718,0.19365436,0.000021198608,0.000012984674,0.0000010773322,0.0003818252,0.000039716826,0.69830054],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872094,0.00005333359,0.0000970626,0.00045202984,0.00041445234,0.00026216285],"domain_scores_gemma":[0.99890804,0.000023188477,0.0002288199,0.00050417957,0.0002375907,0.00009820673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015488276,0.00020331179,0.0002750385,0.00031833767,0.00028520226,0.00008925369,0.0010572737,0.00023373138,0.00009045362],"category_scores_gemma":[0.0000072191197,0.00019860567,0.00008375559,0.0003174663,0.00008058294,0.0005854022,0.00011534362,0.0004343283,0.00003869352],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054728356,0.0005758891,0.0006056328,0.0014136181,0.000386209,0.0005262599,0.8775001,0.0071876487,0.044375192,0.014251306,0.0013664215,0.051264398],"study_design_scores_gemma":[0.0053559677,0.0022485808,0.018562872,0.002080866,0.00023700052,0.00004895212,0.26553416,0.6948604,0.0028629676,0.0011252369,0.004126694,0.0029563352],"about_ca_topic_score_codex":0.0045681037,"about_ca_topic_score_gemma":0.06490242,"teacher_disagreement_score":0.8471478,"about_ca_system_score_codex":0.00004658565,"about_ca_system_score_gemma":0.00015282491,"threshold_uncertainty_score":0.95216066},"labels":[],"label_agreement":null},{"id":"W2535803352","doi":"10.1007/s00453-016-0233-9","title":"When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Patrolling; Theory of computation; Eulerian path; Enhanced Data Rates for GSM Evolution; Mobile robot; Domain (mathematical analysis); Robot; Computer science; Graph; Line segment; Combinatorics; Mathematics; Line (geometry); Point (geometry); Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.03223269614456528,"score_gpt":0.2869592527689605,"score_spread":0.25472655662439525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535803352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010700418,0.0001051635,0.9870412,0.0005773811,0.0006387708,0.00028574903,0.0000072731077,0.0002904379,0.00035363736],"genre_scores_gemma":[0.36771837,0.00009638925,0.6304913,0.0001594733,0.0003096865,0.00008259266,0.0000028010202,0.00003481042,0.00110457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835706,0.000108496155,0.00025949482,0.00044025775,0.00036635876,0.00046834786],"domain_scores_gemma":[0.99889725,0.00011918367,0.0000895116,0.00054626935,0.00015020651,0.00019756997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030249485,0.00016447627,0.00017918767,0.00016360519,0.0002212289,0.00016317832,0.00076025195,0.00007788366,0.00006721525],"category_scores_gemma":[0.00003070249,0.00012105967,0.00008158886,0.0003266995,0.000053730437,0.0007409621,0.0003166889,0.00013664232,0.00010992039],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011755257,0.00021526431,0.0046339575,0.000022882425,0.00012160491,0.00005438119,0.0017987327,0.008165415,0.018949317,0.002794816,0.0010938883,0.962138],"study_design_scores_gemma":[0.0042582103,0.0007091189,0.0021940104,0.00040127675,0.000045339348,0.000118342665,0.0002540838,0.92807984,0.027754791,0.01704941,0.017348386,0.0017872102],"about_ca_topic_score_codex":0.00006503605,"about_ca_topic_score_gemma":0.0000013307141,"teacher_disagreement_score":0.96035075,"about_ca_system_score_codex":0.000089608424,"about_ca_system_score_gemma":0.000069329304,"threshold_uncertainty_score":0.493667},"labels":[],"label_agreement":null},{"id":"W2550472248","doi":"10.1016/j.tcs.2016.11.019","title":"Evacuating two robots from multiple unknown exits in a circle","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Parameterized complexity; Mobile robot; Simple (philosophy); Computer science; Control (management); Mathematics; Domain (mathematical analysis); Algorithm; Topology (electrical circuits); Artificial intelligence; Combinatorics; Mathematical analysis","score_opus":0.017454379383506465,"score_gpt":0.27701269766194486,"score_spread":0.2595583182784384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550472248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057509817,0.000013291661,0.93796057,0.0022897704,0.0003193481,0.0001818698,0.0000015756943,0.00017925822,0.0015445265],"genre_scores_gemma":[0.76430506,0.0000036586641,0.23522004,0.0003822855,0.00006156794,0.000008575442,3.7343293e-7,0.0000060803613,0.000012362942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972263,0.00019986105,0.00032812377,0.0008447822,0.00071652053,0.0006843979],"domain_scores_gemma":[0.9979219,0.0007981485,0.00006045979,0.0007591737,0.00015577239,0.00030457834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015212899,0.00015036346,0.00019054956,0.00022240402,0.00022710241,0.00036482618,0.0023421126,0.00004082705,0.000082467224],"category_scores_gemma":[0.00037286285,0.000108002896,0.000042982512,0.0012736513,0.0012232013,0.0011053467,0.0012482826,0.00014562922,0.00020028201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000487125,0.000058757898,0.00079964555,0.0000016677426,0.0000015634207,0.000011257508,0.00046487784,0.0021289892,0.004124689,0.7692006,0.000011381825,0.22319168],"study_design_scores_gemma":[0.0008513075,0.0000715025,0.0041935425,0.00008673153,7.184066e-7,0.0000044378244,0.0000022715037,0.86237663,0.0051476136,0.12703365,0.00003548192,0.00019610104],"about_ca_topic_score_codex":0.000026145737,"about_ca_topic_score_gemma":0.000012985268,"teacher_disagreement_score":0.8602477,"about_ca_system_score_codex":0.0000956378,"about_ca_system_score_gemma":0.00015570545,"threshold_uncertainty_score":0.4506936},"labels":[],"label_agreement":null},{"id":"W2558107975","doi":"10.32920/24231049","title":"Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Treasure; Robot; Computer science; Wireless; Face (sociological concept); Drone; Protocol (science); Human–computer interaction; Artificial intelligence; Operating system; Geography; Medicine","score_opus":0.08521711455668612,"score_gpt":0.30682898132328595,"score_spread":0.22161186676659983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558107975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011586882,0.00005853569,0.967211,0.017644923,0.00004656611,0.00094094756,0.000009353758,0.0003982977,0.0021034908],"genre_scores_gemma":[0.83075744,0.0014517122,0.16006103,0.00059045566,0.000012944218,0.0001698241,0.000043446453,0.000043866872,0.006869269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980142,0.0002182778,0.0002197062,0.0007420943,0.00049034966,0.00031535825],"domain_scores_gemma":[0.99803776,0.0001562591,0.00005553749,0.0013331585,0.00015144897,0.00026585604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056396157,0.00024100812,0.00027356198,0.00022455053,0.00020333713,0.0006642526,0.0011945474,0.0001420521,0.0000057087786],"category_scores_gemma":[0.00001346856,0.00019190877,0.000027387825,0.0003277978,0.0000973641,0.00028322072,0.003939505,0.00058844814,0.00004239459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013617598,0.000038039507,0.00007197703,0.00006690695,0.000026289219,0.0000023120656,0.003806521,0.93389434,0.000007437813,0.05246173,0.00033211938,0.009278732],"study_design_scores_gemma":[0.00025475243,0.000100019584,0.0004898942,0.00023139233,0.000003762735,0.0000026025548,0.00015450659,0.9931055,0.000059049256,0.005290749,0.00004922163,0.0002585952],"about_ca_topic_score_codex":0.0004655591,"about_ca_topic_score_gemma":0.00019151634,"teacher_disagreement_score":0.8191706,"about_ca_system_score_codex":0.00005094767,"about_ca_system_score_gemma":0.00012704346,"threshold_uncertainty_score":0.78258127},"labels":[],"label_agreement":null},{"id":"W2560800565","doi":"10.14778/3137628.3137635","title":"Revenue maximization in incentivized social advertising","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Incentive; Revenue; Online advertising; Viral marketing; Monetization; Budget constraint; Knapsack problem; Microeconomics; Computer science; Social graph; Bidding; Advertising; Maximization; Social media; Business; Economics; The Internet; Mathematical optimization; Mathematics","score_opus":0.019394091572590408,"score_gpt":0.2669975460336904,"score_spread":0.2476034544611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560800565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66265184,0.0002641554,0.13751875,0.07603337,0.0027123932,0.004773823,0.000022146158,0.0003499083,0.115673624],"genre_scores_gemma":[0.9914254,0.000034400266,0.007953942,0.0000845894,0.000027520251,0.000018024926,2.5170812e-7,0.000005037895,0.00045086778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991935,0.000009403002,0.00018771373,0.00017101468,0.000270102,0.00016830255],"domain_scores_gemma":[0.9994309,0.000007977458,0.0002714816,0.00015002092,0.000115426265,0.000024201647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036659016,0.000068438465,0.000108231274,0.000058178095,0.00034055708,0.00021542788,0.0011166184,0.00003170611,0.000004966547],"category_scores_gemma":[0.000107616914,0.000053721575,0.000045623485,0.00013964553,0.000059620994,0.00062085007,0.0005785368,0.00009026477,0.0000028866932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013078656,0.00092045264,0.1824477,0.0005495064,0.00008984622,0.000004032888,0.022343744,0.00080987596,0.122035705,0.47190395,0.010810833,0.18795358],"study_design_scores_gemma":[0.009131769,0.00018160287,0.37994733,0.0011369439,0.000034188273,0.0000149982625,0.0003599478,0.2585043,0.22514269,0.114919946,0.009638741,0.000987561],"about_ca_topic_score_codex":0.000050769395,"about_ca_topic_score_gemma":0.000007684617,"teacher_disagreement_score":0.356984,"about_ca_system_score_codex":0.000065230706,"about_ca_system_score_gemma":0.000026839962,"threshold_uncertainty_score":0.2619324},"labels":[],"label_agreement":null},{"id":"W2561815760","doi":"10.1109/ssrr.2016.7784323","title":"Multi-target search strategies","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Search and rescue; Beam search; Schedule; Context (archaeology); Obstacle; Task (project management); Search algorithm; Machine learning; Artificial intelligence; Search problem; Data mining; Engineering; Algorithm; Robot","score_opus":0.04783042107704689,"score_gpt":0.30534309053157277,"score_spread":0.2575126694545259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561815760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024996555,0.000010911417,0.9757116,0.0034830915,0.000058254573,0.00006742634,5.164316e-7,0.00019904962,0.020219227],"genre_scores_gemma":[0.31118628,0.000020306312,0.67457247,0.00021833683,0.000013693853,0.000005154595,2.8182455e-7,0.0000034802333,0.013980003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.000042971402,0.00007794253,0.00017076723,0.00016434016,0.00019636014],"domain_scores_gemma":[0.9995402,0.00004313502,0.000008708571,0.00025101448,0.00007795971,0.00007896268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019024775,0.0000475022,0.000045478915,0.00005250472,0.000053372136,0.00016385195,0.00044779456,0.000021443306,0.00045895018],"category_scores_gemma":[0.0000128652855,0.000025933927,0.00001900212,0.00014550037,0.00003239146,0.0007379375,0.00013957324,0.00003250709,0.00057907664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032545515,0.00014462585,0.0015644947,0.000011391461,0.000015674903,0.000012094664,0.0009105176,0.0019964874,0.021082016,0.8951867,0.00541909,0.073653616],"study_design_scores_gemma":[0.0018906514,0.00018719313,0.004703979,0.000029012745,8.153726e-7,0.000010093018,0.00027123475,0.9202587,0.026041018,0.0132216755,0.032925364,0.0004602428],"about_ca_topic_score_codex":0.0000126516225,"about_ca_topic_score_gemma":0.000004295634,"teacher_disagreement_score":0.91826224,"about_ca_system_score_codex":0.000011572867,"about_ca_system_score_gemma":0.00008777224,"threshold_uncertainty_score":0.7443052},"labels":[],"label_agreement":null},{"id":"W2563013149","doi":"10.1016/j.jcss.2016.11.008","title":"Collision-free network exploration","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Node (physics); Upper and lower bounds; Network topology; Tree (set theory); Topology (electrical circuits); Collision; Mobile agent; Distributed computing; Computer network; Combinatorics; Mathematics; Computer security; Physics","score_opus":0.03322928801255541,"score_gpt":0.25679849622801937,"score_spread":0.22356920821546394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563013149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028615214,0.00021135289,0.99172586,0.0032510145,0.0009953337,0.00006117778,3.05527e-7,0.000023886969,0.000869567],"genre_scores_gemma":[0.71928483,0.00013113848,0.27974215,0.0001711753,0.0005628288,0.0000013837919,3.4368075e-8,0.0000027978322,0.00010361643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870133,0.00014337385,0.00036253114,0.00014233698,0.0004857777,0.00016464721],"domain_scores_gemma":[0.9990551,0.00018839599,0.00025026925,0.00016375503,0.00022681417,0.00011568787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017795789,0.00006620051,0.00015615547,0.00012664055,0.00022260702,0.00036631824,0.00086336007,0.000024590385,0.0000021313328],"category_scores_gemma":[0.000021065413,0.000033700282,0.000041196534,0.0003753663,0.00008475893,0.0017137894,0.00019187825,0.000039753275,0.0000049595583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021583846,0.00006516669,0.0034227483,0.00006430718,0.000040942024,0.000058313824,0.0017905044,0.05120998,0.00019933756,0.6956526,0.052984655,0.19448988],"study_design_scores_gemma":[0.0024120274,0.0021301957,0.0028383443,0.0014642936,0.000010279759,0.0010190323,0.00030096807,0.9470037,0.00023930051,0.027904307,0.014264445,0.00041310964],"about_ca_topic_score_codex":0.0000010029679,"about_ca_topic_score_gemma":7.975273e-7,"teacher_disagreement_score":0.89579374,"about_ca_system_score_codex":0.000020983056,"about_ca_system_score_gemma":0.000098588185,"threshold_uncertainty_score":0.35324153},"labels":[],"label_agreement":null},{"id":"W2564284893","doi":"10.1109/iros.2016.7759404","title":"Multi-target rendezvous search","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Computer science; Rendezvous; Beam search; Bidirectional search; Search algorithm; Beam stack search; Maxima and minima; Maxima; Search engine; Search problem; Best-first search; Iterative deepening depth-first search; Realization (probability); Probability distribution; Guided Local Search; Search theory; Local search (optimization); Artificial intelligence; Algorithm; Mathematics; Engineering; Statistics; Information retrieval","score_opus":0.04664574852945272,"score_gpt":0.29254187167391354,"score_spread":0.24589612314446083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564284893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015054453,0.000013477566,0.98049563,0.0054248837,0.00008343574,0.00007625954,7.076405e-7,0.0002282264,0.013526834],"genre_scores_gemma":[0.1869095,0.000027718806,0.76931286,0.00050251797,0.000020227964,0.000006811887,4.091213e-7,0.0000054064435,0.04321456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.000052203177,0.00009163649,0.00021089596,0.00020260962,0.00022908016],"domain_scores_gemma":[0.9994111,0.000049953436,0.000010762298,0.0003362027,0.00008201168,0.000109945475],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024573648,0.00005176122,0.000052365278,0.00006341644,0.000059261205,0.00007142934,0.0005132363,0.000025899384,0.00051680167],"category_scores_gemma":[0.00003167402,0.000028993534,0.0000238042,0.00018040549,0.000027930013,0.00035209116,0.00019735534,0.000039065366,0.00088042946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001061553,0.0004587787,0.0064640096,0.00002085854,0.000041517236,0.00005079646,0.0017035891,0.0015094591,0.036714524,0.39646974,0.038012262,0.51854384],"study_design_scores_gemma":[0.0023309027,0.0001932835,0.003778978,0.000028496148,9.895651e-7,0.000020927682,0.00003199129,0.8676805,0.03599365,0.0038335614,0.085630216,0.00047648346],"about_ca_topic_score_codex":0.0000112167445,"about_ca_topic_score_gemma":0.000003896602,"teacher_disagreement_score":0.86617106,"about_ca_system_score_codex":0.00001927956,"about_ca_system_score_gemma":0.000049375412,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W2567810766","doi":"10.1007/978-3-662-46018-4_5","title":"Fast Rendezvous with Advice","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Advice (programming); Oracle; Node (physics); Set (abstract data type); Upper and lower bounds; Integer (computer science); Algorithm; Theoretical computer science; Mathematics","score_opus":0.025126376839355112,"score_gpt":0.25765961762593964,"score_spread":0.23253324078658452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567810766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021584844,0.00028353973,0.9600952,0.0012106027,0.0006256617,0.00033942645,0.0000034219693,0.0003240078,0.037115984],"genre_scores_gemma":[0.008624171,0.00004694602,0.984028,0.0017950207,0.0003288369,0.000012416339,0.000009180465,0.00005169962,0.0051037697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593073,0.00003820432,0.00037655156,0.0014146578,0.0015577506,0.0006821143],"domain_scores_gemma":[0.9971634,0.00017241192,0.00021997119,0.0014464512,0.0006542214,0.0003435465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090456795,0.00046175005,0.00042768996,0.0007285966,0.00020429559,0.000680538,0.003395178,0.00023683574,0.00004497042],"category_scores_gemma":[0.000055163797,0.0003658393,0.00006084869,0.00085632975,0.0006293141,0.0007816648,0.0011856857,0.0007977657,0.000110451314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011437709,0.000036893125,0.00002276153,0.00003275777,0.000013388952,0.00018130723,0.001242152,0.3445864,0.000011392592,0.03993378,0.0003905541,0.6135372],"study_design_scores_gemma":[0.000511262,0.00045305054,0.000016038673,0.0003138541,0.0000053992585,0.0001719024,2.5917186e-7,0.91577196,0.00008607808,0.06833838,0.013549409,0.0007824316],"about_ca_topic_score_codex":0.000022284938,"about_ca_topic_score_gemma":0.000112269176,"teacher_disagreement_score":0.61275476,"about_ca_system_score_codex":0.00029638593,"about_ca_system_score_gemma":0.0012349904,"threshold_uncertainty_score":0.99987936},"labels":[],"label_agreement":null},{"id":"W2567820845","doi":"10.2514/6.2017-1132","title":"Cooperative Searching Strategies for Distributed Sensor Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Wireless sensor network; Distributed computing; Computer network","score_opus":0.04810183111553763,"score_gpt":0.32928121409203864,"score_spread":0.281179382976501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567820845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024258188,0.000006739366,0.98841417,0.0024525307,0.000115853865,0.0002763296,0.000007510764,0.000114750896,0.008369528],"genre_scores_gemma":[0.8005032,0.000014660376,0.19698042,0.0002687191,0.00007504981,0.000037483853,0.000021520653,0.0000070516035,0.0020918953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929297,0.000039232662,0.00009998141,0.00020859057,0.00010942978,0.00024976823],"domain_scores_gemma":[0.999121,0.00009500187,0.00004808665,0.00046058386,0.00019198525,0.000083320985],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002690988,0.00007273847,0.00008756397,0.000022408954,0.0008660322,0.0020836354,0.0007325719,0.00003271629,0.000021891388],"category_scores_gemma":[0.00008754292,0.000056860234,0.000032510412,0.000049399412,0.0000626188,0.0009980595,0.00021201998,0.00008804889,0.0000097512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007390505,0.000027456334,0.00012695536,0.0000079188985,0.000018307535,0.0000033742313,0.00034814441,0.23476607,0.00008988299,0.7527955,0.0041782083,0.0076307743],"study_design_scores_gemma":[0.00030199206,0.000051773048,0.0003313839,0.0000060639422,8.019933e-7,0.0000012496242,0.000110856854,0.99465936,0.0000979748,0.0021011888,0.0022496087,0.00008772057],"about_ca_topic_score_codex":0.000028162258,"about_ca_topic_score_gemma":0.000027826725,"teacher_disagreement_score":0.8002606,"about_ca_system_score_codex":0.000012488418,"about_ca_system_score_gemma":0.00009068892,"threshold_uncertainty_score":0.99895227},"labels":[],"label_agreement":null},{"id":"W2568630404","doi":"10.1007/s00446-015-0253-8","title":"Time versus cost tradeoffs for deterministic rendezvous in networks","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Benchmark (surveying); Computer science; Node (physics); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Integer (computer science); Theory of computation; Set (abstract data type); Binary logarithm; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Artificial intelligence; Physics","score_opus":0.06831252283688527,"score_gpt":0.30887218951202783,"score_spread":0.24055966667514256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568630404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014500174,0.000045968674,0.99661046,0.00034372348,0.00045974227,0.00039274915,0.000021002443,0.00020744093,0.00046889458],"genre_scores_gemma":[0.9732858,0.0000017008867,0.026225597,0.00009980242,0.00010030416,0.00002001613,0.00022366497,0.000012436858,0.00003070727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985711,0.00009093153,0.0003066497,0.00034716784,0.00019501969,0.0004891448],"domain_scores_gemma":[0.9988882,0.00037264536,0.00009392722,0.00031039983,0.00013363428,0.00020117508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058247685,0.00013519109,0.00019052585,0.000079832804,0.00010731095,0.00019865355,0.0006472026,0.00007771768,0.0000025936874],"category_scores_gemma":[0.0002508216,0.00014327769,0.00005032643,0.00056691666,0.000038692324,0.00015668945,0.00014672484,0.00015794637,0.000018674235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068037065,0.00009345331,0.00017597011,0.000010084272,0.000013875481,0.000027305607,0.00043487587,0.93986285,0.000008752749,0.0052961223,0.004318262,0.049690407],"study_design_scores_gemma":[0.0020472829,0.00014717167,0.0001537919,0.00002270594,0.0000030354483,0.0000058146493,0.000034704866,0.99433833,0.0000133815865,0.00024090603,0.0028254376,0.00016745584],"about_ca_topic_score_codex":0.0000062961485,"about_ca_topic_score_gemma":0.0000037034056,"teacher_disagreement_score":0.97183573,"about_ca_system_score_codex":0.00013989108,"about_ca_system_score_gemma":0.00012203132,"threshold_uncertainty_score":0.58426946},"labels":[],"label_agreement":null},{"id":"W2572992153","doi":"","title":"WaterlooClarke: TREC 2015 Microblog Track.","year":2015,"lang":"en","type":"article","venue":"Text REtrieval Conference","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Microblogging; Social media; Track (disk drive); Computer science; World Wide Web; Information retrieval; Narrative","score_opus":0.06991052720693956,"score_gpt":0.2990576984579198,"score_spread":0.22914717125098022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572992153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020317713,0.00050537824,0.9034838,0.011245201,0.0010724852,0.0006813299,0.000014374704,0.0009908454,0.061688837],"genre_scores_gemma":[0.95369095,0.00006009225,0.030225508,0.00062387454,0.0000687896,0.0000061131896,0.000015570695,0.000016445281,0.015292638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805623,0.00017466191,0.00030425072,0.0004889179,0.0005127612,0.00046319552],"domain_scores_gemma":[0.9981612,0.000060410934,0.00008799377,0.0006570306,0.0006023486,0.00043103695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008226698,0.00019182239,0.00022387893,0.00013098706,0.00009432688,0.00045386146,0.0012447285,0.00012229338,0.00024476307],"category_scores_gemma":[0.00020471778,0.0001640426,0.000058272737,0.0005731337,0.00011105966,0.0007170181,0.00029213456,0.00027197483,0.0010490133],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063879794,0.0011865771,0.003013134,0.00017534653,0.00019337426,0.0003539272,0.029496666,0.0018603557,0.040930074,0.4714353,0.25327837,0.19743808],"study_design_scores_gemma":[0.007696406,0.0020752132,0.002312421,0.00018920425,0.000039901017,0.00029247245,0.00062103657,0.49925277,0.061577316,0.047596134,0.37568432,0.0026628077],"about_ca_topic_score_codex":0.000043882832,"about_ca_topic_score_gemma":0.000012365859,"teacher_disagreement_score":0.9333733,"about_ca_system_score_codex":0.000072266805,"about_ca_system_score_gemma":0.000523178,"threshold_uncertainty_score":0.9997288},"labels":[],"label_agreement":null},{"id":"W257746328","doi":"","title":"Subset selection of search heuristics","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Submodular set function; Mathematical optimization; Heuristic; Selection (genetic algorithm); Computer science; Greedy algorithm; Function (biology); Limit (mathematics); Monotonic function; Mathematics; Artificial intelligence","score_opus":0.02241517170922976,"score_gpt":0.25929622060505547,"score_spread":0.2368810488958257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W257746328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049620424,0.0000032397515,0.9787521,0.00074660307,0.00003790161,0.00011184066,2.3480371e-7,0.00006928332,0.015316758],"genre_scores_gemma":[0.78993946,0.000011796488,0.20631091,0.00017109506,0.0000105411045,0.0000055635805,0.0000012217278,0.000002673,0.003546755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995126,0.00003317958,0.00009365032,0.0000922701,0.00015805934,0.000110201974],"domain_scores_gemma":[0.9995602,0.000028384451,0.000014597054,0.00012603788,0.00022228615,0.000048502843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118102114,0.000030425153,0.000044602897,0.000057340014,0.000030359764,0.000057840884,0.00021967923,0.000018868284,0.0005992314],"category_scores_gemma":[0.00001685939,0.000025056363,0.000013372734,0.0002973234,0.000015876773,0.0002327325,0.00006576896,0.000046897563,0.0001994839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030931642,0.0003034647,0.019678874,0.00007697864,0.000028559582,0.0000012102669,0.0011494973,0.0152206905,0.01279555,0.7898627,0.086721376,0.074158035],"study_design_scores_gemma":[0.00009337333,0.0000596124,0.003661846,0.0000021493693,3.4066244e-7,0.0000019340307,0.000011365294,0.9863433,0.007434606,0.0015729998,0.0007717468,0.00004671265],"about_ca_topic_score_codex":0.0001030165,"about_ca_topic_score_gemma":0.000004013545,"teacher_disagreement_score":0.9711226,"about_ca_system_score_codex":0.0000077049535,"about_ca_system_score_gemma":0.000034000248,"threshold_uncertainty_score":0.65611637},"labels":[],"label_agreement":null},{"id":"W2578195970","doi":"10.1609/socs.v7i1.18399","title":"Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bidirectional search; Correctness; Heuristic; Node (physics); Incremental heuristic search; Computer science; Search algorithm; State (computer science); Function (biology); Sketch; Best-first search; Algorithm; Evaluation function; Beam search; Search problem; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.022153089281185496,"score_gpt":0.28496387440972265,"score_spread":0.26281078512853717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578195970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77994514,0.000103496866,0.05448993,0.050804928,0.04423541,0.0052232887,0.00020502473,0.0009513615,0.0640414],"genre_scores_gemma":[0.9951836,0.000025834106,0.0029618267,0.00017237902,0.0005217903,0.000069251255,0.000017533986,0.000021101823,0.0010267241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974472,0.000035636745,0.00036876733,0.00055791216,0.0012629492,0.0003275492],"domain_scores_gemma":[0.9963384,0.00023759405,0.00013334095,0.00023361866,0.0029093132,0.00014769679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350134,0.00015954985,0.00017382063,0.000120643446,0.00032524287,0.0004689043,0.0014623397,0.00010996197,0.00005883486],"category_scores_gemma":[0.00037393105,0.00013766467,0.00015576692,0.0004819791,0.00009784268,0.0006884178,0.00047708905,0.0003640478,0.000009231311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003480579,0.001090313,0.00067361974,0.00008620465,0.00010049528,6.786332e-7,0.00029915184,0.0004093774,0.22131681,0.7707138,0.00077114406,0.0041903076],"study_design_scores_gemma":[0.0059118997,0.0016321338,0.018729493,0.00019050638,0.000037346712,0.000029429744,0.00022798398,0.3028576,0.540596,0.10985875,0.019178554,0.0007502866],"about_ca_topic_score_codex":0.000047575835,"about_ca_topic_score_gemma":0.0000026789962,"teacher_disagreement_score":0.66085505,"about_ca_system_score_codex":0.00023096002,"about_ca_system_score_gemma":0.0003184361,"threshold_uncertainty_score":0.5613802},"labels":[],"label_agreement":null},{"id":"W2583569053","doi":"10.20429/tag.2017.040102","title":"An Eternal Domination Problem in Grids","year":2017,"lang":"en","type":"article","venue":"Theory and Applications of Graphs","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Combinatorics; Vertex (graph theory); Guard (computer science); Graph; Eviction; Mathematics; Sequence (biology); Discrete mathematics; Upper and lower bounds; Computer science; Political science; Law","score_opus":0.010245610522857105,"score_gpt":0.29468773347360777,"score_spread":0.28444212295075066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583569053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05357304,0.00004682157,0.9374649,0.00034958165,0.000014278009,0.00038168105,0.0000032933197,0.000037346013,0.008129039],"genre_scores_gemma":[0.9790441,0.000058171918,0.020691155,0.00002968619,0.000007759455,0.00008554532,0.0000023832354,0.0000024336405,0.00007877694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999508,0.00006919441,0.000121087374,0.00014917464,0.00007462151,0.0000778738],"domain_scores_gemma":[0.99926966,0.000042847947,0.00009188773,0.0005045841,0.000049176473,0.0000418097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075761863,0.000044297918,0.0000631046,0.000108183136,0.00020324398,0.000104480045,0.0006058008,0.000025751984,0.000006140773],"category_scores_gemma":[0.000011345965,0.000040664083,0.000014577041,0.000101587626,0.00013021783,0.0005010501,0.00007037477,0.00005266275,0.0000023015195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004958884,0.00006613634,0.0009890167,0.0000073580036,0.0000016871027,1.1614334e-7,0.00023353088,0.00006107076,0.00075523625,0.92345953,0.0000035384287,0.07441779],"study_design_scores_gemma":[0.00028615093,0.000046662306,0.011864894,0.000012957166,0.0000017328086,0.0000019615798,0.000037050628,0.007537031,0.0017537646,0.9780853,0.00029986803,0.000072622075],"about_ca_topic_score_codex":0.000014330936,"about_ca_topic_score_gemma":0.000006737117,"teacher_disagreement_score":0.92547107,"about_ca_system_score_codex":0.000003182567,"about_ca_system_score_gemma":0.000013341647,"threshold_uncertainty_score":0.16582331},"labels":[],"label_agreement":null},{"id":"W2584897526","doi":"10.1007/978-3-319-57586-5_3","title":"Scheduling Maintenance Jobs in Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Time complexity; Job shop scheduling; Mathematical optimization; Simple (philosophy); Approximation algorithm; Distributed computing; Algorithm; Mathematics; Computer network","score_opus":0.02342604167475172,"score_gpt":0.26489842661823215,"score_spread":0.24147238494348044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584897526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008630008,0.00041241347,0.98842484,0.0014101863,0.0015738953,0.0003850888,0.0000011313282,0.000114709175,0.0076690842],"genre_scores_gemma":[0.12521386,0.00042693975,0.86968195,0.002375941,0.0005467157,0.000018133538,0.000005264308,0.000052717303,0.0016784853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621844,0.000042366795,0.00052467576,0.0014931144,0.0007981424,0.00092326326],"domain_scores_gemma":[0.99710107,0.00027175582,0.00032524098,0.0018467135,0.0002528648,0.0002023533],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015120362,0.00044112487,0.0005060878,0.00081645715,0.00035603959,0.0011912466,0.005169353,0.00035528102,0.000021894033],"category_scores_gemma":[0.00020496533,0.0004084343,0.00010306304,0.00037330063,0.00070573075,0.00096372055,0.0018073665,0.0013079861,0.00004187793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002500503,0.000013092817,0.00013943216,0.000014121178,0.000002866966,0.00010080191,0.00024271202,0.66654444,0.0000050846465,0.027827311,0.0000139126505,0.30509374],"study_design_scores_gemma":[0.00027749006,0.000054003893,0.00021181321,0.0006015455,0.0000011691461,0.000025788297,5.9272736e-8,0.92050165,0.000022083557,0.07669281,0.0011701097,0.0004414702],"about_ca_topic_score_codex":0.000037373233,"about_ca_topic_score_gemma":0.00026704336,"teacher_disagreement_score":0.30465227,"about_ca_system_score_codex":0.0002961215,"about_ca_system_score_gemma":0.0005738457,"threshold_uncertainty_score":0.9998456},"labels":[],"label_agreement":null},{"id":"W2594754650","doi":"","title":"OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Polling; Convergence (economics); Mathematics; Mathematical optimization; Computer science; Regular polygon; Class (philosophy); Measure (data warehouse); Algorithm; Artificial intelligence; Data mining","score_opus":0.014696171396016509,"score_gpt":0.22925701613149196,"score_spread":0.21456084473547546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594754650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025790097,0.00031836453,0.96627843,0.0019333804,0.00009420237,0.00052272296,0.000013333378,0.0013030994,0.0037463922],"genre_scores_gemma":[0.6319796,0.0003122559,0.36351737,0.0014512995,0.000050184244,0.00039774526,0.000009338522,0.00003685407,0.0022453447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976106,0.0001424043,0.00038757356,0.0005929792,0.0005446117,0.00072179944],"domain_scores_gemma":[0.9980957,0.00011102844,0.0001644809,0.0010012579,0.00022287341,0.0004046546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033198044,0.00030042906,0.00029077835,0.00041703446,0.0006716015,0.00022066769,0.0009052734,0.00014659102,0.000035484292],"category_scores_gemma":[0.000103857725,0.00026987074,0.00010570926,0.0013383899,0.00019177029,0.00080262905,0.00024507276,0.00039600965,0.000035506102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028368173,0.0017851328,0.2270319,0.000117518706,0.0002268035,0.002638591,0.0033326882,0.040556118,0.002447451,0.6127833,0.0074050664,0.101391755],"study_design_scores_gemma":[0.0013342279,0.00068047224,0.09761328,0.000104235194,0.000020949657,0.0030545658,0.000046457924,0.8699847,0.0015234835,0.0023799113,0.022188008,0.0010697043],"about_ca_topic_score_codex":0.00051567133,"about_ca_topic_score_gemma":0.0016217206,"teacher_disagreement_score":0.8294286,"about_ca_system_score_codex":0.00021132585,"about_ca_system_score_gemma":0.00062156044,"threshold_uncertainty_score":0.9999753},"labels":[],"label_agreement":null},{"id":"W2598880527","doi":"10.1007/978-3-319-55911-7_48","title":"Fast Searching on Cartesian Products of Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cartesian product; Upper and lower bounds; Eulerian path; Hypercube; Computer science; Cartesian coordinate system; Graph; Lattice graph; Product (mathematics); Combinatorics; Path (computing); Search tree; Discrete mathematics; Search algorithm; Theoretical computer science; Mathematics; Algorithm; Parallel computing; Line graph; Voltage graph; Applied mathematics; Geometry","score_opus":0.027269901835308544,"score_gpt":0.27199713060153935,"score_spread":0.24472722876623082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598880527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031297794,0.0000971238,0.9792044,0.0016794724,0.0009145436,0.00045640854,0.000004749047,0.00008698563,0.017525027],"genre_scores_gemma":[0.2945789,0.00011757489,0.7012224,0.0010878872,0.0003982233,0.000012686422,0.000009336723,0.00006311749,0.002509841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963776,0.0000510537,0.00040505012,0.0013134856,0.0012701742,0.0005826767],"domain_scores_gemma":[0.9966393,0.00023109524,0.00035138038,0.0021783975,0.00042610645,0.00017371621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011505509,0.00037147297,0.00045330156,0.0010478955,0.0003915837,0.0005910991,0.004371412,0.00018112051,0.000011446498],"category_scores_gemma":[0.00021298813,0.00032504197,0.00010210673,0.00034413257,0.00090209476,0.00058180187,0.0011263828,0.0008105128,0.000027707256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006095123,0.000048150407,0.000048110953,0.00010130058,0.000012294081,0.00005296922,0.0015906692,0.07652821,0.00025440106,0.1202305,0.000040586445,0.8010867],"study_design_scores_gemma":[0.0005080386,0.0007029998,0.00028556754,0.0013724938,0.0000063887096,0.000045864195,2.5714616e-7,0.73812586,0.0060728174,0.24997495,0.0019252881,0.0009794515],"about_ca_topic_score_codex":0.000024848587,"about_ca_topic_score_gemma":0.000033030767,"teacher_disagreement_score":0.80010724,"about_ca_system_score_codex":0.000104175124,"about_ca_system_score_gemma":0.00071344484,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W2603214747","doi":"10.1142/s012905411750006x","title":"Deterministic Rendezvous with Detection Using Beeps","year":2017,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Node (physics); Mobile agent; Computer network; Real-time computing; Distributed computing","score_opus":0.04234109411602974,"score_gpt":0.35111037560664526,"score_spread":0.30876928149061555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603214747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06756075,0.0000056050767,0.92991346,0.0006652826,0.001446726,0.00005317099,9.64966e-7,0.000011161935,0.00034287327],"genre_scores_gemma":[0.70450866,0.0000060771163,0.29532808,0.000036397465,0.00010633286,4.784725e-7,1.6479939e-7,0.0000027185913,0.000011102572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981564,0.000029765279,0.00040415672,0.00018529907,0.0010751911,0.00014913673],"domain_scores_gemma":[0.99589175,0.000064463,0.0009665264,0.00046470857,0.0025100242,0.00010252727],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007556087,0.00008319491,0.00013248938,0.00053024245,0.0004848919,0.0012015746,0.0035834764,0.000020990208,0.0000070404626],"category_scores_gemma":[0.00018847393,0.00006876129,0.00005710902,0.0002408555,0.00052415003,0.0033113568,0.000390339,0.00011723834,0.0000028339543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010132282,0.00045376166,0.00453642,0.00001923603,0.00020323234,0.00015982526,0.0017144142,0.15632674,0.019603148,0.050821465,0.000039085764,0.7660214],"study_design_scores_gemma":[0.0006600825,0.00035941615,0.012466948,0.00011169624,0.000009091161,0.00074906833,0.000009234369,0.97650295,0.005841513,0.0028021075,0.00036070342,0.00012715602],"about_ca_topic_score_codex":0.000020284904,"about_ca_topic_score_gemma":0.000010174713,"teacher_disagreement_score":0.82017624,"about_ca_system_score_codex":0.00010986734,"about_ca_system_score_gemma":0.0006060476,"threshold_uncertainty_score":0.99983525},"labels":[],"label_agreement":null},{"id":"W2604377131","doi":"10.1016/j.dam.2017.03.003","title":"The fast search number of a Cartesian product of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.024039843949368953,"score_gpt":0.30076120095634834,"score_spread":0.27672135700697936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604377131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026846772,0.000046245426,0.7373934,0.001929124,0.00014761307,0.0013704179,0.00001469753,0.00009663146,0.23215511],"genre_scores_gemma":[0.8456891,0.00003523953,0.15385677,0.000010046134,0.000011103689,0.000026025433,0.0000013494382,0.000010856129,0.00035947183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887586,0.00001771003,0.000301252,0.00017659258,0.0004115159,0.00021706325],"domain_scores_gemma":[0.9979648,0.000095199925,0.00026002584,0.0014847008,0.00013837135,0.000056911605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917148,0.00009598327,0.00018869112,0.000030650182,0.00033662224,0.00016972396,0.0015049453,0.00002748495,0.000011131936],"category_scores_gemma":[0.000064575106,0.0000624426,0.00006136839,0.00012749515,0.00029584672,0.000133257,0.0003836667,0.000097243515,0.00001929037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026694004,0.000049337923,0.00013705298,0.00013431575,0.000022961354,4.1915285e-7,0.0026117892,0.00006677309,0.0017731172,0.98933655,0.00012714538,0.0057378956],"study_design_scores_gemma":[0.0018492738,0.00014207717,0.0027967058,0.00028685643,0.00005426872,0.000026982654,0.0029683714,0.26277164,0.11400181,0.6128572,0.0014181226,0.00082665344],"about_ca_topic_score_codex":0.000010161323,"about_ca_topic_score_gemma":0.0000045667907,"teacher_disagreement_score":0.81884235,"about_ca_system_score_codex":0.000005975503,"about_ca_system_score_gemma":0.000057065998,"threshold_uncertainty_score":0.2796588},"labels":[],"label_agreement":null},{"id":"W2606510480","doi":"10.1007/978-3-319-57351-9_15","title":"Time Prediction of the Next Refueling Event: A Case Study","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Event (particle physics); Set (abstract data type); Artificial intelligence; Data mining; Machine learning; Ensemble learning; Ensemble forecasting; Data set","score_opus":0.042457695149409294,"score_gpt":0.28441510745532844,"score_spread":0.24195741230591916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606510480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069443905,0.00010476148,0.99521947,0.0003599888,0.0011326647,0.0008231473,0.000005529222,0.00007245687,0.0015875712],"genre_scores_gemma":[0.91190034,0.000027256987,0.08541865,0.00034911235,0.0003088912,0.000015446314,0.0000019443316,0.00003306671,0.0019453075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721664,0.00007884214,0.00048079953,0.00089532696,0.0009788799,0.00034951154],"domain_scores_gemma":[0.99683833,0.00019128175,0.00043896848,0.002099745,0.0003321844,0.00009947586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013441236,0.0002809313,0.0003342223,0.00037898656,0.00058597606,0.00052080245,0.0034844899,0.0001581133,0.00001915264],"category_scores_gemma":[0.00014404077,0.00020293609,0.00011503644,0.000275911,0.0006131498,0.00070923415,0.0018980606,0.0005992364,0.000017061038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069258635,0.00021927488,0.00029087235,0.00007513564,0.0000417903,0.0007854028,0.010161276,0.35130844,0.00017818932,0.0025406806,0.000042379183,0.63434964],"study_design_scores_gemma":[0.00029153784,0.00022285379,0.00006467612,0.00028547583,0.000008878743,0.00046924123,0.0000011650917,0.988345,0.000100810656,0.009699697,0.00030068393,0.00020996596],"about_ca_topic_score_codex":0.000056284967,"about_ca_topic_score_gemma":0.000074743,"teacher_disagreement_score":0.9112059,"about_ca_system_score_codex":0.00013004504,"about_ca_system_score_gemma":0.0004884808,"threshold_uncertainty_score":0.82754934},"labels":[],"label_agreement":null},{"id":"W2608449519","doi":"10.1016/j.jcss.2017.04.001","title":"The impact of processing order on performance: A taxonomy of semi-FIFO policies","year":2017,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research University Higher School of Economics","keywords":"FIFO (computing and electronics); Computer science; Order (exchange); Taxonomy (biology); Operations research; Mathematics; Business; Programming language; Biology; Finance","score_opus":0.05195371665569185,"score_gpt":0.32342264984391245,"score_spread":0.2714689331882206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608449519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70715594,0.00039196582,0.2865371,0.0006079371,0.00040854875,0.00019019011,8.8441556e-7,0.00001005684,0.004697391],"genre_scores_gemma":[0.9891963,0.00006063347,0.010633278,0.00001022307,0.000072405914,9.50053e-7,1.44378305e-8,0.0000014878087,0.000024680527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988589,0.00006413003,0.0004039901,0.000096352356,0.0004224545,0.00015417238],"domain_scores_gemma":[0.9982932,0.00009416333,0.0009082823,0.00020972526,0.00042820486,0.00006643139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015498294,0.000076218865,0.00021843838,0.00013508917,0.0006939574,0.0006160466,0.0012212413,0.000020949203,5.9671146e-7],"category_scores_gemma":[0.00002297898,0.000036532092,0.00006908065,0.00018906344,0.0003376438,0.0008208317,0.00015114176,0.00007981984,3.5215356e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111312926,0.0002760592,0.18269627,0.00083027786,0.00019683214,0.000012047473,0.009301863,0.22222705,0.0005215064,0.03313021,0.0025377935,0.54815876],"study_design_scores_gemma":[0.0003133672,0.0011343778,0.045515012,0.0005511237,0.000003329751,0.00011376065,0.0001978975,0.9516759,0.00018635251,0.00006714142,0.00017078538,0.000070946495],"about_ca_topic_score_codex":0.000029159266,"about_ca_topic_score_gemma":9.78071e-7,"teacher_disagreement_score":0.72944885,"about_ca_system_score_codex":0.000018280087,"about_ca_system_score_gemma":0.0003087009,"threshold_uncertainty_score":0.5940552},"labels":[],"label_agreement":null},{"id":"W2610562287","doi":"","title":"The number of increasing nonconsecutive subpaths in a path","year":2006,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Path (computing); Computer science","score_opus":0.005753194385482556,"score_gpt":0.1968608752115206,"score_spread":0.19110768082603805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610562287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5582675,0.00008598923,0.15663709,0.00027402208,0.00054240384,0.00029343652,0.00000908617,0.00012246033,0.28376803],"genre_scores_gemma":[0.98873985,0.000016906833,0.0087393,0.000016198925,0.000036478566,0.000001035993,0.000004848799,0.0000039946985,0.0024413595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99869597,0.00022557392,0.0002373695,0.0002732806,0.00034104678,0.00022673598],"domain_scores_gemma":[0.9990925,0.0002333062,0.00012865567,0.0002733958,0.0002094182,0.000062692416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030402152,0.00010993262,0.00012620723,0.00016251969,0.00067974225,0.000097684555,0.00057563826,0.00006770744,0.000004699612],"category_scores_gemma":[0.000050710216,0.000102435486,0.000069113994,0.0007293462,0.00045082197,0.0005898939,0.00020203904,0.00016925005,0.000012182075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046158297,0.000115951036,0.09487101,0.00001054906,0.000014252428,0.0005349452,0.00012765283,0.0059506893,0.00082431105,0.89705384,0.000084782565,0.000365869],"study_design_scores_gemma":[0.0044125216,0.0001446178,0.77170646,0.00060906756,0.000040902694,0.0015836648,0.00082550664,0.1512542,0.003569581,0.0084338,0.056226097,0.0011935843],"about_ca_topic_score_codex":0.0015148881,"about_ca_topic_score_gemma":0.0001519694,"teacher_disagreement_score":0.88862,"about_ca_system_score_codex":0.0002889866,"about_ca_system_score_gemma":0.0005436874,"threshold_uncertainty_score":0.5228096},"labels":[],"label_agreement":null},{"id":"W2611167225","doi":"10.1002/net.21810","title":"Deterministic gathering with crash faults","year":2018,"lang":"en","type":"preprint","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Traverse; Computer science; Node (physics); Crash; Asynchrony (computer programming); Fault (geology); Enhanced Data Rates for GSM Evolution; Real-time computing; Distributed computing; Computer network; Computer security; Artificial intelligence; Engineering; Asynchronous communication","score_opus":0.018497622520054307,"score_gpt":0.2539627596083782,"score_spread":0.23546513708832392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611167225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008809648,0.00006912261,0.9885983,0.00015183627,0.0007342653,0.00028426189,0.0000012324563,0.00030097298,0.008979027],"genre_scores_gemma":[0.8019503,0.00012864626,0.19500919,0.00056745857,0.0008176226,0.00009133843,0.00002235838,0.00004828938,0.0013648064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847955,0.00007284086,0.00020756878,0.00058266753,0.0002780979,0.00037925786],"domain_scores_gemma":[0.99860156,0.000059417624,0.00013645056,0.00091134926,0.00014841135,0.00014283713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024051993,0.00022008226,0.00021686827,0.00006766653,0.00012132286,0.0003352224,0.0011903635,0.00022132773,0.000047295915],"category_scores_gemma":[0.000014976492,0.00018308919,0.000052273113,0.00018274668,0.000082014165,0.000110137305,0.0012547568,0.00053719245,0.000051427498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010557888,0.00004509947,0.0007243201,0.0000664748,0.00004753637,0.000057099427,0.0005178056,0.95712924,0.0000013863893,0.0017222838,0.002706287,0.0369719],"study_design_scores_gemma":[0.00016464817,0.00008865934,0.0004435612,0.00021644085,0.0000057727375,0.000010854364,0.0000023008333,0.9953066,0.0000041734997,0.0010713466,0.0024355156,0.00025011023],"about_ca_topic_score_codex":0.000008041759,"about_ca_topic_score_gemma":0.000019283254,"teacher_disagreement_score":0.8010693,"about_ca_system_score_codex":0.00003925158,"about_ca_system_score_gemma":0.00012457222,"threshold_uncertainty_score":0.74661607},"labels":[],"label_agreement":null},{"id":"W2612999812","doi":"10.48550/arxiv.1705.03538","title":"Shape Formation by Programmable Particles","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Grid; Hexagonal tiling; Node (physics); Rotation (mathematics); Chirality (physics); Tessellation (computer graphics); Topology (electrical circuits); Algorithm; Geometry; Mathematics; Combinatorics; Physics; Artificial intelligence; Symmetry breaking; Spontaneous symmetry breaking","score_opus":0.11172414915517952,"score_gpt":0.2086057545161518,"score_spread":0.09688160536097228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612999812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024841104,0.0000639277,0.970018,0.00046094746,0.00019671161,0.00039590456,0.00000924898,0.00032083096,0.0036932935],"genre_scores_gemma":[0.99120563,0.0002819593,0.005729384,0.0000656665,0.000020256675,0.0000024671806,0.000034561996,0.000008935873,0.0026511305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988564,0.00008283587,0.00013188239,0.000529833,0.00009184872,0.00030719035],"domain_scores_gemma":[0.9984611,0.000022859203,0.00022654503,0.0009809467,0.00015501794,0.0001535065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024385555,0.0001591142,0.00015688279,0.00009476294,0.00030416594,0.0005579853,0.0016492339,0.00014907957,0.00003412378],"category_scores_gemma":[0.000029009878,0.00017668823,0.00008876287,0.00016179023,0.00007695307,0.0011182827,0.001314865,0.00027294923,0.00014382675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004120582,0.0004781328,0.0028232958,0.00036295777,0.00014551343,0.00018250369,0.0011802344,0.4391024,0.00021448551,0.46384335,0.020003028,0.07162288],"study_design_scores_gemma":[0.0002647395,0.000030703115,0.00005753851,0.00003568567,0.000009607751,0.0000012079987,0.000014184823,0.96944565,0.00022300496,0.023394275,0.0063170437,0.00020634953],"about_ca_topic_score_codex":0.000059636488,"about_ca_topic_score_gemma":0.00001648628,"teacher_disagreement_score":0.96636456,"about_ca_system_score_codex":0.0000878937,"about_ca_system_score_gemma":0.000102927894,"threshold_uncertainty_score":0.7205137},"labels":[],"label_agreement":null},{"id":"W2613774992","doi":"10.1007/s10107-020-01576-0","title":"General bounds for incremental maximization","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Technische Universität Darmstadt; Deutsche Forschungsgemeinschaft","keywords":"Cardinality (data modeling); Knapsack problem; Competitive analysis; Submodular set function; Maximization; Mathematics; Mathematical optimization; Greedy algorithm; Bounded function; Matching (statistics); Class (philosophy); Combinatorics; Function (biology); Upper and lower bounds; Computer science","score_opus":0.06959338221277929,"score_gpt":0.3216730882626167,"score_spread":0.2520797060498374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613774992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014160131,0.00003892319,0.992785,0.0032106724,0.00022671666,0.0016938129,0.0000070303927,0.00052171404,0.00137458],"genre_scores_gemma":[0.016235618,0.0000062350105,0.9821422,0.00036777448,0.00018450516,0.0006072528,0.00012610314,0.000035750356,0.00029457608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795085,0.00006791446,0.0004988508,0.0006224941,0.00044281996,0.00041704468],"domain_scores_gemma":[0.9988754,0.00009560943,0.00017518649,0.0004954971,0.00014542919,0.0002128711],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00049507554,0.00025599217,0.00035316986,0.00009165093,0.00016612357,0.0010990963,0.0009919915,0.00019283938,0.00004464714],"category_scores_gemma":[0.0002584334,0.0002417132,0.00018789236,0.00020873138,0.00005712198,0.00020093858,0.0014704023,0.00034317432,0.000053368643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013199079,0.00034385896,0.000024237857,0.0021042847,0.00010753168,0.0000093359695,0.001836962,0.0038113834,0.00014429478,0.866299,0.0019975652,0.123308375],"study_design_scores_gemma":[0.0002603317,0.00007472919,0.0000020577684,0.000076847515,0.000014394773,0.0000035392334,0.000014877307,0.7860524,0.00015408061,0.2078252,0.00528212,0.00023942707],"about_ca_topic_score_codex":0.0000034388754,"about_ca_topic_score_gemma":6.742222e-7,"teacher_disagreement_score":0.782241,"about_ca_system_score_codex":0.00008788282,"about_ca_system_score_gemma":0.00012650139,"threshold_uncertainty_score":0.99993783},"labels":[],"label_agreement":null},{"id":"W2615288237","doi":"10.5539/jmr.v9n3p23","title":"An Addendum on Postoptimality of Maximally Reliable Path","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Infimum and supremum; Multiplicative function; Addendum; Path (computing); Robustness (evolution); Arc (geometry); Mathematical optimization; Combinatorics; Mathematical analysis; Geometry; Computer science","score_opus":0.1787361470804617,"score_gpt":0.44478508777291587,"score_spread":0.26604894069245416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615288237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2831107,0.00014914396,0.60335076,0.0108396085,0.00075996213,0.00095650577,0.000016204714,0.0000644784,0.10075265],"genre_scores_gemma":[0.6294263,0.00015646416,0.36967558,0.000031085205,0.0000981484,0.0000022221902,3.2294113e-7,0.000012558579,0.00059734524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710035,0.00019697842,0.0005454486,0.00014980885,0.0016869555,0.0003204485],"domain_scores_gemma":[0.9960397,0.00023971777,0.0005792288,0.0012776369,0.0016361059,0.00022760908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007507389,0.000085816755,0.0002670591,0.00034605412,0.00034348865,0.0005058844,0.0029252102,0.00006720702,0.0000782425],"category_scores_gemma":[0.0010695513,0.00006413114,0.000088999135,0.00016942683,0.00016260955,0.00087246805,0.00033138483,0.0005530346,0.000033496042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025189374,0.008237942,0.0029615161,0.0011083814,0.00021059695,0.00051365065,0.010070815,0.0088404715,0.01957424,0.88765305,0.033115793,0.027461633],"study_design_scores_gemma":[0.003012721,0.008914774,0.0070730983,0.0014990281,0.000017011656,0.00020836301,0.0010586259,0.8005238,0.018360691,0.15419175,0.00462215,0.00051796576],"about_ca_topic_score_codex":0.000018640412,"about_ca_topic_score_gemma":0.0000023457337,"teacher_disagreement_score":0.7916834,"about_ca_system_score_codex":0.000053195192,"about_ca_system_score_gemma":0.0003272501,"threshold_uncertainty_score":0.54358166},"labels":[],"label_agreement":null},{"id":"W2620280838","doi":"10.1016/j.jpdc.2017.04.003","title":"Decidability classes for mobile agents computing","year":2017,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université Paris Diderot; Agence Nationale de la Recherche; Université du Québec en Outaouais","keywords":"Decidability; Class (philosophy); Decision problem; Certificate; Computer science; Verifiable secret sharing; Protocol (science); Focus (optics); Reduction (mathematics); Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Programming language","score_opus":0.04602957870674327,"score_gpt":0.3446050114997421,"score_spread":0.2985754327929988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620280838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251006,0.00012112835,0.8961725,0.00051483605,0.0003024569,0.00019627358,0.0000074317304,0.000025162019,0.00015015971],"genre_scores_gemma":[0.8541865,0.000022814875,0.14556369,0.00007657005,0.0001275419,0.0000012451623,0.000003941841,0.000004673352,0.000013064747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864966,0.00006764729,0.00052661076,0.00021273598,0.00024465148,0.000298673],"domain_scores_gemma":[0.99792486,0.00029821313,0.0007871013,0.00033126902,0.00046259764,0.00019596072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437563,0.00012523627,0.00028837548,0.000060027138,0.0008938965,0.00078873103,0.00090487703,0.000057665045,0.000003426196],"category_scores_gemma":[0.0004386511,0.00010487665,0.00012241722,0.000075486176,0.00008047037,0.0005216682,0.00040828704,0.00017760576,0.0000011914437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018091656,0.00080897915,0.13197091,0.00032720462,0.00031079797,0.00009845785,0.002030284,0.5418686,0.00027612358,0.031295616,0.009666591,0.2811655],"study_design_scores_gemma":[0.0015155266,0.00026032553,0.057287253,0.000079961574,0.000011075918,0.00006569723,0.000089677225,0.9339402,0.00003410964,0.0032732454,0.0032863433,0.0001566267],"about_ca_topic_score_codex":0.000006163147,"about_ca_topic_score_gemma":0.0000014153507,"teacher_disagreement_score":0.7516764,"about_ca_system_score_codex":0.00003864613,"about_ca_system_score_gemma":0.00009368485,"threshold_uncertainty_score":0.7605752},"labels":[],"label_agreement":null},{"id":"W2621324178","doi":"10.5555/1283383.1283446","title":"Tree exploration with logarithmic memory","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Computer science; Node (physics); Tree (set theory); Network topology; Logarithm; Binary logarithm; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Task (project management); Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence","score_opus":0.018104980120028976,"score_gpt":0.2619032041318963,"score_spread":0.24379822401186735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621324178","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004258623,0.000025816487,0.93805575,0.0037828397,0.00028648844,0.00039253666,0.0000028775507,0.0003349183,0.05669292],"genre_scores_gemma":[0.356058,0.00021395847,0.6277052,0.0032465397,0.0006691257,0.00015706757,0.00010242215,0.00011731032,0.011730327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799377,0.000073137235,0.00027973947,0.00053964293,0.00062072877,0.0004929914],"domain_scores_gemma":[0.9988064,0.000082024075,0.00010081266,0.00064211036,0.00014238058,0.00022624484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352531,0.00021837332,0.0001728686,0.00024958633,0.00020210879,0.00023699913,0.000646357,0.000084442,0.000031559735],"category_scores_gemma":[0.000012591782,0.00016877467,0.000058535115,0.00061449216,0.00008455082,0.0010817408,0.000115676376,0.00021447016,0.00017090309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000509489,0.0010202553,0.0003563878,0.000113860784,0.00026348286,0.00069339765,0.011684295,0.045404483,0.014095874,0.16426754,0.0065048933,0.755086],"study_design_scores_gemma":[0.004978078,0.0038245944,0.0016398565,0.00017975252,0.000031892436,0.00011623487,0.0009802798,0.92825806,0.04161007,0.0042422274,0.012369415,0.0017695312],"about_ca_topic_score_codex":0.000023558681,"about_ca_topic_score_gemma":0.000041751897,"teacher_disagreement_score":0.88285357,"about_ca_system_score_codex":0.00006366627,"about_ca_system_score_gemma":0.00007762713,"threshold_uncertainty_score":0.68824315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02134146295016659,"score_gpt":0.24616554408899366,"score_spread":0.22482408113882707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621800709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038549285,0.00015166723,0.9549183,0.012253167,0.00046909507,0.00021282615,0.00000206784,0.00021227461,0.027925659],"genre_scores_gemma":[0.85769874,0.0000067202545,0.13289925,0.0014761293,0.00019610501,0.000019243187,0.0000015127233,0.000009714856,0.0076925955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909776,0.0000525056,0.00007835277,0.00017640722,0.00022701909,0.00036797512],"domain_scores_gemma":[0.99929154,0.00002861061,0.000022952498,0.00032269012,0.00006633575,0.00026784837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022241396,0.000082942104,0.00008336161,0.00005207275,0.00008265109,0.00022199898,0.00044612944,0.00003605474,0.000093014154],"category_scores_gemma":[0.00004235628,0.00007226675,0.000032122614,0.00026488796,0.0000144643645,0.0007376413,0.00020859507,0.000051566207,0.00039520903],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009892847,0.00041438913,0.009602456,0.00005385915,0.00004501528,0.00002235218,0.008919283,0.0019129479,0.0020449066,0.6121617,0.23950912,0.12530406],"study_design_scores_gemma":[0.0007616062,0.00028679322,0.007845374,0.00005216659,0.0000066122925,0.00006155413,0.00018742474,0.04403705,0.004949328,0.0020015517,0.9390094,0.0008011256],"about_ca_topic_score_codex":0.000016647187,"about_ca_topic_score_gemma":0.000017743476,"teacher_disagreement_score":0.8538438,"about_ca_system_score_codex":0.000035175915,"about_ca_system_score_gemma":0.00003429427,"threshold_uncertainty_score":0.50797445},"labels":[],"label_agreement":null},{"id":"W2622743094","doi":"10.1145/2629671","title":"Distributed Selfish Load Balancing on Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Computer and Network Systems; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Nash equilibrium; Convergence (economics); Computer science; Logarithm; Vertex (graph theory); Potential game; Load balancing (electrical power); Mathematical optimization; Computation; Graph; Best response; Distributed algorithm; Polynomial; Coordination game; Mathematics; Distributed computing; Theoretical computer science; Mathematical economics; Algorithm","score_opus":0.013687302818713581,"score_gpt":0.24350609256702183,"score_spread":0.22981878974830824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622743094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000087283355,0.000008860441,0.9945712,0.0028043073,0.00059874315,0.0001643195,0.000010974916,0.00042631777,0.0013279615],"genre_scores_gemma":[0.7148296,0.00010728556,0.28053093,0.0031458298,0.00020039313,0.000081154256,0.000027596503,0.000038509435,0.0010386813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984339,0.00012098973,0.00021688749,0.0004229071,0.00042897326,0.0003763729],"domain_scores_gemma":[0.9984458,0.00025291461,0.000049833943,0.00093110907,0.00013321267,0.00018712577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039223814,0.00016808201,0.00015749011,0.00010269773,0.0003347314,0.00020383099,0.00085879426,0.00009915227,0.00008083671],"category_scores_gemma":[0.000058893806,0.00015755018,0.00008862319,0.0006100414,0.0000348413,0.0002815445,0.000016885659,0.0003644863,0.0001652515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000920177,0.00021290316,0.000011520953,0.000005299934,0.00002773014,0.000004110734,0.00016326307,0.50296783,0.000014259469,0.0023031163,0.0008093032,0.4934714],"study_design_scores_gemma":[0.00055099634,0.00022879567,0.0004061665,0.000026555961,0.000005456411,0.0000070949463,0.000009913941,0.98543006,0.00023510098,0.0008714196,0.012026575,0.00020186276],"about_ca_topic_score_codex":0.000023598439,"about_ca_topic_score_gemma":0.000011457671,"teacher_disagreement_score":0.71474236,"about_ca_system_score_codex":0.00011609407,"about_ca_system_score_gemma":0.000053390868,"threshold_uncertainty_score":0.64247096},"labels":[],"label_agreement":null},{"id":"W2623507859","doi":"10.1016/j.tcs.2017.05.029","title":"Improved analysis of the online set cover problem with advice","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Advice (programming); Set cover problem; Cover (algebra); Online algorithm; Set (abstract data type); Competitive analysis; Upper and lower bounds; Time complexity; Computer science; Mathematics; Computational complexity theory; Quality (philosophy); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics","score_opus":0.013541789528518268,"score_gpt":0.2784548933950822,"score_spread":0.26491310386656397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623507859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01991744,0.000003282412,0.97401375,0.0027143608,0.000121990524,0.00022629111,0.000008688691,0.00007101489,0.002923174],"genre_scores_gemma":[0.7991951,0.0000019289744,0.20032531,0.00039711938,0.000017268414,0.000003095254,9.648887e-7,0.0000037026466,0.00005546941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980296,0.00009109775,0.00023863486,0.0005231065,0.00073718955,0.00038036023],"domain_scores_gemma":[0.9970184,0.00010682588,0.00022442671,0.002054926,0.00043004463,0.00016538483],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010454443,0.00013199658,0.00023614218,0.00017520667,0.0008068326,0.0006500684,0.0054656323,0.000033669676,0.00003852802],"category_scores_gemma":[0.00008504963,0.00007275882,0.000092947805,0.0016899277,0.0036566416,0.00075642765,0.0019079854,0.00016879807,0.0000054027373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010659834,0.000092197275,0.0011198513,0.000008037726,0.000058704936,0.0000016458663,0.0005006306,0.01162307,0.00036483543,0.9803778,0.000029256047,0.0058132936],"study_design_scores_gemma":[0.00022874527,0.00013326436,0.010458219,0.000020078565,0.000039791852,0.0000033881038,0.0000033842973,0.98240757,0.00081350346,0.0057148524,0.00005826248,0.00011893242],"about_ca_topic_score_codex":0.000021440923,"about_ca_topic_score_gemma":0.00001248681,"teacher_disagreement_score":0.97466296,"about_ca_system_score_codex":0.000027229185,"about_ca_system_score_gemma":0.00021014996,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2624136382","doi":"10.1145/1240233.1240246","title":"Sharing the cost more efficiently","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Minimum-cost flow problem; Approximation algorithm; Mathematical optimization; Mathematics; Computer science; Provisioning; Flow network; Combinatorics; Discrete mathematics; Computer network","score_opus":0.03576802905243455,"score_gpt":0.30946723761663547,"score_spread":0.27369920856420094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624136382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034134052,0.000021061956,0.99249345,0.0044997805,0.0005023179,0.0002933403,0.000003299712,0.0002216471,0.0016237855],"genre_scores_gemma":[0.56498724,0.00009024928,0.42524335,0.0043592914,0.00015971917,0.00009729677,0.0000056373724,0.00004168713,0.005015543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998743,0.00002445272,0.00019256884,0.0003193376,0.00037058603,0.00035004297],"domain_scores_gemma":[0.99858886,0.00019090345,0.000035193498,0.0009772396,0.00008604389,0.00012176111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388463,0.000113003436,0.00008130392,0.00014279516,0.00048544264,0.0001920561,0.0014618346,0.000051318075,0.000079281665],"category_scores_gemma":[0.000023876446,0.000082141974,0.000073677475,0.0007458856,0.00007054385,0.00024738113,0.000029846171,0.00029356865,0.00015029334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007938769,0.00020889076,0.000020855745,0.0000048114534,0.000026591335,0.000014055873,0.0016400511,0.061786797,0.000107885295,0.0044334084,0.00014365265,0.93160504],"study_design_scores_gemma":[0.0008795942,0.00015035544,0.0029021606,0.000029386176,0.000012198073,0.000049922313,0.00038653935,0.96412724,0.004042982,0.0011930782,0.025867674,0.0003588613],"about_ca_topic_score_codex":0.00002676322,"about_ca_topic_score_gemma":0.000015566453,"teacher_disagreement_score":0.9312462,"about_ca_system_score_codex":0.000053608317,"about_ca_system_score_gemma":0.000031442734,"threshold_uncertainty_score":0.37336814},"labels":[],"label_agreement":null},{"id":"W2625894783","doi":"10.1016/j.tcs.2017.05.021","title":"Know when to persist: Deriving value from a stream buffer","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Random permutation; Competitive analysis; Scheduling (production processes); Data stream; Online algorithm; Permutation (music); Algorithm; Mathematics; Mathematical optimization; Upper and lower bounds; Statistics; Discrete mathematics","score_opus":0.01683647901415447,"score_gpt":0.27598478296795875,"score_spread":0.2591483039538043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625894783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014594932,0.000013435058,0.9672471,0.008256155,0.0006003013,0.0002021812,0.0000029068667,0.00017575253,0.008907207],"genre_scores_gemma":[0.61576873,0.0000026533346,0.38310444,0.0009632426,0.0001015714,0.0000054213947,4.4537447e-7,0.000005943493,0.00004755383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731016,0.00010258063,0.0002142078,0.00090193754,0.0008153657,0.00065576093],"domain_scores_gemma":[0.9969539,0.0001854573,0.00007387636,0.0019475034,0.0002305085,0.0006087307],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010820075,0.00018279426,0.0002066481,0.00014677129,0.0015024057,0.0029317313,0.006160551,0.0000502888,0.0001677879],"category_scores_gemma":[0.0003262454,0.00015341301,0.00006830919,0.00028151026,0.0016730042,0.0012488038,0.003428643,0.00018604439,0.00031794395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037066368,0.000044653738,0.00021773457,0.0000022533404,0.000004510201,0.000009927548,0.0016109417,0.00079918146,0.00040806964,0.93761474,0.00025420866,0.059030056],"study_design_scores_gemma":[0.00020393518,0.00014552685,0.0037706497,0.00005654356,0.0000030144924,0.0000056013405,0.000008133281,0.8685742,0.0015805196,0.124649435,0.00074401713,0.00025845284],"about_ca_topic_score_codex":0.000057860336,"about_ca_topic_score_gemma":0.0000042878864,"teacher_disagreement_score":0.86777496,"about_ca_system_score_codex":0.000069201975,"about_ca_system_score_gemma":0.0001606703,"threshold_uncertainty_score":0.9997975},"labels":[],"label_agreement":null},{"id":"W2626096427","doi":"10.1142/s2301385017500066","title":"Heterogeneous Task Allocation and Sequencing via Decentralized Large Neighborhood Search","year":2017,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Robot; Computer science; Travelling salesman problem; Task (project management); Mathematical optimization; Path (computing); Motion planning; Distributed computing; Common value auction; Artificial intelligence; Algorithm; Mathematics; Computer network; Engineering","score_opus":0.030212712552797543,"score_gpt":0.2798406045165266,"score_spread":0.24962789196372906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626096427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017083291,0.00055960094,0.9782897,0.0010584504,0.0006001361,0.0006373856,0.0000068375975,0.00019614129,0.0015684209],"genre_scores_gemma":[0.9970696,0.00011498135,0.0021893235,0.000107144115,0.000061970415,0.000026116435,0.000009139381,0.0000142756435,0.00040746763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998262,0.0001952326,0.0002746688,0.00042297484,0.00037008742,0.0004750497],"domain_scores_gemma":[0.99848014,0.00004061898,0.00014546484,0.0009386658,0.00017978752,0.00021531426],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075975916,0.00014427427,0.00019944018,0.00009963091,0.0007873879,0.0012600619,0.0008579289,0.0000861956,0.000009074434],"category_scores_gemma":[0.00006318978,0.000132915,0.000039518065,0.000106460204,0.000047168796,0.00070749136,0.00031619868,0.000119704004,0.00006531733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011962233,0.00058166945,0.031492952,0.0014008946,0.0006027493,0.00051162235,0.025464572,0.09801426,0.04948613,0.7342858,0.002592945,0.055446804],"study_design_scores_gemma":[0.0007902304,0.00006583634,0.00034339316,0.000060791677,0.0000039751267,0.00006900875,0.00007346703,0.995537,0.00072035124,0.00031290107,0.001835906,0.00018714395],"about_ca_topic_score_codex":0.00019260817,"about_ca_topic_score_gemma":0.000031625354,"teacher_disagreement_score":0.9799863,"about_ca_system_score_codex":0.00009000595,"about_ca_system_score_gemma":0.00008653894,"threshold_uncertainty_score":0.9997767},"labels":[],"label_agreement":null},{"id":"W2626553122","doi":"10.1109/radar.2017.7944344","title":"Task selection and scheduling in multifunction multichannel radars","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Scheduling (production processes); Computational complexity theory; Radar; Radar tracker; Job shop scheduling; Branch and bound; Real-time computing; Task analysis; Timeline; Task (project management); Distributed computing; Mathematical optimization; Algorithm; Engineering; Embedded system; Mathematics; Telecommunications","score_opus":0.025128207510878655,"score_gpt":0.27895386953962154,"score_spread":0.2538256620287429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626553122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074059024,0.000011029059,0.92326105,0.0010501861,0.00015603488,0.00011778434,9.841419e-8,0.00007266246,0.0012721492],"genre_scores_gemma":[0.8391929,0.000022229842,0.16028102,0.00007146893,0.000015018858,0.0000048173592,3.8223143e-7,0.000002573301,0.0004095403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994721,0.000024708219,0.00008912537,0.00019524046,0.00009154346,0.00012732939],"domain_scores_gemma":[0.99966127,0.00001874632,0.000040467257,0.00018608561,0.000046203793,0.00004725088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024294616,0.000049930964,0.00005442011,0.00008444129,0.00026566157,0.0003377549,0.00019202038,0.000034380246,0.000008484678],"category_scores_gemma":[0.000100681464,0.000045570956,0.000009675917,0.00006917359,0.00001895807,0.000819845,0.000114090995,0.00007948159,0.000013033446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052024974,0.00039792177,0.107956074,0.00008468628,0.000030635936,0.000017680039,0.0057387366,0.2587618,0.022984223,0.08658985,0.00038215145,0.5170042],"study_design_scores_gemma":[0.00043089694,0.000020223675,0.013777326,0.000008126567,4.1716015e-7,0.0000025924496,0.000022152155,0.9845541,0.00053878734,0.0004015638,0.00018414124,0.000059668328],"about_ca_topic_score_codex":0.00024235032,"about_ca_topic_score_gemma":0.0002674183,"teacher_disagreement_score":0.7651339,"about_ca_system_score_codex":0.000018521201,"about_ca_system_score_gemma":0.000018285002,"threshold_uncertainty_score":0.32569784},"labels":[],"label_agreement":null},{"id":"W2658712968","doi":"10.1007/s00453-017-0337-x","title":"Minimizing Latency of Capacitated k-Tours","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Rounding; Vehicle routing problem; Latency (audio); Computer science; Theory of computation; Mathematical optimization; Approximation algorithm; Constant (computer programming); Orienteering; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Telecommunications","score_opus":0.025833774242835745,"score_gpt":0.28174052564240587,"score_spread":0.25590675139957014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2658712968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010848334,0.000077231714,0.9476857,0.005506667,0.00068286003,0.00024786807,0.00000781855,0.00018497476,0.034758545],"genre_scores_gemma":[0.6761351,0.000027889922,0.32266936,0.000104214865,0.000038471448,0.0000058842543,0.000002198871,0.000008224098,0.0010086474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992536,0.000029555627,0.00015978936,0.00018523971,0.0001817679,0.0001900525],"domain_scores_gemma":[0.99891794,0.000032902895,0.0001425389,0.0006978582,0.0001334178,0.000075315955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001906753,0.000069044814,0.00011557786,0.00006434579,0.0002203447,0.00014346615,0.001066619,0.00003944951,0.000027056041],"category_scores_gemma":[0.00009669593,0.00006274753,0.000041987118,0.000083952466,0.000090809604,0.0004681726,0.00020094975,0.0000799102,0.000039376187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017571841,0.00044692136,0.0034303044,0.000104269435,0.00018248138,0.00010996335,0.0075217728,0.0012863298,0.010934587,0.2005501,0.010261085,0.7651546],"study_design_scores_gemma":[0.0013293469,0.00019884025,0.009650059,0.00008900384,0.0000103122175,0.000020029378,0.0000838751,0.9442507,0.024109488,0.014141051,0.005674027,0.00044325608],"about_ca_topic_score_codex":0.00007438108,"about_ca_topic_score_gemma":0.0000028347235,"teacher_disagreement_score":0.9429644,"about_ca_system_score_codex":0.000009521552,"about_ca_system_score_gemma":0.00004801689,"threshold_uncertainty_score":0.25587702},"labels":[],"label_agreement":null},{"id":"W2731797971","doi":"10.1007/978-3-319-62389-4_6","title":"Constrained Routing Between Non-Visible Vertices","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Combinatorics; Equal-cost multi-path routing; Set (abstract data type); Line segment; Line (geometry); Routing table; Algorithm; Mathematics; Computer network; Artificial intelligence; Routing protocol","score_opus":0.03226791445916056,"score_gpt":0.2866327263484828,"score_spread":0.25436481188932225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731797971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024702655,0.000077668585,0.9699111,0.0012434308,0.00090306555,0.00038087938,0.0000052711293,0.00015826501,0.027295632],"genre_scores_gemma":[0.38812432,0.000048673784,0.60842186,0.0009480439,0.00067631627,0.000008091371,0.000010373968,0.000041989075,0.0017203543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996276,0.00003284283,0.0005152308,0.0013767481,0.001009705,0.00078943296],"domain_scores_gemma":[0.99682516,0.00046698036,0.00040015235,0.0017325208,0.00030693554,0.00026823505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013030834,0.00044822093,0.0005511227,0.00063514727,0.00069597363,0.0018006102,0.005104827,0.00030323875,0.00003487042],"category_scores_gemma":[0.00019955714,0.00041157086,0.00012114337,0.00025471166,0.0009793952,0.001129399,0.0017967359,0.0008195613,0.00009632959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026949938,0.000019882307,0.00054911355,0.00005581667,0.000024826068,0.00008225787,0.0012127598,0.031116884,0.000080526705,0.023498533,0.000039002396,0.9433177],"study_design_scores_gemma":[0.00043612393,0.00016231037,0.00032970659,0.0005727234,0.000008814064,0.000020404037,1.641122e-7,0.9275494,0.00071481447,0.0678914,0.0015801353,0.0007339588],"about_ca_topic_score_codex":0.000032340777,"about_ca_topic_score_gemma":0.000030869494,"teacher_disagreement_score":0.94258374,"about_ca_system_score_codex":0.00016225166,"about_ca_system_score_gemma":0.00092868396,"threshold_uncertainty_score":0.99983364},"labels":[],"label_agreement":null},{"id":"W2733630045","doi":"10.1109/ipdps.2017.52","title":"Tight Load Balancing Via Randomized Local Search","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Load balancing (electrical power); Bin; Ball (mathematics); Randomized algorithm; Queueing theory; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algorithm; Statistics; Geometry","score_opus":0.02664937889080082,"score_gpt":0.29797194599999305,"score_spread":0.2713225671091922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733630045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026841535,0.00016960663,0.89957356,0.0027751343,0.0009016458,0.00080968655,0.0000015624627,0.00031496014,0.095427014],"genre_scores_gemma":[0.4823172,0.0006698165,0.46459398,0.0011846398,0.00037171532,0.00024922175,0.000042198233,0.000056796503,0.05051443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967852,0.00045702612,0.00043712216,0.00080476544,0.00096280465,0.0005530434],"domain_scores_gemma":[0.99692374,0.00025049795,0.00017697128,0.0018718041,0.00049761345,0.00027935015],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034351142,0.00028117246,0.0007420039,0.00015714187,0.00028741415,0.0011639935,0.0029031835,0.00028713106,0.00044911273],"category_scores_gemma":[0.00019595528,0.00021690557,0.00028740297,0.00009034331,0.00026532137,0.00032002133,0.0039962516,0.0008470982,0.0005080309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004393403,0.0004314924,0.00013729946,0.0009766733,0.0007605453,0.00026485193,0.006142476,0.3687938,0.00017025716,0.26169643,0.030079994,0.3261528],"study_design_scores_gemma":[0.020248162,0.000011264867,0.000009660453,0.000083898514,0.000006947562,0.000006552589,0.0000042599772,0.96759725,0.00024748853,0.009928664,0.0015731241,0.00028274165],"about_ca_topic_score_codex":0.0006289378,"about_ca_topic_score_gemma":0.00004298472,"teacher_disagreement_score":0.59880346,"about_ca_system_score_codex":0.00019302293,"about_ca_system_score_gemma":0.0009844069,"threshold_uncertainty_score":0.9998729},"labels":[],"label_agreement":null},{"id":"W273815955","doi":"","title":"Stochastic Optimal Harvesting Applied to Fisheries","year":2013,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fishery; Fishing; Computer science; Environmental science; Biology","score_opus":0.018152369329902145,"score_gpt":0.2060457504252967,"score_spread":0.18789338109539455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W273815955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23775853,0.000007776759,0.7556412,0.00090265146,0.00008065931,0.0002834856,0.0000025522759,0.00014624206,0.0051768534],"genre_scores_gemma":[0.8306422,0.0000013261669,0.16586137,0.0001843057,0.000022681847,0.0000018089041,0.0000052785067,0.00000891473,0.003272084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.000042625063,0.00013175957,0.00035377278,0.00032231663,0.00034677022],"domain_scores_gemma":[0.9989527,0.00009171127,0.000094943,0.00039887353,0.00021617832,0.0002455793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019624089,0.00013360361,0.00019635595,0.00018532941,0.0003765567,0.0002537815,0.0009161864,0.00006356157,0.00036935316],"category_scores_gemma":[0.000063806125,0.00016369198,0.000065917055,0.0005223033,0.00014781937,0.0010585939,0.00050885533,0.00013099279,0.00052416784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129308155,0.00006712019,0.00034546814,0.000033576092,0.000040565134,0.000004797293,0.00727596,0.057671245,0.00010510545,0.92954534,0.0039976332,0.000900229],"study_design_scores_gemma":[0.00049204624,0.000110971734,0.0017765512,0.00001714203,0.000008660607,0.0000049835903,0.002468241,0.079500236,0.000001971978,0.9148491,0.0004799812,0.00029012215],"about_ca_topic_score_codex":0.00039888575,"about_ca_topic_score_gemma":0.00009245647,"teacher_disagreement_score":0.5928837,"about_ca_system_score_codex":0.000057820256,"about_ca_system_score_gemma":0.000077521894,"threshold_uncertainty_score":0.6737292},"labels":[],"label_agreement":null},{"id":"W2740177778","doi":"10.24963/ijcai.2017/624","title":"A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Scalability; Computer science; Minimax; Grid; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.045848332633835906,"score_gpt":0.2729597083947184,"score_spread":0.22711137576088247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740177778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003956415,0.0000068598433,0.93689185,0.0007195005,0.00008856504,0.00040541764,0.0000010677164,0.000182984,0.057747316],"genre_scores_gemma":[0.55114454,0.0000015229168,0.44606358,0.00031485097,0.000018319117,0.000024296563,0.0000016864795,0.000008780239,0.002422429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986215,0.000032999927,0.0001415134,0.00045977,0.00032821548,0.0004159817],"domain_scores_gemma":[0.99856645,0.000036595935,0.0000765434,0.0009538094,0.000117427946,0.00024914645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029100687,0.00013260769,0.00014025962,0.00009320082,0.00082872156,0.0009977435,0.0012239475,0.000039127386,0.000021552909],"category_scores_gemma":[0.0001943533,0.00010211182,0.000029949517,0.00014416095,0.000041208943,0.0010153897,0.000585638,0.00009807005,0.000097266246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016456698,0.0024536059,0.30664185,0.00026874818,0.00022538513,0.00008493902,0.017505534,0.43990248,0.005712404,0.06013412,0.02002985,0.14687651],"study_design_scores_gemma":[0.00070805784,0.000046617246,0.0070925043,0.000020536836,0.0000011773772,0.0000047162366,0.000047628637,0.9883177,0.0008433458,0.0000674136,0.0026661737,0.000184071],"about_ca_topic_score_codex":0.00029715683,"about_ca_topic_score_gemma":0.00006817194,"teacher_disagreement_score":0.5484153,"about_ca_system_score_codex":0.00003288481,"about_ca_system_score_gemma":0.00004972553,"threshold_uncertainty_score":0.9621263},"labels":[],"label_agreement":null},{"id":"W2747422829","doi":"10.4230/lipics.approx-random.2017.5","title":"Scheduling Problems over Network of Machines","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Job shop scheduling; Computer science; Preemption; Scheduling (production processes); Flow shop scheduling; Schedule; Distributed computing; Mathematical optimization; Mathematics; Operating system","score_opus":0.025341678855584946,"score_gpt":0.29091071457535445,"score_spread":0.2655690357197695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747422829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031007739,0.00007906227,0.95116174,0.0008361419,0.0013328601,0.0013966027,0.0001017599,0.00022540095,0.013858699],"genre_scores_gemma":[0.68243825,0.00010480715,0.31544593,0.0007493246,0.00025877907,0.00010427098,0.00011159023,0.00004543453,0.0007415968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975142,0.000032733627,0.000979778,0.0002513026,0.000517504,0.00070446567],"domain_scores_gemma":[0.9969673,0.00008918496,0.00087078067,0.0014630763,0.0004110728,0.00019859022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009050869,0.00028804145,0.00041767635,0.00012065292,0.0008361579,0.00095404196,0.0023814011,0.00016340041,0.00003918834],"category_scores_gemma":[0.00018968078,0.0002482759,0.00021377721,0.00018340857,0.00017226905,0.0028627568,0.00095171866,0.000312739,0.00004883305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018984926,0.0011707521,0.15285583,0.0037707514,0.00082044676,0.000011529689,0.027375216,0.19556518,0.00030482718,0.483161,0.016826523,0.1179481],"study_design_scores_gemma":[0.0022481047,0.00017314967,0.0033718103,0.00027591153,0.000013788774,0.000012507569,0.00005377175,0.9634679,0.00019409014,0.004841163,0.02494556,0.00040222885],"about_ca_topic_score_codex":0.000031609456,"about_ca_topic_score_gemma":0.000021861222,"teacher_disagreement_score":0.76790273,"about_ca_system_score_codex":0.000046447654,"about_ca_system_score_gemma":0.000102008475,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2749237848","doi":"10.1016/j.jocs.2017.08.008","title":"On enhancing the object migration automaton using the Pursuit paradigm","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Benchmark (surveying); Automaton; Field (mathematics); Theoretical computer science; Cellular automaton; Learning automata; Task (project management); Graph; Realization (probability); Object (grammar); Artificial intelligence; Distributed computing; Mathematics","score_opus":0.03582544266573404,"score_gpt":0.3362522927853283,"score_spread":0.30042685011959425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749237848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108481795,0.000026409069,0.8729142,0.017416263,0.00054283405,0.00010322972,3.041169e-7,0.000011971749,0.00050299487],"genre_scores_gemma":[0.96964943,0.000005854291,0.029583244,0.0006453589,0.000086794345,8.7954635e-7,9.328092e-8,0.0000025179472,0.000025847403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798524,0.000091777336,0.00030661255,0.00014157147,0.0012849427,0.00018985051],"domain_scores_gemma":[0.99815357,0.00038974584,0.0006186486,0.00034804948,0.0004108748,0.00007909692],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032427597,0.000073063355,0.000089068206,0.00012024896,0.0023265427,0.0021283354,0.0029962289,0.000016590842,0.000006979161],"category_scores_gemma":[0.0004866488,0.00003763802,0.00006170686,0.00033454545,0.00039905857,0.0015923548,0.0001997769,0.00018920029,0.00000741131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044903813,0.000025435635,0.00011183535,0.0000015509598,0.0000059790887,0.0000036527158,0.00090113055,0.84356815,0.0009100028,0.14952037,0.00026443874,0.004682969],"study_design_scores_gemma":[0.00014338104,0.00007802875,0.013122561,0.000035774163,0.0000026912473,0.000108817396,0.000027948217,0.92896247,0.000684856,0.056484107,0.0002920054,0.000057336212],"about_ca_topic_score_codex":0.000014112839,"about_ca_topic_score_gemma":0.000008919567,"teacher_disagreement_score":0.8611676,"about_ca_system_score_codex":0.000091783375,"about_ca_system_score_gemma":0.0007388745,"threshold_uncertainty_score":0.9989723},"labels":[],"label_agreement":null},{"id":"W2751970538","doi":"10.1016/j.orl.2018.01.007","title":"On the complexity of instationary gas flows","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft","keywords":"Sequence (biology); Computer science; Biology","score_opus":0.1779869882226343,"score_gpt":0.37888232275254263,"score_spread":0.20089533452990832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751970538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16451678,0.000008028629,0.545798,0.27315652,0.00015205822,0.00075475854,0.000012495285,0.000064156535,0.01553716],"genre_scores_gemma":[0.94974387,0.000009872124,0.045961075,0.0038470842,0.00006846899,0.00006445556,0.00001076298,0.0000064356036,0.00028795243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981552,0.0005398931,0.00016412608,0.00020599658,0.0006896185,0.00024518897],"domain_scores_gemma":[0.9985375,0.00027551973,0.000012042219,0.0005573764,0.00055402314,0.00006356388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317504,0.000058248996,0.000062907966,0.00020781766,0.0007610189,0.00021897191,0.0008355007,0.000019607616,0.00032550236],"category_scores_gemma":[0.00034193083,0.000039935818,0.000026941045,0.00085180183,0.00085224374,0.00033134752,0.00020157141,0.00022480953,0.00033140203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005667325,0.000069388974,0.000013428097,0.0000033035046,0.000008966633,0.0000015530896,0.001157304,0.017195174,0.008686944,0.94102377,0.030581143,0.0012533517],"study_design_scores_gemma":[0.00017587985,0.00018734779,0.00034287717,0.000016349617,4.4764e-7,0.0000018518201,0.00006583456,0.98531884,0.0035387522,0.00645438,0.003826023,0.000071399314],"about_ca_topic_score_codex":0.00009855181,"about_ca_topic_score_gemma":0.00012473275,"teacher_disagreement_score":0.9681237,"about_ca_system_score_codex":0.000041386025,"about_ca_system_score_gemma":0.0001320012,"threshold_uncertainty_score":0.5853219},"labels":[],"label_agreement":null},{"id":"W2754604279","doi":"10.1007/s00453-017-0373-6","title":"Algorithms for Communication Scheduling in Data Gathering Network with Data Compression","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Job shop scheduling; Polynomial-time approximation scheme; Approximation algorithm; Computer science; Data compression; Scheduling (production processes); Mathematical optimization; Time complexity; Dynamic programming; Theory of computation; Wireless sensor network; Base station; Optimization problem; Data transmission; Algorithm; Mathematics; Computer network","score_opus":0.18964819929404286,"score_gpt":0.38079587530731945,"score_spread":0.1911476760132766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754604279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018699575,0.00021109056,0.99583817,0.0026312845,0.00012775582,0.0004333449,0.000035986457,0.00008469363,0.00045068443],"genre_scores_gemma":[0.0331138,0.00012651867,0.9660069,0.00011716156,0.0000953451,0.000027570466,0.00041305507,0.00001742698,0.000082233986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.000077175515,0.0002290494,0.00059505703,0.00021939195,0.00033523727],"domain_scores_gemma":[0.9925817,0.00016189966,0.00019028007,0.0068984423,0.00008738841,0.00008024549],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011386267,0.00012252499,0.00017120014,0.000047011577,0.0006990238,0.0006412219,0.008617163,0.000056994395,0.0000046085256],"category_scores_gemma":[0.00011813376,0.000105936604,0.000012109167,0.00012687856,0.000086388274,0.0022492951,0.0046609724,0.00019893929,0.000006790468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005635807,0.00028169644,0.0019900165,0.00007467445,0.000083612846,0.000017129869,0.0007247021,0.09289831,0.00010078572,0.014484932,0.0049934555,0.88429433],"study_design_scores_gemma":[0.00073939416,0.00002660326,0.00058202166,0.00015884858,0.000003958141,0.0000042443007,0.000017948947,0.98664933,0.000030993524,0.0011502812,0.010483975,0.00015241149],"about_ca_topic_score_codex":0.00014433473,"about_ca_topic_score_gemma":0.00016355759,"teacher_disagreement_score":0.893751,"about_ca_system_score_codex":0.000020591144,"about_ca_system_score_gemma":0.000082930026,"threshold_uncertainty_score":0.9967467},"labels":[],"label_agreement":null},{"id":"W2754752206","doi":"10.1016/j.tcs.2017.08.023","title":"A general framework for searching on a line","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Competitive analysis; Constant (computer programming); Search cost; Mathematics; Mathematical optimization; Line (geometry); Search problem; Upper and lower bounds; Fixed cost; Computer science","score_opus":0.048514790885910465,"score_gpt":0.3635690444791842,"score_spread":0.3150542535932737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754752206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027531814,0.0000029395014,0.9848952,0.008376999,0.00056363264,0.0002827908,0.0000017193034,0.00013262178,0.0029909092],"genre_scores_gemma":[0.464942,0.0000020648008,0.533928,0.0009093055,0.00017390828,0.000011102905,2.6655619e-7,0.0000047121393,0.000028635211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791515,0.00006174561,0.00016923508,0.00063817785,0.00061575137,0.00059993897],"domain_scores_gemma":[0.9975824,0.00037088263,0.000075578006,0.0014521896,0.00020758649,0.00031136585],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018259789,0.00013051725,0.00014800324,0.00013246553,0.0018597158,0.0021460725,0.004366049,0.000048764552,0.000019555211],"category_scores_gemma":[0.0006770394,0.000102161874,0.0000670691,0.00023320806,0.0018154496,0.00067618105,0.0012738552,0.00024356104,0.000052084073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008735407,0.000038883463,0.000010489831,0.0000042571137,0.0000018247875,0.0000029435953,0.0002212658,0.0021833961,0.000059863658,0.94064623,0.000037536516,0.056784548],"study_design_scores_gemma":[0.00013706155,0.00025798523,0.000113717026,0.000025192678,5.6742834e-7,0.0000028644704,5.2208213e-7,0.5895979,0.00080491055,0.40884104,0.00012975754,0.00008853066],"about_ca_topic_score_codex":0.0000018515077,"about_ca_topic_score_gemma":1.9412438e-7,"teacher_disagreement_score":0.58741444,"about_ca_system_score_codex":0.000034764118,"about_ca_system_score_gemma":0.0001285095,"threshold_uncertainty_score":0.9994397},"labels":[],"label_agreement":null},{"id":"W2754813051","doi":"10.1016/j.jcss.2017.10.005","title":"Use of information, memory and randomization in asynchronous gathering","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Construct (python library); Computer science; Asynchronous communication; Turing machine; Theoretical computer science; Grid; Finite-state machine; Algorithm; Mathematics; Programming language","score_opus":0.03790261855482626,"score_gpt":0.2688181432647735,"score_spread":0.23091552470994722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754813051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047163367,0.00046218012,0.9509454,0.00020721278,0.0007180373,0.00020801212,0.0000012544774,0.000009878988,0.000284698],"genre_scores_gemma":[0.8706501,0.0003498883,0.1288955,0.000028448674,0.000065309534,0.0000017919832,3.851699e-7,0.0000021701212,0.000006362019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983822,0.00017336608,0.00077399035,0.00014102767,0.00040920408,0.0001201895],"domain_scores_gemma":[0.99809426,0.00014668144,0.0011787805,0.00019375114,0.00031048068,0.00007602725],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024301233,0.000110224995,0.00043207544,0.00049876346,0.00013828669,0.0011901804,0.0006247603,0.00007335092,5.693445e-7],"category_scores_gemma":[0.000056823046,0.000081459046,0.00005221016,0.00012021883,0.00014495198,0.0022770236,0.0005359569,0.00017304032,2.634119e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065530716,0.0000576098,0.009258707,0.001805982,0.000072723175,0.00002415497,0.014847084,0.8060312,0.000023456061,0.015475459,0.00023010012,0.152108],"study_design_scores_gemma":[0.0009298349,0.00011131116,0.0040095644,0.0011366737,0.0000052457804,0.0001297487,0.00009825202,0.9929591,0.000020788311,0.0004168036,0.00007807225,0.000104651364],"about_ca_topic_score_codex":0.000040207015,"about_ca_topic_score_gemma":0.0000037044929,"teacher_disagreement_score":0.82348675,"about_ca_system_score_codex":0.000028467808,"about_ca_system_score_gemma":0.000256991,"threshold_uncertainty_score":0.9998467},"labels":[],"label_agreement":null},{"id":"W2762128374","doi":"10.1109/infocom.2017.8057149","title":"Single restart with time stamps for computational offloading in a semi-online setting","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Competitive analysis; Computer science; Scheduling (production processes); Heuristic; Task (project management); Computational complexity theory; Parallel computing; Server; Constant (computer programming); A priori and a posteriori; Asymptotically optimal algorithm; Online algorithm; Execution time; Time complexity; Distributed computing; Mathematical optimization; Algorithm; Upper and lower bounds; Mathematics; Artificial intelligence; Embedded system; Computer network","score_opus":0.03434765795284483,"score_gpt":0.293111656975736,"score_spread":0.25876399902289116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762128374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017264951,0.0000040670193,0.97452354,0.0040533505,0.00003149395,0.00027126956,0.0000069037474,0.00008627026,0.0037581308],"genre_scores_gemma":[0.27404103,7.1098196e-7,0.72374326,0.00030951021,0.000028498649,0.000011693935,0.000025026133,0.000008261152,0.001832029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991885,0.000023522696,0.00014764337,0.00022991287,0.00017615376,0.00023428239],"domain_scores_gemma":[0.99933857,0.00012797405,0.00008346711,0.0002756326,0.00012620274,0.000048185986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034910723,0.00007118478,0.00009322426,0.00008105754,0.00028865293,0.00038416428,0.00045228246,0.00002472543,0.00002209668],"category_scores_gemma":[0.000092853006,0.00005919791,0.000017875745,0.00008263464,0.000036030557,0.0006028429,0.00015071519,0.000063750944,0.000012367679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009685393,0.00082374294,0.023192791,0.0001126096,0.00005174235,0.000039491104,0.0026337043,0.8247339,0.0027152612,0.07949974,0.006801197,0.05929896],"study_design_scores_gemma":[0.00066078705,0.000099948375,0.001973311,0.000043600634,7.42544e-7,0.0000039425336,0.00001943485,0.99355596,0.00013902673,0.0024829272,0.00092203123,0.00009826334],"about_ca_topic_score_codex":0.000018775047,"about_ca_topic_score_gemma":0.000074616975,"teacher_disagreement_score":0.2567761,"about_ca_system_score_codex":0.000033828055,"about_ca_system_score_gemma":0.00008585798,"threshold_uncertainty_score":0.3704505},"labels":[],"label_agreement":null},{"id":"W2762426729","doi":"10.1007/978-3-319-73117-9_27","title":"Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Robot; Traverse; Computer science; Graph; Mobile robot; A priori and a posteriori; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Adversary; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.03790816574046223,"score_gpt":0.2490121587925893,"score_spread":0.21110399305212707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762426729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002419104,0.00013063951,0.9812869,0.00015649457,0.0005315101,0.0005393135,0.000014371091,0.00011042016,0.017206194],"genre_scores_gemma":[0.053376067,0.00048435494,0.9318122,0.00045658348,0.00013874845,0.00014739884,0.0000220248,0.00008548845,0.0134771075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971383,0.000029255598,0.00041155244,0.0010337905,0.0008574436,0.00052963867],"domain_scores_gemma":[0.99741596,0.00028143704,0.00037007613,0.0013143542,0.0004287024,0.00018948628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059598184,0.00036561087,0.00050252967,0.0008032279,0.0006009459,0.0006185848,0.0025442343,0.0001520564,0.000079157515],"category_scores_gemma":[0.000056882105,0.0003171654,0.00008474446,0.00062315876,0.0016288102,0.0010748637,0.00063718384,0.0005112812,0.000024777662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015098685,0.00013367695,0.000042452124,0.00009217574,0.00005705291,0.000054377684,0.0015848996,0.65583,0.00075748254,0.015614801,0.0007159993,0.32510197],"study_design_scores_gemma":[0.0011484356,0.0012618869,0.000017716136,0.0016142362,0.000019856034,0.00012849754,9.586649e-7,0.9354051,0.0071508666,0.046910446,0.004959199,0.0013828179],"about_ca_topic_score_codex":0.000032391024,"about_ca_topic_score_gemma":0.00002789382,"teacher_disagreement_score":0.32371914,"about_ca_system_score_codex":0.0001238696,"about_ca_system_score_gemma":0.00073455164,"threshold_uncertainty_score":0.99992806},"labels":[],"label_agreement":null},{"id":"W2763019392","doi":"10.1109/infocom.2017.8057085","title":"Efficient minimization of sum and differential costs on machines with job placement constraints","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Minification; Computer science; Algorithm; Mathematics; Discrete mathematics; Mathematical optimization; Combinatorics","score_opus":0.01672313873068668,"score_gpt":0.26577698374377,"score_spread":0.24905384501308334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763019392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21859169,0.000003125585,0.76448536,0.0007571772,0.000096829244,0.00024581337,0.000003388707,0.000032544864,0.015784077],"genre_scores_gemma":[0.98535645,0.0000050521417,0.014136882,0.00005132668,0.0000066325806,0.0000038722014,0.0000018455826,0.0000028867823,0.000435073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.0000256343,0.00010356253,0.00017235232,0.00020848488,0.000103988954],"domain_scores_gemma":[0.99946344,0.000028595548,0.00008400666,0.00029347805,0.000070944494,0.000059562743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007863943,0.000068860485,0.000085455875,0.00005075086,0.00016171095,0.0001660852,0.00024721498,0.000019450215,0.000079629535],"category_scores_gemma":[0.000023034485,0.000046287645,0.000010598076,0.000030868712,0.00014522311,0.000063418855,0.0001197217,0.00003503268,0.000003067243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033529382,0.0011336296,0.0663526,0.00014898229,0.00013979062,0.000017397198,0.002403931,0.11281882,0.0021976514,0.61489433,0.001414977,0.19814262],"study_design_scores_gemma":[0.0011957207,0.00022038643,0.034297395,0.000041746393,0.0000029915973,0.000002775806,0.00001700759,0.9629775,0.0010971788,0.00002992263,0.000025412102,0.00009192345],"about_ca_topic_score_codex":0.000019636967,"about_ca_topic_score_gemma":0.00001621829,"teacher_disagreement_score":0.8501587,"about_ca_system_score_codex":0.000010750045,"about_ca_system_score_gemma":0.000025230644,"threshold_uncertainty_score":0.18875553},"labels":[],"label_agreement":null},{"id":"W2765981104","doi":"10.1016/j.ipl.2018.04.006","title":"Reaching a target in the plane with no information","year":2018,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Multiplicative function; Plane (geometry); Bounded function; Binary logarithm; Trajectory; Combinatorics; Mathematics; Euclidean geometry; Euclidean distance; Computer science; Discrete mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.012523325368783537,"score_gpt":0.23126683504676068,"score_spread":0.21874350967797715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765981104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002850012,0.000009409951,0.9766907,0.009195705,0.00025233525,0.00059659255,0.000008039022,0.00022125799,0.010175924],"genre_scores_gemma":[0.40270692,0.000022222832,0.51377654,0.08127652,0.00028915837,0.00044521954,0.0014239731,0.000023668936,0.0000357756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980975,0.0001056889,0.0006056578,0.00015783872,0.00072850613,0.00030482365],"domain_scores_gemma":[0.9985582,0.000043018234,0.0005648884,0.0004821077,0.0003042563,0.00004747949],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011440442,0.00022161484,0.00016637913,0.00046731584,0.00023853083,0.0025971222,0.0012995005,0.0001270667,0.000009829328],"category_scores_gemma":[0.0000914432,0.00015089722,0.000032201504,0.00045298017,0.00007298058,0.009234715,0.00031319459,0.00070094556,0.00021621278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016422912,0.00012143029,0.0020846827,0.0039015312,0.00007021919,0.000016055406,0.32156855,0.46867567,0.00004233853,0.0052901222,0.07019455,0.12787062],"study_design_scores_gemma":[0.0006564698,0.0000675005,0.00078769017,0.00061908585,0.0000052826013,0.00003512209,0.00032963025,0.93913525,0.00003595545,0.0005816667,0.05728752,0.00045880486],"about_ca_topic_score_codex":0.000046115154,"about_ca_topic_score_gemma":0.0000029414832,"teacher_disagreement_score":0.4704596,"about_ca_system_score_codex":0.00010854515,"about_ca_system_score_gemma":0.00027255501,"threshold_uncertainty_score":0.9984383},"labels":[],"label_agreement":null},{"id":"W2766495319","doi":"10.1016/j.ifacol.2017.08.420","title":"Parameter Tuning for Prediction-based Quadcopter Trajectory Planning using Learning Automata","year":2017,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Quadcopter; Weighting; Control theory (sociology); Model predictive control; Computer science; Sequence (biology); Trajectory; Tracking (education); Function (biology); Tracking error; Control (management); Artificial intelligence; Engineering","score_opus":0.08699319490310632,"score_gpt":0.34465205873618926,"score_spread":0.25765886383308295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766495319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018804455,0.00004453573,0.97846997,0.0009452961,0.00043747012,0.00033020688,0.000024143388,0.0003906425,0.0005532917],"genre_scores_gemma":[0.1541141,0.0000034400825,0.8448737,0.00032945242,0.00017192108,0.000026782418,0.00004083484,0.00002615104,0.00041359212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984043,0.00008045282,0.0002808727,0.00048147055,0.00030772726,0.00044513406],"domain_scores_gemma":[0.9985403,0.00027964177,0.00023090726,0.00066886394,0.00012948466,0.00015079942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005334625,0.00019709958,0.0002200601,0.00014716589,0.001231988,0.0006592254,0.0008495974,0.00010846713,0.00003596766],"category_scores_gemma":[0.00044810286,0.00018885889,0.000120106946,0.000092699665,0.00008597438,0.0008217605,0.00013746988,0.00027361728,0.000011001994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009215218,0.0002308609,0.02795612,0.00018062229,0.00012439789,0.000041234216,0.0032679269,0.8936161,0.014535632,0.0007608807,0.000038030714,0.059156053],"study_design_scores_gemma":[0.0011036786,0.00014145269,0.0022119526,0.00011968208,0.000011792552,0.00000561093,0.00005896279,0.99473745,0.00027315196,0.000039839048,0.0010834865,0.00021293058],"about_ca_topic_score_codex":0.000033039116,"about_ca_topic_score_gemma":0.0000046384275,"teacher_disagreement_score":0.13530964,"about_ca_system_score_codex":0.000064393076,"about_ca_system_score_gemma":0.00015528502,"threshold_uncertainty_score":0.947558},"labels":[],"label_agreement":null},{"id":"W2774748477","doi":"10.1109/mlsp.2017.8168149","title":"Partitioning in signal processing using the object migration automaton and the pursuit paradigm","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Benchmark (surveying); Field (mathematics); Learning automata; Cellular automaton; Automaton; Process (computing); Task (project management); Theoretical computer science; Signal processing; Object (grammar); Artificial intelligence; Distributed computing; Programming language","score_opus":0.039454626781235694,"score_gpt":0.3027507960456966,"score_spread":0.2632961692644609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774748477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029948723,0.000119134114,0.94941056,0.017413585,0.000042411186,0.0003035123,1.3811002e-7,0.00006591125,0.0026960496],"genre_scores_gemma":[0.98871684,0.000016313088,0.010818067,0.00030880515,0.000019493917,0.000014794002,3.1547768e-7,0.0000027454325,0.00010264987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993044,0.000100514226,0.00012404971,0.00014240001,0.00018733025,0.00014128114],"domain_scores_gemma":[0.9995421,0.000065535394,0.00008869836,0.00025183577,0.000028094973,0.000023723827],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009107856,0.000055083307,0.0000651666,0.000030878942,0.0009997463,0.0021319652,0.00052358734,0.000021059743,0.00000891545],"category_scores_gemma":[0.000036582882,0.00002854374,0.000015549651,0.00009158495,0.00015442575,0.000874645,0.00015272529,0.00008676244,0.0000019663923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039354483,0.0000923696,0.022904698,0.00005754982,0.000022450746,0.00001184184,0.025103644,0.07767454,0.0008054981,0.71185595,0.00040022226,0.16103189],"study_design_scores_gemma":[0.00034886188,0.0000071657973,0.0042034504,0.000026261034,0.0000015091999,0.000007792923,0.00006869303,0.9889108,0.00016281338,0.00605717,0.00015884491,0.000046667],"about_ca_topic_score_codex":0.00024319437,"about_ca_topic_score_gemma":0.0002561055,"teacher_disagreement_score":0.95876807,"about_ca_system_score_codex":0.000014236168,"about_ca_system_score_gemma":0.000063837564,"threshold_uncertainty_score":0.99890393},"labels":[],"label_agreement":null},{"id":"W2775462516","doi":"10.1007/978-3-642-12200-2_59","title":"Layered Working-Set Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Theoretical computer science; Programming language","score_opus":0.031656926722692824,"score_gpt":0.2645210166984087,"score_spread":0.2328640899757159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775462516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013296218,0.00016387018,0.98308325,0.001949278,0.0020183662,0.00035947585,0.0000032081282,0.0002575886,0.012151694],"genre_scores_gemma":[0.07844991,0.000096036485,0.9156942,0.002593785,0.00064695685,0.000013934465,0.00001095703,0.000052033363,0.0024422097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620473,0.00003762678,0.00041745833,0.0014689495,0.0011216012,0.000749629],"domain_scores_gemma":[0.9972728,0.00035667996,0.00023291197,0.0016228923,0.0002481368,0.0002666044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094309135,0.0004762912,0.0004507455,0.0008981728,0.00033800094,0.0010312994,0.004462228,0.00045848792,0.00010803842],"category_scores_gemma":[0.00010217869,0.00042604608,0.00013059094,0.00073298404,0.00072893535,0.00052525604,0.0015453034,0.0014347641,0.00013507163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005584092,0.000037143895,0.000097420445,0.000022050905,0.000013492038,0.00010537322,0.001194418,0.06901806,0.0004687375,0.062684424,0.000101295445,0.866252],"study_design_scores_gemma":[0.00040914543,0.0001654314,0.00008670176,0.00029339586,0.0000041155836,0.00006520134,1.05181996e-7,0.7959472,0.0014186179,0.16995917,0.03071022,0.0009407119],"about_ca_topic_score_codex":0.000012313011,"about_ca_topic_score_gemma":0.00024167614,"teacher_disagreement_score":0.86531126,"about_ca_system_score_codex":0.00013469544,"about_ca_system_score_gemma":0.00058696663,"threshold_uncertainty_score":0.99981916},"labels":[],"label_agreement":null},{"id":"W2779139333","doi":"10.1137/1.9781611975031.47","title":"Strong Algorithms for the Ordinal Matroid Secretary Problem","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Secretary problem; Graphic matroid; Matroid partitioning; Rank (graph theory); Algorithm; Discrete mathematics; Competitive analysis; Upper and lower bounds; Mathematical optimization","score_opus":0.11112603762846568,"score_gpt":0.29825884007058834,"score_spread":0.18713280244212266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779139333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001730367,0.00005693719,0.9890481,0.00083160284,0.00044450676,0.005559072,0.00015770347,0.00017518281,0.0035538382],"genre_scores_gemma":[0.0013371274,0.00002699071,0.99232435,0.00023047572,0.0014165353,0.00250867,0.00007821741,0.00005846303,0.0020191849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979258,0.000013736004,0.0005525956,0.0006259593,0.00036411182,0.0005177891],"domain_scores_gemma":[0.9980547,0.0005953805,0.00039470522,0.00062725536,0.00019058549,0.00013736295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013712161,0.00038263688,0.00047389054,0.000034174845,0.0007041302,0.0006539547,0.0011063832,0.0005624732,0.0000067505084],"category_scores_gemma":[0.00003013714,0.00027048934,0.0005126301,0.0000628166,0.00025924883,0.0000538993,0.0012103101,0.00064971804,0.0000025193638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006437227,0.00016427685,0.0000012117039,0.0020119993,0.0011543654,3.0065496e-7,0.011439761,0.0017501458,0.00018760293,0.8140624,0.06012412,0.10903945],"study_design_scores_gemma":[0.0024125,0.00020613518,2.458864e-7,0.00019159638,0.0002135599,0.0000052833907,0.0010996953,0.58638334,0.00063943915,0.3893788,0.018866036,0.00060338277],"about_ca_topic_score_codex":0.0000057645802,"about_ca_topic_score_gemma":0.0000014035297,"teacher_disagreement_score":0.5846332,"about_ca_system_score_codex":0.000053120402,"about_ca_system_score_gemma":0.00033863902,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2779959840","doi":"10.1007/978-3-319-72751-6_8","title":"Energy-Optimal Broadcast in a Tree with Mobile Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Tree (set theory); Node (physics); Mobile agent; Broadcasting (networking); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Root (linguistics); Energy (signal processing); Algorithm; Theoretical computer science; Distributed computing; Combinatorics; Computer network; Mathematics; Artificial intelligence","score_opus":0.021197720684144168,"score_gpt":0.26003828623646036,"score_spread":0.2388405655523162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779959840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043852455,0.000208796,0.98490703,0.00033235413,0.00049380946,0.00037358378,0.000003366727,0.00009954282,0.013537658],"genre_scores_gemma":[0.12538186,0.00024133122,0.8665839,0.0017168057,0.00033620116,0.00007926976,0.000014002072,0.000074937765,0.005571725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961567,0.000041652875,0.00041636304,0.0015302125,0.0010860644,0.0007690039],"domain_scores_gemma":[0.9973644,0.00015211926,0.00028600762,0.0017620483,0.00020734903,0.00022810348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061941857,0.00048809842,0.00049820496,0.0009819565,0.00029593892,0.0010331293,0.004328012,0.00025993062,0.000043131287],"category_scores_gemma":[0.000028831553,0.0004067471,0.0000830369,0.0003812434,0.0007447674,0.0009321425,0.0013851637,0.00067101605,0.000031227737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009802748,0.00004732901,0.000097929886,0.000016926331,0.0000071841637,0.00023934926,0.0008129389,0.24755244,0.000011411554,0.004946215,0.000035747886,0.74622273],"study_design_scores_gemma":[0.0006400165,0.00039715474,0.00010520444,0.00043990253,0.0000030045728,0.00006961686,1.9332072e-7,0.97812915,0.0001789564,0.009307814,0.010087126,0.0006418727],"about_ca_topic_score_codex":0.000081004706,"about_ca_topic_score_gemma":0.0004919479,"teacher_disagreement_score":0.74558085,"about_ca_system_score_codex":0.000249605,"about_ca_system_score_gemma":0.0007146187,"threshold_uncertainty_score":0.9998384},"labels":[],"label_agreement":null},{"id":"W2783332435","doi":"10.1109/ictcs.2017.40","title":"On Utilizing the Pursuit Paradigm to Enhance the Deadlock-Preventing Object Migration Automaton","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Deadlock; Computer science; Automaton; Cellular automaton; Object (grammar); Distributed computing; Theoretical computer science; Field (mathematics); Property (philosophy); Learning automata; State (computer science); Artificial intelligence; Algorithm; Mathematics","score_opus":0.030155251228476985,"score_gpt":0.32944596149850136,"score_spread":0.29929071027002435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783332435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029307311,0.00003372251,0.82417035,0.0879553,0.00044754468,0.0007833586,5.732504e-7,0.000287276,0.05701453],"genre_scores_gemma":[0.9853875,0.000012311374,0.009007489,0.0022864917,0.000041333806,0.00004516902,4.995104e-7,0.000006234655,0.0032129474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880695,0.000112709204,0.00015964419,0.00027206636,0.0003869109,0.00026173342],"domain_scores_gemma":[0.99841195,0.00018894587,0.000104560866,0.0011895394,0.000045172423,0.00005980012],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010048368,0.000096344076,0.00007554045,0.0000349732,0.0014474335,0.0017093311,0.0023100886,0.000028023329,0.000033978955],"category_scores_gemma":[0.0002593148,0.00005023895,0.000049211325,0.00013445997,0.000041339088,0.00043942998,0.00041032973,0.00012913253,0.00019114604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068710856,0.000058673824,0.0003898183,0.000009714442,0.000021278258,0.0000032311248,0.0034835471,0.008985695,0.0009490872,0.8416747,0.014183551,0.13023382],"study_design_scores_gemma":[0.00013669324,0.00010959536,0.006509131,0.00006829921,0.0000039828446,0.0000061340916,0.00012372447,0.9494603,0.013208918,0.012145988,0.018007383,0.0002198004],"about_ca_topic_score_codex":0.00012540302,"about_ca_topic_score_gemma":0.00033181263,"teacher_disagreement_score":0.9560802,"about_ca_system_score_codex":0.000023732882,"about_ca_system_score_gemma":0.000045534674,"threshold_uncertainty_score":0.99985254},"labels":[],"label_agreement":null},{"id":"W278336051","doi":"10.1007/s10489-015-0670-1","title":"A formal proof of the 𝜖-optimality of discretized pursuit algorithms","year":2015,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Computer science; Algorithm; Discretization; Formal proof; Monotonic function; Action (physics); Proof of concept; Mathematics","score_opus":0.05193330201294354,"score_gpt":0.2882998452492054,"score_spread":0.23636654323626183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278336051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010804614,0.000035292298,0.9824101,0.00036799218,0.000107041946,0.00042839663,0.0000032592616,0.000030723946,0.015536767],"genre_scores_gemma":[0.892129,0.0000068039626,0.10753897,0.00008722072,0.000011980204,0.000033124445,0.0000011832282,0.0000052031364,0.00018649081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858475,0.000049435046,0.00037122716,0.00021310382,0.00054992916,0.00023154114],"domain_scores_gemma":[0.99880713,0.000056398472,0.00018736298,0.00062587543,0.00022979341,0.00009342163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576582,0.00009665697,0.00017224588,0.00004396086,0.00004674587,0.000034572848,0.0015781388,0.000046229277,0.000020914867],"category_scores_gemma":[0.00007856031,0.00006432266,0.00006249759,0.0005710209,0.0002136446,0.00023762972,0.00061664055,0.0001196764,0.0000098491855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004571744,0.00022731676,0.00020753004,0.00006034085,0.000026790487,5.746399e-7,0.004372397,0.025469702,0.0015856164,0.83356005,0.0004337069,0.13401023],"study_design_scores_gemma":[0.00037229402,0.00020205704,0.00025055627,0.00004013736,0.000008538498,0.0000056126014,0.00041777518,0.49051657,0.45332432,0.053163663,0.001458399,0.0002400698],"about_ca_topic_score_codex":0.000030426047,"about_ca_topic_score_gemma":0.0000032242651,"teacher_disagreement_score":0.89104855,"about_ca_system_score_codex":0.000021421949,"about_ca_system_score_gemma":0.00016098967,"threshold_uncertainty_score":0.29326007},"labels":[],"label_agreement":null},{"id":"W2783784097","doi":"","title":"Cognitive intelligent personal assistants / agents","year":2017,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Personal information management; Personally identifiable information; World Wide Web; Context (archaeology); Human–computer interaction; Cognition; Intelligent agent; Information system; Computer security; Artificial intelligence; Management information systems; Engineering; Psychology","score_opus":0.03627925197326099,"score_gpt":0.28279087176093004,"score_spread":0.24651161978766906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783784097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016053012,0.00004911341,0.9826762,0.00022307436,0.00066962733,0.000097044714,0.0000017212129,0.00015426165,0.00007595858],"genre_scores_gemma":[0.74477124,0.000040161845,0.25474292,0.0002850473,0.000077817225,0.0000051095362,8.156608e-7,0.000007221088,0.00006966939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986891,0.000010419421,0.00011865778,0.00042672444,0.00041052428,0.00034453563],"domain_scores_gemma":[0.999043,0.0000740897,0.000052769108,0.00034354976,0.0002586499,0.00022793064],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006447384,0.00011922088,0.00011167767,0.00015025919,0.00073987315,0.0015421144,0.0011472492,0.000028690582,0.0000062719046],"category_scores_gemma":[0.0004455876,0.00011171906,0.000025851235,0.00020273033,0.0002093869,0.001431009,0.00091375114,0.0001178505,0.000019538385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003216964,0.00006447749,0.008837356,0.00004675458,0.000026272788,0.000057052315,0.0034128744,0.0033557997,0.00010925779,0.0066938004,0.00046329573,0.97692984],"study_design_scores_gemma":[0.00015372765,0.00003759651,0.04174012,0.00006990219,0.0000014721268,0.000015010701,0.0000058778414,0.95668834,0.00020730172,0.000065198976,0.0008504668,0.00016496528],"about_ca_topic_score_codex":0.000004760616,"about_ca_topic_score_gemma":6.0545875e-7,"teacher_disagreement_score":0.97676486,"about_ca_system_score_codex":0.000042278803,"about_ca_system_score_gemma":0.00011476553,"threshold_uncertainty_score":0.9994944},"labels":[],"label_agreement":null},{"id":"W2786984082","doi":"10.1142/s1793830918500258","title":"Asymptotically optimal scheduling of random malleable demands in smart grid","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Scheduling (production processes); Mathematics; Time horizon; Regular polygon; Bounded function; Grid; Computer science","score_opus":0.015262041106588185,"score_gpt":0.27295208666951287,"score_spread":0.2576900455629247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786984082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020798862,0.000058562866,0.9927392,0.00047675672,0.000023604867,0.00042414662,0.0000070311485,0.00004343418,0.0041473885],"genre_scores_gemma":[0.0809211,0.00008814723,0.9185127,0.000056573004,0.000069245885,0.0001575344,0.0000087780845,0.0000117827185,0.00017411991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989303,0.000021962953,0.0003857494,0.0002548599,0.00019497993,0.00021214681],"domain_scores_gemma":[0.9991699,0.00012078285,0.00010315716,0.00036028438,0.0001503388,0.00009552654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046444547,0.00010874926,0.00020949722,0.000112552,0.00012789338,0.00010761035,0.000369772,0.000053331954,0.000024676907],"category_scores_gemma":[0.000037018915,0.00009400347,0.00003826623,0.0004191327,0.00014753429,0.00018590759,0.00018668572,0.000091622234,0.000016932348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008177064,0.0003433561,0.0002793676,0.00017241745,0.000038434366,0.0000012755149,0.0022146292,0.004132972,0.0005655733,0.9771665,0.00006708027,0.015010246],"study_design_scores_gemma":[0.0006862421,0.000057487196,0.00013014914,0.00004661749,0.000006292685,0.0000056751824,0.0001273781,0.9836722,0.00045779347,0.0137381395,0.0009452009,0.0001267946],"about_ca_topic_score_codex":0.000008219593,"about_ca_topic_score_gemma":0.0000046166715,"teacher_disagreement_score":0.9795393,"about_ca_system_score_codex":0.00001007437,"about_ca_system_score_gemma":0.00004343834,"threshold_uncertainty_score":0.38333502},"labels":[],"label_agreement":null},{"id":"W278851003","doi":"10.1007/978-3-642-30347-0_1","title":"Distributed Algorithms by Forgetful Mobile Robots","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Snapshot (computer storage); Robot; Computer science; Mobile robot; Scratch; Distributed computing; Distributed algorithm; Algorithm; Artificial intelligence; Real-time computing; Operating system","score_opus":0.01648801243812546,"score_gpt":0.2559231648571692,"score_spread":0.23943515241904376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278851003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003871752,0.0014712332,0.99417686,0.00062268384,0.0013371619,0.0006295621,0.000043268723,0.0002615445,0.0014538285],"genre_scores_gemma":[0.017952291,0.00042782773,0.9766186,0.0020655952,0.00065562973,0.00007574978,0.00017229437,0.00008566406,0.0019463598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957954,0.000046157285,0.00053642876,0.0013728157,0.0011930987,0.001056049],"domain_scores_gemma":[0.9973608,0.0002802437,0.00025412356,0.0013721302,0.0003207329,0.00041195322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009182227,0.00054141006,0.00050545967,0.00050063693,0.00031444657,0.00068381,0.0035472545,0.00037364158,0.00009281217],"category_scores_gemma":[0.000053103773,0.0004917409,0.00013451312,0.000781526,0.0005639478,0.0010605439,0.0015535045,0.0008328705,0.00012908349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023932835,0.000074255564,0.000039608673,0.000029591403,0.00001340039,0.000022051665,0.00040562218,0.11983072,0.00008541461,0.0075438414,0.0008004976,0.8711526],"study_design_scores_gemma":[0.00035330097,0.00020180577,0.000018929044,0.00014739048,0.000006437098,0.00003312735,1.6186125e-7,0.93452173,0.0010427607,0.030310104,0.032472637,0.0008916314],"about_ca_topic_score_codex":0.000016043676,"about_ca_topic_score_gemma":0.000012738046,"teacher_disagreement_score":0.87026095,"about_ca_system_score_codex":0.00031914577,"about_ca_system_score_gemma":0.00037778157,"threshold_uncertainty_score":0.9997534},"labels":[],"label_agreement":null},{"id":"W2793208001","doi":"10.1142/s0218195917500066","title":"Competitive Online Routing on Delaunay Triangulations","year":2017,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Combinatorics; Bowyer–Watson algorithm; Mathematics; Pitteway triangulation; Competitive analysis; Chew's second algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.03124044391697462,"score_gpt":0.35422964422401154,"score_spread":0.3229892003070369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793208001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001631671,0.00004875087,0.9815444,0.008712639,0.0004973702,0.0002935531,0.000069379195,0.00004747515,0.007154763],"genre_scores_gemma":[0.82403505,0.000034806268,0.17409934,0.0007479001,0.00069270306,0.000030288493,0.000075305084,0.0000133912445,0.00027123545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976144,0.000071336,0.0007215049,0.0002661245,0.0011365322,0.00019009189],"domain_scores_gemma":[0.99532837,0.00053550093,0.0011311718,0.00043519327,0.002396132,0.00017366203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276132,0.00015741665,0.00021771593,0.0006453332,0.00057177304,0.0007550316,0.0026475212,0.00006219934,0.00008174068],"category_scores_gemma":[0.0002804389,0.00015206619,0.00019030877,0.0002955497,0.00012135632,0.00097292446,0.0002771899,0.00032566697,0.00008522485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023176462,0.00044133718,0.0006838086,0.0000031666816,0.00016335411,0.000014029607,0.00010175762,0.15573087,0.000041124043,0.7754971,0.00034172783,0.06695858],"study_design_scores_gemma":[0.0060748225,0.00051057385,0.09716597,0.00028769698,0.00006295003,0.0005350193,0.00026138773,0.35446075,0.00041173433,0.26873997,0.27058616,0.0009029658],"about_ca_topic_score_codex":0.000006664074,"about_ca_topic_score_gemma":0.000004107999,"teacher_disagreement_score":0.8224034,"about_ca_system_score_codex":0.00014934751,"about_ca_system_score_gemma":0.00028250704,"threshold_uncertainty_score":0.72807866},"labels":[],"label_agreement":null},{"id":"W2794549768","doi":"10.4230/lipics.opodis.2017.11","title":"Evacuating an Equilateral Triangle in the Face-to-Face Model","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Robot; Upper and lower bounds; Equilateral triangle; Face (sociological concept); Combinatorics; Computer science; Boundary (topology); Mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.052625107559147274,"score_gpt":0.33286018274123674,"score_spread":0.28023507518208945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794549768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10912052,0.000006198419,0.88184565,0.0016672845,0.00032623313,0.0015522308,0.000077034674,0.00016437165,0.005240445],"genre_scores_gemma":[0.8798011,0.0000046216464,0.114579424,0.004855534,0.00011716526,0.00014513831,0.00009320017,0.000026136395,0.00037768102],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719864,0.00011175471,0.00090946065,0.0003084124,0.00062473066,0.00084702915],"domain_scores_gemma":[0.9981622,0.000110426336,0.00021509774,0.0010003876,0.0002790319,0.00023285983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017992433,0.00028830284,0.0003089726,0.0003150809,0.0004116658,0.00094330916,0.0023668471,0.00013509054,0.000023543203],"category_scores_gemma":[0.00013820628,0.00021393334,0.000118478965,0.00068415666,0.00008921382,0.0027325025,0.00052685663,0.00033643917,0.00023452808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003354635,0.0013031666,0.002186987,0.00040693567,0.0001276612,0.000010910153,0.61740446,0.2247853,0.00047997924,0.07736418,0.013436034,0.06215891],"study_design_scores_gemma":[0.0016752387,0.00045008902,0.00012256076,0.000051721498,0.0000044981784,0.000012633977,0.0016940737,0.9897702,0.0002505977,0.0014424673,0.0042296164,0.00029630656],"about_ca_topic_score_codex":0.000016946504,"about_ca_topic_score_gemma":0.00004894206,"teacher_disagreement_score":0.7706806,"about_ca_system_score_codex":0.00009570247,"about_ca_system_score_gemma":0.000114501716,"threshold_uncertainty_score":0.9096352},"labels":[],"label_agreement":null},{"id":"W2796213503","doi":"10.22215/etd/2017-12063","title":"Foraging in the Presence of Obstacles","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Foraging; Treasure; Computer science; Nesting (process); NetLogo; Bounded function; Simple (philosophy); Ant colony; Artificial intelligence; Algorithm; Ecology; Mathematics; Geography; Ant colony optimization algorithms; Engineering; Biology","score_opus":0.03627462314657589,"score_gpt":0.32604772841963553,"score_spread":0.28977310527305966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796213503","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005281969,0.00045810803,0.12445518,0.0014548325,0.00077639695,0.0009043137,0.0000024245066,0.00007820553,0.8665886],"genre_scores_gemma":[0.9110064,0.00027575638,0.027718438,0.00017289365,0.00003154747,0.000064310014,0.00006788943,0.00001249285,0.0606503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928737,0.0000518212,0.00014628547,0.00015039985,0.00025569825,0.00010842142],"domain_scores_gemma":[0.9991521,0.000097104516,0.00012401215,0.00053623243,0.00007653252,0.0000139893855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034658358,0.000064278414,0.00009491658,0.00008714351,0.000068634974,0.00017507203,0.0016861171,0.00004967558,0.000021989074],"category_scores_gemma":[0.00010182216,0.000041444957,0.000030458365,0.000106304666,0.000015813222,0.0002829296,0.000033901906,0.00012317667,0.000005313674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013150607,0.0001722248,0.0012552124,0.00046548754,0.000022358985,0.000021633174,0.04563354,0.0022932333,0.0003261264,0.68645126,0.006880494,0.25646532],"study_design_scores_gemma":[0.001346991,0.00022338737,0.05439028,0.0015101974,0.000017305212,0.000008925272,0.010005617,0.81140983,0.008430269,0.081766516,0.029702868,0.0011877947],"about_ca_topic_score_codex":0.00013960108,"about_ca_topic_score_gemma":0.00043627917,"teacher_disagreement_score":0.9057244,"about_ca_system_score_codex":0.000005149293,"about_ca_system_score_gemma":0.000084757536,"threshold_uncertainty_score":0.31332532},"labels":[],"label_agreement":null},{"id":"W2796790483","doi":"10.1007/s10878-009-9236-7","title":"The robot cleans up","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Eulerian path; Enhanced Data Rates for GSM Evolution; Weighting; Theory of computation; Property (philosophy); Computer science; Graph; Robot; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Lagrangian; Physics; Applied mathematics","score_opus":0.011572052617344274,"score_gpt":0.25832733421325754,"score_spread":0.24675528159591326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796790483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044128712,0.00011306232,0.98629653,0.0068256482,0.0048089563,0.00010024008,1.1855773e-7,0.000033467666,0.0017778336],"genre_scores_gemma":[0.5516163,0.0012991573,0.4442181,0.0009846577,0.0010883426,0.0000025214445,0.000002511189,0.000020188256,0.00076818775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859583,0.00014829052,0.00046348825,0.000097154174,0.00050829665,0.00018695855],"domain_scores_gemma":[0.9984381,0.000121377605,0.00039326717,0.00023966847,0.0006950417,0.00011255256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087805087,0.00008914085,0.00014195885,0.00010441157,0.00028083875,0.0004295431,0.00081259623,0.00005793124,0.000010226923],"category_scores_gemma":[0.00024396533,0.000060613027,0.00009010067,0.00046269305,0.000027526006,0.0008940556,0.000041470477,0.00020706575,0.0000051197526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036705605,0.00007106765,0.0000094799825,0.0000010471487,0.00001191002,0.0000039761353,0.00022381116,0.7126184,0.000048726914,0.27065954,0.0033538279,0.0129615115],"study_design_scores_gemma":[0.0023274766,0.0009803155,0.00020594453,0.000029791361,0.000012269566,0.000053788604,0.000038447146,0.9149472,0.0003842374,0.06776986,0.0130701475,0.00018048918],"about_ca_topic_score_codex":6.0654133e-7,"about_ca_topic_score_gemma":6.9651115e-8,"teacher_disagreement_score":0.5515722,"about_ca_system_score_codex":0.0000578123,"about_ca_system_score_gemma":0.00015362744,"threshold_uncertainty_score":0.41420943},"labels":[],"label_agreement":null},{"id":"W2799364841","doi":"10.1007/978-3-030-01325-7_14","title":"Symmetric Rendezvous with Advice: How to Rendezvous in a Disk","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Rendezvous; Conjecture; Computer science; Energy (signal processing); Simple (philosophy); Point (geometry); Algorithm; Upper and lower bounds; Advice (programming); Line (geometry); Robot; Mathematics; Combinatorics; Geometry; Physics; Artificial intelligence; Mathematical analysis; Statistics","score_opus":0.01755097974014902,"score_gpt":0.27191666665615516,"score_spread":0.25436568691600614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799364841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044386704,0.00014116215,0.9853184,0.007283581,0.0014016737,0.0009516849,0.000007708576,0.00029654903,0.00016055218],"genre_scores_gemma":[0.47644526,0.000020435811,0.5221053,0.0011720513,0.00016559225,0.000056976245,0.0000033896267,0.000018711567,0.0000123244145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937599,0.0002416846,0.0005022143,0.0026029837,0.0016281321,0.0012651286],"domain_scores_gemma":[0.99606895,0.00038684413,0.0002525305,0.0023358571,0.0005255191,0.00043029708],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018636753,0.0005698346,0.0006138216,0.0029865862,0.00022458607,0.0019295149,0.006009283,0.00030354102,0.00000836842],"category_scores_gemma":[0.0005207002,0.0004693567,0.000080577214,0.010595367,0.00047641568,0.00073497964,0.005692386,0.0012927176,0.000030127285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020772775,0.00016414512,0.0021914977,0.000086615146,0.000009689593,0.00015211171,0.0038599542,0.69483066,0.000037559097,0.00051099644,0.00018398695,0.297952],"study_design_scores_gemma":[0.00047225083,0.000479164,0.003343228,0.00047065684,0.0000031689642,0.00005064751,0.0000013662337,0.9848246,0.000525103,0.008861081,0.0002305377,0.0007382169],"about_ca_topic_score_codex":0.00027295446,"about_ca_topic_score_gemma":0.001079907,"teacher_disagreement_score":0.4720066,"about_ca_system_score_codex":0.00057863526,"about_ca_system_score_gemma":0.0012412302,"threshold_uncertainty_score":0.9997758},"labels":[],"label_agreement":null},{"id":"W2802261039","doi":"10.1016/j.tcs.2018.04.022","title":"Approximation and complexity of multi-target graph search and the Canadian traveler problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Graph; Computer science; Approximation algorithm; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.039379010213812085,"score_gpt":0.27466528492848,"score_spread":0.23528627471466795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802261039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077860323,0.00002156321,0.98580694,0.0036669536,0.000067096254,0.00037934686,0.0000020048067,0.000033739343,0.002236325],"genre_scores_gemma":[0.6358315,0.0000041373705,0.3638827,0.00025613193,0.00001533189,0.000003409607,3.691497e-7,0.0000022512247,0.000004179833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00021178271,0.00020074892,0.00039473598,0.0004535375,0.0003915755],"domain_scores_gemma":[0.9988157,0.00009175914,0.000034673518,0.00036481288,0.00038034277,0.0003127034],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028486282,0.000100802645,0.00014996562,0.00019984724,0.00076377334,0.0004148422,0.00096335233,0.00003657165,0.000019255938],"category_scores_gemma":[0.00004764365,0.000064735344,0.000020697835,0.00083601306,0.018515224,0.00037485658,0.0004920376,0.00014300845,0.000005293011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060150965,0.0000148063555,0.00007908883,0.000009140515,0.000001908757,3.6662811e-7,0.0024863814,0.00008869741,0.00004606444,0.98951507,0.0000061487053,0.0077463086],"study_design_scores_gemma":[0.00044231143,0.00008999603,0.001912737,0.000010352607,0.0000011966888,0.000011133229,0.000009974909,0.81104565,0.0006615383,0.18572655,0.000015414635,0.000073167896],"about_ca_topic_score_codex":0.0016374331,"about_ca_topic_score_gemma":0.0011306821,"teacher_disagreement_score":0.8109569,"about_ca_system_score_codex":0.000024131583,"about_ca_system_score_gemma":0.0002182996,"threshold_uncertainty_score":0.98415583},"labels":[],"label_agreement":null},{"id":"W2802275843","doi":"10.1109/access.2018.2827305","title":"On Invoking Transitivity to Enhance the &lt;italic&gt;Pursuit&lt;/italic&gt;-Oriented Object Migration Automata","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Computer science; Theoretical computer science; Pairwise comparison; Automaton; Phenomenon; Markov chain; Transitive closure; Algorithm; Discrete mathematics; Combinatorics; Artificial intelligence; Mathematics; Machine learning","score_opus":0.02383690043812528,"score_gpt":0.3278256711858171,"score_spread":0.3039887707476918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802275843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27779022,0.000020566185,0.7105249,0.0047781365,0.0011417373,0.00067712343,0.000014421374,0.00039145845,0.0046614055],"genre_scores_gemma":[0.99277794,0.000016762864,0.0030044268,0.0033539291,0.00025129647,0.00009690581,0.00001075499,0.000023099998,0.0004648586],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725044,0.0002932457,0.00035608732,0.0007144328,0.0008520314,0.0005337694],"domain_scores_gemma":[0.9980114,0.00022445346,0.00013859286,0.0010827933,0.0003551752,0.00018759127],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095543335,0.0002558528,0.0002205046,0.00020351783,0.00055859966,0.0011025408,0.00216,0.000097795164,0.000039991814],"category_scores_gemma":[0.00017133052,0.00019669646,0.00008541672,0.001456903,0.00013505711,0.0017858926,0.00026644,0.0001908266,0.00021266371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004852351,0.0021354917,0.0012074489,0.0002543583,0.00035376035,0.00012448513,0.06006967,0.03662869,0.30405664,0.2163253,0.14028111,0.23807782],"study_design_scores_gemma":[0.0010496161,0.0011335316,0.0063516013,0.00030268662,0.000026344673,0.000025079238,0.00006591687,0.7208917,0.22982998,0.0033358538,0.03586747,0.0011202124],"about_ca_topic_score_codex":0.00011680787,"about_ca_topic_score_gemma":0.0010791852,"teacher_disagreement_score":0.71498775,"about_ca_system_score_codex":0.0000968685,"about_ca_system_score_gemma":0.0001226341,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W2802892321","doi":"10.1177/0278364918772024","title":"Active sensing for motion planning in uncertain environments via mutual information policies","year":2018,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Scalability; Motion planning; A priori and a posteriori; Computer science; Graph; Path (computing); Mathematical optimization; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.10789083253299162,"score_gpt":0.4120741131170773,"score_spread":0.3041832805840857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802892321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006665426,0.000009003915,0.9835753,0.008802665,0.00033049777,0.00015819015,0.000001720072,0.0000044826297,0.0004527252],"genre_scores_gemma":[0.9358476,0.000030911433,0.06327237,0.00038597602,0.0003239353,0.0000021254993,0.0000047160456,0.000005556655,0.00012685357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981544,0.0001632325,0.00032245592,0.0000695628,0.0010734781,0.0002168979],"domain_scores_gemma":[0.9981894,0.0003963985,0.00016725509,0.00011673855,0.001079275,0.000050936844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021840744,0.00005593249,0.0000770236,0.00053494575,0.00014653645,0.00026241475,0.00094498234,0.000035513818,0.0000059443996],"category_scores_gemma":[0.0005107422,0.00004142265,0.000036672827,0.00025131766,0.00012634328,0.0010418823,0.00023623592,0.00028586268,0.000017839011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033617375,0.00010019597,0.000443472,0.0000081135895,0.00010072166,0.000014351448,0.019500013,0.81290966,0.0029703628,0.020129962,0.001570778,0.1419162],"study_design_scores_gemma":[0.00061493507,0.00022202784,0.001148062,0.000057330035,0.0000013926406,0.000054256736,0.00066901284,0.9833187,0.0025945592,0.009230457,0.002033717,0.000055535984],"about_ca_topic_score_codex":0.000034529032,"about_ca_topic_score_gemma":0.0000071283675,"teacher_disagreement_score":0.9291821,"about_ca_system_score_codex":0.0002866514,"about_ca_system_score_gemma":0.00011745201,"threshold_uncertainty_score":0.25304714},"labels":[],"label_agreement":null},{"id":"W2803003248","doi":"10.1007/s12083-018-0656-y","title":"Connectivity preserving obstacle avoidance localized motion planning algorithms for mobile wireless sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Wireless sensor network; Motion planning; Probabilistic logic; Obstacle avoidance; Cellular network; Wireless network; Distributed algorithm; Wireless; Real-time computing; Distributed computing; Computer network; Mobile robot; Artificial intelligence; Telecommunications; Robot","score_opus":0.037207322528434277,"score_gpt":0.32187880180464234,"score_spread":0.28467147927620806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803003248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031357305,0.00012062182,0.99131715,0.002511491,0.00029264888,0.0017655756,0.000013302478,0.00033412754,0.00050936226],"genre_scores_gemma":[0.76613003,0.000016700296,0.22645983,0.00096514623,0.0016662118,0.0026609765,0.000050990653,0.000042005726,0.00200809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997997,0.000085105836,0.00029157955,0.00071378675,0.00036294264,0.00054961746],"domain_scores_gemma":[0.9978966,0.00037800503,0.00010383346,0.0005710503,0.0007413427,0.0003091574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009967561,0.00019425403,0.00022721814,0.000108742155,0.00089655485,0.00043077144,0.00055170426,0.00009824534,0.0000058051796],"category_scores_gemma":[0.00006338817,0.00020398336,0.000049979288,0.0008563302,0.000069388196,0.00022981309,0.00030893777,0.00017626022,0.000018606182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028816845,0.000120037344,0.0011757541,0.00003571231,0.000035082503,8.689221e-7,0.0020391878,0.62255174,0.00026696603,0.006604608,0.010257552,0.35688367],"study_design_scores_gemma":[0.00029519937,0.00009053596,0.00031172571,0.000047391044,0.000006662662,0.0000041926883,0.0000613973,0.8154565,0.0001359334,0.0007082305,0.18266308,0.00021916017],"about_ca_topic_score_codex":0.00003275105,"about_ca_topic_score_gemma":0.000014539528,"teacher_disagreement_score":0.7648573,"about_ca_system_score_codex":0.000049857463,"about_ca_system_score_gemma":0.000031790103,"threshold_uncertainty_score":0.83182},"labels":[],"label_agreement":null},{"id":"W2803580888","doi":"10.5687/sss.2009.1","title":"On the Differences Between Discretized and Continuous Stochastic Systems as Demonstrated by Learning Automata","year":2009,"lang":"en","type":"article","venue":"Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Discretization; Learning automata; Probabilistic automaton; Probabilistic logic; Computer science; Convergence (economics); Automaton; State space; Finite-state machine; Field (mathematics); Space (punctuation); Artificial intelligence; Probability distribution; Discretization of continuous features; Action (physics); Machine learning; Theoretical computer science; Mathematics; Algorithm; Discretization error; Statistics","score_opus":0.010349744463591498,"score_gpt":0.24501756319603366,"score_spread":0.23466781873244216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803580888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19758171,0.00052379223,0.7705151,0.015030876,0.0004739278,0.0041343663,0.0001070671,0.00034019788,0.011292976],"genre_scores_gemma":[0.9983307,0.000020110592,0.000035791785,0.000104022736,0.00006991941,0.00024838737,0.000005024345,0.000009821731,0.0011761852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982555,0.00009084948,0.00042074805,0.0004313189,0.0005851064,0.00021649666],"domain_scores_gemma":[0.99774075,0.0012210031,0.0004169276,0.000174702,0.0003360382,0.00011056844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983425,0.00020815726,0.0002567086,0.0000920484,0.0005663797,0.0006030947,0.0011339306,0.00007634547,0.0000040047594],"category_scores_gemma":[0.00034108522,0.00012404681,0.00004594079,0.00027735892,0.00017744485,0.0002522588,0.0001737747,0.00025762225,0.000010903646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027935643,0.000057629644,0.000028387267,0.000017782071,0.000046575828,4.6469818e-8,0.0003632123,0.002668473,0.004990334,0.99129444,0.00014188756,0.00036330617],"study_design_scores_gemma":[0.0015824471,0.0010491948,0.0011120547,0.0013003178,0.00010721681,0.00009991866,0.0021411458,0.90238714,0.00079104584,0.08804102,0.00066075346,0.00072775583],"about_ca_topic_score_codex":0.000010656014,"about_ca_topic_score_gemma":6.923248e-8,"teacher_disagreement_score":0.90325344,"about_ca_system_score_codex":0.000037018865,"about_ca_system_score_gemma":0.000028780632,"threshold_uncertainty_score":0.5815656},"labels":[],"label_agreement":null},{"id":"W2804176675","doi":"10.1007/978-3-319-92007-8_38","title":"The Hierarchical Continuous Pursuit Learning Automation for Large Numbers of Actions","year":2018,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hierarchy; Action (physics); Computer science; Operator (biology); Scheme (mathematics); Curse of dimensionality; Discretization; Artificial intelligence; Theoretical computer science; Mathematics; Mathematical optimization","score_opus":0.011367387272165116,"score_gpt":0.2856070731466235,"score_spread":0.27423968587445835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804176675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038711976,0.0033678764,0.8000818,0.0054986794,0.00021090564,0.0011588271,0.000019233383,0.00044068613,0.18918331],"genre_scores_gemma":[0.16982244,0.25554025,0.44761068,0.0017452228,0.00012849359,0.0024530888,0.0014378758,0.00013977429,0.12112217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988131,0.000046521465,0.0006388852,0.0001319746,0.00018646226,0.00018307225],"domain_scores_gemma":[0.99792534,0.0003535889,0.00063009746,0.0006733831,0.00038876012,0.00002882992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966694,0.00013404932,0.0002049906,0.0004574706,0.00044821916,0.00012399559,0.001057302,0.00028342026,0.00002002061],"category_scores_gemma":[0.00026340355,0.00011784671,0.00004401058,0.00018904396,0.00034364153,0.0012550548,0.00039094625,0.00047369275,0.000017938695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007063272,0.0000066073453,0.00001669031,0.00002441319,0.0000069226962,2.0577666e-8,0.0004511942,0.00010009842,9.946988e-7,0.83144647,0.00016505134,0.16777447],"study_design_scores_gemma":[0.00035554497,0.00008720149,0.000010579214,0.00007409441,0.0000031645513,0.000004487759,0.0002931993,0.036283903,0.00002051808,0.19236518,0.7703976,0.00010451045],"about_ca_topic_score_codex":0.0000017502025,"about_ca_topic_score_gemma":0.000055987635,"teacher_disagreement_score":0.77023256,"about_ca_system_score_codex":0.000053736076,"about_ca_system_score_gemma":0.0000709488,"threshold_uncertainty_score":0.48056492},"labels":[],"label_agreement":null},{"id":"W2805215296","doi":"10.1142/s0129054119500102","title":"Tight Bounds for Restricted Grid Scheduling","year":2019,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Villum Fonden; Velux Fonden; Natur og Univers, Det Frie Forskningsråd","keywords":"Computer science; Grid; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Geometry","score_opus":0.021411712199889535,"score_gpt":0.32111725181519885,"score_spread":0.2997055396153093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805215296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028208265,0.00002130067,0.96415263,0.0025927797,0.0043848,0.00014440395,0.00000337977,0.000018136727,0.0004743115],"genre_scores_gemma":[0.44285527,0.000016417534,0.55668795,0.00015502033,0.00021570982,0.000001701217,0.0000023767936,0.0000033939473,0.00006213728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979645,0.000029426737,0.0005660776,0.00020831166,0.0010513568,0.00018030024],"domain_scores_gemma":[0.9951502,0.00021874307,0.00053188734,0.00027966427,0.0037178926,0.0001015888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009004794,0.000082772014,0.0001532883,0.00080618955,0.000116845724,0.0005547534,0.002963441,0.00002679444,0.000026887748],"category_scores_gemma":[0.00018907647,0.000073602954,0.00010911283,0.0007869072,0.00016678387,0.0024202229,0.00028252706,0.00011429942,0.000014329817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007936201,0.00050407357,0.003497326,0.000033549888,0.00018721638,0.000010171295,0.0014135014,0.2587599,0.01813031,0.6063657,0.0017476138,0.1092713],"study_design_scores_gemma":[0.0011113908,0.00038295402,0.0036368936,0.00010113719,0.0000047320896,0.00008817467,0.000012188061,0.97333324,0.0031127096,0.007807722,0.0102700405,0.00013884647],"about_ca_topic_score_codex":0.0000034453599,"about_ca_topic_score_gemma":6.27686e-7,"teacher_disagreement_score":0.7145733,"about_ca_system_score_codex":0.0001039819,"about_ca_system_score_gemma":0.00086542405,"threshold_uncertainty_score":0.550686},"labels":[],"label_agreement":null},{"id":"W2806794575","doi":"10.1109/syscon.2018.8369551","title":"Architecture for testing learning-based autonomous vehicle control design","year":2018,"lang":"en","type":"article","venue":"2018 Annual IEEE International Systems Conference (SysCon)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Controller (irrigation); Robot; Process (computing); Offline learning; Computer science; Control engineering; Mobile robot; Differential (mechanical device); Vehicle dynamics; Artificial intelligence; Control theory (sociology); Control (management); Engineering; Online learning; Automotive engineering","score_opus":0.06291224565056276,"score_gpt":0.2947151798646511,"score_spread":0.23180293421408837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806794575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092941313,0.000021324582,0.99165183,0.0015176557,0.0022977071,0.0009228601,0.00006644879,0.00036450857,0.0022282738],"genre_scores_gemma":[0.9639558,0.0000010115402,0.031703804,0.00049112615,0.00071989367,0.0002235091,0.000015401138,0.00002492707,0.0028644942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975737,0.0003125557,0.00050612487,0.0006051221,0.00051773567,0.00048480838],"domain_scores_gemma":[0.9962006,0.0007716184,0.00031954044,0.0003495992,0.002164431,0.0001941796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723856,0.000253921,0.00029172766,0.0002275046,0.00032479997,0.00070392014,0.0013335099,0.00013572563,0.000056726483],"category_scores_gemma":[0.0005804647,0.00023332657,0.00008743026,0.00024052832,0.0001707841,0.0005875359,0.00007477257,0.00024615123,0.00023695595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030486283,0.0003291638,0.0018504681,0.00014233241,0.00031539617,0.000024702915,0.0031926748,0.8763993,0.011730308,0.05612468,0.0139215905,0.03566454],"study_design_scores_gemma":[0.0012988978,0.0006931041,0.00015550453,0.0001237557,0.000006611977,0.000015570004,0.00006534339,0.9714829,0.000808827,0.0005075312,0.024557916,0.00028404742],"about_ca_topic_score_codex":0.00018128498,"about_ca_topic_score_gemma":0.000023026992,"teacher_disagreement_score":0.9630264,"about_ca_system_score_codex":0.00012074954,"about_ca_system_score_gemma":0.00049419113,"threshold_uncertainty_score":0.9514782},"labels":[],"label_agreement":null},{"id":"W2807434009","doi":"10.3233/fi-2018-1684","title":"Deterministic Meeting of Sniffing Agents in the Plane","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Sniffing; Plane (geometry); Computer science; Mathematics; Psychology; Geometry; Neuroscience","score_opus":0.05534727282622702,"score_gpt":0.31303479110933063,"score_spread":0.2576875182831036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807434009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33977544,0.000022444783,0.33813685,0.0021494497,0.00067812396,0.0013055328,0.000011957425,0.00016481557,0.31775537],"genre_scores_gemma":[0.97834885,0.000004046957,0.020374533,0.0011811756,0.00001932429,0.000009839476,0.0000035267149,0.000002328894,0.000056355126],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904335,0.000051042876,0.00035783806,0.00007114008,0.00028137496,0.0001952471],"domain_scores_gemma":[0.99939567,0.00012312582,0.000110641115,0.0002938843,0.00004360894,0.000033096694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061362516,0.00006345692,0.00008821857,0.00009909982,0.00008991947,0.00015265502,0.000740644,0.000021054122,0.00007116063],"category_scores_gemma":[0.00009058766,0.000044483648,0.000019931615,0.00029916043,0.00007150092,0.0004813396,0.00017183728,0.00007289502,0.00012311769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008550752,0.0009175739,0.034770884,0.0011485902,0.00013074347,0.00005391719,0.33060187,0.004659953,0.00072839804,0.29931667,0.022963474,0.30462244],"study_design_scores_gemma":[0.00096611277,0.0004417374,0.00938137,0.00021256032,0.0000051790976,0.000028930825,0.0017140125,0.96698046,0.0007755126,0.0015537333,0.017710013,0.00023035226],"about_ca_topic_score_codex":0.000017412964,"about_ca_topic_score_gemma":0.000011283938,"teacher_disagreement_score":0.9623205,"about_ca_system_score_codex":0.000018498185,"about_ca_system_score_gemma":0.00003657009,"threshold_uncertainty_score":0.18139905},"labels":[],"label_agreement":null},{"id":"W2807933378","doi":"10.1007/s00224-019-09955-7","title":"Advice Complexity of Priority Algorithms","year":2019,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Advice (programming); Oracle; Computer science; Reduction (mathematics); Mathematical proof; Function (biology); Algorithm; Matching (statistics); Adversary; Greedy algorithm; Upper and lower bounds; Theoretical computer science; Mathematics; Programming language; Computer security","score_opus":0.03455034673156813,"score_gpt":0.27869131579602946,"score_spread":0.24414096906446134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807933378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08752072,0.00017585834,0.89685214,0.000061180566,0.0008470871,0.00045122515,0.000003967401,0.00020667602,0.013881164],"genre_scores_gemma":[0.96177435,0.0000025790982,0.037761815,0.000025887217,0.0000368178,8.879128e-7,0.0000018314867,0.0000075203147,0.00038829158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998111,0.000510878,0.0005070234,0.00025331503,0.00039404447,0.00022370194],"domain_scores_gemma":[0.99829376,0.000339065,0.00037647117,0.0006281641,0.0002967201,0.00006579585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302911,0.00011274373,0.00037661186,0.00011257411,0.000054534365,0.000040753413,0.00090850267,0.00005220427,0.000017803293],"category_scores_gemma":[0.000040854513,0.000103393446,0.00007372545,0.00040224934,0.0001421931,0.00016700197,0.00029227155,0.00011681878,0.0000421572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009554566,0.00007817486,0.0009975769,0.00036655247,0.000030949424,6.899934e-7,0.0021807167,0.018649934,0.0007092363,0.97283214,0.00006452369,0.004079934],"study_design_scores_gemma":[0.00050382473,0.0001413052,0.0022350955,0.00022461226,0.0000036497352,0.000010605895,0.00020024322,0.9859535,0.0006670543,0.009595702,0.0003124017,0.0001519665],"about_ca_topic_score_codex":0.00006497009,"about_ca_topic_score_gemma":4.3472568e-7,"teacher_disagreement_score":0.96730363,"about_ca_system_score_codex":0.000023220418,"about_ca_system_score_gemma":0.000074151125,"threshold_uncertainty_score":0.42162624},"labels":[],"label_agreement":null},{"id":"W2808050500","doi":"10.1002/jgt.22546","title":"Bounds on the localization number","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Chromatic scale; Graph; Discrete mathematics; Constant (computer programming); Hypercube; Computer science","score_opus":0.03417009690688372,"score_gpt":0.2831885300731406,"score_spread":0.24901843316625688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808050500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041750591,0.00011805814,0.9782683,0.011022958,0.0009839295,0.00013546072,0.0000018493231,0.000033519354,0.009018404],"genre_scores_gemma":[0.97084564,0.00081992056,0.016225044,0.010945475,0.0005547196,0.000006243003,0.0000046068694,0.00003672608,0.00056161097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980311,0.00064680754,0.00042418297,0.00018269743,0.0005704379,0.00014477524],"domain_scores_gemma":[0.998244,0.00029919608,0.00057777605,0.00043371797,0.000328847,0.00011646856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018371381,0.00014705937,0.0002208696,0.00014333561,0.0001399138,0.00038898445,0.0015298631,0.00011424405,0.00015273243],"category_scores_gemma":[0.0002574908,0.000089800145,0.00025375382,0.00034636277,0.00009272715,0.00016995276,0.00043857022,0.0009249229,0.000053763266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003333025,0.000053269443,0.00006727811,0.000023931152,0.000086443964,0.000020564998,0.0013059677,0.020785164,0.000010573133,0.960881,0.014183225,0.0025492676],"study_design_scores_gemma":[0.0001730278,0.00009629238,0.0000863132,0.00015350351,0.0000145058375,0.000029351018,0.00006352568,0.02955154,0.00010186288,0.96273714,0.006866904,0.000126054],"about_ca_topic_score_codex":0.0000010654473,"about_ca_topic_score_gemma":3.0048784e-7,"teacher_disagreement_score":0.97042817,"about_ca_system_score_codex":0.000036863054,"about_ca_system_score_gemma":0.00022746346,"threshold_uncertainty_score":0.40183812},"labels":[],"label_agreement":null},{"id":"W2811044723","doi":"10.1007/s00453-018-0461-2","title":"On the Separation and Equivalence of Paging Strategies and Other Online Algorithms","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection; Paging; Algorithm; Computer science; Theory of computation; Online algorithm; Equivalence (formal languages); Competitive analysis; Set (abstract data type); Context (archaeology); Locality; Theoretical computer science; Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.0400453913384496,"score_gpt":0.3232309033706767,"score_spread":0.28318551203222714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811044723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027552465,0.00013470465,0.9650755,0.002832027,0.00010347283,0.00021346033,0.000008826484,0.000063646476,0.0040159323],"genre_scores_gemma":[0.86821455,0.00006727237,0.12997411,0.0012919883,0.00011518583,0.0000084983885,0.0000019361507,0.000010116782,0.00031637435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993553,0.000057480032,0.00011917765,0.00018781004,0.0001562887,0.00012393767],"domain_scores_gemma":[0.9994923,0.00012921586,0.000051730414,0.00020891606,0.00007992489,0.000037939215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023336327,0.00007087574,0.000074056974,0.000046517485,0.00011402851,0.00015428883,0.00021415587,0.000025660256,0.00002026091],"category_scores_gemma":[0.000024756491,0.000047597485,0.00001089482,0.00016026193,0.00020166073,0.00030838177,0.00010955904,0.00006719605,0.0000050862936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000865117,0.00011252915,0.00012728036,0.000026988206,0.00003425335,0.000002345278,0.004102142,0.00023837974,0.0019670934,0.6482248,0.00067985215,0.34447572],"study_design_scores_gemma":[0.00021689934,0.00029957565,0.0005281474,0.00003826284,0.000003094363,0.00000842092,0.00031302465,0.97624075,0.002217356,0.018315412,0.0017093034,0.00010973555],"about_ca_topic_score_codex":0.000022151658,"about_ca_topic_score_gemma":0.0000063248926,"teacher_disagreement_score":0.9760024,"about_ca_system_score_codex":0.0000048101897,"about_ca_system_score_gemma":0.000033032247,"threshold_uncertainty_score":0.19409691},"labels":[],"label_agreement":null},{"id":"W2823384615","doi":"10.1007/s10878-018-0324-4","title":"Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Disjoint sets; Computer science; Graph; Online algorithm; Enhanced Data Rates for GSM Evolution; Node (physics); Combinatorics; Mathematics; Mathematical optimization; Theoretical computer science; Upper and lower bounds; Algorithm; Artificial intelligence","score_opus":0.025514663311642347,"score_gpt":0.2938431342376827,"score_spread":0.26832847092604034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2823384615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011096659,0.00007766838,0.99608994,0.0011728932,0.0012179929,0.00064392184,0.000013920292,0.000010835986,0.0006618645],"genre_scores_gemma":[0.3780223,0.00018796611,0.62127215,0.0001609545,0.0002498079,0.0000157034,0.000020642248,0.000012191398,0.00005827407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998132,0.00029001196,0.0008394007,0.00013817164,0.000401214,0.00019923698],"domain_scores_gemma":[0.99572927,0.00043650033,0.0008074817,0.00021128915,0.002676088,0.00013938651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018414127,0.00012327773,0.00059866795,0.00062676845,0.00018521213,0.00021402935,0.0006314623,0.00007502233,0.000055622946],"category_scores_gemma":[0.00030646194,0.00008205663,0.00036836584,0.0011718193,0.00017830607,0.00056345796,0.00003682184,0.00012594099,6.962404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007110216,0.00012780329,0.000010440401,0.000006153784,0.00059871696,5.7945897e-7,0.0011374224,0.6031584,0.000013145025,0.3937417,0.00010730113,0.00038731293],"study_design_scores_gemma":[0.024730578,0.00027827438,0.00006168686,0.0000232489,0.00044500735,0.000001841553,0.00024928726,0.9696543,0.000055510907,0.003100861,0.0013069817,0.000092410795],"about_ca_topic_score_codex":0.00036531172,"about_ca_topic_score_gemma":0.00050872687,"teacher_disagreement_score":0.39064083,"about_ca_system_score_codex":0.00007930786,"about_ca_system_score_gemma":0.00067180215,"threshold_uncertainty_score":0.33461723},"labels":[],"label_agreement":null},{"id":"W28791922","doi":"10.1007/978-3-642-35261-4_17","title":"On the Advice Complexity of Buffer Management","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Advice (programming); Computer science; Buffer (optical fiber); Competitive analysis; Computational complexity theory; Online algorithm; Operations research; Mathematical optimization; Upper and lower bounds; Algorithm; Mathematics; Telecommunications","score_opus":0.043840296391982614,"score_gpt":0.2662340101763999,"score_spread":0.2223937137844173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28791922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010160764,0.00014814605,0.95708555,0.002356114,0.00063320284,0.0004808441,0.0000032110759,0.00008790887,0.039194867],"genre_scores_gemma":[0.1790361,0.00018220079,0.81094325,0.007212066,0.00027168746,0.000025519825,0.000006577482,0.00004577017,0.0022768262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718267,0.00006156727,0.0003904187,0.0007384949,0.0011221309,0.0005047363],"domain_scores_gemma":[0.99749875,0.00048385526,0.00022667632,0.0014708448,0.0001973566,0.00012250118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011928885,0.00031828505,0.00031557123,0.00045800072,0.00021355163,0.00020702345,0.0035154733,0.00012860261,0.00013802154],"category_scores_gemma":[0.000036176065,0.0002176978,0.00009908868,0.00052971445,0.0010300671,0.00029425055,0.0014784092,0.00054568995,0.00008602987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034055145,0.000039177186,0.0000069489615,0.000036870566,0.00001146917,0.000006502152,0.00039829413,0.019156134,0.000007346225,0.8184142,0.00012726148,0.1617924],"study_design_scores_gemma":[0.0002162221,0.00013506353,0.000161364,0.00031562283,0.000006645229,0.000009935977,2.3328926e-7,0.49899614,0.00031885502,0.4959143,0.0035266252,0.00039898523],"about_ca_topic_score_codex":0.000012249527,"about_ca_topic_score_gemma":0.0000145348795,"teacher_disagreement_score":0.47984,"about_ca_system_score_codex":0.00012369311,"about_ca_system_score_gemma":0.00011320282,"threshold_uncertainty_score":0.88774586},"labels":[],"label_agreement":null},{"id":"W2883365810","doi":"10.1007/s10878-018-0326-2","title":"Client assignment problems for latency minimization","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Interactivity; Computer science; Latency (audio); Server; Approximation algorithm; Theory of computation; Computer network; Algorithm; Operating system","score_opus":0.02113870338034317,"score_gpt":0.2740284831865448,"score_spread":0.25288977980620164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883365810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013517603,0.000041651532,0.99209476,0.0011813865,0.0050627324,0.00047240293,0.0000013635307,0.000044725475,0.00096582266],"genre_scores_gemma":[0.15102586,0.00014531676,0.8471814,0.0002345864,0.0011319002,0.000024934423,0.000012578603,0.000027935357,0.00021549643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981327,0.00012404622,0.00074287155,0.00020052052,0.0005526422,0.00024722045],"domain_scores_gemma":[0.9967893,0.00009908231,0.00072088384,0.00023423164,0.0020043808,0.00015214588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935296,0.00013856213,0.00023626626,0.00026157932,0.00020327767,0.00024869677,0.0005686061,0.00010585788,0.00004698317],"category_scores_gemma":[0.00028118957,0.00012126404,0.00011314298,0.0005230962,0.000051625353,0.0010865233,0.000076763405,0.00011082497,0.0000064039946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096962394,0.00040005014,0.00011373346,0.000028922916,0.000050091807,0.0000016681217,0.0009131465,0.8723359,0.0001950927,0.11686745,0.0053757946,0.0036211882],"study_design_scores_gemma":[0.0029308905,0.0019330234,0.000029327555,0.00006153784,0.000020442152,0.000014360793,0.000017989021,0.96669996,0.0011357655,0.015632628,0.011342704,0.00018139182],"about_ca_topic_score_codex":0.0000011014158,"about_ca_topic_score_gemma":1.4538318e-7,"teacher_disagreement_score":0.1508907,"about_ca_system_score_codex":0.0001264506,"about_ca_system_score_gemma":0.0002308141,"threshold_uncertainty_score":0.4945004},"labels":[],"label_agreement":null},{"id":"W2884716215","doi":"10.1016/j.tcs.2018.06.045","title":"On asynchronous rendezvous in general graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Traverse; Computer science; Adversary; Characterization (materials science); Time complexity; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Computer network; Computer security; Geography","score_opus":0.010886347146242769,"score_gpt":0.26764632849572767,"score_spread":0.2567599813494849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884716215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03880006,0.0000052357564,0.94146025,0.0010478947,0.0005496868,0.00014877897,4.3314532e-7,0.00016324723,0.017824393],"genre_scores_gemma":[0.8168859,0.000002852609,0.18159094,0.0014128562,0.00007958719,0.0000050012513,3.0178734e-7,0.000005128842,0.00001745514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760157,0.00013003865,0.00023543414,0.0007078277,0.0006807326,0.00064437353],"domain_scores_gemma":[0.99865,0.00013016364,0.00003741329,0.00075353816,0.00017431409,0.00025457153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012955777,0.00014478811,0.00014864076,0.00039542268,0.0003034955,0.00039082995,0.002196875,0.000045989356,0.00010551882],"category_scores_gemma":[0.00008334631,0.000118042,0.000038713355,0.0019056121,0.0028193714,0.00047318323,0.0006867009,0.00019761022,0.0002658785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000588251,0.00006697357,0.000039079645,0.0000013117104,8.6373655e-7,0.000011360823,0.00034165464,0.00083363405,0.00010983015,0.97292775,0.000091507965,0.025570167],"study_design_scores_gemma":[0.00020631443,0.0004717648,0.00069460046,0.0000136033805,3.3995087e-7,0.000012041921,9.1284267e-7,0.66432863,0.001061369,0.33302945,0.00005134963,0.0001295916],"about_ca_topic_score_codex":0.000005459587,"about_ca_topic_score_gemma":0.0000026762593,"teacher_disagreement_score":0.7780858,"about_ca_system_score_codex":0.00007586151,"about_ca_system_score_gemma":0.00014466117,"threshold_uncertainty_score":0.9998944},"labels":[],"label_agreement":null},{"id":"W2884836385","doi":"10.1016/j.dam.2018.01.018","title":"The robot crawler graph process","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ryerson University","keywords":"Web crawler; Crawling; Robot; Graph; Mathematics; Random walk; Combinatorics; Theoretical computer science; Discrete mathematics; Computer science; Artificial intelligence; Statistics; World Wide Web","score_opus":0.017971986492906464,"score_gpt":0.2813735515502793,"score_spread":0.26340156505737283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884836385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035189884,0.00001620186,0.92158777,0.00085184904,0.00009382692,0.00032189657,7.3594083e-7,0.00018757946,0.07658823],"genre_scores_gemma":[0.48626566,0.000051520845,0.51089,0.0007346367,0.00017494756,0.00021718167,0.0000046457803,0.000041444582,0.0016199423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998838,0.000012614203,0.00023941991,0.00022769705,0.00036145933,0.00032079086],"domain_scores_gemma":[0.99890614,0.00010762641,0.00009958738,0.0006639849,0.00013380773,0.000088855966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037716283,0.00012655901,0.00011754174,0.00004308759,0.00047734525,0.00036401855,0.001074929,0.000043435248,0.000029035693],"category_scores_gemma":[0.000035730747,0.0000779185,0.000040510713,0.00042985313,0.00020022328,0.00015238865,0.00019530667,0.00010443366,0.00027927393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023717548,0.00003890136,0.0000034700352,0.000035879137,0.000016361477,5.397862e-7,0.0031917547,0.00018938362,0.00045241194,0.99074405,0.0013289038,0.003995944],"study_design_scores_gemma":[0.00044096148,0.00008446961,0.000043395765,0.00003428124,0.000011010673,0.000008486059,0.00078782823,0.28720504,0.006954497,0.6973007,0.006735259,0.00039412812],"about_ca_topic_score_codex":7.1019826e-7,"about_ca_topic_score_gemma":0.0000038185303,"teacher_disagreement_score":0.48591378,"about_ca_system_score_codex":0.000009949917,"about_ca_system_score_gemma":0.000043581367,"threshold_uncertainty_score":0.3671402},"labels":[],"label_agreement":null},{"id":"W2886502899","doi":"10.48550/arxiv.1808.01984","title":"Time-Dependent Shortest Path Queries Among Growing Discs","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Binary logarithm; Path (computing); Computation; Mathematics; Discrete mathematics; Algorithm; Computer science; Graph","score_opus":0.03763391399765716,"score_gpt":0.17436982583267074,"score_spread":0.13673591183501357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886502899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2266584,0.0000059431936,0.7598717,0.00013263317,0.00016843161,0.00013360317,0.0000021518647,0.00030178338,0.0127253095],"genre_scores_gemma":[0.9914998,0.000017450393,0.0015841887,0.00013755927,0.00005207821,3.474401e-7,0.0000027988583,0.0000091986085,0.0066965753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989479,0.00008307689,0.00010675996,0.00046236033,0.00009827933,0.0003015912],"domain_scores_gemma":[0.99912137,0.00004405576,0.00005461864,0.00048462328,0.0001327419,0.00016260541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304191,0.00012318807,0.00011445697,0.00011576671,0.00028445804,0.00012768163,0.00077217305,0.000057217614,0.00016933499],"category_scores_gemma":[0.00002570853,0.00012756932,0.00005699049,0.0005769053,0.00025997558,0.0015752162,0.0004031788,0.00011222066,0.00046027754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043741267,0.00034180077,0.06879715,0.0000223387,0.00012040095,0.00061550626,0.0031058392,0.14170095,0.0012241472,0.77839375,0.0029056203,0.002728762],"study_design_scores_gemma":[0.00034043123,0.00013743177,0.0028533435,0.000022879824,0.000009577424,0.0000040312516,0.00015626186,0.9912919,0.0005285703,0.0033159284,0.0010642932,0.00027534927],"about_ca_topic_score_codex":0.000052049818,"about_ca_topic_score_gemma":0.000040587744,"teacher_disagreement_score":0.84959096,"about_ca_system_score_codex":0.000060657818,"about_ca_system_score_gemma":0.00005647954,"threshold_uncertainty_score":0.591609},"labels":[],"label_agreement":null},{"id":"W2886931138","doi":"10.1145/3379552","title":"An Experimental Study of Algorithms for Online Bipartite Matching","year":2020,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Bipartite graph; Computer science; Matching (statistics); Algorithm; Preprocessor; Ranking (information retrieval); Online algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Graph","score_opus":0.09766027536202379,"score_gpt":0.3921035343862945,"score_spread":0.2944432590242707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886931138","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5176576,0.0019215668,0.4758732,0.00061252125,0.002240995,0.0014757053,0.000106901294,0.000086902655,0.000024635556],"genre_scores_gemma":[0.47580063,0.000050621948,0.52346534,0.00014304424,0.00042754062,0.000031315587,0.000033019198,0.00004099649,0.000007521645],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962965,0.0002334824,0.0014786122,0.00062233896,0.0009858973,0.000383168],"domain_scores_gemma":[0.9965897,0.00010485472,0.0013383781,0.0010427958,0.0005025613,0.00042166974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005842896,0.0004439189,0.00089456956,0.00033571967,0.00014450795,0.00031071668,0.0037559564,0.00018461677,0.000015863936],"category_scores_gemma":[0.00006197872,0.00041945183,0.000345526,0.0002722769,0.00006387334,0.0007884157,0.0022897979,0.0007403769,0.0000016589769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013102812,0.09492735,0.00046143815,0.00044671333,0.0028095117,0.0007278059,0.19602713,0.12235082,0.5326239,0.004608989,0.0021231673,0.041582935],"study_design_scores_gemma":[0.007923472,0.02196558,0.000097825876,0.00032899043,0.000097964206,0.00018135138,0.03356558,0.6929302,0.23526017,0.0061784782,0.00026249184,0.0012078871],"about_ca_topic_score_codex":0.000056871828,"about_ca_topic_score_gemma":0.0000022371985,"teacher_disagreement_score":0.5705794,"about_ca_system_score_codex":0.00019260976,"about_ca_system_score_gemma":0.0003064585,"threshold_uncertainty_score":0.9998257},"labels":[],"label_agreement":null},{"id":"W2888048527","doi":"10.1007/s00446-018-0339-1","title":"Distributed exploration of dynamic rings","year":2018,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; A priori and a posteriori; Focus (optics); Theoretical computer science; Graph; Context (archaeology); Invariant (physics); Topology (electrical circuits); Distributed computing; Mathematics; Combinatorics; Geography","score_opus":0.025652479985556205,"score_gpt":0.28613440334195933,"score_spread":0.26048192335640313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888048527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014190286,0.000018014644,0.9841978,0.0005479668,0.00021035869,0.00014882715,0.00005375529,0.00028983716,0.0003431308],"genre_scores_gemma":[0.9595506,0.000004019721,0.040046155,0.000058136193,0.00004037681,0.0000028073555,0.00027989564,0.000007536851,0.000010426358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859804,0.000081797174,0.0003798944,0.00032916237,0.0002865242,0.00032455323],"domain_scores_gemma":[0.9986962,0.00007659439,0.00020388117,0.00045498923,0.0004716035,0.00009671773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035022057,0.0001290533,0.00017510935,0.000096780255,0.00021580755,0.0001349717,0.00071189855,0.000059335558,0.000016555778],"category_scores_gemma":[0.00011238503,0.00013077006,0.00005716102,0.0010214413,0.00010516804,0.0006042317,0.000256958,0.00011421718,0.000040453644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091974944,0.0012674734,0.008018259,0.0003150933,0.00030369003,0.000044617536,0.01016934,0.113091104,0.025893847,0.47766542,0.009125102,0.35401407],"study_design_scores_gemma":[0.0003268904,0.000110104396,0.0024668227,0.000041796808,0.0000033077047,0.0000035127432,0.00006355091,0.9905606,0.0031422137,0.0022493186,0.0008809147,0.0001509798],"about_ca_topic_score_codex":0.0000124558455,"about_ca_topic_score_gemma":0.0000029122352,"teacher_disagreement_score":0.94536036,"about_ca_system_score_codex":0.0000629488,"about_ca_system_score_gemma":0.000060027884,"threshold_uncertainty_score":0.5332648},"labels":[],"label_agreement":null},{"id":"W2890631767","doi":"10.1109/icra.2018.8460726","title":"Re-Deployment Algorithms for Multiple Service Robots to Optimize Task Response","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Task (project management); Computer science; Benchmarking; Service (business); Time horizon; Greedy algorithm; Software deployment; Set (abstract data type); Task analysis; Approximation algorithm; Quality of service; Algorithm; Real-time computing; Mathematical optimization; Distributed computing; Artificial intelligence; Engineering; Mathematics; Computer network","score_opus":0.05856606378913111,"score_gpt":0.32257279700317054,"score_spread":0.26400673321403945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890631767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042490775,0.0000068669715,0.97228396,0.02478264,0.00030999008,0.00083135336,0.000005653981,0.00038450852,0.0009701384],"genre_scores_gemma":[0.01604813,0.0000036483384,0.96683997,0.012007154,0.00009950723,0.00016444834,0.0000032999237,0.000020161631,0.00481366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984752,0.0001167031,0.00023313405,0.0004802281,0.00028412024,0.00041062196],"domain_scores_gemma":[0.99820226,0.0003158974,0.000040995918,0.00064623635,0.00051564147,0.00027898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898575,0.00013451463,0.00013683508,0.00013390332,0.00021521171,0.00022422796,0.0008564153,0.000054196098,0.00011079126],"category_scores_gemma":[0.00021963025,0.00011685147,0.000047304187,0.00059216056,0.000022892422,0.00034378655,0.00039038557,0.000055398345,0.00048544238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037966375,0.0012529058,0.0002651268,0.00011539115,0.00019197422,0.0000256175,0.023747077,0.41000444,0.024630329,0.018570567,0.36693805,0.15046188],"study_design_scores_gemma":[0.00094417663,0.00045992006,0.00010381885,0.00001214368,0.0000019004968,0.0000015090945,0.00007324771,0.942998,0.004657312,0.00018454212,0.050372615,0.00019084627],"about_ca_topic_score_codex":0.00007013832,"about_ca_topic_score_gemma":0.00014326975,"teacher_disagreement_score":0.53299356,"about_ca_system_score_codex":0.000056425888,"about_ca_system_score_gemma":0.000099449215,"threshold_uncertainty_score":0.6239542},"labels":[],"label_agreement":null},{"id":"W2898662501","doi":"10.1007/978-3-030-01325-7_17","title":"Explorable Families of Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Theoretical computer science; Graph; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.02724811559871579,"score_gpt":0.2538213882877647,"score_spread":0.2265732726890489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898662501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004940793,0.00021790252,0.98700935,0.0003138034,0.0009491412,0.00027289393,0.000003401226,0.00011451159,0.0110695865],"genre_scores_gemma":[0.038020656,0.0003757019,0.9589092,0.0010443798,0.00020206117,0.000011096891,0.000005490702,0.00003835235,0.0013930512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969994,0.00003228105,0.00048475093,0.0010111135,0.0009690643,0.0005034322],"domain_scores_gemma":[0.9976055,0.0002348036,0.00024959116,0.0012743222,0.0004939673,0.00014183189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008139903,0.0003355493,0.00043615382,0.0011101429,0.00016284698,0.00027124054,0.003164548,0.00020895456,0.000101700185],"category_scores_gemma":[0.000074055926,0.0002978991,0.000113564274,0.0008854473,0.0011923461,0.0007004113,0.001183937,0.00040241197,0.000065774446],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114164395,0.000095419164,0.000112906986,0.00016926505,0.00003177154,0.000045997636,0.0062623406,0.08348113,0.00039172318,0.20577851,0.0004279813,0.7031915],"study_design_scores_gemma":[0.000256214,0.0003267152,0.000024516308,0.0003755562,0.00000380066,0.00001643194,5.343779e-7,0.5100361,0.0032283973,0.48210686,0.003104279,0.000520557],"about_ca_topic_score_codex":0.000016217777,"about_ca_topic_score_gemma":0.000032348344,"teacher_disagreement_score":0.702671,"about_ca_system_score_codex":0.00008118692,"about_ca_system_score_gemma":0.00046819402,"threshold_uncertainty_score":0.9999473},"labels":[],"label_agreement":null},{"id":"W2898707168","doi":"","title":"Decision Support for Search and Rescue Response Planning.","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds de recherche du Québec – Nature et technologies; Université Laval","keywords":"Search and rescue; Disaster response; Computer science; Risk analysis (engineering); Business; Operations research; Engineering; Emergency management; Artificial intelligence; Political science","score_opus":0.07917101514853908,"score_gpt":0.3870047902663798,"score_spread":0.3078337751178407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898707168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02701931,0.000009891315,0.967018,0.002854222,0.00009600872,0.00020530696,0.0000016353474,0.00005439041,0.0027412155],"genre_scores_gemma":[0.4284848,0.000014141411,0.55753434,0.00036013062,0.000022518,0.000015506144,0.00000128692,0.00000651546,0.0135607375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929076,0.00003906623,0.000094289935,0.00022392193,0.00016989931,0.00018203046],"domain_scores_gemma":[0.9989957,0.0002213983,0.000013138311,0.0005653333,0.000095760384,0.00010867789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313524,0.000049821625,0.00006592062,0.00007001652,0.00048418858,0.0006115582,0.00062824716,0.000034471133,0.000028741835],"category_scores_gemma":[0.0004030925,0.00003960336,0.000018785606,0.00003206619,0.000048368478,0.0004546795,0.00036786098,0.000050546914,0.000020131405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030929304,0.00018980488,0.007303172,0.000071721784,0.00004083902,0.00010659816,0.005553168,0.011162711,0.0048141032,0.22153638,0.06572155,0.68040705],"study_design_scores_gemma":[0.0011036978,0.00038048104,0.031832203,0.000020115822,9.859002e-7,0.000013316247,0.000028280638,0.93524206,0.001283644,0.0021227458,0.027835954,0.0001365335],"about_ca_topic_score_codex":0.000016059223,"about_ca_topic_score_gemma":0.000007596835,"teacher_disagreement_score":0.92407936,"about_ca_system_score_codex":0.000008233021,"about_ca_system_score_gemma":0.0000759895,"threshold_uncertainty_score":0.589727},"labels":[],"label_agreement":null},{"id":"W2899031087","doi":"10.1007/978-3-030-01325-7_20","title":"Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Tree (set theory); Energy (signal processing); Computer network","score_opus":0.01843230181514837,"score_gpt":0.24691683147001994,"score_spread":0.22848452965487157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899031087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003482695,0.00008613958,0.9928395,0.0003306635,0.0006388003,0.00035887814,0.000014288133,0.00021162888,0.005485282],"genre_scores_gemma":[0.17055565,0.00020783726,0.8132353,0.008015725,0.0014606649,0.00013869313,0.0001389237,0.00018003798,0.0060672155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603754,0.00004377393,0.00036586297,0.0015203115,0.0012432447,0.0007892742],"domain_scores_gemma":[0.99763596,0.00020560503,0.00022831581,0.001332365,0.0003378775,0.00025985567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004974109,0.00051883,0.00041751383,0.00084976567,0.00034684982,0.00071717903,0.0027432535,0.0002249609,0.000117124044],"category_scores_gemma":[0.000029881983,0.00041361485,0.00009069188,0.0009699122,0.0006481337,0.000485949,0.0009854824,0.0004907841,0.000077517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022559892,0.000088426495,0.000019350888,0.000030104617,0.000024540768,0.0001636311,0.0013684429,0.17278202,0.00002815827,0.014733395,0.00040238668,0.810337],"study_design_scores_gemma":[0.0005136979,0.001049956,0.000022223534,0.00057291373,0.000005694264,0.000054638564,3.490885e-7,0.96066463,0.00077825435,0.01701566,0.018572992,0.0007490062],"about_ca_topic_score_codex":0.000014582381,"about_ca_topic_score_gemma":0.00006075676,"teacher_disagreement_score":0.80958796,"about_ca_system_score_codex":0.00029621596,"about_ca_system_score_gemma":0.00039520938,"threshold_uncertainty_score":0.99983156},"labels":[],"label_agreement":null},{"id":"W2901708208","doi":"10.48550/arxiv.1811.06420","title":"Latecomers Help to Meet: Deterministic Anonymous Gathering in the Plane","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Point (geometry); Plane (geometry); Anonymity; Computer science; Constant (computer programming); Adversary; Combinatorics; Algorithm; Mathematics; Computer security; Geometry","score_opus":0.08748571325406237,"score_gpt":0.20796471848795586,"score_spread":0.12047900523389349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901708208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28126854,0.000018195975,0.701899,0.0006082695,0.00060107955,0.0008242989,0.000013133034,0.0002216947,0.01454578],"genre_scores_gemma":[0.9959453,0.000033770724,0.002773204,0.00044704802,0.000046163266,0.0000023544715,0.00000437601,0.000012550061,0.0007352883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984347,0.00019844498,0.00016856211,0.0007152611,0.00011530391,0.00036772207],"domain_scores_gemma":[0.9986062,0.00011691345,0.00009426065,0.00097627443,0.00007286442,0.000133508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045503318,0.0002089137,0.00020498439,0.0003014468,0.00012816404,0.00019606703,0.0024036202,0.00014222386,0.000041991876],"category_scores_gemma":[0.0000370754,0.00019328567,0.00007588834,0.0006818812,0.00007369486,0.00015796203,0.0013047651,0.00028740425,0.00015049364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004518637,0.0001689008,0.0033481205,0.00011077039,0.00005252024,0.0011580023,0.0053495057,0.9168592,0.000046706835,0.07020832,0.0013305708,0.001322177],"study_design_scores_gemma":[0.00047435457,0.00018674173,0.0015282958,0.00013804395,0.000016476706,0.000014453657,0.00021038014,0.98037034,0.000044489407,0.0142072225,0.002263438,0.00054576946],"about_ca_topic_score_codex":0.00009599701,"about_ca_topic_score_gemma":0.00023783949,"teacher_disagreement_score":0.71467674,"about_ca_system_score_codex":0.00011496677,"about_ca_system_score_gemma":0.00011844528,"threshold_uncertainty_score":0.7881961},"labels":[],"label_agreement":null},{"id":"W2901887370","doi":"10.1007/978-3-030-04651-4_38","title":"On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Traverse; Competitive analysis; Combinatorics; Generalization; Computer science; Graph; Shortest path problem; Path (computing); Asymptotically optimal algorithm; Node (physics); Randomized algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Upper and lower bounds; Computer network","score_opus":0.03387326969170144,"score_gpt":0.26185795791360544,"score_spread":0.227984688221904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901887370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010900723,0.00007330733,0.98133314,0.005549769,0.0006135269,0.0011544034,0.000013852688,0.00003122548,0.011219905],"genre_scores_gemma":[0.52289516,0.000104794235,0.45934913,0.013416837,0.00082593167,0.00021450355,0.000015228837,0.00011113249,0.00306732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756044,0.000057935584,0.00035923094,0.0007442654,0.0007578859,0.00052025693],"domain_scores_gemma":[0.99621123,0.0017399486,0.00021158799,0.0010838644,0.00060011155,0.00015323507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016439502,0.00031550313,0.00030228,0.00039772133,0.0007306521,0.0007951866,0.004031577,0.00017905945,0.00013869653],"category_scores_gemma":[0.00008992115,0.00018012391,0.000114588394,0.00045096263,0.0016553298,0.00026364555,0.00036510293,0.00046393546,0.00001988187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065696363,0.000016126258,0.000002980237,0.00003866396,0.000017853807,0.000003115869,0.0023682364,0.09541656,0.0000150580545,0.85270995,0.000110760426,0.04929412],"study_design_scores_gemma":[0.0001894965,0.00025189755,0.000031200903,0.00028865781,0.0000052615287,0.0000066082994,0.0000033432343,0.5646193,0.00044408182,0.42953506,0.004336084,0.0002890213],"about_ca_topic_score_codex":0.0005709793,"about_ca_topic_score_gemma":0.013834349,"teacher_disagreement_score":0.52288425,"about_ca_system_score_codex":0.00015428595,"about_ca_system_score_gemma":0.0025506932,"threshold_uncertainty_score":0.77198917},"labels":[],"label_agreement":null},{"id":"W2905815131","doi":"10.1287/ijoc.2022.1168","title":"Dynamic Relaxations for Online Bipartite Matching","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Matching (statistics); Bipartite graph; Heuristic; Set (abstract data type); Variety (cybernetics); Revenue; Mathematical optimization; Online algorithm; Theoretical computer science; Operations research; Mathematics; Algorithm; Economics; Artificial intelligence","score_opus":0.02570428253769788,"score_gpt":0.30766459370802673,"score_spread":0.2819603111703288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905815131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032026682,0.00002507542,0.9633417,0.0028262103,0.00077149656,0.00017891075,0.000007346055,0.00011717694,0.0007053881],"genre_scores_gemma":[0.5121785,0.000017793434,0.4839013,0.0031621563,0.00011649112,0.000010098242,0.000023385766,0.000018000972,0.0005723234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998688,0.00004378407,0.00042045355,0.00013961356,0.0004009388,0.0003072321],"domain_scores_gemma":[0.999072,0.00019422796,0.00030608397,0.00018652888,0.00012705469,0.000114072005],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008178562,0.00009367611,0.00011421635,0.00027333637,0.001469765,0.00036813164,0.00069628056,0.000018736575,0.00003015923],"category_scores_gemma":[0.00007943745,0.00008202166,0.00009806188,0.00041672456,0.000011468421,0.00048603097,0.0003407237,0.00052384735,0.000011235648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008020955,0.000067043526,0.00003814736,0.0000060339216,0.0000149227335,0.000006602542,0.0011651064,0.8729939,0.000029559174,0.034418944,0.00048717324,0.09076456],"study_design_scores_gemma":[0.00048046315,0.00023777004,0.0001561248,0.000021880967,0.0000016459811,0.00016661089,0.00013633595,0.9616818,0.000005793968,0.0089653125,0.02803161,0.000114656614],"about_ca_topic_score_codex":0.0000021167202,"about_ca_topic_score_gemma":0.0000017284151,"teacher_disagreement_score":0.48015177,"about_ca_system_score_codex":0.00016470888,"about_ca_system_score_gemma":0.00013484887,"threshold_uncertainty_score":0.9998302},"labels":[],"label_agreement":null},{"id":"W2908766116","doi":"10.1007/978-3-030-11072-7_14","title":"Group Search and Evacuation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Robot; Domain (mathematical analysis); Mobile robot; Search and rescue; Set (abstract data type); Wireless; Point (geometry); Group (periodic table); Communication in small groups; Line (geometry); Search problem; Artificial intelligence; Distributed computing; Algorithm; Mathematics","score_opus":0.024865138374666428,"score_gpt":0.26685571997669444,"score_spread":0.24199058160202802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908766116","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006689285,0.0002682699,0.99319994,0.0010589539,0.0006356362,0.00045318628,0.0000017897496,0.00009914921,0.004216183],"genre_scores_gemma":[0.116073504,0.00035871973,0.8779163,0.002618657,0.00034153264,0.000009016571,0.000015432233,0.000050504525,0.0026163738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970826,0.000043064407,0.00029778335,0.001146463,0.00096294604,0.00046717466],"domain_scores_gemma":[0.9984016,0.00027266465,0.00008277184,0.0008629706,0.0002233586,0.00015667496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011213935,0.00028806395,0.00029262682,0.00071241084,0.00017904918,0.00070686295,0.0016544047,0.00021284926,0.000032871016],"category_scores_gemma":[0.00004372845,0.0002608121,0.00004891962,0.00043846603,0.000388299,0.00072690553,0.0012595047,0.00059075124,0.00009094614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032828304,0.000016672298,0.00008463953,0.000053573334,0.0000060771104,0.00001646762,0.0007723316,0.081280634,0.00013890537,0.12842387,0.000016780814,0.7891868],"study_design_scores_gemma":[0.00022711961,0.00014964293,0.00015332933,0.00014022653,0.0000017837102,0.00002412238,8.470464e-8,0.9527111,0.00013428957,0.045294337,0.0008413169,0.00032266942],"about_ca_topic_score_codex":0.000015624231,"about_ca_topic_score_gemma":0.00003042975,"teacher_disagreement_score":0.87143046,"about_ca_system_score_codex":0.00014764161,"about_ca_system_score_gemma":0.00042551168,"threshold_uncertainty_score":0.9999844},"labels":[],"label_agreement":null},{"id":"W2909463622","doi":"10.4095/216197","title":"Figure 53. Thickness maps of the M/S Assemblage","year":2004,"lang":"en","type":"report","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Resources Canada","funders":"","keywords":"Assemblage (archaeology); Geology; Mathematics; Geography; Geometry; Archaeology","score_opus":0.04309197364259377,"score_gpt":0.298845811115932,"score_spread":0.25575383747333824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909463622","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005459234,0.00021056413,0.31848994,0.002364101,0.0013436829,0.0004031039,0.0000123156915,0.00012849626,0.6770423],"genre_scores_gemma":[0.019320885,0.0022597006,0.09147439,0.0018543638,0.00049750146,0.00008496695,0.00011618464,0.000097915305,0.8842941],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975406,0.00009899248,0.00038341258,0.0003660745,0.0013716338,0.0002392754],"domain_scores_gemma":[0.99768937,0.00005815328,0.00028383516,0.0011956727,0.0007032706,0.00006971107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000833213,0.00018345319,0.000286404,0.00010208034,0.00009831211,0.00013027171,0.002015889,0.00028480715,0.00027176787],"category_scores_gemma":[0.00016964701,0.00010893474,0.00019424454,0.0005476582,0.00006626791,0.00017508747,0.00062898936,0.0004502329,0.000058102472],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032236794,0.0003612754,0.00047290424,0.0014897906,0.00019008697,0.00004833901,0.00121992,0.0143355215,0.00021979425,0.3307651,0.6301339,0.020760126],"study_design_scores_gemma":[0.0004957399,0.00008383748,0.00088386517,0.0008291629,0.000027726674,0.00011026275,0.00003225769,0.0060643926,0.0015359684,0.012232283,0.9770373,0.0006671777],"about_ca_topic_score_codex":0.00022135691,"about_ca_topic_score_gemma":0.000045698707,"teacher_disagreement_score":0.34690338,"about_ca_system_score_codex":0.00012803807,"about_ca_system_score_gemma":0.0029615422,"threshold_uncertainty_score":0.5253649},"labels":[],"label_agreement":null},{"id":"W2910174849","doi":"10.1007/s10878-019-00378-1","title":"On the randomized online strategies for the k-Canadian traveler problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Combinatorics; Graph; Randomized algorithm; Computer science; Disjoint sets; Undirected graph; Node (physics); Online algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Upper and lower bounds; Mathematical optimization; Algorithm; Artificial intelligence; Physics","score_opus":0.017103845037781597,"score_gpt":0.25547395398773054,"score_spread":0.23837010894994895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910174849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002552624,0.00005741535,0.9761607,0.01623107,0.002871639,0.001477169,0.0000026422356,0.000016707632,0.0029273678],"genre_scores_gemma":[0.7981842,0.0002046439,0.19808212,0.0022351556,0.0005826635,0.00006131876,0.0000111867175,0.00003621962,0.00060248247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845195,0.00028117836,0.0004799413,0.000117926415,0.0004622034,0.00020678091],"domain_scores_gemma":[0.9972491,0.0011598855,0.00041825438,0.00026382162,0.000810802,0.000098113196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022731735,0.00011814389,0.0002749639,0.00015571844,0.00028976274,0.00063748803,0.0008464044,0.00007681797,0.00008521537],"category_scores_gemma":[0.0003311463,0.000059063233,0.0001803544,0.0003283155,0.000059433398,0.00058166747,0.000028234615,0.00026160642,0.0000066988423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052783726,0.0000318792,0.0000010122899,0.000003159958,0.000025108286,2.8958834e-7,0.00022526378,0.48694953,0.0000024200483,0.5111561,0.0008399707,0.00023741316],"study_design_scores_gemma":[0.024269162,0.00027539054,0.0000049625164,0.0000301256,0.000018962624,0.000005193926,0.00008642024,0.8640991,0.000013800536,0.10888643,0.0022252656,0.00008521507],"about_ca_topic_score_codex":0.00015225746,"about_ca_topic_score_gemma":0.00007333986,"teacher_disagreement_score":0.7979289,"about_ca_system_score_codex":0.00008760597,"about_ca_system_score_gemma":0.0008341489,"threshold_uncertainty_score":0.6147312},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Vision; Computer science; Library science; Operations research; Autonomous agent; Track (disk drive); Artificial intelligence; Engineering; Sociology","score_opus":0.04896267297995336,"score_gpt":0.27961300150657,"score_spread":0.23065032852661663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912100673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026576066,0.000013396885,0.80633336,0.0066187424,0.0013597093,0.00072893046,0.0000034115476,0.00016097774,0.15820539],"genre_scores_gemma":[0.9857419,0.000015588033,0.009426214,0.00027935507,0.000013429617,0.000008601033,3.1907032e-7,0.0000025233135,0.004512079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994284,0.000015084291,0.00012202734,0.00015331681,0.00019893322,0.00008226614],"domain_scores_gemma":[0.9996223,0.000014277392,0.00006614452,0.00010327678,0.00015127705,0.000042747106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021742485,0.000051871404,0.00006135603,0.00003760779,0.000045292865,0.00014465635,0.0004933453,0.000021222304,0.000028175353],"category_scores_gemma":[0.00002478104,0.00003234084,0.00001574641,0.00006225455,0.000033477405,0.00013870808,0.00019201545,0.000048207887,0.000018302011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016474283,0.00006456898,0.0033341956,0.000020838024,0.000010514132,8.178982e-8,0.00050849735,0.001073037,0.00047186416,0.9868612,0.004597512,0.00305599],"study_design_scores_gemma":[0.00021856351,0.00003314693,0.003983621,0.000022261047,6.7869973e-7,0.0000018341109,0.000030059255,0.9918796,0.00025641226,0.0001728953,0.0033575532,0.00004336295],"about_ca_topic_score_codex":0.000021525124,"about_ca_topic_score_gemma":0.0000014533094,"teacher_disagreement_score":0.9908066,"about_ca_system_score_codex":0.000013949554,"about_ca_system_score_gemma":0.000016317103,"threshold_uncertainty_score":0.13949247},"labels":[],"label_agreement":null},{"id":"W2913788502","doi":"10.1109/cdc.2018.8619136","title":"A Patrolling Game for Adversaries with Limited Observation Time","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Patrolling; Computer science; Game theory; Markov chain; Graph; Set (abstract data type); Markov process; Mathematical optimization; Computer security; Mathematics; Theoretical computer science; Mathematical economics; Machine learning","score_opus":0.026356897183370132,"score_gpt":0.2431447598914063,"score_spread":0.21678786270803616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913788502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002707202,0.000003689852,0.9925852,0.0018000038,0.000037373055,0.00023566402,7.503374e-7,0.00019378116,0.0024363343],"genre_scores_gemma":[0.1426533,0.0000026876858,0.8495127,0.0013159143,0.00007072527,0.000030584557,0.000009947209,0.000007780586,0.0063963807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945617,0.000015129281,0.00008823732,0.00016634341,0.0001226642,0.00015145737],"domain_scores_gemma":[0.9993958,0.000059667283,0.00003249713,0.00018064029,0.0002877469,0.000043682456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014061654,0.000055019205,0.00006169216,0.000047753907,0.0000958827,0.00013887527,0.00021173453,0.000023481141,0.00005427108],"category_scores_gemma":[0.000034120985,0.00004003365,0.000017365477,0.000259993,0.00003771432,0.00047681894,0.000038046488,0.00002492084,0.00007471943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061617454,0.00046312387,0.00694969,0.00012975956,0.0002481682,0.000006614874,0.015983613,0.03694023,0.008920177,0.7738934,0.034975532,0.120873526],"study_design_scores_gemma":[0.00046427903,0.0003206752,0.0002550011,0.000007737429,0.0000018955698,8.465854e-7,0.000011793264,0.98530686,0.0010085424,0.0010844007,0.011461731,0.00007622183],"about_ca_topic_score_codex":0.00000657278,"about_ca_topic_score_gemma":0.0000088783345,"teacher_disagreement_score":0.94836664,"about_ca_system_score_codex":0.000011201012,"about_ca_system_score_gemma":0.000048078364,"threshold_uncertainty_score":0.16325249},"labels":[],"label_agreement":null},{"id":"W2916405216","doi":"10.48550/arxiv.1902.08069","title":"With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Path (computing); Space (punctuation); Burstiness; Sigma; Omega; Network packet; Computer science; Queueing theory; Mathematics; Discrete mathematics; Algorithm; Computer network; Physics","score_opus":0.10956977049957722,"score_gpt":0.19532272471011947,"score_spread":0.08575295421054224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916405216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033567898,0.000022018481,0.95965594,0.00048748878,0.0003688306,0.0011808842,0.000021882339,0.00031206894,0.004382991],"genre_scores_gemma":[0.97197175,0.000068493275,0.01937913,0.00015354627,0.00006905912,0.0000017681621,0.0000431903,0.00003641054,0.008276675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775076,0.00012495182,0.00020267247,0.0012245224,0.0001300265,0.00056708633],"domain_scores_gemma":[0.9978843,0.00019176575,0.0002652629,0.0011633036,0.00026126727,0.00023411916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034466523,0.0003807889,0.0004509335,0.00028345824,0.00019676737,0.0003242137,0.0017379331,0.00027105163,0.000028229611],"category_scores_gemma":[0.000028092742,0.0003755575,0.00021118873,0.00052529573,0.000100147765,0.00036873246,0.0009070788,0.0005199645,0.000054361124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109958266,0.00009195873,0.007152955,0.00022281529,0.0001564526,0.000087550725,0.0005593017,0.8017155,0.000018711478,0.18924676,0.0003152309,0.00032279748],"study_design_scores_gemma":[0.0018008142,0.00024082707,0.0004987356,0.0001939151,0.00005847613,0.0000062506315,0.000078816534,0.99017835,0.00009993391,0.00527045,0.0009900545,0.00058339495],"about_ca_topic_score_codex":0.00012745519,"about_ca_topic_score_gemma":0.00005773982,"teacher_disagreement_score":0.9402768,"about_ca_system_score_codex":0.00022203969,"about_ca_system_score_gemma":0.0003398106,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W2918194691","doi":"","title":"Fault Tolerance of λ-Optimal Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fault tolerance; Computer science; Distributed computing","score_opus":0.01390735851180608,"score_gpt":0.257362109362107,"score_spread":0.24345475085030094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918194691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878094,0.00017631444,0.08326208,0.0012815646,0.004341658,0.00042979175,0.000003751476,0.00040701448,0.032003835],"genre_scores_gemma":[0.9770112,0.000014426752,0.022487037,0.00017269624,0.0000058483715,0.0000061743076,9.877496e-7,0.000006122005,0.00029549788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.00004955827,0.0001910225,0.0002237404,0.00026265514,0.00021438136],"domain_scores_gemma":[0.99907535,0.000036886137,0.0000737424,0.00044672936,0.00028497534,0.000082342725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021305883,0.000083629595,0.00012747385,0.000083100844,0.000088882094,0.00005082148,0.00069452304,0.000045229997,0.00004829003],"category_scores_gemma":[0.000035377518,0.000080011916,0.000045927227,0.0005456162,0.00013000266,0.00032259317,0.0001608248,0.00008067645,0.00008421001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042048932,0.00007033714,0.0005656146,0.0000066778643,0.0000073943156,0.0000016002442,0.00055063854,0.00018498913,0.0005707728,0.9937407,0.0026815033,0.0016156068],"study_design_scores_gemma":[0.0022898319,0.0010411226,0.0033820807,0.0000668346,0.000006476241,0.000011029241,0.000044386885,0.27811128,0.04292024,0.6584406,0.013187891,0.0004982303],"about_ca_topic_score_codex":0.000012947844,"about_ca_topic_score_gemma":0.0000013129348,"teacher_disagreement_score":0.33530006,"about_ca_system_score_codex":0.000011478476,"about_ca_system_score_gemma":0.000050389503,"threshold_uncertainty_score":0.32627913},"labels":[],"label_agreement":null},{"id":"W2919974563","doi":"10.1007/s10878-007-9126-9","title":"Priority algorithms for the subset-sum problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Algorithm; Computer science; Subset sum problem; Mathematics; Combinatorics; Discrete mathematics; Knapsack problem","score_opus":0.0313018334077141,"score_gpt":0.27724368333323646,"score_spread":0.24594184992552237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919974563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010983313,0.00017292645,0.99299735,0.0024822815,0.0034155995,0.00047060812,0.0000014886072,0.000039659724,0.00031026057],"genre_scores_gemma":[0.03822669,0.0007684382,0.9596705,0.00021112393,0.00082724524,0.000022606755,0.0000045218662,0.000021595977,0.0002472863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983497,0.00012222464,0.000565976,0.0001524727,0.0005782848,0.00023128632],"domain_scores_gemma":[0.9974913,0.0003148159,0.00051755994,0.00026778106,0.0012896819,0.00011886452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010914009,0.00012556247,0.00022382887,0.00013251326,0.00043503795,0.00016704666,0.00086481683,0.00008695423,0.000014155336],"category_scores_gemma":[0.00024311393,0.00008712402,0.00014923903,0.0005061924,0.00006572744,0.0010019388,0.00008503571,0.00022414998,0.0000025826075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008201629,0.00027087555,0.00018157317,0.00001830382,0.00007046378,0.000010361179,0.0010063231,0.9027239,0.000031612635,0.083992414,0.0069475323,0.004664611],"study_design_scores_gemma":[0.0026623628,0.0005078315,0.0001204439,0.00001971435,0.000019596617,0.00011529689,0.000018892366,0.97409236,0.00025412554,0.008611847,0.01342388,0.00015363649],"about_ca_topic_score_codex":0.0000038499247,"about_ca_topic_score_gemma":1.4902481e-7,"teacher_disagreement_score":0.07538057,"about_ca_system_score_codex":0.000077911376,"about_ca_system_score_gemma":0.00037024057,"threshold_uncertainty_score":0.35528144},"labels":[],"label_agreement":null},{"id":"W2922802510","doi":"10.22215/etd/2018-12842","title":"Novel Solutions and Applications of the Object Partitioning Problem","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Benchmark (surveying); Computer science; Block (permutation group theory); Theoretical computer science; Object (grammar); Big data; Process (computing); Automaton; Cellular automaton; Distributed computing; Data mining; Algorithm; Artificial intelligence; Programming language; Mathematics; Geography; Combinatorics","score_opus":0.023386249619743005,"score_gpt":0.2739348956252917,"score_spread":0.2505486460055487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922802510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007865304,0.00008305782,0.9270631,0.00033079463,0.000119088705,0.0006548912,0.000008316786,0.00007438414,0.071587704],"genre_scores_gemma":[0.09658794,0.00030581292,0.79582995,0.00047121773,0.00026372215,0.0014969539,0.0003701279,0.00005628497,0.10461799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991565,0.000025617006,0.00022111788,0.00023941284,0.00020768972,0.0001496963],"domain_scores_gemma":[0.99909747,0.00003359878,0.00015645515,0.00038595736,0.0002846955,0.000041849788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019675805,0.00009337821,0.00010273423,0.00008005448,0.00034689013,0.000100168734,0.00047407043,0.00008623522,0.00004307229],"category_scores_gemma":[0.000019307452,0.00006760522,0.00004696551,0.0004445013,0.00006404129,0.0001633912,0.00011554137,0.000116477386,0.000011591392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022843737,0.00013940567,0.000079891724,0.00018884457,0.00004145651,4.214901e-8,0.0021705455,0.0003964743,0.0015684854,0.9737233,0.0032676486,0.018421646],"study_design_scores_gemma":[0.0031256033,0.0005781198,0.025624728,0.0019474584,0.0002811812,0.00006538894,0.0036886178,0.5113848,0.025020469,0.20632778,0.21895717,0.0029986666],"about_ca_topic_score_codex":0.000058006743,"about_ca_topic_score_gemma":0.00041240046,"teacher_disagreement_score":0.7673955,"about_ca_system_score_codex":0.000013916701,"about_ca_system_score_gemma":0.00018273167,"threshold_uncertainty_score":0.2756861},"labels":[],"label_agreement":null},{"id":"W2923289556","doi":"","title":"A new dog learns old tricks: RL finds classic optimization algorithms","year":2019,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Optimization algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.04493808541385731,"score_gpt":0.3381104561314346,"score_spread":0.2931723707175773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923289556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067829597,0.000008499437,0.87449175,0.008504178,0.0008317069,0.00031849465,0.000004096541,0.00030612163,0.11485684],"genre_scores_gemma":[0.6021023,0.00017470066,0.18133925,0.0007133868,0.0002675867,0.00007548089,0.00023891398,0.00004102979,0.21504734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767417,0.00018377326,0.00037866685,0.00065046124,0.0008150934,0.00029781536],"domain_scores_gemma":[0.9983796,0.00023045913,0.00022407206,0.0004684504,0.0005105902,0.00018682229],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002664274,0.0001926355,0.00017674324,0.00046959863,0.00019505931,0.0007662723,0.001055901,0.000101026235,0.0041226116],"category_scores_gemma":[0.00029547652,0.00019667207,0.00010544441,0.0006416918,0.000035606183,0.0009998586,0.00022776461,0.0005148779,0.0011985829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014044564,0.000090157395,0.0043659313,0.000004623503,0.00005804302,0.000006903191,0.0016269928,0.75925934,0.0002558879,0.20757696,0.00234053,0.0244006],"study_design_scores_gemma":[0.0008975734,0.00016182427,0.0015284349,0.000047073758,0.0000048312327,0.000009516308,0.00026713937,0.9873877,0.000114127564,0.0017966082,0.007555102,0.00023005749],"about_ca_topic_score_codex":0.00013729699,"about_ca_topic_score_gemma":0.0000062732593,"teacher_disagreement_score":0.6931525,"about_ca_system_score_codex":0.000109539265,"about_ca_system_score_gemma":0.00031062798,"threshold_uncertainty_score":0.9995791},"labels":[],"label_agreement":null},{"id":"W2924103313","doi":"10.1109/tnnls.2019.2900639","title":"A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Discretization; Markov chain; Automaton; Property (philosophy); Convergence (economics); Combinatorial analysis; Computer science; Finite-state machine; Asymptotic analysis; Monotone polygon; Mathematical economics; Dilemma; Mathematics; Applied mathematics; Theoretical computer science; Algorithm; Combinatorics; Machine learning; Epistemology; Mathematical analysis; Economics; Philosophy","score_opus":0.007687722662617119,"score_gpt":0.22373970002921673,"score_spread":0.21605197736659962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924103313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38549048,0.0001201018,0.6122376,0.00028484123,0.00079396146,0.00079638074,0.000005188726,0.000101053774,0.00017041966],"genre_scores_gemma":[0.9968819,0.00001984576,0.00006027652,0.000031344567,0.000011343414,0.000025628444,0.0000013124694,0.000010667883,0.0029576758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979346,0.0008503136,0.00036130167,0.00026286038,0.00038572174,0.00020523508],"domain_scores_gemma":[0.9986449,0.000486972,0.0003270393,0.0003793499,0.00010940302,0.000052374362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046783814,0.00013703374,0.00035165806,0.0001402976,0.00039716394,0.000119274555,0.0005228997,0.00008612919,0.00003757445],"category_scores_gemma":[0.00001614254,0.000082535254,0.00026033397,0.0014500135,0.00009773515,0.00014416369,0.00001908032,0.0006168367,0.0000024811657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009263051,0.000027212613,0.003196276,0.000016192984,0.000115897645,3.3548915e-7,0.0005767752,0.99379903,0.0005471786,0.00010044015,0.000005050464,0.0016063616],"study_design_scores_gemma":[0.0002992395,0.000116354764,0.0031143553,0.00007646459,0.00016175686,0.000003736972,0.00011925488,0.9958048,0.000093193754,6.84448e-7,0.000118161275,0.00009199233],"about_ca_topic_score_codex":0.00011049283,"about_ca_topic_score_gemma":0.000010686295,"teacher_disagreement_score":0.6121773,"about_ca_system_score_codex":0.000018663213,"about_ca_system_score_gemma":0.000026139565,"threshold_uncertainty_score":0.336569},"labels":[],"label_agreement":null},{"id":"W2927658665","doi":"10.1007/11970125_10","title":"A Randomized Algorithm for Online Unit Clustering","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Computer science; Online algorithm; Partition (number theory); Cluster analysis; Randomized algorithm; Upper and lower bounds; Extension (predicate logic); Algorithm; Set (abstract data type); Partition problem; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.050693750502957165,"score_gpt":0.31263577829739636,"score_spread":0.2619420277944392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927658665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.774874e-7,0.0002470288,0.99401313,0.0006945938,0.0013594673,0.0013817713,0.000014057117,0.00020309007,0.002085885],"genre_scores_gemma":[0.00016237369,0.000087963606,0.9958948,0.002040908,0.0004257916,0.000023732802,0.000023458742,0.000036676753,0.0013043043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963089,0.000059488975,0.00071546074,0.0012512897,0.00088548433,0.000779341],"domain_scores_gemma":[0.99651045,0.0014878878,0.0002898688,0.0009603308,0.0005209464,0.00023051318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030435636,0.00047099573,0.0008314825,0.0011713045,0.00026124733,0.0005661833,0.0027626082,0.0003122001,0.000024073252],"category_scores_gemma":[0.00020493465,0.00040885506,0.00024533796,0.0006271122,0.0007143156,0.00048261488,0.0011461953,0.0006472978,0.0000151434115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013500426,0.000025472145,3.2668297e-7,0.000027442471,0.000013246612,0.000018859357,0.0002686057,0.05471187,0.0000039159668,0.008402621,0.000007726537,0.9363849],"study_design_scores_gemma":[0.015578635,0.000091238006,8.453327e-7,0.00021088151,0.000006819658,0.00002898874,7.950408e-8,0.9249141,0.00006360791,0.05566439,0.0030029805,0.00043742606],"about_ca_topic_score_codex":0.000015930053,"about_ca_topic_score_gemma":0.00009163296,"teacher_disagreement_score":0.9359475,"about_ca_system_score_codex":0.00016334368,"about_ca_system_score_gemma":0.00048992265,"threshold_uncertainty_score":0.9998363},"labels":[],"label_agreement":null},{"id":"W2931307493","doi":"10.1007/s00453-024-01207-6","title":"Exploration of High-Dimensional Grids by Finite State Machines","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Computer science; Distributed computing; Algorithm","score_opus":0.015531657022182508,"score_gpt":0.25657313443856766,"score_spread":0.24104147741638515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931307493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089125644,0.00029165775,0.9949771,0.0028491123,0.00043714562,0.000096604104,0.000037709273,0.00016871061,0.000250702],"genre_scores_gemma":[0.5638287,0.00023234129,0.42651802,0.00081801985,0.00017447809,0.000055012875,0.00024114507,0.00004018524,0.008092063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913114,0.00004915854,0.00018587206,0.00023169494,0.00026383405,0.00013829913],"domain_scores_gemma":[0.9995367,0.00010217518,0.000029121455,0.00019135047,0.00008343182,0.000057227957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017552024,0.000079845246,0.00009231182,0.00010311041,0.00004563276,0.00011223443,0.00024686207,0.00002661123,0.000056036064],"category_scores_gemma":[0.000017868984,0.00006761363,0.00003302882,0.00037829517,0.00003255388,0.0008007899,0.000108258326,0.00008975927,0.00009233177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011039529,0.00017427352,0.000010303535,0.00010287288,0.000089162735,0.000059925635,0.0018042447,0.05249048,0.003433871,0.085320905,0.07125911,0.7852438],"study_design_scores_gemma":[0.00012061545,0.00006659799,0.000010352922,0.00002265131,0.0000020702212,0.000003650598,0.0000020505186,0.97077966,0.0034258442,0.01804439,0.0074347304,0.00008737706],"about_ca_topic_score_codex":0.000058752856,"about_ca_topic_score_gemma":0.0000019666884,"teacher_disagreement_score":0.9182892,"about_ca_system_score_codex":0.000013392999,"about_ca_system_score_gemma":0.000058824255,"threshold_uncertainty_score":0.2757204},"labels":[],"label_agreement":null},{"id":"W2932187539","doi":"10.1109/irc.2019.00051","title":"Identifying Hazardous Shapes in the Plane","year":2019,"lang":"en","type":"article","venue":"2019 Third IEEE International Conference on Robotic Computing (IRC)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Computer science; Mobile robot; Artificial intelligence; A priori and a posteriori; Regular polygon; Hazardous waste; Line (geometry); Set (abstract data type); Combinatorics; Algorithm; Mathematics; Engineering; Geometry; Programming language","score_opus":0.07119261139089722,"score_gpt":0.3251178967372028,"score_spread":0.2539252853463056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932187539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049401674,0.000035670404,0.8667509,0.011403428,0.0045874533,0.00076610723,0.0000048305933,0.00028091535,0.06676903],"genre_scores_gemma":[0.9880687,0.000024602949,0.008443123,0.0015916133,0.0001251732,0.0000057932066,0.000012954319,0.000011375659,0.0017166629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758595,0.00020048612,0.00043082656,0.0005331275,0.0008654152,0.00038421422],"domain_scores_gemma":[0.99873173,0.00036397122,0.00018390582,0.00044096692,0.00021327769,0.00006614295],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000927772,0.00020478883,0.00022427592,0.00029230182,0.00011987486,0.0008225734,0.0021036179,0.00007593797,0.00020326607],"category_scores_gemma":[0.00006437538,0.0001634114,0.00008086515,0.00031785504,0.00004407487,0.00038553376,0.00025781913,0.0004965003,0.0012487683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023054508,0.00022565282,0.0018499405,0.000030516168,0.000052215823,0.000063461615,0.0036578958,0.46732426,0.0013806127,0.5139904,0.0037051279,0.007696868],"study_design_scores_gemma":[0.00052092026,0.00009176181,0.004311572,0.00020299754,0.00000237046,0.000043725286,0.00016677252,0.9898221,0.00009025714,0.0042167623,0.0003074335,0.00022335624],"about_ca_topic_score_codex":0.00009449438,"about_ca_topic_score_gemma":0.000028178198,"teacher_disagreement_score":0.938667,"about_ca_system_score_codex":0.00008655726,"about_ca_system_score_gemma":0.00013362773,"threshold_uncertainty_score":0.9995289},"labels":[],"label_agreement":null},{"id":"W2933135745","doi":"10.1007/s10044-019-00817-z","title":"On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm","year":2019,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Deadlock; Computer science; Cellular automaton; Automaton; Object (grammar); Property (philosophy); Field (mathematics); Distributed computing; Theoretical computer science; Learning automata; Artificial intelligence; State (computer science); Algorithm; Mathematics","score_opus":0.014976528653831232,"score_gpt":0.27659150646443487,"score_spread":0.2616149778106036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2933135745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068242095,0.000049239563,0.92863315,0.002415669,0.000015384783,0.00035451207,0.0000017457346,0.000043753415,0.00024443323],"genre_scores_gemma":[0.9977152,0.000027336733,0.001294697,0.0006705836,0.000027211181,0.00008639224,0.000008932323,0.0000048056586,0.00016485307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990185,0.00009951776,0.000205759,0.00027549363,0.00024562347,0.00015509101],"domain_scores_gemma":[0.9990474,0.0001841495,0.00012244393,0.0005705638,0.00003836801,0.000037070073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168678,0.00008658897,0.000113774804,0.00010487447,0.00045069415,0.00045492974,0.0005096526,0.000024456001,0.000036726615],"category_scores_gemma":[0.000007230513,0.00005084204,0.00009361264,0.0009803895,0.000024072111,0.00013034052,0.00011352192,0.00010010594,0.00004057179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000421934,0.00033844396,0.09823907,0.00008037083,0.0013820976,0.0000011276154,0.0061377087,0.32984632,0.012862718,0.22074984,0.00036041587,0.3299977],"study_design_scores_gemma":[0.000064092266,0.000009213102,0.0062464154,0.000008461308,0.00008257101,0.0000014869366,0.00007698382,0.9903165,0.0007460854,0.0013345822,0.0010259763,0.00008759564],"about_ca_topic_score_codex":0.0001792765,"about_ca_topic_score_gemma":0.00029786993,"teacher_disagreement_score":0.9294731,"about_ca_system_score_codex":0.00001980579,"about_ca_system_score_gemma":0.000020333466,"threshold_uncertainty_score":0.4386898},"labels":[],"label_agreement":null},{"id":"W2937446061","doi":"10.48550/arxiv.1904.04374","title":"Collision-aware Task Assignment for Multi-Robot Systems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bidding; Robot; Collision avoidance; Task (project management); Collision; Computer science; Function (biology); Reduction (mathematics); Binary number; Mathematical optimization; Distributed computing; Artificial intelligence; Engineering; Mathematics; Computer security","score_opus":0.16850559888178573,"score_gpt":0.23224778061514362,"score_spread":0.06374218173335788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937446061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008334842,0.000067524576,0.9946407,0.00011171466,0.001649038,0.0018192384,0.00007908503,0.00024781522,0.00055141945],"genre_scores_gemma":[0.9693239,0.00017829082,0.015577323,0.00010228046,0.000063005646,0.000013861615,0.00007306576,0.000029593959,0.014638725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977362,0.00017876597,0.00026485024,0.0012129511,0.00016366321,0.0004435416],"domain_scores_gemma":[0.99761075,0.00015812556,0.0002859252,0.0013177284,0.00039733358,0.0002301196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004102055,0.00031414998,0.0003968293,0.00026373143,0.00020453845,0.00034284068,0.0019725903,0.00033049067,0.000014143015],"category_scores_gemma":[0.00003421563,0.00033838328,0.00022395133,0.0003905575,0.000054127962,0.00034465626,0.0017389362,0.00037317816,0.00016626823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122558995,0.00010343346,0.00030749378,0.00018022028,0.000061211686,0.000024887036,0.00011971757,0.95284617,0.000012514995,0.044716183,0.0015329776,0.00008294874],"study_design_scores_gemma":[0.0009682319,0.0000814203,0.000071083385,0.00015420787,0.00002488672,0.0000014944052,0.0000797037,0.99412715,0.000027490096,0.00076564465,0.0033020712,0.00039663684],"about_ca_topic_score_codex":0.00009232932,"about_ca_topic_score_gemma":0.000009057164,"teacher_disagreement_score":0.97906333,"about_ca_system_score_codex":0.000372302,"about_ca_system_score_gemma":0.00038730158,"threshold_uncertainty_score":0.99990684},"labels":[],"label_agreement":null},{"id":"W2938806477","doi":"10.4230/lipics.icalp.2019.137","title":"Energy Consumption of Group Search on a Line","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université de Sherbrooke; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Bounded function; Line (geometry); Energy (signal processing); Computer science; Energy consumption; Constant (computer programming); Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry; Electrical engineering","score_opus":0.050881177732604296,"score_gpt":0.30483765629693776,"score_spread":0.25395647856433345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938806477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00854307,0.00007129202,0.9819118,0.0006863113,0.0016209068,0.0016290534,0.00066611206,0.00023783481,0.004633651],"genre_scores_gemma":[0.8563878,0.0013550337,0.13060735,0.0051316926,0.00023260863,0.00042032142,0.003936964,0.00013588103,0.0017923604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959717,0.00012434287,0.0015174937,0.0005304087,0.0010967866,0.0007592737],"domain_scores_gemma":[0.9963047,0.00025142246,0.0007645016,0.0017678335,0.0006625253,0.0002489974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010691724,0.0005302877,0.00076517445,0.00072302815,0.00016159711,0.00049736066,0.0022672329,0.0005134427,0.00007245725],"category_scores_gemma":[0.000059920512,0.0004885305,0.0004023895,0.000292863,0.00014868943,0.00081768335,0.0022432061,0.0009740186,0.00019379586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080805615,0.0034765732,0.0044988026,0.014150484,0.0013283967,0.000015396903,0.021759002,0.4345577,0.00020666183,0.36036682,0.032253694,0.12657839],"study_design_scores_gemma":[0.0022090592,0.0006699414,0.000112342,0.0006808784,0.000018064316,0.00001042658,0.000083421495,0.96698433,0.0009681861,0.0008926356,0.026810052,0.0005606852],"about_ca_topic_score_codex":0.00004166994,"about_ca_topic_score_gemma":0.000009759972,"teacher_disagreement_score":0.8513044,"about_ca_system_score_codex":0.00018233489,"about_ca_system_score_gemma":0.00024787744,"threshold_uncertainty_score":0.99975663},"labels":[],"label_agreement":null},{"id":"W2942755285","doi":"10.1007/s00453-020-00728-0","title":"Online Bin Covering with Advice","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Advice (programming); Bin; Competitive analysis; Online algorithm; Bin packing problem; Binary logarithm; Mathematics; Theory of computation; Combinatorics; Computer science; Algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.02001191323843362,"score_gpt":0.2351358559611555,"score_spread":0.21512394272272187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942755285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007947291,0.000028551298,0.98446745,0.01195123,0.00004399083,0.00010246368,0.0000049120704,0.00036602496,0.0022406313],"genre_scores_gemma":[0.08080465,0.000022642893,0.9111117,0.0074871047,0.00014559862,0.00000768488,0.000014186775,0.000016173897,0.0003902407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992752,0.000022831784,0.000097214135,0.00023728414,0.00019499028,0.00017245322],"domain_scores_gemma":[0.99954545,0.000025802006,0.000029378913,0.00018712948,0.00006103142,0.00015119277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045713154,0.00007449124,0.000084110594,0.000028161989,0.000055506967,0.00008859575,0.00044120138,0.000021462994,0.000037047124],"category_scores_gemma":[0.00001778302,0.00006112297,0.000017748995,0.00042668925,0.000020007436,0.0002862252,0.00014902109,0.000108631524,0.000096632895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008720313,0.0008948233,0.0009072768,0.00018139255,0.00022589718,0.0004603204,0.009830072,0.07797402,0.003134917,0.060888667,0.028933486,0.81648195],"study_design_scores_gemma":[0.00028002146,0.0001597899,0.000108960856,0.000008949503,0.0000017957361,0.0000077709155,0.00002522929,0.96695405,0.0006260182,0.000088868546,0.03161834,0.00012020819],"about_ca_topic_score_codex":0.000014051591,"about_ca_topic_score_gemma":0.0000027246213,"teacher_disagreement_score":0.88898003,"about_ca_system_score_codex":0.0000106889565,"about_ca_system_score_gemma":0.000053845666,"threshold_uncertainty_score":0.24925223},"labels":[],"label_agreement":null},{"id":"W2944911880","doi":"10.1007/978-3-030-19823-7_38","title":"Optimizing Self-organizing Lists-on-Lists Using Enhanced Object Partitioning","year":2019,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Context (archaeology); Object (grammar); Hierarchy; Data structure; De facto; Theoretical computer science; Hierarchical clustering; Information retrieval; Field (mathematics); Cluster analysis; Data mining; Artificial intelligence; Programming language; Geography; Mathematics","score_opus":0.013421304868717567,"score_gpt":0.266610094672609,"score_spread":0.2531887898038914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944911880","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019416065,0.0068738656,0.4923299,0.0014586352,0.00039700465,0.0011567315,0.0000099118215,0.0013225743,0.49625725],"genre_scores_gemma":[0.21747543,0.080919705,0.69095206,0.0023877828,0.000049378563,0.00016169777,0.00029854148,0.00009897995,0.007656445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983451,0.000051266743,0.00076348765,0.0002904073,0.00027304236,0.0002767415],"domain_scores_gemma":[0.99764854,0.0001509109,0.00065696123,0.001212015,0.0002791993,0.000052346855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038434856,0.0002802151,0.00034698052,0.0011032071,0.00030419463,0.00025972977,0.0011418123,0.0004252772,0.000035400873],"category_scores_gemma":[0.000090700385,0.00030992788,0.000044368815,0.00036563902,0.00015185363,0.0029250223,0.00065213884,0.00078092853,0.0001119464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006048551,0.000016405987,0.000015357864,0.00008223663,0.000013325679,5.8066826e-7,0.0013603776,0.011436611,0.000017054173,0.9128381,0.00001811059,0.074195795],"study_design_scores_gemma":[0.0023070339,0.00033968568,0.000017276756,0.0023934261,0.000026144213,0.00007602901,0.0008730162,0.34859985,0.0023004366,0.16427085,0.4770588,0.0017374675],"about_ca_topic_score_codex":0.0000041317153,"about_ca_topic_score_gemma":0.000016199792,"teacher_disagreement_score":0.7485672,"about_ca_system_score_codex":0.00023119496,"about_ca_system_score_gemma":0.00016252836,"threshold_uncertainty_score":0.99993527},"labels":[],"label_agreement":null},{"id":"W2944983791","doi":"10.1016/j.jcss.2024.103545","title":"Online computation with untrusted advice","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; Centro de Modelamiento Matemático, Facultad de Ciencias Físicas y Matemáticas","keywords":"Advice (programming); Bidding; Adversarial system; Computer science; Online algorithm; Competitive analysis; Computation; Generalization; Bin packing problem; Pareto principle; Mathematical optimization; Bin; Algorithm; Artificial intelligence; Upper and lower bounds; Mathematics; Business; Marketing","score_opus":0.020594512805411674,"score_gpt":0.28330973365175727,"score_spread":0.2627152208463456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944983791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013006383,0.0007113419,0.9833501,0.0013148802,0.0006911392,0.00006624039,7.812031e-7,0.00009082595,0.0007682996],"genre_scores_gemma":[0.74464136,0.000024692685,0.2550017,0.0001076496,0.00017977954,3.9155898e-7,3.2935682e-7,0.0000030427989,0.000041057796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879146,0.00009863282,0.00031791735,0.00017567398,0.00048006148,0.00013623296],"domain_scores_gemma":[0.9993609,0.00013478819,0.00012385333,0.00006576518,0.0002119344,0.0001027481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008573769,0.00008120916,0.00016136818,0.00029430664,0.00013756931,0.0008718876,0.00039335052,0.000021966647,0.000001443264],"category_scores_gemma":[0.0000030568058,0.00004774241,0.00003318026,0.0007329469,0.000084802,0.0009677553,0.00006717504,0.00010660759,0.0000025555164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035119185,0.00025410895,0.0017753731,0.0011000439,0.00020909696,0.0007284115,0.0075467415,0.32707518,0.00008905474,0.30777526,0.008702342,0.34470928],"study_design_scores_gemma":[0.00019009228,0.00050359324,0.0006419533,0.00042749653,0.0000053195745,0.0011453123,0.00017047007,0.99563396,0.000006226688,0.0002043476,0.0009999246,0.00007127994],"about_ca_topic_score_codex":0.0000047151066,"about_ca_topic_score_gemma":0.000002014009,"teacher_disagreement_score":0.731635,"about_ca_system_score_codex":0.000022879552,"about_ca_system_score_gemma":0.00018207754,"threshold_uncertainty_score":0.8407632},"labels":[],"label_agreement":null},{"id":"W2944999878","doi":"10.7146/brics.v11i2.21827","title":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","year":2004,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Combinatorics; Data structure; Algorithm; Theoretical computer science; Mathematics","score_opus":0.07440722122927845,"score_gpt":0.3161123087104155,"score_spread":0.24170508748113706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944999878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04224288,0.00088355644,0.9505098,0.004074891,0.00035779312,0.00093342026,0.00011972116,0.0003861292,0.0004918353],"genre_scores_gemma":[0.48331398,0.001049673,0.513637,0.00021964023,0.00012908268,0.000047999816,0.00043571016,0.00004214853,0.0011247626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845135,0.000025092606,0.0002823146,0.00062172883,0.0003163225,0.00030321322],"domain_scores_gemma":[0.9986654,0.00007599103,0.000074876654,0.0007885834,0.00022796085,0.00016720637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051612034,0.0001471845,0.00019358637,0.00010271974,0.00034574515,0.00050698186,0.0004673469,0.00007347736,0.000003467715],"category_scores_gemma":[0.0002366147,0.00013385707,0.000018091663,0.00032930193,0.00016304667,0.0008613926,0.0006865498,0.000110150664,7.244622e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023119092,0.0012378698,0.12562661,0.0018393265,0.00094553974,0.0078074182,0.031245748,0.03589704,0.0023258736,0.32869217,0.012456894,0.45169434],"study_design_scores_gemma":[0.0058798227,0.0019440828,0.30681705,0.00030297355,0.00014612086,0.03460127,0.0012638929,0.4288435,0.004919858,0.07519338,0.13657877,0.0035092756],"about_ca_topic_score_codex":0.00037118417,"about_ca_topic_score_gemma":0.00043992617,"teacher_disagreement_score":0.44818506,"about_ca_system_score_codex":0.000028169361,"about_ca_system_score_gemma":0.00022566102,"threshold_uncertainty_score":0.5458533},"labels":[],"label_agreement":null},{"id":"W2946277238","doi":"10.65109/shqf6416","title":"Efficient Allocation of Free Stuff","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constant (computer programming); Approximation algorithm; Matching (statistics); Zero (linguistics); Class (philosophy); Value (mathematics); Mathematics; Greedy algorithm; Mathematical optimization; Mathematical economics; Computer science; Combinatorics; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.013164327364169923,"score_gpt":0.24283661761563527,"score_spread":0.22967229025146535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946277238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023964338,0.00001059069,0.9205331,0.0008465291,0.00010344495,0.00013871852,2.393725e-7,0.000054422628,0.054348584],"genre_scores_gemma":[0.9290242,0.0000021395497,0.0681487,0.00013045329,0.0000034484583,0.0000018455372,5.3773283e-7,0.0000015725296,0.0026870847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956095,0.000017265964,0.000085856365,0.00009988071,0.0001663488,0.000069689275],"domain_scores_gemma":[0.9994745,0.000020479114,0.000024478279,0.0003753985,0.00008038443,0.00002471649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015159485,0.000026595493,0.000042903197,0.000043353575,0.000011168369,0.000019579598,0.00040144898,0.000013267827,0.00014392534],"category_scores_gemma":[0.00001480627,0.000021352604,0.000014750798,0.00017388114,0.000007888424,0.000051239174,0.00013055558,0.000022233651,0.0001589323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013493982,0.00012630694,0.0007216283,0.000013744707,0.000004963864,1.5582643e-7,0.0005097674,0.13531314,0.0027885484,0.8532319,0.001364854,0.0059236162],"study_design_scores_gemma":[0.00025288292,0.00004322281,0.0010191187,0.0000038065084,2.8839867e-7,2.9997284e-7,0.00001570207,0.9947524,0.0025220914,0.00063004333,0.0007247156,0.000035408662],"about_ca_topic_score_codex":0.0000115806115,"about_ca_topic_score_gemma":0.0000015127476,"teacher_disagreement_score":0.9050599,"about_ca_system_score_codex":0.0000067138944,"about_ca_system_score_gemma":0.000025892126,"threshold_uncertainty_score":0.20428061},"labels":[],"label_agreement":null},{"id":"W2947061402","doi":"10.22215/etd/2018-13392","title":"On Designing Adaptive Data Structures with Adaptive Data \"Sub\"-Structures","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hierarchy; Probabilistic logic; Reinforcement learning; Automaton; Locality; Object (grammar); Process (computing); Transitive relation; State (computer science); Adaptation (eye); Artificial intelligence; Theoretical computer science; Data mining; Algorithm; Programming language; Mathematics","score_opus":0.09424601612719963,"score_gpt":0.3231868164055095,"score_spread":0.22894080027830988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947061402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042004633,0.00013935965,0.9733041,0.00008613831,0.00072074425,0.00088006695,0.0003607407,0.00036034294,0.023728484],"genre_scores_gemma":[0.05071506,0.00007593212,0.9288663,0.00057811197,0.00031926937,0.0000276168,0.014790139,0.000104865765,0.004522684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575835,0.0002065923,0.00038807586,0.0020445231,0.0010779868,0.00052446534],"domain_scores_gemma":[0.9939424,0.00023194372,0.0003789275,0.0047745598,0.000462266,0.00020991823],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00042197478,0.0005595079,0.00044019104,0.000332863,0.00038140686,0.0005960973,0.0078154495,0.00030243013,0.00024134539],"category_scores_gemma":[0.00015723381,0.0004025075,0.000033989774,0.00054566114,0.00014399551,0.0016803723,0.0012324748,0.0006278801,0.00006729853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016344606,0.0001814412,0.000020391857,0.00017922162,0.0011157907,0.00012599444,0.007081193,0.007613803,0.0003532878,0.6539794,0.22783041,0.09988459],"study_design_scores_gemma":[0.0018210309,0.0026203755,0.0010327478,0.0006416283,0.0001710419,0.000041191663,0.0031651158,0.9180101,0.0070554777,0.058522556,0.00433212,0.0025866197],"about_ca_topic_score_codex":0.00014280049,"about_ca_topic_score_gemma":0.0010624796,"teacher_disagreement_score":0.9103963,"about_ca_system_score_codex":0.00005655352,"about_ca_system_score_gemma":0.00072531315,"threshold_uncertainty_score":0.9998427},"labels":[],"label_agreement":null},{"id":"W2949079286","doi":"10.48550/arxiv.1410.2295","title":"Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Patrolling; Robot; Computer science; Workspace; Triangulation; Focus (optics); Mobile robot; Swarm behaviour; Graph; Distributed computing; Simple (philosophy); Mathematical optimization; Artificial intelligence; Theoretical computer science; Mathematics; Geography","score_opus":0.07641307542284566,"score_gpt":0.206084841274995,"score_spread":0.12967176585214935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949079286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011647193,0.00005711062,0.985988,0.00042386857,0.00033302567,0.0007529698,0.00001405561,0.0003470921,0.00043664352],"genre_scores_gemma":[0.9921899,0.00008401034,0.004881527,0.0002666156,0.000051474246,0.0000044793355,0.00006097655,0.000025096497,0.0024359394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791116,0.00018993534,0.00026316015,0.0010071658,0.00012255159,0.00050602783],"domain_scores_gemma":[0.9980678,0.00017401439,0.00027362347,0.0008885753,0.00036787495,0.00022812535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037904974,0.0003039064,0.00038694253,0.00032650263,0.00024752636,0.00022632722,0.0015026039,0.00032613025,0.0000053613558],"category_scores_gemma":[0.000067389876,0.00033446323,0.00024934323,0.0007253913,0.00012946552,0.00019980049,0.0008865338,0.00037807535,0.000025717549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053313306,0.00007987479,0.000039836577,0.00006345582,0.000047145786,0.000015358199,0.00025320885,0.9644083,0.000025816647,0.03248034,0.0018278586,0.0007055212],"study_design_scores_gemma":[0.0013488084,0.00012308599,0.00001349146,0.00007497256,0.000033505094,0.0000024884896,0.000041508458,0.98984927,0.00021667522,0.0055535883,0.0023782367,0.00036437303],"about_ca_topic_score_codex":0.00016321708,"about_ca_topic_score_gemma":0.000012450476,"teacher_disagreement_score":0.9811065,"about_ca_system_score_codex":0.00019976,"about_ca_system_score_gemma":0.00020602741,"threshold_uncertainty_score":0.9999107},"labels":[],"label_agreement":null},{"id":"W2949226015","doi":"10.1145/3323165.3323182","title":"Using Time to Break Symmetry","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Time complexity; Computer science; A priori and a posteriori; Graph; Node (physics); PSPACE; Task (project management); Symmetry breaking; Symmetry (geometry); Algorithm; Theoretical computer science; Mathematics; Computational complexity theory; Physics","score_opus":0.02393281051641785,"score_gpt":0.27492755519306006,"score_spread":0.2509947446766422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949226015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004190043,0.0000033725096,0.814478,0.0010346012,0.00007763752,0.00013717308,2.2117275e-7,0.00012445793,0.17995451],"genre_scores_gemma":[0.0857666,5.756603e-7,0.80829054,0.00432767,0.0000272208,0.0000018981144,8.37647e-7,0.000008544112,0.10157612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.000017769551,0.0000648061,0.00015215625,0.00013210441,0.00013538159],"domain_scores_gemma":[0.999595,0.00001771714,0.000009640013,0.0002548168,0.000041690717,0.00008116521],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000119702054,0.00003903411,0.000051517953,0.00007373721,0.00002558366,0.000104004896,0.00031997173,0.000017290078,0.0016102648],"category_scores_gemma":[0.00000765383,0.000033051852,0.00001610468,0.0003289764,0.0000033688052,0.00023367736,0.00018208254,0.000025794108,0.009231832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010853329,0.00024393866,0.0029083136,0.000051235413,0.00004883382,0.000019247005,0.001314416,0.10573117,0.048648983,0.65861577,0.08171631,0.10069096],"study_design_scores_gemma":[0.000097531,0.000030926403,0.00010126239,0.0000056831786,3.362291e-7,0.000006185913,0.000003462381,0.98432046,0.00078306353,0.00031190383,0.0142558245,0.00008338628],"about_ca_topic_score_codex":0.000011606317,"about_ca_topic_score_gemma":3.6045904e-7,"teacher_disagreement_score":0.8785893,"about_ca_system_score_codex":0.000015730495,"about_ca_system_score_gemma":0.000028115068,"threshold_uncertainty_score":0.9993024},"labels":[],"label_agreement":null},{"id":"W2949270856","doi":"10.1137/1.9781611973105.88","title":"Online submodular welfare maximization: Greedy is optimal","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Greedy algorithm; Competitive analysis; Maximization; Monotone polygon; Online algorithm; Mathematical optimization; Greedy randomized adaptive search procedure; Competitive equilibrium; Mathematics; Computer science; Mathematical economics; Upper and lower bounds","score_opus":0.03280591326405214,"score_gpt":0.26941727256939507,"score_spread":0.23661135930534294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949270856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007649151,0.00013055134,0.960669,0.029482529,0.00067666214,0.00068070873,0.00003624482,0.0006163359,0.0069430675],"genre_scores_gemma":[0.03603182,0.00032269044,0.94506127,0.0032209717,0.00023360444,0.00010629916,0.0004276418,0.00005048802,0.014545216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973887,0.000101575395,0.00046998853,0.0009672674,0.0006338344,0.00043861417],"domain_scores_gemma":[0.9974068,0.000018059849,0.00012145275,0.0015914458,0.00060075923,0.00026148336],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020911278,0.0003570039,0.0003478205,0.00025182022,0.00018224839,0.0008524475,0.0022664778,0.00035309163,0.0038584631],"category_scores_gemma":[0.000030652813,0.00032275287,0.00016180653,0.0003741262,0.000058750637,0.00051799574,0.0033315986,0.0006054649,0.00041720193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067921487,0.00096198067,0.0004329884,0.00040142733,0.00022950147,0.000051609913,0.0022099705,0.52620906,0.000022221277,0.34741446,0.079224385,0.042835616],"study_design_scores_gemma":[0.0002569391,0.000039766008,0.0004245155,0.000034706714,0.0000064227956,0.000008221595,0.000027018436,0.97465694,0.000082956685,0.0027259623,0.021303304,0.0004332381],"about_ca_topic_score_codex":0.00020534391,"about_ca_topic_score_gemma":0.000010361981,"teacher_disagreement_score":0.44844788,"about_ca_system_score_codex":0.00006972881,"about_ca_system_score_gemma":0.00017656351,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W2949433202","doi":"10.48550/arxiv.1404.7325","title":"Tight Bounds for Restricted Grid Scheduling","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Syddansk Universitet; University of Waterloo; University of Toronto; Danmarks Frie Forskningsfond; Villum Fonden","keywords":"Bin; Bin packing problem; Grid; Upper and lower bounds; Competitive analysis; Matching (statistics); Online algorithm; Scheduling (production processes); Integer (computer science); Computer science; Mathematics; Mathematical optimization; Combinatorics; Algorithm; Statistics","score_opus":0.08947936903725882,"score_gpt":0.2088021905716253,"score_spread":0.11932282153436648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949433202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010741223,0.000027794915,0.9843071,0.00031770303,0.0009277879,0.00047321923,0.0000142772915,0.00036138395,0.0028294944],"genre_scores_gemma":[0.9280289,0.00016046801,0.067148775,0.00023963398,0.00023826213,0.0000043394957,0.000079167985,0.000026296884,0.0040742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819505,0.00012779621,0.00020236746,0.00096912147,0.00010225496,0.0004033905],"domain_scores_gemma":[0.9980274,0.00016044584,0.00020713052,0.0010480761,0.00034592778,0.00021105677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002917019,0.00024252343,0.0002749412,0.00032705383,0.00026541832,0.00029727974,0.0018237552,0.00028366465,0.000023582272],"category_scores_gemma":[0.00010042231,0.00027707167,0.00019286976,0.00057290733,0.00007536719,0.00031815612,0.001298549,0.00044448036,0.000062456405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016443233,0.00004792872,0.00024124408,0.00008621058,0.000045597673,0.000020278028,0.00008420823,0.7162318,0.00001908191,0.28141502,0.0014390673,0.00035309358],"study_design_scores_gemma":[0.00054875814,0.0000579374,0.0001318819,0.000058040656,0.000020687708,0.0000011885207,0.0000082639845,0.9593199,0.000050940478,0.030446034,0.009033709,0.00032267472],"about_ca_topic_score_codex":0.000034325647,"about_ca_topic_score_gemma":0.000009949926,"teacher_disagreement_score":0.91728765,"about_ca_system_score_codex":0.00014122904,"about_ca_system_score_gemma":0.000303358,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W2949499079","doi":"10.48550/arxiv.1709.06214","title":"Deterministic rendezvous with detection using beeps","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Node (physics); Computer science; Mobile agent; Computer network; Real-time computing; Distributed computing; Engineering","score_opus":0.1397833646239472,"score_gpt":0.214835737831567,"score_spread":0.07505237320761982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949499079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07298944,0.000011785958,0.9236306,0.00002993598,0.00034225875,0.0002417974,0.000004280898,0.00020572818,0.0025441605],"genre_scores_gemma":[0.9897034,0.00004634045,0.0088612605,0.000028871127,0.00004677263,7.154454e-7,0.000004177284,0.000017351655,0.0012910931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984616,0.00011046494,0.00013006263,0.00087134703,0.000114119954,0.00031240183],"domain_scores_gemma":[0.9978804,0.00003921699,0.00030757042,0.0014009996,0.00020378917,0.00016802276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018612274,0.0002368971,0.0002330168,0.00024409912,0.0004705237,0.00039451497,0.0015446092,0.00020440295,0.000012657415],"category_scores_gemma":[0.000034538567,0.00025033928,0.000090499765,0.00023142638,0.0001362141,0.00046781695,0.0012456612,0.0004620296,0.00003053481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003851044,0.000062378625,0.0007449342,0.000084312924,0.00007402225,0.0006434514,0.00022458908,0.980763,0.00007239907,0.013288218,0.000013006752,0.0039911354],"study_design_scores_gemma":[0.00035306485,0.0000848747,0.00033242465,0.000093205,0.000039905153,0.000025171474,0.000013958931,0.9914204,0.00011915622,0.0070106788,0.00017530324,0.00033184435],"about_ca_topic_score_codex":0.00017266918,"about_ca_topic_score_gemma":0.00013145748,"teacher_disagreement_score":0.91671395,"about_ca_system_score_codex":0.00019702275,"about_ca_system_score_gemma":0.00028908698,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W2949738152","doi":"10.1137/1.9781611973082.131","title":"The Dichotomy of List Homomorphisms for Digraphs","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Mathematics","score_opus":0.046986232809474275,"score_gpt":0.27724674275607,"score_spread":0.2302605099465957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949738152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064879256,0.0001811418,0.9582705,0.0008232699,0.0005348801,0.0008377913,0.0000110106475,0.00010562836,0.03917093],"genre_scores_gemma":[0.2985924,0.0015454951,0.67247105,0.00071420165,0.00013604246,0.001140048,0.00005131375,0.000050275157,0.025299165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989082,0.000051154937,0.0002898715,0.00032008023,0.00021459945,0.0002160441],"domain_scores_gemma":[0.9982846,0.00019468201,0.00017675982,0.0009786603,0.00029245295,0.00007286853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005159688,0.00012951647,0.00017784825,0.00007887157,0.00014486513,0.00020388362,0.0019625588,0.0001065298,0.00003796387],"category_scores_gemma":[0.000052753385,0.00008055074,0.00017154966,0.0001395018,0.0001285918,0.000089937195,0.0010330561,0.00018804462,0.0000064117557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006193001,0.000055529687,0.000061517305,0.000069257796,0.000043207685,4.563909e-7,0.00040578446,0.00029099267,0.000017371973,0.9823543,0.0072227702,0.009472612],"study_design_scores_gemma":[0.0006450831,0.00019472218,0.0003079711,0.000108969405,0.000018892468,0.000002749569,0.00003736641,0.262034,0.0033698636,0.66039604,0.07238818,0.0004961791],"about_ca_topic_score_codex":0.00009350985,"about_ca_topic_score_gemma":0.000031059622,"teacher_disagreement_score":0.32195827,"about_ca_system_score_codex":0.000009928417,"about_ca_system_score_gemma":0.00013863706,"threshold_uncertainty_score":0.36469552},"labels":[],"label_agreement":null},{"id":"W2949907273","doi":"10.48550/arxiv.1212.4211","title":"The quadratic balanced optimization problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Knapsack problem; Heuristic; Pairwise comparison; Mathematical optimization; Simple (philosophy); Quadratic equation; Quadratic assignment problem; Mathematics; Continuous knapsack problem; Optimization problem; Matrix (chemical analysis); Quadratic programming; Sequence (biology); Computer science; Algorithm","score_opus":0.06536104432498288,"score_gpt":0.19309573322668527,"score_spread":0.1277346889017024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949907273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005410931,0.00010696571,0.9891285,0.000553756,0.00050809636,0.0005419591,0.0000032936432,0.000291756,0.008324596],"genre_scores_gemma":[0.94971067,0.00082325685,0.043743376,0.0001513536,0.000088687,0.0000060664092,0.000028134993,0.000023663823,0.0054247975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828064,0.0002681507,0.00021955052,0.00063548016,0.00013497393,0.00046121865],"domain_scores_gemma":[0.99800825,0.00014334622,0.00025180177,0.0011623095,0.00024403745,0.00019027716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050697714,0.0002397235,0.00019874048,0.00011720689,0.00045639428,0.00039319062,0.0019686928,0.0002010376,0.00004308424],"category_scores_gemma":[0.000037831956,0.00020601385,0.00012267176,0.0005884698,0.00011145054,0.0005631063,0.0014893276,0.00048383177,0.00011102874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051048205,0.000034220684,0.00021296726,0.000025095987,0.00002672156,0.0000063503367,0.00016907055,0.8043536,0.000002233845,0.19434568,0.0003403245,0.00047864803],"study_design_scores_gemma":[0.00024205545,0.000017993209,0.000087853325,0.000036742218,0.00001743716,0.0000016463844,0.000029323466,0.983392,0.000011481451,0.01487711,0.0010299576,0.0002563757],"about_ca_topic_score_codex":0.00003119748,"about_ca_topic_score_gemma":0.000016310954,"teacher_disagreement_score":0.9491696,"about_ca_system_score_codex":0.00015623665,"about_ca_system_score_gemma":0.0002235238,"threshold_uncertainty_score":0.8401001},"labels":[],"label_agreement":null},{"id":"W2950401695","doi":"10.48550/arxiv.1305.2108","title":"On Advice Complexity of the k-server Problem under Sparse Metrics","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Competitive analysis; Binary logarithm; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Tree (set theory); Omega; Metric (unit); Path (computing); Sequence (biology); Graph; Algorithm; Computer science; Pathwidth; Line graph","score_opus":0.16325824152864088,"score_gpt":0.21404882625197952,"score_spread":0.05079058472333864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950401695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11153535,0.000032186097,0.86036783,0.0011731411,0.0007251274,0.0013208532,0.00002440461,0.00032723745,0.024493894],"genre_scores_gemma":[0.9875712,0.00006181412,0.007870603,0.0003626896,0.000015384057,0.0000013911936,0.0000065088093,0.000014108882,0.0040963152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981707,0.00030515675,0.00023981521,0.0007420304,0.00023513853,0.00030716197],"domain_scores_gemma":[0.9973021,0.00015246408,0.0003604312,0.0016430225,0.00040071495,0.00014126943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033311915,0.00024677152,0.00028553847,0.00028799474,0.00015933382,0.00011121251,0.002890264,0.00021504881,0.00013790409],"category_scores_gemma":[0.000046483343,0.00020694314,0.00021977989,0.001467261,0.00026603515,0.00029568953,0.0030111924,0.00063498074,0.00012873518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004194634,0.00009228723,0.0003747304,0.0000462637,0.000030914813,0.000003177858,0.000067903035,0.42531615,0.000002679469,0.57328314,0.00072772097,0.000050801907],"study_design_scores_gemma":[0.00034871703,0.000043803968,0.0022470218,0.00008271818,0.000020617812,7.365973e-7,0.000023245573,0.6842353,0.00006450254,0.31245306,0.00024547544,0.0002348112],"about_ca_topic_score_codex":0.00043214037,"about_ca_topic_score_gemma":0.00007222843,"teacher_disagreement_score":0.8760358,"about_ca_system_score_codex":0.00017130001,"about_ca_system_score_gemma":0.00023861628,"threshold_uncertainty_score":0.84388965},"labels":[],"label_agreement":null},{"id":"W2950424720","doi":"10.1145/2438645.2438649","title":"Delays Induce an Exponential Memory Gap for Rendezvous in Trees","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Rendezvous; Exponential function; Computer science; Psychology; Mathematics; Physics; Astronomy; Mathematical analysis","score_opus":0.05484617889239228,"score_gpt":0.29676872146558664,"score_spread":0.24192254257319434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950424720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005432632,0.000016949482,0.9909651,0.0019675558,0.00040004056,0.000628081,0.000009417323,0.00018466926,0.00039550348],"genre_scores_gemma":[0.4288826,0.000035914712,0.5686405,0.0004970604,0.000070446324,0.0006455782,0.000012368872,0.00002708019,0.0011884661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859446,0.000093571754,0.00026834974,0.00043099144,0.00025414993,0.00035848765],"domain_scores_gemma":[0.9988048,0.0001227632,0.00004427964,0.0007460403,0.000115203096,0.00016690452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023745844,0.0001498804,0.00015047262,0.00030195815,0.00019452507,0.0002000009,0.0008848459,0.00010493577,0.00020130076],"category_scores_gemma":[0.000023113718,0.00014672155,0.00007696409,0.00043560928,0.000039426217,0.0011454828,0.000014254359,0.00022425262,0.00008965113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001517187,0.000658308,0.0000067573083,0.000010407515,0.00002385952,0.0000050708577,0.0019072043,0.03222656,0.0011777127,0.00083597196,0.00028140418,0.9628516],"study_design_scores_gemma":[0.0019360905,0.0006493993,0.0010021408,0.000023652708,0.000008373978,0.000018020319,0.00036331246,0.9823703,0.0040697614,0.008203689,0.00093775475,0.0004174784],"about_ca_topic_score_codex":0.00029631337,"about_ca_topic_score_gemma":0.0001833594,"teacher_disagreement_score":0.9624341,"about_ca_system_score_codex":0.000057469842,"about_ca_system_score_gemma":0.00007108298,"threshold_uncertainty_score":0.5983131},"labels":[],"label_agreement":null},{"id":"W2950450215","doi":"10.1142/s0129054121500209","title":"Search on a Line by Byzantine Robots","year":2021,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"National Science Foundation","keywords":"Robot; Line (geometry); Computer science; Algorithm; Fault tolerance; Mobile robot; Distributed computing; Artificial intelligence; Mathematics; Geometry","score_opus":0.050519827703159915,"score_gpt":0.3664393369516543,"score_spread":0.3159195092484944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950450215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011375961,0.00010523796,0.96963847,0.014025494,0.004239809,0.00012997627,0.000013037913,0.000024914581,0.000447094],"genre_scores_gemma":[0.5210837,0.0002938765,0.47717953,0.0010356025,0.00027713337,0.0000029988214,0.000025854824,0.000010479443,0.00009083062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952184,0.00013339354,0.0009907106,0.0005041111,0.0028841202,0.00026924233],"domain_scores_gemma":[0.99136305,0.00021699833,0.0008898349,0.0006715733,0.0066521675,0.00020637401],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018421299,0.00020424527,0.00035798937,0.0011974231,0.00013699835,0.0015550769,0.006376937,0.00007849989,0.00005102158],"category_scores_gemma":[0.00024240106,0.00018935776,0.00022049526,0.00086537976,0.00038747373,0.0013923474,0.0025320186,0.0007000273,0.000009555809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025388115,0.0009673322,0.00018480809,0.00002705758,0.00019581337,0.00006449849,0.0010033896,0.8733783,0.0028780042,0.021314003,0.0045496635,0.09541177],"study_design_scores_gemma":[0.0007954487,0.0004410817,0.00043885477,0.0006486674,0.000008890485,0.00015458507,0.000016498509,0.98004925,0.013122445,0.0012558051,0.0027898063,0.0002786556],"about_ca_topic_score_codex":0.000020566138,"about_ca_topic_score_gemma":0.0000015576891,"teacher_disagreement_score":0.50970775,"about_ca_system_score_codex":0.00015557598,"about_ca_system_score_gemma":0.0022396608,"threshold_uncertainty_score":0.9994814},"labels":[],"label_agreement":null},{"id":"W2950585818","doi":"10.48550/arxiv.1709.06217","title":"Deterministic meeting of sniffing agents in the plane","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Null (SQL); Plane (geometry); Set (abstract data type); Computer science; Reading (process); Monotone polygon; Moment (physics); Constant (computer programming); Mathematics; Geometry; Physics; Data mining","score_opus":0.17791746566357755,"score_gpt":0.2409973909572207,"score_spread":0.06307992529364315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950585818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3750483,0.000054502823,0.57620585,0.0003597921,0.0006919177,0.0008184799,0.000017399268,0.00012309488,0.046680626],"genre_scores_gemma":[0.99814135,0.00008776255,0.0013109217,0.000055200548,0.00001713289,5.6241964e-7,0.0000057665497,0.0000053397357,0.0003759463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887395,0.00019370255,0.00017054308,0.00044401325,0.0001047552,0.0002130439],"domain_scores_gemma":[0.9983932,0.00015257738,0.00029256137,0.0010425994,0.000070191076,0.000048881146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655749,0.00013388859,0.0001914158,0.00018052706,0.00014594116,0.00014433177,0.0028295312,0.00011188993,0.000010470735],"category_scores_gemma":[0.00010692836,0.00012314778,0.00007636207,0.00018544658,0.00008268398,0.0001785251,0.0013092746,0.00035299963,0.000014616367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018571682,0.00015710254,0.013973129,0.00023951806,0.000045651344,0.00081326294,0.002776212,0.88697666,0.000020993059,0.092841975,0.00024076602,0.0018961824],"study_design_scores_gemma":[0.0003233079,0.000028538496,0.004534862,0.00021399553,0.000012605307,0.0000033322297,0.00007414249,0.98303515,0.000023555407,0.011387689,0.00018301903,0.00017983149],"about_ca_topic_score_codex":0.00017727437,"about_ca_topic_score_gemma":0.00006478351,"teacher_disagreement_score":0.62309307,"about_ca_system_score_codex":0.000044539232,"about_ca_system_score_gemma":0.00012091729,"threshold_uncertainty_score":0.52580196},"labels":[],"label_agreement":null},{"id":"W2950689051","doi":"10.48550/arxiv.1410.1077","title":"Optimal Distributed Searching in the Plane with and without Uncertainty","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Visibility; Search and rescue; Drone; Computer science; Robot; Task (project management); Plane (geometry); Artificial intelligence; Search problem; Mathematical optimization; Algorithm; Mathematics; Engineering; Geography; Geometry","score_opus":0.05306328905859759,"score_gpt":0.2027070210942009,"score_spread":0.14964373203560333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950689051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27601805,0.0000091310485,0.7225921,0.0003485242,0.000032471056,0.00027630082,0.0000120812965,0.000065429136,0.0006458792],"genre_scores_gemma":[0.9954512,0.000054635566,0.004165221,0.00011760899,0.000017895203,0.0000013987327,0.00004598578,0.00000740572,0.0001386126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845856,0.00035281084,0.000113397036,0.0006431959,0.00012825837,0.00030378564],"domain_scores_gemma":[0.9989246,0.00013545905,0.000095038034,0.00066180923,0.000074893986,0.000108169406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006017042,0.00018929923,0.00020496447,0.00015116653,0.00015152969,0.00025946854,0.0012511186,0.00010866972,0.000005968467],"category_scores_gemma":[0.000025400186,0.000141926,0.000034669585,0.0004100448,0.00014954717,0.00020079942,0.0009064105,0.0006789604,0.000006661763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031258376,0.00003056272,0.008520646,0.00003157245,0.000018258856,0.00006194622,0.00058841414,0.9527024,0.0000011132086,0.03781085,0.00004924616,0.00015370193],"study_design_scores_gemma":[0.0005817532,0.00007459915,0.0032064456,0.00007387492,0.000010034707,0.00001128734,0.00013445622,0.99300915,0.0000023646526,0.0023993913,0.00029085603,0.00020577351],"about_ca_topic_score_codex":0.00025799114,"about_ca_topic_score_gemma":0.0001380418,"teacher_disagreement_score":0.7194332,"about_ca_system_score_codex":0.000065960056,"about_ca_system_score_gemma":0.00013093208,"threshold_uncertainty_score":0.5787574},"labels":[],"label_agreement":null},{"id":"W2950744132","doi":"10.1016/j.tcs.2018.02.020","title":"Scheduling maintenance jobs in networks","year":2018,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung","keywords":"Preemption; Scheduling (production processes); Computer science; Time complexity; Mathematical optimization; Job shop scheduling; Simple (philosophy); Distributed computing; Mathematics; Algorithm; Computer network","score_opus":0.01711956884023272,"score_gpt":0.27661183589703037,"score_spread":0.2594922670567976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950744132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033990846,0.000060905968,0.98795915,0.0017969551,0.0020900206,0.00041235323,0.0000011706924,0.000291705,0.003988663],"genre_scores_gemma":[0.57145923,0.0000370344,0.42750522,0.00072509795,0.00023121723,0.000016908709,0.0000016040135,0.000011376137,0.00001226593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534,0.00025923172,0.000574622,0.0016646275,0.00097567437,0.0011858552],"domain_scores_gemma":[0.996955,0.00021370873,0.00015913982,0.001760069,0.0005003902,0.00041171644],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.003941069,0.0003592419,0.00042450745,0.00049344596,0.00031333402,0.0014206702,0.006666301,0.00024045206,0.000060646606],"category_scores_gemma":[0.00021022694,0.00031378603,0.00010533916,0.001795391,0.00389898,0.0005769495,0.009732799,0.0011867716,0.000096376505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004441714,0.000046436377,0.00012927272,0.000016098391,0.0000026525172,0.000019414205,0.00027662024,0.17658006,0.000005270451,0.81349415,0.00007508057,0.009350528],"study_design_scores_gemma":[0.00017359425,0.00007278253,0.000546488,0.00023822657,0.0000013601979,0.000010555755,0.0000017956648,0.81298417,0.0000551283,0.1855478,0.000049383216,0.00031872012],"about_ca_topic_score_codex":0.000009308749,"about_ca_topic_score_gemma":0.000002938643,"teacher_disagreement_score":0.6364041,"about_ca_system_score_codex":0.00019867958,"about_ca_system_score_gemma":0.0005135368,"threshold_uncertainty_score":0.9999314},"labels":[],"label_agreement":null},{"id":"W2950850611","doi":"10.48550/arxiv.1303.3564","title":"Distributed Dominating Sets on Grids","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dominating set; Bounded function; Grid; Combinatorics; Mathematics; Set (abstract data type); Basis (linear algebra); Distributed algorithm; Discrete mathematics; Computer science; Distributed computing; Graph; Geometry","score_opus":0.07876331928276233,"score_gpt":0.2016524052663855,"score_spread":0.12288908598362318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950850611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061553754,0.0000104339015,0.9293668,0.00039342692,0.00050424377,0.00041920162,0.000035298162,0.00038196924,0.007334838],"genre_scores_gemma":[0.99282306,0.00006298344,0.005001379,0.00017022269,0.000036401572,0.0000020175119,0.000075855976,0.000014073807,0.0018139933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982418,0.00017588797,0.00017659589,0.00090476393,0.00012831057,0.00037263712],"domain_scores_gemma":[0.99821806,0.0001236199,0.00018668729,0.0010298834,0.00022822442,0.00021351296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023677957,0.0002577641,0.00024274139,0.00022448371,0.00018891934,0.00027278304,0.0017034776,0.00023066414,0.00010360331],"category_scores_gemma":[0.00006408044,0.00027879237,0.00013801894,0.00053641223,0.00007178503,0.00036544542,0.0018534508,0.00062125846,0.00041345443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007855708,0.00010267914,0.00046235774,0.000049705082,0.000043290955,0.00011391017,0.00016660277,0.6888752,0.0000097477505,0.30592993,0.002566115,0.0016726347],"study_design_scores_gemma":[0.00039186637,0.000053347394,0.00062739966,0.000084539795,0.000009831983,0.0000015281302,0.000022929038,0.97163314,0.00006053195,0.026084548,0.0006999888,0.00033033307],"about_ca_topic_score_codex":0.00007682263,"about_ca_topic_score_gemma":0.0000054711645,"teacher_disagreement_score":0.9312693,"about_ca_system_score_codex":0.00020211907,"about_ca_system_score_gemma":0.0001338112,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2950969151","doi":"10.48550/arxiv.1301.7119","title":"How to Meet Asynchronously at Polynomial Cost","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Polynomial; Mathematics","score_opus":0.07055463355348017,"score_gpt":0.18986844584912577,"score_spread":0.1193138122956456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950969151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037763402,0.000021157088,0.9489424,0.0024191567,0.0007972158,0.0010420759,0.000022094542,0.0003535196,0.008638976],"genre_scores_gemma":[0.9579302,0.00006295813,0.01055194,0.0005265795,0.00011967474,0.0000060125085,0.00001879672,0.000024693989,0.030759113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978265,0.00015190055,0.00015413815,0.0011958954,0.00014308488,0.00052844686],"domain_scores_gemma":[0.99767214,0.0000655764,0.00015692844,0.0013521945,0.00024248988,0.0005106903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001855971,0.0003178914,0.0003128017,0.00033563332,0.00023395398,0.0005884652,0.0023646785,0.00027380363,0.00014482175],"category_scores_gemma":[0.000042569387,0.00036125892,0.00016677166,0.0005377456,0.000083625106,0.0005615243,0.004832028,0.00030590518,0.0005987683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039151902,0.00014963347,0.0012173333,0.00008050507,0.00012893941,0.00022461543,0.0007662786,0.7413561,0.00015322004,0.17664595,0.07639531,0.0028429916],"study_design_scores_gemma":[0.00077749474,0.00012290975,0.0003885762,0.0000667824,0.000024971245,0.0000065989498,0.000048846257,0.9522053,0.0002546603,0.004066508,0.041173387,0.0008639931],"about_ca_topic_score_codex":0.00018071698,"about_ca_topic_score_gemma":0.00019134647,"teacher_disagreement_score":0.93839043,"about_ca_system_score_codex":0.0005824909,"about_ca_system_score_gemma":0.0002548781,"threshold_uncertainty_score":0.99988395},"labels":[],"label_agreement":null},{"id":"W2951101008","doi":"10.48550/arxiv.1410.8756","title":"Contraction Obstructions for Connected Graph Searching","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mitacs; University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Combinatorics; Connected component; Finite set; Bounded function; Contraction (grammar); Strongly connected component; Graph; Discrete mathematics; Mixed graph; Induced subgraph; Line graph; Voltage graph","score_opus":0.08985249067486402,"score_gpt":0.21259637295848705,"score_spread":0.12274388228362303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951101008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018642243,0.00001082704,0.977811,0.000287019,0.0008054062,0.00060056,0.0000190289,0.00038134298,0.0014425673],"genre_scores_gemma":[0.98113894,0.00007592215,0.017412795,0.00010009589,0.00008318785,0.0000050375493,0.000053223,0.00001602922,0.0011147605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984257,0.00018574932,0.00017587109,0.0007901303,0.000086080836,0.00033644508],"domain_scores_gemma":[0.9982302,0.0002921824,0.00019166678,0.0007277682,0.00037983627,0.00017832515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451365,0.00019609055,0.00023350993,0.00035393532,0.0003627684,0.00023113149,0.0009618686,0.0002147832,0.00002377676],"category_scores_gemma":[0.000117418924,0.00023303626,0.00019885691,0.00043708997,0.00008082564,0.00039997138,0.0005466249,0.0004946027,0.000027242439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014930088,0.000036007386,0.00014838422,0.000053146112,0.00005637571,0.000006747053,0.00010285411,0.5749174,0.00005056542,0.42335096,0.00033313112,0.0009295651],"study_design_scores_gemma":[0.0005720612,0.00004293852,0.00028948614,0.000035678135,0.00002303956,0.0000031187494,0.00003211588,0.89195913,0.00005833347,0.10509794,0.0016405215,0.00024563368],"about_ca_topic_score_codex":0.00007800052,"about_ca_topic_score_gemma":0.000033470908,"teacher_disagreement_score":0.9624967,"about_ca_system_score_codex":0.00011828323,"about_ca_system_score_gemma":0.00016145133,"threshold_uncertainty_score":0.95029426},"labels":[],"label_agreement":null},{"id":"W2951207568","doi":"10.48550/arxiv.1306.1956","title":"Rendezvous of Two Robots with Constant Memory","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Rendezvous; Robot; Asynchronous communication; Computer science; Constant (computer programming); Transmission (telecommunications); State (computer science); Mobile robot; Class (philosophy); Finite-state machine; Distributed computing; Artificial intelligence; Computer network; Algorithm; Telecommunications; Engineering; Programming language","score_opus":0.07363641634376226,"score_gpt":0.19393732967384414,"score_spread":0.12030091333008187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951207568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03255793,0.000045903067,0.9419708,0.00011675466,0.00020086102,0.0004327482,0.000008205464,0.00018302671,0.024483735],"genre_scores_gemma":[0.9734267,0.00012655159,0.023001075,0.00006719496,0.00001646146,0.0000011691079,0.000007974238,0.000013596181,0.00333927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849933,0.00014121624,0.00019308575,0.0007356458,0.00014043003,0.00029031458],"domain_scores_gemma":[0.9979784,0.000068410714,0.00028384678,0.0011223741,0.000368104,0.00017887329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018840526,0.0002264223,0.0003206799,0.00024882983,0.00007840537,0.00008670762,0.001428928,0.00013210648,0.00010813865],"category_scores_gemma":[0.000013320042,0.00021653216,0.00009665386,0.000504163,0.00022012701,0.00033846745,0.001303135,0.00039610296,0.000058957583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011664681,0.000065335465,0.0004513322,0.0000596824,0.00006191765,0.00010505496,0.00019740532,0.7453993,0.000027867485,0.25290167,0.00025388045,0.00046486213],"study_design_scores_gemma":[0.001079261,0.00012611435,0.00015116976,0.0001742751,0.000035424848,0.000010051005,0.0000743218,0.9677054,0.0003020255,0.02981371,0.00010230327,0.00042591273],"about_ca_topic_score_codex":0.00028974237,"about_ca_topic_score_gemma":0.000045350727,"teacher_disagreement_score":0.9408688,"about_ca_system_score_codex":0.000091045105,"about_ca_system_score_gemma":0.00037387808,"threshold_uncertainty_score":0.88299257},"labels":[],"label_agreement":null},{"id":"W2951591595","doi":"10.1145/3323165.3323173","title":"Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; City University of Hong Kong; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Approximation algorithm; Schedule; Time complexity; Job shop scheduling; Constant (computer programming); Mathematical optimization; Running time; Algorithm; Parallel computing; Mathematics; Programming language; Operating system","score_opus":0.015338870186721887,"score_gpt":0.2356097280264979,"score_spread":0.220270857839776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951591595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025433827,0.0000038323105,0.9567494,0.00063153415,0.000041644857,0.00027070014,0.0000016155547,0.00007935887,0.016788103],"genre_scores_gemma":[0.6744496,0.0000016806214,0.3244671,0.00020344285,0.0000061954843,0.000008349024,0.0000111963855,0.0000034631303,0.0008489378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993785,0.000026375319,0.0001250306,0.00015984422,0.00021532907,0.000094935865],"domain_scores_gemma":[0.9995049,0.00006531479,0.000052617288,0.0002531899,0.00009165766,0.00003228654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011132687,0.000056680252,0.00007044925,0.000073474424,0.000044319142,0.000065938766,0.00019926087,0.000018060262,0.00008357744],"category_scores_gemma":[0.00002379621,0.000040125335,0.000014926824,0.00025703365,0.000014303219,0.00046489574,0.000043227305,0.00004751829,0.000031838914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018220284,0.00017665436,0.015985811,0.000042371845,0.000016339312,3.638224e-7,0.00063975423,0.45104364,0.0032346742,0.525469,0.00013931406,0.003233845],"study_design_scores_gemma":[0.0004178729,0.00014656229,0.0005350414,0.00001643838,6.9241594e-7,5.689045e-7,0.000022764707,0.99599755,0.002247176,0.00032095317,0.000234772,0.000059638493],"about_ca_topic_score_codex":0.000023728013,"about_ca_topic_score_gemma":0.000010914467,"teacher_disagreement_score":0.64901584,"about_ca_system_score_codex":0.000009898357,"about_ca_system_score_gemma":0.000044144803,"threshold_uncertainty_score":0.16362636},"labels":[],"label_agreement":null},{"id":"W2951631472","doi":"10.1016/j.tcs.2020.06.034","title":"Gathering in the plane of location-aware robots in the presence of spies","year":2020,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Computer science; Trajectory; Cartesian coordinate system; Mobile robot; Set (abstract data type); Adversary; Competitive analysis; Upper and lower bounds; Artificial intelligence; Distributed computing; Mathematics; Computer security; Geometry","score_opus":0.03225027025388177,"score_gpt":0.2892882062314384,"score_spread":0.25703793597755664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951631472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100829685,0.00005935268,0.9817541,0.0066011627,0.00018678048,0.0005570492,0.0000027320855,0.000025775998,0.0007300279],"genre_scores_gemma":[0.9530143,0.000023899684,0.046455756,0.0004444008,0.000032239725,0.00002260571,0.0000016288395,0.000004204579,9.257969e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969432,0.00050098315,0.0005158476,0.0005809464,0.0011229513,0.0003360918],"domain_scores_gemma":[0.99752325,0.0008708339,0.0001781551,0.0011540204,0.00021324032,0.00006050996],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0035258753,0.00017208775,0.00028956463,0.00020476722,0.00008533164,0.00026159812,0.007598753,0.00007245679,0.000008213622],"category_scores_gemma":[0.0002628931,0.000102435195,0.000052129108,0.001963034,0.0021479002,0.00024042783,0.0023956855,0.0005964091,0.000003921684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006404894,0.00007557867,0.0002121678,0.00010168892,0.0000018620158,0.000007685702,0.013226762,0.14162192,0.00004508208,0.8422931,0.000017427004,0.0023903323],"study_design_scores_gemma":[0.000104683866,0.000091466965,0.004030579,0.00023388056,0.0000016409963,0.0000048785428,0.000118757984,0.85958016,0.00029108408,0.135428,0.0000050914437,0.0001098079],"about_ca_topic_score_codex":0.000036942823,"about_ca_topic_score_gemma":0.000007412238,"teacher_disagreement_score":0.94293135,"about_ca_system_score_codex":0.000025583411,"about_ca_system_score_gemma":0.00031687444,"threshold_uncertainty_score":0.9977706},"labels":[],"label_agreement":null},{"id":"W2951649450","doi":"","title":"Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Computer science; Mobile robot; Simple (philosophy); Set (abstract data type); Rigidity (electromagnetism); Distributed computing; Plane (geometry); Theoretical computer science; Topology (electrical circuits); Mathematics; Artificial intelligence; Combinatorics; Geometry; Engineering","score_opus":0.036903703057255315,"score_gpt":0.18972526201599554,"score_spread":0.15282155895874022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951649450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007765323,0.000035933368,0.98895353,0.00027549348,0.00020186801,0.00071882573,0.000024506917,0.0003662441,0.0016583041],"genre_scores_gemma":[0.9936634,0.000094699295,0.0054871384,0.00015701071,0.00003884961,0.0000033242702,0.00020287227,0.00001572537,0.0003370253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817246,0.00023216507,0.00029874052,0.0006855062,0.00015774457,0.0004533644],"domain_scores_gemma":[0.9980643,0.00015179317,0.0003835093,0.0009827433,0.00027033236,0.00014735611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597483,0.00024969448,0.0002497973,0.00012614042,0.0005443981,0.000447168,0.0020849558,0.00020169948,0.00001635773],"category_scores_gemma":[0.000027206781,0.00024247564,0.00013929815,0.000632657,0.000099819095,0.00070494943,0.0021399213,0.000619544,0.00006264265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030438525,0.000042884058,0.000087166845,0.00007746222,0.000024793571,0.0000064420014,0.00039465615,0.9773848,0.000014906011,0.017078055,0.00173036,0.0031554347],"study_design_scores_gemma":[0.00031276423,0.00004150957,0.00007206956,0.000093815295,0.00001581669,0.0000037728323,0.000110278044,0.99046546,0.00007972728,0.0068920734,0.0016198041,0.0002929035],"about_ca_topic_score_codex":0.000081278944,"about_ca_topic_score_gemma":0.000015941863,"teacher_disagreement_score":0.985898,"about_ca_system_score_codex":0.00026155537,"about_ca_system_score_gemma":0.00011742157,"threshold_uncertainty_score":0.988787},"labels":[],"label_agreement":null},{"id":"W2951723330","doi":"10.48550/arxiv.1306.0771","title":"The Frequent Items Problem in Online Streaming under Various Performance Measures","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Danmarks Frie Forskningsfond; University of Waterloo","keywords":"Competitive analysis; Computer science; Order (exchange); Competitive advantage; Interval (graph theory); Operations research; Mathematics; Marketing; Upper and lower bounds; Business","score_opus":0.08208682290811997,"score_gpt":0.19777937430079204,"score_spread":0.11569255139267207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951723330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.159522,0.00019968062,0.83397067,0.0007450525,0.00045293418,0.0009598757,0.00000769135,0.00025807632,0.003884016],"genre_scores_gemma":[0.9911428,0.001401285,0.0046956507,0.00009448854,0.000035584006,0.0000044996427,0.0000151410195,0.000016533611,0.0025940333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804217,0.00022147411,0.0002823346,0.00078279024,0.00018441616,0.0004868468],"domain_scores_gemma":[0.99822646,0.00016887825,0.00020372664,0.0010144813,0.00024292307,0.00014350099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047475946,0.00027100163,0.0002325001,0.00023883511,0.00028914557,0.00035706218,0.0020866774,0.00020502381,0.00001527126],"category_scores_gemma":[0.000028616447,0.0002310487,0.00009460685,0.0006123525,0.00012337159,0.0004863954,0.0014952935,0.00082434586,0.00005694315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052182027,0.00009919979,0.0025189538,0.00003803511,0.000033181434,0.000022245817,0.00026585843,0.90361905,0.000008134267,0.08866919,0.000076503755,0.0046444195],"study_design_scores_gemma":[0.00034319356,0.000038910348,0.0027015107,0.00012158941,0.000008105019,0.0000018638203,0.00012262492,0.97403735,0.000012813901,0.021481443,0.00083659677,0.00029397453],"about_ca_topic_score_codex":0.00074951485,"about_ca_topic_score_gemma":0.00060050417,"teacher_disagreement_score":0.8316208,"about_ca_system_score_codex":0.00026747357,"about_ca_system_score_gemma":0.0003303735,"threshold_uncertainty_score":0.9421892},"labels":[],"label_agreement":null},{"id":"W2951748104","doi":"10.1016/j.tcs.2018.10.018","title":"Gathering in dynamic rings","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Traverse; Computer science; Constructive; Focus (optics); Characterization (materials science); Class (philosophy); Interval (graph theory); Time complexity; Set (abstract data type); Network topology; Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Computer network; Process (computing)","score_opus":0.008158914473346624,"score_gpt":0.26923965560583335,"score_spread":0.26108074113248675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951748104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03183215,0.0000056222793,0.9582294,0.0009909665,0.00029962134,0.00010174907,1.3170141e-7,0.00015493153,0.008385377],"genre_scores_gemma":[0.76130545,0.0000023479795,0.23821688,0.00042014843,0.000033265307,0.0000028460622,8.2156404e-8,0.0000037777072,0.000015184658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982653,0.000060621373,0.00018795737,0.0005212045,0.00044596853,0.0005189353],"domain_scores_gemma":[0.9990465,0.00007310146,0.000027700264,0.0005358252,0.00013949559,0.00017735633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001329524,0.00010148664,0.00010895029,0.00024122358,0.00022504352,0.0003701652,0.002030394,0.000029282535,0.0000672708],"category_scores_gemma":[0.000057221914,0.0000865878,0.000023350894,0.0015699627,0.0023086595,0.00067908247,0.000981814,0.0001406594,0.00019323918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017657236,0.00002472613,0.000088101726,0.0000020179152,4.9161196e-7,0.000004902958,0.00070554024,0.0002906329,0.00051263394,0.9687752,0.0000057462676,0.029588208],"study_design_scores_gemma":[0.00013958114,0.000120140845,0.0014855604,0.000020039222,2.4358238e-7,0.000011031182,0.0000028665202,0.9106056,0.00093568227,0.08647055,0.000093935814,0.000114777715],"about_ca_topic_score_codex":0.0000031283491,"about_ca_topic_score_gemma":0.000002771724,"teacher_disagreement_score":0.910315,"about_ca_system_score_codex":0.00006577011,"about_ca_system_score_gemma":0.000086688844,"threshold_uncertainty_score":0.8506352},"labels":[],"label_agreement":null},{"id":"W2951833857","doi":"10.48550/arxiv.1303.5740","title":"High Level Path Planning with Uncertainty","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Motion planning; Shortest path problem; Computer science; Longest path problem; Path (computing); Mathematical optimization; Graph; Markov decision process; Any-angle path planning; Process (computing); Markov process; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.1240046288587581,"score_gpt":0.19752356758093065,"score_spread":0.07351893872217255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951833857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07262405,0.000017394994,0.92367655,0.00018147586,0.00024545647,0.00033707343,0.000014539329,0.00029374662,0.0026097412],"genre_scores_gemma":[0.9701765,0.00004667679,0.02522049,0.00017503586,0.000041581312,0.000002167947,0.000032809367,0.000017328313,0.0042873737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982509,0.00012364448,0.00015022565,0.0009399459,0.00014008278,0.00039517516],"domain_scores_gemma":[0.99824494,0.000069557966,0.00018892877,0.001006,0.00026830757,0.00022226821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018018442,0.0002814314,0.00027468402,0.00021670319,0.00017919001,0.00026015769,0.0016400123,0.00020230211,0.00008878039],"category_scores_gemma":[0.000014911628,0.00026424363,0.000082271785,0.00048542046,0.000100584184,0.00046341156,0.0014535661,0.00058426074,0.00013727503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010010527,0.00003455987,0.0008505274,0.00002865304,0.000042492185,0.0001403475,0.00022959102,0.8350392,0.000002840768,0.16251247,0.0008432998,0.0002660049],"study_design_scores_gemma":[0.0005653472,0.00008408553,0.0011600422,0.00014662612,0.000017191936,0.0000041327326,0.00006631664,0.9753592,0.000015899237,0.021494577,0.00064167916,0.00044490694],"about_ca_topic_score_codex":0.0005898663,"about_ca_topic_score_gemma":0.000014886821,"teacher_disagreement_score":0.89845604,"about_ca_system_score_codex":0.0001557073,"about_ca_system_score_gemma":0.0002901287,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W2951958562","doi":"10.20382/jocg.v8i1a7","title":"Competitive local routing with constraints","year":2016,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Exploratory Research for Advanced Technology; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Danmarks Frie Forskningsfond","keywords":"Routing (electronic design automation); Computer science; Computer network","score_opus":0.023354628743987627,"score_gpt":0.23012677153492506,"score_spread":0.20677214279093742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951958562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16994521,0.000054087268,0.68250847,0.0015985499,0.000056382327,0.0008576286,0.00083819305,0.0001623446,0.14397912],"genre_scores_gemma":[0.97461253,0.000056390894,0.01140276,0.000014191382,0.000015663698,9.933671e-8,0.000008669059,0.000022559543,0.013867142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9962478,0.00055563677,0.00023059214,0.0007296264,0.0014546154,0.0007817015],"domain_scores_gemma":[0.996803,0.0004764352,0.00034001787,0.00073805137,0.0011991842,0.00044329948],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015081702,0.0002568093,0.00045640185,0.0005968255,0.0006430829,0.000043265503,0.0021197035,0.00020393248,0.007042419],"category_scores_gemma":[0.000076569835,0.00024251468,0.0002056539,0.0010271058,0.003927059,0.0005047285,0.0009872378,0.00043431585,0.0015613405],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053822403,0.0030114285,0.12341156,0.0008139445,0.00323049,0.00787713,0.19359645,0.0012608954,0.012548965,0.35217848,0.008066623,0.28862178],"study_design_scores_gemma":[0.0133891925,0.001618624,0.0036702,0.0019449131,0.00013017902,0.00015018106,0.9531805,0.010893301,0.00070118275,0.0023676,0.0102420915,0.0017120221],"about_ca_topic_score_codex":0.0010427379,"about_ca_topic_score_gemma":0.0013704377,"teacher_disagreement_score":0.8046673,"about_ca_system_score_codex":0.00011360912,"about_ca_system_score_gemma":0.00059930974,"threshold_uncertainty_score":0.9992161},"labels":[],"label_agreement":null},{"id":"W2952262284","doi":"","title":"On the push&pull protocol for rumour spreading","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Logarithm; Asynchronous communication; Binary logarithm; Omega; Discrete mathematics; Mathematics; Graph; Computer science; Physics; Telecommunications","score_opus":0.1495498912844622,"score_gpt":0.2382169472345855,"score_spread":0.08866705595012331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952262284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005002876,3.7769868e-7,0.92879784,0.00081336196,0.00017730698,0.06048802,0.0000056778917,0.00019737541,0.009019768],"genre_scores_gemma":[0.95131767,0.000006274973,0.0128973005,0.0016701494,0.00024431254,0.018570263,0.000017160357,0.00006626673,0.015210589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983661,0.00019855103,0.00016335899,0.0008053619,0.00010996002,0.00035667227],"domain_scores_gemma":[0.9979173,0.00038608562,0.00020901464,0.0011679067,0.00018894627,0.00013072285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929474,0.0002397543,0.00020820402,0.00016878534,0.00030566312,0.0002749367,0.0022374,0.00017816405,0.00006528249],"category_scores_gemma":[0.00011808319,0.00019548317,0.00019036244,0.00029404138,0.00007040938,0.00018175929,0.0011807565,0.0004525087,0.00012466167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025549298,0.00004885682,0.000053240292,0.00007291244,0.000021027789,0.0000069953917,0.000077734614,0.29339674,0.000005086979,0.7022186,0.0038467513,0.00022650395],"study_design_scores_gemma":[0.00055381114,0.00009637123,0.000027230833,0.000117394266,0.0000073565466,7.410693e-7,0.000010865526,0.8663142,0.000095354044,0.12253557,0.010003109,0.00023802735],"about_ca_topic_score_codex":0.00001975982,"about_ca_topic_score_gemma":0.0000074274153,"teacher_disagreement_score":0.9508174,"about_ca_system_score_codex":0.000116536445,"about_ca_system_score_gemma":0.00015114904,"threshold_uncertainty_score":0.79715717},"labels":[],"label_agreement":null},{"id":"W2952321143","doi":"10.23638/dmtcs-21-3-20","title":"Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Face (sociological concept); Wireless; Mathematics; Robot; Fetch; Computer science; Artificial intelligence; Telecommunications; Sociology; Geology; Social science","score_opus":0.019253888759540833,"score_gpt":0.26933908011555946,"score_spread":0.25008519135601864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952321143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10731695,0.00001427896,0.8862096,0.0029120324,0.000035790184,0.00063444016,0.0000023403004,0.00010827955,0.0027662911],"genre_scores_gemma":[0.6731232,0.000018410272,0.32646996,0.00032689242,0.0000054662964,0.000012085663,0.0000011101554,0.000011504765,0.000031381627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973952,0.00013724137,0.00027529642,0.0007271445,0.00093635084,0.0005287658],"domain_scores_gemma":[0.9977042,0.000362743,0.000060214043,0.0012552172,0.0001827541,0.00043485727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013751698,0.00023694555,0.00029186177,0.00019677587,0.0003789246,0.0009951339,0.0018427898,0.000051464835,0.000012755769],"category_scores_gemma":[0.000028047445,0.00016698247,0.000029526174,0.0008080191,0.0013329127,0.000798734,0.0017654684,0.00026754942,0.000056720564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008856099,0.00005282806,0.000023027937,0.000038061502,0.000005500901,0.000001261742,0.00600694,0.036036804,0.00010275903,0.9542358,0.0000048606453,0.003483277],"study_design_scores_gemma":[0.0002801031,0.0003469088,0.000081634695,0.00018730335,0.0000034849847,0.000016996148,0.00015040807,0.911315,0.00031820082,0.087059446,0.0000044456037,0.00023603585],"about_ca_topic_score_codex":0.0000037845186,"about_ca_topic_score_gemma":8.712982e-7,"teacher_disagreement_score":0.87527823,"about_ca_system_score_codex":0.000034780092,"about_ca_system_score_gemma":0.00007699693,"threshold_uncertainty_score":0.9596099},"labels":[],"label_agreement":null},{"id":"W2952754000","doi":"10.7155/jgaa.00421","title":"Lower Bounds for Graph Exploration Using Local Policies","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Graph; Computer science; Abstraction; Exponential function; Theoretical computer science; Enhanced Data Rates for GSM Evolution; Robot; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.06704610915214952,"score_gpt":0.3427686469278052,"score_spread":0.27572253777565564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952754000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020793357,0.0007802626,0.9959007,0.0020196289,0.00037257216,0.0005460707,0.000031920103,0.000025725614,0.000115194416],"genre_scores_gemma":[0.061129797,0.0045967815,0.9321246,0.00032662533,0.0011890429,0.00034200586,0.000037582937,0.000044858836,0.0002086741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00003466097,0.00052533514,0.00028426564,0.0003086804,0.00021809658],"domain_scores_gemma":[0.9973639,0.00006118194,0.0008732713,0.00053514505,0.0009822974,0.00018416726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053789763,0.00018723316,0.00031751677,0.00042936826,0.0006382595,0.000890915,0.0008720455,0.00016346807,0.0000019953795],"category_scores_gemma":[0.000024945039,0.00016531406,0.00021558323,0.00023845374,0.00020646672,0.00069354335,0.00032134715,0.0003615254,6.688314e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045661203,0.0007898962,0.00016013489,0.00042226448,0.0005206533,0.000010204437,0.0021760378,0.116385035,0.00046976536,0.2717833,0.0051244516,0.6021126],"study_design_scores_gemma":[0.00087460683,0.00026089433,0.00017365105,0.00021258566,0.00009925823,0.000089267574,0.00019242604,0.4618252,0.00020770342,0.49768192,0.037900496,0.00048200178],"about_ca_topic_score_codex":0.000033415086,"about_ca_topic_score_gemma":0.000005963935,"teacher_disagreement_score":0.6016306,"about_ca_system_score_codex":0.000038017824,"about_ca_system_score_gemma":0.00029801828,"threshold_uncertainty_score":0.85911137},"labels":[],"label_agreement":null},{"id":"W2952798587","doi":"10.48550/arxiv.cs/0605070","title":"Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rendezvous; Mobile robot; Computer science; Robot; Artificial intelligence; Aerospace engineering; Engineering; Spacecraft","score_opus":0.03893205192265286,"score_gpt":0.28080729971336515,"score_spread":0.2418752477907123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952798587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016710555,0.0009470496,0.9730316,0.0020349391,0.00052492565,0.0029487263,0.000016536433,0.00040481536,0.0033808777],"genre_scores_gemma":[0.6662051,0.00034526698,0.32106432,0.0008191216,0.00041166026,0.00315749,0.00013290122,0.00008760005,0.0077765393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978397,0.00016538912,0.0004592338,0.000823193,0.00025660417,0.00045588097],"domain_scores_gemma":[0.9982971,0.00025015997,0.00025059437,0.00088517135,0.00021129118,0.00010568791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009770546,0.0002954092,0.00039390067,0.00010696191,0.00032437083,0.0004526001,0.0011651604,0.00021191718,0.000008222032],"category_scores_gemma":[0.000044138913,0.00021702753,0.00015820672,0.00017897766,0.00017802887,0.00021965709,0.0015437546,0.00053055584,0.00001416078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086707005,0.0003170555,0.04058009,0.0006661313,0.000310409,0.000030502144,0.005801955,0.8051532,0.00008601425,0.038834978,0.012194695,0.09593829],"study_design_scores_gemma":[0.0017705732,0.0001395761,0.005385958,0.00013765978,0.00004246647,0.000021235708,0.000031745676,0.96883637,0.00012175204,0.012353773,0.010531661,0.00062721234],"about_ca_topic_score_codex":0.00018199717,"about_ca_topic_score_gemma":0.00004685861,"teacher_disagreement_score":0.6519672,"about_ca_system_score_codex":0.000064552194,"about_ca_system_score_gemma":0.0002178109,"threshold_uncertainty_score":0.88501257},"labels":[],"label_agreement":null},{"id":"W2952864736","doi":"10.48550/arxiv.1506.07952","title":"Tradeoffs Between Cost and Information for Rendezvous and Treasure Hunt","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Treasure; Rendezvous; Advice (programming); Combinatorics; Omega; Upper and lower bounds; Binary logarithm; Traverse; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical analysis; Geography","score_opus":0.1335887771927533,"score_gpt":0.21038719835329264,"score_spread":0.07679842116053934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952864736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022200676,0.000054177635,0.9743969,0.00044019037,0.00012266374,0.0007693699,0.00007611983,0.00013865832,0.0018012759],"genre_scores_gemma":[0.99409384,0.0002496926,0.0049975403,0.000087177905,0.000037641687,0.0000030235892,0.00008399734,0.0000073368315,0.0004397657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910617,0.000065707834,0.00015050556,0.0003917748,0.000078199504,0.00020767172],"domain_scores_gemma":[0.9989663,0.00007996956,0.00014110001,0.00036089562,0.000217781,0.0002339622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036991737,0.00016384343,0.0002102829,0.00020859552,0.00012329397,0.00023555518,0.0004370576,0.00019888338,0.0000022918014],"category_scores_gemma":[0.000047308884,0.00017812134,0.000044725457,0.00020417226,0.00007095176,0.0011392859,0.00060654926,0.00023028578,0.0000054726875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016109717,0.00014704104,0.02475912,0.0010554645,0.000384484,0.000040566967,0.0078095975,0.24592763,0.000008043445,0.6006437,0.007156845,0.11190642],"study_design_scores_gemma":[0.001601454,0.00014674605,0.0039569167,0.00006274712,0.00005864441,0.000004467063,0.00012050257,0.94969964,0.00001549436,0.02912117,0.01478169,0.00043050855],"about_ca_topic_score_codex":0.00004647201,"about_ca_topic_score_gemma":0.000013955703,"teacher_disagreement_score":0.97189313,"about_ca_system_score_codex":0.00008778879,"about_ca_system_score_gemma":0.00016157507,"threshold_uncertainty_score":0.72635776},"labels":[],"label_agreement":null},{"id":"W2952911535","doi":"10.48550/arxiv.1407.1428","title":"Fast Rendezvous with Advice","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Advice (programming); Psychology; Computer science; Engineering; Aerospace engineering","score_opus":0.04878298937957758,"score_gpt":0.1774679760883414,"score_spread":0.1286849867087638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952911535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055361665,0.000013824429,0.9655641,0.00023082357,0.0002121715,0.000225838,0.00000458109,0.00052594277,0.027686551],"genre_scores_gemma":[0.97344893,0.00007654494,0.017168501,0.00025597337,0.000050315786,0.00000105294,0.000015696798,0.000019079598,0.008963932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982657,0.00015254659,0.00013468195,0.00097147626,0.00012983581,0.00034577987],"domain_scores_gemma":[0.9980243,0.0000579632,0.00017837112,0.001281243,0.00023874053,0.00021941555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021327243,0.00025220244,0.00024956896,0.00022145115,0.0001463237,0.00018853859,0.0018342757,0.00018883166,0.000055346856],"category_scores_gemma":[0.000015026116,0.00024983808,0.00009061191,0.000537335,0.0000964071,0.00031253876,0.001494024,0.0005255936,0.00018257534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016901024,0.00005239485,0.0005834975,0.000052379502,0.000045780638,0.00013382985,0.00019899383,0.8589426,0.0000023729124,0.13825524,0.0009148326,0.0008011864],"study_design_scores_gemma":[0.00047439113,0.000093021474,0.00027904587,0.00007461883,0.000020349244,0.0000074424875,0.000027528356,0.9885262,0.000016106484,0.007245585,0.002851056,0.0003846553],"about_ca_topic_score_codex":0.000094626244,"about_ca_topic_score_gemma":0.00005534881,"teacher_disagreement_score":0.96791273,"about_ca_system_score_codex":0.0001057319,"about_ca_system_score_gemma":0.00022058174,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W2953217343","doi":"10.48550/arxiv.1807.08640","title":"Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Face (sociological concept); Computer science; Simple (philosophy); Robot; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.16573077380450865,"score_gpt":0.24106450923262598,"score_spread":0.07533373542811733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953217343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17991604,0.00002036693,0.81712615,0.0009975422,0.00018286666,0.0012269276,0.00010823073,0.00007988846,0.00034198037],"genre_scores_gemma":[0.9860203,0.000029430028,0.012634457,0.00060601,0.00007972853,0.000012335795,0.00002363497,0.000020509522,0.00057355716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767226,0.00040371763,0.0002616246,0.001046284,0.0001468872,0.0004692065],"domain_scores_gemma":[0.9973076,0.0007082532,0.00017798826,0.0015102208,0.00013051883,0.00016544531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088676583,0.00031389462,0.00026386837,0.00015101567,0.0005837354,0.0003993008,0.002433139,0.00019928422,0.000016786904],"category_scores_gemma":[0.000121622914,0.00023902096,0.00017807788,0.0006837753,0.00010509853,0.00035908425,0.0015314609,0.0006426897,0.00003311316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017666187,0.000056818222,0.00010417948,0.000015237201,0.000027635708,0.002560578,0.009570126,0.97900295,0.0000026984019,0.0077287294,0.00049507205,0.00041832207],"study_design_scores_gemma":[0.00049762754,0.000043117,0.00003235155,0.00005895434,0.000025980296,0.00013692767,0.0011253513,0.98620147,0.0000086858645,0.011477309,0.00009122823,0.00030100544],"about_ca_topic_score_codex":0.000999729,"about_ca_topic_score_gemma":0.0013116791,"teacher_disagreement_score":0.8061043,"about_ca_system_score_codex":0.00016579402,"about_ca_system_score_gemma":0.00019491174,"threshold_uncertainty_score":0.9746992},"labels":[],"label_agreement":null},{"id":"W2953266086","doi":"10.48550/arxiv.1211.6039","title":"Rendezvous of two robots with visible bits","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rendezvous; Asynchronous communication; Computer science; Robot; Constant (computer programming); Topology (electrical circuits); Zero (linguistics); Algorithm; Mathematics; Artificial intelligence; Combinatorics; Physics","score_opus":0.09170811491101132,"score_gpt":0.20737843513345372,"score_spread":0.1156703202224424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953266086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019952882,0.0000652735,0.96570235,0.00007636863,0.00022677082,0.00027024336,0.000006514203,0.00017389876,0.013525706],"genre_scores_gemma":[0.97360057,0.00010729812,0.023537265,0.00004425344,0.00003226278,6.825616e-7,0.000009605574,0.00001515689,0.002652936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998569,0.00012542953,0.00016735366,0.0006403206,0.00014200564,0.00035586685],"domain_scores_gemma":[0.9981376,0.00005217444,0.0002533036,0.0010843996,0.00026509652,0.00020742539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024353684,0.000220011,0.00028798787,0.00029139224,0.00008247196,0.00006779259,0.0014126335,0.00013933395,0.00005945549],"category_scores_gemma":[0.000010853256,0.00021603353,0.00009734488,0.00075442117,0.000106099455,0.00045855643,0.0014094905,0.00037511758,0.000055373013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001458055,0.000109343186,0.0027713329,0.00006721714,0.000058603688,0.00004533266,0.00023505843,0.78814465,0.00003180383,0.20791462,0.0001372089,0.00047023097],"study_design_scores_gemma":[0.0014200353,0.00016015912,0.0012768563,0.00022306925,0.00007034943,0.000011552528,0.00003615786,0.97671545,0.00074649724,0.018166535,0.00049161783,0.0006817452],"about_ca_topic_score_codex":0.00015242584,"about_ca_topic_score_gemma":0.00004090378,"teacher_disagreement_score":0.9536477,"about_ca_system_score_codex":0.0000825005,"about_ca_system_score_gemma":0.00024869293,"threshold_uncertainty_score":0.88095915},"labels":[],"label_agreement":null},{"id":"W2953288228","doi":"10.48550/arxiv.1508.02471","title":"Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Benchmark (surveying); Upper and lower bounds; Node (physics); Computer science; Integer (computer science); Enhanced Data Rates for GSM Evolution; Binary logarithm; Set (abstract data type); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Physics; Artificial intelligence","score_opus":0.16660370196039329,"score_gpt":0.23248044396620623,"score_spread":0.06587674200581295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953288228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031318988,0.00004573664,0.99055904,0.0001305636,0.00090077886,0.0009514968,0.000023016657,0.00020705504,0.004050385],"genre_scores_gemma":[0.9915965,0.00009742925,0.0046589356,0.00007579974,0.000092086295,0.000008800488,0.000075891294,0.000026266265,0.0033682976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.00015087624,0.000224444,0.00089881365,0.00008898945,0.0004703718],"domain_scores_gemma":[0.9983118,0.00026090493,0.00016471278,0.0008306731,0.00018080696,0.00025106486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045354338,0.00025665763,0.00032915338,0.00027796693,0.00008893672,0.00014343225,0.0015732555,0.00031544725,0.00001856053],"category_scores_gemma":[0.00009150253,0.00031089515,0.00013321248,0.0005232796,0.000102907296,0.00025445802,0.0009633548,0.00047327555,0.000053706142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001213075,0.00006680855,0.000046104695,0.000026399373,0.000025325857,0.000119626064,0.00015799853,0.98033684,7.038664e-7,0.016286068,0.0014428241,0.0013700109],"study_design_scores_gemma":[0.0018370546,0.00013324647,0.000036055677,0.000048141123,0.000020677282,0.000001807885,0.000019731706,0.9899926,0.0000017673586,0.006098134,0.0014783351,0.0003324086],"about_ca_topic_score_codex":0.000028065397,"about_ca_topic_score_gemma":0.00006121976,"teacher_disagreement_score":0.9884646,"about_ca_system_score_codex":0.0003514614,"about_ca_system_score_gemma":0.000384004,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W2962742438","doi":"","title":"Square Formation by Asynchronous Oblivious Robots.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Computer science; Asynchronous communication; Correctness; Mobile robot; Square (algebra); Theoretical computer science; Degenerate energy levels; Algorithm; Mathematics; Artificial intelligence; Geometry; Physics","score_opus":0.02441196527484058,"score_gpt":0.24285998804405776,"score_spread":0.21844802276921718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962742438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013372197,0.000031073178,0.9738796,0.011931188,0.00021420457,0.00021529666,0.00009004053,0.00012321345,0.012178159],"genre_scores_gemma":[0.9827405,0.00002215763,0.013715452,0.0022135105,0.000034107466,0.000023312674,0.00009178189,0.00001176374,0.0011473987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840426,0.000080326434,0.0002516153,0.00038774652,0.0004278013,0.0004482418],"domain_scores_gemma":[0.99846953,0.00018358136,0.00008604599,0.00030594558,0.00039157318,0.00056333304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002139999,0.00016325382,0.00013866555,0.00058964343,0.00023941795,0.00030271732,0.0006523057,0.000089931615,0.00079782767],"category_scores_gemma":[0.00009581062,0.00013568914,0.00004680661,0.0006410577,0.00006378084,0.0007499505,0.00005220536,0.00011327927,0.0014501916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005911418,0.00007201043,0.00049495563,0.00002134832,0.000025837548,0.000024687553,0.0002694872,0.030834746,0.0001187492,0.59268725,0.06566454,0.30978045],"study_design_scores_gemma":[0.0018872392,0.00043350644,0.005115812,0.00022892462,0.000006144497,0.00006708062,0.00007044196,0.90048474,0.0003179622,0.054849263,0.03547816,0.0010607233],"about_ca_topic_score_codex":0.0010431847,"about_ca_topic_score_gemma":0.0019992355,"teacher_disagreement_score":0.9814033,"about_ca_system_score_codex":0.00039495027,"about_ca_system_score_gemma":0.00093947863,"threshold_uncertainty_score":0.9993273},"labels":[],"label_agreement":null},{"id":"W2962770134","doi":"10.1109/icdcs.2016.59","title":"Live Exploration of Dynamic Rings","year":2016,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.05704449905809044,"score_gpt":0.3056773927221618,"score_spread":0.24863289366407137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962770134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17487758,0.0003710636,0.8053317,0.014664753,0.00020260885,0.0013699519,0.00007584083,0.00021563318,0.0028908753],"genre_scores_gemma":[0.9717902,0.000561518,0.022817664,0.0000084702515,0.000016573467,0.0000013522645,0.000014136466,0.000009589856,0.004780502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976592,0.00031956873,0.00020128023,0.0005343713,0.00086857553,0.0004170148],"domain_scores_gemma":[0.9973594,0.00019827687,0.00013856609,0.0008767912,0.001271169,0.0001557982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015661406,0.00010561537,0.00020512722,0.0006058703,0.0002185735,0.000029451288,0.0014695546,0.000060172755,0.00011082145],"category_scores_gemma":[0.0004038174,0.00009243724,0.00006806008,0.0010158571,0.0006010443,0.0020988225,0.00083019596,0.00018988724,0.00021027487],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058249664,0.002275391,0.0060923556,0.0009995617,0.0004014048,0.00019959189,0.07810389,0.0011473402,0.27230048,0.082977474,0.03916185,0.51575816],"study_design_scores_gemma":[0.026693225,0.012492782,0.13542807,0.003947388,0.00010855656,0.00014616559,0.025839478,0.09245714,0.2575895,0.10802669,0.33164024,0.005630759],"about_ca_topic_score_codex":0.00037295552,"about_ca_topic_score_gemma":0.00008657911,"teacher_disagreement_score":0.7969126,"about_ca_system_score_codex":0.00015276947,"about_ca_system_score_gemma":0.00030973353,"threshold_uncertainty_score":0.37694815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012703689453455598,"score_gpt":0.2644667625921533,"score_spread":0.25176307313869767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963114728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021185962,0.000012228788,0.97462595,0.0016939344,0.00010476224,0.00020224204,0.0000065598265,0.00016707448,0.0020012741],"genre_scores_gemma":[0.9723319,0.000032598848,0.026763797,0.00063989544,0.000010005139,0.00001314651,0.000026713053,0.0000026090547,0.00017937006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991816,0.000050692233,0.0002760012,0.00012466371,0.00023131892,0.0001356721],"domain_scores_gemma":[0.99940187,0.00007357955,0.000103546816,0.00013506853,0.00018468757,0.00010123195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024186744,0.0000787512,0.00008015567,0.000095355805,0.00015371612,0.00024055406,0.00015275742,0.000044551067,0.000014870113],"category_scores_gemma":[0.000057072448,0.00005610393,0.000018636516,0.00019523145,0.000041282037,0.002708924,0.00007988635,0.000041489024,0.00013848269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018345798,0.00006721608,0.0047406605,0.00002389,0.000012446475,4.0451576e-7,0.0028493674,0.0059401053,0.00029732002,0.031422906,0.009286766,0.9453406],"study_design_scores_gemma":[0.0011856074,0.00012259226,0.007145034,0.000024496387,0.000002211328,0.000011422965,0.000056724362,0.97839,0.00033611598,0.002646806,0.009887941,0.00019104707],"about_ca_topic_score_codex":0.000008980813,"about_ca_topic_score_gemma":0.0000016156466,"teacher_disagreement_score":0.9724499,"about_ca_system_score_codex":0.00003511434,"about_ca_system_score_gemma":0.00005186162,"threshold_uncertainty_score":0.23196684},"labels":[],"label_agreement":null},{"id":"W2963281409","doi":"10.1109/icca.2011.6138087","title":"Optimal sensor configurations for rectangular target detection","year":2011,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"Defence Research and Development Canada","keywords":"Orientation (vector space); Symmetry (geometry); Computer science; Feature (linguistics); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Geometry","score_opus":0.044473489210898526,"score_gpt":0.256583193109017,"score_spread":0.21210970389811848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963281409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036963678,0.0000060422203,0.9769821,0.00025932325,0.00015108407,0.0002847205,0.0000017783351,0.0002127119,0.02173259],"genre_scores_gemma":[0.12877488,0.0000027792285,0.8684988,0.00020394629,0.000024816487,0.0000559103,0.000003302193,0.000005436167,0.002430108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994409,0.00002850664,0.000114957824,0.00017674472,0.000085397456,0.00015348247],"domain_scores_gemma":[0.99953514,0.000029102834,0.000027782751,0.00019619467,0.00014767857,0.000064093954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015851152,0.000056252757,0.000056686837,0.00006423281,0.00013360771,0.000063817075,0.00019512807,0.000036102432,0.00025592273],"category_scores_gemma":[0.000041999094,0.000049792336,0.000038326503,0.00015945725,0.000016742102,0.00032642306,0.000027544724,0.000040257015,0.000053428626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074316085,0.00040679015,0.00011857927,0.00004394045,0.000096081036,0.000009636583,0.008260984,0.0139777,0.060807224,0.8603575,0.006973129,0.048874076],"study_design_scores_gemma":[0.0003084323,0.00018200921,0.00010901286,0.0000019954323,0.0000022363001,0.000007615482,0.000070118374,0.8898833,0.09436262,0.0024385955,0.012504947,0.00012916913],"about_ca_topic_score_codex":0.000015049202,"about_ca_topic_score_gemma":0.000006143894,"teacher_disagreement_score":0.8759056,"about_ca_system_score_codex":0.000012315059,"about_ca_system_score_gemma":0.000028806438,"threshold_uncertainty_score":0.28021744},"labels":[],"label_agreement":null},{"id":"W2963349456","doi":"10.2139/ssrn.3423199","title":"A Competitive Analysis of Online Knapsack Problems with Unit Density","year":2019,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Knapsack problem; Competitive analysis; Generalization; Truncation (statistics); Mathematics; Online algorithm; Mathematical optimization; Continuous knapsack problem; Randomized algorithm; Computer science; Algorithm; Statistics; Upper and lower bounds","score_opus":0.017275219296385296,"score_gpt":0.26440358099012995,"score_spread":0.24712836169374466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963349456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039824713,0.00070553814,0.95641583,0.0010734927,0.00014201977,0.00048025596,0.000033534725,0.000066382345,0.0012582173],"genre_scores_gemma":[0.97858727,0.004250936,0.015477771,0.000114115515,0.00006295481,0.0000068359673,0.0001260339,0.000027618758,0.0013464411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620926,0.00031512155,0.0005545952,0.0005488854,0.0007604176,0.0016117025],"domain_scores_gemma":[0.9972088,0.00008653818,0.00078843965,0.00079068495,0.0009869138,0.00013866073],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017268013,0.00031066433,0.00077705533,0.0009024456,0.00011839624,0.00019452928,0.0016145924,0.00018593283,0.000038545095],"category_scores_gemma":[0.00003288852,0.00024739653,0.00032551735,0.001508171,0.00009506184,0.0002412033,0.00072621304,0.004018597,0.00001068218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037433067,0.00030369233,0.004755941,0.000062055624,0.0049064825,0.0000061365354,0.0006423401,0.40436184,0.000023667295,0.581652,0.00001190506,0.0032365336],"study_design_scores_gemma":[0.0019939493,0.0016506983,0.008538372,0.0004932715,0.0016153045,0.00024944928,0.0010626914,0.879728,0.000073044874,0.10231706,0.0012094675,0.0010686525],"about_ca_topic_score_codex":0.00017635274,"about_ca_topic_score_gemma":0.0059434567,"teacher_disagreement_score":0.94093806,"about_ca_system_score_codex":0.0005383355,"about_ca_system_score_gemma":0.007095583,"threshold_uncertainty_score":0.99999785},"labels":[],"label_agreement":null},{"id":"W2963486750","doi":"10.1145/3154273.3154309","title":"Line recovery by programmable particles","year":2018,"lang":"en","type":"article","venue":"CINECA IRIS Institutial research information system (University of Pisa)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Focus (optics); Computer science; Line (geometry); Computer graphics (images); Physics; Geometry; Optics; Mathematics","score_opus":0.06092425143105846,"score_gpt":0.29481657362507296,"score_spread":0.2338923221940145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963486750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008898924,0.000024142058,0.9559991,0.0011926185,0.0002204643,0.0005550372,0.000024033,0.00020602829,0.03287969],"genre_scores_gemma":[0.968521,0.000042710475,0.030567186,0.00005213249,0.00006270372,0.0000028253712,0.000028669416,0.0000040979094,0.00071867084],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979599,0.00020773493,0.00028326808,0.00019459242,0.00092594756,0.00042855655],"domain_scores_gemma":[0.9975811,0.000073016636,0.00015959435,0.0004929913,0.0014595826,0.00023371865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019293831,0.00009540579,0.00017538149,0.00045000046,0.0007237169,0.00023638531,0.0010171881,0.00009809563,0.000061784245],"category_scores_gemma":[0.00022989411,0.00010337471,0.00005739101,0.0013303608,0.00049057556,0.004251425,0.00045296169,0.00019189258,0.0007664764],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006024327,0.00032485626,0.0008479004,0.0012035503,0.00017338326,0.000028198549,0.017185379,0.0038622697,0.0024972835,0.33410883,0.24344824,0.39571768],"study_design_scores_gemma":[0.0018425437,0.00094132975,0.00018916096,0.00020028208,0.000005551357,0.000014294447,0.0040289834,0.4641812,0.0022018787,0.00020262273,0.52593994,0.0002521732],"about_ca_topic_score_codex":0.00048078957,"about_ca_topic_score_gemma":0.000043958265,"teacher_disagreement_score":0.9596221,"about_ca_system_score_codex":0.00018726785,"about_ca_system_score_gemma":0.00040107808,"threshold_uncertainty_score":0.98517585},"labels":[],"label_agreement":null},{"id":"W2963492177","doi":"10.1145/3293611.3331608","title":"Symmetry Breaking in the Plane","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Rendezvous; Visibility; Mobile robot; Euclidean geometry; Plane (geometry); RADIUS; Plane symmetry; Constant (computer programming); Euclidean distance; Symmetry (geometry); Computer science; Mathematics; Topology (electrical circuits); Combinatorics; Physics; Artificial intelligence; Geometry; Optics; Computer network","score_opus":0.013402439020270806,"score_gpt":0.2461457968931118,"score_spread":0.232743357872841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963492177","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028058823,0.000026396958,0.40345317,0.0070684804,0.00021695644,0.00029924518,2.400632e-7,0.0001126264,0.5607641],"genre_scores_gemma":[0.98404145,0.0000031190837,0.01271816,0.00173581,0.0000075361204,0.0000021302203,5.796077e-7,0.0000012666794,0.001489921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995973,0.00003907364,0.00005488222,0.00008904284,0.00012325046,0.000096449294],"domain_scores_gemma":[0.9996938,0.00006570895,0.000009163308,0.00021024891,0.000009016851,0.000012034591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027792316,0.000025931813,0.000031347325,0.000043172564,0.000016485503,0.00009088775,0.0004637346,0.000012800938,0.00010765374],"category_scores_gemma":[0.000006266596,0.000015116698,0.000008837891,0.0002480684,0.0000042714696,0.0001564233,0.000060903953,0.00005954656,0.00032103236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.75599e-7,0.000031170603,0.008143879,0.000005949064,0.0000016733562,0.000004989572,0.0010201478,0.0010923144,0.00007333916,0.97055846,0.001841599,0.017225698],"study_design_scores_gemma":[0.000825186,0.00015239768,0.025248747,0.000027466996,6.764424e-7,0.00004183327,0.00041373319,0.92476773,0.00027682152,0.008541742,0.0394609,0.0002427838],"about_ca_topic_score_codex":0.000033668377,"about_ca_topic_score_gemma":0.000010655923,"teacher_disagreement_score":0.9620167,"about_ca_system_score_codex":0.0000050466483,"about_ca_system_score_gemma":0.000011622247,"threshold_uncertainty_score":0.41263285},"labels":[],"label_agreement":null},{"id":"W2963782874","doi":"10.4230/lipics.icalp.2017.55","title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Approximation algorithm; Combinatorics; Matroid; Discrete mathematics; Rounding; Polynomial-time approximation scheme; Vertex (graph theory); Linear programming relaxation; Knapsack problem; Graph; Mathematical optimization; Linear programming; Computer science","score_opus":0.023494034116332947,"score_gpt":0.2828776831977924,"score_spread":0.25938364908145944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026432551,0.0000271505,0.9629241,0.0017029869,0.00044696213,0.0021193575,0.00039436066,0.00017860928,0.0057738987],"genre_scores_gemma":[0.703766,0.000044690732,0.29425135,0.0007520697,0.000060173083,0.00029806368,0.00016839479,0.000036528767,0.0006227394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794173,0.00003076818,0.0007398245,0.00030697873,0.00033689814,0.00064379274],"domain_scores_gemma":[0.9977462,0.00015160814,0.00052303856,0.0009964774,0.00031737445,0.00026525988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075389026,0.00031020283,0.00035997454,0.00022838044,0.0012612983,0.0017974522,0.0013186724,0.00016606746,0.000031117936],"category_scores_gemma":[0.00013818119,0.00027779196,0.0001809637,0.00009836003,0.0003594432,0.0024424708,0.00043260757,0.00021486092,0.000034043125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024039013,0.0009751459,0.012309903,0.0036400924,0.0007725988,0.0000088817405,0.06531122,0.0010390333,0.00050350645,0.80520165,0.012559566,0.09743803],"study_design_scores_gemma":[0.011680685,0.00048479537,0.004210563,0.00027820203,0.000066477005,0.00012948072,0.0021978368,0.87964803,0.0007160621,0.0688839,0.03039327,0.0013106666],"about_ca_topic_score_codex":0.000008087537,"about_ca_topic_score_gemma":0.000012962358,"teacher_disagreement_score":0.878609,"about_ca_system_score_codex":0.000035732057,"about_ca_system_score_gemma":0.00008043136,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W2963799965","doi":"10.1007/s00446-021-00406-6","title":"TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications","year":2022,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Snapshot (computer storage); Robot; Computer science; Mobile robot; Turing machine; Euclidean geometry; Distributed computing; Visibility; Theoretical computer science; Artificial intelligence; Algorithm; Computation; Mathematics; Geography; Operating system; Geometry","score_opus":0.032574999950468086,"score_gpt":0.28619097255514225,"score_spread":0.25361597260467417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963799965","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9068985,0.003497348,0.08074184,0.0016841284,0.00006373428,0.005494536,0.00027838806,0.0002781249,0.0010634084],"genre_scores_gemma":[0.9904006,0.00022214209,0.008553995,0.000009195657,0.00001117024,0.00003343555,0.000049682276,0.000011788454,0.0007079986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714833,0.0004455569,0.00021514,0.0007651326,0.0009947534,0.00043107304],"domain_scores_gemma":[0.9977187,0.00021631557,0.00014908267,0.0009619251,0.00075630046,0.00019767824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001776714,0.00013574354,0.00026309604,0.00062532077,0.00075657933,0.000041737578,0.0014076878,0.000035050398,0.000084153195],"category_scores_gemma":[0.00010168306,0.00014271011,0.000047730027,0.0020885714,0.0003793441,0.0005222898,0.0021832415,0.00055004196,0.0000069238945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025199912,0.015390585,0.040622514,0.0059995158,0.0012712015,0.00057079614,0.097452804,0.483089,0.09475632,0.04196176,0.007899634,0.20846589],"study_design_scores_gemma":[0.020883147,0.0206669,0.11397427,0.00061759254,0.0001808161,0.00088720897,0.019368071,0.5043477,0.08595456,0.00536403,0.2230289,0.0047268006],"about_ca_topic_score_codex":0.00045289725,"about_ca_topic_score_gemma":0.000063232306,"teacher_disagreement_score":0.21512927,"about_ca_system_score_codex":0.000151616,"about_ca_system_score_gemma":0.00032523528,"threshold_uncertainty_score":0.58195496},"labels":[],"label_agreement":null},{"id":"W2963874364","doi":"10.1017/s0269964818000256","title":"OPTIMAL SELECTION OF THE <i>k</i>-TH BEST CANDIDATE","year":2019,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Optimal stopping; Combinatorics; Mathematics; Selection (genetic algorithm); Stopping rule; Discrete mathematics; Statistics; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.010612130471167417,"score_gpt":0.2182559173910074,"score_spread":0.20764378691983998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963874364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98822594,0.000020074616,0.0077416934,0.0014034234,0.0001159306,0.00029972306,0.0000014351224,0.000019450676,0.0021723157],"genre_scores_gemma":[0.9945011,0.0000066102425,0.0053892876,0.00007144359,0.0000050009508,0.000008548536,3.9153232e-7,5.4436305e-7,0.00001703774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999386,0.000026071668,0.00014808531,0.0000742841,0.00026298844,0.00010256985],"domain_scores_gemma":[0.9997289,0.00008213575,0.00003911079,0.00009880667,0.000037221387,0.000013826807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446951,0.000041340896,0.00004545929,0.00004390244,0.000085485466,0.00008755813,0.0004511205,0.000014825003,0.0000065733325],"category_scores_gemma":[0.00006447057,0.000022122926,0.000015044145,0.0005337313,0.000067750974,0.0006493991,0.0000800165,0.00007597411,0.0000033571494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.217039e-7,0.00000916443,0.0030010699,0.00002074294,7.717709e-7,4.9333417e-9,0.0010407786,0.9456163,0.000040780047,0.04986313,0.00000921753,0.0003975321],"study_design_scores_gemma":[0.0000593371,0.000036082136,0.0048612976,0.000013533731,3.464048e-7,0.0000042440256,0.000046860707,0.99366385,0.0001463519,0.00073105557,0.00040280435,0.00003425192],"about_ca_topic_score_codex":0.000027484797,"about_ca_topic_score_gemma":0.000004382546,"teacher_disagreement_score":0.049132075,"about_ca_system_score_codex":0.000013975307,"about_ca_system_score_gemma":0.00005869025,"threshold_uncertainty_score":0.09021467},"labels":[],"label_agreement":null},{"id":"W2963874686","doi":"","title":"Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Combinatorics; Neighbourhood (mathematics); Approximation algorithm; Feedback vertex set; Mathematics; Vertex cover; Graph; Binary logarithm; Discrete mathematics","score_opus":0.091024929247383,"score_gpt":0.2135351025754776,"score_spread":0.1225101733280946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963874686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057869762,0.00005257639,0.93929285,0.00007878746,0.0005959393,0.00033931297,0.0000032259495,0.00022033272,0.0015472396],"genre_scores_gemma":[0.9567203,0.00007118187,0.04208424,0.000029583844,0.000053049782,0.0000031067798,0.000008350135,0.000011086763,0.0010191196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989398,0.000060310376,0.00013288662,0.00034792224,0.000090206304,0.00042883682],"domain_scores_gemma":[0.99909395,0.00008977063,0.00008005337,0.0003685614,0.00016544298,0.00020219877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002642488,0.00013484895,0.00012595793,0.0002015526,0.00023530051,0.00007239038,0.0005535198,0.000083802945,0.000017486624],"category_scores_gemma":[0.000025121759,0.00014352577,0.00009164602,0.00078223,0.00003814787,0.0015276707,0.00013286468,0.00010043263,0.000062084895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002565404,0.0003505107,0.018931337,0.000057790727,0.0000609653,0.0000120924005,0.0012655028,0.009016944,0.00035035392,0.9561776,0.00041205142,0.013339176],"study_design_scores_gemma":[0.0007777895,0.00007925559,0.00162983,0.000021851696,0.000017185625,0.0000021335316,0.00008759828,0.96443594,0.00088565465,0.030822048,0.00097598904,0.0002647051],"about_ca_topic_score_codex":0.000016725442,"about_ca_topic_score_gemma":0.0000010207069,"teacher_disagreement_score":0.955419,"about_ca_system_score_codex":0.00007781377,"about_ca_system_score_gemma":0.000034696295,"threshold_uncertainty_score":0.58528113},"labels":[],"label_agreement":null},{"id":"W2963945095","doi":"10.1016/j.tcs.2019.07.018","title":"Energy-optimal broadcast and exploration in a tree using mobile agents","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Node (physics); Computer science; Enhanced Data Rates for GSM Evolution; Mobile agent; Root (linguistics); Set (abstract data type); Broadcasting (networking); Energy (signal processing); Algorithm; Mathematics; Combinatorics; Theoretical computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.023103416894729476,"score_gpt":0.2757461246963497,"score_spread":0.2526427078016202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963945095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17083596,0.000016447608,0.8276325,0.00015395199,0.00017059039,0.00015063143,2.7950213e-7,0.000051968847,0.000987714],"genre_scores_gemma":[0.8383829,0.000011523174,0.16130462,0.00025284564,0.000020269514,0.000006596182,4.6846645e-7,0.000004411227,0.00001638715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983081,0.00010029012,0.00020171738,0.00055175397,0.00045233726,0.00038579298],"domain_scores_gemma":[0.9992394,0.00006995698,0.0000393717,0.00039297287,0.00008829562,0.00017003069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007632848,0.000114685965,0.00013763546,0.00025276505,0.00012995371,0.0004367053,0.0008366191,0.000037079557,0.000040001374],"category_scores_gemma":[0.000012266879,0.00010050356,0.000021275968,0.0010148507,0.00062176445,0.0015046882,0.0007591662,0.000101985,0.000026423799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053823987,0.00005153474,0.0002866033,0.000005120848,0.0000010769185,0.0000055645187,0.00094555493,0.02918507,0.0007331908,0.90697795,0.0000051274424,0.061797794],"study_design_scores_gemma":[0.0002875583,0.0001623655,0.00024894817,0.000022380533,6.297281e-7,0.000012602576,0.000013842547,0.9830645,0.0006271444,0.015351363,0.00007839336,0.0001302971],"about_ca_topic_score_codex":0.000008105823,"about_ca_topic_score_gemma":9.612105e-7,"teacher_disagreement_score":0.9538794,"about_ca_system_score_codex":0.00005148707,"about_ca_system_score_gemma":0.00008700504,"threshold_uncertainty_score":0.42111593},"labels":[],"label_agreement":null},{"id":"W2964657030","doi":"10.1007/978-3-030-26766-7_19","title":"Optimizing Self-organizing Lists-on-Lists Using Pursuit-Oriented Enhanced Object Partitioning","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Probabilistic logic; Learning automata; Object (grammar); Locality; Context (archaeology); Automaton; De facto; Theoretical computer science; Reinforcement learning; Artificial intelligence; Scheme (mathematics); Mathematics","score_opus":0.023128662896949592,"score_gpt":0.26818415449428973,"score_spread":0.24505549159734014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964657030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028256627,0.00016389864,0.9897403,0.0003808223,0.002506538,0.00070844125,0.000004193343,0.0004821889,0.0057310425],"genre_scores_gemma":[0.13016826,0.00006462423,0.8669234,0.0018164279,0.00045943682,0.000009246769,0.000013333889,0.0000844735,0.00046081416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942468,0.00009633642,0.00073804037,0.0020888154,0.0017079167,0.001122108],"domain_scores_gemma":[0.9965451,0.00052908267,0.0004712219,0.0015853343,0.0005807985,0.0002884679],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001284701,0.00070094713,0.0006791378,0.0011469139,0.0006541088,0.0014758065,0.0030382087,0.00038372644,0.0000576782],"category_scores_gemma":[0.0001893895,0.0006967032,0.00016909264,0.0013349581,0.00035592046,0.001193761,0.001602062,0.0011893958,0.00012537121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094232655,0.000071456576,0.000025427657,0.00008920269,0.00003139416,0.00006730477,0.004113558,0.91798365,0.0017920942,0.023180809,0.000016156951,0.052619494],"study_design_scores_gemma":[0.00049036636,0.00022709357,0.00001555161,0.0009764331,0.000010678849,0.000045085224,7.405048e-7,0.98132795,0.007911313,0.0074827615,0.00061088597,0.0009011529],"about_ca_topic_score_codex":0.000017566952,"about_ca_topic_score_gemma":0.000019838797,"teacher_disagreement_score":0.12988569,"about_ca_system_score_codex":0.00081337034,"about_ca_system_score_gemma":0.0013103937,"threshold_uncertainty_score":0.9995608},"labels":[],"label_agreement":null},{"id":"W2965199817","doi":"","title":"Pure entropic regularization for metrical task systems","year":2019,"lang":"en","type":"article","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Competitive analysis; Randomized algorithm; Online algorithm; Binary logarithm; Metric space; Computer science; Deterministic algorithm; Mathematics; Conditional entropy; Entropy (arrow of time); Embedding; Regularization (linguistics); Exploit; Algorithm; Mathematical optimization; Combinatorics; Discrete mathematics; Upper and lower bounds; Artificial intelligence; Principle of maximum entropy","score_opus":0.024890200048123992,"score_gpt":0.24760775900450654,"score_spread":0.22271755895638257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965199817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011150636,0.000044385382,0.9658766,0.0016264725,0.0001800613,0.0016210882,0.00013276664,0.0001363666,0.01923167],"genre_scores_gemma":[0.78981143,0.0015534594,0.14703736,0.00006218987,0.000092100214,0.0000018983926,0.00040872773,0.000050009225,0.06098281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99664044,0.0006008481,0.0001781722,0.0007458819,0.0010394086,0.0007952507],"domain_scores_gemma":[0.9971037,0.00058227964,0.00017398564,0.0008507071,0.00089739606,0.00039195002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990952,0.00019450675,0.0003871788,0.0015094096,0.0007637198,0.00013194204,0.002562305,0.00016210806,0.00009897133],"category_scores_gemma":[0.00013162148,0.00023950919,0.00022426341,0.0022281322,0.00035581694,0.0013047063,0.0013367481,0.00047800154,0.00003350334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006172759,0.00041277075,0.0067356955,0.00051378214,0.00024323686,0.00010721278,0.0031563647,0.0067738844,0.0025017422,0.958936,0.0110480925,0.008953956],"study_design_scores_gemma":[0.0036093167,0.0011728002,0.0023355489,0.00010974983,0.000026193238,0.000011479811,0.005189317,0.4589753,0.000062268846,0.0060676076,0.52201056,0.00042985918],"about_ca_topic_score_codex":0.00016668251,"about_ca_topic_score_gemma":0.00006288124,"teacher_disagreement_score":0.9528684,"about_ca_system_score_codex":0.0002909048,"about_ca_system_score_gemma":0.00044473648,"threshold_uncertainty_score":0.9766901},"labels":[],"label_agreement":null},{"id":"W2966140795","doi":"","title":"Exploration et couverture par stigmergie d’un environnement inconnu avec une flotte de robots autonomes réactifs","year":2019,"lang":"fr","type":"preprint","venue":"INRIA a CCSD electronic archive server","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Humanities; Art; Brick; Political science; Geography; Archaeology","score_opus":0.019628999083163724,"score_gpt":0.25386548897567646,"score_spread":0.23423648989251272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966140795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01536707,0.0014865061,0.9404739,0.035483994,0.0015428616,0.002469559,0.00010317879,0.00033375347,0.0027391603],"genre_scores_gemma":[0.9018142,0.010484505,0.06734011,0.00620401,0.00066066463,0.0008517071,0.0016077985,0.00027381044,0.010763159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913901,0.0019143508,0.0012232071,0.002102691,0.0010278875,0.002341751],"domain_scores_gemma":[0.9957643,0.0005321632,0.00082212413,0.002083043,0.00025589895,0.00054242776],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018065338,0.0011188441,0.0010142304,0.00031552344,0.0005973623,0.0007060919,0.0024602686,0.0005966986,0.00079762575],"category_scores_gemma":[0.00012808261,0.0011843726,0.0004962358,0.00063577853,0.00033369617,0.0017035098,0.0025898325,0.0030632177,0.0008959885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009299377,0.00038146332,0.0003552831,0.00018083688,0.00049155456,0.000029528506,0.015028203,0.6262117,0.00044931105,0.3457356,0.0027044937,0.008338996],"study_design_scores_gemma":[0.0019167423,0.00062246696,0.005189198,0.0003502769,0.00011316168,0.00003442631,0.00013989407,0.7354431,0.000529563,0.11106604,0.14337012,0.0012250084],"about_ca_topic_score_codex":0.00097622414,"about_ca_topic_score_gemma":0.0060920566,"teacher_disagreement_score":0.8864472,"about_ca_system_score_codex":0.0016528997,"about_ca_system_score_gemma":0.0050555733,"threshold_uncertainty_score":0.9998819},"labels":[],"label_agreement":null},{"id":"W2968601138","doi":"10.1109/icra.2019.8794252","title":"The Robust Canadian Traveler Problem Applied to Robot Routing","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree traversal; Robot; Computer science; Mathematical optimization; Routing (electronic design automation); Vehicle routing problem; Selection (genetic algorithm); Variation (astronomy); Operations research; Artificial intelligence; Algorithm; Mathematics; Computer network","score_opus":0.015660010591459952,"score_gpt":0.21308443356914258,"score_spread":0.19742442297768265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968601138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021582594,0.0000040438954,0.62388,0.0092635,0.00012866022,0.0006127069,3.655627e-7,0.00009960376,0.36579525],"genre_scores_gemma":[0.72840434,0.0000035725336,0.24188761,0.0038423827,0.000032052983,0.000043658256,0.0000017556838,0.00001300614,0.025771638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892277,0.000025016738,0.00014482632,0.0002575174,0.0001968878,0.0004530154],"domain_scores_gemma":[0.9991738,0.00003870482,0.000021707872,0.00040980874,0.000067224704,0.00028871992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041865444,0.00008149128,0.000072928684,0.000072683826,0.00026568398,0.00043704535,0.00080519466,0.00003317525,0.0001333024],"category_scores_gemma":[0.000010016828,0.000054145665,0.000021909538,0.0004064681,0.000010904595,0.0001347094,0.000120550176,0.0001028344,0.0010568463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015705461,0.0000087726685,0.0002871373,0.0000037534596,0.0000063701805,9.0782413e-7,0.0010293096,0.20537914,0.00022582033,0.7386126,0.004194286,0.05025034],"study_design_scores_gemma":[0.00045142084,0.00007934812,0.002165294,0.000015377162,0.00000161272,0.0000050924086,0.00031236044,0.894408,0.00037972955,0.0022465657,0.09951093,0.00042430338],"about_ca_topic_score_codex":0.007398002,"about_ca_topic_score_gemma":0.037227537,"teacher_disagreement_score":0.73636603,"about_ca_system_score_codex":0.00006629677,"about_ca_system_score_gemma":0.0002336002,"threshold_uncertainty_score":0.99972093},"labels":[],"label_agreement":null},{"id":"W2969848726","doi":"10.1007/978-3-030-34405-4_1","title":"Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Equilateral triangle; Perimeter; Combinatorics; Range (aeronautics); Centroid; Mathematics; Point (geometry); Computer science; Mobile agent; Mathematical optimization; Geometry; Distributed computing; Engineering","score_opus":0.0343644728755405,"score_gpt":0.30826128946266623,"score_spread":0.2738968165871257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969848726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055795744,0.0005430042,0.94158864,0.00034313288,0.00073118246,0.0008963103,0.0000142766885,0.00005068782,0.00003701627],"genre_scores_gemma":[0.723891,0.00017495765,0.27569535,0.00015395536,0.000020319498,0.000022389047,0.00003154767,0.000007654396,0.000002816994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969281,0.0004067564,0.0007912128,0.00073776505,0.00081275735,0.00032341495],"domain_scores_gemma":[0.99649805,0.00041340847,0.0006488326,0.0017967385,0.0005637861,0.00007916739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020933403,0.00023018505,0.0004862065,0.00056983967,0.000071245675,0.00020973849,0.0037970901,0.00022568165,0.00001423671],"category_scores_gemma":[0.00012404927,0.00021289008,0.00011611275,0.0013706717,0.00038292722,0.00052045996,0.0028308148,0.0004823194,0.0000050963877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010826878,0.0001769226,0.002837749,0.00013618953,0.000012975988,7.214752e-7,0.0023268673,0.8210124,0.00093998434,0.00012435285,0.00007472932,0.17234628],"study_design_scores_gemma":[0.00052590406,0.00015798514,0.0016426283,0.00027606823,0.000004208674,0.0000013844262,8.299224e-7,0.9860202,0.0077618863,0.0033863843,0.000027754888,0.00019476698],"about_ca_topic_score_codex":0.00010277616,"about_ca_topic_score_gemma":0.000011120915,"teacher_disagreement_score":0.66809523,"about_ca_system_score_codex":0.00011049586,"about_ca_system_score_gemma":0.00041186306,"threshold_uncertainty_score":0.8681406},"labels":[],"label_agreement":null},{"id":"W2970627438","doi":"10.1016/j.tcs.2019.08.031","title":"Searching for a non-adversarial, uncooperative agent on a cycle","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Perimeter; Position (finance); RADIUS; Computer science; Upper and lower bounds; Constant (computer programming); Turning radius; Mobile robot; Mathematics; Algorithm; Artificial intelligence; Engineering; Geometry; Computer network","score_opus":0.01357223503755122,"score_gpt":0.28620262882830155,"score_spread":0.2726303937907503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970627438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01591741,0.000001669978,0.97187203,0.0017254304,0.0006702237,0.00072852185,0.0000016221531,0.00011481037,0.008968307],"genre_scores_gemma":[0.77897644,0.000001521643,0.21960223,0.0012651082,0.00006702722,0.000018431467,9.064841e-7,0.000006862261,0.0000615014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976927,0.00010017447,0.00019587422,0.0007355572,0.0006826073,0.00059309386],"domain_scores_gemma":[0.99836713,0.00040346256,0.000040821193,0.000663296,0.0002533303,0.000271977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016380568,0.00014995498,0.0001776989,0.00018934041,0.00041655503,0.0006464,0.0018649898,0.000036831014,0.000062015766],"category_scores_gemma":[0.00009699464,0.00011626061,0.00006814244,0.00083292625,0.0007086428,0.000617891,0.00072602544,0.00018544369,0.0003422123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001706255,0.000060209775,0.000007542968,0.0000074165314,0.0000034198006,0.0000018009042,0.0010115023,0.025326999,0.0005117833,0.9599742,0.00006006293,0.013017974],"study_design_scores_gemma":[0.0005392423,0.000714475,0.00006469686,0.000032493084,0.0000010356817,0.0000032016542,0.000008696681,0.9463731,0.0019267238,0.049857818,0.00031505577,0.00016345394],"about_ca_topic_score_codex":0.000002768377,"about_ca_topic_score_gemma":2.842813e-7,"teacher_disagreement_score":0.92104614,"about_ca_system_score_codex":0.00008289854,"about_ca_system_score_gemma":0.00023158891,"threshold_uncertainty_score":0.623325},"labels":[],"label_agreement":null},{"id":"W2970866601","doi":"10.1137/20m1362899","title":"Want to Gather? No Need to Chatter!","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); A priori and a posteriori; Computer science; Task (project management); Product (mathematics); Time complexity; Polynomial; Upper and lower bounds; Theoretical computer science; Mathematics; Algorithm; Engineering","score_opus":0.04709621463748689,"score_gpt":0.31005201720830283,"score_spread":0.26295580257081597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970866601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025408517,0.000025628346,0.93246704,0.056193296,0.0032263147,0.0004884684,0.0000028714237,0.00022254563,0.004832953],"genre_scores_gemma":[0.37655625,0.00003004892,0.5826017,0.03709234,0.003087095,0.00000907137,0.0000050522335,0.00007934156,0.0005390557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678737,0.00026513095,0.0006829875,0.0007553587,0.0008709016,0.0006382767],"domain_scores_gemma":[0.99745834,0.00013113963,0.00032807695,0.0006330118,0.00044513357,0.0010042973],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010296346,0.0003646731,0.00047979463,0.00043359856,0.0003530753,0.0015430386,0.0024529404,0.00013523188,0.00006703558],"category_scores_gemma":[0.00024961913,0.00033292378,0.0002195464,0.0005508241,0.000013139412,0.000126703,0.003295695,0.0017664076,0.001353997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042297324,0.00012047286,0.000071456554,0.00009776972,0.0000960515,0.00030600867,0.0078161135,0.8611285,0.0007173545,0.005758736,0.03375869,0.09008652],"study_design_scores_gemma":[0.00044371613,0.0006528504,0.0002845609,0.0011648154,0.000006246534,0.000101936086,0.00005794068,0.95433,0.0002066206,0.0023023745,0.03977306,0.0006758589],"about_ca_topic_score_codex":0.0000068436057,"about_ca_topic_score_gemma":7.035558e-7,"teacher_disagreement_score":0.3740154,"about_ca_system_score_codex":0.00020393352,"about_ca_system_score_gemma":0.00031046142,"threshold_uncertainty_score":0.99991226},"labels":[],"label_agreement":null},{"id":"W2972852770","doi":"10.1007/s00446-019-00362-2","title":"Meeting in a polygon by anonymous oblivious robots","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Computer science; Combinatorics; Asynchronous communication; Algebraic number; Visibility polygon; Upper and lower bounds; Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Simple polygon; Regular polygon; Geometry","score_opus":0.006297182411765845,"score_gpt":0.22727481758885,"score_spread":0.22097763517708413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972852770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13107428,0.00017680797,0.8647512,0.0005814832,0.00024313648,0.00029605164,0.000012944329,0.00033538908,0.0025286789],"genre_scores_gemma":[0.9863724,0.0000058375936,0.013175204,0.0002571586,0.000020447622,0.000003011142,0.00008404232,0.000011353174,0.000070526956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982145,0.00013003696,0.00034432494,0.00046582049,0.00029457992,0.0005507292],"domain_scores_gemma":[0.9991368,0.00014295487,0.000117891985,0.00041086168,0.000081544655,0.000109924906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966902,0.00015524963,0.00020809741,0.00012758658,0.00010570086,0.00027863876,0.0007937956,0.00007556279,0.000019235204],"category_scores_gemma":[0.00006125588,0.00016328835,0.0000495456,0.0010135107,0.000017248782,0.00027075116,0.00030704844,0.00024471057,0.000108352026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001461349,0.00058523176,0.08085507,0.000093351155,0.00003833356,0.0000692965,0.0020096274,0.8318006,0.008956331,0.017208586,0.0068011833,0.0515678],"study_design_scores_gemma":[0.0006140643,0.000051641066,0.0020300387,0.000076746874,9.894251e-7,0.000008741275,0.0000524199,0.99529094,0.00074212323,0.00018069045,0.0007276998,0.00022390048],"about_ca_topic_score_codex":0.000100570476,"about_ca_topic_score_gemma":0.0000069502844,"teacher_disagreement_score":0.85529816,"about_ca_system_score_codex":0.00009846246,"about_ca_system_score_gemma":0.00006138105,"threshold_uncertainty_score":0.66587055},"labels":[],"label_agreement":null},{"id":"W2975694009","doi":"10.1016/j.tcs.2019.09.026","title":"Priority evacuation from a disk: The case of n = 1,2,3","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Robot; Servant; Queen (butterfly); Computer science; Position (finance); Simulation; Mathematics; Artificial intelligence; Business; Programming language","score_opus":0.010608038022033667,"score_gpt":0.2689961043936256,"score_spread":0.25838806637159195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975694009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20078959,0.000010925243,0.7958081,0.0011657511,0.0002931528,0.00021735004,0.0000018646774,0.000052257812,0.0016610296],"genre_scores_gemma":[0.904561,0.0000024892752,0.095145345,0.00024398207,0.000032039265,0.00000275624,5.433837e-7,0.0000027333147,0.000009107971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984806,0.00016574212,0.00021558115,0.00041442842,0.00045283444,0.0002708136],"domain_scores_gemma":[0.99827325,0.00040988027,0.000070607035,0.00090171216,0.00022630006,0.00011821906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293794,0.00009033841,0.0001266854,0.000073709045,0.0002125389,0.00025267937,0.0017685342,0.000029193707,0.00011532363],"category_scores_gemma":[0.0000804729,0.000056071225,0.0000436376,0.0009084498,0.0011940546,0.00055731507,0.0008484085,0.00014021488,0.00010084838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027658075,0.00002820867,0.00013556337,0.0000030067233,0.0000020873451,0.000010376557,0.0008044018,0.0007879355,0.0003728054,0.973094,0.000011723851,0.024747124],"study_design_scores_gemma":[0.0001525879,0.00008728861,0.0008663423,0.000010827089,0.0000018212552,0.00003929606,0.000012383853,0.87789243,0.00140176,0.119425446,0.000033689044,0.00007613836],"about_ca_topic_score_codex":0.000035666566,"about_ca_topic_score_gemma":0.0000021766057,"teacher_disagreement_score":0.87710446,"about_ca_system_score_codex":0.000026091253,"about_ca_system_score_gemma":0.00012402584,"threshold_uncertainty_score":0.43995437},"labels":[],"label_agreement":null},{"id":"W2975703404","doi":"10.1109/infcomw.2019.8845156","title":"Task Dispatch through Online Training for Profit Maximization at the Cloud","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Profit maximization; Profit (economics); Scheduling (production processes); Task analysis; Upper and lower bounds; Distributed computing; Real-time computing; Operations research; Mathematical optimization; Task (project management); Operating system","score_opus":0.05643131051759774,"score_gpt":0.3007617829015977,"score_spread":0.24433047238399996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975703404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074467114,0.000021434049,0.9752129,0.010680877,0.00033551743,0.00080152904,0.000007901462,0.00012958994,0.0053635864],"genre_scores_gemma":[0.24324453,0.00007327192,0.66215223,0.007045072,0.00024303034,0.00014379862,0.00019446516,0.00003709693,0.08686652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991214,0.00004114647,0.00015583451,0.0002589631,0.00019266082,0.00022994033],"domain_scores_gemma":[0.9993263,0.0001100266,0.000052964548,0.0003812428,0.000093605355,0.000035854428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024323315,0.000081692124,0.00009091454,0.000019532286,0.00015704648,0.00011706892,0.0004782547,0.00003740705,0.00020037616],"category_scores_gemma":[0.000032552613,0.000050515973,0.000046517904,0.0002327866,0.000023677858,0.00036872874,0.00018207682,0.000061896404,0.000100631114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000474166,0.00009639602,0.0054888716,0.00009485935,0.000054681026,0.0000011275691,0.016584031,0.0975195,0.0012056783,0.7935261,0.02298094,0.06240041],"study_design_scores_gemma":[0.00057509175,0.00008727693,0.00042681117,0.000010280164,0.0000025003478,0.0000031067098,0.00020828142,0.958835,0.00030382394,0.0041292817,0.035289392,0.00012912028],"about_ca_topic_score_codex":0.00001402785,"about_ca_topic_score_gemma":0.000039389848,"teacher_disagreement_score":0.86131555,"about_ca_system_score_codex":0.000029448036,"about_ca_system_score_gemma":0.000050468603,"threshold_uncertainty_score":0.21939784},"labels":[],"label_agreement":null},{"id":"W2977712778","doi":"10.1007/s00453-020-00752-0","title":"Building a Nest by an Automaton","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Narodowym Centrum Nauki; Université du Québec en Outaouais","keywords":"Algorithm; Computer science; Tree (set theory); Robot; Geometry; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.019838259336137455,"score_gpt":0.26788215972330226,"score_spread":0.2480439003871648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977712778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009056698,0.000030451596,0.98748654,0.010155861,0.00007385047,0.000094867304,0.0000028478216,0.00048284998,0.00076704525],"genre_scores_gemma":[0.11961555,0.000009406477,0.87461644,0.00548767,0.000115272276,0.000012723779,0.0000095988935,0.000015759038,0.00011755272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991407,0.000048840047,0.000119535514,0.00029386338,0.00019028955,0.00020680089],"domain_scores_gemma":[0.9994363,0.000021256772,0.00003018739,0.00022249586,0.000041341485,0.00024838696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009191039,0.00007884146,0.00008654909,0.000027241234,0.00008846154,0.00019470029,0.0006492445,0.00003506183,0.000037633123],"category_scores_gemma":[0.000023647277,0.00007650882,0.000024569781,0.00033901643,0.000019942523,0.0005441385,0.00014984912,0.0000975272,0.000099323486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006080599,0.0002549766,0.0001696438,0.000038713566,0.000037619004,0.00006238953,0.003777247,0.0034132178,0.021406583,0.1506468,0.08471278,0.73547393],"study_design_scores_gemma":[0.00016650946,0.000088748464,0.00002508304,0.0000028459003,9.4802414e-7,0.0000047084804,0.000007820269,0.9482043,0.0031826638,0.0005944341,0.047614615,0.00010732007],"about_ca_topic_score_codex":0.000012328938,"about_ca_topic_score_gemma":2.8134278e-7,"teacher_disagreement_score":0.9447911,"about_ca_system_score_codex":0.000011834234,"about_ca_system_score_gemma":0.000038100687,"threshold_uncertainty_score":0.31199393},"labels":[],"label_agreement":null},{"id":"W2978693269","doi":"10.22215/etd/2019-13628","title":"Experimental Analysis of Programmable Particles","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Homogeneous; Distributed computing; Simple (philosophy); Physics","score_opus":0.022296432534118976,"score_gpt":0.3174123726107749,"score_spread":0.29511594007665587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978693269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24613106,0.001277476,0.5395465,0.00021218327,0.0011667861,0.0019245484,0.000011357896,0.000615515,0.2091146],"genre_scores_gemma":[0.9099144,0.000014256178,0.053567976,0.000036898153,0.0000050709323,0.000038004575,0.00029293206,0.000008715399,0.036121793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999188,0.00002565965,0.00019415574,0.00021401171,0.00025014443,0.00012802574],"domain_scores_gemma":[0.99941534,0.00001692444,0.000105410356,0.00031925432,0.00010273397,0.000040330946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097062424,0.00007984804,0.00021206781,0.00026785312,0.000022576056,0.000085379776,0.00037398093,0.00005982294,0.0002683576],"category_scores_gemma":[0.000005722353,0.00006808089,0.00012442117,0.0009233041,0.000008007275,0.00016326283,0.00003395272,0.00004740605,0.000034826604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009788622,0.0024627068,0.005094297,0.00049703504,0.0067929514,0.000008380398,0.02974492,0.05992138,0.050598275,0.71354663,0.003215588,0.12801997],"study_design_scores_gemma":[0.00017301917,0.00010467729,0.00077619555,0.000014062848,0.0001139458,9.343518e-8,0.0007950808,0.8991139,0.09809429,0.00008497584,0.00055338466,0.00017639104],"about_ca_topic_score_codex":0.000055166485,"about_ca_topic_score_gemma":0.000030091967,"teacher_disagreement_score":0.8391925,"about_ca_system_score_codex":0.000012191946,"about_ca_system_score_gemma":0.000063569416,"threshold_uncertainty_score":0.29383278},"labels":[],"label_agreement":null},{"id":"W2980007075","doi":"10.1007/s10107-021-01723-1","title":"The aggregation closure is polyhedral for packing and covering integer programs","year":2021,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Closure (psychology); Intersection (aeronautics); Generalization; Combinatorics; Polyhedron; Integer (computer science); Mathematics; Computer science; Political science; Geography; Mathematical analysis; Law","score_opus":0.039457364235447955,"score_gpt":0.2967326560548221,"score_spread":0.25727529181937414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980007075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029316382,0.0006170176,0.99075043,0.0033031236,0.0002372739,0.0017137338,0.0000015049181,0.0002471439,0.00019813993],"genre_scores_gemma":[0.3013726,0.00008442937,0.6969268,0.0001924854,0.0001347948,0.00094652484,0.0000318281,0.00004776981,0.0002628003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978416,0.0000927394,0.00049745594,0.0006065757,0.00043326686,0.00052835734],"domain_scores_gemma":[0.99838233,0.00038544385,0.00021734326,0.00064936513,0.00021936532,0.00014617984],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010924835,0.0002706733,0.00032709775,0.00005660876,0.0004554683,0.003804644,0.00069485704,0.00021627924,0.000006263294],"category_scores_gemma":[0.00036410353,0.00019587405,0.00018614189,0.00020871016,0.00013967889,0.00027661512,0.0014296576,0.00049987115,0.000004144748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006591615,0.00012872361,0.00018507836,0.0013439466,0.000103376944,0.0000062081563,0.0072934236,0.00013787327,0.000009081311,0.12692975,0.00005582103,0.8638001],"study_design_scores_gemma":[0.00041363956,0.00012849845,0.00002492128,0.0013611034,0.000039427778,0.000026488555,0.0005846585,0.8257529,0.00027030782,0.16465646,0.0062264213,0.0005151748],"about_ca_topic_score_codex":0.000007095594,"about_ca_topic_score_gemma":0.0000069781454,"teacher_disagreement_score":0.86328495,"about_ca_system_score_codex":0.000056540892,"about_ca_system_score_gemma":0.00011423893,"threshold_uncertainty_score":0.9972295},"labels":[],"label_agreement":null},{"id":"W2981655024","doi":"10.1007/s00224-019-09952-w","title":"Guest Editorial: Special Issue on Approximation and Online Algorithms","year":2019,"lang":"en","type":"editorial","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.013594254467402532,"score_gpt":0.2748879037506026,"score_spread":0.2612936492832001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981655024","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011123046,0.00012276591,0.08531318,0.000040960796,0.9106176,0.0006646471,0.00006487701,0.00018194725,0.002982895],"genre_scores_gemma":[0.00010654407,0.000046100984,0.0037099821,0.000013014379,0.99409235,0.000004520191,0.00020642177,0.000043729902,0.0017773543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995805,0.00080461544,0.0008072875,0.00069923006,0.0015197727,0.0003640615],"domain_scores_gemma":[0.99523836,0.0023658636,0.0008046313,0.000800782,0.00067345216,0.00011689476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031617049,0.00037568933,0.0008004068,0.00031915132,0.00013967535,0.00035814484,0.0011576528,0.0006612803,0.0000063145326],"category_scores_gemma":[0.00065035064,0.00034716097,0.00009199269,0.00031130298,0.00010908805,0.00021575337,0.00039862256,0.0007509449,0.00007763854],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002075958,0.00009185576,6.472139e-7,0.0005103478,0.000043353157,0.0000015589445,0.0009764603,0.0036476748,0.00000440906,0.0120210275,0.9774573,0.0052246046],"study_design_scores_gemma":[0.00064862915,0.00032802182,0.0000014740256,0.00082634145,0.000013155425,0.0000020937596,0.00007096861,0.09810739,0.000011153646,0.00055317103,0.89910746,0.00033013307],"about_ca_topic_score_codex":0.000030339357,"about_ca_topic_score_gemma":7.5640645e-7,"teacher_disagreement_score":0.09445972,"about_ca_system_score_codex":0.00010514338,"about_ca_system_score_gemma":0.00026212333,"threshold_uncertainty_score":0.999898},"labels":[],"label_agreement":null},{"id":"W2985558354","doi":"10.1109/mrs.2019.8901079","title":"On Minimum Time Multi-Robot Planning with Guarantees on the Total Collected Reward","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Computer science; Mobile robot; Motion planning; Value (mathematics); Approximation algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.020792738848567072,"score_gpt":0.2439213876007203,"score_spread":0.2231286487521532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985558354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002499,0.000016839133,0.5457106,0.008849325,0.00031236943,0.0016660648,0.0000036179983,0.0007517116,0.14243953],"genre_scores_gemma":[0.842525,0.0000015340382,0.047130335,0.0023677705,0.000019712033,0.000023700812,0.000004233876,0.00001814366,0.107909575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.00008143869,0.0001108846,0.00027520282,0.00030325534,0.00022550672],"domain_scores_gemma":[0.99916005,0.00027860314,0.000038853483,0.0004055026,0.00006771924,0.00004927768],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001750276,0.000109726534,0.00010729891,0.00007847874,0.00012748233,0.00017275772,0.0004325037,0.00003483034,0.00040128012],"category_scores_gemma":[0.000034876473,0.000058429898,0.000026589552,0.00038065595,0.00002674018,0.00013054651,0.000077444645,0.0001373672,0.0011859321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004550273,0.0007275749,0.0008900897,0.00002720411,0.00014325876,0.000051240917,0.007566772,0.81695986,0.00751413,0.10374842,0.06038891,0.0015275441],"study_design_scores_gemma":[0.00082774693,0.00075538765,0.0016275122,0.000067268964,0.0000011922028,0.0000071291784,0.000050137598,0.9953334,0.00085431506,0.00006903351,0.0002562422,0.00015068268],"about_ca_topic_score_codex":0.000008183675,"about_ca_topic_score_gemma":0.0000015522648,"teacher_disagreement_score":0.5422751,"about_ca_system_score_codex":0.000020742,"about_ca_system_score_gemma":0.000057297453,"threshold_uncertainty_score":0.99959177},"labels":[],"label_agreement":null},{"id":"W2986240933","doi":"10.1109/mrs.2019.8901059","title":"Collision-aware Task Assignment for Multi-Robot Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Robot; Collision avoidance; Bidding; Task (project management); Collision; Function (biology); Binary number; Mathematical optimization; Distributed computing; Artificial intelligence; Engineering; Mathematics; Computer security","score_opus":0.05146401897043256,"score_gpt":0.303555263479558,"score_spread":0.25209124450912546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986240933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009987906,0.00003195435,0.99564224,0.0005092095,0.00062321196,0.0010547751,0.000004771215,0.00014701759,0.0018869553],"genre_scores_gemma":[0.5036337,0.000022507927,0.4298129,0.0007538693,0.000052078824,0.00024364983,0.000016930873,0.000019772777,0.06544459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902564,0.00004029865,0.00017553578,0.0002889366,0.00024132231,0.0002282754],"domain_scores_gemma":[0.999252,0.00008161407,0.000045735764,0.0003809791,0.00013966968,0.000099975536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028862193,0.000083645085,0.00011997067,0.000057947804,0.00007803087,0.00024301096,0.00047900702,0.000045296674,0.00005219062],"category_scores_gemma":[0.000014838362,0.000064390835,0.000043702927,0.00018423444,0.000008740323,0.0002780276,0.00013457154,0.000044922337,0.0003554248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013119135,0.00036602118,0.0013438597,0.00020183196,0.000051364674,0.000003373405,0.00075609627,0.6981981,0.002093435,0.25454238,0.036770757,0.00565971],"study_design_scores_gemma":[0.00063628395,0.00009650977,0.00005990537,0.000017690429,8.86523e-7,0.0000014015676,0.000057383684,0.97897524,0.0002458573,0.00003751669,0.019766971,0.00010435108],"about_ca_topic_score_codex":0.000021671975,"about_ca_topic_score_gemma":0.0000023488365,"teacher_disagreement_score":0.56582934,"about_ca_system_score_codex":0.000046863886,"about_ca_system_score_gemma":0.00006388554,"threshold_uncertainty_score":0.45683852},"labels":[],"label_agreement":null},{"id":"W2991443058","doi":"10.1007/978-3-030-34500-6_13","title":"Deep Reinforcement Learning for Multi-satellite Collection Scheduling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Royal Military College of Canada; Queen's University","funders":"","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Schedule; Artificial intelligence; Heuristic; Baseline (sea); Task (project management); Critical path method; Machine learning; Mathematical optimization","score_opus":0.03757488183802357,"score_gpt":0.2835196784441623,"score_spread":0.24594479660613874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991443058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028880079,0.00032297027,0.994628,0.0003629855,0.0014313513,0.0011014045,2.62411e-7,0.00017748508,0.001972655],"genre_scores_gemma":[0.013244778,0.00023151712,0.9802642,0.0007708147,0.00018768478,0.00002644098,0.00001451136,0.00003933979,0.0052207056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677354,0.000036565172,0.000517704,0.0012467947,0.0007531723,0.0006722165],"domain_scores_gemma":[0.9979774,0.0003672366,0.00030009652,0.00072476774,0.00047799776,0.00015251119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010928805,0.0003969082,0.00040408576,0.00085533486,0.0004633087,0.0007138674,0.001690833,0.0002810185,0.00002212334],"category_scores_gemma":[0.00017013245,0.00038455505,0.00014170409,0.0006106384,0.00021294766,0.00063055387,0.00072807015,0.00072664954,0.00006339675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005405378,0.000009938225,0.000025398018,0.00004627793,0.000007480392,0.0000028199274,0.00057206646,0.83436936,0.000048034275,0.009733742,0.0000020721832,0.15517741],"study_design_scores_gemma":[0.00054022856,0.00025739282,0.000013960327,0.00021356213,0.0000041863577,0.00001011202,3.2320557e-7,0.9904272,0.00039138395,0.0051631546,0.002534619,0.00044390335],"about_ca_topic_score_codex":0.000008631451,"about_ca_topic_score_gemma":0.00003541436,"teacher_disagreement_score":0.15605782,"about_ca_system_score_codex":0.00038578358,"about_ca_system_score_gemma":0.00064514694,"threshold_uncertainty_score":0.99986064},"labels":[],"label_agreement":null},{"id":"W2992503655","doi":"10.1145/3374888.3374893","title":"Optimal Posted Prices for Online Resource Allocation with Supply Costs","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Valuation (finance); Competitive analysis; Payment; Business; Bundle; Resource (disambiguation); Microeconomics; Environmental economics; Resource allocation; Total cost; Computer science; Industrial organization; Operations research; Economics; Finance","score_opus":0.052646092793336006,"score_gpt":0.3368921266299996,"score_spread":0.28424603383666364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992503655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20958273,0.07596801,0.65867704,0.026128476,0.0007334669,0.024187122,0.00004949304,0.0006747976,0.003998862],"genre_scores_gemma":[0.15611392,0.0570485,0.7759574,0.007256083,0.00012473717,0.00094725366,0.0013317212,0.00006350032,0.0011568815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738234,0.00015042997,0.00048791541,0.00049068267,0.0011737435,0.00031488942],"domain_scores_gemma":[0.9965591,0.0004032134,0.00035347647,0.0010793844,0.0014991867,0.00010564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348062,0.00018869301,0.000298137,0.00036660628,0.00013963264,0.00014712308,0.0011530512,0.00006268083,0.00014761409],"category_scores_gemma":[0.0012297246,0.00014934642,0.00006265523,0.0030259704,0.000022925862,0.0010974405,0.00018124448,0.00014912782,0.00014179255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003793363,0.00020499229,0.0031457643,0.0019166805,0.000045797868,2.9444152e-7,0.00015282074,0.042787436,0.0000661296,0.0020385748,0.0045928,0.9450108],"study_design_scores_gemma":[0.0012400568,0.0007212945,0.005130769,0.0013202926,0.000055850513,0.000008246975,0.000013508438,0.93283963,0.00014398502,0.000015852527,0.05822518,0.00028534883],"about_ca_topic_score_codex":0.0000028720713,"about_ca_topic_score_gemma":0.0000018498938,"teacher_disagreement_score":0.94472545,"about_ca_system_score_codex":0.00018635126,"about_ca_system_score_gemma":0.00033189694,"threshold_uncertainty_score":0.6090171},"labels":[],"label_agreement":null},{"id":"W3000635646","doi":"10.1137/16m1107899","title":"The matroid secretary problem for minor-closed classes and random matroids","year":2020,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Matroid partitioning; Graphic matroid; Conjecture; Weighted matroid; Oriented matroid; Discrete mathematics; Law","score_opus":0.0464255519365953,"score_gpt":0.2876908832998089,"score_spread":0.2412653313632136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000635646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11345635,0.0073756534,0.64142406,0.21967499,0.0003375335,0.011675408,0.00032043114,0.00072380184,0.005011749],"genre_scores_gemma":[0.7813577,0.0032287752,0.20744042,0.00040813416,0.0003003385,0.00002916293,0.00017327735,0.00006310427,0.0069990996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721855,0.00043004198,0.00023468219,0.0007114189,0.00075304764,0.0006522412],"domain_scores_gemma":[0.9974423,0.00065408566,0.00011211844,0.00063815824,0.0008134036,0.0003399547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020219728,0.000163184,0.00028300114,0.00019791674,0.0010420181,0.0002180047,0.0017412979,0.00006841373,0.000019578716],"category_scores_gemma":[0.0004859584,0.00013985891,0.000102597856,0.00089239713,0.00074257184,0.0007213523,0.0010091558,0.00039651702,0.00003298249],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060006077,0.0010052862,0.0059432606,0.0039484827,0.0011033526,0.00024495847,0.0592301,0.002902468,0.055811618,0.08897371,0.58743423,0.18740189],"study_design_scores_gemma":[0.01233133,0.0028155202,0.0042046625,0.00013650535,0.000048498707,0.000051503663,0.005336534,0.10346514,0.00635241,0.009732861,0.85452646,0.00099857],"about_ca_topic_score_codex":0.0001789012,"about_ca_topic_score_gemma":0.000054933316,"teacher_disagreement_score":0.66790134,"about_ca_system_score_codex":0.00005931373,"about_ca_system_score_gemma":0.00037591226,"threshold_uncertainty_score":0.80144656},"labels":[],"label_agreement":null},{"id":"W3004144975","doi":"10.1007/s00453-023-01201-4","title":"Approximations for Throughput Maximization","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Las vegas; Combinatorics; Schedule; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm","score_opus":0.018538962459733195,"score_gpt":0.28992695283353953,"score_spread":0.27138799037380634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004144975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055135465,0.0001554433,0.98976564,0.0051485784,0.0004265096,0.00032036065,0.000010183921,0.00048310237,0.0036846462],"genre_scores_gemma":[0.0094900755,0.000031373183,0.9866496,0.0003691272,0.0001398776,0.00014784292,0.000041147792,0.00001481884,0.0031161772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992943,0.000019536854,0.00013124156,0.00025580561,0.00013189204,0.00016726356],"domain_scores_gemma":[0.9995359,0.000091356436,0.000015315472,0.00022315174,0.00008626888,0.000047978057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016734049,0.000067917295,0.000062988176,0.000099550016,0.00011354741,0.00036515016,0.00029861496,0.00003804748,0.000035186316],"category_scores_gemma":[0.00003173378,0.00006151625,0.000049175218,0.00043999558,0.000019081497,0.0005649868,0.000064599146,0.00005898292,0.00010504498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3492104e-7,0.000024555451,0.0000010942646,0.00004776617,0.000015938156,0.0000016997496,0.00045938478,0.0020925517,0.000056823243,0.79265565,0.011086157,0.19355775],"study_design_scores_gemma":[0.000088477405,0.00002509535,0.0000041960875,0.00001111844,0.0000023549,0.0000048930165,0.000006783788,0.8626434,0.00032373256,0.035873942,0.10094359,0.000072423136],"about_ca_topic_score_codex":0.000002646345,"about_ca_topic_score_gemma":5.4727997e-7,"teacher_disagreement_score":0.8605508,"about_ca_system_score_codex":0.000026183605,"about_ca_system_score_gemma":0.00007232126,"threshold_uncertainty_score":0.35211515},"labels":[],"label_agreement":null},{"id":"W3005850668","doi":"10.1007/s12530-020-09327-4","title":"On utilizing an enhanced object partitioning scheme to optimize self-organizing lists-on-lists","year":2020,"lang":"en","type":"article","venue":"Evolving Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Process (computing); Field (mathematics); Scrambling; Data structure; Object (grammar); Scheme (mathematics); Locality; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Programming language","score_opus":0.036181035902850156,"score_gpt":0.278014047605634,"score_spread":0.24183301170278382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005850668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033528797,0.00017041805,0.9411613,0.0026752362,0.001479837,0.0012357516,0.0000061158926,0.00255588,0.017186679],"genre_scores_gemma":[0.9160564,0.0000063164234,0.08176863,0.0016006073,0.00028684462,0.000061673396,0.000007276838,0.000042183347,0.00017004026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971355,0.00029429173,0.00046566463,0.0008580533,0.0006767942,0.0005696636],"domain_scores_gemma":[0.9981474,0.00021493698,0.0001525239,0.0006752666,0.00026552525,0.0005443243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006436165,0.00027047307,0.00033207276,0.00016663785,0.00045569288,0.0011604272,0.000940458,0.00009521223,0.00005527959],"category_scores_gemma":[0.00061200943,0.00027336786,0.0000689255,0.0010631342,0.000017146998,0.00083078485,0.00023502005,0.00033303152,0.0005465416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007629446,0.00046331302,0.00051725295,0.00053170306,0.00014907403,0.00010315777,0.046140634,0.77680266,0.03940729,0.120285526,0.013763256,0.0017598574],"study_design_scores_gemma":[0.00050014583,0.0005163593,0.000117896576,0.00042965807,0.0000040016866,0.0000066212046,0.00038375103,0.99251753,0.0041663377,0.00005105693,0.00087870884,0.00042795786],"about_ca_topic_score_codex":0.000043366632,"about_ca_topic_score_gemma":0.0000036551091,"teacher_disagreement_score":0.88252765,"about_ca_system_score_codex":0.00018330035,"about_ca_system_score_gemma":0.00014201427,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W3006243781","doi":"","title":"Algorithmes pour voyager sur un graphe contenant des blocages","year":2019,"lang":"fr","type":"dissertation","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy; Physics","score_opus":0.01995597148899109,"score_gpt":0.23585396109927192,"score_spread":0.21589798961028084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006243781","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026665745,0.006823678,0.8959699,0.017377304,0.0013093001,0.0013624682,0.00009866346,0.0005003465,0.049892545],"genre_scores_gemma":[0.28993386,0.0062413546,0.30808648,0.0006615503,0.00007630176,0.00017452176,0.0016846398,0.00019519613,0.3929461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98741174,0.007823462,0.0010942639,0.0015168061,0.0010738478,0.0010798734],"domain_scores_gemma":[0.9821938,0.0027851972,0.0008942453,0.0026122855,0.010995935,0.0005185273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0067487373,0.0007696841,0.0007789088,0.0005083217,0.0011903113,0.0017449859,0.0030436413,0.00055970874,0.00078156556],"category_scores_gemma":[0.0029526644,0.00077326427,0.00049367454,0.0015609127,0.0005777172,0.0010656492,0.0007037869,0.00092704745,0.00065744726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037266775,0.002236176,0.0051299892,0.0008724982,0.00044576693,0.000052000585,0.07135142,0.00062162225,0.00686824,0.4628809,0.004325959,0.44517815],"study_design_scores_gemma":[0.003385653,0.000006742448,0.014853509,0.0072822436,0.0001914362,0.00007352014,0.0026253248,0.8226512,0.10482431,0.009006757,0.03277423,0.0023250463],"about_ca_topic_score_codex":0.0033226474,"about_ca_topic_score_gemma":0.0028512543,"teacher_disagreement_score":0.8220296,"about_ca_system_score_codex":0.00017911254,"about_ca_system_score_gemma":0.0010769648,"threshold_uncertainty_score":0.99947184},"labels":[],"label_agreement":null},{"id":"W3013877464","doi":"10.4230/lipics.opodis.2019.24","title":"Oblivious Permutations on the Plane","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robot; Permutation (music); Class (philosophy); Computer science; Plane (geometry); Euclidean geometry; Mobile robot; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.05331678362262645,"score_gpt":0.2853190603340678,"score_spread":0.23200227671144133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013877464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033800656,0.00004223297,0.94158924,0.023084575,0.0021101835,0.0038907658,0.0015115546,0.0007790805,0.023612335],"genre_scores_gemma":[0.84288645,0.00036127894,0.1164563,0.030282227,0.0007651542,0.0018519608,0.005039892,0.000201854,0.0021548702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965709,0.000116282215,0.0011536607,0.00050285686,0.0009176233,0.00073870836],"domain_scores_gemma":[0.99664146,0.00045151464,0.0006059118,0.0015768773,0.00040542017,0.00031883226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006725731,0.0005626843,0.00052017486,0.00029882198,0.0006192455,0.0016763841,0.0033209035,0.00037275394,0.00008646809],"category_scores_gemma":[0.00029178176,0.0004155736,0.00037153822,0.000415767,0.00014064589,0.0006939788,0.0020965252,0.0015649162,0.0006770251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309245,0.0008592963,0.000448704,0.0021243203,0.00082101714,0.000032916578,0.07285906,0.053562734,0.000023359786,0.6845635,0.17075206,0.013822095],"study_design_scores_gemma":[0.0013664815,0.00034692735,0.00017880392,0.0003329795,0.00003822997,0.00002991972,0.0007502617,0.88510025,0.00014575903,0.015322641,0.0955459,0.00084183074],"about_ca_topic_score_codex":0.000015142353,"about_ca_topic_score_gemma":0.000010069025,"teacher_disagreement_score":0.8395064,"about_ca_system_score_codex":0.00015223528,"about_ca_system_score_gemma":0.0003339176,"threshold_uncertainty_score":0.9998296},"labels":[],"label_agreement":null},{"id":"W3018254556","doi":"10.1007/s00453-024-01286-5","title":"Symmetry Breaking in the Plane","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Symmetry breaking; Theory of computation; Combinatorics; Mathematics; Computer science; Symmetry (geometry); Discrete mathematics; Physics; Theoretical physics; Geometry; Algorithm; Quantum mechanics","score_opus":0.014734001092750504,"score_gpt":0.26918003697773385,"score_spread":0.2544460358849833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018254556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007063572,0.0006810294,0.9580949,0.013429545,0.0005632022,0.00019642845,0.0000028747206,0.00028796756,0.026037706],"genre_scores_gemma":[0.9254565,0.000051675284,0.071712226,0.0018633442,0.00018602671,0.000027164824,0.000007269425,0.000011218673,0.00068454095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999327,0.00006081501,0.000094649666,0.00017456978,0.00018256581,0.00016038874],"domain_scores_gemma":[0.9995879,0.00014987595,0.000007785437,0.00021958377,0.000011378805,0.000023502662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037098455,0.000051129442,0.000047175065,0.000104305196,0.000043255313,0.00031962097,0.0005640248,0.000025331736,0.000021336733],"category_scores_gemma":[0.00001354482,0.000033760258,0.00002173772,0.00061476196,0.000016161943,0.00021906428,0.000080024096,0.00015886703,0.00015233456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.424757e-7,0.00003576147,0.00003557701,0.000023098997,0.000009940826,0.00019800011,0.0023007484,0.0002186602,0.00004789745,0.436876,0.007418997,0.5528347],"study_design_scores_gemma":[0.000107369786,0.000043624645,0.00032331113,0.000046807298,0.000001602419,0.00009053559,0.00006610657,0.91178626,0.00012183795,0.010792433,0.07650883,0.00011129067],"about_ca_topic_score_codex":0.000032258773,"about_ca_topic_score_gemma":0.000004406032,"teacher_disagreement_score":0.92475015,"about_ca_system_score_codex":0.000015330184,"about_ca_system_score_gemma":0.00003480788,"threshold_uncertainty_score":0.30821124},"labels":[],"label_agreement":null},{"id":"W3021544669","doi":"10.1016/j.dam.2020.04.031","title":"Preface: CALDAM 2016","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Metric (unit); Approximation algorithm; Combinatorics; Applied mathematics","score_opus":0.027686436379464836,"score_gpt":0.2527815976058852,"score_spread":0.22509516122642037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021544669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016933389,0.000019546942,0.93073714,0.003037908,0.00003053283,0.0003074489,0.0000031363775,0.0003048858,0.06539009],"genre_scores_gemma":[0.09706451,0.00003807729,0.89970154,0.002371877,0.000071066184,0.00006463364,0.000009503927,0.0000287393,0.00065007346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998961,0.000010074443,0.00023226692,0.0002625955,0.0002939854,0.0002401263],"domain_scores_gemma":[0.9992465,0.000050734965,0.000075572294,0.00038845043,0.00003598312,0.00020279843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012498959,0.00012598227,0.00016572358,0.000027203354,0.00008027288,0.00015367354,0.0007126851,0.000047622543,0.00008900461],"category_scores_gemma":[0.000034771438,0.00010208149,0.000043089556,0.00027793171,0.000034944824,0.00016108909,0.00029634614,0.000119211465,0.0006921513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026173873,0.000048392903,0.0000025623012,0.00013288108,0.000017885235,0.000003204656,0.0054130866,0.0011578467,0.003117233,0.9762374,0.010317427,0.003549465],"study_design_scores_gemma":[0.0006842636,0.00007562986,0.000012501726,0.000030297057,0.000010903528,0.0000036476536,0.00032451432,0.926555,0.004902042,0.043898,0.02306128,0.0004419369],"about_ca_topic_score_codex":6.5926184e-7,"about_ca_topic_score_gemma":1.8642588e-7,"teacher_disagreement_score":0.9323394,"about_ca_system_score_codex":0.000011499676,"about_ca_system_score_gemma":0.000048967264,"threshold_uncertainty_score":0.88964355},"labels":[],"label_agreement":null},{"id":"W3021723940","doi":"10.1007/978-0-387-34735-6_8","title":"Distributed Algorithms for Autonomous Mobile Robots","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mobile robot; Robot; Computer science; Robotics; Artificial intelligence; Variety (cybernetics); Computability; Set (abstract data type); Focus (optics); Task (project management); Distributed computing; Distributed algorithm; Human–computer interaction; Algorithm; Engineering; Systems engineering","score_opus":0.019566349700235516,"score_gpt":0.2733669439739512,"score_spread":0.2538005942737157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021723940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006438766,0.000024582134,0.99368006,0.0006563911,0.00011423638,0.0003606174,0.000012504419,0.00031004316,0.0047772047],"genre_scores_gemma":[0.05457337,0.0000039129063,0.93418896,0.00028460295,0.00008472008,0.00024340457,0.00011610773,0.000009663157,0.010495282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.000013823321,0.00013958632,0.00021100765,0.00010830665,0.00022429838],"domain_scores_gemma":[0.99954903,0.000044829765,0.000027077904,0.00022822771,0.000097145996,0.000053695865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001230825,0.000066916255,0.000076222525,0.000039283976,0.00009669157,0.00015510265,0.0003472631,0.000032846117,0.00004738623],"category_scores_gemma":[0.000007474545,0.000057079124,0.00004259993,0.0002031921,0.000016499378,0.00023436522,0.00007629209,0.000033620432,0.00004139138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032977705,0.0002816266,0.00014587352,0.000016591437,0.000011852007,0.000004473722,0.00008278777,0.4260301,0.00029892093,0.4369757,0.07051188,0.065636896],"study_design_scores_gemma":[0.00031036165,0.00006717277,0.00016708241,0.0000014180335,8.642733e-7,0.0000023205055,0.000003951684,0.94355583,0.0008203101,0.0044963094,0.05047763,0.000096771706],"about_ca_topic_score_codex":0.00005417264,"about_ca_topic_score_gemma":0.000008935313,"teacher_disagreement_score":0.5175257,"about_ca_system_score_codex":0.0000281325,"about_ca_system_score_gemma":0.000044648983,"threshold_uncertainty_score":0.2327619},"labels":[],"label_agreement":null},{"id":"W3022187609","doi":"10.1016/j.ipl.2020.105973","title":"Randomized distributed online algorithms against adaptive offline adversaries","year":2020,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Danmarks Frie Forskningsfond","keywords":"Adversary; Competitive analysis; Adversary model; Online algorithm; Computer science; Randomized algorithm; Randomization; Algorithm; Deterministic algorithm; Theoretical computer science; Mathematics; Upper and lower bounds; Computer security; Randomized controlled trial","score_opus":0.025858568714240946,"score_gpt":0.24563019098400907,"score_spread":0.21977162226976812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022187609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003970662,0.000030288222,0.9518834,0.0463572,0.00008514004,0.00032523775,0.000034637,0.00041029148,0.0004767548],"genre_scores_gemma":[0.43114904,0.000050299426,0.4564325,0.110832304,0.00017517306,0.00006768191,0.0012527115,0.000017850603,0.000022445041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856526,0.000085362735,0.0005340077,0.00016500003,0.0004077667,0.00024260319],"domain_scores_gemma":[0.9990701,0.00007206795,0.0002922708,0.00014475065,0.00026987962,0.0001509129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306252,0.00015516517,0.0002651012,0.00010922191,0.00023341605,0.000510786,0.00048488105,0.00004789977,0.000009968434],"category_scores_gemma":[0.00029480344,0.00013318488,0.00007576862,0.0006527328,0.00012536235,0.0046057203,0.00013499866,0.00019439189,0.00006152908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004528714,0.00013472638,0.00003722695,0.00038737847,0.0001590789,0.000018357861,0.041455183,0.4396316,0.0003214479,0.009440554,0.01755837,0.48632735],"study_design_scores_gemma":[0.021661254,0.000019297267,0.000010531183,0.00003071228,0.0000055611604,0.0000016928775,0.00017843297,0.967372,0.0001457349,0.00005710718,0.0103486795,0.00016896975],"about_ca_topic_score_codex":0.00000467265,"about_ca_topic_score_gemma":3.5525184e-7,"teacher_disagreement_score":0.5277404,"about_ca_system_score_codex":0.000042004784,"about_ca_system_score_gemma":0.00009982649,"threshold_uncertainty_score":0.54311216},"labels":[],"label_agreement":null},{"id":"W3022352819","doi":"10.1007/s00453-023-01122-2","title":"Almost Universal Anonymous Rendezvous in the Plane","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Rendezvous; Theory of computation; Set (abstract data type); Computer science; Algorithm; Plane (geometry); Mathematics; Combinatorics; Geometry; Physics","score_opus":0.02015590187175076,"score_gpt":0.25314379735999765,"score_spread":0.2329878954882469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022352819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019593585,0.00023403265,0.75424725,0.08975726,0.002095204,0.0018631025,0.000055307177,0.0028081029,0.12934618],"genre_scores_gemma":[0.91797274,0.0002552813,0.0666988,0.0043758317,0.0003038149,0.00006324564,0.00012602442,0.000039088314,0.010165204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990821,0.00010089246,0.00010549134,0.00020210525,0.0002491743,0.00026022742],"domain_scores_gemma":[0.99944127,0.00013109224,0.000022190525,0.0003381619,0.00002506847,0.000042219745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003592394,0.00006704233,0.0000685903,0.00013535649,0.00008966355,0.00009823595,0.00084622874,0.0000358562,0.000024847317],"category_scores_gemma":[0.000023497543,0.000050157887,0.000022181273,0.0011239045,0.000031857653,0.00018210325,0.00015038521,0.00013982499,0.00037022642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023380919,0.00038707198,0.0007614302,0.000034717472,0.000055642442,0.0028833996,0.026619768,0.015497678,0.0005036758,0.2455307,0.21582906,0.49187347],"study_design_scores_gemma":[0.00079962757,0.00015302825,0.0031903302,0.000013796127,0.0000025765366,0.00008083646,0.0006662471,0.9003433,0.00017296872,0.0047408463,0.08957673,0.00025969048],"about_ca_topic_score_codex":0.00006720139,"about_ca_topic_score_gemma":0.000019772324,"teacher_disagreement_score":0.89837915,"about_ca_system_score_codex":0.000020738089,"about_ca_system_score_gemma":0.00005144715,"threshold_uncertainty_score":0.4758635},"labels":[],"label_agreement":null},{"id":"W3023308714","doi":"10.1007/s00453-020-00724-4","title":"Deterministic Treasure Hunt in the Plane with Angular Hints","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Treasure; Combinatorics; Vertex (graph theory); Plane (geometry); Position (finance); Mathematics; Euclidean geometry; Algorithm; Computer science; Topology (electrical circuits); Geometry; Finance","score_opus":0.02181661713673369,"score_gpt":0.22067070731841365,"score_spread":0.19885409018167996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023308714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064302576,0.000096169766,0.9569335,0.02987957,0.00009250683,0.0006040405,0.000010089081,0.00020699535,0.0057468656],"genre_scores_gemma":[0.94059813,0.000007663994,0.05469589,0.004522305,0.00006987742,0.000023223798,0.000007903176,0.000008804637,0.000066180626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991248,0.000094395866,0.00010988724,0.00022362698,0.00026456933,0.00018272258],"domain_scores_gemma":[0.99954677,0.0000654444,0.000028176883,0.00025158256,0.000029078195,0.00007892851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000153017,0.00008148449,0.00009259746,0.000032055555,0.000057497728,0.00011567668,0.00066997495,0.000026749607,0.000020203286],"category_scores_gemma":[0.000032258453,0.00005010825,0.000017561466,0.00037868146,0.00003330786,0.00013140097,0.00006192296,0.0001387815,0.00005927637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016607184,0.0009554582,0.005345033,0.00018604337,0.00015277344,0.004010973,0.07244902,0.013679203,0.00084025186,0.058329053,0.017261826,0.8266243],"study_design_scores_gemma":[0.0011728983,0.000657088,0.004235429,0.000029201321,0.000007826296,0.000093501185,0.00022037362,0.9741439,0.0002846126,0.00078526244,0.018067932,0.0003019435],"about_ca_topic_score_codex":0.000017824708,"about_ca_topic_score_gemma":0.000009938498,"teacher_disagreement_score":0.9604647,"about_ca_system_score_codex":0.0000103050415,"about_ca_system_score_gemma":0.000050390685,"threshold_uncertainty_score":0.20433553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013010429633134717,"score_gpt":0.25849732909190537,"score_spread":0.24548689945877064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023452807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011610231,0.000009330842,0.9751519,0.002097497,0.00095803925,0.00025440712,7.551283e-7,0.00041933014,0.009498495],"genre_scores_gemma":[0.7042872,0.0000049151195,0.2951487,0.00039741493,0.000099221805,0.000012468646,0.0000016363908,0.000009929271,0.0000385415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720615,0.00010288813,0.00029793006,0.00081831217,0.00090196804,0.0006727635],"domain_scores_gemma":[0.99810356,0.0001146892,0.00008154605,0.0009957108,0.0002724638,0.00043200795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016291906,0.00020686534,0.00020086953,0.00019502628,0.0005625551,0.0010370149,0.002485157,0.00007775513,0.000094192015],"category_scores_gemma":[0.00012797875,0.00017761588,0.000050202972,0.0011457064,0.0017230518,0.0020612369,0.00090789975,0.00041000472,0.00014994782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041655567,0.00008164173,0.000045541172,0.00000518556,0.0000027753185,0.0000052340088,0.00069100683,0.0026941705,0.013754273,0.8957092,0.00029737956,0.08670943],"study_design_scores_gemma":[0.00028423444,0.00016011205,0.0000995937,0.000012972673,0.0000021847152,0.000031456024,0.000005899404,0.9532411,0.01162307,0.034054942,0.00021424863,0.00027016024],"about_ca_topic_score_codex":0.0000061239357,"about_ca_topic_score_gemma":0.000007748739,"teacher_disagreement_score":0.950547,"about_ca_system_score_codex":0.000047162688,"about_ca_system_score_gemma":0.00017752897,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W3026866611","doi":"10.1007/s00453-021-00920-w","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Parameterized complexity; Adversary; Bipartite graph; Competitive analysis; Bounded function; Discrete mathematics; Treewidth; Upper and lower bounds; Graph; Computer science; Line graph; Pathwidth","score_opus":0.0654509948533736,"score_gpt":0.2981127694963594,"score_spread":0.2326617746429858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026866611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029023448,0.001078805,0.9610444,0.0059742527,0.0007469223,0.0013935163,0.00021156811,0.00024800576,0.00027911764],"genre_scores_gemma":[0.0333003,0.0001456058,0.9639758,0.0006598842,0.000102291386,0.000042263666,0.00012944837,0.00002085339,0.0016235812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991963,0.000033196433,0.00018488835,0.0002284112,0.00018382109,0.00017342062],"domain_scores_gemma":[0.99948394,0.00007247081,0.00007256281,0.00019588634,0.000085954685,0.00008918936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016418875,0.000073609175,0.00013128831,0.0001145166,0.00012128785,0.000020744987,0.00036357276,0.000019947498,0.000026541022],"category_scores_gemma":[0.00002863124,0.00007490521,0.000034846747,0.00047718541,0.000027226071,0.00014411182,0.00036045822,0.0001071794,6.23359e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016644053,0.002712716,0.0013061126,0.00038901967,0.000271998,0.00002332713,0.0059194323,0.0849569,0.0036985537,0.055640467,0.023107907,0.82180715],"study_design_scores_gemma":[0.0014258532,0.0010216028,0.0005718255,0.00001848974,0.00001079365,0.000018978213,0.00013216131,0.92573947,0.00021273278,0.0078685,0.06277857,0.0002010339],"about_ca_topic_score_codex":0.000066446766,"about_ca_topic_score_gemma":0.000012536157,"teacher_disagreement_score":0.8407826,"about_ca_system_score_codex":0.000018969458,"about_ca_system_score_gemma":0.0001385608,"threshold_uncertainty_score":0.30545458},"labels":[],"label_agreement":null},{"id":"W3031249145","doi":"","title":"Combinatorial batch codes.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Server; Computer science; Code (set theory); Probabilistic logic; Theoretical computer science; Discrete mathematics; Operating system; Mathematics; Programming language; Artificial intelligence; Set (abstract data type)","score_opus":0.022903451522838063,"score_gpt":0.2719641128123258,"score_spread":0.24906066128948773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031249145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002232349,0.00008559817,0.9539565,0.002820324,0.0043161986,0.00073066755,0.0000344955,0.0005300229,0.03529386],"genre_scores_gemma":[0.04629815,0.0013602853,0.9507482,0.0007129359,0.0003923178,0.0002630579,0.00015541655,0.00005228699,0.000017354785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588794,0.00086943246,0.0006383523,0.0013237911,0.00051053247,0.000769973],"domain_scores_gemma":[0.9967744,0.0005816852,0.00032876738,0.0017430044,0.00023828237,0.00033388377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057587493,0.00048067133,0.00074236246,0.00037004592,0.0002799266,0.00017984303,0.002956933,0.00049242727,0.000112078706],"category_scores_gemma":[0.00025885765,0.0004941724,0.00029313407,0.00023156266,0.00051785016,0.00015882756,0.0062875156,0.0018571661,0.00061026704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030058496,0.00016462599,0.0005013666,0.00004403541,0.00009544906,0.00014377038,0.0025486322,0.0066169584,0.000051103125,0.9826229,0.0048628165,0.002318273],"study_design_scores_gemma":[0.0007457938,0.00008801479,0.0010386081,0.00004906814,0.000009920587,0.000094229894,0.000016367596,0.07844778,0.00021565972,0.90818554,0.010591942,0.0005170995],"about_ca_topic_score_codex":0.000079745834,"about_ca_topic_score_gemma":0.00001733329,"teacher_disagreement_score":0.074437395,"about_ca_system_score_codex":0.000105208615,"about_ca_system_score_gemma":0.0007604607,"threshold_uncertainty_score":0.999751},"labels":[],"label_agreement":null},{"id":"W3031729887","doi":"10.1007/978-3-030-49161-1_20","title":"Optimizing Self-organizing Lists-on-Lists Using Transitivity and Pursuit-Enhanced Object Partitioning","year":2020,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Theoretical computer science; Context (archaeology); Probabilistic logic; Filter (signal processing); Object (grammar); Transitive relation; Artificial intelligence; Mathematics; Computer vision; Combinatorics","score_opus":0.015370842572621935,"score_gpt":0.259489397901025,"score_spread":0.24411855532840304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031729887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035919357,0.008215321,0.8207826,0.005791824,0.00019072529,0.0011338742,0.000018449127,0.0014160841,0.1620919],"genre_scores_gemma":[0.5228092,0.059742346,0.41425765,0.0022646093,0.000032925567,0.0001212293,0.00015303411,0.00005755576,0.0005614431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985662,0.00006225014,0.00061341614,0.00029648453,0.00024294437,0.0002187111],"domain_scores_gemma":[0.9985157,0.00013969332,0.00043499013,0.0006553727,0.00017855293,0.00007564026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035442007,0.0002609703,0.00034097582,0.0006464384,0.000358089,0.00029734237,0.0007284845,0.00033416564,0.000011305981],"category_scores_gemma":[0.00009218292,0.0002939778,0.000033063654,0.00032965472,0.00022023698,0.002647424,0.00047925918,0.0007485361,0.000015205823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011750366,0.000017652457,0.000013640662,0.00012718972,0.000017379158,0.0000016391914,0.0031404581,0.0036311042,0.000047046047,0.839771,0.000010044934,0.15321112],"study_design_scores_gemma":[0.003179501,0.00052872306,0.000048736747,0.0022594251,0.000049856517,0.00014052664,0.0014739945,0.54637814,0.0031291563,0.24022585,0.20050251,0.00208356],"about_ca_topic_score_codex":0.0000041496796,"about_ca_topic_score_gemma":0.000021872505,"teacher_disagreement_score":0.5995451,"about_ca_system_score_codex":0.00012257845,"about_ca_system_score_gemma":0.0000873227,"threshold_uncertainty_score":0.99995124},"labels":[],"label_agreement":null},{"id":"W3033345754","doi":"","title":"Synchronization by Asynchronous Mobile Robots with Limited Visibility","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Mobile robot; Synchronizing; Visibility; Computer science; Real-time computing; Synchronization (alternating current); Schedule; Computation; Distributed computing; Algorithm; Artificial intelligence; Computer network; Channel (broadcasting)","score_opus":0.03706273716227314,"score_gpt":0.17172622267036483,"score_spread":0.1346634855080917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033345754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03983816,0.000025401743,0.9579034,0.0003358222,0.000029301846,0.00029236716,0.0000040806362,0.00031497565,0.0012565203],"genre_scores_gemma":[0.99424195,0.000041666703,0.0049546002,0.00047074817,0.0000156024,0.000001044788,0.000017244109,0.000010336318,0.00024682496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882317,0.00010177857,0.00011091982,0.00061928097,0.00009549593,0.0002493495],"domain_scores_gemma":[0.99906224,0.000044233948,0.000073866104,0.00040931735,0.00016014466,0.00025022338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009392673,0.00013501519,0.00013476227,0.000055588287,0.000151398,0.00010026213,0.0006285106,0.000060764858,0.000093325594],"category_scores_gemma":[0.000024383504,0.00013494505,0.0000380588,0.0012578664,0.00007503081,0.00077947805,0.00018695883,0.00013344572,0.000113844486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034970977,0.00013264673,0.0046738987,0.000024829824,0.000027624015,0.000051978648,0.00043025136,0.9742257,0.00016733259,0.017267982,0.0009889285,0.001973881],"study_design_scores_gemma":[0.000639051,0.00036517013,0.00025238388,0.00000774321,0.000008142618,0.0000018090662,0.000048575315,0.9972529,0.00025662975,0.00025433092,0.0007229783,0.00019031895],"about_ca_topic_score_codex":0.00002106961,"about_ca_topic_score_gemma":0.000007353627,"teacher_disagreement_score":0.95440376,"about_ca_system_score_codex":0.000098788274,"about_ca_system_score_gemma":0.00010542086,"threshold_uncertainty_score":0.5502899},"labels":[],"label_agreement":null},{"id":"W3035592717","doi":"10.24963/ijcai.2020/562","title":"Multi-Directional Heuristic Search","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Heuristics; Mathematical optimization; Heuristic; Computer science; Task (project management); Path (computing); Bidirectional search; Consistent heuristic; Algorithm; Search algorithm; Best-first search; Incremental heuristic search; Beam search; Mathematics; Engineering","score_opus":0.08922955930922948,"score_gpt":0.298222700249762,"score_spread":0.2089931409405325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035592717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007733818,0.000011737211,0.97843975,0.0096107675,0.000059986953,0.000066027394,5.2060113e-7,0.0002643693,0.0114695085],"genre_scores_gemma":[0.18196055,0.00001131781,0.8093569,0.0043085213,0.00005770214,0.000005711626,0.0000022176446,0.000005147568,0.004291916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.000038708095,0.00007594387,0.00018309656,0.0001903421,0.00012820971],"domain_scores_gemma":[0.9996351,0.000032413645,0.0000073550486,0.00010463704,0.000069933645,0.00015054441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009000612,0.000041031693,0.000045052107,0.000026897618,0.00006774881,0.00009778295,0.00031534306,0.000015922165,0.0003783482],"category_scores_gemma":[0.000046749436,0.000035454956,0.000020893474,0.00029515117,0.000016094513,0.00017242893,0.00013997094,0.000079548125,0.0006365573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032121214,0.0007123864,0.0072572283,0.00013402935,0.00009596747,0.00010681436,0.008887747,0.14651394,0.014993926,0.5724072,0.14740302,0.10145561],"study_design_scores_gemma":[0.0001739959,0.000030143154,0.0005470673,9.3039387e-7,2.5065566e-7,0.0000021049186,0.000008731498,0.99023443,0.00043586857,0.00006308028,0.008451149,0.000052271214],"about_ca_topic_score_codex":0.000011191447,"about_ca_topic_score_gemma":0.0000014629918,"teacher_disagreement_score":0.84372044,"about_ca_system_score_codex":0.000008307187,"about_ca_system_score_gemma":0.000049894017,"threshold_uncertainty_score":0.8181868},"labels":[],"label_agreement":null},{"id":"W3037022759","doi":"10.1609/socs.v11i1.18525","title":"Moving Agents in Formation in Congested Environments","year":2020,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Swarm behaviour; Computer science; Focus (optics); Path (computing); Phase (matter); Swarm robotics; Field (mathematics); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Physics","score_opus":0.03289317222300333,"score_gpt":0.26769560564883993,"score_spread":0.2348024334258366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037022759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425089,0.0000066483417,0.0008446715,0.03810106,0.0013949156,0.0008362457,0.0000040230548,0.00004518207,0.016258363],"genre_scores_gemma":[0.9991414,0.000023624098,0.00027907023,0.00041585823,0.000052559542,0.000018919507,0.0000017076603,0.000006862543,0.000059992497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835324,0.000024298084,0.00032296384,0.00024136479,0.0008706212,0.00018748252],"domain_scores_gemma":[0.9996023,0.000051143597,0.000106833824,0.00007607414,0.00009659418,0.0000670197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039885496,0.000091551105,0.00011478732,0.00011751058,0.000041694468,0.0001255676,0.0014769554,0.000052340103,0.000015440897],"category_scores_gemma":[0.0001417564,0.000079378326,0.00004075604,0.000463493,0.000031343905,0.0006879124,0.0005655447,0.00025411198,0.000017249407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000417121,0.0010842837,0.06856143,0.00014166535,0.000047209334,0.000008300257,0.010272409,0.018516576,0.182026,0.71494794,0.0014127797,0.0025642747],"study_design_scores_gemma":[0.004941166,0.00037561773,0.019044701,0.0002510824,0.0000025980578,0.000004275775,0.00019187137,0.78723603,0.17711015,0.0074895117,0.0030469417,0.00030604625],"about_ca_topic_score_codex":0.00004072714,"about_ca_topic_score_gemma":0.0000017777522,"teacher_disagreement_score":0.7687195,"about_ca_system_score_codex":0.00022678262,"about_ca_system_score_gemma":0.000022021179,"threshold_uncertainty_score":0.32369542},"labels":[],"label_agreement":null},{"id":"W3042234904","doi":"10.22215/etd/2016-11649","title":"Coordinated Multi-Agents Patrolling Algorithms","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Patrolling; Robot; Mobile robot; Visibility; Computer science; Algorithm; Domain (mathematical analysis); Visibility graph; Artificial intelligence; Mathematics; Geography; Geometry","score_opus":0.03568156763571621,"score_gpt":0.31694906139694323,"score_spread":0.281267493761227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042234904","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000072074305,0.000103994586,0.9702278,0.00020844906,0.0012109572,0.0003295819,0.0000056206313,0.00039540583,0.027446112],"genre_scores_gemma":[0.015236488,0.0005622351,0.39220756,0.00047284274,0.00014608215,0.00011304913,0.00056174153,0.00007633869,0.5906237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985116,0.00006471521,0.00029633613,0.0004905688,0.0003072845,0.0003294583],"domain_scores_gemma":[0.9989431,0.000040521256,0.00013836475,0.0004179369,0.00032060637,0.0001394934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020774937,0.0002160419,0.0002157629,0.00021461275,0.00015840789,0.00023089444,0.0008909076,0.00021231928,0.0004195053],"category_scores_gemma":[0.000040027593,0.00015865167,0.00009518342,0.0002921971,0.000010498952,0.0003553864,0.00007224362,0.00017905419,0.0005835884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035778274,0.000501415,0.00021329921,0.00026251635,0.00029862445,0.00007925644,0.0030571104,0.0010333976,0.0018196414,0.01970358,0.014303266,0.95869213],"study_design_scores_gemma":[0.0019079231,0.00008197111,0.00048659826,0.0002229868,0.000012703603,0.0000028613365,0.00008887454,0.98253256,0.0024772722,0.0007284641,0.010691674,0.0007661291],"about_ca_topic_score_codex":0.000033662327,"about_ca_topic_score_gemma":0.000021927368,"teacher_disagreement_score":0.98149914,"about_ca_system_score_codex":0.000038758622,"about_ca_system_score_gemma":0.0001301801,"threshold_uncertainty_score":0.7501043},"labels":[],"label_agreement":null},{"id":"W3046340469","doi":"10.4230/lipics.disc.2025.49","title":"A Characterization of Semi-Synchrony for Asynchronous Robots with Limited Visibility, and its Application to Luminous Synchronizer Design","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Asynchronous communication; Robot; Visibility; Computer science; Synchronizing; Mobile robot; Synchronizer; Real-time computing; Synchronization (alternating current); Schedule; Computation; Distributed computing; Algorithm; Artificial intelligence; Channel (broadcasting); Computer network","score_opus":0.07280824242103562,"score_gpt":0.20746736120348225,"score_spread":0.13465911878244663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046340469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070838146,0.000019722467,0.92570704,0.0003854099,0.000058823956,0.002720373,0.00003309783,0.00017116425,0.00006619443],"genre_scores_gemma":[0.97135174,0.000094923795,0.028117843,0.00015038671,0.000035625275,0.000030970263,0.00009143848,0.000027890506,0.00009916725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979047,0.00014966477,0.0002778442,0.0012318803,0.00013302911,0.00030288886],"domain_scores_gemma":[0.9980277,0.00011953408,0.00032635836,0.00071585743,0.00053618255,0.0002744055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027581723,0.00029709088,0.0004055478,0.0002551803,0.00012779818,0.00010708412,0.0008815715,0.00021356362,0.0000074629706],"category_scores_gemma":[0.000056732904,0.00032324402,0.000073864416,0.0007631162,0.0000627466,0.00038262914,0.00089450716,0.00022204802,0.000012525455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026737672,0.00022822627,0.0006688313,0.0007461988,0.00013925436,0.000019805313,0.0010799126,0.9509259,0.016622493,0.026275575,0.000028524233,0.0029979253],"study_design_scores_gemma":[0.0006929652,0.00047061016,0.0011532665,0.00011252263,0.000053549385,0.0000032182895,0.000012381488,0.99191284,0.00369065,0.0014941599,0.00004617559,0.0003576714],"about_ca_topic_score_codex":0.000019988373,"about_ca_topic_score_gemma":0.0000112129055,"teacher_disagreement_score":0.9005136,"about_ca_system_score_codex":0.00019675588,"about_ca_system_score_gemma":0.0003738552,"threshold_uncertainty_score":0.999922},"labels":[],"label_agreement":null},{"id":"W306704402","doi":"10.1007/978-3-642-25835-0_4","title":"Search and Rescue Operations","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"International Civil Aviation Organization","funders":"","keywords":"Search and rescue; Computer science; Artificial intelligence","score_opus":0.05730721572742271,"score_gpt":0.28444444085348686,"score_spread":0.22713722512606416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W306704402","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014868313,0.00035494895,0.32964176,0.0011545261,0.00006742687,0.00016630662,0.0000033001375,0.00009272615,0.66851753],"genre_scores_gemma":[0.00048875087,0.00075187,0.07889524,0.00040230426,0.000070213995,0.000004403071,0.000012695787,0.000013090536,0.9193614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.00001555482,0.00012512783,0.00023363288,0.00021941174,0.00016835367],"domain_scores_gemma":[0.9993583,0.000016811102,0.000004034908,0.00036022955,0.000108143795,0.00015249099],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021014277,0.00010911437,0.00010634,0.0001146347,0.00012078207,0.00022964556,0.00031399878,0.00011393431,0.00097200123],"category_scores_gemma":[0.00000515714,0.000091671056,0.000025967649,0.000024028175,0.00004892839,0.0003112196,0.00034966366,0.0002026042,0.00049204857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1209145e-7,0.0000036540853,0.0000011871196,0.000006108848,0.0000067385595,9.844224e-7,0.00012965653,0.00082030846,0.00000829682,0.9861201,0.00067738077,0.012225391],"study_design_scores_gemma":[0.00029936334,0.000090462796,0.000027629567,0.00005896563,0.000008793611,0.000035352856,0.000007668428,0.50134647,0.00006788924,0.0065662665,0.49091554,0.0005755648],"about_ca_topic_score_codex":0.00004303024,"about_ca_topic_score_gemma":0.00008356797,"teacher_disagreement_score":0.9795538,"about_ca_system_score_codex":0.000016081918,"about_ca_system_score_gemma":0.00007589894,"threshold_uncertainty_score":0.99994123},"labels":[],"label_agreement":null},{"id":"W3080419432","doi":"10.3233/faia200470","title":"Entropy-based adaptive exploit-explore coefficient for Monte-Carlo path planning","year":2020,"lang":"en","type":"preprint","venue":"Open Archive Toulouse Archive Ouverte (University of Toulouse)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Motion planning; Mathematical optimization; Monte Carlo method; Convergence (economics); Context (archaeology); Entropy (arrow of time); Artificial intelligence; Mathematics; Robot","score_opus":0.08950398227348327,"score_gpt":0.27367719963964565,"score_spread":0.18417321736616238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080419432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001860023,0.00006416362,0.984467,0.0029185177,0.00044446258,0.0044673188,0.0018124958,0.0003926775,0.0035733243],"genre_scores_gemma":[0.17243233,0.00019057051,0.8244343,0.000994767,0.00011917048,0.00007378827,0.00070990913,0.00015399717,0.0008911662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942601,0.00075349,0.000649815,0.0022575837,0.0010071619,0.0010718984],"domain_scores_gemma":[0.99506617,0.00079233886,0.0010027278,0.0018909527,0.00042241055,0.00082543097],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.000580819,0.0008586228,0.0014353803,0.0006858906,0.00093785266,0.00049767556,0.00874033,0.0002603623,0.00009508962],"category_scores_gemma":[0.00015782985,0.0010202965,0.00082315394,0.0004903225,0.0005151856,0.00079839217,0.011619,0.001311912,0.00006617914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029601147,0.0014051727,0.00040126842,0.00091196236,0.0010767365,0.00059404655,0.07914452,0.7384413,0.0008457898,0.044732936,0.11863655,0.010849604],"study_design_scores_gemma":[0.0036199838,0.0011805193,0.00039844093,0.0007477281,0.00011730137,0.000004176449,0.003276334,0.9621351,0.00008727278,0.012701701,0.014635186,0.0010963087],"about_ca_topic_score_codex":0.0013375059,"about_ca_topic_score_gemma":0.00030359247,"teacher_disagreement_score":0.22369376,"about_ca_system_score_codex":0.0002500165,"about_ca_system_score_gemma":0.0014711926,"threshold_uncertainty_score":0.9992247},"labels":[],"label_agreement":null},{"id":"W3081729211","doi":"10.22215/etd/2015-11117","title":"Searching with Two-Speed Autonomous Mobile Robots","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Patrolling; Robot; Mobile robot; Schedule; Interval (graph theory); Computer science; Domain (mathematical analysis); Rendezvous; Real-time computing; Simulation; Artificial intelligence; Engineering; Mathematics; Geography","score_opus":0.022674069218936405,"score_gpt":0.3183425371563703,"score_spread":0.2956684679374339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081729211","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045704865,0.0002696626,0.3079145,0.0002856489,0.000806154,0.0015570053,0.0000034228922,0.0011722819,0.68342084],"genre_scores_gemma":[0.083271116,0.000077542376,0.45590952,0.0005527116,0.00024955795,0.00023911468,0.001231188,0.00015320131,0.45831606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811405,0.000088107896,0.00023180457,0.0005250922,0.000666568,0.00037436132],"domain_scores_gemma":[0.99858314,0.00004102261,0.00011559469,0.0005633772,0.0004446353,0.0002522255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003946264,0.00023410928,0.0002499704,0.0002420364,0.00013604797,0.00051696727,0.00095093856,0.00011005076,0.00014452846],"category_scores_gemma":[0.000017650982,0.00018056642,0.000048734397,0.00043331998,0.00002033746,0.0004963011,0.000096655436,0.00037443588,0.00024748108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008063104,0.00028882406,0.000049530143,0.00020506156,0.0001432072,0.00009131197,0.013115562,0.6629664,0.00036833127,0.109744705,0.008794009,0.20415244],"study_design_scores_gemma":[0.0013754533,0.00058042665,0.00009529166,0.00015386236,0.000014956854,0.000024443389,0.00082387374,0.98075604,0.00067173725,0.0036876823,0.010941971,0.00087425817],"about_ca_topic_score_codex":0.00023459586,"about_ca_topic_score_gemma":0.00039220514,"teacher_disagreement_score":0.31778964,"about_ca_system_score_codex":0.00009113681,"about_ca_system_score_gemma":0.0008229984,"threshold_uncertainty_score":0.7363285},"labels":[],"label_agreement":null},{"id":"W3082880435","doi":"10.1007/978-3-030-62401-9_10","title":"Fast Byzantine Gathering with Visibility in Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; Computer science; Node (physics); Task (project management); Graph; Time complexity; Visibility; Identifier; Mobile robot; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Mathematics; Computer network; Engineering; Geography","score_opus":0.02180060328076514,"score_gpt":0.2709419330904639,"score_spread":0.24914132980969875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082880435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016403913,0.00007455493,0.97856975,0.003549404,0.00053841673,0.00057951675,0.0000021989265,0.00020968428,0.00007256468],"genre_scores_gemma":[0.56017333,0.0000127137355,0.4391263,0.00061998016,0.0000398635,0.000015932745,0.000002013303,0.000009505601,3.6944604e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957882,0.00015767165,0.0004801456,0.0019579728,0.00089786446,0.00071813114],"domain_scores_gemma":[0.9978424,0.00020443174,0.00017443267,0.0013660926,0.00019614937,0.00021650187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001235176,0.00038604464,0.0004658431,0.00065763324,0.00012993149,0.00089154753,0.003831605,0.00016525714,0.0000074754175],"category_scores_gemma":[0.00015158636,0.000320775,0.00007036759,0.0037858027,0.0004391714,0.0005662338,0.0040173605,0.0012998384,0.000008251642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008544428,0.00007920425,0.0074940003,0.00008289283,0.0000039180363,0.000062873776,0.0026023444,0.8667654,0.00022323655,0.0009200227,0.0000016148701,0.12175597],"study_design_scores_gemma":[0.0003438548,0.0001145853,0.006603451,0.00027106865,0.0000011439678,0.00001162637,6.8796663e-7,0.96853834,0.0011805726,0.022538483,0.000012911448,0.00038325493],"about_ca_topic_score_codex":0.00013220852,"about_ca_topic_score_gemma":0.0002480272,"teacher_disagreement_score":0.5437694,"about_ca_system_score_codex":0.00011809588,"about_ca_system_score_gemma":0.00070974434,"threshold_uncertainty_score":0.9999244},"labels":[],"label_agreement":null},{"id":"W3090961338","doi":"10.20382/jocg.v11i1a16","title":"Faster algorithms for some optimization problems on collinear points","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Mathematics; Algorithm; Point (geometry); Running time; Combinatorics; Set (abstract data type); Range (aeronautics); Server; Computer science; Geometry","score_opus":0.33922023217704805,"score_gpt":0.5231738900159135,"score_spread":0.18395365783886547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090961338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016935105,0.0010091325,0.987937,0.005577142,0.0005166289,0.001773488,0.000050883507,0.00013251002,0.0013097059],"genre_scores_gemma":[0.2341281,0.016347518,0.7092555,0.033722125,0.00193666,0.0010042421,0.00022372144,0.00042208537,0.0029600137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700105,0.00023263975,0.0008272397,0.0006647762,0.0008190593,0.00045521714],"domain_scores_gemma":[0.99764234,0.00026342674,0.0006150503,0.00047661492,0.0005459149,0.0004566252],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010346223,0.00029835672,0.0005599835,0.00047872783,0.000304369,0.0026430942,0.003980346,0.00009528524,0.001523196],"category_scores_gemma":[0.00033706936,0.000269123,0.00017352987,0.001257803,0.000069161775,0.0046135723,0.0010115458,0.0003038557,0.000038543432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018894747,0.00047630147,0.0029399532,0.00022231348,0.00017233347,0.00001874968,0.0008849457,0.90884435,0.0041275546,0.0031139965,0.055848476,0.023162052],"study_design_scores_gemma":[0.0014005135,0.00010095332,0.0011062495,0.00021474982,0.000018697152,0.000004675802,0.000021233813,0.972609,0.0064825662,0.0043282215,0.013249608,0.00046357163],"about_ca_topic_score_codex":0.000026534342,"about_ca_topic_score_gemma":0.0000014249407,"teacher_disagreement_score":0.2786815,"about_ca_system_score_codex":0.00006794897,"about_ca_system_score_gemma":0.00018380908,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W3091080409","doi":"10.1109/ijcnn48605.2020.9207659","title":"A Novel way of Training a Neural Network with Reinforcement learning and without Back Propagation","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Reinforcement learning; Computer science; Artificial neural network; Worry; Gradient descent; Backpropagation; Artificial intelligence; Learning automata; Core (optical fiber); Action (physics); Automaton","score_opus":0.04778871109854664,"score_gpt":0.2548645749179814,"score_spread":0.20707586381943477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091080409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025424156,0.000007010401,0.9903879,0.0014366457,0.000010202744,0.00018921557,4.383885e-8,0.000055193927,0.0053713266],"genre_scores_gemma":[0.79956216,0.000003654957,0.19965492,0.0003840824,0.000017992988,0.000004119208,0.0000013269367,0.0000039330694,0.00036778837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999381,0.000023328044,0.0001337117,0.00015905715,0.00016483312,0.0001380577],"domain_scores_gemma":[0.99971426,0.000016965203,0.000066275396,0.00006067295,0.000059246086,0.000082560946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013347818,0.00006065119,0.000094077855,0.00001805464,0.000056661185,0.000065699205,0.00010727285,0.000014870374,0.000033481883],"category_scores_gemma":[0.000016939202,0.000044018536,0.000010112394,0.00025168346,0.000027512602,0.0002559646,0.00007968925,0.00008230754,0.0000031017878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023011778,0.0000070348683,0.0019372994,0.000032411175,0.000011217742,4.8854906e-7,0.005442907,0.96918327,0.0010067418,0.011371113,0.000050494324,0.010933998],"study_design_scores_gemma":[0.0004904735,0.0003621953,0.00017258005,0.00002033477,0.000001588782,0.0000041005615,0.00010808596,0.99823827,0.00014000271,0.000010538525,0.00038814617,0.000063706815],"about_ca_topic_score_codex":0.000006029331,"about_ca_topic_score_gemma":0.0000027059652,"teacher_disagreement_score":0.7970198,"about_ca_system_score_codex":0.0000042290144,"about_ca_system_score_gemma":0.00003196685,"threshold_uncertainty_score":0.17950238},"labels":[],"label_agreement":null},{"id":"W3094630273","doi":"10.1145/3340531.3412730","title":"Multi-Channel Sellers Traffic Allocation in Large-scale E-commerce Promotion","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristics; Channel (broadcasting); Promotion (chess); Entertainment; Rendering (computer graphics); Telecommunications; Artificial intelligence","score_opus":0.04964900520495525,"score_gpt":0.27411455121353867,"score_spread":0.22446554600858343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094630273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005833414,0.000010019089,0.9727709,0.02014517,0.000057906527,0.0002979448,6.6641536e-7,0.00023292251,0.0006510546],"genre_scores_gemma":[0.90527207,0.000021201296,0.09227002,0.0018579955,0.000018410037,0.000020913918,0.000011673782,0.0000076066144,0.0005201149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908036,0.00008146121,0.00017515947,0.00028951786,0.00016429438,0.00020923672],"domain_scores_gemma":[0.999622,0.000015003944,0.000030302774,0.00015754241,0.00005472676,0.00012045145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023367799,0.00007838251,0.00008590692,0.00007020951,0.000055613295,0.00007771748,0.00033932473,0.00004624395,0.000059546113],"category_scores_gemma":[0.00002563227,0.0000743131,0.000026753032,0.00054869056,0.000010903282,0.00044182857,0.00008776745,0.0001132748,0.00014443355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105217405,0.0009969495,0.0005482725,0.00006354513,0.000010208863,0.0000062923637,0.033161435,0.94401836,0.0011453213,0.0027933985,0.003246541,0.013999123],"study_design_scores_gemma":[0.00062955887,0.00005959328,0.0009858642,0.0000061856654,5.353113e-7,6.6199834e-7,0.00020723732,0.99726915,0.00021188155,0.000018918343,0.0005177345,0.00009269398],"about_ca_topic_score_codex":0.0000069216458,"about_ca_topic_score_gemma":0.00007276389,"teacher_disagreement_score":0.8994387,"about_ca_system_score_codex":0.000024317747,"about_ca_system_score_gemma":0.00003475502,"threshold_uncertainty_score":0.30304003},"labels":[],"label_agreement":null},{"id":"W3094751736","doi":"10.1007/978-3-030-62401-9_9","title":"Weighted Group Search on a Line","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Group (periodic table); Line (geometry); Mathematics; Geometry","score_opus":0.03669237838102849,"score_gpt":0.27552589137066497,"score_spread":0.23883351298963648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094751736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000514953,0.000116708805,0.97809315,0.01097808,0.0008281451,0.0004794411,0.000004988287,0.0002769185,0.00921741],"genre_scores_gemma":[0.03555654,0.00017411006,0.9351536,0.027133372,0.0006773539,0.000016694592,0.000025449113,0.000077196,0.001185709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995478,0.00006515622,0.00045207547,0.0017494848,0.0015842931,0.00067102426],"domain_scores_gemma":[0.99762386,0.00039341298,0.00013269075,0.0012252786,0.00025901294,0.00036574507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081001135,0.000469676,0.00045807546,0.00086009817,0.00026057803,0.0007203381,0.0037424287,0.00024128194,0.000069250804],"category_scores_gemma":[0.000068677036,0.00040923525,0.00012368948,0.001082492,0.00048813527,0.00044569935,0.0015748376,0.0013364593,0.00030840002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015382764,0.00006543517,0.000008057599,0.000040342176,0.000013523606,0.00019785266,0.0007211511,0.13937704,0.00009190271,0.1613699,0.00021814942,0.6978812],"study_design_scores_gemma":[0.0002950213,0.0005984337,0.0000073995016,0.00020963713,0.0000018321477,0.000017318305,5.1972012e-8,0.9438338,0.00048155067,0.04716108,0.006943142,0.00045068355],"about_ca_topic_score_codex":0.000009396026,"about_ca_topic_score_gemma":0.000014391675,"teacher_disagreement_score":0.80445683,"about_ca_system_score_codex":0.00022465702,"about_ca_system_score_gemma":0.0004804929,"threshold_uncertainty_score":0.99983597},"labels":[],"label_agreement":null},{"id":"W3096267547","doi":"10.3390/info11110506","title":"A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis","year":2020,"lang":"en","type":"article","venue":"Information","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Face (sociological concept); Parameterized complexity; Robot; Mathematical optimization; Trajectory; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04580419657583967,"score_gpt":0.2778586777553245,"score_spread":0.23205448117948485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096267547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020869698,0.0000066933667,0.97141486,0.0063095978,0.000010777405,0.00095301337,0.00003762298,0.00006997826,0.00032777758],"genre_scores_gemma":[0.89286584,0.0000060224183,0.104955874,0.0020206098,0.00001762016,0.00005540152,0.000066295695,0.000005009514,0.0000073598794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986081,0.00021304889,0.00042427095,0.00022614426,0.00033570416,0.00019273136],"domain_scores_gemma":[0.9990584,0.0003208611,0.00017452918,0.0002866186,0.000053235908,0.000106309104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000518082,0.00015234544,0.00016561784,0.00016677541,0.0003149574,0.00058100646,0.00037938828,0.00006274632,0.000004886288],"category_scores_gemma":[0.000161632,0.000100855796,0.000053610976,0.0013655652,0.000021522377,0.0018326635,0.00013877027,0.0002474495,0.000014694129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007885612,0.000011370067,0.00030791972,0.0000055899827,0.00003312681,0.000014062873,0.09367265,0.8970434,0.000001971378,0.0001730932,0.000025566434,0.008703355],"study_design_scores_gemma":[0.00047663806,0.00006286892,0.00077101623,0.0000141718365,0.000034429842,0.000017211669,0.0018952817,0.9964951,0.0000149946945,0.000076981334,0.000012955573,0.00012833075],"about_ca_topic_score_codex":0.00009888493,"about_ca_topic_score_gemma":0.00005047791,"teacher_disagreement_score":0.8719961,"about_ca_system_score_codex":0.00004735748,"about_ca_system_score_gemma":0.000042649324,"threshold_uncertainty_score":0.5602659},"labels":[],"label_agreement":null},{"id":"W3104447038","doi":"10.1137/1.9781611975994.131","title":"Instance-Optimality in the Noisy Value-and Comparison-Model","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Pairwise comparison; Computer science; Value (mathematics); Computational complexity theory; Crowdsourcing; Computation; Task (project management); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning","score_opus":0.10814892731091824,"score_gpt":0.2852486066807999,"score_spread":0.17709967936988164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104447038","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023620346,0.00011692132,0.31152198,0.0006382767,0.00014430107,0.0038213993,0.00007113783,0.00009498089,0.6833548],"genre_scores_gemma":[0.011252501,0.0002384825,0.76233524,0.0025644335,0.0005648923,0.00050026434,0.000081207385,0.00017020862,0.22229275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833506,0.000008765571,0.00053491484,0.0004460609,0.0003822417,0.00029298276],"domain_scores_gemma":[0.99879754,0.00032724714,0.0002917382,0.00045869686,0.00004943769,0.00007537258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087163,0.00031733463,0.0005478827,0.000039432707,0.00020989406,0.0002814813,0.00057940144,0.00052037725,0.0000027783803],"category_scores_gemma":[0.00001268851,0.00023413704,0.00020836396,0.00002865235,0.00019162144,0.000055414468,0.0002927283,0.0006942284,0.000004119433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006620552,0.000024351499,4.045969e-7,0.00015412402,0.000043157106,1.2967865e-7,0.005409746,0.00054360554,0.000010146977,0.98732984,0.00234412,0.0041337563],"study_design_scores_gemma":[0.0019572661,0.00007683576,2.1477099e-7,0.00017332952,0.000060554223,0.0000031141888,0.0004329928,0.43295604,0.000022140457,0.54022926,0.023614977,0.00047328247],"about_ca_topic_score_codex":0.0000015420102,"about_ca_topic_score_gemma":0.0000026600676,"teacher_disagreement_score":0.46106207,"about_ca_system_score_codex":0.000044288132,"about_ca_system_score_gemma":0.00020398728,"threshold_uncertainty_score":0.95478314},"labels":[],"label_agreement":null},{"id":"W3107537640","doi":"10.1145/3392142","title":"Mechanism Design for Online Resource Allocation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Knapsack problem; Competitive analysis; Computer science; Valuation (finance); Payment; Incentive compatibility; Mechanism design; Resource allocation; Incentive; Function (biology); Resource (disambiguation); Allocative efficiency; Mathematical optimization; Operations research; Microeconomics; Business; Economics; Mathematics","score_opus":0.10921570948108951,"score_gpt":0.2737351367538308,"score_spread":0.16451942727274133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107537640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034641765,0.00012272598,0.9573528,0.0069914097,0.000055646862,0.0006745356,0.0000030844628,0.00006281302,0.00009518835],"genre_scores_gemma":[0.94612134,0.0000064643777,0.05362034,0.00019116826,0.000035138317,0.0000052443925,0.0000014135942,0.000005873979,0.000012999296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845546,0.000036507055,0.00041931646,0.00026969536,0.0006849677,0.00013402503],"domain_scores_gemma":[0.99831253,0.00009640091,0.00048195917,0.0002382324,0.0008080446,0.000062853294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294305,0.00010452309,0.00032775788,0.00016691063,0.00011365081,0.000095044765,0.0013005777,0.000034331664,3.099964e-7],"category_scores_gemma":[0.00089735835,0.00007545416,0.0001346303,0.0010602094,0.000022350143,0.00009314002,0.00030373802,0.00006199633,1.6879953e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015672846,0.00047373507,0.0033781254,0.0017529075,0.0036164522,1.2698567e-7,0.009158795,0.51218975,0.19447346,0.2598105,0.005181921,0.0098075],"study_design_scores_gemma":[0.00026504198,0.00015941238,0.00030314893,0.00013153079,0.000191187,1.7353366e-7,0.0001660575,0.98910505,0.008937448,0.00052083976,0.00013910745,0.00008101481],"about_ca_topic_score_codex":0.0000051799757,"about_ca_topic_score_gemma":2.446942e-7,"teacher_disagreement_score":0.9114796,"about_ca_system_score_codex":0.000023699618,"about_ca_system_score_gemma":0.000023692202,"threshold_uncertainty_score":0.30769315},"labels":[],"label_agreement":null},{"id":"W3108030130","doi":"10.1016/j.disc.2022.112883","title":"Broadcasting on paths and cycles","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Broadcasting (networking); Mathematics; Combinatorics; Graph; Discrete mathematics; Computer science; Computer network","score_opus":0.028254784988091426,"score_gpt":0.2694434600879379,"score_spread":0.24118867509984648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108030130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02841124,0.00008038493,0.9299205,0.0021526283,0.00015889495,0.0003418472,0.000012227603,0.00028626792,0.03863602],"genre_scores_gemma":[0.7278651,0.000018276609,0.27021196,0.00065591454,0.000023624543,0.000053810705,0.000005770809,0.000018968502,0.0011465874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992727,0.000043797092,0.00012709716,0.00015433971,0.000261907,0.00014017569],"domain_scores_gemma":[0.9995429,0.00009919996,0.000052425312,0.00023821472,0.000015220425,0.000052058393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026998273,0.00006656962,0.00008127319,0.00005536909,0.00027260452,0.00011741625,0.00029562082,0.0000100583275,0.000050341496],"category_scores_gemma":[0.000046509504,0.000058828868,0.000021097905,0.0001568607,0.000019363533,0.00009793797,0.00042053338,0.00010799859,0.000012997206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021107458,0.00011353065,0.000112914924,0.000073286436,0.000012069445,0.000018055658,0.009810491,0.008085383,0.00020157741,0.9571578,0.0007114813,0.02370128],"study_design_scores_gemma":[0.00018040236,0.00011093979,0.00006797057,0.000017234905,0.0000020654218,0.000023450379,0.0006023304,0.96788216,0.00008697862,0.02868949,0.002206015,0.00013094652],"about_ca_topic_score_codex":0.0000012381972,"about_ca_topic_score_gemma":2.0950527e-7,"teacher_disagreement_score":0.9597968,"about_ca_system_score_codex":0.0000148287645,"about_ca_system_score_gemma":0.000014169402,"threshold_uncertainty_score":0.23989716},"labels":[],"label_agreement":null},{"id":"W3109677567","doi":"10.1609/aaai.v35i13.17394","title":"Contract Scheduling With Predictions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fondation Mathématique Jacques Hadamard","keywords":"Computer science; Adversarial system; Robustness (evolution); Scheduling (production processes); Binary number; Consistency (knowledge bases); Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.07369333998191974,"score_gpt":0.2945374869621534,"score_spread":0.2208441469802337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109677567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04457466,0.000048090908,0.8827012,0.01805729,0.0004930494,0.00056287064,0.0000071117233,0.00026150266,0.05329421],"genre_scores_gemma":[0.9713092,0.000043806573,0.027870968,0.0002902481,0.000035455363,0.000019741401,5.3202996e-7,0.000008074278,0.00042199864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854255,0.000017777978,0.00032855954,0.00038199543,0.00046230078,0.00026680608],"domain_scores_gemma":[0.99807787,0.000070724374,0.00018787799,0.00026606742,0.0013004673,0.00009701169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847879,0.00013781163,0.00016632809,0.00007428898,0.0002355691,0.00035275333,0.0009942831,0.000056707548,0.00012410097],"category_scores_gemma":[0.00031416037,0.000096175434,0.000066201,0.00084630976,0.0001757265,0.0004756218,0.0002251411,0.0002819826,0.000045540382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018870085,0.00013823186,0.00024434229,0.000017135515,0.000016909557,0.0000012019112,0.0006471755,0.0026193208,0.012345261,0.9704829,0.000040791143,0.013427855],"study_design_scores_gemma":[0.00005032174,0.00018119962,0.00024196884,0.00025693668,0.0000107647165,0.000020618818,0.00048710333,0.53445816,0.4149162,0.048987463,0.00019607249,0.00019321755],"about_ca_topic_score_codex":0.000012003637,"about_ca_topic_score_gemma":0.000011983053,"teacher_disagreement_score":0.9267345,"about_ca_system_score_codex":0.000027167176,"about_ca_system_score_gemma":0.0002583063,"threshold_uncertainty_score":0.39219207},"labels":[],"label_agreement":null},{"id":"W3111473535","doi":"10.1109/blockchain50366.2020.00060","title":"Candidate Set Formation Policy for Mining Pools","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Computer science; Set (abstract data type); Programming language","score_opus":0.06289138441228816,"score_gpt":0.31615016725465583,"score_spread":0.2532587828423677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111473535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027272553,0.0000030840852,0.9608056,0.031803034,0.000023160599,0.00017754406,0.0000041697485,0.00012799453,0.0067826626],"genre_scores_gemma":[0.48514807,0.000012562384,0.49357834,0.019818923,0.00014774068,0.0000432938,0.000036695365,0.000008064943,0.0012063229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955165,0.000014094747,0.000101277314,0.000106911335,0.000087890316,0.00013819274],"domain_scores_gemma":[0.9997052,0.000027083664,0.00002625093,0.00009285096,0.00005238205,0.00009622604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008372666,0.000040611067,0.000048889015,0.000043393204,0.00006879953,0.00014296862,0.0002400413,0.00001608314,0.000021335552],"category_scores_gemma":[0.000070907365,0.000034862995,0.000020706619,0.00024613153,0.0000051588727,0.00056979316,0.000073197916,0.00002207112,0.000033771175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018172717,0.000022187236,0.000118475946,0.000112524714,0.000018657145,0.0000019446675,0.022605361,0.013238133,0.0012579496,0.71413195,0.15529731,0.09317732],"study_design_scores_gemma":[0.00025595832,0.000058282785,0.000013419708,0.0000024019328,5.0640693e-7,0.0000010776951,0.00006859169,0.96980834,0.0011517495,0.00068355753,0.027900336,0.000055776887],"about_ca_topic_score_codex":0.000014168143,"about_ca_topic_score_gemma":0.000006883539,"teacher_disagreement_score":0.9565702,"about_ca_system_score_codex":0.00001322078,"about_ca_system_score_gemma":0.00006120807,"threshold_uncertainty_score":0.14216717},"labels":[],"label_agreement":null},{"id":"W3114470063","doi":"10.1109/latincom50620.2020.9282342","title":"A Low-Complexity Multi-Survivor Dynamic Programming for Constrained Discrete Optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Instruments Corporation","keywords":"Markov decision process; Dynamic programming; Generalization; Constrained optimization; Optimization problem; Discrete optimization; Markov chain; Stochastic programming; Function (biology)","score_opus":0.0636745229684185,"score_gpt":0.3104675232800502,"score_spread":0.24679300031163168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114470063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043775723,0.0000070721653,0.99047554,0.0074671092,0.00007603954,0.0009666467,0.0000099199415,0.00050637906,0.0004475067],"genre_scores_gemma":[0.08588389,0.000004358719,0.9127601,0.0009851863,0.000016879767,0.00007777786,0.000043679844,0.000011955029,0.00021618791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882185,0.000052710344,0.00024376536,0.00040142747,0.0001750922,0.0003051559],"domain_scores_gemma":[0.99929416,0.000059678696,0.00006984741,0.00020716406,0.0001611109,0.00020805518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018814676,0.00012869993,0.00014903022,0.000045125205,0.00016181146,0.0002882677,0.0004856394,0.000046580484,0.00006657096],"category_scores_gemma":[0.0001330771,0.00011389261,0.00007312671,0.00038119618,0.00008279179,0.00045042456,0.00014448512,0.000078032564,0.000015620373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058386893,0.00031649205,0.0001702547,0.00035614893,0.000057394936,0.0000068274703,0.0034715796,0.75594324,0.0007756899,0.1496608,0.00037402,0.088809155],"study_design_scores_gemma":[0.000882507,0.00011344202,0.000019543664,0.000008429417,0.0000026583607,0.0000012527947,0.00006046542,0.9978984,0.0001276677,0.00016908413,0.0005574333,0.00015909609],"about_ca_topic_score_codex":0.00001008421,"about_ca_topic_score_gemma":0.000025914904,"teacher_disagreement_score":0.24195516,"about_ca_system_score_codex":0.000022481692,"about_ca_system_score_gemma":0.000077541656,"threshold_uncertainty_score":0.46444058},"labels":[],"label_agreement":null},{"id":"W3116777151","doi":"10.4230/lipics.isaac.2020.10","title":"Approximation Algorithms for Generalized Path Scheduling","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Queue; Path (computing); Algorithm; Computer science; Flow shop scheduling; Longest path problem; Mathematics; Mathematical optimization; Theoretical computer science; Shortest path problem; Graph","score_opus":0.050347934490476275,"score_gpt":0.2875827974597208,"score_spread":0.23723486296924454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116777151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026139626,0.00003199564,0.990592,0.002859432,0.00044385862,0.0019960715,0.00020118286,0.00039964708,0.0008618571],"genre_scores_gemma":[0.036360208,0.000041962714,0.95696527,0.0050929906,0.00025659485,0.0004008884,0.00070191,0.000044686894,0.00013546523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974688,0.00004096581,0.0009780132,0.00034566983,0.0004867311,0.0006797966],"domain_scores_gemma":[0.9982133,0.000107863474,0.00036929478,0.00048529502,0.00047335925,0.00035087377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060213543,0.000312748,0.00038451218,0.00015458197,0.00039992426,0.00072852365,0.0011193705,0.00017135662,0.000020533913],"category_scores_gemma":[0.0002126897,0.00028840883,0.00024706117,0.00044757387,0.00005323317,0.0021443097,0.00033172083,0.00025238708,0.00008228764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059602724,0.0011762074,0.0011399896,0.006638301,0.00075696374,0.000009717929,0.097179316,0.10341776,0.0014451235,0.5410204,0.03376184,0.21285838],"study_design_scores_gemma":[0.0033010745,0.0002492525,0.0000128968695,0.00004204843,0.000014789336,0.0000063755515,0.0003039594,0.9584905,0.00086166704,0.0013114819,0.035050552,0.0003554183],"about_ca_topic_score_codex":0.0000033071692,"about_ca_topic_score_gemma":8.6898916e-7,"teacher_disagreement_score":0.85507274,"about_ca_system_score_codex":0.00007093733,"about_ca_system_score_gemma":0.00011593005,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W3118763906","doi":"10.1007/s00453-020-00792-6","title":"Approximating the Canadian Traveller Problem with Online Randomization","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Ministry of Science and Technology, Taiwan","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Combinatorics; Online algorithm; Deterministic algorithm; Bounded function; Time complexity; Vertex (graph theory); Upper and lower bounds; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm; Graph","score_opus":0.012957880170396573,"score_gpt":0.22003555062602606,"score_spread":0.2070776704556295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118763906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018635318,0.000056488407,0.9770033,0.014159573,0.00006394208,0.0003264662,0.0000049119926,0.00007526507,0.008123744],"genre_scores_gemma":[0.06823082,0.000018555427,0.9272133,0.0022088205,0.00008814708,0.00004295966,0.00006933363,0.000016885053,0.0021111863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895316,0.00011701546,0.00017295209,0.0002442086,0.00024688896,0.00026578878],"domain_scores_gemma":[0.99917275,0.00006600361,0.000051857016,0.00032663252,0.00024977498,0.0001329622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029438283,0.00008989537,0.00010686044,0.00005547088,0.00037889284,0.00031113176,0.00037132556,0.000040355797,0.000054063315],"category_scores_gemma":[0.0000414835,0.000057380104,0.000027639659,0.0006029952,0.000041305237,0.00020550136,0.000060785056,0.0001555947,0.000018307855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003904985,0.00039623622,0.00027256616,0.0000802173,0.00024762686,0.00021503282,0.011243468,0.066348545,0.00032246902,0.2540124,0.0061071874,0.6607152],"study_design_scores_gemma":[0.0013807156,0.000027110782,0.000112148555,0.00002170212,0.0000056063845,0.000055937322,0.000104962724,0.98625714,0.0005022966,0.0012677626,0.010124396,0.00014019688],"about_ca_topic_score_codex":0.0030611274,"about_ca_topic_score_gemma":0.034922,"teacher_disagreement_score":0.91990864,"about_ca_system_score_codex":0.000049959246,"about_ca_system_score_gemma":0.00064383744,"threshold_uncertainty_score":0.9826881},"labels":[],"label_agreement":null},{"id":"W3119859168","doi":"10.3390/info12010028","title":"Robot Evacuation on a Line Assisted by a Bike","year":2021,"lang":"en","type":"article","venue":"Information","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; Carleton University","funders":"","keywords":"Robot; Mobile robot; Computer science; Line (geometry); Simulation; Wireless; Face (sociological concept); Constant (computer programming); Artificial intelligence; Mathematics; Telecommunications","score_opus":0.03134581304665471,"score_gpt":0.2795205945949723,"score_spread":0.2481747815483176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119859168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005902361,0.000010810247,0.98513204,0.0034556855,0.00013835555,0.00010203072,0.000003975725,0.0001314955,0.010435355],"genre_scores_gemma":[0.8616843,0.000079688594,0.12430692,0.010381921,0.0000643405,0.00006731647,0.0009773368,0.000009221227,0.0024289612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993009,0.00004053934,0.00020080649,0.000077521654,0.00027495864,0.000105302206],"domain_scores_gemma":[0.9994026,0.000028949386,0.00007289364,0.00020857017,0.00023943513,0.000047551017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017663205,0.00005410791,0.00005263933,0.00008393085,0.00007731877,0.00027739766,0.00015127077,0.000040049687,0.000052867552],"category_scores_gemma":[0.00010811236,0.000051107418,0.000022327391,0.0004185471,0.000006104391,0.0018093125,0.000048357837,0.00006989396,0.00040628194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014837909,0.0001725214,0.000055147128,0.00004461043,0.000020921643,0.0000030485623,0.002884192,0.06719911,0.0028796068,0.058898557,0.04035246,0.827475],"study_design_scores_gemma":[0.0004559006,0.00008044159,0.0007145467,0.000018253208,0.0000013205662,0.0000068168756,0.000026248725,0.93901426,0.006577326,0.0003642647,0.052643996,0.00009665723],"about_ca_topic_score_codex":0.0000036818867,"about_ca_topic_score_gemma":0.0000015008804,"teacher_disagreement_score":0.8718151,"about_ca_system_score_codex":0.00004137944,"about_ca_system_score_gemma":0.00007642896,"threshold_uncertainty_score":0.5222068},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12677905652401197,"score_gpt":0.3956695854522347,"score_spread":0.26889052892822274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122384578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042884587,0.00011543331,0.9385695,0.008973265,0.000044404977,0.00056902424,0.000060676957,0.000060854552,0.047318403],"genre_scores_gemma":[0.80179775,0.00028151777,0.191967,0.000203487,0.000024168541,0.000017360218,0.000088160334,0.000004596295,0.005615989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983911,0.00025873826,0.0002243024,0.00026987557,0.00060171104,0.00025428034],"domain_scores_gemma":[0.99881583,0.000060572176,0.000016247499,0.00045818865,0.0005712283,0.00007794423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087094546,0.00006200723,0.00014761303,0.0010012991,0.00026162906,0.00022200769,0.00067880657,0.000031070536,0.00011877018],"category_scores_gemma":[0.0000657514,0.000059550042,0.00006235592,0.0037023854,0.000064729684,0.00034464494,0.00018573843,0.00019469156,0.000023835204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036530123,0.00020816724,0.000056291246,0.000008453754,0.00013657655,0.00001118082,0.0012152498,0.35757676,0.0002681065,0.62885326,0.0005089919,0.011153316],"study_design_scores_gemma":[0.00021334579,0.0001344146,0.0053942953,0.000031098636,0.00002423769,9.0956695e-7,0.00035145474,0.98999107,0.00016209001,0.00045711576,0.0031492524,0.00009072058],"about_ca_topic_score_codex":0.00005475908,"about_ca_topic_score_gemma":0.0002661988,"teacher_disagreement_score":0.79750925,"about_ca_system_score_codex":0.000050788924,"about_ca_system_score_gemma":0.000076140626,"threshold_uncertainty_score":0.24283803},"labels":[],"label_agreement":null},{"id":"W3122751602","doi":"10.22215/etd/2015-10855","title":"Experimental Evaluation of Reordering Buffer Management Algorithms","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sequence (biology); Buffer (optical fiber); Computer science; Algorithm; Telecommunications","score_opus":0.07176271399182672,"score_gpt":0.3845007939356672,"score_spread":0.3127380799438405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122751602","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064664828,0.001190858,0.20359188,0.000083265826,0.0018169619,0.00168675,0.000002248243,0.00022911801,0.78493243],"genre_scores_gemma":[0.38633394,0.00012583949,0.52868,0.00013477805,0.00012538668,0.00062339014,0.0010329665,0.00007842392,0.082865216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978588,0.00009280764,0.0002785223,0.0003192617,0.0013024024,0.00014817464],"domain_scores_gemma":[0.9987976,0.000008296164,0.0001300543,0.00038466984,0.00061252085,0.000066885994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009529511,0.00013843719,0.00015733513,0.00020508123,0.00004007068,0.00007877106,0.0004957045,0.0000857055,0.00027886793],"category_scores_gemma":[0.000013394092,0.00013104237,0.000048821563,0.00024906173,0.000009071691,0.00026420763,0.00009623199,0.000079907986,0.000036475452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004627133,0.00083054684,0.000010732863,0.0004798028,0.000355256,0.000009409439,0.01446805,0.027093725,0.0024146019,0.12883274,0.013788079,0.8116708],"study_design_scores_gemma":[0.0011405456,0.0001176706,0.00019259429,0.000114220406,0.000038622155,0.0000012704927,0.0023743198,0.9760376,0.014037056,0.0040488197,0.0015522277,0.00034505286],"about_ca_topic_score_codex":0.000024571222,"about_ca_topic_score_gemma":0.000008867716,"teacher_disagreement_score":0.94894385,"about_ca_system_score_codex":0.00011413133,"about_ca_system_score_gemma":0.00013541651,"threshold_uncertainty_score":0.53437525},"labels":[],"label_agreement":null},{"id":"W3122929977","doi":"","title":"A Tree-Structured Markovian Model of the Shipment Consolidation Process","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov process; Consolidation (business); Markov chain; Computer science; Mathematical optimization; Markov decision process; Markovian arrival process; Operations research; Heuristic; Economic dispatch; Engineering; Mathematics; Economics; Finance; Statistics","score_opus":0.011763078768868151,"score_gpt":0.2434368522337196,"score_spread":0.23167377346485146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122929977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018810598,0.00008959399,0.9746982,0.0053225514,0.00008321371,0.00014158202,0.0000011791874,0.000020632004,0.00083245954],"genre_scores_gemma":[0.99621814,0.00031388758,0.0021138634,0.00009742619,0.000023336677,0.000004316708,1.9905174e-7,0.000005664158,0.001223147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847573,0.00008693927,0.00020843936,0.00013383715,0.0003327261,0.00076233246],"domain_scores_gemma":[0.999394,0.000021697782,0.00016626737,0.00021823845,0.0001476956,0.000052109906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007496809,0.00007645537,0.00008319302,0.000063160245,0.00012890999,0.00004654252,0.00075645855,0.000034887576,0.000011800576],"category_scores_gemma":[0.000048805443,0.00003869523,0.000056882363,0.00015667749,0.000046459943,0.00033566722,0.000065820444,0.0003359454,0.0000026655548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003816316,0.00007443784,0.0011297439,0.00001442149,0.00006689995,4.874281e-7,0.001139892,0.008506453,0.010037934,0.7365117,0.00009879588,0.24238104],"study_design_scores_gemma":[0.0010835245,0.00013015355,0.00025562802,0.00004524615,0.000007958797,0.000078752906,0.0001502517,0.19243395,0.006988051,0.7986166,0.00006955668,0.00014031514],"about_ca_topic_score_codex":0.0000020395237,"about_ca_topic_score_gemma":0.00011268869,"teacher_disagreement_score":0.9774076,"about_ca_system_score_codex":0.00020414917,"about_ca_system_score_gemma":0.0020158258,"threshold_uncertainty_score":0.35759884},"labels":[],"label_agreement":null},{"id":"W3129885107","doi":"10.1287/moor.2020.1083","title":"Strong algorithms for the ordinal matroid secretary problem","year":2021,"lang":"en","type":"article","venue":"Universidad de Chile","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Secretary problem; Mathematics; Combinatorics; Rank (graph theory); Order (exchange); Discrete mathematics; Measure (data warehouse); Probability distribution; Algorithm; Computer science; Mathematical optimization; Data mining; Statistics; Optimal stopping","score_opus":0.02142803827901939,"score_gpt":0.26596309494726605,"score_spread":0.24453505666824665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129885107","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030499746,0.00015798603,0.9832232,0.0047988784,0.0000969607,0.00022130446,0.000011345598,0.00008984995,0.011095488],"genre_scores_gemma":[0.07755125,0.0001658714,0.9025945,0.0014986005,0.00022828474,0.000028232567,0.00006491007,0.00002620364,0.01784212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923545,0.000047022007,0.00008318499,0.00022346353,0.00014732781,0.00026354974],"domain_scores_gemma":[0.99931866,0.00012098772,0.000033840548,0.0003092541,0.00013402004,0.00008322661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016832417,0.000076462624,0.0000757999,0.000046089925,0.00028688164,0.00014891814,0.0005237452,0.00003589664,0.00014091886],"category_scores_gemma":[0.000016159032,0.00006265568,0.00007358841,0.0002849601,0.000034152083,0.00028753647,0.00019366742,0.000114681614,0.00001909113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003751383,0.00024192547,0.0009577994,0.00009756613,0.000243344,0.00017669337,0.004597306,0.0974976,0.0013188119,0.73484766,0.06542979,0.09455396],"study_design_scores_gemma":[0.0008886231,0.00008795084,0.0005715383,0.000019749086,0.000015925645,0.000059481197,0.0006973561,0.8699648,0.0011443923,0.003335732,0.12303093,0.00018355233],"about_ca_topic_score_codex":0.000020159752,"about_ca_topic_score_gemma":0.000011883859,"teacher_disagreement_score":0.7724672,"about_ca_system_score_codex":0.000056747078,"about_ca_system_score_gemma":0.00024005087,"threshold_uncertainty_score":0.25550243},"labels":[],"label_agreement":null},{"id":"W3129941803","doi":"","title":"Building a Nest by an Automaton.","year":2019,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Robot; Grid; Brick; Computer science; Span (engineering); Cellular automaton; Automaton; Carry (investment); Regular grid; Algorithm; Time complexity; Task (project management); Theoretical computer science; Mathematics; Geometry; Engineering; Structural engineering; Artificial intelligence","score_opus":0.011336105694697935,"score_gpt":0.2506736587131816,"score_spread":0.23933755301848367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129941803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013155412,0.000043047286,0.8327355,0.0029475302,0.0012094748,0.00054186024,0.000010591599,0.0015746029,0.14778201],"genre_scores_gemma":[0.42518705,0.00009033978,0.54776007,0.0075883535,0.0004636461,0.000021348154,0.000044899123,0.00021686958,0.018627428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791855,0.00038190282,0.0002485579,0.00062662706,0.00042355648,0.00040082014],"domain_scores_gemma":[0.9986781,0.000042734155,0.000083264655,0.0008609218,0.00007340058,0.0002616059],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063223636,0.0001954761,0.00015533711,0.00013149665,0.00013310745,0.00049553835,0.0012640019,0.00003396109,0.00008233385],"category_scores_gemma":[0.00001006922,0.00018003055,0.000056689685,0.00036840455,0.000029192699,0.0007126734,0.00026933564,0.00020479053,0.0027403675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040449526,0.0021642733,0.0013652896,0.00012300794,0.00012779332,0.00042201177,0.006119439,0.059146937,0.23397596,0.27700907,0.05757177,0.361934],"study_design_scores_gemma":[0.0008853358,0.0006469923,0.0008338107,0.000043904558,0.0000026268638,0.000033501423,0.000018458357,0.83808637,0.0026458593,0.00010902739,0.15621378,0.00048033177],"about_ca_topic_score_codex":0.000006196714,"about_ca_topic_score_gemma":1.513016e-7,"teacher_disagreement_score":0.7789394,"about_ca_system_score_codex":0.000040651597,"about_ca_system_score_gemma":0.000033873577,"threshold_uncertainty_score":0.9980361},"labels":[],"label_agreement":null},{"id":"W3133770809","doi":"10.1016/j.dam.2021.02.026","title":"Cops and an Insightful Robber","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Mathematics; Upper and lower bounds; Graph; Hypercube; Combinatorics; Simple (philosophy); Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.02153216830304185,"score_gpt":0.2727909043294377,"score_spread":0.25125873602639587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133770809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003953872,0.000053002994,0.94004685,0.0004264749,0.000040174404,0.00015234473,0.0000014807904,0.00014243144,0.055183373],"genre_scores_gemma":[0.14283273,0.00005903767,0.85582924,0.0005696559,0.000030907464,0.000026194273,0.000017155342,0.000017303531,0.0006177697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.000017112234,0.00017600777,0.0002603423,0.00020519021,0.0001809246],"domain_scores_gemma":[0.9992147,0.000051265157,0.00004738665,0.0004903291,0.000065355,0.00013093076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014471405,0.00010306663,0.00014314058,0.000035563247,0.00009815302,0.00026756758,0.0002614906,0.000046065146,0.00005688977],"category_scores_gemma":[0.00001941751,0.000089609624,0.000019656793,0.00022449456,0.000039566825,0.0002379289,0.00024537,0.00008834776,0.000045442695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.055011e-7,0.00006202223,0.000006844959,0.000040972733,0.00000886445,0.000008062472,0.0026499778,0.0001532684,0.0026385162,0.9911728,0.0002408925,0.0030171755],"study_design_scores_gemma":[0.0010307522,0.00007128287,0.00013399638,0.000049389197,0.00001968942,0.00006830323,0.0013289716,0.6498864,0.014885682,0.32316747,0.008710269,0.000647736],"about_ca_topic_score_codex":7.9096526e-7,"about_ca_topic_score_gemma":0.000004017465,"teacher_disagreement_score":0.66800535,"about_ca_system_score_codex":0.000008941595,"about_ca_system_score_gemma":0.000048131937,"threshold_uncertainty_score":0.36541745},"labels":[],"label_agreement":null},{"id":"W3134754278","doi":"10.23952/asvao.3.2021.3.08","title":"On the approximation error for approximating convex bodies using multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Regular polygon; Mathematical optimization; Approximation error; Mathematics; Multi-objective optimization; Convex optimization; Applied mathematics; Computer science; Geometry","score_opus":0.03939735449479389,"score_gpt":0.28807096581468744,"score_spread":0.24867361131989354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134754278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061257,0.000046001434,0.9967669,0.0005647567,0.000058047313,0.00082419615,0.000013875028,0.00012559489,0.0009880501],"genre_scores_gemma":[0.12747538,0.000048865913,0.87112695,0.00062990125,0.00003886661,0.00018472671,0.00036454128,0.000024292165,0.00010650047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978574,0.0002088258,0.00052351004,0.00069102756,0.00040551092,0.0003137577],"domain_scores_gemma":[0.998109,0.00037864284,0.0003735163,0.00048913324,0.0005618447,0.00008786255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008635251,0.00025061963,0.0003903526,0.00034214507,0.0008782959,0.00061787857,0.0002682381,0.00012334698,0.00007303475],"category_scores_gemma":[0.0003117856,0.00020268388,0.00015167514,0.0016829264,0.000075899996,0.00043245376,0.00013642132,0.00014219363,0.0000019271242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013904994,0.00005405769,0.000019203299,0.000023456978,0.00024630883,3.3713332e-7,0.001166996,0.91217095,0.000154199,0.08502142,0.000025210888,0.0011039407],"study_design_scores_gemma":[0.00058999046,0.000028552957,0.000019605071,0.000015282358,0.00025399,0.0000015891441,0.00064738246,0.99520487,0.0011254093,0.0018562572,0.000012006399,0.0002450407],"about_ca_topic_score_codex":0.000012425774,"about_ca_topic_score_gemma":0.000007174559,"teacher_disagreement_score":0.12686281,"about_ca_system_score_codex":0.00008073045,"about_ca_system_score_gemma":0.00009286185,"threshold_uncertainty_score":0.82652086},"labels":[],"label_agreement":null},{"id":"W3135232827","doi":"10.48550/arxiv.2006.15379","title":"Cops and an Insightful Robber","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Graph; Upper and lower bounds; Hypercube; Combinatorics; Simple (philosophy); Cheating; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.13031457915011926,"score_gpt":0.20651221055519775,"score_spread":0.07619763140507849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135232827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03044137,0.000043697968,0.9606527,0.00067591714,0.0002419197,0.00026601623,0.0000055304345,0.00034141084,0.0073314034],"genre_scores_gemma":[0.98978233,0.00023471424,0.0084528625,0.00044185374,0.000049832535,4.910376e-7,0.000017297403,0.000012400553,0.0010081868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852514,0.00014725467,0.00011713851,0.0009170945,0.000076281285,0.0002170935],"domain_scores_gemma":[0.9987334,0.000035820172,0.000092400056,0.00069447525,0.00011787778,0.0003260243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119713724,0.00019252882,0.00020671202,0.00013960458,0.00012242266,0.00023572211,0.0010791055,0.00017193129,0.000045677494],"category_scores_gemma":[0.00001902175,0.00021757052,0.0000587589,0.0003918149,0.00008510656,0.00054978573,0.0019991507,0.00043695906,0.00006726152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018879467,0.00009822582,0.0019707687,0.000076574775,0.00006240389,0.0003488153,0.0013280109,0.22836016,0.000049105267,0.7652802,0.001039746,0.0013671094],"study_design_scores_gemma":[0.00032067884,0.00006843525,0.0005966391,0.000022723818,0.000013021151,0.0000025256252,0.000034318487,0.95413744,0.00003117355,0.04230425,0.0021789565,0.00028985756],"about_ca_topic_score_codex":0.000058718866,"about_ca_topic_score_gemma":0.000027737462,"teacher_disagreement_score":0.959341,"about_ca_system_score_codex":0.000052312538,"about_ca_system_score_gemma":0.00015137886,"threshold_uncertainty_score":0.8872268},"labels":[],"label_agreement":null},{"id":"W3142890281","doi":"","title":"Taiwan's national memory","year":2009,"lang":"en","type":"article","venue":"IEEE Spectrum","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Upgrade; Dram; Slumping; Government (linguistics); Business; Commerce; Operations management; Finance; Engineering; Computer science; Operating system; Computer hardware; Geography","score_opus":0.017967292752318564,"score_gpt":0.2663864582046756,"score_spread":0.24841916545235704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142890281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009204933,0.000039416605,0.72542995,0.041940622,0.00062412344,0.00015687004,0.000001746292,0.0003831117,0.23050363],"genre_scores_gemma":[0.9642122,0.000009323425,0.027671082,0.0036998354,0.00020049894,0.0000022094823,0.0000019299503,0.000004379381,0.004198543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.000025666932,0.00010368268,0.0001955959,0.0003613823,0.0002031211],"domain_scores_gemma":[0.99963677,0.000012767378,0.000027821457,0.0001937301,0.000052652027,0.000076241675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018888044,0.00006496951,0.00006225448,0.00009480547,0.000086293956,0.00011631343,0.00043447202,0.000028448854,0.00010375779],"category_scores_gemma":[0.000016530885,0.00006175452,0.000034228106,0.0002848042,0.00001676799,0.00032310697,0.000022722836,0.000091264,0.0003066496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005437991,0.00016982526,0.00004388936,0.000004012555,0.000011803244,0.000027315507,0.000564015,0.012752439,0.0025604754,0.9010384,0.060056668,0.022765683],"study_design_scores_gemma":[0.0012014932,0.0004477437,0.004087111,0.000018453207,0.0000026937998,0.000065783956,0.00002073479,0.50826323,0.02444388,0.42270425,0.03813937,0.000605247],"about_ca_topic_score_codex":0.000002813735,"about_ca_topic_score_gemma":0.0000032227676,"teacher_disagreement_score":0.9632917,"about_ca_system_score_codex":0.000044120883,"about_ca_system_score_gemma":0.0000971909,"threshold_uncertainty_score":0.39414626},"labels":[],"label_agreement":null},{"id":"W3144562320","doi":"10.5555/1165139.1165141","title":"A multi-agent architecture for robotic systems in real-time environments","year":2006,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Architecture; Distributed computing; Multi-agent system; Agent architecture; Computer architecture; Embedded system; Real-time computing; Artificial intelligence","score_opus":0.015702238508529694,"score_gpt":0.2646063850324099,"score_spread":0.2489041465238802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144562320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292348,0.00008137134,0.99367124,0.0013719826,0.00037503534,0.00015202888,0.0000016115318,0.000011903963,0.00004250733],"genre_scores_gemma":[0.5731827,0.00012835531,0.42608273,0.000056499535,0.0001384041,0.0000066944503,0.000012265175,0.000009055425,0.0003833196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990711,0.00004285673,0.00038174074,0.00009931762,0.0003056624,0.000099289755],"domain_scores_gemma":[0.9994629,0.00007698246,0.00025397632,0.00006396801,0.0001102149,0.000031937405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030029783,0.00006902075,0.00011528921,0.0002359551,0.000029064788,0.00018131502,0.00027251852,0.000035715882,0.000002171248],"category_scores_gemma":[0.00003496151,0.00006006759,0.000039760034,0.00006501365,0.000014826447,0.00027711442,0.000044481483,0.00006556291,0.0000028912007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005127961,0.00008752377,0.00027130792,0.0000075204607,0.000015345991,0.000008154633,0.00010792398,0.9868622,0.0031200822,0.0073776892,0.00011305999,0.0020240685],"study_design_scores_gemma":[0.0006843642,0.000055333938,0.006649815,0.00007626006,0.0000035959658,0.000050980765,0.000007657775,0.9907373,0.00005607511,0.0013193411,0.0002977622,0.00006150892],"about_ca_topic_score_codex":0.000023296376,"about_ca_topic_score_gemma":0.000004054719,"teacher_disagreement_score":0.56889033,"about_ca_system_score_codex":0.000080933925,"about_ca_system_score_gemma":0.000030532847,"threshold_uncertainty_score":0.2449485},"labels":[],"label_agreement":null},{"id":"W3148455537","doi":"10.48550/arxiv.2011.02046","title":"Beyond Worst-case Analysis of Multicore Caching Strategies","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Multi-core processor; Cache; Core (optical fiber); Locality; Locality of reference; Flexibility (engineering); Generalization; Cache algorithms; Parallel computing; Online algorithm; Algorithm; Class (philosophy); CPU cache; Artificial intelligence; Mathematics","score_opus":0.10842854413340616,"score_gpt":0.22292266206711156,"score_spread":0.1144941179337054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148455537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12013279,0.000023791536,0.8758806,0.00013812454,0.00012817464,0.00018690167,0.000029354596,0.00015245745,0.0033277813],"genre_scores_gemma":[0.99072826,0.00006513053,0.008869327,0.00006799722,0.000016457705,4.6514035e-7,0.000034677447,0.000009833903,0.00020782684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983487,0.00018767186,0.00025184161,0.0008505637,0.00011734769,0.00024386414],"domain_scores_gemma":[0.9982755,0.000121001365,0.00028342102,0.0009049703,0.00021418298,0.00020088743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021403423,0.00022762867,0.00045839156,0.0006795349,0.00012633491,0.00019781732,0.0012807758,0.00017231304,0.000056951765],"category_scores_gemma":[0.000038498896,0.00025824236,0.0003327026,0.0021923794,0.00009933136,0.0004759816,0.0016683232,0.0004960623,0.000013085962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069005728,0.000043139957,0.0012541851,0.000052370604,0.00051512755,0.0010475972,0.0008943162,0.8245035,0.000019144123,0.17146645,0.000025871626,0.00017143128],"study_design_scores_gemma":[0.00021114606,0.00002735726,0.00045621142,0.000021255495,0.00037606497,0.0000046557484,0.0004254918,0.98535246,0.000022123091,0.01284031,0.000022895361,0.000240038],"about_ca_topic_score_codex":0.00045472523,"about_ca_topic_score_gemma":0.00020386341,"teacher_disagreement_score":0.8705955,"about_ca_system_score_codex":0.00007634658,"about_ca_system_score_gemma":0.00024852908,"threshold_uncertainty_score":0.999987},"labels":[],"label_agreement":null},{"id":"W3150519068","doi":"10.1109/ipdps.2006.1639543","title":"Optimal map construction of an unknown torus","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Torus; Security token; Node (physics); Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Multi-agent system; Algorithm; Combinatorics; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Geometry; Computer network; Physics","score_opus":0.009185106305420774,"score_gpt":0.23622643331773757,"score_spread":0.2270413270123168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150519068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012159462,0.000010328018,0.9540278,0.0005249103,0.00015034222,0.00006766093,5.7717705e-7,0.00011183298,0.03294713],"genre_scores_gemma":[0.16985206,0.000001732803,0.82819796,0.000046730554,0.000030415342,0.0000019967356,0.000003755392,0.0000024538724,0.001862928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994975,0.000026654103,0.00012139129,0.0001245746,0.00012982932,0.000100060985],"domain_scores_gemma":[0.9996589,0.000010060789,0.00003162614,0.00018484022,0.0000785374,0.00003604935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009563942,0.00003996563,0.000054430995,0.00005092283,0.000034876844,0.000049148442,0.00021076584,0.00002428108,0.00009624605],"category_scores_gemma":[0.000002810489,0.000034771216,0.000017483488,0.00013926727,0.000041890566,0.00038008488,0.00004721138,0.000030496638,0.000019811867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024688595,0.00007377298,0.00025720467,0.0000065877416,0.0000026334305,0.0000015772646,0.000058004167,0.030095633,0.00068753277,0.94812924,0.0013785084,0.019306835],"study_design_scores_gemma":[0.0004072999,0.0001522445,0.000794959,0.000005030755,0.0000013853165,0.000015347683,0.00003045286,0.96393955,0.014848305,0.00570934,0.013965516,0.00013056217],"about_ca_topic_score_codex":0.00008998844,"about_ca_topic_score_gemma":0.000012673,"teacher_disagreement_score":0.9424199,"about_ca_system_score_codex":0.000008501775,"about_ca_system_score_gemma":0.00002964782,"threshold_uncertainty_score":0.1417929},"labels":[],"label_agreement":null},{"id":"W3154756789","doi":"10.1007/s12530-021-09378-1","title":"On utilizing the transitivity pursuit-enhanced object partitioning to optimize self-organizing lists-on-lists","year":2021,"lang":"en","type":"article","venue":"Evolving Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Transitive relation; Computer science; Context (archaeology); Object (grammar); Filter (signal processing); Theoretical computer science; Artificial intelligence; Mathematics; Computer vision; Combinatorics","score_opus":0.020976038599415048,"score_gpt":0.2616387712903479,"score_spread":0.24066273269093286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154756789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018600948,0.0004339029,0.933517,0.005003414,0.0026907485,0.0011006384,0.000009459652,0.001185107,0.03745881],"genre_scores_gemma":[0.98438287,0.000017414592,0.013476291,0.0009828487,0.00018381405,0.00009181832,0.00000584317,0.000033480403,0.0008256139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677455,0.0006631655,0.00041604514,0.0007398523,0.0008203906,0.00058601686],"domain_scores_gemma":[0.9976001,0.0007306934,0.00012023322,0.00094339706,0.00039231515,0.00021325685],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014325479,0.00025214086,0.0003144398,0.00012822969,0.0007921222,0.0016285066,0.00087718293,0.00008959192,0.000048628623],"category_scores_gemma":[0.00062085607,0.00020973987,0.000110607994,0.0012133197,0.00002818089,0.00050146016,0.00022993848,0.00035870785,0.00021873626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003405945,0.0005142571,0.00016331922,0.00032281203,0.0001998901,0.00021638312,0.028590783,0.80141366,0.019797793,0.1328826,0.011759065,0.004105366],"study_design_scores_gemma":[0.0011122086,0.00033492505,0.0011439933,0.0016237658,0.000023016602,0.00009396021,0.0017439442,0.96958643,0.020414338,0.00037267146,0.0026680068,0.00088273245],"about_ca_topic_score_codex":0.000052796266,"about_ca_topic_score_gemma":0.000025640855,"teacher_disagreement_score":0.9657819,"about_ca_system_score_codex":0.00022883518,"about_ca_system_score_gemma":0.00023163442,"threshold_uncertainty_score":0.9994079},"labels":[],"label_agreement":null},{"id":"W3156953634","doi":"10.1007/978-3-030-86838-3_29","title":"Labeling Schemes for Deterministic Radio Multi-broadcast","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Set (abstract data type); Radio broadcasting; Radio networks; Broadcasting (networking); Broadcast engineering; Distributed computing; Theoretical computer science; Telecommunications; Engineering; Wireless network; Wireless","score_opus":0.04539100033866524,"score_gpt":0.32003762845249817,"score_spread":0.27464662811383295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156953634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017862789,0.00064358884,0.9928342,0.0009875415,0.0027546175,0.00077080843,0.0000063296793,0.00021096438,0.000005660686],"genre_scores_gemma":[0.2810517,0.000041426956,0.71792835,0.00070753804,0.00016909548,0.0000705492,0.000011251144,0.00001690792,0.0000031739237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958908,0.000121024364,0.0005488414,0.0018697968,0.00069885753,0.00087068905],"domain_scores_gemma":[0.99688786,0.0005837584,0.00021744797,0.0014821632,0.0006006437,0.00022813227],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012932913,0.00041461736,0.00050049974,0.00056709524,0.00036516512,0.0022466823,0.003867422,0.00026534867,0.000006728709],"category_scores_gemma":[0.0007323595,0.00040282102,0.00016090737,0.0014534829,0.00036015495,0.0005537033,0.0039405925,0.00080339017,0.0000053520353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025590653,0.000095352945,0.00019274048,0.00015364923,0.0000090849335,0.000031933127,0.0016960852,0.53849894,0.000573318,0.00025508364,0.0000050114704,0.45848626],"study_design_scores_gemma":[0.00047260965,0.00006542722,0.00008586231,0.00032745194,0.0000043627365,0.000025046576,9.793301e-7,0.9916436,0.0040754233,0.0026749442,0.00016026082,0.00046401037],"about_ca_topic_score_codex":0.000022438051,"about_ca_topic_score_gemma":0.000032340682,"teacher_disagreement_score":0.45802227,"about_ca_system_score_codex":0.00022097751,"about_ca_system_score_gemma":0.0014307703,"threshold_uncertainty_score":0.99984235},"labels":[],"label_agreement":null},{"id":"W3158797200","doi":"10.4230/lipics.mfcs.2021.57","title":"Online Domination: The Value of Getting to Know All Your Neighbors","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bipartite graph; Combinatorics; Competitive analysis; Vertex (graph theory); Mathematics; Graph; Planar graph; Node (physics); Set (abstract data type); Computer science; Discrete mathematics; Upper and lower bounds","score_opus":0.030331920693422384,"score_gpt":0.3110980857950028,"score_spread":0.2807661651015804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158797200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028563596,0.0001661804,0.9548444,0.007870416,0.0020441145,0.0027370525,0.00061257614,0.0002161863,0.0029454748],"genre_scores_gemma":[0.25162703,0.0004359969,0.7327586,0.009652657,0.0005841535,0.00048197978,0.0030420981,0.00012800423,0.0012895114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957911,0.00014970762,0.0017915169,0.00049404806,0.0010176451,0.0007559851],"domain_scores_gemma":[0.99543226,0.0002868827,0.0009659096,0.0017876392,0.00124252,0.00028480362],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014303608,0.00052077987,0.00069957966,0.00039784933,0.00029288782,0.0010579254,0.0033135056,0.00039069616,0.000040041417],"category_scores_gemma":[0.00041975675,0.00041318688,0.00044850915,0.0005937325,0.000107827225,0.0010122922,0.004098127,0.0010601906,0.000032110955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017017488,0.0032077003,0.0021843293,0.008010995,0.0018263544,0.000031557112,0.23821826,0.44924834,0.00022340423,0.13247752,0.032710973,0.13169037],"study_design_scores_gemma":[0.0014442494,0.00018301597,0.00048447103,0.0008054082,0.000056915105,0.000027969058,0.0024969804,0.9345587,0.00074706716,0.0009832921,0.057482895,0.00072905305],"about_ca_topic_score_codex":0.000041029136,"about_ca_topic_score_gemma":0.000034203953,"teacher_disagreement_score":0.48531032,"about_ca_system_score_codex":0.00018029024,"about_ca_system_score_gemma":0.00043432976,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W3160973854","doi":"10.1016/j.jcss.2021.04.003","title":"Exploration of dynamic networks: Tight bounds on the number of agents","year":2021,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Computer science; Graph; Interval (graph theory); Upper and lower bounds; Mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics; Theoretical computer science","score_opus":0.044241695295764084,"score_gpt":0.3022377106508853,"score_spread":0.2579960153551212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160973854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04578779,0.00017428712,0.95085067,0.0010131141,0.00064284087,0.000054203694,3.887372e-7,0.0000053335843,0.0014713638],"genre_scores_gemma":[0.98058224,0.00007854269,0.019148966,0.00008797963,0.000046298483,5.224846e-7,1.3834217e-7,0.0000014684321,0.00005383627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986717,0.00022524575,0.00041181027,0.00010916213,0.00048446885,0.000097599506],"domain_scores_gemma":[0.9989584,0.00016165688,0.00037066042,0.00013627754,0.00032641427,0.000046597932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423263,0.000057079167,0.00017542248,0.000072212366,0.00012502792,0.00018427966,0.0004657627,0.00002154482,0.000006604384],"category_scores_gemma":[0.000011728837,0.00003249097,0.000057878104,0.0004672942,0.00010483416,0.0005954865,0.00009252533,0.00006906075,0.000001071292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030022089,0.00038309582,0.007243353,0.00032781865,0.00016835325,0.00007268302,0.009117038,0.31456435,0.00033757614,0.6113844,0.004822054,0.051549282],"study_design_scores_gemma":[0.0001693843,0.0001632442,0.0016583283,0.00027028352,0.0000036445044,0.00011229289,0.00029121607,0.99621063,0.00011855799,0.00078710483,0.00016972388,0.00004555521],"about_ca_topic_score_codex":0.0000016490432,"about_ca_topic_score_gemma":9.818017e-7,"teacher_disagreement_score":0.9347945,"about_ca_system_score_codex":0.000013409803,"about_ca_system_score_gemma":0.00011279822,"threshold_uncertainty_score":0.1777013},"labels":[],"label_agreement":null},{"id":"W3171894515","doi":"10.23952/jano.3.2021.1.07","title":"Learning incentivization strategy for resource rebalancing in shared services with a budget constraint","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Resource (disambiguation); Budget constraint; Resource allocation; Computer science; Resource constraints; Business; Operations research; Mathematical optimization; Chemistry; Economics; Distributed computing; Microeconomics; Engineering; Mathematics; Computer network; Mechanical engineering","score_opus":0.009843123987047843,"score_gpt":0.23540081907985674,"score_spread":0.2255576950928089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171894515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001755333,0.000050315255,0.9966508,0.000489229,0.000018754921,0.00013012336,0.0000010693215,0.000017332337,0.00088705716],"genre_scores_gemma":[0.63690996,0.000074414536,0.3627174,0.00020545053,0.000030370331,0.0000057931697,0.000025285455,0.000008938436,0.000022408607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999104,0.000052682346,0.00032465855,0.0001734186,0.00019787083,0.00014734046],"domain_scores_gemma":[0.99923754,0.00008994224,0.00026589716,0.0000691581,0.00025758945,0.00007985582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031342296,0.00008504622,0.00018806498,0.00010790596,0.00008515135,0.00021859385,0.000118819604,0.00004891826,0.000010066711],"category_scores_gemma":[0.000027501625,0.00007120585,0.000023018412,0.0004289436,0.00002035629,0.0003791604,0.000041158066,0.00015908934,2.2377196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007531784,0.000051706065,0.00034971835,0.000037218655,0.000010679946,0.000007895872,0.00072852516,0.98618084,0.00025430866,0.0034348627,0.00001027505,0.008858647],"study_design_scores_gemma":[0.0012034592,0.00021080299,0.00030957302,0.000079825586,0.000006248373,0.00003443446,0.0006201,0.99633473,0.00027065654,0.00040098457,0.00043333607,0.00009582779],"about_ca_topic_score_codex":0.0000012239888,"about_ca_topic_score_gemma":8.9410906e-7,"teacher_disagreement_score":0.6351546,"about_ca_system_score_codex":0.000032513988,"about_ca_system_score_gemma":0.00011420224,"threshold_uncertainty_score":0.29036906},"labels":[],"label_agreement":null},{"id":"W3174973594","doi":"10.35708/rc1869-126260","title":"Identifying Hazardous Shapes in the Plane","year":2020,"lang":"en","type":"article","venue":"International Journal of Robotic Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Vertex (graph theory); Regular polygon; Line segment; Mobile robot; Hazardous waste; A priori and a posteriori; Enhanced Data Rates for GSM Evolution; Line (geometry); Computer science; Plane (geometry); Set (abstract data type); Artificial intelligence; Combinatorics; Mathematics; Algorithm; Engineering; Geometry; Graph","score_opus":0.05499822655337135,"score_gpt":0.3129449552881545,"score_spread":0.2579467287347832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174973594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006209589,0.00009552225,0.9689836,0.0236791,0.000530789,0.00004696812,1.7116452e-7,0.000015797728,0.00043845797],"genre_scores_gemma":[0.9465163,0.000014383159,0.05079434,0.0023690956,0.0002957936,1.7395321e-7,4.7381226e-7,0.0000033298154,0.000006128161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863464,0.00010571232,0.00040253016,0.00010615783,0.0006262002,0.00012475929],"domain_scores_gemma":[0.99920946,0.00022663937,0.0002327468,0.000059493235,0.00021522104,0.000056464578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006276188,0.000063781335,0.000113515765,0.00012821307,0.000044980145,0.00038023427,0.0014237919,0.00001794732,0.000015574185],"category_scores_gemma":[0.00019026146,0.00004667323,0.0000636772,0.00023440798,0.000015913649,0.0003329043,0.00020767962,0.00026488389,0.000013222445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011277027,0.000055593286,0.001348133,0.000008328244,0.000047100464,0.00061369897,0.009180397,0.9436285,0.00023102906,0.013953494,0.00079569715,0.03012678],"study_design_scores_gemma":[0.00046396203,0.00006063223,0.003463023,0.00008022655,0.0000025485112,0.00046256764,0.0002614887,0.99359787,0.000039470466,0.0009906599,0.00051110325,0.00006647785],"about_ca_topic_score_codex":0.0000057695697,"about_ca_topic_score_gemma":0.000002020243,"teacher_disagreement_score":0.94030666,"about_ca_system_score_codex":0.00003200905,"about_ca_system_score_gemma":0.00006318602,"threshold_uncertainty_score":0.36666077},"labels":[],"label_agreement":null},{"id":"W3175020564","doi":"10.1145/3448016.3459243","title":"Efficient and Effective Algorithms for Revenue Maximization in Social Advertising","year":2021,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Oracle; Revenue; Computer science; Approximation algorithm; Maximization; Computation; Payment; Quality (philosophy); Social network (sociolinguistics); Social media; Algorithm; Mathematical optimization; Mathematics; World Wide Web; Economics","score_opus":0.01784660297091779,"score_gpt":0.292141372480385,"score_spread":0.27429476950946724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175020564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035836836,0.000036601537,0.9945081,0.00096920185,0.000064893524,0.00023601872,0.000001823548,0.000023492492,0.00057621225],"genre_scores_gemma":[0.46144187,0.00001823553,0.53656167,0.0005901032,0.00007064836,0.000088178866,0.000010684047,0.000010073632,0.0012085345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949867,0.000057550984,0.00008133505,0.0001748566,0.00007742192,0.000110176414],"domain_scores_gemma":[0.9997546,0.000063278836,0.000016863041,0.00005979316,0.00008196491,0.000023513945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018482316,0.00003878282,0.00006309687,0.00004579251,0.00009342523,0.00007288186,0.00006024571,0.000026406686,0.000004453072],"category_scores_gemma":[0.00006133823,0.00003860308,0.000015223743,0.00026030262,0.000011436058,0.00006674706,0.00007042413,0.00003537768,0.0000013475246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001725697,0.00025988792,0.0010168116,0.00012071597,0.000018852184,0.000023819744,0.0071057295,0.11406652,0.0021709453,0.1524074,0.0013542252,0.7214379],"study_design_scores_gemma":[0.000509792,0.000019297893,0.0027481106,0.000011833374,8.356813e-7,0.0000028724273,0.00002871992,0.99341404,0.0009838984,0.0018470132,0.00037645918,0.000057124016],"about_ca_topic_score_codex":0.0000049456853,"about_ca_topic_score_gemma":0.000009372839,"teacher_disagreement_score":0.8793475,"about_ca_system_score_codex":0.000027349566,"about_ca_system_score_gemma":0.00003281895,"threshold_uncertainty_score":0.15741879},"labels":[],"label_agreement":null},{"id":"W3175635045","doi":"10.1609/icaps.v31i1.15967","title":"A Competitive Analysis of Online Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Computer science; Controllability; Path (computing); Set (abstract data type); Bounded function; Plan (archaeology); Asymptotically optimal algorithm; Mathematical optimization; Bounded rationality; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Applied mathematics","score_opus":0.07027185868418233,"score_gpt":0.33327608150466753,"score_spread":0.2630042228204852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175635045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726479,0.00008221694,0.018259864,0.002282536,0.00022982951,0.00011511213,0.000051723677,0.0001964468,0.006134363],"genre_scores_gemma":[0.93678975,0.000030547162,0.06293061,0.00011483778,0.000007353411,0.0000024379867,0.000014149095,0.000003643161,0.00010667774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.000014227337,0.0002824555,0.0002415167,0.00036672308,0.00011716159],"domain_scores_gemma":[0.9987339,0.00007160089,0.00026546422,0.00008092608,0.00080338964,0.00004471336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025663115,0.000094962874,0.00020143027,0.0002444385,0.000081059756,0.00014408556,0.0005305733,0.000043222295,0.000019613326],"category_scores_gemma":[0.0002554053,0.00007550433,0.00007759492,0.00062547193,0.000045521112,0.00016893189,0.00026930193,0.00015056653,6.131691e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002716409,0.0003193065,0.035405308,0.00007452363,0.0010196214,0.000006452829,0.0045492915,0.055185955,0.06804567,0.83436,0.00004375473,0.00096293224],"study_design_scores_gemma":[0.00023471045,0.000023358878,0.015102953,0.0003776548,0.000037418078,0.0000041713793,0.0009349838,0.97433156,0.008678954,0.00017226647,0.000025254134,0.000076716824],"about_ca_topic_score_codex":0.0000091055135,"about_ca_topic_score_gemma":0.000002219604,"teacher_disagreement_score":0.9191456,"about_ca_system_score_codex":0.0000228389,"about_ca_system_score_gemma":0.00008027847,"threshold_uncertainty_score":0.30789772},"labels":[],"label_agreement":null},{"id":"W3177044138","doi":"10.1007/978-3-030-79150-6_11","title":"Object Migration Automata for Non-equal Partitioning Problems with Known Partition Sizes","year":2021,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Partition (number theory); Computer science; A priori and a posteriori; Cellular automaton; Algorithm; Graph partition; Theoretical computer science; Partition problem; Automaton; Mathematics; Graph; Combinatorics","score_opus":0.012388473284107646,"score_gpt":0.257500720418397,"score_spread":0.24511224713428936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177044138","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051267147,0.0032266523,0.9179484,0.004128889,0.000113077695,0.0014462402,0.000025810252,0.0005574443,0.07250222],"genre_scores_gemma":[0.08201795,0.14975601,0.73407304,0.0018276534,0.00008095112,0.0044509717,0.0050707418,0.00011245192,0.022610214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856037,0.000035053232,0.0006879514,0.00026651798,0.00022365602,0.00022642789],"domain_scores_gemma":[0.9979031,0.00014163592,0.0005579293,0.0008807532,0.0004700928,0.00004650438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036838415,0.00023403288,0.00030001884,0.0006356481,0.00028995078,0.00027434583,0.0006370812,0.00033482624,0.000021768486],"category_scores_gemma":[0.0000782772,0.00022892066,0.00004008589,0.00030188548,0.0002097876,0.0032121104,0.0002676297,0.0003860721,0.0000180811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012940725,0.000024042853,0.00004767769,0.00016184022,0.000014217636,3.837162e-7,0.00060918723,0.0028402843,0.0000052063333,0.8696625,0.0001551897,0.12646651],"study_design_scores_gemma":[0.0015420739,0.0003819121,0.000030435394,0.0010260254,0.00001558002,0.000033022392,0.00032942923,0.17876656,0.00024218147,0.1810183,0.6360527,0.00056179165],"about_ca_topic_score_codex":0.0000053951603,"about_ca_topic_score_gemma":0.0004608178,"teacher_disagreement_score":0.68864423,"about_ca_system_score_codex":0.00009253333,"about_ca_system_score_gemma":0.00015169103,"threshold_uncertainty_score":0.9335114},"labels":[],"label_agreement":null},{"id":"W3177770101","doi":"10.1016/j.tcs.2021.06.038","title":"On synchronization and orientation in distributed barrier coverage with relocatable sensors","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orientation (vector space); Asynchronous communication; Visibility; Synchronization (alternating current); Position (finance); Range (aeronautics); Cover (algebra); Computer science; Focus (optics); Algorithm; Mathematics; Geometry; Telecommunications; Physics; Engineering; Aerospace engineering; Channel (broadcasting)","score_opus":0.00543839597750751,"score_gpt":0.23059370979311655,"score_spread":0.22515531381560905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177770101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060955565,0.0000073139827,0.93705124,0.0007745417,0.00009002495,0.00011562123,0.0000023883256,0.00005939152,0.00094390387],"genre_scores_gemma":[0.9417108,0.000010112149,0.05783975,0.0003964075,0.000011543787,0.0000041742833,0.0000088307015,0.0000043426703,0.000014007271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984143,0.000101593534,0.000153832,0.00055148127,0.00047286972,0.00030592436],"domain_scores_gemma":[0.9990475,0.0001508937,0.000031958913,0.0003726741,0.00023321166,0.00016375522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000549716,0.00010147152,0.000110752204,0.00012117121,0.0002145394,0.00044012858,0.00036051287,0.000030184452,0.00004472014],"category_scores_gemma":[0.00011340712,0.000082121995,0.000009867564,0.0016985307,0.0006551655,0.0006439312,0.00027468035,0.00012897824,0.00001152817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728078,0.000040941944,0.00038754358,0.0000057084258,0.0000011453722,0.000031759933,0.0002953508,0.03942591,0.00006742343,0.9557463,0.000012846823,0.003976347],"study_design_scores_gemma":[0.00044039908,0.00016113429,0.0018215074,0.000042898937,0.000001100032,0.000025355175,0.00000904564,0.949715,0.0020724195,0.04556113,0.000022512168,0.00012750909],"about_ca_topic_score_codex":0.0000021613791,"about_ca_topic_score_gemma":0.0000019427002,"teacher_disagreement_score":0.9102891,"about_ca_system_score_codex":0.000073608484,"about_ca_system_score_gemma":0.0001985844,"threshold_uncertainty_score":0.424417},"labels":[],"label_agreement":null},{"id":"W3181822265","doi":"10.1007/978-3-030-93043-1_1","title":"On the Fault-Tolerant Online Bin Packing Problem","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Replica; Bin packing problem; Server; Bin; Computer science; Fault tolerance; Competitive analysis; Sequence (biology); Distributed computing; Mathematics; Algorithm; Parallel computing; Computer network; Upper and lower bounds","score_opus":0.030603976821063923,"score_gpt":0.28629887795508696,"score_spread":0.25569490113402304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181822265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012315807,0.0001627425,0.96977776,0.015184832,0.0015915437,0.00069174246,0.000005059097,0.00020190416,0.00006858665],"genre_scores_gemma":[0.52523607,0.000035358065,0.47002172,0.0045070397,0.00014251132,0.000030137297,0.000010057587,0.000014249346,0.0000028617649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951426,0.00035433733,0.0005372632,0.001760785,0.0013721061,0.00083292637],"domain_scores_gemma":[0.9961138,0.0009057616,0.00024080777,0.002129072,0.00043836175,0.00017223718],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018073767,0.000444676,0.00042074433,0.0005119122,0.00044412375,0.0025660053,0.005542749,0.0002301248,0.000026865358],"category_scores_gemma":[0.00036866203,0.00030431966,0.00014391963,0.0026666378,0.00043272236,0.00042541613,0.005358135,0.001827249,0.000014607614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017946268,0.00012970353,0.000064863554,0.0000351745,0.0000067271794,0.00004014509,0.002355681,0.8475702,0.00013083383,0.0027532277,0.000023115754,0.14688857],"study_design_scores_gemma":[0.00016705772,0.00007440721,0.00023633338,0.00057222793,0.000001988607,0.000017989802,0.0000020741506,0.96547884,0.0013586689,0.03166643,0.00005332878,0.00037068006],"about_ca_topic_score_codex":0.00007854275,"about_ca_topic_score_gemma":0.0001363851,"teacher_disagreement_score":0.51292026,"about_ca_system_score_codex":0.00023803722,"about_ca_system_score_gemma":0.0011206158,"threshold_uncertainty_score":0.9999409},"labels":[],"label_agreement":null},{"id":"W3183614723","doi":"10.1145/3465084.3467910","title":"Separating Bounded and Unbounded Asynchrony for Autonomous Robots","year":2021,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchrony (computer programming); Bounded function; Convergence (economics); Asynchronous communication; Computer science; Range (aeronautics); Euclidean geometry; Plane (geometry); Mathematics; Mathematical analysis; Geometry","score_opus":0.02384694003927283,"score_gpt":0.2868991423199727,"score_spread":0.26305220228069986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183614723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069243653,0.00009975668,0.9805592,0.0040993947,0.000115307295,0.00016623677,8.203285e-7,0.00014877702,0.014118125],"genre_scores_gemma":[0.060482003,0.00001869351,0.92740256,0.0020901528,0.000034587538,0.00003212395,0.0000080570935,0.000008075455,0.009923756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992166,0.000035817564,0.00014107571,0.0002895439,0.000106696134,0.00021026368],"domain_scores_gemma":[0.99941576,0.00009655837,0.000029697894,0.00022895564,0.00013994277,0.000089086745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018630856,0.000072639465,0.00009937476,0.000032688153,0.0002091589,0.00055262144,0.00017311021,0.000036630878,0.000055946188],"category_scores_gemma":[0.0000644463,0.000068511414,0.00002925518,0.00018159318,0.000026642025,0.00034214498,0.00016045965,0.000048776412,0.000011589462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027603699,0.00006340955,0.000104946936,0.000039596307,0.000025919548,0.000010492489,0.00071507733,0.004698937,0.0013134903,0.9564279,0.00472826,0.031869225],"study_design_scores_gemma":[0.0005452285,0.000055686225,0.00010792992,0.0000071510353,0.0000021438243,0.000024230456,0.000038111015,0.9617716,0.0025961376,0.016171763,0.018541934,0.00013809363],"about_ca_topic_score_codex":0.000008812113,"about_ca_topic_score_gemma":0.000045464007,"teacher_disagreement_score":0.9570727,"about_ca_system_score_codex":0.000027485372,"about_ca_system_score_gemma":0.00021839321,"threshold_uncertainty_score":0.53289413},"labels":[],"label_agreement":null},{"id":"W3185337306","doi":"10.22215/etd/2021-14519","title":"Search and Rendezvous by Mobile Robots in Continuous Domains","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Rendezvous; Domain (mathematical analysis); Task (project management); Mobile robot; Function (biology); Robot; Position (finance); Computer science; Combinatorics; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Engineering; Mathematical analysis","score_opus":0.010415458597909455,"score_gpt":0.2812024195451884,"score_spread":0.27078696094727894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185337306","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22143932,0.014857292,0.41477954,0.0016743505,0.0023576014,0.004720433,0.000053116757,0.0010236109,0.33909473],"genre_scores_gemma":[0.22380486,0.0066631422,0.11940487,0.0009781648,0.00010537005,0.00057856285,0.0031354548,0.00012629901,0.6452033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844205,0.00012251486,0.00025472048,0.00052807515,0.0003506003,0.00030206397],"domain_scores_gemma":[0.99930406,0.000062913445,0.00004007059,0.00033104452,0.00014466605,0.000117230054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027321372,0.00016287641,0.00025984916,0.00017801118,0.00006875881,0.00035378366,0.00040613074,0.00018807435,0.0001488353],"category_scores_gemma":[0.00002296229,0.00015787562,0.00003571055,0.00043534342,0.000019753164,0.00021345142,0.000113396825,0.00031935427,0.000017026443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009039622,0.0015957961,0.0026498775,0.0012108982,0.00021035818,0.0009904903,0.041072078,0.020255776,0.009759937,0.072539784,0.068607,0.7810176],"study_design_scores_gemma":[0.010801425,0.0019950406,0.009246098,0.0016705653,0.00005159494,0.00020969407,0.024822732,0.8496311,0.039994292,0.0037214742,0.05179214,0.0060638734],"about_ca_topic_score_codex":0.00028624706,"about_ca_topic_score_gemma":0.0008327397,"teacher_disagreement_score":0.82937527,"about_ca_system_score_codex":0.00003907952,"about_ca_system_score_gemma":0.00018016809,"threshold_uncertainty_score":0.6437981},"labels":[],"label_agreement":null},{"id":"W3186619231","doi":"10.1007/978-3-030-80879-2_4","title":"Online Coloring and a New Type of Adversary for Online Graph Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University; Université de Montréal","funders":"","keywords":"Adversary; Bipartite graph; Parameterized complexity; Combinatorics; Computer science; Bounded function; Mathematics; Discrete mathematics; Graph; Theoretical computer science; Computer security","score_opus":0.0589688178431416,"score_gpt":0.2940742975132717,"score_spread":0.2351054796701301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186619231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016465473,0.0011771589,0.9961968,0.0009741662,0.0006757187,0.00053293846,0.00001908282,0.00006146354,0.00019803912],"genre_scores_gemma":[0.0030477338,0.00046986842,0.9945306,0.0007776106,0.00021658099,0.000003973945,0.00004096798,0.000025029603,0.00088759285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976511,0.000020224268,0.00045932175,0.0009557757,0.00051611976,0.00039744],"domain_scores_gemma":[0.99811876,0.00034172248,0.00022729432,0.0006363863,0.0004852026,0.00019060861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004083076,0.0002957699,0.00046738365,0.0005555934,0.0001120655,0.00018192882,0.0012737776,0.00019114502,0.000011804232],"category_scores_gemma":[0.00013056435,0.0002762909,0.000085874315,0.00073491223,0.00033709733,0.00036237147,0.0009342629,0.00038396838,9.072699e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018692925,0.00017764224,0.00014153987,0.00038816687,0.000038229307,0.000028107483,0.0012107075,0.21550429,0.00040779103,0.028736774,0.000092231945,0.75325584],"study_design_scores_gemma":[0.0006993997,0.000542445,0.00013547068,0.00083755405,0.000011155588,0.000034688353,5.667685e-7,0.92379534,0.00036081925,0.06893784,0.004162816,0.0004819191],"about_ca_topic_score_codex":0.000030164043,"about_ca_topic_score_gemma":0.00020220052,"teacher_disagreement_score":0.7527739,"about_ca_system_score_codex":0.00006740643,"about_ca_system_score_gemma":0.00097023655,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W3188945842","doi":"10.1109/tnnls.2021.3099095","title":"Solving Two-Person Zero-Sum Stochastic Games With Incomplete Information Using Learning Automata With Artificial Barriers","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Zero-sum game; Automaton; Learning automata; Artificial intelligence; Computer science; Complete information; Mathematical economics; Mathematics; Game theory","score_opus":0.01986134679584682,"score_gpt":0.23164229711516401,"score_spread":0.2117809503193172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188945842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029852798,0.00006730128,0.9689064,0.00014192873,0.00040109744,0.00025804297,0.0000015218355,0.00030777758,0.000063156636],"genre_scores_gemma":[0.9958776,0.000010999835,0.0037626,0.00008127074,0.00005948765,0.000023853563,0.000007982172,0.000023512628,0.00015266752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998028,0.00045858047,0.00030694,0.00037190362,0.00040367196,0.00043091155],"domain_scores_gemma":[0.9989748,0.00019326551,0.00019410091,0.00022479675,0.00019605827,0.00021700567],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000376806,0.00023935604,0.00027256025,0.00018569584,0.0012911719,0.0010695722,0.000168913,0.00007983647,0.000012023055],"category_scores_gemma":[0.000016685955,0.0001995879,0.000046683384,0.00071449415,0.00007741902,0.0012521372,0.0000058884484,0.0009108645,0.0000034655006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004086837,0.000011823486,0.000078884215,0.00003417324,0.000038119604,0.000013485069,0.0012038032,0.98657084,0.00009041865,0.00014281318,0.0000054425427,0.0117693385],"study_design_scores_gemma":[0.0005861927,0.00033965672,0.000027591861,0.00025303813,0.000024150337,0.00022679406,0.0015186331,0.99659294,0.00002239581,0.0000016833385,0.00014183938,0.00026505615],"about_ca_topic_score_codex":0.00015003141,"about_ca_topic_score_gemma":0.000025726506,"teacher_disagreement_score":0.9660248,"about_ca_system_score_codex":0.000058619502,"about_ca_system_score_gemma":0.00010704341,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W3191242629","doi":"10.1007/978-3-030-89240-1_6","title":"Evacuating from $$\\ell _p$$ Unit Disks in the Wireless Model","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Unit disk; Homogeneous space; Metric (unit); Metric space; Combinatorics; Mathematics; Circumference; Upper and lower bounds; Regular polygon; Euclidean space; Type (biology); Unit (ring theory); Chord (peer-to-peer); Unit sphere; Euclidean geometry; Wireless; Space (punctuation); Computer science; Discrete mathematics; Geometry; Mathematical analysis; Engineering; Distributed computing","score_opus":0.05171197795241873,"score_gpt":0.30831687088632176,"score_spread":0.25660489293390304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191242629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06004946,0.0002049363,0.93527883,0.0030162043,0.00080978585,0.00046354954,0.0000053680783,0.00009378524,0.000078095974],"genre_scores_gemma":[0.59983367,0.00003362457,0.39842626,0.0015665105,0.000088582055,0.000028060536,0.000012828576,0.000009262475,0.0000011586511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952579,0.00045518272,0.00056175306,0.0016663125,0.0013093825,0.0007494465],"domain_scores_gemma":[0.9965183,0.0008740534,0.00020478675,0.0019999603,0.0002770948,0.00012578716],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021359941,0.00038843456,0.00042035515,0.00046244694,0.00027606398,0.002405589,0.007131781,0.00025410595,0.00001085749],"category_scores_gemma":[0.00022782436,0.00029978922,0.0001029312,0.0027242478,0.00033512636,0.00067753624,0.0051866346,0.0017761936,0.000006500391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012193716,0.00006436087,0.0006817202,0.000018829565,0.0000029245032,0.00003373069,0.009714715,0.88682294,0.00015745328,0.00039720815,0.000003932076,0.10210095],"study_design_scores_gemma":[0.00020862135,0.000020895459,0.0008559962,0.00028783933,0.0000022623813,0.0000057763145,0.000007479051,0.9663175,0.00083550403,0.031107577,0.0000047460394,0.0003458034],"about_ca_topic_score_codex":0.00053719885,"about_ca_topic_score_gemma":0.00065696373,"teacher_disagreement_score":0.53978425,"about_ca_system_score_codex":0.00016804635,"about_ca_system_score_gemma":0.0012207525,"threshold_uncertainty_score":0.9999454},"labels":[],"label_agreement":null},{"id":"W3195783669","doi":"10.1002/net.22075","title":"Impact of knowledge on the cost of treasure hunt in trees","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Node (physics); Tree (set theory); Mathematics; Type (biology); Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Artificial intelligence; Algorithm; Geography","score_opus":0.03562918770948417,"score_gpt":0.30564253735452745,"score_spread":0.2700133496450433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195783669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12579684,0.0032952887,0.7613518,0.0025449193,0.0005701954,0.0009367496,0.000012789271,0.0000937993,0.10539761],"genre_scores_gemma":[0.9991243,0.00010526503,0.0004961497,0.00003775072,0.00002113873,0.000005001697,0.000001938772,0.0000029696748,0.00020546837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993834,0.00014857866,0.00013661478,0.00010755304,0.00010231532,0.00012156241],"domain_scores_gemma":[0.9992604,0.00024411312,0.000044272067,0.00029257234,0.00012827554,0.000030345655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025513032,0.000050405702,0.00010610948,0.000036890015,0.000020161338,0.000018905243,0.00026901616,0.00003783796,0.0000573184],"category_scores_gemma":[0.00006363901,0.000031761767,0.00005333927,0.0006569783,0.000028050448,0.000051613602,0.00007045707,0.000110452034,0.0000031516922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014819316,0.00040416478,0.018999644,0.000011076402,0.000028047585,0.0000050949016,0.0014080723,0.8824698,0.00009149802,0.018152863,0.00484136,0.07357356],"study_design_scores_gemma":[0.00034122355,0.00013775913,0.07448368,0.00009242755,0.0000015396255,0.0000014017709,0.000019815823,0.9239643,0.00023414475,0.00022298493,0.00044168913,0.000058999387],"about_ca_topic_score_codex":0.000024820649,"about_ca_topic_score_gemma":0.00024469272,"teacher_disagreement_score":0.8733275,"about_ca_system_score_codex":0.000022744778,"about_ca_system_score_gemma":0.00014069267,"threshold_uncertainty_score":0.12952073},"labels":[],"label_agreement":null},{"id":"W3196918658","doi":"10.1609/socs.v12i1.18577","title":"Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Online and offline; Online algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Computer network","score_opus":0.02999098797217792,"score_gpt":0.30331443087961174,"score_spread":0.2733234429074338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196918658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9421744,0.00005271894,0.0037973758,0.015445127,0.0053830533,0.00079431885,0.00020972536,0.00012715047,0.032016173],"genre_scores_gemma":[0.9953249,0.000054447963,0.0039948737,0.00010716575,0.000072122064,0.00000917795,0.000018356128,0.000009293291,0.0004096628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975949,0.000025252337,0.00044832984,0.00038212823,0.0013303953,0.00021898483],"domain_scores_gemma":[0.9972913,0.00017727267,0.00026835618,0.00020064208,0.0019754283,0.000086975604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813389,0.00013296067,0.00027712033,0.00026002794,0.000106272855,0.0001536602,0.0016147557,0.000067089764,0.000082692815],"category_scores_gemma":[0.00026101928,0.00010955881,0.0002571127,0.0013658175,0.000082581064,0.00026740384,0.00079127745,0.00027122485,0.0000043191394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057896446,0.0016440836,0.0038527097,0.00004214317,0.00073683535,0.0000044776375,0.0010934258,0.0019858857,0.090213716,0.89959955,0.00014228528,0.0006269934],"study_design_scores_gemma":[0.004285566,0.0004480575,0.082749456,0.0004735594,0.00022508558,0.000012717245,0.0008730922,0.39374715,0.5068745,0.0062399744,0.003503294,0.00056753535],"about_ca_topic_score_codex":0.000055602006,"about_ca_topic_score_gemma":0.0000067645697,"teacher_disagreement_score":0.8933596,"about_ca_system_score_codex":0.00015858463,"about_ca_system_score_gemma":0.00014417742,"threshold_uncertainty_score":0.44676787},"labels":[],"label_agreement":null},{"id":"W3199020031","doi":"10.48550/arxiv.2109.10380","title":"Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Computer science; Matching (statistics); Reinforcement learning; Submodular set function; Machine learning; Set (abstract data type); Code (set theory); Artificial intelligence; Feature (linguistics); Process (computing); Variety (cybernetics); Greedy algorithm; Data mining; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.10368130190836314,"score_gpt":0.2251592190344957,"score_spread":0.12147791712613257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199020031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015421432,0.000050703424,0.98086214,0.00018124741,0.00018349297,0.00047258107,0.00000309186,0.00025003924,0.0025752755],"genre_scores_gemma":[0.90665334,0.00029024598,0.08632229,0.00023379084,0.00007118089,0.000005692518,0.00024465236,0.000022884353,0.0061559365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825054,0.00013197218,0.00022941736,0.0008414699,0.00012205386,0.00042454142],"domain_scores_gemma":[0.99852943,0.00007484768,0.00021231174,0.0007261373,0.00027912066,0.0001781239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002743212,0.00025263982,0.0002991243,0.0002683831,0.00026188232,0.00035048084,0.0012019495,0.00018393513,0.00002351343],"category_scores_gemma":[0.000048305425,0.00029000491,0.00022330125,0.00053608854,0.00005901498,0.00034780146,0.0020240177,0.000533113,0.000009229515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008320009,0.000080918006,0.00009859873,0.00011768567,0.00005751546,0.000013222557,0.0011113861,0.8910027,0.000013564923,0.107211456,0.000034880028,0.0002497267],"study_design_scores_gemma":[0.00042226922,0.000053929765,0.00004515289,0.000055856664,0.000023880828,0.0000023072823,0.00040259282,0.9927093,0.00002572224,0.004943858,0.0010052513,0.0003099208],"about_ca_topic_score_codex":0.00013990313,"about_ca_topic_score_gemma":0.00003338333,"teacher_disagreement_score":0.89453983,"about_ca_system_score_codex":0.00015033175,"about_ca_system_score_gemma":0.00022483125,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W3202345783","doi":"10.4230/lipics.approx/random.2021.13","title":"Secretary Matching Meets Probing with Commitment","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Matching (statistics); Competitive analysis; Combinatorics; Knapsack problem; Secretary problem; Online algorithm; Order (exchange); Stochastic block model; Generalization; Set (abstract data type); Time complexity; Mathematics; Context (archaeology); Oracle; Matroid; Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Graph; Upper and lower bounds; Artificial intelligence","score_opus":0.016288179103186976,"score_gpt":0.2455387204149818,"score_spread":0.22925054131179481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202345783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01720513,0.00008357462,0.9662377,0.0026256873,0.000477699,0.0012164185,0.000083088446,0.00038534586,0.01168531],"genre_scores_gemma":[0.3477346,0.000111135385,0.64436024,0.0050331443,0.00011627484,0.0002621934,0.0007295569,0.00007213479,0.0015807354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975087,0.00006764115,0.0007488199,0.00032463425,0.00063210184,0.00071811007],"domain_scores_gemma":[0.99808365,0.000102553124,0.0002670375,0.00085854705,0.00042803067,0.00026019447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053243747,0.00032018675,0.0003574642,0.00016938122,0.00047428778,0.0008518506,0.0009252624,0.00011679075,0.000050858216],"category_scores_gemma":[0.000029632723,0.00026609973,0.0001396191,0.00047366938,0.00006749956,0.0021294055,0.0006017448,0.0003775616,0.00008484241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039563538,0.003325183,0.009416826,0.0057941712,0.0021294923,0.00042905207,0.18677759,0.08609556,0.0011439327,0.5434205,0.020848801,0.14022325],"study_design_scores_gemma":[0.0076162824,0.000676015,0.00039491119,0.0008291289,0.000058474903,0.00053509505,0.0032593259,0.7433062,0.004822815,0.0037295572,0.23323764,0.0015345636],"about_ca_topic_score_codex":0.000010169092,"about_ca_topic_score_gemma":0.000027449327,"teacher_disagreement_score":0.65721065,"about_ca_system_score_codex":0.00010842364,"about_ca_system_score_gemma":0.00022054849,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W3204335953","doi":"10.1109/icdcs51616.2021.00098","title":"Black Hole Search in Dynamic Rings","year":2021,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science","score_opus":0.021312122018203167,"score_gpt":0.28786546336751945,"score_spread":0.2665533413493163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204335953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029058646,0.000028694769,0.9031233,0.0061389594,0.00005687549,0.00007908496,2.9102597e-7,0.00010254512,0.061411574],"genre_scores_gemma":[0.86303556,0.000055619697,0.11135337,0.00086021033,0.0000057508432,0.0000035982605,0.000002785705,0.0000049968853,0.02467811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930274,0.000051397015,0.00009087539,0.0002022367,0.00016738512,0.0001853574],"domain_scores_gemma":[0.9995934,0.000026280299,0.0000064164396,0.00024800983,0.00006978011,0.000056134882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938685,0.000039810944,0.000054521184,0.000070141024,0.000024883984,0.0001303345,0.0002890343,0.000022672515,0.00023114184],"category_scores_gemma":[0.000018441997,0.000037701404,0.00001709977,0.0005521946,0.000021319142,0.00023168724,0.00024982484,0.000097791286,0.0002935237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043908094,0.00047827032,0.00663105,0.00007615738,0.000017155899,0.00037972623,0.0069581335,0.29235455,0.006812232,0.6124529,0.0033264146,0.070508964],"study_design_scores_gemma":[0.000188406,0.000010128143,0.0023005074,0.000006349547,1.227514e-7,0.0000017738638,0.0000656403,0.9942485,0.0011812882,0.0008221832,0.0011165529,0.00005853857],"about_ca_topic_score_codex":0.000023903396,"about_ca_topic_score_gemma":0.00009361992,"teacher_disagreement_score":0.8339769,"about_ca_system_score_codex":0.000027850292,"about_ca_system_score_gemma":0.00009519567,"threshold_uncertainty_score":0.37727514},"labels":[],"label_agreement":null},{"id":"W3209464095","doi":"10.1007/978-3-030-81843-2_22","title":"Optimal Stopping in Continuous Time","year":2021,"lang":"en","type":"book-chapter","venue":"Springer finance","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Computer science; Stopping time; Optimal stopping; Discrete time and continuous time; Subject (documents); Mathematical economics; Calculus (dental); Mathematics; Mathematical optimization; Statistics; World Wide Web","score_opus":0.016298567963908293,"score_gpt":0.2250894131726481,"score_spread":0.2087908452087398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209464095","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023674763,0.002763696,0.12804465,0.0010102012,0.0005232646,0.0004260229,0.000007551773,0.0002277541,0.86676013],"genre_scores_gemma":[0.0006013233,0.00069427176,0.083607756,0.00026486817,0.000083132516,0.000014656662,0.000009236095,0.000037648446,0.9146871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838173,0.000020159241,0.00033031733,0.00063481875,0.0002876879,0.00034525694],"domain_scores_gemma":[0.99897516,0.000040811938,0.00014519422,0.0006682694,0.00011735368,0.000053229465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023559738,0.00024100486,0.00037951232,0.00017700146,0.00005710429,0.00016533387,0.00075638806,0.00019798301,0.00024732325],"category_scores_gemma":[0.000025967583,0.0002765407,0.00009795766,0.00009787691,0.000049423157,0.00023671103,0.0005088953,0.00047575717,0.0005541092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005199973,0.000041316587,0.000053214204,0.00006915762,0.000024042914,0.0006320482,0.000321341,0.012377861,0.000094707175,0.944283,0.0018547236,0.0402434],"study_design_scores_gemma":[0.0005925217,0.00007605866,0.00035665274,0.0010196336,0.0000056463095,0.000029392322,0.0000021923809,0.09105721,0.00010063486,0.0025542658,0.903263,0.00094282866],"about_ca_topic_score_codex":0.000007910133,"about_ca_topic_score_gemma":0.0000057360203,"teacher_disagreement_score":0.9417287,"about_ca_system_score_codex":0.00008723298,"about_ca_system_score_gemma":0.00019220033,"threshold_uncertainty_score":0.99996865},"labels":[],"label_agreement":null},{"id":"W3211038545","doi":"10.1007/s10878-021-00827-w","title":"Bicriteria streaming algorithms to balance gain and cost with cardinality constraint","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Cardinality (data modeling); Constraint (computer-aided design); Theory of computation; Monotone polygon; Function (biology); Mathematical optimization; Greedy algorithm; Competitive analysis; Computer science; Extension (predicate logic); Online algorithm; Mathematics; Enumeration; Algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.015028489032291308,"score_gpt":0.2669975924391859,"score_spread":0.2519691034068946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211038545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017219719,0.00009185333,0.9950142,0.0014070938,0.001105046,0.00016450773,0.000003419279,0.000022179423,0.00046973422],"genre_scores_gemma":[0.22533621,0.0001244301,0.7740014,0.00025776148,0.00019974836,0.000004610809,0.00000586656,0.0000123980335,0.000057566976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.00019338008,0.00037866854,0.00020209185,0.00042262088,0.00018663637],"domain_scores_gemma":[0.9981088,0.00008878119,0.00023016291,0.00019574534,0.0011429727,0.00023353961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841594,0.000118067524,0.00026212676,0.00012163913,0.00010794893,0.0003802379,0.00023157116,0.000054615455,0.00001916782],"category_scores_gemma":[0.00019789216,0.00010258792,0.000040279963,0.0005478188,0.00004298592,0.0006388658,0.00010329485,0.00015810196,9.532003e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001065115,0.0002503449,0.0015079743,0.00003977941,0.0000996664,0.00023368894,0.0011514077,0.9382246,0.00078589655,0.04371228,0.00078948966,0.013098335],"study_design_scores_gemma":[0.005325137,0.001024207,0.00070083654,0.0002940381,0.000039720348,0.0007548099,0.00030057188,0.9814827,0.0033673863,0.0025686985,0.0036821617,0.0004597636],"about_ca_topic_score_codex":0.0000048403845,"about_ca_topic_score_gemma":4.6392177e-7,"teacher_disagreement_score":0.22361423,"about_ca_system_score_codex":0.00007692025,"about_ca_system_score_gemma":0.000311345,"threshold_uncertainty_score":0.4183414},"labels":[],"label_agreement":null},{"id":"W3213789197","doi":"10.1142/s1793830922500306","title":"Optimal rendezvous on a line by location-aware robots in the presence of spies*","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Robot; Competitive analysis; Computer science; Mobile robot; Set (abstract data type); Bounded function; Task (project management); Line (geometry); Algorithm; Artificial intelligence; Mathematics; Upper and lower bounds; Engineering","score_opus":0.024908221509958816,"score_gpt":0.2950486309745702,"score_spread":0.2701404094646114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213789197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032894986,0.00019933209,0.99550134,0.0025771905,0.000010143554,0.00037304743,0.00002263142,0.000022137996,0.00096523995],"genre_scores_gemma":[0.31267092,0.00061981974,0.68381256,0.0005363143,0.0000667937,0.0009483742,0.0001397092,0.000025691521,0.0011798656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990569,0.000038638762,0.00026943872,0.00023909839,0.00025882438,0.00013710443],"domain_scores_gemma":[0.9989623,0.0002113079,0.000095610325,0.0005296166,0.00015517154,0.000046002817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025785697,0.00009227872,0.00012827099,0.000045012912,0.00010657104,0.00012218748,0.00043566304,0.000036165915,0.00000781674],"category_scores_gemma":[0.00004622276,0.00006838078,0.00002585816,0.0006422995,0.00006342053,0.000108353044,0.00011436949,0.00010792375,0.0000053097706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019747777,0.00096131006,0.00003453924,0.00023658275,0.000027247932,0.0000049449436,0.0066432045,0.07761129,0.00033513876,0.8811223,0.0013161837,0.031705316],"study_design_scores_gemma":[0.00020692579,0.000051106697,0.00005423133,0.00005562154,0.000005125304,0.0000110421715,0.0007846736,0.9877337,0.0007530661,0.0086141415,0.0016164366,0.000113887174],"about_ca_topic_score_codex":0.0000090533495,"about_ca_topic_score_gemma":0.0000041423095,"teacher_disagreement_score":0.91012245,"about_ca_system_score_codex":0.000008826589,"about_ca_system_score_gemma":0.000053741842,"threshold_uncertainty_score":0.27884874},"labels":[],"label_agreement":null},{"id":"W384563215","doi":"10.1007/s10878-015-9905-7","title":"The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Travelling salesman problem; Vertex (graph theory); Operator (biology); Competitive analysis; Theory of computation; Mathematics; Graph; Path (computing); Computer science; Lin–Kernighan heuristic; Discrete mathematics; Bottleneck traveling salesman problem; Mathematical optimization; Upper and lower bounds; Algorithm","score_opus":0.018060388072599094,"score_gpt":0.25227332735515046,"score_spread":0.23421293928255135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W384563215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00521372,0.00095117086,0.8899059,0.052610796,0.013049465,0.0018443312,0.000007223044,0.00016040828,0.036256958],"genre_scores_gemma":[0.68991137,0.00042436126,0.30419257,0.0023359708,0.0014790115,0.000033066823,0.000023701688,0.00007195354,0.0015280271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983868,0.0002469119,0.00040620295,0.00013768785,0.00060817954,0.00021422096],"domain_scores_gemma":[0.99820656,0.00009427901,0.0002899582,0.00018633658,0.0008076068,0.0004152525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014630595,0.00011029005,0.00013785796,0.00019551825,0.0004874369,0.0010095721,0.00043576144,0.00008083626,0.0000049217115],"category_scores_gemma":[0.00024196763,0.000078281235,0.000034430166,0.00037741457,0.000048259637,0.0007713873,0.00005205913,0.00021504241,0.000004091057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013484691,0.00010580332,0.00020073722,0.000007715169,0.000043567226,0.000021252417,0.0025181044,0.68086433,0.00001382193,0.27965623,0.029153861,0.0072797113],"study_design_scores_gemma":[0.006566068,0.0026985416,0.00014242799,0.000112222006,0.000026169979,0.000092543334,0.00034490795,0.76628125,0.0002876274,0.02342141,0.19961804,0.00040882058],"about_ca_topic_score_codex":0.00032461327,"about_ca_topic_score_gemma":0.0002551927,"teacher_disagreement_score":0.6846976,"about_ca_system_score_codex":0.0003124518,"about_ca_system_score_gemma":0.00092071644,"threshold_uncertainty_score":0.9735327},"labels":[],"label_agreement":null},{"id":"W4205186260","doi":"10.22215/etd/2020-14107","title":"Bike Assisted Linear Search and Evacuation","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Computer science; Face (sociological concept); Search and rescue; Position (finance); Artificial intelligence; Operations research; Simulation; Engineering","score_opus":0.048388354112460216,"score_gpt":0.32639241694791205,"score_spread":0.2780040628354518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205186260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002875338,0.00033256217,0.8726139,0.0049552238,0.0007739842,0.0010701966,0.000007240539,0.0008251297,0.11654643],"genre_scores_gemma":[0.13336396,0.0014301201,0.6791262,0.0026389335,0.00041124222,0.00013074074,0.004391588,0.0001253757,0.17838183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987291,0.00008174066,0.00020099914,0.0004071729,0.0004158007,0.00016517246],"domain_scores_gemma":[0.9993701,0.0000434408,0.000044584303,0.00022599252,0.000168399,0.00014746326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000194915,0.00013701117,0.00015558672,0.0001562461,0.00010787711,0.00025778785,0.00037267088,0.00014740658,0.00010790007],"category_scores_gemma":[0.0000519741,0.00012350042,0.00003707057,0.00043028692,0.000011766926,0.0002688988,0.00007889675,0.0002479972,0.00011477666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086549655,0.0002247342,0.00017534046,0.0010418195,0.00018742612,0.000045398458,0.013556735,0.0017974698,0.0043757926,0.25372264,0.010697235,0.71408886],"study_design_scores_gemma":[0.00030288222,0.00010177836,0.0023697822,0.00004133067,0.00000740749,0.0000028438005,0.00015995611,0.9884292,0.0011779105,0.0002918425,0.0068648863,0.00025020924],"about_ca_topic_score_codex":0.000030643856,"about_ca_topic_score_gemma":0.000050631097,"teacher_disagreement_score":0.9866317,"about_ca_system_score_codex":0.00001950794,"about_ca_system_score_gemma":0.00016318735,"threshold_uncertainty_score":0.5036201},"labels":[],"label_agreement":null},{"id":"W4206869873","doi":"","title":"A semidefiinite programming relaxation for Vertex Separator Problem","year":2014,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Separator (oil production); Computer science; Vertex (graph theory); Relaxation (psychology); Mathematical optimization; Mathematics; Theoretical computer science; Physics; Thermodynamics; Graph","score_opus":0.02454861409559402,"score_gpt":0.2585117703922431,"score_spread":0.23396315629664907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206869873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015555219,0.000812754,0.9357113,0.029574994,0.00062524865,0.0026642035,0.00005390594,0.000528162,0.028473884],"genre_scores_gemma":[0.075899646,0.00061245076,0.86609197,0.00040308648,0.00007283595,0.0010694137,0.00091815344,0.000114206494,0.05481824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98724467,0.007920534,0.0012390114,0.001755501,0.00084102165,0.0009992587],"domain_scores_gemma":[0.98503196,0.003232945,0.0012786607,0.0029348552,0.006994499,0.00052710064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013933528,0.0006524126,0.0006878694,0.0003188153,0.0010353487,0.0022387318,0.0026618685,0.0006237534,0.00011466615],"category_scores_gemma":[0.0033273865,0.000735057,0.00045987798,0.0009725959,0.0003894796,0.0007306617,0.0019006231,0.0009324911,0.0002222309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018101711,0.00064928,0.00039610543,0.0006421445,0.000104807434,0.000002173201,0.012769832,0.0035116544,0.00045991738,0.7586175,0.0037149852,0.21911348],"study_design_scores_gemma":[0.0010123138,0.0000029964426,0.00031329313,0.00267278,0.00005245036,0.00001531607,0.00004694354,0.645454,0.0030604543,0.017100869,0.32958305,0.0006855523],"about_ca_topic_score_codex":0.000629923,"about_ca_topic_score_gemma":0.0007630515,"teacher_disagreement_score":0.74151665,"about_ca_system_score_codex":0.00030317827,"about_ca_system_score_gemma":0.0009509999,"threshold_uncertainty_score":0.99951005},"labels":[],"label_agreement":null},{"id":"W4211029969","doi":"10.1007/978-3-030-11072-7_18","title":"Dangerous Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Process (computing); Computer security; Node (physics); Computer network","score_opus":0.0199495572327793,"score_gpt":0.24972878476151233,"score_spread":0.22977922752873303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211029969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066793045,0.0003017063,0.9744268,0.0009276242,0.0018189609,0.00044368036,0.0000030435554,0.00020622948,0.021865273],"genre_scores_gemma":[0.016511459,0.00019391903,0.97244203,0.0045902827,0.00028989327,0.000010113341,0.000011166538,0.00006299155,0.005888142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633974,0.000034747198,0.00040917078,0.0014319447,0.0011069529,0.0006774425],"domain_scores_gemma":[0.99741167,0.0002858199,0.00019413997,0.0016375389,0.0002752635,0.0001955421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076736056,0.00042480687,0.00043126143,0.0010053767,0.00018729079,0.00070148683,0.0038601519,0.0002882886,0.00006354423],"category_scores_gemma":[0.000054157874,0.00038316502,0.00013019372,0.00075869146,0.00047473767,0.0006770635,0.0014409492,0.00078836066,0.00030945346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025401641,0.000025563178,0.000051398023,0.00004022543,0.000009860077,0.00006135382,0.0005797636,0.0805116,0.000051202172,0.18603712,0.00011747655,0.7325119],"study_design_scores_gemma":[0.00034316347,0.00021870389,0.000046397956,0.0002661818,0.0000039258694,0.00006142836,6.744174e-8,0.7477298,0.00026424773,0.2387975,0.011460217,0.000808419],"about_ca_topic_score_codex":0.000011959667,"about_ca_topic_score_gemma":0.000028382,"teacher_disagreement_score":0.73170346,"about_ca_system_score_codex":0.0001789281,"about_ca_system_score_gemma":0.0007536914,"threshold_uncertainty_score":0.999862},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011187250422149997,"score_gpt":0.2538542189076905,"score_spread":0.2426669684855405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211103781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013203289,0.0008867284,0.98185223,0.00044045874,0.00061875995,0.0005422882,0.00023061373,0.0012918945,0.00093374593],"genre_scores_gemma":[0.98985994,0.000019174578,0.008726035,0.00073847483,0.0002271854,0.000033324304,0.00029542332,0.000055149343,0.000045266028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947594,0.0013748956,0.0006749162,0.000852093,0.00074887567,0.0015898456],"domain_scores_gemma":[0.9943663,0.0033787314,0.00036428924,0.0011452644,0.00020174602,0.00054365676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023818612,0.000580209,0.000581112,0.00022833704,0.0008789849,0.0005149517,0.00189891,0.0002610869,0.00012136631],"category_scores_gemma":[0.0011919076,0.00052456313,0.00025353074,0.0011915391,0.00018177663,0.00039222985,0.0006739539,0.00065205176,0.00017647636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016920036,0.0023551548,0.0015984062,0.00014144785,0.0005165609,0.000031817017,0.0024868452,0.45529494,0.0021421164,0.1756277,0.05642716,0.30320865],"study_design_scores_gemma":[0.0022111866,0.0007209655,0.0054808743,0.0007357742,0.00016029138,0.00018503662,0.00048695,0.8843901,0.05185901,0.015442953,0.034285765,0.0040410724],"about_ca_topic_score_codex":0.000012683662,"about_ca_topic_score_gemma":7.1893453e-7,"teacher_disagreement_score":0.9766567,"about_ca_system_score_codex":0.00027147515,"about_ca_system_score_gemma":0.000087797234,"threshold_uncertainty_score":0.9997206},"labels":[],"label_agreement":null},{"id":"W4212937252","doi":"10.1080/0952813x.2021.1960630","title":"HLA: a novel hybrid model based on fixed structure and variable structure learning automata","year":2022,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Learning automata; Variable (mathematics); Dropout (neural networks); Convergence (economics); Automaton; Artificial intelligence; Artificial neural network; Margin (machine learning); Stability (learning theory); Machine learning; Mathematics","score_opus":0.022573203067814802,"score_gpt":0.2877095505486438,"score_spread":0.265136347480829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212937252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042789124,0.00005347883,0.9554714,0.0008097663,0.00030833445,0.00015275815,0.000024343783,0.00004084219,0.00034997799],"genre_scores_gemma":[0.8993683,0.0000027267886,0.09992583,0.0006119294,0.000052328956,0.0000037791197,0.0000036080703,0.00001412568,0.000017404856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781835,0.00020446017,0.00052207615,0.0003163732,0.0008326072,0.00030610414],"domain_scores_gemma":[0.99899423,0.00018989186,0.00022144,0.00024631448,0.00013350531,0.00021463915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055272557,0.0001861583,0.00024761035,0.00017507575,0.00044520496,0.00025415563,0.00078149646,0.00004794305,0.0010339572],"category_scores_gemma":[0.000158925,0.00015683714,0.000077660945,0.0003230066,0.00026163532,0.00028786642,0.00041318045,0.0008225659,0.0000022513068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009713178,0.00015652385,0.0000032735738,0.0000024277333,0.000007471019,0.000011651569,0.00042093347,0.45192674,0.06482437,0.4810418,0.000021644402,0.0014860578],"study_design_scores_gemma":[0.00011012227,0.0007384844,0.0000012205811,0.000014820251,0.000004575524,0.00009200809,0.0002465742,0.7768483,0.1347353,0.087012045,0.000061362916,0.00013519017],"about_ca_topic_score_codex":0.000002398632,"about_ca_topic_score_gemma":9.792501e-8,"teacher_disagreement_score":0.8565791,"about_ca_system_score_codex":0.000115814546,"about_ca_system_score_gemma":0.00016697409,"threshold_uncertainty_score":0.99987924},"labels":[],"label_agreement":null},{"id":"W4213412735","doi":"10.1182/blood.2021014936","title":"Clearing NETs with T-series resolvins","year":2021,"lang":"en","type":"letter","venue":"Blood","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Clearing; Series (stratigraphy); Computer science; Biology; Business","score_opus":0.020455928698242663,"score_gpt":0.21445348321539798,"score_spread":0.1939975545171553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213412735","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007183798,0.0004365003,0.07036546,0.9008452,0.0003497605,0.00029044304,0.000006571027,0.00047203523,0.027162163],"genre_scores_gemma":[0.00017503748,0.00023216844,0.2429738,0.72341377,0.0013826299,0.000053796422,0.00013431063,0.00008170359,0.031552788],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850625,0.00008862151,0.0001521926,0.0004745936,0.0004203875,0.000357948],"domain_scores_gemma":[0.9989644,0.000039301347,0.000073219286,0.00073801883,0.000129504,0.00005554204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009115196,0.00017784633,0.00020084578,0.00009708091,0.00012191817,0.0005577795,0.0007858654,0.00022942097,0.00006862756],"category_scores_gemma":[0.000020545509,0.00015167537,0.000050417257,0.0003207005,0.000044454562,0.0003311438,0.00035007772,0.00084890384,0.00005010669],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020886735,0.000083146326,0.00013607304,0.00011269054,0.000110043016,0.0025110608,0.0004344006,0.00011803152,0.000028103861,0.0028598644,0.9927964,0.000808074],"study_design_scores_gemma":[0.00044056633,0.00012132443,0.000041811945,0.00012267477,0.00001546596,0.00017366037,0.0000066435123,0.00060081587,0.00030758642,0.0001408622,0.99774176,0.00028685544],"about_ca_topic_score_codex":0.00001532819,"about_ca_topic_score_gemma":0.00001591142,"teacher_disagreement_score":0.17743146,"about_ca_system_score_codex":0.000011899193,"about_ca_system_score_gemma":0.00019759848,"threshold_uncertainty_score":0.6185142},"labels":[],"label_agreement":null},{"id":"W4214735731","doi":"10.1145/3410048.3410055","title":"Mechanism Design for Online Resource Allocation","year":2020,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Knapsack problem; Competitive analysis; Computer science; Valuation (finance); Payment; Incentive compatibility; Mechanism design; Resource allocation; Incentive; Function (biology); Resource (disambiguation); Mathematical optimization; Online algorithm; Allocative efficiency; Operations research; Microeconomics; Business; Economics; Mathematics","score_opus":0.24251252593777176,"score_gpt":0.37313752467782335,"score_spread":0.1306249987400516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214735731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012324487,0.011590114,0.9628781,0.022343043,0.00009920439,0.0026585194,0.0000036412935,0.00014611338,0.00015799647],"genre_scores_gemma":[0.016038109,0.061301816,0.89530987,0.026183443,0.00016046842,0.00063572766,0.00022050789,0.000029809784,0.00012027967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975415,0.00030203722,0.0005154841,0.00044321507,0.00094547094,0.0002523075],"domain_scores_gemma":[0.99754375,0.0004030069,0.00025662227,0.0007035085,0.0009308106,0.00016232881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042245616,0.00015619748,0.00025513957,0.0001903819,0.00017402532,0.00010187116,0.0012696938,0.00005895583,0.00009468983],"category_scores_gemma":[0.0064931833,0.0001430209,0.00008037289,0.00283284,0.000013930534,0.00068978453,0.00021235907,0.00013387892,0.00010700748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008394537,0.00007019065,0.000014443391,0.001156962,0.000018739745,2.0184801e-7,0.00018654877,0.022382382,0.00010199553,0.0075096553,0.01862681,0.9499237],"study_design_scores_gemma":[0.00047255945,0.00028750996,0.00004832922,0.00026210837,0.000039307553,0.0000014047563,0.0000042473553,0.9409015,0.00042313608,0.0007084925,0.056679633,0.00017175959],"about_ca_topic_score_codex":4.511307e-7,"about_ca_topic_score_gemma":1.2067585e-7,"teacher_disagreement_score":0.9497519,"about_ca_system_score_codex":0.00008301497,"about_ca_system_score_gemma":0.00026631562,"threshold_uncertainty_score":0.7773416},"labels":[],"label_agreement":null},{"id":"W4221140790","doi":"10.4230/lipics.fsttcs.2021.9","title":"Approximation Algorithms for Flexible Graph Connectivity","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematics; Partition (number theory); Graph; Undirected graph; Efficient algorithm; Algorithm; Discrete mathematics","score_opus":0.1280277299512267,"score_gpt":0.22609555582565563,"score_spread":0.09806782587442894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221140790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086573325,0.000039101964,0.9878636,0.00019144372,0.00052499794,0.00065594254,0.000017384315,0.0003990873,0.0016510997],"genre_scores_gemma":[0.8979012,0.0001616199,0.09943159,0.0001430434,0.000062797444,0.000010502267,0.00012031835,0.000020181033,0.0021487726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982397,0.00014983304,0.00016609029,0.0010231016,0.00010069022,0.00032056394],"domain_scores_gemma":[0.998209,0.00014081987,0.0001781269,0.0008854783,0.00043912625,0.00014744284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000405062,0.00022144035,0.0002773294,0.00025927636,0.00021404166,0.00032076237,0.0010325252,0.00023903612,0.00002804444],"category_scores_gemma":[0.00006672843,0.00026922912,0.00023667619,0.0007079324,0.000063749656,0.0006237886,0.001085747,0.00033311243,0.000012793587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013822299,0.00017201662,0.00022327308,0.00018290302,0.00008675517,0.00003155158,0.00036350585,0.6403995,0.000041676234,0.35546866,0.00037988467,0.0026364177],"study_design_scores_gemma":[0.0004976362,0.000041614687,0.00011956469,0.00004470566,0.000019563766,0.0000018866203,0.00007510378,0.9335122,0.00045661733,0.06463597,0.00029740026,0.0002977529],"about_ca_topic_score_codex":0.00006186685,"about_ca_topic_score_gemma":0.000020050073,"teacher_disagreement_score":0.88924384,"about_ca_system_score_codex":0.00013310148,"about_ca_system_score_gemma":0.00028698464,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W4225425583","doi":"10.32473/flairs.v35i.130850","title":"Learning Automata with Artificial Reflecting Barriers in Games with Limited Information","year":2022,"lang":"en","type":"article","venue":"Proceedings of the ... International Florida Artificial Intelligence Research Society Conference","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nash equilibrium; Computer science; Game theory; Reinforcement learning; Fictitious play; Complete information; Perfect information; Learning automata; Mathematical economics; Point (geometry); Saddle point; Artificial intelligence; Automaton; Mathematics","score_opus":0.09331720338213315,"score_gpt":0.3458034193125344,"score_spread":0.2524862159304012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225425583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7212794,0.000028139038,0.21078044,0.03778448,0.0010595494,0.0026667058,0.000031663578,0.0005220464,0.025847588],"genre_scores_gemma":[0.9908398,0.000037778183,0.008495878,0.00013188824,0.00005631296,0.00018840881,0.0000065452214,0.000012584044,0.00023080061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582106,0.00009778232,0.00058274536,0.00043349582,0.002508427,0.00055651803],"domain_scores_gemma":[0.9968515,0.00026677613,0.00031390894,0.00021098464,0.0022275844,0.00012923536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003353915,0.00017685042,0.00019187537,0.0003605072,0.00094922073,0.00082051085,0.0025829356,0.000058257952,0.00013881728],"category_scores_gemma":[0.0009345421,0.00013611678,0.00008933832,0.0026362645,0.0003722953,0.0018846503,0.0013462539,0.0014004044,0.0000100834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000575042,0.00021348498,0.008321437,0.00011034206,0.00013815615,0.000003470503,0.047433775,0.11095051,0.013345167,0.7679871,0.0007758148,0.05014572],"study_design_scores_gemma":[0.00012809064,0.0005612353,0.0002162333,0.00014044873,0.0000038913045,0.000016759524,0.04064172,0.91164166,0.028391795,0.016242277,0.0017669266,0.00024898362],"about_ca_topic_score_codex":0.00021835837,"about_ca_topic_score_gemma":0.00003426434,"teacher_disagreement_score":0.8006911,"about_ca_system_score_codex":0.00042262624,"about_ca_system_score_gemma":0.000732037,"threshold_uncertainty_score":0.7912205},"labels":[],"label_agreement":null},{"id":"W4225983316","doi":"10.1007/978-3-030-99826-4_17","title":"A K-Means Clustering Approach to Segmentation of Maps for Task Allocation in Multi-robot Systems Exploration of Unknown Environments","year":2022,"lang":"en","type":"book-chapter","venue":"Mechanisms and machine science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cluster analysis; Task (project management); Robot; Computer science; Segmentation; Artificial intelligence; Computer vision; Engineering; Systems engineering","score_opus":0.062276374658030466,"score_gpt":0.2708583085654845,"score_spread":0.20858193390745403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225983316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004506986,0.000049586775,0.9960465,0.00008488595,0.00018932024,0.0013933864,0.000038509697,0.00001436823,0.0021789751],"genre_scores_gemma":[0.03853312,0.00022450721,0.94608366,0.0000799822,0.000012068964,0.00038792694,0.00014381576,0.000030319376,0.014504594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982762,0.000032550462,0.0004262286,0.00053226936,0.0005505142,0.0001822542],"domain_scores_gemma":[0.9992512,0.000024260087,0.0002829555,0.00029506045,0.000064891974,0.00008166311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011502794,0.00015958532,0.00024246195,0.0004927522,0.0001414159,0.000069979505,0.0005195027,0.000051966294,0.0000050014164],"category_scores_gemma":[0.000020889514,0.00015863658,0.000033166743,0.0002088305,0.00006653207,0.000710254,0.0003971232,0.00009498199,7.762859e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010836692,0.00007876545,8.8208884e-7,0.00017854635,0.000006097438,2.9483846e-7,0.0019565711,0.34332073,0.035463437,0.6110973,0.000004773865,0.007881762],"study_design_scores_gemma":[0.00047521738,0.00027143612,0.000005090379,0.00007071441,0.0000061136907,0.0000022469749,0.000098142875,0.9933453,0.0013258122,0.0033012368,0.00092452107,0.00017414575],"about_ca_topic_score_codex":0.000065083324,"about_ca_topic_score_gemma":0.000019321555,"teacher_disagreement_score":0.6500246,"about_ca_system_score_codex":0.00011108982,"about_ca_system_score_gemma":0.00007946316,"threshold_uncertainty_score":0.6469012},"labels":[],"label_agreement":null},{"id":"W4226066396","doi":"10.1093/sysbio/syac028","title":"A Linear Time Solution to the Labeled Robinson–Foulds Distance Problem","year":2022,"lang":"en","type":"article","venue":"Systematic Biology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Biology; Mathematics","score_opus":0.016788876269763293,"score_gpt":0.2589924925464515,"score_spread":0.2422036162766882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226066396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009863307,0.00018435462,0.98472315,0.01121612,0.00026920054,0.0018136982,0.000009032985,0.00017422019,0.0006238818],"genre_scores_gemma":[0.9387049,0.0000025540187,0.055878464,0.0016248514,0.000046225174,0.0014366222,0.000014792645,0.000011634069,0.0022799298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781924,0.0010327153,0.00036670585,0.00030175093,0.00019181737,0.00028776802],"domain_scores_gemma":[0.99899054,0.00012606986,0.00014043052,0.00059454126,0.00008318643,0.00006526374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551137,0.00010181435,0.0002439489,0.00007864892,0.00041476538,0.000059389604,0.0010916038,0.00003864598,0.00007691085],"category_scores_gemma":[0.000091399364,0.0000657424,0.000048990034,0.0005661971,0.00003108561,0.00006807828,0.00076187693,0.00016649645,0.00033308647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038688257,0.0003606292,0.00035507977,0.006700948,0.00018726464,0.000013908361,0.013824934,0.1231318,0.009754062,0.8309602,0.013702405,0.00097008917],"study_design_scores_gemma":[0.00026393484,0.00027802426,0.000013918396,0.00016939668,0.000006781973,0.000031923395,0.00007933761,0.9918888,0.00004311676,0.0034557916,0.0036088454,0.00016009744],"about_ca_topic_score_codex":0.00001556246,"about_ca_topic_score_gemma":0.000009039986,"teacher_disagreement_score":0.9377186,"about_ca_system_score_codex":0.000089276684,"about_ca_system_score_gemma":0.00007323434,"threshold_uncertainty_score":0.4281264},"labels":[],"label_agreement":null},{"id":"W4226474270","doi":"10.1007/978-3-030-96731-4_18","title":"Machine Learning Advised Ski Rental Problem with a Discount","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Oracle; Online machine learning; Online algorithm; Context (archaeology); Online learning; Renting; Algorithm; Active learning (machine learning)","score_opus":0.011572906254450168,"score_gpt":0.23349785847203353,"score_spread":0.22192495221758335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226474270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008133739,0.0002302041,0.9829293,0.0014886366,0.00041637363,0.00062515674,0.000006746263,0.00025409446,0.014041359],"genre_scores_gemma":[0.07940688,0.00019530051,0.91426766,0.0016448433,0.00025446867,0.00007446407,0.00006585631,0.00010159816,0.0039889463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955536,0.00008192673,0.00044044526,0.0015637774,0.0016422435,0.00071796915],"domain_scores_gemma":[0.99817747,0.00019867385,0.00029434267,0.00094081444,0.00017319946,0.00021551028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090531784,0.00050230493,0.00044672098,0.0007863322,0.000637939,0.00090729527,0.002939467,0.00013215531,0.0002826013],"category_scores_gemma":[0.000031261927,0.00040709053,0.00009614542,0.0009237084,0.0006508328,0.00089804805,0.0020625961,0.0015679988,0.000027952494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021818829,0.00007082664,0.00020864062,0.00005716209,0.000020428182,0.00018873287,0.00181682,0.70170915,0.000032259093,0.07908471,0.000018379811,0.2167711],"study_design_scores_gemma":[0.00054233207,0.000651813,0.000027203901,0.00021841137,0.000005772612,0.00013354246,4.0328354e-7,0.95668304,0.00005485433,0.02273536,0.018250527,0.0006967601],"about_ca_topic_score_codex":0.000055083354,"about_ca_topic_score_gemma":0.00007742434,"teacher_disagreement_score":0.2549739,"about_ca_system_score_codex":0.00042188744,"about_ca_system_score_gemma":0.00072740397,"threshold_uncertainty_score":0.9998381},"labels":[],"label_agreement":null},{"id":"W4229801721","doi":"10.22215/etd/2005-10780","title":"Intruder capture by mobile agents in mesh topologies","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Network topology; Computer science; Computer network; Topology (electrical circuits); Electrical engineering; Engineering","score_opus":0.018066465929945815,"score_gpt":0.31253940747510495,"score_spread":0.29447294154515913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229801721","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152396485,0.0032226513,0.099260926,0.0035747297,0.0033929695,0.0030209653,0.000030991807,0.001331737,0.87092537],"genre_scores_gemma":[0.16768639,0.0024786005,0.06311733,0.0031749508,0.00013204473,0.0005813496,0.0020211008,0.00006469262,0.76074356],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988069,0.00005349439,0.00023941102,0.00037539966,0.00026797582,0.0002568163],"domain_scores_gemma":[0.9994448,0.000028533153,0.00007222718,0.00031678934,0.00007768881,0.000060000064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012385564,0.00016924484,0.00018397192,0.00016878634,0.000044976103,0.00016890497,0.0007731535,0.00025538282,0.00086991675],"category_scores_gemma":[0.000023568542,0.00014568216,0.000043424505,0.00029925685,0.000015137687,0.000313984,0.000075608594,0.00028212703,0.00011217861],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022196853,0.00050121103,0.00052305876,0.0001784641,0.00006283744,0.00004213397,0.015256551,0.007875725,0.00020908409,0.0545427,0.75679064,0.16399537],"study_design_scores_gemma":[0.003993144,0.0005684796,0.0056086928,0.00045125524,0.00003095752,0.000018635665,0.018157195,0.36676002,0.0106339855,0.007775381,0.5815579,0.0044443477],"about_ca_topic_score_codex":0.0001332386,"about_ca_topic_score_gemma":0.00087308534,"teacher_disagreement_score":0.35888427,"about_ca_system_score_codex":0.00006114575,"about_ca_system_score_gemma":0.00009078538,"threshold_uncertainty_score":0.95249784},"labels":[],"label_agreement":null},{"id":"W4230517044","doi":"10.1007/978-3-030-11072-7_4","title":"Gathering","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Robot; Focus (optics); Visibility; Convergence (economics); Point (geometry); Plane (geometry); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics; Geometry; Physics","score_opus":0.021054986344928115,"score_gpt":0.25062823023311026,"score_spread":0.22957324388818215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230517044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006297417,0.00018721077,0.9704391,0.0007756341,0.0013389444,0.0003275581,0.0000013102206,0.00017141525,0.02675258],"genre_scores_gemma":[0.024015656,0.00012017912,0.9658035,0.0029052994,0.0003701363,0.000006666583,0.000004333187,0.000056623867,0.006717606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704665,0.000022019598,0.00033953987,0.0011658976,0.0008620355,0.00056386454],"domain_scores_gemma":[0.9979857,0.00022001604,0.00015026327,0.001307335,0.00018767329,0.0001489765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006926534,0.00034230502,0.00034631015,0.0006313659,0.00014733015,0.00061527116,0.0031677769,0.00021559463,0.00007590197],"category_scores_gemma":[0.000045427103,0.00031201044,0.000093929186,0.0004704614,0.00030257943,0.00060471223,0.0013854969,0.00064567244,0.00031143194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017445698,0.000016270757,0.00003681562,0.000039468956,0.00000704629,0.000040244202,0.0006293608,0.22477278,0.00009925784,0.10275544,0.000032924276,0.67156863],"study_design_scores_gemma":[0.00018214765,0.00009516854,0.000026665628,0.0002193761,0.0000015507145,0.000027447706,4.1234784e-8,0.91779435,0.0002971344,0.07468617,0.006207171,0.00046278606],"about_ca_topic_score_codex":0.000006684389,"about_ca_topic_score_gemma":0.000014475294,"teacher_disagreement_score":0.69302154,"about_ca_system_score_codex":0.00019115764,"about_ca_system_score_gemma":0.0006506368,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W4230892244","doi":"10.32920/ryerson.14655639.v1","title":"Scatter Search on a Disk","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Robot; Upper and lower bounds; Carry (investment); Unit disk; Object (grammar); Computer science; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.048902244932385895,"score_gpt":0.30631048598973365,"score_spread":0.2574082410573478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230892244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009708675,0.000030601648,0.9140017,0.024812829,0.00044367442,0.00023875404,0.0000017689262,0.0002157875,0.059284016],"genre_scores_gemma":[0.3471379,0.00036965718,0.56508523,0.04137327,0.00019153312,0.00015315613,0.00011623003,0.00005203152,0.04552099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830705,0.0001395335,0.00015975998,0.0006404433,0.0004911669,0.00026206582],"domain_scores_gemma":[0.99853545,0.000052544598,0.00002708619,0.0010984977,0.00015845537,0.00012797175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029677455,0.00014285426,0.00015489415,0.00013204983,0.00006507723,0.0009100904,0.0011610865,0.000104928105,0.00066900527],"category_scores_gemma":[0.000018544313,0.00011973813,0.000096986165,0.00020325581,0.000026419644,0.00012873494,0.0027039563,0.00058483426,0.00034869942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014503115,0.0011913228,0.0013690036,0.00044938654,0.00024487922,0.00027994273,0.007242062,0.31414843,0.00026413074,0.2963008,0.195115,0.18338053],"study_design_scores_gemma":[0.0002945166,0.00007696555,0.00086886244,0.00019631881,0.000002757694,0.000006439689,0.000056574623,0.98279196,0.0015977294,0.0019734877,0.011608469,0.0005259135],"about_ca_topic_score_codex":0.000052310184,"about_ca_topic_score_gemma":0.00000838496,"teacher_disagreement_score":0.66864353,"about_ca_system_score_codex":0.00004431719,"about_ca_system_score_gemma":0.00024255228,"threshold_uncertainty_score":0.8776023},"labels":[],"label_agreement":null},{"id":"W4232099961","doi":"10.1007/978-1-4939-2864-4_13","title":"Alternative Performance Measures in Online Algorithms","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","score_opus":0.026556741903097224,"score_gpt":0.26092038490884345,"score_spread":0.23436364300574622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232099961","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018225528,0.0007929783,0.28085503,0.00047723347,0.0011416948,0.0005718447,0.00012943776,0.00013581861,0.7158777],"genre_scores_gemma":[0.00037447957,0.0372746,0.19259514,0.0002270878,0.0010490813,0.000049609633,0.00007578947,0.00013409897,0.7682201],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672294,0.000058097943,0.0008664202,0.00080200005,0.0010508276,0.0004996914],"domain_scores_gemma":[0.99794704,0.0001654249,0.00045283977,0.00083776354,0.0004023547,0.00019457607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985413,0.00049227756,0.0006698439,0.0006481605,0.000064856686,0.000048601058,0.0016627283,0.00032785584,0.00020961018],"category_scores_gemma":[0.00005837773,0.00040576817,0.00016916022,0.00016986171,0.00019241417,0.00062723446,0.00049789896,0.00058990787,0.00015329734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009629685,0.000109880384,0.000053483218,0.00006397547,0.00007164438,0.00005623989,0.0006699032,0.00056897517,0.000003878655,0.05656978,0.0004949784,0.94132763],"study_design_scores_gemma":[0.0028464114,0.0008825802,0.00045692333,0.0019159098,0.000034809033,0.000042890708,0.000020777368,0.17717797,0.00017433905,0.057643995,0.75673074,0.0020726547],"about_ca_topic_score_codex":0.000032072396,"about_ca_topic_score_gemma":0.000024095,"teacher_disagreement_score":0.939255,"about_ca_system_score_codex":0.00015264009,"about_ca_system_score_gemma":0.00034504134,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W4233380038","doi":"10.2139/ssrn.1991202","title":"A Markov Switching Approach to Herding","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Balsillie School of International Affairs","funders":"","keywords":"Herding; Markov chain; Business; Computer science; Mathematics; Statistics; Geography","score_opus":0.014750449262290721,"score_gpt":0.25488388603816997,"score_spread":0.24013343677587926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233380038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040381337,0.0005738112,0.98133826,0.0010540766,0.00020203013,0.00010760935,7.111915e-8,0.0000681631,0.012617857],"genre_scores_gemma":[0.9212347,0.00020653039,0.076648094,0.0004395148,0.0002865975,0.0000068608824,3.8058556e-7,0.000013174315,0.0011640979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966827,0.00010960288,0.0001835186,0.00016136596,0.00031457562,0.0025482525],"domain_scores_gemma":[0.99938077,0.000024921257,0.00006221867,0.0002075025,0.000056181438,0.00026838848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030602105,0.000104539584,0.000107733526,0.00016504244,0.0002822065,0.000230387,0.0006945694,0.000037293223,0.000007351065],"category_scores_gemma":[0.000048867416,0.000089292254,0.00006265811,0.00041974802,0.0000058703454,0.000931239,0.0001613254,0.0010790046,0.00006844301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060557495,0.00011545462,0.0010931123,0.00000421364,0.00004463409,5.196347e-7,0.0017602398,0.0012323109,0.00037628546,0.88143045,0.00028810767,0.113648646],"study_design_scores_gemma":[0.00426758,0.0013326608,0.0036167079,0.00014735304,0.000055783737,0.008221612,0.007886569,0.4777406,0.0006933311,0.43707877,0.05614073,0.0028182988],"about_ca_topic_score_codex":0.000008959087,"about_ca_topic_score_gemma":0.0000059540043,"teacher_disagreement_score":0.91719663,"about_ca_system_score_codex":0.00045597975,"about_ca_system_score_gemma":0.00055654487,"threshold_uncertainty_score":0.4687798},"labels":[],"label_agreement":null},{"id":"W4233810285","doi":"10.1007/978-3-540-69052-8_37","title":"A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Web Polling","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polling; Computer science; Knapsack problem; Learning automata; Resource allocation; Automaton; Hierarchy; Convergence (economics); Theoretical computer science; Algorithm; Computer network","score_opus":0.02209309194474442,"score_gpt":0.26533987824354915,"score_spread":0.24324678629880472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233810285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014168254,0.00024511802,0.99280643,0.0012724971,0.00037070524,0.0004169844,0.000005424462,0.00022001598,0.0045211166],"genre_scores_gemma":[0.12365104,0.00018956976,0.8742513,0.0008703965,0.00023124492,0.0000089272025,0.000017155371,0.000044798435,0.0007355649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956826,0.00006561452,0.0008755488,0.0012663953,0.0013763253,0.0007335091],"domain_scores_gemma":[0.99713236,0.00038812982,0.0005739015,0.0013217033,0.00037258747,0.00021129011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014367071,0.00041455566,0.0005209435,0.0011857521,0.00030274276,0.00030512534,0.0032248783,0.00027223455,0.000024005329],"category_scores_gemma":[0.00017310145,0.00040496618,0.00014174943,0.0009581106,0.00070677284,0.00069595664,0.0013875109,0.00072648376,0.000018126453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000964701,0.00006043361,0.000041842613,0.0000905048,0.000017743583,0.0000799893,0.0030856093,0.6070144,0.00059594715,0.01873957,0.00015276548,0.37011153],"study_design_scores_gemma":[0.00030239235,0.0001599497,0.00001903113,0.0003258897,0.0000037992058,0.00008224543,3.5524027e-7,0.9902055,0.0014058748,0.0035314676,0.0035502655,0.00041317602],"about_ca_topic_score_codex":0.000016582628,"about_ca_topic_score_gemma":0.000011760543,"teacher_disagreement_score":0.3831911,"about_ca_system_score_codex":0.00019772485,"about_ca_system_score_gemma":0.0011604654,"threshold_uncertainty_score":0.9998402},"labels":[],"label_agreement":null},{"id":"W4233877251","doi":"10.1109/dac.2014.6881419","title":"A cost efficient online algorithm for automotive idling reduction","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robustness (evolution); Automotive industry; Reduction (mathematics); Competitive analysis; Computer science; Running time; Cost reduction; Algorithm; Mathematics; Engineering; Upper and lower bounds","score_opus":0.038916290497158425,"score_gpt":0.30943502974765885,"score_spread":0.2705187392505004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233877251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023425362,0.000004380331,0.9964006,0.0015078894,0.00028135578,0.00036113514,0.0000029207645,0.0002225491,0.0009849261],"genre_scores_gemma":[0.01474807,0.0000025305435,0.9833475,0.00033470246,0.0001093976,0.000030586787,0.00001398285,0.0000059602576,0.0014072654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927753,0.000038459926,0.00012589047,0.00023315455,0.0001417648,0.00018317271],"domain_scores_gemma":[0.99940836,0.000055328106,0.00003625858,0.00018847999,0.00023802239,0.00007356895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034744243,0.00006224371,0.000073309566,0.00007482105,0.00011648092,0.000095016985,0.00023302194,0.000028600047,0.000015342035],"category_scores_gemma":[0.0000626248,0.00005265196,0.000035500318,0.00021112226,0.000019283436,0.00011887791,0.00006890596,0.000053484608,0.00002134947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013895769,0.00018274404,0.000002413892,0.000006638807,0.000007885987,2.0009512e-7,0.0006224766,0.123663925,0.00015232647,0.037189238,0.001270399,0.83690035],"study_design_scores_gemma":[0.0003277277,0.00006758679,0.000024896874,0.000006514831,0.0000012122039,0.0000035618084,0.000042095526,0.9935981,0.0009865802,0.00055122434,0.0043182513,0.000072215924],"about_ca_topic_score_codex":0.0000070855385,"about_ca_topic_score_gemma":0.000001644247,"teacher_disagreement_score":0.8699342,"about_ca_system_score_codex":0.00003076648,"about_ca_system_score_gemma":0.000032535794,"threshold_uncertainty_score":0.21470846},"labels":[],"label_agreement":null},{"id":"W4234150660","doi":"10.1007/978-3-642-21827-9_53","title":"The Bayesian Pursuit Algorithm: A New Family of Estimator Learning Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Learning automata; Computer science; Prior probability; Bayesian probability; Estimator; Conjugate prior; Artificial intelligence; Algorithm; Machine learning; Mathematical optimization; Automaton; Mathematics; Statistics","score_opus":0.02299867247613641,"score_gpt":0.253557143766679,"score_spread":0.23055847129054258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234150660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.09501e-7,0.00050166534,0.990771,0.0009633013,0.00094114477,0.00037051976,0.0000018116143,0.00019587846,0.006253751],"genre_scores_gemma":[0.002940835,0.00023682175,0.993506,0.00046333135,0.00018751924,0.0000070306637,0.000003042992,0.000038027272,0.002617381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996389,0.00006713718,0.00059056777,0.0010193273,0.0012644372,0.0006695388],"domain_scores_gemma":[0.9971602,0.00052973226,0.00039449366,0.0013445171,0.0003052625,0.00026580444],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013870241,0.0004039899,0.00043328514,0.00049471855,0.0004901078,0.0007108674,0.0054285442,0.00023398847,0.000023757824],"category_scores_gemma":[0.00016859092,0.0003014252,0.00012752901,0.00068024,0.0007877776,0.00053959625,0.0017648312,0.0008971847,0.000039972776],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002334874,0.0000128359325,0.00000977801,0.000011663283,0.000009850635,0.000016200844,0.0006269933,0.030772738,0.000022847527,0.029721742,0.00008884966,0.9387042],"study_design_scores_gemma":[0.0002060324,0.0001875995,0.000052616902,0.00019732417,0.0000041922367,0.000023902912,2.4444174e-7,0.88854855,0.0001541932,0.10421575,0.006088164,0.00032142043],"about_ca_topic_score_codex":0.00006718778,"about_ca_topic_score_gemma":0.00002092513,"teacher_disagreement_score":0.93838274,"about_ca_system_score_codex":0.00011525901,"about_ca_system_score_gemma":0.0012515577,"threshold_uncertainty_score":0.99995255},"labels":[],"label_agreement":null},{"id":"W4236061504","doi":"10.32920/ryerson.14663754","title":"Worst-case &amp; average-case Efficiency trade-offs for search problems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Operations research; Unit (ring theory); Work (physics); Mathematics; Engineering","score_opus":0.07756221973192895,"score_gpt":0.3166777557122791,"score_spread":0.23911553598035012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236061504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025816613,0.00027330234,0.9861391,0.0033090222,0.00088863727,0.0028058344,0.000040651863,0.0005669519,0.0033948254],"genre_scores_gemma":[0.2779088,0.00015172077,0.70993626,0.00088463654,0.00023590856,0.0008058528,0.0002185517,0.00008853911,0.009769742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953604,0.00031505805,0.0007975122,0.0017812169,0.0007442003,0.0010016545],"domain_scores_gemma":[0.9964027,0.0004182362,0.00017527357,0.0020094728,0.0004779312,0.0005163955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017565927,0.0005244331,0.0005787866,0.00042399543,0.00055801653,0.0020271225,0.0016211121,0.00044924815,0.00039449095],"category_scores_gemma":[0.00018100276,0.0004844394,0.00042515429,0.0008256614,0.00009096725,0.00045059953,0.002651427,0.0011035163,0.00007227633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028477387,0.0019318144,0.00005386834,0.0030851732,0.000290699,0.017311001,0.021147795,0.8169855,0.000222721,0.06527095,0.008527177,0.06514482],"study_design_scores_gemma":[0.000840193,0.00011562901,0.0000030747574,0.00016148631,0.000017845958,0.008305556,0.00017933379,0.9814701,0.000228224,0.0017357882,0.00617282,0.0007699567],"about_ca_topic_score_codex":0.0002531124,"about_ca_topic_score_gemma":0.0003624823,"teacher_disagreement_score":0.27620286,"about_ca_system_score_codex":0.00015058034,"about_ca_system_score_gemma":0.0009141671,"threshold_uncertainty_score":0.99976075},"labels":[],"label_agreement":null},{"id":"W4237149507","doi":"10.1002/9780470072646.index","title":"Index","year":2006,"lang":"en","type":"paratext","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Index (typography); Computer science; Citation; Library science; World Wide Web; Information retrieval","score_opus":0.017499289438198014,"score_gpt":0.27008478481119047,"score_spread":0.25258549537299246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237149507","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6428065e-8,0.00007003266,0.5006277,0.00031695422,0.0005244148,0.000059699825,0.0000015541877,0.000051379753,0.4983482],"genre_scores_gemma":[0.00015377409,0.000063757354,0.03272195,0.00067592436,0.00012531175,0.000010695225,0.000055292494,0.000008984104,0.9661843],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990749,0.00003396772,0.00014949909,0.00028995943,0.00024613374,0.00020558888],"domain_scores_gemma":[0.99935275,0.000019884901,0.000049375463,0.00043938943,0.0000791637,0.00005940874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008092668,0.000119742246,0.00013195224,0.00013783971,0.00005044547,0.00027852942,0.0008936323,0.00015491663,0.00436748],"category_scores_gemma":[0.0000032132152,0.00009988189,0.000048180435,0.00026260727,0.000017434975,0.00016352025,0.00024281713,0.00019369963,0.027329406],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2283338e-7,0.00001185858,0.000001936916,0.000008303102,0.0000031539214,0.0000011585189,0.000007505754,0.0041654184,6.4733325e-7,0.010211586,0.982796,0.0027923177],"study_design_scores_gemma":[0.00007808349,0.000010805546,0.000008996186,0.000008301368,3.7333862e-7,0.0000014655978,3.9810234e-7,0.093125224,0.000016216463,0.0003039963,0.90631044,0.0001356799],"about_ca_topic_score_codex":0.000101082216,"about_ca_topic_score_gemma":0.000009745915,"teacher_disagreement_score":0.46790573,"about_ca_system_score_codex":0.000023588163,"about_ca_system_score_gemma":0.00014131778,"threshold_uncertainty_score":0.9965427},"labels":[],"label_agreement":null},{"id":"W4237945925","doi":"10.1007/978-1-4939-7131-2_100995","title":"Resource Exchange Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Resource (disambiguation); Computer science; Computer network","score_opus":0.03127369159726002,"score_gpt":0.23879429922195078,"score_spread":0.20752060762469077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237945925","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.842048e-9,0.00011709736,0.45328945,0.00036437024,0.00012227638,0.00009952407,6.133456e-7,0.00017525474,0.54583144],"genre_scores_gemma":[0.0000053690974,0.00021113426,0.031089209,0.0018481588,0.00039688905,0.000004601843,0.00001485948,0.000025550728,0.9664042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998839,0.000017236966,0.0001854557,0.0004209643,0.00028961667,0.00024771682],"domain_scores_gemma":[0.99887747,0.000040608935,0.00008373259,0.0007440861,0.00011467944,0.00013945499],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023581633,0.00018848988,0.000171759,0.00012382108,0.00009107344,0.0001911897,0.0009378717,0.000248028,0.0070428853],"category_scores_gemma":[0.0000055541364,0.00016368685,0.00007869438,0.000045470486,0.00007139526,0.0001360745,0.0005582268,0.00023941665,0.0013338287],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010061589,0.0000036041408,1.8802145e-7,0.000007711949,0.000012446452,0.0000072753105,0.00010552766,0.00021367555,8.880092e-8,0.60302097,0.37748593,0.019141605],"study_design_scores_gemma":[0.00007045624,0.000050168288,3.690274e-7,0.000032372416,0.0000020350303,0.000004266839,7.432697e-7,0.1393184,7.8261303e-7,0.009157911,0.85118043,0.00018203344],"about_ca_topic_score_codex":0.00000222593,"about_ca_topic_score_gemma":0.000008259821,"teacher_disagreement_score":0.593863,"about_ca_system_score_codex":0.00002858172,"about_ca_system_score_gemma":0.000036986276,"threshold_uncertainty_score":0.99944377},"labels":[],"label_agreement":null},{"id":"W4239155994","doi":"10.1002/net.20240","title":"Decontamination of hypercubes by mobile agents","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Hypercube; Visibility; Human decontamination; Binary logarithm; Node (physics); Synchronicity; Copying; Path (computing); Mobile agent; Distributed computing; Theoretical computer science; Computer network; Mathematics; Combinatorics; Parallel computing","score_opus":0.016013971612176426,"score_gpt":0.24127157903904298,"score_spread":0.22525760742686654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239155994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03241016,0.000260956,0.96296,0.00005759358,0.00014088026,0.00012784293,6.844365e-7,0.000053789357,0.0039881063],"genre_scores_gemma":[0.9908817,0.00034092535,0.007693144,0.00016842686,0.000021437543,0.000013736401,0.000007681905,0.0000036702772,0.00086929975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948585,0.000034042765,0.00011618047,0.000116614996,0.00013087032,0.00011643712],"domain_scores_gemma":[0.9996618,0.000031486332,0.00003703884,0.00016479744,0.00006244253,0.000042429943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097459146,0.000043729477,0.00006786747,0.000029881574,0.00006126433,0.0000142501885,0.00025210035,0.000039439703,0.00004733482],"category_scores_gemma":[0.000006642639,0.000041430558,0.000022314394,0.0001822994,0.000027493465,0.00019875349,0.000054835564,0.000053521748,0.00001152558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007431161,0.0003832804,0.011494744,0.000017432654,0.000032358053,0.000017124577,0.0023784274,0.47922358,0.00042164995,0.006122257,0.19497786,0.30492383],"study_design_scores_gemma":[0.00018042976,0.000061116036,0.0017766956,0.0000056567465,7.7476494e-7,0.00000612686,0.000006577761,0.9908055,0.00035017665,0.00005011781,0.0066986317,0.000058215424],"about_ca_topic_score_codex":0.000008463949,"about_ca_topic_score_gemma":0.0000013977716,"teacher_disagreement_score":0.95847154,"about_ca_system_score_codex":0.00001121847,"about_ca_system_score_gemma":0.000014784007,"threshold_uncertainty_score":0.16894892},"labels":[],"label_agreement":null},{"id":"W4241336885","doi":"10.1145/514001.514004","title":"Retargetable binary utilities","year":2002,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Binary number; Arithmetic; Mathematics","score_opus":0.1252185535176678,"score_gpt":0.26746779574041174,"score_spread":0.14224924222274393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241336885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022809654,0.00012272537,0.971711,0.0033614608,0.00030003974,0.00052687165,0.0000020370735,0.0014308818,0.020264048],"genre_scores_gemma":[0.72646046,0.00015494575,0.2694978,0.00038930296,0.00004770244,0.00010531224,0.0000024168087,0.000016009022,0.0033260528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980279,0.00005168568,0.00038909842,0.00052383554,0.00054330664,0.000464149],"domain_scores_gemma":[0.99841607,0.00012724109,0.00019041025,0.00040108975,0.0006921101,0.00017308843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006191764,0.00022349469,0.0002192598,0.00026325363,0.00030449967,0.00088461756,0.0015606594,0.00011202205,0.0007189755],"category_scores_gemma":[0.0004457197,0.00021907369,0.000052482683,0.00075235724,0.000085682615,0.0027015281,0.00019359095,0.00020217874,0.0005942537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000333933,0.0006585939,0.0010743923,0.000578925,0.00011176379,0.000021307478,0.028407436,0.004608498,0.059402492,0.62402827,0.19576915,0.08530581],"study_design_scores_gemma":[0.00026845577,0.00011604889,0.00019302224,0.000048853228,0.0000044708536,0.0000144794985,0.00007985842,0.9744586,0.008547721,0.013621214,0.0023778563,0.00026947315],"about_ca_topic_score_codex":0.0000052685723,"about_ca_topic_score_gemma":2.0191106e-7,"teacher_disagreement_score":0.96985006,"about_ca_system_score_codex":0.0000610181,"about_ca_system_score_gemma":0.00007693745,"threshold_uncertainty_score":0.89335656},"labels":[],"label_agreement":null},{"id":"W4245355198","doi":"10.22215/etd/2016-11362","title":"Network Decontamination from Black Viruses","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Node (physics); Network topology; Protocol (science); Computer science; Distributed computing; Hypercube; Human decontamination; Process (computing); A priori and a posteriori; Computer network; Theoretical computer science; Topology (electrical circuits); Mathematics; Combinatorics; Engineering; Parallel computing; Medicine","score_opus":0.023116412474773668,"score_gpt":0.2835354239136898,"score_spread":0.2604190114389161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245355198","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010151308,0.00013651083,0.796425,0.00033858055,0.0013820997,0.0002804178,0.00000694447,0.00031532632,0.20009999],"genre_scores_gemma":[0.086810134,0.0011223074,0.29043832,0.0071798447,0.0023878745,0.00021193938,0.002326978,0.00016084114,0.60936177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987336,0.000068894355,0.0002545261,0.0004053298,0.00029885024,0.00023882747],"domain_scores_gemma":[0.999033,0.00014261086,0.00014679399,0.00040809828,0.00018790651,0.0000816156],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000149793,0.00016685468,0.00017111492,0.00008934525,0.00010166988,0.00024723043,0.0006992777,0.00019384632,0.00092048617],"category_scores_gemma":[0.000036254038,0.00012776307,0.000058199,0.00019032005,0.0000136772005,0.0004774948,0.000054159602,0.000117139636,0.0010800279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049604838,0.00013748507,0.0007425225,0.00007092569,0.0001691981,0.00001530651,0.0035582092,0.0014863486,0.0007778472,0.4441283,0.19320156,0.35566267],"study_design_scores_gemma":[0.003604009,0.0004265909,0.02841539,0.0015364627,0.00009143224,0.0000022262439,0.00048058075,0.26146758,0.011557334,0.40834025,0.28018123,0.0038969233],"about_ca_topic_score_codex":0.00007122376,"about_ca_topic_score_gemma":0.00038225958,"teacher_disagreement_score":0.5059867,"about_ca_system_score_codex":0.00004134543,"about_ca_system_score_gemma":0.00011759165,"threshold_uncertainty_score":0.9999928},"labels":[],"label_agreement":null},{"id":"W4248873997","doi":"10.1109/.2005.1507503","title":"Adaptive distributed fetching and retrieval of goods by a swarm-bot","year":2005,"lang":"en","type":"article","venue":"ICAR '05. Proceedings., 12th International Conference on Advanced Robotics, 2005.","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Office of Science; European Commission","keywords":"Computer science; Swarm behaviour; Distributed computing; Artificial intelligence","score_opus":0.03225028681133361,"score_gpt":0.2956061750044992,"score_spread":0.2633558881931656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248873997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064009596,0.00016241753,0.9609128,0.017507963,0.000715041,0.00069470436,0.00019858484,0.00032821202,0.013079311],"genre_scores_gemma":[0.8376741,0.00035019856,0.16010204,0.000512102,0.00011845831,0.000013431306,0.00005190724,0.000025119309,0.0011526351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997321,0.000026269707,0.000596601,0.00071178627,0.00085619156,0.00048815826],"domain_scores_gemma":[0.9981381,0.00006832042,0.00041880726,0.00021637918,0.00087624654,0.00028211914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003828336,0.00032024414,0.0003577466,0.00022169623,0.00015942592,0.00029156316,0.0010632137,0.00013305237,0.000098378005],"category_scores_gemma":[0.00029003466,0.00031258469,0.00008006079,0.0003013224,0.0001843425,0.0012638314,0.0003483805,0.00045792648,0.000021949098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033637387,0.0004865897,0.00030538978,0.00004902921,0.0001538525,0.0000067366204,0.0010169254,0.05783987,0.01128039,0.90752476,0.0049353004,0.016064769],"study_design_scores_gemma":[0.0018076287,0.0005436396,0.00029448193,0.00027017578,0.000015405963,0.000023249353,0.00035280414,0.97288364,0.011564401,0.0050101923,0.006684409,0.0005499565],"about_ca_topic_score_codex":0.000007257838,"about_ca_topic_score_gemma":0.000005237035,"teacher_disagreement_score":0.9150438,"about_ca_system_score_codex":0.00020727806,"about_ca_system_score_gemma":0.00012769768,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W4249919375","doi":"10.32920/ryerson.14663754.v1","title":"Worst-case &amp; average-case Efficiency trade-offs for search problems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Set (abstract data type); Search theory; Operations research; Unit (ring theory); Work (physics); Mathematics; Engineering; Economics; Microeconomics","score_opus":0.07756221973192895,"score_gpt":0.3166777557122791,"score_spread":0.23911553598035012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249919375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025816613,0.00027330234,0.9861391,0.0033090222,0.00088863727,0.0028058344,0.000040651863,0.0005669519,0.0033948254],"genre_scores_gemma":[0.2779088,0.00015172077,0.70993626,0.00088463654,0.00023590856,0.0008058528,0.0002185517,0.00008853911,0.009769742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953604,0.00031505805,0.0007975122,0.0017812169,0.0007442003,0.0010016545],"domain_scores_gemma":[0.9964027,0.0004182362,0.00017527357,0.0020094728,0.0004779312,0.0005163955],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017565927,0.0005244331,0.0005787866,0.00042399543,0.00055801653,0.0020271225,0.0016211121,0.00044924815,0.00039449095],"category_scores_gemma":[0.00018100276,0.0004844394,0.00042515429,0.0008256614,0.00009096725,0.00045059953,0.002651427,0.0011035163,0.00007227633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028477387,0.0019318144,0.00005386834,0.0030851732,0.000290699,0.017311001,0.021147795,0.8169855,0.000222721,0.06527095,0.008527177,0.06514482],"study_design_scores_gemma":[0.000840193,0.00011562901,0.0000030747574,0.00016148631,0.000017845958,0.008305556,0.00017933379,0.9814701,0.000228224,0.0017357882,0.00617282,0.0007699567],"about_ca_topic_score_codex":0.0002531124,"about_ca_topic_score_gemma":0.0003624823,"teacher_disagreement_score":0.27620286,"about_ca_system_score_codex":0.00015058034,"about_ca_system_score_gemma":0.0009141671,"threshold_uncertainty_score":0.99976075},"labels":[],"label_agreement":null},{"id":"W4250203847","doi":"10.1002/dac.976","title":"An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; Graph; K shortest path routing; Theoretical computer science","score_opus":0.04909891223916364,"score_gpt":0.3075747939105659,"score_spread":0.2584758816714023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250203847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035969287,0.00039787908,0.9944612,0.0003350502,0.0005065465,0.00039247956,0.0000054571087,0.000030161178,0.00027434636],"genre_scores_gemma":[0.7209191,0.000058230555,0.27874956,0.000059294525,0.00009756746,0.00004007892,0.000030244926,0.000010165538,0.00003581284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756235,0.0003175209,0.00085004466,0.00017555848,0.0008730817,0.00022141909],"domain_scores_gemma":[0.99803644,0.00027655586,0.0006487228,0.0005878529,0.00033099824,0.000119436074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020615482,0.000120607314,0.00022658019,0.00023527491,0.00014779805,0.0002692618,0.0028052852,0.000055940847,0.0000033576532],"category_scores_gemma":[0.00011151165,0.000114599155,0.000067595174,0.00020178684,0.000054726625,0.0006919833,0.00022474823,0.00021330125,0.0000036839701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016089214,0.00030609738,0.00037925056,0.0000024851788,0.000039529066,0.000003828539,0.00096306344,0.99285305,0.000043556363,0.0040885154,0.000277231,0.00102733],"study_design_scores_gemma":[0.00080333254,0.00009082265,0.0006649487,0.00010418596,0.0000038024784,0.00013244718,0.00012535261,0.9969619,0.0000051984616,0.0001401595,0.00086187467,0.00010599464],"about_ca_topic_score_codex":0.000027467479,"about_ca_topic_score_gemma":0.000001805833,"teacher_disagreement_score":0.7173221,"about_ca_system_score_codex":0.00022734728,"about_ca_system_score_gemma":0.0001234335,"threshold_uncertainty_score":0.52129644},"labels":[],"label_agreement":null},{"id":"W4250867380","doi":"10.2139/ssrn.2200485","title":"A Markov Switching Approach to Herding","year":2012,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Balsillie School of International Affairs","funders":"","keywords":"Herding; Markov chain; Computer science; Business; Economics; Econometrics; Geography; Machine learning","score_opus":0.014750449262290721,"score_gpt":0.25488388603816997,"score_spread":0.24013343677587926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250867380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040381337,0.0005738112,0.98133826,0.0010540766,0.00020203013,0.00010760935,7.111915e-8,0.0000681631,0.012617857],"genre_scores_gemma":[0.9212347,0.00020653039,0.076648094,0.0004395148,0.0002865975,0.0000068608824,3.8058556e-7,0.000013174315,0.0011640979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966827,0.00010960288,0.0001835186,0.00016136596,0.00031457562,0.0025482525],"domain_scores_gemma":[0.99938077,0.000024921257,0.00006221867,0.0002075025,0.000056181438,0.00026838848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030602105,0.000104539584,0.000107733526,0.00016504244,0.0002822065,0.000230387,0.0006945694,0.000037293223,0.000007351065],"category_scores_gemma":[0.000048867416,0.000089292254,0.00006265811,0.00041974802,0.0000058703454,0.000931239,0.0001613254,0.0010790046,0.00006844301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060557495,0.00011545462,0.0010931123,0.00000421364,0.00004463409,5.196347e-7,0.0017602398,0.0012323109,0.00037628546,0.88143045,0.00028810767,0.113648646],"study_design_scores_gemma":[0.00426758,0.0013326608,0.0036167079,0.00014735304,0.000055783737,0.008221612,0.007886569,0.4777406,0.0006933311,0.43707877,0.05614073,0.0028182988],"about_ca_topic_score_codex":0.000008959087,"about_ca_topic_score_gemma":0.0000059540043,"teacher_disagreement_score":0.91719663,"about_ca_system_score_codex":0.00045597975,"about_ca_system_score_gemma":0.00055654487,"threshold_uncertainty_score":0.4687798},"labels":[],"label_agreement":null},{"id":"W4253180224","doi":"10.1007/978-3-030-11072-7_15","title":"Patrolling","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Patrolling; Computer science; Robot; Variety (cybernetics); Mobile robot; Graph; Point (geometry); Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.02041638483535308,"score_gpt":0.2504378034000851,"score_spread":0.23002141856473202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253180224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005231484,0.0002486308,0.9791465,0.0009402701,0.001592984,0.00038006442,0.0000019830984,0.00017264078,0.017511686],"genre_scores_gemma":[0.029310925,0.0001420266,0.9626302,0.0032385662,0.00042328506,0.000006372755,0.0000066239854,0.000050263847,0.0041917446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966544,0.000028304112,0.00040530114,0.0012870469,0.001006151,0.0006188231],"domain_scores_gemma":[0.9977533,0.00029794118,0.00018475481,0.0013485147,0.00025028884,0.00016519144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084129523,0.0003724052,0.00040388163,0.00076939975,0.0001765059,0.0006912844,0.003275943,0.00025316904,0.00006372318],"category_scores_gemma":[0.00005547174,0.00033594336,0.00011607649,0.0005286975,0.00030427813,0.0006417318,0.0012508399,0.00075091375,0.00031200473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024209967,0.000016542665,0.000046145018,0.000035188943,0.0000074995964,0.00003899605,0.00044975252,0.34650677,0.00005113752,0.07991805,0.000036736248,0.57289076],"study_design_scores_gemma":[0.00022009226,0.00010303259,0.000015857606,0.00018322853,0.0000020176205,0.000019947984,3.5376384e-8,0.91288936,0.0001928102,0.081781164,0.004158939,0.00043349477],"about_ca_topic_score_codex":0.0000069321977,"about_ca_topic_score_gemma":0.000013977633,"teacher_disagreement_score":0.57245725,"about_ca_system_score_codex":0.00019204227,"about_ca_system_score_gemma":0.0008172381,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W4255922256","doi":"10.32920/ryerson.14655639","title":"Scatter Search on a Disk","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Robot; Upper and lower bounds; Unit disk; Carry (investment); Object (grammar); Computer science; Combinatorics; Artificial intelligence; Mathematics","score_opus":0.048902244932385895,"score_gpt":0.30631048598973365,"score_spread":0.2574082410573478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255922256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009708675,0.000030601648,0.9140017,0.024812829,0.00044367442,0.00023875404,0.0000017689262,0.0002157875,0.059284016],"genre_scores_gemma":[0.3471379,0.00036965718,0.56508523,0.04137327,0.00019153312,0.00015315613,0.00011623003,0.00005203152,0.04552099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830705,0.0001395335,0.00015975998,0.0006404433,0.0004911669,0.00026206582],"domain_scores_gemma":[0.99853545,0.000052544598,0.00002708619,0.0010984977,0.00015845537,0.00012797175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029677455,0.00014285426,0.00015489415,0.00013204983,0.00006507723,0.0009100904,0.0011610865,0.000104928105,0.00066900527],"category_scores_gemma":[0.000018544313,0.00011973813,0.000096986165,0.00020325581,0.000026419644,0.00012873494,0.0027039563,0.00058483426,0.00034869942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014503115,0.0011913228,0.0013690036,0.00044938654,0.00024487922,0.00027994273,0.007242062,0.31414843,0.00026413074,0.2963008,0.195115,0.18338053],"study_design_scores_gemma":[0.0002945166,0.00007696555,0.00086886244,0.00019631881,0.000002757694,0.000006439689,0.000056574623,0.98279196,0.0015977294,0.0019734877,0.011608469,0.0005259135],"about_ca_topic_score_codex":0.000052310184,"about_ca_topic_score_gemma":0.00000838496,"teacher_disagreement_score":0.66864353,"about_ca_system_score_codex":0.00004431719,"about_ca_system_score_gemma":0.00024255228,"threshold_uncertainty_score":0.8776023},"labels":[],"label_agreement":null},{"id":"W4256116496","doi":"10.2139/ssrn.3724499","title":"Reclamation of a Resource Extraction Site: A Dynamic Game Approach","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Memorial University of Newfoundland","funders":"","keywords":"Land reclamation; Extraction (chemistry); Resource (disambiguation); Computer science; Geography; Archaeology; Chemistry; Chromatography","score_opus":0.01344609984647184,"score_gpt":0.2514250514724357,"score_spread":0.23797895162596389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256116496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069422303,0.00035803096,0.98725873,0.0037263692,0.000029160601,0.00011884563,4.629528e-7,0.000059381073,0.0015068044],"genre_scores_gemma":[0.9808254,0.00065534137,0.01780873,0.0002244857,0.000057827023,0.000003713888,0.0000060195603,0.000010712173,0.00040774455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829,0.0001593799,0.00027484423,0.0001925602,0.00033283493,0.00075039646],"domain_scores_gemma":[0.99940985,0.000029253786,0.00021061355,0.00015266959,0.0001010809,0.000096535434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010076734,0.000085179614,0.00012243971,0.0001030865,0.00008587801,0.00008834703,0.0004184749,0.000052337964,0.000009408574],"category_scores_gemma":[0.00007825756,0.00007854421,0.000069816284,0.0004980394,0.000020632784,0.00051864336,0.000055068576,0.0009600072,0.000017241133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019145306,0.00039439855,0.00033027853,0.00010325029,0.00020016739,0.000006372401,0.01055065,0.08956805,0.020033022,0.61251473,0.0006518753,0.26545572],"study_design_scores_gemma":[0.0005721804,0.00037512515,0.00010713981,0.00001132251,0.0000074160916,0.000227807,0.00049137225,0.97346145,0.00014089013,0.022490352,0.0019913248,0.00012362596],"about_ca_topic_score_codex":0.00000520051,"about_ca_topic_score_gemma":0.000008731157,"teacher_disagreement_score":0.9738832,"about_ca_system_score_codex":0.000249153,"about_ca_system_score_gemma":0.000691652,"threshold_uncertainty_score":0.4170807},"labels":[],"label_agreement":null},{"id":"W4281701211","doi":"10.1145/3543516.3456271","title":"Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging","year":2021,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; University of Toronto; National Science Foundation","keywords":"Knapsack problem; Competitive analysis; Continuous knapsack problem; Online algorithm; Computer science; Algorithm; Mathematical optimization; Limiting; Identification (biology); Dual (grammatical number); Generalized assignment problem; Change-making problem; Optimization problem; Mathematics; Upper and lower bounds; Engineering","score_opus":0.06932257938094619,"score_gpt":0.3470856595915804,"score_spread":0.27776308021063423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281701211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076159433,0.02220086,0.9582794,0.013631273,0.000077766184,0.0047202446,0.000007755304,0.00009487707,0.00022626958],"genre_scores_gemma":[0.115537345,0.106648855,0.7548313,0.016322212,0.00024484008,0.0054955166,0.00045787427,0.00006305026,0.0003989861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976686,0.00016958159,0.00041556632,0.0004983765,0.0009198174,0.0003280518],"domain_scores_gemma":[0.9956572,0.0007971794,0.00021483604,0.000959466,0.0022674473,0.00010383723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026822805,0.000160074,0.00024745145,0.00021098122,0.0003603584,0.00014846823,0.00092561316,0.00003772136,0.000032282936],"category_scores_gemma":[0.0016239303,0.000116757445,0.00006343327,0.0058273007,0.000017009947,0.00047965438,0.00019669397,0.00016872451,0.00006798602],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054912784,0.000110084904,0.00038751372,0.00043302364,0.000027475397,2.5494245e-7,0.00012865422,0.016830264,0.00019725751,0.002695631,0.00063896435,0.97854537],"study_design_scores_gemma":[0.0006079041,0.00017197119,0.0024143297,0.0004162588,0.000050109567,0.0000063750153,0.000017346905,0.94371414,0.00070227263,0.00007310065,0.051642925,0.00018327695],"about_ca_topic_score_codex":0.0000041576495,"about_ca_topic_score_gemma":0.000011260356,"teacher_disagreement_score":0.9783621,"about_ca_system_score_codex":0.00015125933,"about_ca_system_score_gemma":0.0003992309,"threshold_uncertainty_score":0.47612303},"labels":[],"label_agreement":null},{"id":"W4285044551","doi":"10.22215/etd/2022-15057","title":"Strategies for Cooperative Energy Distribution on Multi-Robot Warehouse Systems","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Mobile robot; Power (physics); Battery capacity; Energy (signal processing); Engineering; Feature (linguistics); Battery (electricity); Computer science; Real-time computing; Simulation; Artificial intelligence","score_opus":0.039743587917462804,"score_gpt":0.3162381766939221,"score_spread":0.2764945887764593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285044551","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016443695,0.00016277845,0.9917135,0.00009474515,0.0012195418,0.0007181554,0.00017232128,0.00032427104,0.0055782255],"genre_scores_gemma":[0.3488995,0.0007395837,0.043694727,0.0010317964,0.00044927173,0.009514699,0.08438212,0.0002660738,0.5110222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982529,0.00015655125,0.00033067,0.00056278583,0.00040284754,0.00029420925],"domain_scores_gemma":[0.99880147,0.00014491838,0.00016632256,0.00038876574,0.00041032853,0.000088182496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020949535,0.00026331845,0.00027198784,0.0001327681,0.00044043903,0.00074537896,0.0006774512,0.00015097058,0.00009394103],"category_scores_gemma":[0.000038228824,0.00023126705,0.00010314329,0.0003673173,0.000014139137,0.00041999828,0.000058026846,0.0002023188,0.0000125532315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027140624,0.00011448295,2.9974626e-7,0.000071512804,0.000031677835,0.0000022856,0.0007146177,0.25420758,0.00004576763,0.7358096,0.0075039496,0.0014710926],"study_design_scores_gemma":[0.0006455821,0.00058991543,0.000011186025,0.000058390207,0.00000884362,0.0000013674686,0.0038161695,0.9341026,0.00039047498,0.00025716866,0.0597043,0.00041401462],"about_ca_topic_score_codex":0.00027234605,"about_ca_topic_score_gemma":0.0003416294,"teacher_disagreement_score":0.9480188,"about_ca_system_score_codex":0.00017317587,"about_ca_system_score_gemma":0.00047963555,"threshold_uncertainty_score":0.94307965},"labels":[],"label_agreement":null},{"id":"W4285133257","doi":"10.1090/stml/097/05","title":"The localization game","year":2022,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.017611368599253847,"score_gpt":0.25021456683919335,"score_spread":0.2326031982399395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285133257","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0856994e-7,0.00029587868,0.20074262,0.0028559251,0.00018507261,0.00042487108,0.0000072215225,0.00030186385,0.79518646],"genre_scores_gemma":[0.000069330665,0.0008516098,0.0070949364,0.0010050102,0.00010059245,0.00007182934,0.000056290362,0.00006600205,0.9906844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979693,0.000062905456,0.00042817413,0.00036207735,0.0009261409,0.00025135832],"domain_scores_gemma":[0.99855757,0.00034567426,0.00014771869,0.00079741573,0.000026709948,0.00012491658],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024355235,0.00022357237,0.00023324856,0.00008137726,0.00027474153,0.00067081687,0.0019025652,0.00009480565,0.0043655243],"category_scores_gemma":[0.000021160167,0.00015271765,0.00013459008,0.00009098387,0.000104897015,0.00056073896,0.0019591409,0.00039016278,0.0007247291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014933897,0.000031933832,0.0000020088921,0.000030108062,0.000031343727,0.000013324764,0.00024452634,0.00014211898,9.3452364e-8,0.9763722,0.021275261,0.0018556251],"study_design_scores_gemma":[0.00006672356,0.00003795131,8.7055224e-7,0.000029479565,0.000005314415,0.0000046825126,0.000008812703,0.014452535,7.0822466e-7,0.41601756,0.5692456,0.0001297755],"about_ca_topic_score_codex":8.4436564e-8,"about_ca_topic_score_gemma":8.595315e-8,"teacher_disagreement_score":0.5603546,"about_ca_system_score_codex":0.000029495413,"about_ca_system_score_gemma":0.00009896546,"threshold_uncertainty_score":0.9965446},"labels":[],"label_agreement":null},{"id":"W4285235194","doi":"10.1007/978-3-030-96087-2_2","title":"Robot Models","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robot; Computer science; Artificial intelligence","score_opus":0.023787812482109226,"score_gpt":0.24295485994413168,"score_spread":0.21916704746202245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285235194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.360904e-7,0.00035784245,0.776029,0.0042817746,0.00015495805,0.00023998575,0.000009231407,0.000052529667,0.21887417],"genre_scores_gemma":[0.70842427,0.007906831,0.1679717,0.10094501,0.00038901414,0.0003205208,0.00017420336,0.000059596165,0.013808846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985491,0.000029962977,0.0003813196,0.00023730747,0.00058305927,0.00021923087],"domain_scores_gemma":[0.9992117,0.0002351286,0.00019804668,0.00020346833,0.00008616601,0.00006548788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007151189,0.00017203279,0.00021999242,0.00047513557,0.00031304816,0.00050022185,0.0006737245,0.00011633711,0.00020068554],"category_scores_gemma":[0.00007337599,0.00013900924,0.00004672162,0.00019534296,0.00015522171,0.004557406,0.00020064187,0.00033263778,0.000017441178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030021417,0.0000021714404,0.0000035361636,0.000009779484,0.0000038934304,6.5715943e-7,0.000519857,0.3203863,0.0000010763198,0.58033156,0.000045933102,0.09869225],"study_design_scores_gemma":[0.00032948636,0.00008377643,0.000008385266,0.00001764163,0.0000020063733,0.0000070737597,0.000002206813,0.77123094,0.0000019866777,0.14818978,0.0799581,0.00016860079],"about_ca_topic_score_codex":0.00003597998,"about_ca_topic_score_gemma":0.000018067713,"teacher_disagreement_score":0.70842373,"about_ca_system_score_codex":0.000041787174,"about_ca_system_score_gemma":0.00017758633,"threshold_uncertainty_score":0.56686324},"labels":[],"label_agreement":null},{"id":"W4286580165","doi":"10.1109/lra.2022.3193242","title":"Min-Max Vertex Cycle Covers With Connectivity Constraints for Multi-Robot Patrolling","year":2022,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Patrolling; Robot; Vertex (graph theory); Vertex cover; Computer science; Greedy algorithm; Mathematical optimization; Disjoint sets; Time complexity; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Artificial intelligence; Graph","score_opus":0.024789209281276106,"score_gpt":0.25371809794594163,"score_spread":0.22892888866466554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286580165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02071722,0.000008336201,0.972748,0.005644651,0.00029145903,0.00040989651,0.000015402717,0.00013539512,0.000029678784],"genre_scores_gemma":[0.76851004,0.0000031837305,0.22941807,0.0019591192,0.000013262661,0.00005164769,0.000010653388,0.000010245263,0.000023795996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898094,0.0000834506,0.00016789394,0.00029107535,0.00024393976,0.00023267882],"domain_scores_gemma":[0.99942905,0.00015748793,0.00010735411,0.0001708226,0.000056405624,0.0000789062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029438612,0.00011358139,0.00014082274,0.000096529504,0.00046750112,0.00017773572,0.00020457864,0.000022098639,0.000012075257],"category_scores_gemma":[0.000021453401,0.0001109354,0.000038659153,0.00019300326,0.00007859404,0.0003059236,0.000059102782,0.00011247021,0.000002442978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008183504,0.000058154368,0.00018399867,0.000016668482,0.00002294542,0.0000049086257,0.00045379467,0.98796487,0.0024102738,0.0045549427,0.0003681761,0.003953108],"study_design_scores_gemma":[0.001365743,0.000121203455,0.0003092863,0.000010268119,0.00000774608,0.000012127298,0.00005437,0.99739635,0.00025248036,0.00012684232,0.00018147139,0.0001621135],"about_ca_topic_score_codex":0.000009387894,"about_ca_topic_score_gemma":0.0000039434913,"teacher_disagreement_score":0.7477928,"about_ca_system_score_codex":0.0000614592,"about_ca_system_score_gemma":0.00005640096,"threshold_uncertainty_score":0.45238143},"labels":[],"label_agreement":null},{"id":"W4287445554","doi":"10.17190/amf/1773392","title":"AmeriFlux CA-HPC Havikpak Creek","year":2021,"lang":"en","type":"dataset","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Université de Montréal","funders":"","keywords":"Environmental science; Geography","score_opus":0.0161923726681419,"score_gpt":0.250613850919022,"score_spread":0.2344214782508801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287445554","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002098253,0.0004413501,0.07735794,0.00053664116,0.0012863596,0.00050235714,0.9046623,0.0001575596,0.014845679],"genre_scores_gemma":[0.0039966065,0.0005098622,0.016910626,0.0002889265,0.000023586113,0.000049441387,0.9777285,0.000007424428,0.00048502022],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969578,0.00007597309,0.0010639522,0.0004616791,0.0010740585,0.0003665856],"domain_scores_gemma":[0.9969984,0.00018436954,0.00071241695,0.001147567,0.00071958586,0.0002376136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000657097,0.00028134682,0.0005190073,0.0004543309,0.00026854206,0.00063715194,0.0012176356,0.00026877533,0.00033080464],"category_scores_gemma":[0.00026210857,0.00027858486,0.00015906345,0.0010609734,0.00066123874,0.0014597562,0.0009025785,0.0002537244,0.00005458251],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008287524,0.00020014151,0.0000084748435,0.0001548305,0.00003334813,0.000003876923,0.000001778817,0.00023693714,0.000027404236,0.0054634567,0.9924311,0.0014303508],"study_design_scores_gemma":[0.00031971245,0.00015473507,0.00040562995,0.00012930961,0.000030612267,0.000023501545,0.000002996396,0.0002309768,0.00022968726,0.00011899126,0.9980742,0.00027969212],"about_ca_topic_score_codex":0.00020366749,"about_ca_topic_score_gemma":0.00014319878,"teacher_disagreement_score":0.07306622,"about_ca_system_score_codex":0.000048041027,"about_ca_system_score_gemma":0.00046679296,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W4287558369","doi":"10.48550/arxiv.2005.00880","title":"Almost Universal Anonymous Rendezvous in the Plane","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Université du Québec en Outaouais","keywords":"Rendezvous; Set (abstract data type); Computer science; Plane (geometry); Position (finance); Visibility; Algorithm; Existential quantification; Rotation (mathematics); Orientation (vector space); Mathematics; Combinatorics; Artificial intelligence; Geometry; Physics","score_opus":0.10751423870194961,"score_gpt":0.1941067573270157,"score_spread":0.0865925186250661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287558369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023314077,0.000071150986,0.93115425,0.0047746073,0.0005867688,0.00086998433,0.00003876164,0.00044800725,0.038742367],"genre_scores_gemma":[0.9963734,0.00018898935,0.001638128,0.0006175887,0.000046970512,7.5060166e-7,0.00003734648,0.000011885138,0.0010849226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981159,0.00034946032,0.00016695228,0.0008698728,0.00015354392,0.00034426007],"domain_scores_gemma":[0.9985398,0.00013667464,0.00013352722,0.0009731117,0.00007637909,0.00014050819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029761094,0.00023701107,0.00023757969,0.00022146231,0.00012867723,0.00018766732,0.0030841085,0.00020085795,0.00004739703],"category_scores_gemma":[0.000034554163,0.00022448543,0.00010956033,0.0010012068,0.000095971496,0.00029177073,0.0016336923,0.0008733781,0.00012620263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004734625,0.00016353649,0.0012891339,0.00006661147,0.00005438624,0.0035159367,0.0034211196,0.53978634,0.000017562836,0.44682667,0.0041280766,0.000683271],"study_design_scores_gemma":[0.0008059718,0.000112154674,0.0009864125,0.000051216444,0.000021726086,0.000018012704,0.0004963819,0.96717304,0.000015877886,0.024370637,0.0054839374,0.00046463174],"about_ca_topic_score_codex":0.00025350193,"about_ca_topic_score_gemma":0.00012309158,"teacher_disagreement_score":0.97305936,"about_ca_system_score_codex":0.00014796857,"about_ca_system_score_gemma":0.00028431587,"threshold_uncertainty_score":0.915425},"labels":[],"label_agreement":null},{"id":"W4292924664","doi":"10.1007/978-3-319-89441-6","title":"Approximation and Online Algorithms","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Algorithm; Online algorithm","score_opus":0.020703148704578293,"score_gpt":0.27208474132042837,"score_spread":0.2513815926158501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292924664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016408552,0.00020068263,0.99631125,0.00094246946,0.0008066503,0.00034719103,0.000005154496,0.00015022479,0.00121999],"genre_scores_gemma":[0.0007827906,0.00007486677,0.996061,0.0013324546,0.0004965309,0.0000072524135,0.000022425382,0.000017569402,0.0012050546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997228,0.000062604384,0.000341051,0.001127219,0.0007621802,0.0004789014],"domain_scores_gemma":[0.9983285,0.0002308364,0.00016097545,0.00080867,0.00030301505,0.00016796707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000891871,0.00029543374,0.00029954177,0.0006598905,0.0002188073,0.00069906854,0.001893482,0.00021841426,0.0000120666855],"category_scores_gemma":[0.000112432295,0.00026169393,0.000040899085,0.00096191856,0.00070906617,0.0007322001,0.0012188285,0.0004725032,0.000024051473],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012033427,0.00004822646,0.000018027928,0.00005065728,0.0000048952875,0.000013564779,0.0009735563,0.0113382675,0.000020228304,0.0030626252,0.00039217703,0.98407656],"study_design_scores_gemma":[0.00017971145,0.00013096958,0.00005166844,0.00013600504,0.0000017735798,0.000031355754,9.1596185e-8,0.9322285,0.00012439187,0.06430838,0.0025152003,0.00029197577],"about_ca_topic_score_codex":0.000006668618,"about_ca_topic_score_gemma":0.000024257788,"teacher_disagreement_score":0.9837846,"about_ca_system_score_codex":0.00019874667,"about_ca_system_score_gemma":0.00076037593,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W4293716608","doi":"10.1145/3561074.3561086","title":"Online Selection with Convex Costs","year":2022,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Selection (genetic algorithm); Computer science; Sequence (biology); Regular polygon; Value (mathematics); Simple (philosophy); Online algorithm; Convex optimization; Mathematical optimization; Secretary problem; Operations research; Artificial intelligence; Mathematics; Machine learning; Algorithm; Optimal stopping","score_opus":0.07365050367698708,"score_gpt":0.3415781810257241,"score_spread":0.267927677348737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293716608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06889305,0.17863813,0.6834816,0.03693363,0.0023387773,0.015175778,0.000048902715,0.0016102699,0.012879873],"genre_scores_gemma":[0.6129398,0.16340941,0.19579801,0.022953864,0.00018818188,0.0023061505,0.00063343917,0.000073703326,0.0016974333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692744,0.0004118689,0.00035955675,0.00036733868,0.001691566,0.00024223943],"domain_scores_gemma":[0.9980955,0.0001471879,0.00024037302,0.00066266715,0.0007685959,0.000085650885],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003648288,0.00013334252,0.00021659494,0.0004026886,0.0004512964,0.00007641756,0.0010113688,0.000021446798,0.0010415693],"category_scores_gemma":[0.0007501117,0.00011509758,0.000042017353,0.0061255917,0.00002019259,0.00067187333,0.00039176433,0.00029466808,0.00006813253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007111657,0.00025288397,0.0038808105,0.0003639372,0.000025131263,0.000001051625,0.00008637782,0.03037398,0.000013137961,0.0015184652,0.009057459,0.9544197],"study_design_scores_gemma":[0.0006403478,0.00054684706,0.0032589633,0.00021926191,0.00003814408,0.000039635786,0.000011565191,0.9227431,0.000037590984,0.00005537457,0.07217857,0.00023063533],"about_ca_topic_score_codex":0.000005195742,"about_ca_topic_score_gemma":0.0000023253085,"teacher_disagreement_score":0.954189,"about_ca_system_score_codex":0.00040259288,"about_ca_system_score_gemma":0.00042032782,"threshold_uncertainty_score":0.9998716},"labels":[],"label_agreement":null},{"id":"W4293822285","doi":"10.32866/001c.37217","title":"An Improved Lower Bound on the Competitive Ratio of Deterministic Online Algorithms for the Multi-agent K-Canadian Traveler Problem","year":2022,"lang":"en","type":"article","venue":"Findings","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Online algorithm; Upper and lower bounds; Computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.05006125387348197,"score_gpt":0.2932991362153282,"score_spread":0.24323788234184623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293822285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016033636,0.00003371101,0.9625536,0.014722881,0.0009025649,0.004144976,0.00073598075,0.00009126472,0.00078134815],"genre_scores_gemma":[0.95463943,0.0000047762665,0.041081678,0.0024962053,0.00004553191,0.00036148264,0.00005344632,0.000019343388,0.001298128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893796,0.00009558641,0.00020268059,0.00025590914,0.00022978487,0.0002780895],"domain_scores_gemma":[0.9991149,0.0002307714,0.000082023646,0.00036492888,0.00010747145,0.00009994686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735614,0.000105069426,0.000104897794,0.00008769687,0.00077522284,0.00015431657,0.00093467196,0.000024141002,0.00016153535],"category_scores_gemma":[0.00004881499,0.00006797957,0.000061085295,0.00025098497,0.00007809737,0.000109293076,0.000099249235,0.00018985166,0.000004764751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019466279,0.0035193488,0.00060867204,0.00013264114,0.00032625932,0.000046112746,0.0675851,0.061698142,0.009447554,0.7439576,0.008692611,0.10379133],"study_design_scores_gemma":[0.00043979267,0.00067580555,0.0008233115,0.000007631316,0.000006141119,0.0000033223218,0.00046336453,0.97652733,0.00022469954,0.00030116935,0.02041494,0.00011246051],"about_ca_topic_score_codex":0.00071388605,"about_ca_topic_score_gemma":0.001959178,"teacher_disagreement_score":0.9386058,"about_ca_system_score_codex":0.00009668981,"about_ca_system_score_gemma":0.00026369462,"threshold_uncertainty_score":0.5962466},"labels":[],"label_agreement":null},{"id":"W4297251947","doi":"10.3233/fi-222128","title":"Gathering over Meeting Nodes in Infinite Grid*","year":2022,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Grid; Robot; Distributed computing; Upper and lower bounds; Distributed algorithm; Theoretical computer science; Mathematics; Computer network; Artificial intelligence","score_opus":0.01786361352679732,"score_gpt":0.25010612691852246,"score_spread":0.23224251339172514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297251947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329917,0.00014588494,0.2538017,0.0037184765,0.0019106815,0.0016629836,0.000043957036,0.00094467786,0.30477992],"genre_scores_gemma":[0.9257753,0.000026927126,0.068253085,0.004913557,0.000043312568,0.0002077522,0.000027416016,0.00001713589,0.0007355528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987437,0.000062779385,0.0003703924,0.00012040638,0.00040399114,0.00029873036],"domain_scores_gemma":[0.99946314,0.00007470931,0.00009181208,0.00028450214,0.000019276093,0.00006657576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063606823,0.00009051787,0.00010870697,0.00021270494,0.00023954613,0.00026054215,0.0006308823,0.000015861306,0.0005925485],"category_scores_gemma":[0.000036559028,0.000092580274,0.000033714547,0.00056328735,0.0000207268,0.0011212908,0.000933419,0.00022018311,0.0000830371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043437707,0.0004943366,0.05663962,0.00031549268,0.00007509133,0.000048204274,0.08355668,0.55335265,0.00061527663,0.20535895,0.008685228,0.090815015],"study_design_scores_gemma":[0.00075726525,0.00007909443,0.002715973,0.000030726376,0.0000011586878,0.000011150357,0.001138453,0.9063405,0.000077633886,0.0007819496,0.08784465,0.00022145332],"about_ca_topic_score_codex":0.00004717544,"about_ca_topic_score_gemma":0.0000067843966,"teacher_disagreement_score":0.49278355,"about_ca_system_score_codex":0.00013389009,"about_ca_system_score_gemma":0.000060034647,"threshold_uncertainty_score":0.64879906},"labels":[],"label_agreement":null},{"id":"W4302609198","doi":"10.1007/s00446-014-0216-5","title":"Deterministic polynomial approach in the plane","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Polynomial; Plane (geometry); Geometry; Mathematical analysis","score_opus":0.017766937511078752,"score_gpt":0.2474252493438052,"score_spread":0.22965831183272645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302609198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079948595,0.000008353308,0.9878334,0.0004466201,0.000101474165,0.00013366972,0.0000047182225,0.000100405145,0.0033765484],"genre_scores_gemma":[0.97986233,5.3628565e-7,0.019569015,0.00041248367,0.000075211225,0.000004373087,0.00006755353,0.0000039375977,0.0000045804813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987612,0.000249963,0.00021259977,0.00025388543,0.00021238839,0.00030996685],"domain_scores_gemma":[0.9992071,0.00026782567,0.00006130896,0.00038370723,0.00002948983,0.00005056563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080509763,0.000096044365,0.00011505776,0.000059382382,0.00016296806,0.00027709626,0.0010808709,0.00004031658,0.000002254629],"category_scores_gemma":[0.000081995335,0.00007216331,0.00003151944,0.00046953355,0.00003196606,0.00008943181,0.00013326206,0.00019028186,0.00001780396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000261019,0.00084907806,0.015437268,0.00011894249,0.0000345178,0.000067010515,0.008439657,0.4479974,0.0002601631,0.2689983,0.011839139,0.24593244],"study_design_scores_gemma":[0.00030075538,0.000034656863,0.005456118,0.000008317372,0.0000011126666,0.000020038084,0.00004923009,0.9918916,0.0000133859385,0.00023321144,0.001893999,0.000097574055],"about_ca_topic_score_codex":0.0000124978005,"about_ca_topic_score_gemma":0.0000011211781,"teacher_disagreement_score":0.97186744,"about_ca_system_score_codex":0.000022358261,"about_ca_system_score_gemma":0.000028491804,"threshold_uncertainty_score":0.29427344},"labels":[],"label_agreement":null},{"id":"W4302799385","doi":"10.1007/978-3-031-02008-7_6","title":"Flocking","year":2012,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on distributed computing theory","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Flocking (texture); Robot; Mobile robot; Computer science; Artificial intelligence; Human–computer interaction; Swarm robotics; Visual arts; Art","score_opus":0.019716228258574123,"score_gpt":0.23803860213713104,"score_spread":0.2183223738785569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302799385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004859692,0.0011187717,0.7592539,0.00041899877,0.0005566028,0.00031798598,0.00007998897,0.0008625635,0.23738632],"genre_scores_gemma":[0.81525093,0.0007023331,0.05599596,0.0059784423,0.0038590508,0.00008499638,0.0008057331,0.00082643656,0.116496116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967118,0.00034315255,0.0005433766,0.0008745768,0.00071731175,0.0008098013],"domain_scores_gemma":[0.99528456,0.0024591314,0.00041477714,0.0013693158,0.00018113827,0.0002910576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014312398,0.00067178824,0.00063047005,0.00036178148,0.0004812182,0.00037119968,0.0019682571,0.0005118059,0.0006154264],"category_scores_gemma":[0.00053972134,0.0006095496,0.00035564599,0.00014907517,0.00014398954,0.00014322491,0.0006400242,0.00096925104,0.0005469695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018170884,0.000035277182,0.0000013854225,0.00003378123,0.00013504911,0.000015163087,0.00012296622,0.004879784,0.000011215765,0.8064903,0.0027357833,0.18552114],"study_design_scores_gemma":[0.00046193245,0.0001844366,0.000060663046,0.001703273,0.00017361584,0.00008298215,0.000012983374,0.044329844,0.002284344,0.5916538,0.35637465,0.0026774472],"about_ca_topic_score_codex":0.0000016479081,"about_ca_topic_score_gemma":7.483783e-7,"teacher_disagreement_score":0.81524605,"about_ca_system_score_codex":0.00023053985,"about_ca_system_score_gemma":0.00014006936,"threshold_uncertainty_score":0.9996356},"labels":[],"label_agreement":null},{"id":"W4311633653","doi":"10.1007/s00453-022-01075-y","title":"Algorithms for p-Faulty Search on a Half-Line","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Theory of computation; Bernoulli trial; Conjecture; Mathematics; Combinatorics; Monotonic function; Sequence (biology); Upper and lower bounds; Line (geometry); Algorithm; Discrete mathematics; Path (computing); Search problem; Computer science","score_opus":0.061667502694890054,"score_gpt":0.324226032777739,"score_spread":0.2625585300828489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311633653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017053435,0.00004349685,0.9773665,0.019191094,0.000502498,0.0006591463,0.000054332253,0.0002529388,0.001759446],"genre_scores_gemma":[0.049459912,0.000031546395,0.9243003,0.01367507,0.00033448086,0.0011227713,0.00017213309,0.00006797783,0.010835822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804056,0.00013720279,0.00021763999,0.00051925593,0.00062555826,0.000459813],"domain_scores_gemma":[0.9989251,0.00019519216,0.000047196278,0.0005460684,0.00013800857,0.00014843693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007296202,0.00013607118,0.00015527486,0.0001814816,0.00060371496,0.00012993936,0.0010638818,0.000029809089,0.00017876535],"category_scores_gemma":[0.00004015917,0.00013453582,0.00009897884,0.00059696543,0.00003575791,0.00018240963,0.0005319947,0.0003049286,0.000070770024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006422981,0.0008164768,0.000011366964,0.00002339771,0.00007146579,0.000048405967,0.0013636936,0.066849284,0.0002973961,0.1493943,0.062532574,0.7185274],"study_design_scores_gemma":[0.00069062214,0.0006147431,0.00000983866,0.0000027675196,0.0000017605478,0.00001452786,0.000042093354,0.7840075,0.00082822115,0.0018411925,0.21179244,0.0001542739],"about_ca_topic_score_codex":0.00003307883,"about_ca_topic_score_gemma":0.0000011553643,"teacher_disagreement_score":0.7183731,"about_ca_system_score_codex":0.00010596606,"about_ca_system_score_gemma":0.00013979903,"threshold_uncertainty_score":0.5486212},"labels":[],"label_agreement":null},{"id":"W4312335575","doi":"10.2139/ssrn.4240819","title":"A Distributed Approximation Algorithm for the Total Dominating Set Problem","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Dominating set; Algorithm; Set (abstract data type); Approximation algorithm; Computer science; Mathematics; Mathematical optimization; Theoretical computer science; Graph","score_opus":0.011870500548152621,"score_gpt":0.2517961040918203,"score_spread":0.23992560354366768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312335575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021003844,0.0003356525,0.99462086,0.0040638284,0.0001494832,0.000474598,0.000016953236,0.000053826483,0.00007478832],"genre_scores_gemma":[0.5961665,0.0006186379,0.39526403,0.0006005395,0.00062620785,0.0012730982,0.00019225864,0.000070774695,0.005187969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978013,0.00016158658,0.00023590703,0.00018325988,0.0003954204,0.001222494],"domain_scores_gemma":[0.9993404,0.00014385673,0.00017011195,0.00017396251,0.00012394038,0.000047741636],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033731875,0.00009235256,0.000091776725,0.000071394585,0.0013977305,0.00024520158,0.00072961446,0.000019490686,0.000017313712],"category_scores_gemma":[0.000042562202,0.00006919119,0.00008921951,0.00042713448,0.000019776116,0.0003412878,0.00022116223,0.0010637153,0.000002382476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011042927,0.00007165557,0.000008022655,0.0000050648932,0.00008300697,0.0000011315674,0.000894831,0.055117533,0.00006844858,0.38595164,0.0005761213,0.5572115],"study_design_scores_gemma":[0.0006440654,0.00027331137,0.000010173667,0.000002301813,0.0000065759677,0.0004310902,0.0010469388,0.8883882,0.000018479244,0.10720362,0.0018840973,0.00009114242],"about_ca_topic_score_codex":0.000009154864,"about_ca_topic_score_gemma":0.0000064798587,"teacher_disagreement_score":0.83327067,"about_ca_system_score_codex":0.0006598967,"about_ca_system_score_gemma":0.0010651894,"threshold_uncertainty_score":0.9999023},"labels":[],"label_agreement":null},{"id":"W4312532973","doi":"10.1007/978-3-031-22050-0_6","title":"Triangle Evacuation of 2 Agents in the Wireless Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Equilateral triangle; Combinatorics; Perimeter; Mathematics; Point (geometry); Infimum and supremum; Enhanced Data Rates for GSM Evolution; Square (algebra); Unit square; Incircle and excircles of a triangle; Upper and lower bounds; Computer science; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.05684704296843068,"score_gpt":0.2945540914198583,"score_spread":0.2377070484514276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312532973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000097026204,0.00008620152,0.9924162,0.0012358263,0.00035897573,0.00050604844,0.0000045784304,0.000031172964,0.005263987],"genre_scores_gemma":[0.6139482,0.00022838666,0.38023654,0.004378863,0.00015924123,0.000073688694,0.000026891244,0.000044374363,0.0009037798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707574,0.00010831788,0.00046976798,0.00070918805,0.0012999028,0.00033709063],"domain_scores_gemma":[0.9983044,0.0003413438,0.00023921602,0.00092565967,0.00013746967,0.00005185897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002014893,0.00022262476,0.00031353612,0.00072181714,0.00016189525,0.00019486748,0.0035652306,0.00011304321,0.000058114903],"category_scores_gemma":[0.00006326767,0.00017453865,0.000085405176,0.00092138647,0.00024691533,0.00047679947,0.00088699843,0.00059029314,0.000005423315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003419191,0.000037536076,0.000015496196,0.000016312772,0.0000024407743,0.00001151696,0.0024541905,0.8070238,0.0000194924,0.052082717,0.000034427012,0.13829865],"study_design_scores_gemma":[0.00025494088,0.000078469784,0.00003435292,0.000058318456,0.0000017689265,0.000006355393,3.76653e-7,0.9294702,0.00006664193,0.06947665,0.00038275262,0.0001691779],"about_ca_topic_score_codex":0.000025233065,"about_ca_topic_score_gemma":0.000046477388,"teacher_disagreement_score":0.61385125,"about_ca_system_score_codex":0.00018905995,"about_ca_system_score_gemma":0.00053538097,"threshold_uncertainty_score":0.71174794},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013994209562291294,"score_gpt":0.2647044641196495,"score_spread":0.2507102545573582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313203312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049455564,0.000048290123,0.93159914,0.010647615,0.003136725,0.0016703734,0.00024962545,0.0003282203,0.002864467],"genre_scores_gemma":[0.52393526,0.0001395753,0.46698463,0.0043761116,0.00046939138,0.00050510454,0.00012897581,0.00009255576,0.0033683681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996119,0.00025451285,0.00059344847,0.001010934,0.00138274,0.0006393283],"domain_scores_gemma":[0.99807435,0.0002092729,0.0001980198,0.00090463995,0.00034539614,0.0002683152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018152905,0.0002563669,0.00032817211,0.0010289027,0.0009900427,0.00038225658,0.002387464,0.000050886396,0.00019470767],"category_scores_gemma":[0.000041814823,0.00027554086,0.000085252694,0.0032893934,0.0004936216,0.0018110005,0.0013100706,0.0003963106,0.00010424134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040650117,0.00078785996,0.00027934616,0.000024740844,0.00001939684,0.000027423494,0.0060265632,0.922797,0.0042115175,0.0074829096,0.0045584897,0.05374405],"study_design_scores_gemma":[0.0006928509,0.00062127743,0.0002974757,0.000019309471,0.0000035643066,0.000032953678,0.00007044169,0.9885436,0.0005879065,0.00088971265,0.00793092,0.00030993627],"about_ca_topic_score_codex":0.000034306224,"about_ca_topic_score_gemma":0.000009348529,"teacher_disagreement_score":0.4744797,"about_ca_system_score_codex":0.00023228537,"about_ca_system_score_gemma":0.0005276329,"threshold_uncertainty_score":0.99996966},"labels":[],"label_agreement":null},{"id":"W4313349371","doi":"10.1007/978-3-031-20350-3_13","title":"Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Combinatorics; Constraint (computer-aided design); Maximization; Mathematics; Monotone polygon; Similarity (geometry); Discrete mathematics; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.021047011313328538,"score_gpt":0.2545204206725667,"score_spread":0.23347340935923816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313349371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032354114,0.00027528225,0.98999757,0.0013275115,0.00075083395,0.00048602934,0.000012645549,0.00016445802,0.0069533144],"genre_scores_gemma":[0.089111775,0.0003834181,0.9033645,0.0045920224,0.00022931548,0.000026763359,0.00004629022,0.00007717993,0.0021687392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964458,0.00007812466,0.00044006083,0.0013984519,0.0010534956,0.00058406446],"domain_scores_gemma":[0.9981753,0.00022501578,0.00022717715,0.0009649907,0.00018979526,0.00021769706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009618008,0.00041116495,0.00038635219,0.00077254826,0.0004304554,0.0007465682,0.0018700133,0.00016139938,0.00047570604],"category_scores_gemma":[0.000048479036,0.00041277133,0.000073980686,0.0006126113,0.0010177175,0.00079169497,0.0017709248,0.0007650619,0.000022744814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039423135,0.000024483548,0.00004494399,0.000036776426,0.000011598715,0.00006678022,0.0004781504,0.51615447,0.000080864666,0.319135,0.000015711492,0.16394728],"study_design_scores_gemma":[0.00052490714,0.00012843542,0.00005089972,0.00007478383,0.000004727102,0.00009454863,6.968108e-7,0.90482074,0.0001323941,0.09098997,0.002606354,0.0005715336],"about_ca_topic_score_codex":0.000019895248,"about_ca_topic_score_gemma":0.0000289448,"teacher_disagreement_score":0.3886663,"about_ca_system_score_codex":0.00026527754,"about_ca_system_score_gemma":0.0005104062,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W4313598463","doi":"10.4230/lipics.mfcs.2023.13","title":"Rényi-Ulam Games and Online Computation with Imperfect Advice","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Agence Nationale de la Recherche","keywords":"Advice (programming); Imperfect; Computer science; Robustification; Perfect information; Competitive analysis; Computation; Upper and lower bounds; Online algorithm; Bidding; Overhead (engineering); Exploit; Knapsack problem; Theoretical computer science; Algorithm; Mathematics; Mathematical economics; Artificial intelligence; Computer security","score_opus":0.07780239002495741,"score_gpt":0.2124326388804439,"score_spread":0.13463024885548647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313598463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12923136,0.000031899144,0.8685175,0.00042118054,0.00017675212,0.00033232867,0.000016790838,0.0006953739,0.000576798],"genre_scores_gemma":[0.98017687,0.00037051676,0.016850723,0.0001234806,0.000036356498,0.0000010041892,0.000071756716,0.000023110779,0.002346197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849355,0.00013030044,0.00013895964,0.0008710363,0.00010481022,0.00026131462],"domain_scores_gemma":[0.9988723,0.00012419437,0.00014533229,0.00049259025,0.00020658736,0.00015901358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019254975,0.0002251932,0.00023354843,0.0002890721,0.00013655226,0.00018514977,0.0006536598,0.00014344978,0.000007937131],"category_scores_gemma":[0.000020256966,0.0002257745,0.00005770549,0.00066568947,0.00010021381,0.0003415928,0.0012070367,0.00039214213,0.00003800876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021254174,0.00006932969,0.0035596886,0.00009376842,0.000068755144,0.00016003977,0.0003943958,0.97598517,0.0000070880137,0.017965134,0.00036034093,0.0013150498],"study_design_scores_gemma":[0.00051597157,0.000107079104,0.005376687,0.000102074664,0.00002423782,0.000005840153,0.00007135936,0.98634,0.000007676464,0.0070360554,0.00012742018,0.0002856008],"about_ca_topic_score_codex":0.00017560928,"about_ca_topic_score_gemma":0.00014915822,"teacher_disagreement_score":0.8516668,"about_ca_system_score_codex":0.000074548014,"about_ca_system_score_gemma":0.00017056301,"threshold_uncertainty_score":0.9206817},"labels":[],"label_agreement":null},{"id":"W4315488924","doi":"10.1109/cdc51059.2022.9993099","title":"Online Multi-Robot Task Assignment with Stochastic Blockages","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Task (project management); Robot; Computer science; Routing (electronic design automation); Mathematical optimization; Assignment problem; Distributed computing; Path (computing); Greedy algorithm; Motion planning; Online and offline; Work (physics); Real-time computing; Artificial intelligence; Computer network; Algorithm; Engineering; Mathematics","score_opus":0.035682832148866375,"score_gpt":0.2750950731126994,"score_spread":0.239412240963833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315488924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004182443,0.00012555935,0.99139,0.0028562173,0.00037020678,0.0006071565,0.00007626472,0.00013405233,0.00025813206],"genre_scores_gemma":[0.9832234,0.00006758157,0.012606433,0.0021606528,0.000034888108,0.00018341797,0.000014431591,0.000020105543,0.0016891003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970541,0.00027334067,0.00037386513,0.0007758055,0.0010872529,0.000435612],"domain_scores_gemma":[0.99836606,0.00034832355,0.00016233744,0.00065268006,0.00017638021,0.00029422322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528683,0.0002802015,0.00036686214,0.00026161483,0.0006043793,0.0003624686,0.0009211545,0.00005266377,0.0006389467],"category_scores_gemma":[0.00007060349,0.00022379243,0.00006582873,0.00044658716,0.000089436886,0.00021961262,0.00030916155,0.00049429556,0.000042697327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009819431,0.0029803389,0.0002373812,0.000019239471,0.00018570585,0.00023809749,0.0014816127,0.5085129,0.007498512,0.028802121,0.003978951,0.44508317],"study_design_scores_gemma":[0.005649851,0.0013117683,0.00072498404,0.000041148047,0.000016718937,0.000035521618,0.00030289713,0.98822725,0.000036819365,0.0008547643,0.0024275698,0.00037073193],"about_ca_topic_score_codex":0.000022064838,"about_ca_topic_score_gemma":0.000047958587,"teacher_disagreement_score":0.9790409,"about_ca_system_score_codex":0.00008161203,"about_ca_system_score_gemma":0.00021012998,"threshold_uncertainty_score":0.912599},"labels":[],"label_agreement":null},{"id":"W4315589162","doi":"10.48550/arxiv.2301.03534","title":"The one-visibility Localization game","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Visibility; Combinatorics; Isoperimetric inequality; Mathematics; Constant (computer programming); Multiplicative function; Order (exchange); Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis; Physics","score_opus":0.15790263674329108,"score_gpt":0.21962362572479235,"score_spread":0.061720988981501274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315589162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002493937,0.000025039832,0.9936353,0.000716944,0.0005821838,0.0003847348,0.000005923028,0.00055025215,0.0016057001],"genre_scores_gemma":[0.9901044,0.00067403575,0.0010865607,0.00013466932,0.0000492558,0.0000019516463,0.000023070244,0.000018488501,0.007907569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815714,0.00027839706,0.00020168048,0.0008784331,0.00015131308,0.00033304535],"domain_scores_gemma":[0.99767464,0.00021411358,0.0001637761,0.0015216419,0.00028592977,0.00013987739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069027586,0.00018100927,0.00017149004,0.00013589386,0.00033892883,0.00036175808,0.0020680858,0.00018952192,0.000018787356],"category_scores_gemma":[0.0001246405,0.00016951944,0.00013089104,0.0008731199,0.00014634966,0.00028735553,0.0023909488,0.0004459806,0.00031481686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064575643,0.000036023324,0.00086637086,0.000029061159,0.000030523563,0.00001829726,0.00016492745,0.7337252,0.0000013069696,0.26388478,0.00063721894,0.0005998409],"study_design_scores_gemma":[0.00015223684,0.000018245462,0.00081723987,0.000029684072,0.000009539092,3.0992533e-7,0.000026443833,0.8698425,0.000012951295,0.12715665,0.0017604216,0.00017376056],"about_ca_topic_score_codex":0.00011352321,"about_ca_topic_score_gemma":0.00011852362,"teacher_disagreement_score":0.9925487,"about_ca_system_score_codex":0.00017612007,"about_ca_system_score_gemma":0.00023152337,"threshold_uncertainty_score":0.69128025},"labels":[],"label_agreement":null},{"id":"W4318023126","doi":"10.1007/978-3-031-25211-2_7","title":"Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Polygon (computer graphics); Regular polygon; Simple (philosophy); Plane (geometry); Obstacle; Computer science; Metric (unit); Combinatorics; Euclidean geometry; Convex polygon; Mathematics; Geometry; Telecommunications; Geography","score_opus":0.025080428977623633,"score_gpt":0.26063191313751566,"score_spread":0.23555148415989202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318023126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018664161,0.00011818397,0.9941232,0.0009825459,0.00074054446,0.0006080273,0.000008220965,0.00037561278,0.0028570227],"genre_scores_gemma":[0.055052962,0.00035709687,0.93410504,0.0025187542,0.00069074996,0.00007183067,0.000054179833,0.00020258606,0.0069467756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568295,0.00007096665,0.0005695129,0.0017066419,0.0010930556,0.0008768612],"domain_scores_gemma":[0.99731654,0.000680043,0.00021326543,0.0013153047,0.00025565582,0.00021918956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011855561,0.00050290354,0.0005749986,0.0012350256,0.00019161525,0.0005820081,0.0024655191,0.00029520752,0.000039487146],"category_scores_gemma":[0.00018514368,0.0004298549,0.000077918776,0.0017100034,0.0004943886,0.0006277353,0.0009742871,0.0010963884,0.00011146106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040646115,0.00007518033,0.00040515556,0.00008614177,0.00001949209,0.00044725437,0.0022242095,0.4173543,0.000055324177,0.008294031,0.00013013853,0.57086813],"study_design_scores_gemma":[0.00061672635,0.00042233284,0.0002624068,0.00041290754,0.0000036768743,0.00007489408,9.787068e-7,0.96595913,0.0005963897,0.02729639,0.0036181621,0.00073599484],"about_ca_topic_score_codex":0.00013670653,"about_ca_topic_score_gemma":0.0013047777,"teacher_disagreement_score":0.57013214,"about_ca_system_score_codex":0.0002879764,"about_ca_system_score_gemma":0.0007911677,"threshold_uncertainty_score":0.99981534},"labels":[],"label_agreement":null},{"id":"W4319304668","doi":"10.1007/s10044-023-01131-5","title":"Learning automata-based partitioning algorithms for stochastic grouping problems with non-equal partition sizes","year":2023,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Partition (number theory); Theoretical computer science; Heuristic; Key (lock); Context (archaeology); Reinforcement learning; Learning automata; Constraint (computer-aided design); Automaton; Artificial intelligence; Algorithm; Mathematics","score_opus":0.027467271016067208,"score_gpt":0.28809909852615057,"score_spread":0.26063182751008335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319304668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013968818,0.0000080721275,0.9968182,0.0008999391,0.000008022047,0.0005016487,0.000012596156,0.0003146783,0.000039951603],"genre_scores_gemma":[0.9793949,0.000012349428,0.0181501,0.00012477706,0.00004014195,0.0018288803,0.00034023405,0.000011850342,0.00009676142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.000037174977,0.00022018366,0.00040055608,0.00020198262,0.00025622206],"domain_scores_gemma":[0.9992489,0.00016363109,0.00011827832,0.00024299225,0.00012799368,0.00009816889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035271695,0.00011180972,0.00017516568,0.00030856338,0.0005476651,0.0003113092,0.00018329517,0.000032232158,0.0000111753425],"category_scores_gemma":[0.000012216039,0.000098679964,0.00007371755,0.001770124,0.000040360643,0.00021091958,0.000051354542,0.000083470535,0.000025004523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016370049,0.00005472893,0.00380621,0.000049778075,0.00014299994,4.336607e-7,0.00034328454,0.93579316,0.00012399083,0.0015616285,0.000034859564,0.058087297],"study_design_scores_gemma":[0.0003512198,0.000072693314,0.0034148316,0.00002150657,0.000105868574,5.057619e-7,0.00006536572,0.9949371,0.00006585431,0.0005055325,0.00031925974,0.00014024643],"about_ca_topic_score_codex":0.000041627893,"about_ca_topic_score_gemma":0.00005624179,"teacher_disagreement_score":0.9786681,"about_ca_system_score_codex":0.000016579652,"about_ca_system_score_gemma":0.000028349057,"threshold_uncertainty_score":0.42122525},"labels":[],"label_agreement":null},{"id":"W4320085883","doi":"10.1016/j.automatica.2023.110873","title":"From drinking philosophers to asynchronous path-following robots","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Sleep Foundation; Defense Advanced Research Projects Agency; University of Southern California; National Aeronautics and Space Administration; Simon Fraser University; National Science Foundation","keywords":"Asynchronous communication; Robot; Asynchrony (computer programming); Deadlock; Computer science; Distributed computing; Path (computing); State (computer science); Deadlock prevention algorithms; Motion planning; Resource allocation; Collision avoidance; Resource (disambiguation); Control (management); Mathematical optimization; Collision; Artificial intelligence; Algorithm; Computer security; Computer network; Mathematics","score_opus":0.02461861265299646,"score_gpt":0.28312572606627223,"score_spread":0.25850711341327576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320085883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03928122,0.00001797025,0.9381037,0.012334747,0.00070571323,0.00032768896,0.0000017416577,0.0023275493,0.0068997047],"genre_scores_gemma":[0.73087454,0.000004299539,0.26768923,0.0010174254,0.00009725313,0.000039239858,0.000010259202,0.000018908611,0.00024886383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986461,0.00006375729,0.00021093049,0.0003323946,0.00038942642,0.0003574366],"domain_scores_gemma":[0.99910444,0.00015349293,0.000036030367,0.00050064496,0.000029564615,0.00017582232],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027513987,0.00011231288,0.00015174138,0.00013877911,0.00015993559,0.00026746452,0.0007102635,0.000044571425,0.000069817965],"category_scores_gemma":[0.00010436726,0.000109540284,0.00007126374,0.00091855065,0.000012285499,0.00033155843,0.0003558716,0.0000821455,0.002724261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007910748,0.00031168235,0.0038055077,0.0000925191,0.00042252682,0.0009043776,0.05516904,0.2917891,0.0071412907,0.18361238,0.03072688,0.42601678],"study_design_scores_gemma":[0.00022810137,0.000046601723,0.002979048,0.00008201332,0.0000047414433,0.0000012420118,0.00006750764,0.9774966,0.00020795951,0.017693402,0.0009862998,0.00020645747],"about_ca_topic_score_codex":0.00003097807,"about_ca_topic_score_gemma":0.0000027538467,"teacher_disagreement_score":0.6915933,"about_ca_system_score_codex":0.000046941343,"about_ca_system_score_gemma":0.000060517625,"threshold_uncertainty_score":0.99805224},"labels":[],"label_agreement":null},{"id":"W4322576860","doi":"10.1016/b978-0-32-391244-0.00013-9","title":"Modeling active tracers","year":2023,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.043333874872112946,"score_gpt":0.26679137004530185,"score_spread":0.2234574951731889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322576860","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.1121926e-7,0.0000688522,0.032550905,0.000245882,0.00043993373,0.00040248592,0.000010172729,0.00047245578,0.9658087],"genre_scores_gemma":[0.00010890935,0.00013690829,0.0075662234,0.000301166,0.00011821368,0.000030415831,0.000012231255,0.000073974334,0.99165195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982158,0.000027528482,0.00032456088,0.0005963342,0.00049453886,0.00034122617],"domain_scores_gemma":[0.99883425,0.000051028113,0.00009946332,0.00068469014,0.00015990976,0.0001706389],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025401235,0.00030206394,0.0003250515,0.00026432762,0.00014969848,0.00017633318,0.0009023761,0.0002525251,0.000066795794],"category_scores_gemma":[0.00001539757,0.00029622077,0.00019208589,0.00003367166,0.00005152987,0.0001591326,0.00037193342,0.00054190465,0.0008982178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021069025,0.0000022001325,2.0186306e-8,0.000019487894,0.00004167494,0.0000207995,0.0005046447,0.0042974614,0.0000025144377,0.09733053,0.00007030273,0.89770824],"study_design_scores_gemma":[0.00022520978,0.00004678862,2.1155856e-7,0.00023746547,0.00001794095,0.000007090114,0.000010285845,0.49311617,0.000012109288,0.07476183,0.43104511,0.00051979313],"about_ca_topic_score_codex":5.630934e-7,"about_ca_topic_score_gemma":0.000011320512,"teacher_disagreement_score":0.8971885,"about_ca_system_score_codex":0.00009070304,"about_ca_system_score_gemma":0.00020966721,"threshold_uncertainty_score":0.999949},"labels":[],"label_agreement":null},{"id":"W4323659995","doi":"10.1016/j.ipl.2023.106391","title":"Optimal circle search despite the presence of faulty robots","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Search and rescue; Computer science; Linear search; Crash; Search algorithm; Algorithm; Mobile robot; Artificial intelligence","score_opus":0.024219429274543396,"score_gpt":0.2745886169192998,"score_spread":0.2503691876447564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323659995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042638343,0.00000942873,0.94059473,0.01568319,0.000094597766,0.00020210902,0.0000018589568,0.00024850736,0.00052721816],"genre_scores_gemma":[0.9616261,0.000011486082,0.03530186,0.0029145929,0.000022112155,0.000029171928,0.00001578015,0.0000056206,0.000073246876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987956,0.00005226623,0.00029065995,0.000102151345,0.00051014044,0.0002491789],"domain_scores_gemma":[0.99928975,0.00007653111,0.00012127891,0.00026432725,0.00020025797,0.00004785175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006891066,0.000068748144,0.0000737575,0.00019245317,0.00024329418,0.0004029033,0.0007548845,0.00002872172,0.0000064361093],"category_scores_gemma":[0.00008334606,0.00005457719,0.000030566265,0.0012150255,0.00009622178,0.0032670153,0.00020218194,0.00013382913,0.00013493566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000392661,0.0000076997885,0.00018841482,0.000098571974,0.000005468317,9.4611806e-7,0.012379207,0.85915273,0.00094805093,0.0007924685,0.003879789,0.12254275],"study_design_scores_gemma":[0.00018109435,0.000015916905,0.003936589,0.000042911164,0.0000011738708,0.0000037867458,0.00021712793,0.9918381,0.001838593,0.000049586364,0.001787622,0.00008748439],"about_ca_topic_score_codex":0.0000112294865,"about_ca_topic_score_gemma":3.300318e-7,"teacher_disagreement_score":0.9189878,"about_ca_system_score_codex":0.000019190999,"about_ca_system_score_gemma":0.00009356212,"threshold_uncertainty_score":0.3885206},"labels":[],"label_agreement":null},{"id":"W4327518366","doi":"10.1007/978-3-030-54621-2_739-1","title":"Bilevel Knapsack Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Knapsack problem; Bilevel optimization; Computer science; Mathematics; Mathematical optimization; Optimization problem","score_opus":0.029844876455141705,"score_gpt":0.24090091525612406,"score_spread":0.21105603880098237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327518366","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.6755825e-8,0.00007371525,0.50461173,0.00025170675,0.0004434349,0.00041676173,0.000014952945,0.00028530243,0.4939023],"genre_scores_gemma":[0.000011342266,0.008283957,0.22889419,0.00007229387,0.00013322911,0.00003635381,0.00023805426,0.00010272572,0.76222783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975077,0.000037008816,0.00075463636,0.0006541242,0.0007233176,0.0003232149],"domain_scores_gemma":[0.99787027,0.00012669848,0.0005357303,0.00083605637,0.00048066842,0.00015058916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036809084,0.00036996132,0.0004497808,0.0005610745,0.00010072938,0.000100030324,0.0010103084,0.00039368053,0.0004973204],"category_scores_gemma":[0.00009841062,0.00037407997,0.0001614321,0.0003122586,0.00009120222,0.0005272015,0.00039655124,0.00032542093,0.0003801518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025485244,0.000027079652,0.0000055253568,0.00012406606,0.000044788394,0.000006698309,0.00031004436,0.7001243,0.0000013618852,0.28147274,0.007989538,0.009891278],"study_design_scores_gemma":[0.000534535,0.00018335956,0.000011339411,0.00039008458,0.000034697234,0.000006639347,0.0000042434444,0.7965488,0.000008990055,0.03434782,0.16716105,0.0007684676],"about_ca_topic_score_codex":0.000006662687,"about_ca_topic_score_gemma":0.0000043696045,"teacher_disagreement_score":0.27571756,"about_ca_system_score_codex":0.0000612167,"about_ca_system_score_gemma":0.00028684776,"threshold_uncertainty_score":0.99987113},"labels":[],"label_agreement":null},{"id":"W4327814720","doi":"10.1145/3588437","title":"Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Combinatorics; Mathematics; Graph; Discrete mathematics; Node (physics); Algorithm; Computer science","score_opus":0.035051444683297794,"score_gpt":0.288405559114852,"score_spread":0.2533541144315542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327814720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004474002,0.000016810525,0.9908914,0.0024806145,0.00046185424,0.00033816742,0.0000217907,0.0007059787,0.00060935784],"genre_scores_gemma":[0.7584311,0.0003393387,0.23756845,0.0006072823,0.00004053889,0.00028897208,0.00003059659,0.000054783144,0.002638956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998226,0.00012140652,0.00030072962,0.00048537023,0.00040552314,0.00046095427],"domain_scores_gemma":[0.99869263,0.00021841754,0.00004152642,0.00080304855,0.000078239966,0.0001661154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003259152,0.00018646417,0.0001873881,0.0006984965,0.00022631935,0.00013806373,0.00091996306,0.00010672229,0.00010310522],"category_scores_gemma":[0.00003977181,0.00018058937,0.00010550732,0.0025036747,0.000059191505,0.00036559004,0.000022949827,0.0003252817,0.0004317431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029597068,0.00057597813,0.00012287518,0.000029100998,0.000059747887,0.0002546066,0.002144704,0.10996587,0.0002580203,0.0024523987,0.00033491108,0.8837722],"study_design_scores_gemma":[0.0012026923,0.0003287623,0.004805686,0.000044674154,0.000009920333,0.000028875396,0.00012400099,0.9865959,0.000639135,0.0040462827,0.0017962159,0.000377836],"about_ca_topic_score_codex":0.00004813733,"about_ca_topic_score_gemma":0.000045235494,"teacher_disagreement_score":0.88339436,"about_ca_system_score_codex":0.000059121037,"about_ca_system_score_gemma":0.00009512836,"threshold_uncertainty_score":0.7364221},"labels":[],"label_agreement":null},{"id":"W4364377325","doi":"10.1007/s10044-023-01163-x","title":"The object migration automata: its field, scope, applications, and future research challenges","year":2023,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Automaton; Artificial intelligence; Scope (computer science); Benchmark (surveying); Cellular automaton; Theoretical computer science; Field (mathematics); Data science; Machine learning; Programming language; Mathematics","score_opus":0.04986487048192982,"score_gpt":0.34974039894459075,"score_spread":0.2998755284626609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364377325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000835621,0.007859424,0.90121055,0.086433716,0.000026067668,0.0011620983,0.000015065259,0.00031557205,0.0021418976],"genre_scores_gemma":[0.5935253,0.39297432,0.0030148996,0.000685978,0.0006796337,0.0065032006,0.00015860931,0.000026832779,0.0024312574],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987214,0.0001357699,0.00019328907,0.00041218146,0.00030426873,0.00023307187],"domain_scores_gemma":[0.99869674,0.00036095252,0.000054871063,0.0005836037,0.00020582015,0.00009802563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095691043,0.000086549815,0.00011600301,0.0003171431,0.0010079668,0.00045593758,0.00043517916,0.00005382834,0.000007837865],"category_scores_gemma":[0.000014037815,0.000063723885,0.000044235916,0.0025175456,0.000054737764,0.00017202746,0.00023417322,0.00014979644,0.00008425052],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.066368e-7,0.000028211403,0.0005426543,0.000025740359,0.00009163413,3.011491e-7,0.00070631236,0.00005797021,0.0000548785,0.043009203,0.0010896254,0.9543928],"study_design_scores_gemma":[0.00022073912,0.00004861006,0.023601033,0.000009136992,0.000073507916,0.0000028616266,0.0016166555,0.29392186,0.00028739305,0.004279941,0.6756969,0.0002413782],"about_ca_topic_score_codex":0.000043015458,"about_ca_topic_score_gemma":0.00051524636,"teacher_disagreement_score":0.9541514,"about_ca_system_score_codex":0.0000105191775,"about_ca_system_score_gemma":0.000025136816,"threshold_uncertainty_score":0.7752568},"labels":[],"label_agreement":null},{"id":"W4366733065","doi":"10.48550/arxiv.2304.10028","title":"Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Computing, Information and Cognitive Systems","keywords":"Center (category theory); Centroid; Bounded function; Competitive analysis; Scheduling (production processes); Object (grammar); Computer science; Facility location problem; Algorithm; Mathematics; Mathematical optimization; Upper and lower bounds; Artificial intelligence","score_opus":0.12959671890829533,"score_gpt":0.21220062471596027,"score_spread":0.08260390580766494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366733065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030551486,0.00002608265,0.9643745,0.002022369,0.00088821206,0.00083711185,0.00005335332,0.00010529587,0.0011416061],"genre_scores_gemma":[0.99373406,0.00014100109,0.0019564563,0.00006707233,0.000016593101,0.0000022484307,0.0000031614595,0.000009848101,0.0040695346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990094,0.0001450809,0.00019177659,0.00035756812,0.00010137957,0.0001948236],"domain_scores_gemma":[0.99789584,0.00063992536,0.00031180485,0.00088646804,0.00022752199,0.000038446717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034362532,0.00012168348,0.00018527592,0.00009236527,0.00019010711,0.00004538798,0.0019962906,0.00008365991,0.000005657456],"category_scores_gemma":[0.00018832045,0.00008985563,0.0002754562,0.0004751393,0.00022897411,0.000117517775,0.0017752459,0.00020743335,0.0000019077563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009438719,0.000022683287,0.00061721273,0.0001211881,0.000060915118,0.0000015674048,0.0009515557,0.6967083,0.000033043092,0.30079877,0.00064142747,0.000033890607],"study_design_scores_gemma":[0.00035990844,0.000028064434,0.00074145343,0.00026566492,0.000043672753,4.581618e-7,0.0010571403,0.92416245,0.00022478246,0.07253956,0.00042387834,0.00015295108],"about_ca_topic_score_codex":0.00025886716,"about_ca_topic_score_gemma":0.000089638335,"teacher_disagreement_score":0.9631826,"about_ca_system_score_codex":0.00006159171,"about_ca_system_score_gemma":0.00019143283,"threshold_uncertainty_score":0.37096378},"labels":[],"label_agreement":null},{"id":"W4366809744","doi":"10.5220/0006091600001482","title":"Search-and-Fetch with 2 Robots on a Disk","year":2017,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Fetch; Robot; Computer science; Artificial intelligence; Geology","score_opus":0.03486497973415568,"score_gpt":0.28953936542862124,"score_spread":0.25467438569446554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366809744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008603365,0.00000664004,0.8674689,0.013688163,0.00005004072,0.00017152441,4.1731656e-7,0.00012291175,0.10988802],"genre_scores_gemma":[0.91367406,0.000022697894,0.07847039,0.00050173124,0.00001527627,0.0000059194354,3.8333818e-7,0.0000045644456,0.0073049963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993895,0.00002069176,0.00004657099,0.00019583928,0.00019358817,0.00015377122],"domain_scores_gemma":[0.9992629,0.000020196556,0.00001604665,0.00055916817,0.000041337942,0.00010031464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014510126,0.00005339658,0.000056049274,0.000033116765,0.00032095177,0.00056207407,0.0005387003,0.000016674212,0.000037171194],"category_scores_gemma":[0.000016996037,0.00003386519,0.000009671076,0.000038437865,0.0000663827,0.00037688497,0.00022150842,0.00007166787,0.00007203123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019735804,0.000097183896,0.0070511377,0.000013248059,0.000018847948,0.000027582317,0.00086896337,0.009075766,0.00006880869,0.8712201,0.0013139796,0.110224634],"study_design_scores_gemma":[0.0010836564,0.00053865183,0.041503534,0.000042579028,0.0000018330508,0.000014380963,0.000029605377,0.9506006,0.001054378,0.0020872701,0.0027823646,0.00026112932],"about_ca_topic_score_codex":0.00007194315,"about_ca_topic_score_gemma":0.00003159187,"teacher_disagreement_score":0.94152486,"about_ca_system_score_codex":0.00000652806,"about_ca_system_score_gemma":0.000029780529,"threshold_uncertainty_score":0.54200935},"labels":[],"label_agreement":null},{"id":"W4367183818","doi":"10.3390/a16050222","title":"Asynchronous Gathering in a Dangerous Ring","year":2023,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Gruppo Nazionale per il Calcolo Scientifico; Natural Sciences and Engineering Research Council of Canada; Università di Pisa; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Rendezvous; Asynchronous communication; Computer science; Node (physics); Mathematical proof; Ring (chemistry); Constructive; Set (abstract data type); Mobile agent; A priori and a posteriori; Ring network; Process (computing); Distributed computing; Computer network; Mathematics","score_opus":0.02803209220788296,"score_gpt":0.2773430951888817,"score_spread":0.24931100298099876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367183818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094901435,0.00006659427,0.98325926,0.00071310205,0.00028156213,0.00015295472,6.6886327e-7,0.0005877482,0.0054479656],"genre_scores_gemma":[0.4339218,0.00028314698,0.56278,0.00055933243,0.00020901737,0.00013322677,0.000010276036,0.000048067537,0.0020550888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991769,0.000032046722,0.000121022385,0.00021741932,0.00016282564,0.0002897647],"domain_scores_gemma":[0.999618,0.000044375694,0.000019314104,0.00023983997,0.000020726293,0.000057768124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000305787,0.00006495923,0.00008217058,0.00017312744,0.000055727658,0.00009921305,0.0003851627,0.000029874833,0.000014609161],"category_scores_gemma":[0.000023741453,0.00006507803,0.00002153175,0.0009246753,0.000013584736,0.00025883093,0.00021253273,0.000099212986,0.0003664217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013351965,0.00006232774,0.0011851748,0.000023521066,0.000012082431,0.00042727214,0.005332307,0.047418598,0.0006019707,0.012945101,0.00027207666,0.93171823],"study_design_scores_gemma":[0.00024245637,0.000025824309,0.002196089,0.000017608563,3.3913224e-7,0.000011240241,0.000042429496,0.9940854,0.0001380047,0.0010909222,0.0020453758,0.000104333674],"about_ca_topic_score_codex":0.000054360913,"about_ca_topic_score_gemma":0.000015515958,"teacher_disagreement_score":0.9466668,"about_ca_system_score_codex":0.00003801601,"about_ca_system_score_gemma":0.0000309898,"threshold_uncertainty_score":0.4709732},"labels":[],"label_agreement":null},{"id":"W4372272740","doi":"10.4230/lipics.icalp.2023.80","title":"Efficient Caching with Reserves via Marking","year":2023,"lang":"en","type":"preprint","venue":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Competitive analysis; Online algorithm; Paging; Computer science; Randomized algorithm; Cache; Upper and lower bounds; Simple (philosophy); Function (biology); Rounding; Randomized rounding; Dual (grammatical number); Time complexity; Freivalds' algorithm; CPU cache; Algorithm; Mathematical optimization; Theoretical computer science; Approximation algorithm; Mathematics; Parallel computing; Computer network","score_opus":0.07166955629201377,"score_gpt":0.36170394450319693,"score_spread":0.29003438821118316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372272740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976654,0.00024116493,0.0025186471,0.014843446,0.00046142747,0.001043791,0.00028696904,0.00006427372,0.0038862806],"genre_scores_gemma":[0.97807777,0.0017013822,0.019283947,0.00031560648,0.00029712656,0.000037915168,0.000017878143,0.000049153852,0.00021920893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98906785,0.0003635654,0.0018950681,0.0026953418,0.0010835723,0.0048946124],"domain_scores_gemma":[0.9875726,0.0016790286,0.0005361036,0.0018522645,0.0015546568,0.006805344],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.016384637,0.0006405822,0.0013217555,0.0026380736,0.0010865779,0.0023440362,0.0046540922,0.000395665,0.000060815124],"category_scores_gemma":[0.0038183304,0.00055646786,0.00021867883,0.001802865,0.010213498,0.0012818665,0.008433633,0.002155813,0.000039212784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006576141,0.00022206249,0.0064205215,0.00020299267,0.000036842728,0.000008101948,0.00007595942,0.023812594,0.00023878168,0.96791476,0.000030806325,0.00097079796],"study_design_scores_gemma":[0.0010473402,0.00072156504,0.030513233,0.00037560565,0.000022115504,0.000043605403,0.00034555915,0.81063014,0.0011274795,0.15386154,0.00049441174,0.00081740017],"about_ca_topic_score_codex":0.0061723567,"about_ca_topic_score_gemma":0.000573292,"teacher_disagreement_score":0.81405324,"about_ca_system_score_codex":0.001308957,"about_ca_system_score_gemma":0.009296047,"threshold_uncertainty_score":0.9996887},"labels":[],"label_agreement":null},{"id":"W4376607417","doi":"10.1137/1.9781611977714.16","title":"Exponential Convergence of Sinkhorn Under Regularization Scheduling","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Scaling; Regularization (linguistics); Mathematical optimization; Exponential function; Rate of convergence; Computer science; Applied mathematics; Convergence (economics); Mathematics; Key (lock); Artificial intelligence","score_opus":0.09839758548177648,"score_gpt":0.25992012151857014,"score_spread":0.16152253603679367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037197475,0.000016750753,0.92674506,0.00012949428,0.00037725002,0.0012919244,0.00004727066,0.00018188487,0.071173176],"genre_scores_gemma":[0.0016320962,0.00013467445,0.50824195,0.000182019,0.0006768693,0.00017672876,0.00017721414,0.00017708843,0.48860136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984872,0.0000042590846,0.00053687755,0.00037645685,0.00036990587,0.00022532995],"domain_scores_gemma":[0.99885803,0.00017437947,0.00041693158,0.00032341515,0.00013789612,0.0000893362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048544598,0.0002490938,0.00041176451,0.000063275766,0.00018800238,0.00010810589,0.00035583667,0.00058019074,0.000012370721],"category_scores_gemma":[0.000018124441,0.00024305207,0.00028099385,0.00004501438,0.00016962443,0.00004987003,0.00026812562,0.00029570895,0.0000073712135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005281904,0.000011354766,3.2542424e-8,0.00020351466,0.00011872493,1.19015795e-7,0.0007920664,0.00035577806,0.0006179848,0.9941509,0.0005915857,0.0031526843],"study_design_scores_gemma":[0.0013605262,0.00007840273,5.609306e-8,0.00031186533,0.00010773499,0.0000018326608,0.00025029527,0.06202092,0.0026327674,0.9293983,0.0033789587,0.0004583639],"about_ca_topic_score_codex":7.9576506e-7,"about_ca_topic_score_gemma":4.3385808e-7,"teacher_disagreement_score":0.41850308,"about_ca_system_score_codex":0.00002676808,"about_ca_system_score_gemma":0.00016652491,"threshold_uncertainty_score":0.9911376},"labels":[],"label_agreement":null},{"id":"W4376874338","doi":"10.1007/s10107-023-01971-3","title":"A colorful Steinitz Lemma with application to block-structured integer programs","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Einstein Stiftung Berlin; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Lemma (botany); Norm (philosophy); Integer (computer science); Bounded function; Upper and lower bounds; Integer programming; Discrete mathematics; Sequence (biology); Algorithm; Computer science","score_opus":0.022556172994474082,"score_gpt":0.2743292564063316,"score_spread":0.2517730834118575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376874338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068442314,0.0000039073693,0.9864935,0.0023231436,0.000035245357,0.0017982805,5.7226606e-7,0.0013008191,0.0012002814],"genre_scores_gemma":[0.51482356,7.088032e-7,0.48324475,0.00019604574,0.000038153143,0.0010290828,0.000013482518,0.000030462885,0.00062378997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811304,0.00005232952,0.00030741745,0.00046105622,0.00052085984,0.00054529286],"domain_scores_gemma":[0.99884707,0.000098264165,0.000069409056,0.0005469529,0.00016109864,0.00027721276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051778427,0.00017914199,0.000217907,0.00017468134,0.00015759966,0.00046582668,0.0006696426,0.00007184517,0.000015113488],"category_scores_gemma":[0.000102283884,0.00013226758,0.000049876227,0.0019125787,0.00007080598,0.00021648676,0.00029750585,0.00017186397,0.0007073034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002475557,0.00031063627,0.0002063447,0.00027366224,0.000050851948,0.000033956465,0.004900476,0.0021596397,0.00039781182,0.2566724,0.0004252999,0.73454416],"study_design_scores_gemma":[0.001017581,0.0011887677,0.00013458102,0.00026376403,0.000023265577,0.00009213397,0.0007008679,0.90153503,0.0010608084,0.04053661,0.05263474,0.00081186043],"about_ca_topic_score_codex":0.000004174788,"about_ca_topic_score_gemma":0.0000098195715,"teacher_disagreement_score":0.8993754,"about_ca_system_score_codex":0.000039976334,"about_ca_system_score_gemma":0.000047975165,"threshold_uncertainty_score":0.909119},"labels":[],"label_agreement":null},{"id":"W4377966775","doi":"10.46254/na07.20220065","title":"A novel sorting approach under uncertainty: A Monte-Carlo simulation with temporal evaluations","year":2023,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Monte Carlo method; Computer science; Sorting; Statistical physics; Algorithm; Statistics; Mathematics; Physics","score_opus":0.11107833854571146,"score_gpt":0.34866918914694145,"score_spread":0.23759085060122997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377966775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038842084,0.0000031473212,0.9889727,0.0013639941,0.00003504493,0.00036503185,0.0000010848884,0.0005946201,0.004780162],"genre_scores_gemma":[0.80927753,8.940813e-7,0.18812403,0.00027073556,0.000018602546,0.00004636318,0.000012613944,0.000009518627,0.0022397055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.000052536598,0.00020437884,0.00032821757,0.00048353555,0.00026336045],"domain_scores_gemma":[0.9991837,0.00012117383,0.000070010006,0.00031779305,0.00022197377,0.000085357984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058807625,0.000100657846,0.00009967204,0.00018365549,0.00020903554,0.00022685192,0.0002963714,0.00003965109,0.000022885828],"category_scores_gemma":[0.00006198365,0.000076449665,0.000032852506,0.0013945475,0.00002915987,0.0005001133,0.00012602363,0.00009377685,0.00005218853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026606747,0.000041332572,0.00032635286,0.0000051382685,0.00001133724,4.417275e-7,0.0006151097,0.9827676,0.00003901891,0.014082324,0.00012778318,0.0019809222],"study_design_scores_gemma":[0.00048450837,0.000043905555,0.0008542365,0.0000078353305,0.0000033663246,0.0000018866193,0.0003076321,0.99738884,0.0000047568815,0.0006770686,0.00010670917,0.00011924914],"about_ca_topic_score_codex":0.00012418676,"about_ca_topic_score_gemma":0.000060029055,"teacher_disagreement_score":0.80539334,"about_ca_system_score_codex":0.00004388902,"about_ca_system_score_gemma":0.00015656547,"threshold_uncertainty_score":0.3117527},"labels":[],"label_agreement":null},{"id":"W4377971906","doi":"10.1007/978-3-031-32733-9_23","title":"Overcoming Probabilistic Faults in Disoriented Linear Search","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Probabilistic logic; Computer science; Randomized algorithm; Competitive analysis; Deterministic algorithm; Path (computing); Bernoulli's principle; Constant (computer programming); Algorithm; Leverage (statistics); Mathematics; Mathematical optimization; Combinatorics; Artificial intelligence; Upper and lower bounds","score_opus":0.03432631466397401,"score_gpt":0.2869286109457508,"score_spread":0.2526022962817768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377971906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013950632,0.000054286924,0.9947682,0.00096438325,0.0010570372,0.00074082473,0.0000069254797,0.00027448256,0.0019943514],"genre_scores_gemma":[0.17004237,0.0002510795,0.82127863,0.0018688039,0.0007091419,0.0000781605,0.00005827428,0.00018818228,0.0055253687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953495,0.00007952821,0.0006279804,0.0016454422,0.0013727614,0.00092473207],"domain_scores_gemma":[0.9975028,0.0007115688,0.00013534556,0.0012004835,0.00023202485,0.00021776557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016406532,0.00043595667,0.00048291095,0.0014931591,0.00021009007,0.0003576972,0.0030375738,0.000291269,0.000018141582],"category_scores_gemma":[0.00030628603,0.0004080996,0.0000985456,0.0019296005,0.00054401316,0.00060521736,0.0020198263,0.0012080461,0.0001216882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008908822,0.000060623555,0.00021906274,0.00010490111,0.0000067851274,0.0001787723,0.0020774743,0.7499063,0.000033206048,0.04842349,0.000013601565,0.1989669],"study_design_scores_gemma":[0.00034695302,0.0001094011,0.00021460322,0.00046561498,0.0000014809384,0.000012100558,3.0005972e-7,0.94112635,0.00006855552,0.056851413,0.00037204663,0.00043120052],"about_ca_topic_score_codex":0.00006783534,"about_ca_topic_score_gemma":0.00028301438,"teacher_disagreement_score":0.1985357,"about_ca_system_score_codex":0.00039772998,"about_ca_system_score_gemma":0.00065592193,"threshold_uncertainty_score":0.9998371},"labels":[],"label_agreement":null},{"id":"W4378469689","doi":"10.1016/j.artint.2023.103950","title":"Conflict-tolerant and conflict-free multi-agent meeting","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Sleep Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Heuristics; Task (project management); Mathematical optimization; Computer science; Heuristic; Function (biology); Path (computing); Point (geometry); Operations research; Artificial intelligence; Mathematics; Engineering","score_opus":0.15850144781698802,"score_gpt":0.3451729614154096,"score_spread":0.18667151359842157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378469689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010938832,0.00018234874,0.9818825,0.0036885417,0.00049624173,0.00035507767,0.000005570766,0.000614437,0.0018364104],"genre_scores_gemma":[0.9245375,0.0008302621,0.070997134,0.001459956,0.00013992701,0.000071282906,0.000010758178,0.000034300017,0.001918906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.0000902423,0.0003833225,0.0004602446,0.00031193954,0.0004272785],"domain_scores_gemma":[0.9988161,0.00020183128,0.00007297037,0.00057575834,0.0001480273,0.00018533652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072858634,0.00014449892,0.00015693808,0.00016985653,0.00028094288,0.00034476316,0.0008618166,0.00006358954,0.00004520842],"category_scores_gemma":[0.0003139081,0.00013869963,0.000044614782,0.00075415446,0.00013428215,0.00029931308,0.0006201318,0.0001540932,0.0007339838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020840542,0.00019500295,0.0005863479,0.00006219914,0.00004825623,0.00011734807,0.021547383,0.03901427,0.011385589,0.63807476,0.0031941761,0.28575385],"study_design_scores_gemma":[0.000052815787,0.000051275318,0.00018546026,0.000027229096,0.000002462448,0.0000057431507,0.00035286503,0.9687486,0.015267343,0.0048288195,0.010278663,0.0001986903],"about_ca_topic_score_codex":0.00011559761,"about_ca_topic_score_gemma":0.000058991645,"teacher_disagreement_score":0.92973435,"about_ca_system_score_codex":0.00001783281,"about_ca_system_score_gemma":0.000044379354,"threshold_uncertainty_score":0.94341224},"labels":[],"label_agreement":null},{"id":"W4378801305","doi":"10.1145/3558481.3591084","title":"An Associativity Threshold Phenomenon in Set-Associative Caches","year":2023,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Associative property; Cache; Parallel computing; Cache algorithms; Set (abstract data type); Disjoint sets; Paging; Hash function; Bus sniffing; Latency (audio); CPU cache; Cache pollution; Concurrency; Theoretical computer science; Distributed computing; Computer network; Programming language; Mathematics; Discrete mathematics","score_opus":0.057175379651249615,"score_gpt":0.3263075660319567,"score_spread":0.2691321863807071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378801305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46217522,0.000040043917,0.27952102,0.018392624,0.00063839095,0.0012860271,0.00003153432,0.0036136515,0.2343015],"genre_scores_gemma":[0.99211776,0.000019894927,0.00471841,0.0004204233,0.000020846875,0.000022662958,0.000013027398,0.000007290221,0.0026596535],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877757,0.00014930092,0.00014742959,0.00028781878,0.00029701222,0.00034088458],"domain_scores_gemma":[0.99943054,0.00012346395,0.00005062896,0.0002516886,0.000058400063,0.00008526717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010358866,0.00008416558,0.00012753358,0.00016928445,0.00009157426,0.000161193,0.0004852516,0.000057310026,0.00004296209],"category_scores_gemma":[0.000057483056,0.00007730195,0.000025994941,0.0012437283,0.000016877906,0.0007548302,0.00016071319,0.00013774507,0.00019254959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008900271,0.0007190629,0.4528998,0.000030494522,0.000059013706,0.000057126577,0.053303383,0.032599002,0.0012978369,0.41722947,0.0132566,0.028539285],"study_design_scores_gemma":[0.00046209284,0.00009492774,0.13684027,0.0000058776764,8.756184e-7,1.7664834e-7,0.00052360963,0.84248775,0.00024179151,0.018837214,0.0002983684,0.00020701086],"about_ca_topic_score_codex":0.00010751412,"about_ca_topic_score_gemma":0.00036350254,"teacher_disagreement_score":0.8098888,"about_ca_system_score_codex":0.00014196843,"about_ca_system_score_gemma":0.00006999315,"threshold_uncertainty_score":0.3152282},"labels":[],"label_agreement":null},{"id":"W4382239271","doi":"10.1609/aaai.v37i6.25864","title":"The Sufficiency of Off-Policyness and Soft Clipping: PPO Is Still Insufficient according to an Off-Policy Measure","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Machine Intelligence Institute","keywords":"Clipping (morphology); Computer science; Space (punctuation); Metric (unit); Measure (data warehouse); Mathematical optimization; Sigmoid function; Code (set theory); Function (biology); Algorithm; Mathematics; Data mining; Artificial intelligence; Economics; Operations management; Programming language","score_opus":0.1051787284617897,"score_gpt":0.34265991363007636,"score_spread":0.23748118516828665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9184599,0.0001183891,0.03621808,0.034298196,0.0007301562,0.0018245159,0.000027761778,0.0003908153,0.007932212],"genre_scores_gemma":[0.99820274,0.0002609326,0.0006902185,0.0004793606,0.00006445441,0.000033849254,4.5271148e-7,0.000017144683,0.00025084664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970674,0.000051544772,0.0007275185,0.00062379945,0.0009182186,0.00061152736],"domain_scores_gemma":[0.9972744,0.00022688828,0.000392239,0.0005148717,0.0013582802,0.00023331358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400641,0.00025459277,0.00031058455,0.00042102532,0.0005111999,0.0005180555,0.0027894115,0.00009528201,0.000010763491],"category_scores_gemma":[0.0016873194,0.00017155227,0.00009512713,0.0031011128,0.0004558829,0.00048080398,0.0010038199,0.00029187577,0.00004594006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045351793,0.00014746764,0.0002918963,0.000043609423,0.000012089241,2.478488e-7,0.01143977,0.0010173148,0.0138655985,0.66977215,0.0001419703,0.30322257],"study_design_scores_gemma":[0.000085464,0.00085021864,0.00090681197,0.00041408284,0.000013614334,0.000005891722,0.008536388,0.8101697,0.12905842,0.047835853,0.0016270215,0.0004965565],"about_ca_topic_score_codex":0.000110094785,"about_ca_topic_score_gemma":0.000021413143,"teacher_disagreement_score":0.80915236,"about_ca_system_score_codex":0.000051631607,"about_ca_system_score_gemma":0.0003447621,"threshold_uncertainty_score":0.6995698},"labels":[],"label_agreement":null},{"id":"W4383109118","doi":"10.1109/icra48891.2023.10160912","title":"Approximation Algorithms for Robot Tours in Random Fields with Guaranteed Estimation Accuracy","year":2023,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Sample (material); Regular polygon; Algorithm; Random field; Mathematical optimization; Approximation algorithm; Estimation; Upper and lower bounds; Mathematics; Artificial intelligence; Statistics; Engineering","score_opus":0.0396993950952113,"score_gpt":0.31117966896045424,"score_spread":0.2714802738652429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383109118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008414375,0.0000039921465,0.9937466,0.0032182315,0.00007426465,0.00073528674,9.38828e-7,0.0002791282,0.0011001294],"genre_scores_gemma":[0.21212026,0.000013268529,0.78609633,0.00039164978,0.000023064242,0.00028551687,0.000044588076,0.0000101141095,0.0010151757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991675,0.000037037946,0.00018386228,0.00021671424,0.00018724441,0.00020761907],"domain_scores_gemma":[0.9993636,0.00027669797,0.000049000224,0.00019501035,0.00007882252,0.00003688648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047194914,0.000077272336,0.000109849534,0.00020098254,0.00007264738,0.0001550813,0.00026325084,0.00004503178,0.000013816755],"category_scores_gemma":[0.00014239464,0.00005944466,0.000025943336,0.0007688296,0.000013132983,0.00059593987,0.000045120516,0.000062545005,0.000026827513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064237145,0.00005444102,0.00012165178,0.000046387828,0.000009440332,0.000003463657,0.0016161329,0.8456453,0.000064287495,0.0337039,0.0016614083,0.11700931],"study_design_scores_gemma":[0.0021834907,0.00007849519,0.00028258428,0.000019765912,0.0000012716322,0.00000207058,0.00005549695,0.9931832,0.00035760773,0.0036085441,0.0001357938,0.00009168436],"about_ca_topic_score_codex":0.00003221511,"about_ca_topic_score_gemma":0.000035292844,"teacher_disagreement_score":0.21127883,"about_ca_system_score_codex":0.000018781868,"about_ca_system_score_gemma":0.000062573454,"threshold_uncertainty_score":0.24240829},"labels":[],"label_agreement":null},{"id":"W4385359901","doi":"10.1007/978-3-031-38906-1_14","title":"Online Interval Scheduling with Predictions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Disjoint sets; Competitive analysis; Scheduling (production processes); Upper and lower bounds; Algorithm; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.03238855091904636,"score_gpt":0.2731777316503188,"score_spread":0.24078918073127242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385359901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019285524,0.00005374741,0.9937969,0.0019502186,0.0011186991,0.0003327258,0.0000113646975,0.0005275692,0.0021895224],"genre_scores_gemma":[0.01290031,0.000084748455,0.98293614,0.0011410406,0.00042629195,0.0000129594855,0.000024006213,0.000057027795,0.0024174666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967767,0.00002741018,0.00040051364,0.0012180145,0.0010005402,0.00057682494],"domain_scores_gemma":[0.99798054,0.00027489688,0.00016657166,0.0010274617,0.0003444909,0.000206043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058952597,0.0003704676,0.00035377525,0.0009842465,0.0002812795,0.00059507764,0.0025110256,0.00020127428,0.00002221883],"category_scores_gemma":[0.00008020505,0.00030550826,0.00008135752,0.0010949922,0.000549615,0.0006328954,0.0012416985,0.00093731727,0.000079421894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042404713,0.00004773519,0.0000362548,0.000030497364,0.000017395905,0.00008124152,0.0005798994,0.80469847,0.000011509938,0.025256937,0.0000216413,0.1692142],"study_design_scores_gemma":[0.00022628269,0.00023150715,0.00006581821,0.0004963737,0.000004515405,0.000046871603,2.9373314e-7,0.97000307,0.00004256686,0.0279435,0.00057684386,0.00036235267],"about_ca_topic_score_codex":0.000013627876,"about_ca_topic_score_gemma":0.00016640461,"teacher_disagreement_score":0.16885185,"about_ca_system_score_codex":0.00017940965,"about_ca_system_score_gemma":0.0006648138,"threshold_uncertainty_score":0.9999397},"labels":[],"label_agreement":null},{"id":"W4385549512","doi":"10.21203/rs.3.rs-3207161/v1","title":"A Soft Obstacle Search Strategy for Various Solitary Robots in an Unknown Environment","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Robot; Obstacle; A priori and a posteriori; Artificial intelligence; Computer science; Robotics; Search and rescue; Interference (communication); Distributed computing; Human–computer interaction; Computer network; Geography","score_opus":0.21788459314159045,"score_gpt":0.42644286257360714,"score_spread":0.2085582694320167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385549512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006679738,0.0008668507,0.9764712,0.0055622067,0.00043993647,0.007861025,0.000224806,0.00067627145,0.0012179717],"genre_scores_gemma":[0.8631825,0.0020794703,0.11549469,0.00016792779,0.00058261567,0.0051691253,0.0014156546,0.00031857385,0.011589448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925968,0.0013352463,0.0005795712,0.0016852445,0.0020456307,0.0017575243],"domain_scores_gemma":[0.99610084,0.0008333036,0.000066786335,0.0019246788,0.00049503933,0.0005793227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005249675,0.00034958715,0.00044986108,0.0011543286,0.00038486326,0.00097309693,0.0029100257,0.0004551783,0.00007699937],"category_scores_gemma":[0.00022844574,0.00035708846,0.00016747974,0.0008604127,0.00020336754,0.00051524444,0.004244204,0.0021663692,0.00029117952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042856555,0.00053534284,0.0005225091,0.00085135584,0.000032085878,0.00013781965,0.0026128797,0.94726574,0.00006458793,0.01653735,0.001081708,0.030315759],"study_design_scores_gemma":[0.0007210752,0.000755076,0.0035673522,0.00027769056,0.000002283471,0.000002944185,0.00043791646,0.9636468,0.000070272275,0.028888294,0.0011993783,0.000430885],"about_ca_topic_score_codex":0.0007708291,"about_ca_topic_score_gemma":0.00052148785,"teacher_disagreement_score":0.8609765,"about_ca_system_score_codex":0.0007013747,"about_ca_system_score_gemma":0.0014791252,"threshold_uncertainty_score":0.9998881},"labels":[],"label_agreement":null},{"id":"W4385741168","doi":"10.1016/j.ins.2023.119487","title":"Pioneering approaches for enhancing the speed of hierarchical LA by ordering the actions","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Estimator; A priori and a posteriori; Benchmark (surveying); Assertion; Automaton; Tree (set theory); Salient; Theoretical computer science; Action (physics); Convergence (economics); Algorithm; Artificial intelligence; Mathematics","score_opus":0.10418225204715947,"score_gpt":0.31282389437804803,"score_spread":0.20864164233088855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385741168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038746053,0.0000068943714,0.98179483,0.0062651215,0.00011012053,0.0002320035,0.0000028287575,0.0000859472,0.0076276637],"genre_scores_gemma":[0.9909223,0.000018793085,0.00867721,0.00021365687,0.000013068989,0.00003725074,0.00000389462,0.000001589956,0.00011224418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992363,0.00003935526,0.00020938175,0.00006871166,0.00030027516,0.00014601742],"domain_scores_gemma":[0.99917895,0.0005267612,0.00008122741,0.00013604066,0.000054183663,0.000022815224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312132,0.000041384348,0.000046861365,0.000102257145,0.0005584472,0.0003570947,0.00067083415,0.000017904737,0.0000030576762],"category_scores_gemma":[0.0002183378,0.00002287459,0.000028209572,0.0010920357,0.00018225018,0.001428091,0.00013096875,0.000066782195,0.000013057819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023662708,0.000011666833,0.000041615247,0.000030244897,0.000009552641,3.543429e-8,0.018405654,0.48988065,0.0010039127,0.39652377,0.003738562,0.090351984],"study_design_scores_gemma":[0.000060127502,0.000017396436,0.00013592494,0.000006332183,6.3847693e-7,0.0000015590434,0.001489958,0.9778248,0.0013450611,0.0019091435,0.017172161,0.000036862773],"about_ca_topic_score_codex":0.000010601903,"about_ca_topic_score_gemma":0.0000048986603,"teacher_disagreement_score":0.9870477,"about_ca_system_score_codex":0.000007090014,"about_ca_system_score_gemma":0.00007267262,"threshold_uncertainty_score":0.42951807},"labels":[],"label_agreement":null},{"id":"W4386155733","doi":"10.1007/978-3-031-39344-0_18","title":"Constrained Graph Searching on Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Path graph; Computer science; Distance; Wheel graph; Graph; Time complexity; Mathematics; Discrete mathematics; Graph power; Line graph","score_opus":0.03391685590947484,"score_gpt":0.2761777690574971,"score_spread":0.24226091314802223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386155733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011374162,0.00003519429,0.98021436,0.0022031013,0.0011749892,0.0003904457,0.00000660623,0.00045025107,0.0155136585],"genre_scores_gemma":[0.096764535,0.00028213655,0.8872159,0.006554846,0.0008340615,0.000037629754,0.000029423443,0.00015956633,0.008121875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595636,0.0000612305,0.00042282772,0.0014268165,0.0013667163,0.0007660205],"domain_scores_gemma":[0.9973783,0.000849392,0.0001556666,0.0011649613,0.00020221862,0.0002494925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012821615,0.00043023232,0.0004071286,0.001624649,0.00035515366,0.0008263681,0.003138728,0.00022961231,0.000031683147],"category_scores_gemma":[0.00016199287,0.00038170765,0.00013982944,0.001104313,0.00082247186,0.000427201,0.0010890218,0.0010267958,0.00021449557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042214847,0.000023555875,0.00001181717,0.000023066232,0.000011649241,0.00013327166,0.00072604185,0.24674174,0.00006691754,0.21104738,0.0000644843,0.54114586],"study_design_scores_gemma":[0.00027459572,0.00024101687,0.00006435836,0.0003803693,0.0000021042586,0.00002194147,1.9496404e-7,0.7295316,0.00020898491,0.268203,0.00057568157,0.00049619493],"about_ca_topic_score_codex":0.000013553241,"about_ca_topic_score_gemma":0.000068271984,"teacher_disagreement_score":0.54064965,"about_ca_system_score_codex":0.00014310675,"about_ca_system_score_gemma":0.00056487985,"threshold_uncertainty_score":0.9998635},"labels":[],"label_agreement":null},{"id":"W4386159662","doi":"10.1109/csci58124.2022.00090","title":"The 2-MAXSAT Problem Can Be Solved in Polynomial Time","year":2022,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Manitoba Beekeepers' Association","funders":"","keywords":"Maximum satisfiability problem; Computer science; Polynomial; Bounded function; Combinatorics; Algorithm; Artificial intelligence; Discrete mathematics; Mathematics; Boolean function","score_opus":0.013694384641439772,"score_gpt":0.2278928376202346,"score_spread":0.21419845297879483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386159662","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012081015,0.00023116602,0.13501403,0.4353076,0.0013842635,0.0034627179,0.000023940163,0.0013353548,0.41115993],"genre_scores_gemma":[0.7063837,0.00004600447,0.08792585,0.012577758,0.00011054688,0.00057306106,0.000026538266,0.000041151863,0.1923154],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989661,0.00014509154,0.00015158871,0.00019461717,0.00027550335,0.00026708053],"domain_scores_gemma":[0.99952203,0.00007931757,0.000029234783,0.0002909397,0.00002263859,0.000055855373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581178,0.000059965976,0.00006334754,0.0000634051,0.00041869763,0.00016959556,0.0008660545,0.000013092021,0.00037709565],"category_scores_gemma":[0.000012242366,0.000043153592,0.000026469159,0.00041723,0.000028080005,0.000120464414,0.0006380916,0.00016452842,0.00003095368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006702194,0.0005267857,0.0017557571,0.000013832213,0.000046844012,0.000056844925,0.013051688,0.12269118,0.0047989846,0.32896188,0.45188752,0.07614165],"study_design_scores_gemma":[0.00064020004,0.0001288909,0.00017940222,0.0000017024342,6.952363e-7,0.0000079632655,0.00016116339,0.78132313,0.0002753341,0.0014795301,0.21563087,0.00017110095],"about_ca_topic_score_codex":0.00016973758,"about_ca_topic_score_gemma":0.00024412422,"teacher_disagreement_score":0.6943027,"about_ca_system_score_codex":0.0000780744,"about_ca_system_score_gemma":0.00015975727,"threshold_uncertainty_score":0.4128933},"labels":[],"label_agreement":null},{"id":"W4386255660","doi":"10.28924/2291-8639-21-2023-94","title":"Sum Connectivity Index Under the Cartesian and Strong Products Graph of Monogenic Semigroup","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Cartesian coordinate system; Semigroup; Mathematics; Graph; Index (typography); Topological index; Undirected graph; Discrete mathematics; Combinatorics; Computer science; Geometry","score_opus":0.01760620007882813,"score_gpt":0.28951913163907445,"score_spread":0.2719129315602463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386255660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11944483,0.00015819212,0.8725184,0.007605404,0.00003366438,0.00009481074,0.0000074640093,0.000011398005,0.00012581167],"genre_scores_gemma":[0.9982797,0.00035999328,0.0011759421,0.000061283055,0.000048051465,0.000008534862,0.000004134574,0.00000227985,0.000060114944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999213,0.000046733952,0.00025003537,0.0001250157,0.000293,0.000072229624],"domain_scores_gemma":[0.9989712,0.0001233769,0.00022826344,0.00015368332,0.00047523866,0.00004823402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047322953,0.000051969775,0.00012217146,0.00038274034,0.000082414794,0.00010393973,0.0003928036,0.000019087505,0.000005076769],"category_scores_gemma":[0.000020218742,0.000036594443,0.0000762,0.0011244079,0.00007141346,0.0002033868,0.00010384411,0.000087080756,8.366622e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029862134,0.00042695313,0.16677244,0.000029036946,0.0060773604,0.000007856642,0.0020214806,0.13496007,0.0072541903,0.6114017,0.0011039507,0.06991515],"study_design_scores_gemma":[0.0008709008,0.00009736116,0.55937827,0.00002491477,0.00038445654,0.000059751383,0.0010892162,0.40225983,0.001721251,0.030464506,0.003417962,0.00023158714],"about_ca_topic_score_codex":0.00004445073,"about_ca_topic_score_gemma":0.00005285629,"teacher_disagreement_score":0.87883484,"about_ca_system_score_codex":0.000011644923,"about_ca_system_score_gemma":0.00004315657,"threshold_uncertainty_score":0.14922781},"labels":[],"label_agreement":null},{"id":"W4386880161","doi":"10.1007/978-3-031-43587-4_12","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bounded function; Intersection (aeronautics); Exploit; Reciprocal; Graph; Query optimization; Upper and lower bounds; Mathematical optimization; Theoretical computer science; Data mining; Mathematics","score_opus":0.020696146411820125,"score_gpt":0.2513531505849658,"score_spread":0.2306570041731457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386880161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010765104,0.00011179516,0.9933352,0.0019049989,0.0022379067,0.0009432368,0.00002779011,0.00035307402,0.000978349],"genre_scores_gemma":[0.0055996645,0.0000387748,0.9822529,0.001634729,0.000544757,0.00007497093,0.00005261441,0.00007462649,0.009726957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961849,0.00004830707,0.0005471611,0.0014454392,0.00095040206,0.0008238024],"domain_scores_gemma":[0.9977183,0.00054009014,0.00022161542,0.0008244857,0.0004412296,0.00025428683],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011082146,0.00044259644,0.0004720474,0.0010889925,0.0005945814,0.0010688487,0.0021199312,0.0002848841,0.00006118702],"category_scores_gemma":[0.00027849065,0.00044917775,0.00016158605,0.00062162813,0.00034825085,0.00072782784,0.0015579464,0.00038834402,0.00020382422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000319125,0.000047279937,0.000035045992,0.00021955145,0.000047830024,0.00013732606,0.0029458127,0.82303905,0.004022761,0.036500856,0.0012224666,0.1317501],"study_design_scores_gemma":[0.0003013741,0.00018964855,0.00004264802,0.0003811282,0.000007015161,0.000025766836,3.730597e-7,0.8977257,0.00069663284,0.09917514,0.0008255225,0.0006290733],"about_ca_topic_score_codex":0.000027310576,"about_ca_topic_score_gemma":0.00006254494,"teacher_disagreement_score":0.13112104,"about_ca_system_score_codex":0.00046051884,"about_ca_system_score_gemma":0.0005621862,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W4387197967","doi":"10.1007/978-3-031-44274-2_31","title":"Dispersion of Mobile Robots in Spite of Faults","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Robot; Algorithm; Combinatorics; Binary logarithm; A priori and a posteriori; Computer science; Node (physics); Discrete mathematics; Topology (electrical circuits); Physics; Mathematics; Artificial intelligence","score_opus":0.020573518830420332,"score_gpt":0.2671426386499722,"score_spread":0.24656911981955185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387197967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022589891,0.00013793445,0.9964295,0.00019717476,0.0006114161,0.00041688184,0.0000050611125,0.00005794099,0.0019181933],"genre_scores_gemma":[0.36280814,0.0004410103,0.6346838,0.00033770694,0.00012468944,0.000021402,0.0000128282645,0.000055474495,0.0015149814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972417,0.00003533708,0.0006138516,0.0008248468,0.0008946417,0.00038964677],"domain_scores_gemma":[0.9981937,0.00031981283,0.00029022535,0.0008631123,0.00024028569,0.00009289401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008644139,0.000254719,0.00048454234,0.0011904621,0.000050507442,0.000060626342,0.0021951527,0.00020130402,0.00001512972],"category_scores_gemma":[0.00007521001,0.00022993668,0.00009758926,0.0012250959,0.00046646333,0.00037226814,0.0011782241,0.00041488523,0.000017347023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047535837,0.000042425556,0.00019701135,0.00009887552,0.0000041443645,0.000023314562,0.0011925627,0.7572099,0.00036546835,0.012234797,0.000010032937,0.2286167],"study_design_scores_gemma":[0.00032688142,0.00026445606,0.00037650968,0.000811232,0.000001908427,0.000005387319,4.2349063e-7,0.96528083,0.001930115,0.03055327,0.0001459493,0.00030306022],"about_ca_topic_score_codex":0.000045900833,"about_ca_topic_score_gemma":0.00009034209,"teacher_disagreement_score":0.36258224,"about_ca_system_score_codex":0.00010097552,"about_ca_system_score_gemma":0.0003195635,"threshold_uncertainty_score":0.93765455},"labels":[],"label_agreement":null},{"id":"W4387198151","doi":"10.1007/978-3-031-44274-2_13","title":"The Fagnano Triangle Patrolling Problem (Extended Abstract)","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Patrolling; Dynamical billiards; Optimization problem; Computer science; Trajectory; Inscribed figure; Enhanced Data Rates for GSM Evolution; Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Geometry; Physics","score_opus":0.02806134879993998,"score_gpt":0.2626317303766687,"score_spread":0.23457038157672871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387198151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033564654,0.00030779335,0.98422724,0.0031593693,0.0017236102,0.00072705536,0.0000042078,0.00040862997,0.009438747],"genre_scores_gemma":[0.03211727,0.0015142389,0.93931687,0.0029452627,0.0014912429,0.0001436145,0.000024754285,0.000225536,0.022221232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955182,0.00005016344,0.0007210325,0.0013631172,0.001391488,0.00095600204],"domain_scores_gemma":[0.99635607,0.0012475002,0.000346481,0.0014747531,0.00036221233,0.00021296213],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024932602,0.000464733,0.00045262527,0.0006270084,0.0008646703,0.0017216526,0.0045738914,0.00028111896,0.000019394616],"category_scores_gemma":[0.00018263642,0.000331367,0.00019063472,0.0010201068,0.0006256103,0.0005887426,0.0013911774,0.0010193628,0.0002335793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061695728,0.0000202281,0.0000042935603,0.000028616121,0.00001511552,0.00006663336,0.0005766226,0.10650472,0.00004573837,0.063634336,0.00012121196,0.82897633],"study_design_scores_gemma":[0.0004061744,0.000143029,0.000045274275,0.00029083353,0.0000045323623,0.00002082719,3.6190676e-7,0.66209376,0.00020153557,0.32893845,0.0073104696,0.0005447634],"about_ca_topic_score_codex":0.000017183242,"about_ca_topic_score_gemma":0.00010855441,"teacher_disagreement_score":0.82843155,"about_ca_system_score_codex":0.00020718567,"about_ca_system_score_gemma":0.0008123415,"threshold_uncertainty_score":0.9999138},"labels":[],"label_agreement":null},{"id":"W4387253309","doi":"10.32920/24231046.v1","title":"A Multi-Objective Optimization Problem on Evacuating 2 Robots from the Disk in the Face-to-Face Model; Trade-Offs between Worst-Case and Average-Case Analysis","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Face (sociological concept); Computer science; Robot; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence","score_opus":0.09051657174406798,"score_gpt":0.32414557347285106,"score_spread":0.2336290017287831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387253309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012807455,0.000030396344,0.97642225,0.0073237973,0.00006652706,0.0027523446,0.00017657469,0.00025387362,0.00016680661],"genre_scores_gemma":[0.6625878,0.000053605738,0.33609802,0.00052669435,0.000044972952,0.00035097697,0.00013469566,0.000033472523,0.000169731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953517,0.0011802758,0.0007442143,0.0015020546,0.00070209947,0.0005196676],"domain_scores_gemma":[0.9963479,0.0016366662,0.0003040914,0.0014115461,0.00009712169,0.00020267931],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018287005,0.0005072764,0.00060051057,0.0005756943,0.00056722213,0.001301165,0.0014673761,0.00027946994,0.000014399461],"category_scores_gemma":[0.0002803956,0.00032010427,0.00022030403,0.0024732454,0.00006711902,0.00035205946,0.0017418895,0.0011579491,0.000013533251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008041525,0.00007576223,0.00089432125,0.000017677583,0.00026872486,0.00028591036,0.029983664,0.965605,0.000001667643,0.00014706167,0.000050101604,0.0026620447],"study_design_scores_gemma":[0.00048780217,0.000052515974,0.0011650524,0.00009194928,0.00016759691,0.000028945658,0.0016513865,0.9952955,0.000008523172,0.000652304,0.0000015818047,0.00039679804],"about_ca_topic_score_codex":0.0022057164,"about_ca_topic_score_gemma":0.0016667644,"teacher_disagreement_score":0.6497804,"about_ca_system_score_codex":0.00012732562,"about_ca_system_score_gemma":0.0001491147,"threshold_uncertainty_score":0.9999251},"labels":[],"label_agreement":null},{"id":"W4387409735","doi":"10.1007/s00454-023-00597-8","title":"On the Spanning and Routing Ratio of the Directed Theta-Four Graph","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Computer science; Graph; Euclidean distance; Discrete mathematics; Artificial intelligence","score_opus":0.030246869920199745,"score_gpt":0.26529246000904205,"score_spread":0.2350455900888423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387409735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30885836,0.00005064424,0.67121184,0.013033047,0.00037344353,0.0005422557,0.000020965681,0.00038012254,0.0055293],"genre_scores_gemma":[0.99595135,0.0000055650316,0.0031482961,0.00043212983,0.000017947614,0.000009458329,0.000010845572,0.0000072717808,0.0004171035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987315,0.00017811176,0.00020329161,0.0002257091,0.00048465707,0.00017675238],"domain_scores_gemma":[0.9984844,0.0009859763,0.00011453935,0.00024911953,0.0001254541,0.000040533614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267375,0.000094600415,0.000102906226,0.00017693915,0.00036008513,0.00014497648,0.0004898853,0.000027071274,0.00002729268],"category_scores_gemma":[0.00031111977,0.00005453084,0.000067509056,0.0019603525,0.000096214564,0.0001467514,0.0002971032,0.00014828816,0.000025776277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038528833,0.000013625768,0.0027647254,0.000010211773,0.00003725812,0.0000015773758,0.0011789842,0.5396919,0.00007696398,0.45308173,0.0011149411,0.0020241896],"study_design_scores_gemma":[0.00014340645,0.000017930137,0.079691075,0.00003197892,0.0000030773397,0.0000027563794,0.000093840856,0.87912613,0.00006106273,0.0406906,0.000063545434,0.00007460337],"about_ca_topic_score_codex":0.000009621615,"about_ca_topic_score_gemma":0.0000010461324,"teacher_disagreement_score":0.687093,"about_ca_system_score_codex":0.000009969375,"about_ca_system_score_gemma":0.000049240818,"threshold_uncertainty_score":0.276952},"labels":[],"label_agreement":null},{"id":"W4387730855","doi":"10.36227/techrxiv.24311155","title":"A Dynamic Vacancy-Applicant Matching System Considering Locking Periods and Break-up Penalties","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Matching (statistics); Flexibility (engineering); Computer science; Workload; The Internet; Blossom algorithm; Stability (learning theory); Distributed computing; Labour economics; Economics; Mathematics; Machine learning; World Wide Web; Management","score_opus":0.03398303610395465,"score_gpt":0.28568218080100743,"score_spread":0.2516991446970528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387730855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067332364,0.00033794018,0.98667276,0.0011981982,0.0009194048,0.00064150203,0.000010087113,0.0015594369,0.0019274345],"genre_scores_gemma":[0.82654595,0.00031444064,0.16940416,0.00017791099,0.000046018817,0.00019517988,0.0000148780655,0.000062381856,0.0032390694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976005,0.000112428446,0.00047651472,0.0009229055,0.0004240128,0.0004636353],"domain_scores_gemma":[0.9985717,0.00014961974,0.00018770438,0.00077812764,0.00012781838,0.00018501145],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065134035,0.00032816047,0.00045778888,0.00028963224,0.00031683638,0.001333671,0.0008744525,0.0001809361,0.000016836419],"category_scores_gemma":[0.000021857419,0.0003063775,0.00008765514,0.00023429413,0.00006865949,0.00022376869,0.0042473595,0.0005856762,0.000040434108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002361191,0.000079103695,0.0015466416,0.013906964,0.00060360506,0.00043652314,0.034005817,0.4256983,0.00092600635,0.47777244,0.0017583866,0.04324259],"study_design_scores_gemma":[0.00019906618,0.000014057074,0.00023914945,0.0008167914,0.000009140006,0.00008542154,0.0011773636,0.9926789,0.000030291805,0.00412501,0.00022449989,0.00040030756],"about_ca_topic_score_codex":0.00097585784,"about_ca_topic_score_gemma":0.00025002778,"teacher_disagreement_score":0.8198127,"about_ca_system_score_codex":0.00017363718,"about_ca_system_score_gemma":0.00028497062,"threshold_uncertainty_score":0.99993885},"labels":[],"label_agreement":null},{"id":"W4387730956","doi":"10.36227/techrxiv.24311155.v1","title":"A Dynamic Vacancy-Applicant Matching System Considering Locking Periods and Break-up Penalties","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Matching (statistics); Flexibility (engineering); Workload; Computer science; The Internet; Stability (learning theory); Blossom algorithm; Distributed computing; Labour economics; Economics; Mathematics; Machine learning; World Wide Web","score_opus":0.03398303610395465,"score_gpt":0.28568218080100743,"score_spread":0.2516991446970528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387730956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067332364,0.00033794018,0.98667276,0.0011981982,0.0009194048,0.00064150203,0.000010087113,0.0015594369,0.0019274345],"genre_scores_gemma":[0.82654595,0.00031444064,0.16940416,0.00017791099,0.000046018817,0.00019517988,0.0000148780655,0.000062381856,0.0032390694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976005,0.000112428446,0.00047651472,0.0009229055,0.0004240128,0.0004636353],"domain_scores_gemma":[0.9985717,0.00014961974,0.00018770438,0.00077812764,0.00012781838,0.00018501145],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065134035,0.00032816047,0.00045778888,0.00028963224,0.00031683638,0.001333671,0.0008744525,0.0001809361,0.000016836419],"category_scores_gemma":[0.000021857419,0.0003063775,0.00008765514,0.00023429413,0.00006865949,0.00022376869,0.0042473595,0.0005856762,0.000040434108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002361191,0.000079103695,0.0015466416,0.013906964,0.00060360506,0.00043652314,0.034005817,0.4256983,0.00092600635,0.47777244,0.0017583866,0.04324259],"study_design_scores_gemma":[0.00019906618,0.000014057074,0.00023914945,0.0008167914,0.000009140006,0.00008542154,0.0011773636,0.9926789,0.000030291805,0.00412501,0.00022449989,0.00040030756],"about_ca_topic_score_codex":0.00097585784,"about_ca_topic_score_gemma":0.00025002778,"teacher_disagreement_score":0.8198127,"about_ca_system_score_codex":0.00017363718,"about_ca_system_score_gemma":0.00028497062,"threshold_uncertainty_score":0.99993885},"labels":[],"label_agreement":null},{"id":"W4387872170","doi":"10.1016/j.ipl.2023.106455","title":"Deterministic treasure hunt and rendezvous in arbitrary connected graphs","year":2023,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Treasure; Rendezvous; Traverse; Time complexity; Computer science; Algorithm; Node (physics); Connectivity; Combinatorics; Mathematics; Graph; Discrete mathematics; Theoretical computer science","score_opus":0.01283665702480478,"score_gpt":0.23167264811662977,"score_spread":0.218835991091825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387872170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4222402,0.000080872785,0.540651,0.028466413,0.000377951,0.00073225243,0.000009202292,0.0020544145,0.0053876685],"genre_scores_gemma":[0.9884686,0.00001959649,0.0065003294,0.0049188193,0.000007720185,0.000030063806,0.000029062088,0.0000052333185,0.000020561614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991275,0.000035580655,0.00027873518,0.0001229375,0.00021983462,0.00021537552],"domain_scores_gemma":[0.9996192,0.00004658179,0.00009198556,0.00012909345,0.000052455795,0.00006070383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000282532,0.00008826456,0.00009064899,0.00049274106,0.00012224483,0.00042011816,0.00021257272,0.000039979106,0.0000029498929],"category_scores_gemma":[0.00007503293,0.00008489919,0.000015287853,0.0010630991,0.000043379638,0.002430623,0.00006199042,0.00012199149,0.00003761112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003949548,0.000063617,0.00688518,0.0009092054,0.000022776454,0.00009473596,0.04116574,0.023810694,0.0022918985,0.016174633,0.0067277807,0.9018142],"study_design_scores_gemma":[0.0008227397,0.000035081397,0.017268423,0.00011839139,0.000002352331,0.00003052288,0.00018053726,0.976919,0.00016390612,0.0024106395,0.0017963643,0.00025204004],"about_ca_topic_score_codex":0.000007551705,"about_ca_topic_score_gemma":0.0000028422976,"teacher_disagreement_score":0.9531083,"about_ca_system_score_codex":0.00002150897,"about_ca_system_score_gemma":0.00006212408,"threshold_uncertainty_score":0.4051209},"labels":[],"label_agreement":null},{"id":"W4388184697","doi":"10.48550/arxiv.2310.20401","title":"Utilitarian Algorithm Configuration","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute; Compute Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Heuristic; Bounded function; Contrast (vision); Monotonic function; Runtime verification; Heuristics; Algorithm; Minification; Mathematical optimization; Mathematics; Programming language; Artificial intelligence","score_opus":0.13566098039637664,"score_gpt":0.21102936714132473,"score_spread":0.07536838674494808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388184697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067999295,0.000012886488,0.9920163,0.0005239766,0.0008143666,0.0003160234,0.000018039738,0.0006887503,0.0049296324],"genre_scores_gemma":[0.9442516,0.00029628188,0.030409526,0.00020798025,0.00011377625,0.0000030279164,0.00013864208,0.000032999935,0.024546172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983638,0.00015217002,0.0001749965,0.0008936908,0.00011271572,0.00030261165],"domain_scores_gemma":[0.9984467,0.000075887125,0.00012624,0.000961919,0.00022098044,0.00016826225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031141532,0.00020273279,0.00020142105,0.0002869815,0.000165143,0.00020643332,0.0013768096,0.00023770452,0.00007804124],"category_scores_gemma":[0.000036374062,0.00024248647,0.00012827176,0.0006515017,0.000070413116,0.00039789066,0.0012668456,0.0004441007,0.00066404225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060963225,0.000074878444,0.00023646741,0.00005695306,0.000083759,0.00031144003,0.00049285806,0.42357725,0.000008572494,0.5637807,0.002713456,0.008657552],"study_design_scores_gemma":[0.0002325903,0.000026181851,0.00040565475,0.00003173346,0.000010302118,0.0000011408208,0.00004327497,0.9383063,0.000023388897,0.05932252,0.0013556962,0.00024122655],"about_ca_topic_score_codex":0.00020498034,"about_ca_topic_score_gemma":0.000032807875,"teacher_disagreement_score":0.9616068,"about_ca_system_score_codex":0.00012978424,"about_ca_system_score_gemma":0.0002512328,"threshold_uncertainty_score":0.9888311},"labels":[],"label_agreement":null},{"id":"W4388734332","doi":"10.37236/11548","title":"Separating the Online and Offline DP-Chromatic Numbers","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Fractional coloring; List coloring; Cover (algebra); Graph; Greedy coloring; Generalization; Edge coloring; Discrete mathematics; Transversal (combinatorics); Graph coloring; Graph power; Line graph","score_opus":0.012988599195016078,"score_gpt":0.2682370579565959,"score_spread":0.2552484587615798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388734332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57880485,0.0031774614,0.359445,0.054605015,0.0010999894,0.0005096707,0.0000011801716,0.00020328962,0.002153543],"genre_scores_gemma":[0.9976094,0.0012156416,0.00022390876,0.00026712264,0.00005274501,0.0000013980316,6.5770615e-7,0.000008003892,0.0006211556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986538,0.00018971994,0.00030480395,0.00008254869,0.0003969173,0.0003721627],"domain_scores_gemma":[0.99892825,0.00038152083,0.00022490122,0.00024734766,0.00016053794,0.000057418834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877927,0.00008574625,0.00013995482,0.000078047065,0.00025287006,0.0001281888,0.0008610475,0.000026570611,0.0000037556408],"category_scores_gemma":[0.0001406771,0.000045866807,0.00005118842,0.0009439021,0.00005563289,0.0002278639,0.00015898045,0.0005123416,0.000009690722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004796692,0.000051749787,0.000094378316,0.000010411933,0.000052731742,0.0000072128146,0.0015491075,0.002728436,0.000107435066,0.991244,0.002001839,0.0021479032],"study_design_scores_gemma":[0.0007182428,0.00040484883,0.0004997596,0.000031108168,0.000018820498,0.00026304694,0.00028389948,0.29918337,0.00013214297,0.6941742,0.0041831266,0.00010745448],"about_ca_topic_score_codex":0.0000032383612,"about_ca_topic_score_gemma":0.0000046648643,"teacher_disagreement_score":0.41880453,"about_ca_system_score_codex":0.000072282804,"about_ca_system_score_gemma":0.00027567428,"threshold_uncertainty_score":0.22258978},"labels":[],"label_agreement":null},{"id":"W4388750673","doi":"10.1145/3610940","title":"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow","year":2023,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Minimum-cost flow problem; Amortized analysis; Mathematics; Minimum cut; Separable space; Algorithm; Time complexity; Maximum flow problem; Bounded function; Regular polygon; Combinatorics; Directed graph; Discrete mathematics; Mathematical optimization; Computer science; Flow network; Data structure","score_opus":0.09238388434712162,"score_gpt":0.3403967687830984,"score_spread":0.24801288443597674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388750673","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016361353,0.0010498747,0.47847214,0.50989056,0.0005697198,0.0034031451,0.00028593547,0.0007287417,0.003963763],"genre_scores_gemma":[0.0030046708,0.00037669353,0.9947081,0.00027570623,0.000016211601,0.00012452755,0.00004952047,0.0000118043,0.0014327187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00013670391,0.00020495756,0.00016299945,0.000142289,0.00017206841],"domain_scores_gemma":[0.9856241,0.00067917974,0.00007727232,0.013381358,0.00018375587,0.000054371754],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006558421,0.00007759706,0.00011655117,0.00008236262,0.00037079223,0.0000617914,0.01606942,0.000042368498,0.000008013661],"category_scores_gemma":[0.0028047708,0.000061369166,0.00006525025,0.00062702957,0.00016321642,0.00018613483,0.014301707,0.00010514482,0.00006073558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027376162,0.0005331373,0.00058937474,0.00015028469,0.00020473506,8.444212e-7,0.007920666,0.03920857,0.0044828225,0.020234331,0.43537045,0.49127743],"study_design_scores_gemma":[0.00026680247,0.000021184633,0.00023379634,0.000019379178,0.0000051810803,0.0000019691533,0.000029402278,0.9449426,0.00028705545,0.03140782,0.022714077,0.00007072889],"about_ca_topic_score_codex":0.0000066602433,"about_ca_topic_score_gemma":0.000005106045,"teacher_disagreement_score":0.90573406,"about_ca_system_score_codex":0.0000128917245,"about_ca_system_score_gemma":0.000058192512,"threshold_uncertainty_score":0.99367046},"labels":[],"label_agreement":null},{"id":"W4388822224","doi":"10.1080/10236198.2023.2284831","title":"Controlled two-dimensional Markov chains between two absorbing barriers","year":2023,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Constructive; Continuation; Mathematics; Balance equation; Chain (unit); Bellman equation; Mathematical economics; Combinatorics; Discrete mathematics; Pure mathematics; Calculus (dental); Applied mathematics; Markov model; Computer science; Statistics; Process (computing)","score_opus":0.03146093346602658,"score_gpt":0.30175801773249183,"score_spread":0.27029708426646526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388822224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043967392,0.00009153749,0.94809204,0.006967828,0.000049405247,0.00040571252,0.000008685355,0.000052856296,0.00036454367],"genre_scores_gemma":[0.9941219,0.0000847025,0.0048185904,0.00018004201,0.00012655676,0.000055887464,0.0000057765496,0.0000063478624,0.0006001881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987933,0.0001612058,0.00040659463,0.00011738642,0.00033281426,0.00018868949],"domain_scores_gemma":[0.99786294,0.0011738809,0.0002624856,0.00027056382,0.0002507979,0.00017934616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011842245,0.00009526309,0.00020097969,0.00020661071,0.0006076336,0.00013143751,0.0005594817,0.00002357771,0.000024355402],"category_scores_gemma":[0.00013954015,0.0000615381,0.000062698724,0.0007091818,0.00009403379,0.000195972,0.00013063093,0.00019937262,0.00002273546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055943143,0.0001411795,0.00357989,0.000023180064,0.0003143704,0.000003491627,0.0044836514,0.097766265,0.007599116,0.740059,0.0013190757,0.14465486],"study_design_scores_gemma":[0.0037924326,0.00010512115,0.00833918,0.00004366436,0.000078401594,0.000018968176,0.00032551627,0.93644404,0.000116419644,0.049981803,0.0005453727,0.00020907784],"about_ca_topic_score_codex":0.00000963548,"about_ca_topic_score_gemma":0.000004817605,"teacher_disagreement_score":0.95015454,"about_ca_system_score_codex":0.000020551592,"about_ca_system_score_gemma":0.00014917618,"threshold_uncertainty_score":0.4673488},"labels":[],"label_agreement":null},{"id":"W4388906604","doi":"10.1016/j.tcs.2023.114313","title":"Deterministic rendezvous in infinite trees","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Computer science; Combinatorics; Node (physics); Tree (set theory); Mathematics; Discrete mathematics; Time complexity; Graph; Binary logarithm; Set (abstract data type); Algorithm","score_opus":0.02155835231924106,"score_gpt":0.28771762123303984,"score_spread":0.26615926891379876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018276082,0.0000054371644,0.97198355,0.0017843487,0.00041223722,0.00015784708,8.9053475e-7,0.00050847,0.006871147],"genre_scores_gemma":[0.9416544,0.000010692155,0.057790477,0.00044012675,0.000037888716,0.000010507988,9.38257e-7,0.0000059878744,0.000048992333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772495,0.000117179465,0.00027048143,0.00058777124,0.0006396856,0.00065991044],"domain_scores_gemma":[0.9986596,0.00033376817,0.000035446865,0.00064281863,0.00009564653,0.00023273623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017179069,0.00012716588,0.00015547678,0.0006091697,0.00022209634,0.00045728555,0.0021624651,0.00004015776,0.000033892407],"category_scores_gemma":[0.00019002905,0.00010857065,0.000035731486,0.004257944,0.0013521509,0.0005522947,0.0011545868,0.00017791922,0.00043230722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002249699,0.000024876394,0.00015070799,0.000003577258,6.85928e-7,0.00005349753,0.0005788797,0.004709694,0.0001067827,0.95137024,0.00006522317,0.042933576],"study_design_scores_gemma":[0.00018806348,0.00010897034,0.0043568015,0.00001900906,4.802757e-7,0.000013384108,0.000004698638,0.88540596,0.00016176912,0.109445125,0.00015716445,0.00013855251],"about_ca_topic_score_codex":0.0000027366825,"about_ca_topic_score_gemma":0.0000030304648,"teacher_disagreement_score":0.9233783,"about_ca_system_score_codex":0.000042292177,"about_ca_system_score_gemma":0.00014611139,"threshold_uncertainty_score":0.5556579},"labels":[],"label_agreement":null},{"id":"W4388964502","doi":"10.48550/arxiv.2311.12976","title":"Fast Deterministic Rendezvous in Labeled Lines","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Upper and lower bounds; Node (physics); Combinatorics; Matching (statistics); Path (computing); Binary logarithm; Integer (computer science); Mathematics; Time complexity; Discrete mathematics; Line (geometry); Position (finance); Computer science; Physics; Computer network; Geometry; Mathematical analysis","score_opus":0.1485900232893051,"score_gpt":0.22110459024087997,"score_spread":0.07251456695157488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388964502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073980264,0.00002817609,0.9203907,0.00048288688,0.0010429275,0.0005159288,0.000020764344,0.00083331985,0.002705034],"genre_scores_gemma":[0.98584706,0.00023545409,0.003361535,0.00008000377,0.000043838114,0.000002237815,0.00002121588,0.000021929032,0.01038673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998202,0.00016051967,0.00022542912,0.00093372853,0.00010246914,0.00037579914],"domain_scores_gemma":[0.99853116,0.00013408955,0.00013831469,0.0009218218,0.00013002068,0.00014460956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028283638,0.00022725403,0.00027934066,0.0005014767,0.00008614062,0.00015030225,0.0016701245,0.00022466094,0.000022930166],"category_scores_gemma":[0.00009028105,0.0002676889,0.00010187255,0.0010273985,0.00006923667,0.00021900037,0.0021254916,0.0005224501,0.0002792654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013137317,0.00009642596,0.0033971476,0.00010066282,0.000029354287,0.0012031916,0.00041488511,0.9356002,0.000017144737,0.057585206,0.00039078205,0.0011518683],"study_design_scores_gemma":[0.000424016,0.000036341284,0.0014249912,0.000098833654,0.000008876778,0.0000024093151,0.000033880166,0.97547406,0.000015697675,0.021985631,0.00019219791,0.00030308717],"about_ca_topic_score_codex":0.00016888531,"about_ca_topic_score_gemma":0.0003264968,"teacher_disagreement_score":0.91702914,"about_ca_system_score_codex":0.0001384675,"about_ca_system_score_gemma":0.0002357321,"threshold_uncertainty_score":0.9999775},"labels":[],"label_agreement":null},{"id":"W4389151102","doi":"10.1017/s0269888923000103","title":"Adaptive learning with artificial barriers yielding Nash equilibria in general games","year":2023,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nash equilibrium; Computer science; Reinforcement learning; Learning automata; Game theory; Fictitious play; Convergence (economics); Saddle point; Mathematical economics; Normal-form game; Repeated game; Artificial intelligence; Mathematical optimization; Mathematics; Automaton; Economics","score_opus":0.027753008466118806,"score_gpt":0.2696783488624332,"score_spread":0.2419253403963144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389151102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026859397,0.08573989,0.86857724,0.005036002,0.0012130596,0.002284632,0.000002045764,0.0027597153,0.0075280187],"genre_scores_gemma":[0.8980535,0.04507547,0.0463306,0.000636272,0.00079030095,0.00068744796,0.00001897769,0.00020056222,0.008206827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989544,0.000114516784,0.00021673694,0.00022928136,0.00015107494,0.00033395286],"domain_scores_gemma":[0.9993975,0.00015949497,0.00003799748,0.0002651251,0.00004919851,0.00009069277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103943,0.00013370214,0.00021458219,0.00013007034,0.00008308244,0.000076896555,0.0005045335,0.000027700678,0.000026067066],"category_scores_gemma":[0.00027206363,0.00009242191,0.000046219742,0.0015891406,0.000022094517,0.00020095024,0.00020147981,0.00028998454,0.00015383349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000913101,0.00002868515,0.00025994805,0.001725276,0.00007156424,0.000049913266,0.005694879,0.7400066,0.0013449362,0.08854524,0.0026807592,0.15958302],"study_design_scores_gemma":[0.00007843601,0.000039120234,0.00011882352,0.0015831013,0.000004973996,0.000005268499,0.000026284415,0.9852122,0.000054985012,0.00007448638,0.012653086,0.00014922817],"about_ca_topic_score_codex":0.000003013136,"about_ca_topic_score_gemma":0.000004479566,"teacher_disagreement_score":0.8711941,"about_ca_system_score_codex":0.00004072264,"about_ca_system_score_gemma":0.00007943016,"threshold_uncertainty_score":0.37688562},"labels":[],"label_agreement":null},{"id":"W4389486639","doi":"10.1007/978-3-031-49190-0_27","title":"Delaying Decisions and Reservation Costs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Reservation; Upper and lower bounds; Vertex cover; Competitive analysis; Vertex (graph theory); Edge cover; Computer science; Graph; Set (abstract data type); Online algorithm; Mathematical optimization; Combinatorics; Mathematics; Algorithm; Theoretical computer science","score_opus":0.0560672355227835,"score_gpt":0.29522076528910074,"score_spread":0.23915352976631724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389486639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041812247,0.0001218391,0.9935401,0.001929848,0.0007704581,0.0003121896,0.0000027318138,0.00021919206,0.0030618382],"genre_scores_gemma":[0.023981012,0.0006111394,0.9707063,0.0022352221,0.00024035005,0.000016851585,0.0000134065085,0.000054486107,0.0021412584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971744,0.00003389326,0.00037441246,0.0010683781,0.0008958843,0.00045302953],"domain_scores_gemma":[0.99756306,0.0009722482,0.0001380646,0.00084439287,0.00029903775,0.00018320345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011807444,0.00026871858,0.0002700747,0.00093269517,0.00035790988,0.0007654999,0.0017349256,0.00020875799,0.000008820241],"category_scores_gemma":[0.00039455964,0.00024775602,0.000047462665,0.0009169529,0.00034712744,0.0007194909,0.0016963694,0.00054452085,0.00006173222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023029093,0.000008674077,0.00008029215,0.000012009112,0.0000051354596,0.00004608834,0.00051742006,0.049647063,0.000040667044,0.09055675,0.00008362593,0.85899997],"study_design_scores_gemma":[0.00015118996,0.00006453144,0.00020421416,0.00031007713,0.0000017475977,0.000019006351,1.4660495e-7,0.84053695,0.00004928545,0.15760553,0.0007739762,0.0002833649],"about_ca_topic_score_codex":0.000021505037,"about_ca_topic_score_gemma":0.00010669434,"teacher_disagreement_score":0.8587166,"about_ca_system_score_codex":0.00018139719,"about_ca_system_score_gemma":0.00032857357,"threshold_uncertainty_score":0.9999975},"labels":[],"label_agreement":null},{"id":"W4390015024","doi":"10.1007/978-3-031-47126-1_5","title":"Discrete Planar Two-Watchtower Problem for k-Visibility","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Visibility; Planar; Computer science; Physics; Optics; Computer graphics (images)","score_opus":0.06622032969838589,"score_gpt":0.29840739100140007,"score_spread":0.2321870613030142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390015024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.387846e-7,0.0015583176,0.9735178,0.015876725,0.0000814667,0.00082395825,0.0006700594,0.0040139956,0.0034568715],"genre_scores_gemma":[0.0079068355,0.008055626,0.975811,0.00016491405,0.00003640923,0.00030030668,0.0027547553,0.00012130571,0.0048488164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985726,0.000012866049,0.00029529617,0.00066651474,0.00018053858,0.00027221284],"domain_scores_gemma":[0.9917945,0.0009536603,0.00010953995,0.007011476,0.000089878304,0.00004089523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033982465,0.0003276862,0.00030935655,0.0003140177,0.00024562865,0.00023553976,0.0052819555,0.0003382359,0.0000017091262],"category_scores_gemma":[0.00053038524,0.00027991625,0.000055139575,0.00016676218,0.00016082304,0.00022017652,0.0028696477,0.00077221467,0.000016379796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005147599,0.000021795948,0.000002919878,0.00015992257,0.000094971954,0.0000015124699,0.00008991,0.010204405,0.000043048607,0.86608493,0.0013459967,0.12194544],"study_design_scores_gemma":[0.00034666937,0.00019278064,0.000004969564,0.0004475791,0.000039576193,0.000007681761,0.000010691532,0.534607,0.00012435508,0.2145773,0.24890305,0.000738371],"about_ca_topic_score_codex":0.0000086803375,"about_ca_topic_score_gemma":0.000043008997,"teacher_disagreement_score":0.6515076,"about_ca_system_score_codex":0.00003854553,"about_ca_system_score_gemma":0.00004514034,"threshold_uncertainty_score":0.9999653},"labels":[],"label_agreement":null},{"id":"W4390072545","doi":"10.1007/978-3-031-49815-2_2","title":"A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Intersection (aeronautics); Granularity; Graph; Bounded function; Collision; Upper and lower bounds; Query optimization; Theoretical computer science; Data mining; Mathematics","score_opus":0.021075625155129417,"score_gpt":0.2584254129373303,"score_spread":0.23734978778220087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012566026,0.000076625765,0.9929655,0.00037302237,0.0020735227,0.00090401224,0.0000245504,0.00035110675,0.003106008],"genre_scores_gemma":[0.29199395,0.00016572418,0.701315,0.0009602456,0.0009244527,0.00011508162,0.000065448694,0.00013732506,0.004322805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571705,0.000064556865,0.0006300564,0.0015613248,0.0010972936,0.0009297159],"domain_scores_gemma":[0.9973335,0.0007031114,0.00032668433,0.0008328745,0.00058645254,0.00021734432],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013688963,0.00051251345,0.0005299979,0.0011676197,0.00058210583,0.0015028426,0.0025474986,0.000351439,0.000026918575],"category_scores_gemma":[0.00018516398,0.0005031512,0.00020437433,0.00073056365,0.0007884813,0.0011657629,0.0011697793,0.0007251214,0.00003204186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006105371,0.000022097543,0.000044010256,0.000073467294,0.000019682899,0.00012698393,0.0009744682,0.7210213,0.00011593077,0.23125619,0.000026898824,0.046312887],"study_design_scores_gemma":[0.00029617437,0.00018242962,0.000099470766,0.00068240677,0.0000054881375,0.000014717753,0.0000035919488,0.78625596,0.00034519416,0.21155539,0.000050733383,0.0005084706],"about_ca_topic_score_codex":0.00006670337,"about_ca_topic_score_gemma":0.00021189272,"teacher_disagreement_score":0.2918683,"about_ca_system_score_codex":0.00034063903,"about_ca_system_score_gemma":0.0010067752,"threshold_uncertainty_score":0.99974203},"labels":[],"label_agreement":null},{"id":"W4390072547","doi":"10.1007/978-3-031-49815-2_13","title":"Any-Order Online Interval Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Computer science; Bounded function; Scheduling (production processes); Interval (graph theory); Algorithm; Randomized algorithm; Selection (genetic algorithm); Deterministic algorithm; Order (exchange); Mathematical optimization; Mathematics; Upper and lower bounds; Artificial intelligence; Combinatorics","score_opus":0.03156848898930621,"score_gpt":0.28337998220595023,"score_spread":0.25181149321664403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016539092,0.000056113273,0.9928467,0.001994467,0.0019309437,0.0003412738,0.000006360587,0.00052138837,0.0022862002],"genre_scores_gemma":[0.0083142705,0.00015961267,0.9792465,0.0029056652,0.000774582,0.000014163197,0.000033746797,0.00008442234,0.008467042],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636304,0.000045510147,0.00049244566,0.0013835749,0.001027226,0.0006881867],"domain_scores_gemma":[0.9979907,0.0002709238,0.00019183691,0.0008295363,0.0005196358,0.00019731386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008281082,0.00041834085,0.00040277722,0.0011688467,0.0002503599,0.0006491166,0.002645167,0.00029518557,0.00005679071],"category_scores_gemma":[0.00015576585,0.00038997194,0.00010765645,0.0016649773,0.00038458893,0.0006732365,0.0014426297,0.00096179923,0.00019141073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052316236,0.000062229214,0.00006049284,0.000048476006,0.000017723038,0.000056976438,0.00071321195,0.2527488,0.000085893065,0.033314697,0.00020043012,0.7126859],"study_design_scores_gemma":[0.00019871714,0.00017308847,0.00010003958,0.00021869502,0.000003023118,0.000036021534,1.2734907e-7,0.93482095,0.0001429689,0.061696243,0.0021707732,0.0004393478],"about_ca_topic_score_codex":0.000025532814,"about_ca_topic_score_gemma":0.00024595505,"teacher_disagreement_score":0.71224654,"about_ca_system_score_codex":0.00026120283,"about_ca_system_score_gemma":0.0006419304,"threshold_uncertainty_score":0.9998552},"labels":[],"label_agreement":null},{"id":"W4390075113","doi":"10.2139/ssrn.4672523","title":"Adjoint-Based Enforcement of State Constraints in Pde Optimization Problems","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Enforcement; State (computer science); Mathematical optimization; Computer science; Optimization problem; Mathematics; Political science; Algorithm; Law","score_opus":0.026846365907648717,"score_gpt":0.27087519831248386,"score_spread":0.24402883240483514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065435574,0.0002360227,0.9965557,0.00091167283,0.0003669945,0.0006487782,0.000011719151,0.000104040366,0.00051072065],"genre_scores_gemma":[0.92781126,0.008693699,0.061524272,0.00016518548,0.000079868994,0.000104850966,0.00012238939,0.00008097829,0.0014174632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955946,0.00028304587,0.00097458955,0.0004844693,0.00070858275,0.0019547103],"domain_scores_gemma":[0.9982866,0.00007335016,0.0006896661,0.00048200614,0.00034230403,0.00012608318],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0039184843,0.00028214807,0.00041000263,0.0007776979,0.000087533976,0.00020783019,0.0012414458,0.00016931495,0.00006967776],"category_scores_gemma":[0.000099170786,0.00027692076,0.00016338358,0.0005785093,0.00010598407,0.00025363817,0.00048042857,0.0028445537,0.0000142454455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011087293,0.000082613195,0.00015680242,0.00007828785,0.00006499488,0.0000069527873,0.00036816453,0.9476767,0.00001887061,0.04437452,0.000021179068,0.0071397987],"study_design_scores_gemma":[0.0011384486,0.00023836273,0.00003631198,0.0003373545,0.000007932996,0.000019658932,0.00012051417,0.87054116,0.000096799995,0.1271585,0.000042873584,0.00026207053],"about_ca_topic_score_codex":0.00020734232,"about_ca_topic_score_gemma":0.0006487915,"teacher_disagreement_score":0.9350314,"about_ca_system_score_codex":0.0011656047,"about_ca_system_score_gemma":0.008872536,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null},{"id":"W4390099784","doi":"10.1109/robio58561.2023.10354912","title":"ANMIP: Adaptive Navigation based on Mutual Information Perception in Uncertain Environments","year":2023,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Education; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Perception; Mutual information; Human–computer interaction; Computer vision; Artificial intelligence; Psychology; Neuroscience","score_opus":0.025031853341866445,"score_gpt":0.26065721521859725,"score_spread":0.2356253618767308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390099784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015247696,3.4643156e-7,0.97595704,0.0011360097,0.00008647579,0.00031733574,0.000002649692,0.000196447,0.007056021],"genre_scores_gemma":[0.97464675,0.000006290896,0.023734411,0.0008301227,0.000010112079,0.000042074353,0.0001581394,0.0000038094797,0.00056831574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991061,0.000078539655,0.00017014681,0.0001440895,0.00033583428,0.0001652995],"domain_scores_gemma":[0.99967676,0.000046103207,0.00003805781,0.0001757665,0.000017060433,0.000046242465],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003407661,0.00007022032,0.00005450729,0.00027654305,0.00006100031,0.00008045137,0.00018710362,0.000045861412,0.000074122596],"category_scores_gemma":[0.000021237218,0.000065140215,0.000019236208,0.00063182553,0.000016564527,0.0011529225,0.00004982976,0.00008581151,0.0014382428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023275286,0.00006694703,0.00085397315,0.000008345033,0.000002197822,0.000003651054,0.0028794704,0.9100042,0.00034585418,0.013353175,0.0013845738,0.071074314],"study_design_scores_gemma":[0.00039098816,0.00011084876,0.0149865085,0.000015188319,2.883687e-7,2.4555203e-7,0.00021302984,0.98292404,0.0000753941,0.00034193555,0.00086470414,0.0000768258],"about_ca_topic_score_codex":0.00003231827,"about_ca_topic_score_gemma":0.000003702042,"teacher_disagreement_score":0.95939904,"about_ca_system_score_codex":0.00012342095,"about_ca_system_score_gemma":0.000031275005,"threshold_uncertainty_score":0.9993393},"labels":[],"label_agreement":null},{"id":"W4391090600","doi":"10.1145/3631461.3631557","title":"Renting Servers in the Cloud: Parameterized Analysis of FirstFit","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Server; Computer science; Cloud computing; Competitive analysis; Renting; Parameterized complexity; Online algorithm; Computer network; Distributed computing; Operating system; Upper and lower bounds; Algorithm; Mathematics","score_opus":0.029754977645739606,"score_gpt":0.2957998667472194,"score_spread":0.26604488910147983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391090600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063795775,0.00011067521,0.9179582,0.0058908244,0.0001859273,0.0001676917,0.0000016152734,0.00013235369,0.011756911],"genre_scores_gemma":[0.9743998,0.0000200666,0.024918593,0.0002090422,0.0000054347192,0.000005384579,0.0000026140347,0.0000016984284,0.000437339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993471,0.00008791924,0.00015418012,0.00014098233,0.00017011749,0.000099685196],"domain_scores_gemma":[0.9995319,0.00017492262,0.000017561573,0.00023982079,0.000020778927,0.00001502082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006396213,0.000037277634,0.00008839725,0.00024959978,0.000021688973,0.00017565227,0.00043616715,0.000015836264,0.000102658494],"category_scores_gemma":[0.000027312873,0.000022968283,0.00007724171,0.0027520529,0.000014140007,0.00017674545,0.00007648419,0.00006092323,0.0000095487185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009024087,0.0001765584,0.0064539197,0.00015769797,0.0009949368,0.000052595653,0.026584696,0.14653651,0.0007476408,0.771922,0.0034749336,0.042889487],"study_design_scores_gemma":[0.000050538216,0.000010438771,0.0010146709,0.000008674665,0.000018542201,3.3719184e-7,0.00008198099,0.99692816,0.000051027626,0.0006955274,0.0011081549,0.00003194564],"about_ca_topic_score_codex":0.00009663995,"about_ca_topic_score_gemma":0.00006530557,"teacher_disagreement_score":0.91060406,"about_ca_system_score_codex":0.000007805296,"about_ca_system_score_gemma":0.00001792577,"threshold_uncertainty_score":0.16938189},"labels":[],"label_agreement":null},{"id":"W4391095687","doi":"10.1145/3631461.3631543","title":"Maximal Independent Set via Mobile Agents","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Set (abstract data type); Programming language","score_opus":0.029842197941870166,"score_gpt":0.30058255182076987,"score_spread":0.2707403538788997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391095687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095356465,0.00007877151,0.9756841,0.0005968144,0.0003913668,0.00015202811,0.0000013276091,0.00041169286,0.021730311],"genre_scores_gemma":[0.9355451,0.00003490781,0.04278058,0.0007829866,0.000045157038,0.000046390574,0.0000066349266,0.000009808607,0.02074843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922293,0.000025664503,0.00009991843,0.0002358989,0.00024658683,0.00016899577],"domain_scores_gemma":[0.99964744,0.000017588334,0.00000710294,0.00021598465,0.000027869004,0.00008400351],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001723177,0.000059497437,0.00004850271,0.00008250107,0.00004358437,0.00035253132,0.0003826284,0.00002995092,0.0010892898],"category_scores_gemma":[0.0000028617435,0.000047350433,0.000032740758,0.00027679434,0.000011452284,0.0003796851,0.00022045009,0.00008979822,0.0013709945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047233098,0.00025470744,0.00083225535,0.00015084764,0.00010686745,0.0004122663,0.0055729044,0.023868851,0.0011108142,0.39666846,0.15882753,0.41218978],"study_design_scores_gemma":[0.0000779245,0.000054768763,0.0001622735,0.0000074312316,9.593006e-7,0.000016702585,0.000014904384,0.92551,0.0003856589,0.0020440184,0.07163502,0.00009033076],"about_ca_topic_score_codex":0.000015872698,"about_ca_topic_score_gemma":0.0000035174958,"teacher_disagreement_score":0.93459153,"about_ca_system_score_codex":0.000024161172,"about_ca_system_score_gemma":0.000043388838,"threshold_uncertainty_score":0.99982387},"labels":[],"label_agreement":null},{"id":"W4391233586","doi":"10.2139/ssrn.4706325","title":"Approximate Linear Programming for a Queueing Control Problem","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Queueing theory; Linear programming; Computer science; Layered queueing network; Control (management); Mathematical optimization; Queueing system; Mathematics; Computer network; Artificial intelligence","score_opus":0.014583319534774082,"score_gpt":0.2810955688250589,"score_spread":0.2665122492902848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391233586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120346405,0.0045866626,0.98696256,0.0050663,0.00065353897,0.0017445219,0.000007372702,0.00040723977,0.00045148548],"genre_scores_gemma":[0.2453366,0.0050416654,0.7379149,0.00057248387,0.0022656783,0.0014315047,0.000046710687,0.00026284644,0.0071275732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945971,0.00016014265,0.0006556425,0.00074132875,0.00049958564,0.003346228],"domain_scores_gemma":[0.99850094,0.00008855189,0.0003598715,0.00047187248,0.00039058467,0.00018815564],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0046173045,0.000384207,0.00044581364,0.0003633021,0.0003263593,0.0013019232,0.0016004748,0.00027377965,0.00000382749],"category_scores_gemma":[0.000078484314,0.00033208486,0.00040783844,0.00031705617,0.000042654654,0.00025531536,0.00085774047,0.005755045,0.000025700514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003071822,0.00009242752,0.000013281788,0.00045330139,0.00048757912,0.00001018496,0.00063641265,0.02095027,0.000040770585,0.82039136,0.00016620758,0.15672748],"study_design_scores_gemma":[0.0005933043,0.00022145975,2.8717372e-7,0.00020613387,0.00003865406,0.00015399967,0.00006733468,0.45855436,0.000015229064,0.5357982,0.0040853317,0.00026568392],"about_ca_topic_score_codex":0.000026534204,"about_ca_topic_score_gemma":0.000081448394,"teacher_disagreement_score":0.4376041,"about_ca_system_score_codex":0.0009737739,"about_ca_system_score_gemma":0.0070711616,"threshold_uncertainty_score":0.9999131},"labels":[],"label_agreement":null},{"id":"W4391321941","doi":"10.1137/23m1552231","title":"The Power of Filling in Balanced Allocations","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"European Research Council; Engineering and Physical Sciences Research Council","keywords":"Mathematics; Power (physics); Combinatorics; Discrete mathematics; Mathematical economics; Mathematical optimization","score_opus":0.02026844332587755,"score_gpt":0.2940535587910843,"score_spread":0.27378511546520673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391321941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002704694,0.0004992065,0.97947717,0.005983226,0.00037141296,0.00015156725,0.0000019379254,0.000047111113,0.01076368],"genre_scores_gemma":[0.91295904,0.0005251413,0.08545081,0.000110418034,0.000030203797,0.0000075663365,6.351866e-7,0.0000141522505,0.0009020313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904394,0.000050305272,0.0003495367,0.00008938892,0.00030628606,0.00016055109],"domain_scores_gemma":[0.99921227,0.0003462887,0.00008051722,0.00023897321,0.000068625835,0.000053340904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078423053,0.00006884784,0.00009890833,0.00011530223,0.000110083674,0.00034426688,0.0004901591,0.000024509212,0.000026031052],"category_scores_gemma":[0.00013518312,0.00004039666,0.000061969964,0.00038749338,0.00003522695,0.00020354515,0.000055352877,0.00024920068,0.000027231146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025066774,0.00006296133,0.000018153889,0.00006554488,0.000029833398,0.000019922563,0.006019959,0.015366261,0.00026997883,0.97357166,0.0010951492,0.0034780682],"study_design_scores_gemma":[0.00014989632,0.000093119495,0.00008351406,0.00052402524,0.0000029466062,0.000046253273,0.00042662464,0.90953696,0.0002356381,0.085427135,0.003379447,0.00009441531],"about_ca_topic_score_codex":4.0102321e-7,"about_ca_topic_score_gemma":0.0000015949543,"teacher_disagreement_score":0.91025436,"about_ca_system_score_codex":0.000030514067,"about_ca_system_score_gemma":0.00008251406,"threshold_uncertainty_score":0.33197734},"labels":[],"label_agreement":null},{"id":"W4392368986","doi":"10.1016/j.cie.2024.110008","title":"A robust optimization approach to multi-period competitive location problem for bank branches considering first-mover advantage","year":2024,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"First-mover advantage; Period (music); Competitive advantage; Computer science; Mathematical optimization; Business; Mathematics; Industrial organization; Marketing; Physics","score_opus":0.05734668844502962,"score_gpt":0.24529953030984614,"score_spread":0.18795284186481653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392368986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005826608,0.00014453511,0.99523467,0.00075061916,0.0013142498,0.0014962129,0.000011129266,0.000793029,0.00019729121],"genre_scores_gemma":[0.04562084,0.000009667575,0.953451,0.00011479637,0.0003654445,0.0002497211,0.000050662326,0.000051495303,0.000086389664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817985,0.00003550138,0.00040538295,0.0006738204,0.0002483742,0.00045709067],"domain_scores_gemma":[0.99903494,0.00022839326,0.000052473246,0.0003086371,0.00016732413,0.00020821324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038501932,0.00028574996,0.00027898562,0.0003910618,0.00016297311,0.00081369426,0.00050613546,0.00015964617,0.0000057497095],"category_scores_gemma":[0.00012854712,0.00030700435,0.000093787414,0.0010154162,0.000024587162,0.0008450031,0.0002381197,0.0002961778,0.000009023931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007988961,0.00004506067,0.000005513675,0.00016214172,0.000044875072,0.0000041608955,0.0014486687,0.9732751,0.00006107912,0.018794458,0.00043524982,0.0057156645],"study_design_scores_gemma":[0.00094470015,0.00008049047,0.0000046934947,0.00041325213,0.000010187275,0.00001741927,0.00006680666,0.9887758,0.00018737055,0.000010613958,0.009136488,0.00035221557],"about_ca_topic_score_codex":0.000007324465,"about_ca_topic_score_gemma":0.0000014260447,"teacher_disagreement_score":0.045562573,"about_ca_system_score_codex":0.00020415055,"about_ca_system_score_gemma":0.00015521812,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W4392923947","doi":"10.1002/msd2.12098","title":"An introductory review of swarm technology for spacecraft on‐orbit servicing","year":2024,"lang":"en","type":"article","venue":"International journal of mechanical system dynamics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spacecraft; Computer science; Swarm behaviour; Systems engineering; Field (mathematics); Parallels; Satellite; Perspective (graphical); Space (punctuation); Artificial intelligence; Aerospace engineering; Engineering; Mechanical engineering","score_opus":0.011082894579561903,"score_gpt":0.3112667918387998,"score_spread":0.3001838972592379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392923947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006651792,0.00155858,0.97780323,0.016911337,0.0026287825,0.00020548554,0.000016993323,0.00007336709,0.00013706672],"genre_scores_gemma":[0.87380075,0.0020211823,0.12244311,0.0009161607,0.00062546803,0.00001860579,0.000015573378,0.000033911165,0.00012520292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822414,0.00008533057,0.0007105768,0.00020679538,0.0006362869,0.00013685055],"domain_scores_gemma":[0.9980515,0.00015109655,0.00030985934,0.00025318156,0.0011470672,0.000087266075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013870058,0.00010317846,0.00028223617,0.0003959767,0.000025503863,0.0000928097,0.0014400576,0.00008268781,0.000009308446],"category_scores_gemma":[0.00015628665,0.00008240418,0.00015317662,0.00031618893,0.000017939257,0.00032561168,0.000114062146,0.00024139954,0.000007027565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020223411,0.0000779868,0.0000053880676,0.0015089421,0.0001316996,0.00004495894,0.000038623733,0.0027592902,0.0007298955,0.9738644,0.00037765052,0.020440955],"study_design_scores_gemma":[0.00027194788,0.00046446655,0.0000017491067,0.009842928,0.00001719686,0.00047312828,0.000059906466,0.98027706,0.0008055818,0.005042768,0.0026480886,0.000095176976],"about_ca_topic_score_codex":0.0000031518919,"about_ca_topic_score_gemma":0.000004396041,"teacher_disagreement_score":0.9775178,"about_ca_system_score_codex":0.00032825363,"about_ca_system_score_gemma":0.00017554784,"threshold_uncertainty_score":0.33603448},"labels":[],"label_agreement":null},{"id":"W4393454360","doi":"10.5281/zenodo.8177271","title":"Continent-scale inventory routing solutions","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scale (ratio); Routing (electronic design automation); Computer science; Environmental science; Geography; Cartography; Computer network","score_opus":0.07112794725969027,"score_gpt":0.26417643504289445,"score_spread":0.1930484877832042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393454360","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062574704,0.00008933586,0.07830438,0.0027716376,0.00083811174,0.0009336665,0.90108365,0.0035793541,0.012393615],"genre_scores_gemma":[0.000056623918,0.00039218913,0.0007563098,0.00027246034,0.00023592109,1.7086235e-7,0.9952798,0.0009037079,0.002102806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966735,0.0006108075,0.00044509154,0.00077443785,0.0007440004,0.00075216277],"domain_scores_gemma":[0.99745613,0.000044140284,0.0002325629,0.0012205883,0.00072490086,0.00032167518],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014858862,0.0002535573,0.00025736107,0.0005836711,0.0034086825,0.0022653358,0.0038619833,0.0001843979,0.002489491],"category_scores_gemma":[0.0007823914,0.00028320707,0.00011205485,0.0013137676,0.00017545125,0.0004835149,0.00561995,0.0007022756,0.061495457],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037029838,0.0000884967,1.4389786e-7,0.00006590742,0.00003264327,0.0000151384365,0.00022399168,0.00018379837,0.00002521155,0.0018627697,0.99182457,0.0056736395],"study_design_scores_gemma":[0.00031052576,0.00009902546,0.000015881182,0.00007345253,0.000011748806,0.000038328853,0.000066979796,0.009093042,0.0000046887653,0.00013087946,0.98986953,0.00028592555],"about_ca_topic_score_codex":0.00010652474,"about_ca_topic_score_gemma":0.0000042305924,"teacher_disagreement_score":0.09419617,"about_ca_system_score_codex":0.00021370844,"about_ca_system_score_gemma":0.000018348686,"threshold_uncertainty_score":0.99996203},"labels":[],"label_agreement":null},{"id":"W4394601352","doi":"10.1007/s00446-024-00463-7","title":"On the power of bounded asynchrony: convergence by autonomous robots with limited visibility","year":2024,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia","funders":"Gruppo Nazionale per il Calcolo Scientifico; Università di Pisa; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Asynchrony (computer programming); Visibility; Bounded function; Convergence (economics); Power (physics); Computer science; Robot; Mathematics; Artificial intelligence; Telecommunications; Economics; Geography; Asynchronous communication; Mathematical analysis; Physics; Meteorology","score_opus":0.012521853781385211,"score_gpt":0.247799545274655,"score_spread":0.2352776914932698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394601352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05113731,0.00012583076,0.94553506,0.0018051252,0.00020116186,0.00025541242,0.000047940808,0.0003391288,0.00055304734],"genre_scores_gemma":[0.9947923,0.0000030626284,0.004867845,0.0002334138,0.0000098059845,0.000004580023,0.000052214953,0.000009960328,0.000026844456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839264,0.00015102369,0.00030023238,0.0004632986,0.00036923832,0.00032355284],"domain_scores_gemma":[0.9985194,0.0005268757,0.000091767215,0.00060369546,0.00017152513,0.0000867272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056866795,0.00016012856,0.00016944463,0.000055693243,0.00019813982,0.00035399795,0.00077806856,0.00005234316,0.00006449349],"category_scores_gemma":[0.00009567327,0.00010601869,0.00006135002,0.0009935012,0.00012403897,0.00017422363,0.00016921845,0.0002594646,0.000029592411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053654345,0.0005735596,0.0014892074,0.00018476954,0.0002871971,0.00006259804,0.0030262205,0.23884803,0.0018404683,0.7105559,0.027175874,0.015902514],"study_design_scores_gemma":[0.00016894727,0.000200996,0.00062474393,0.00011489647,0.000004531948,0.000005954389,0.000039880986,0.99470335,0.0017120864,0.0014701149,0.0008030127,0.00015148953],"about_ca_topic_score_codex":0.000020003872,"about_ca_topic_score_gemma":0.0000011702068,"teacher_disagreement_score":0.94365495,"about_ca_system_score_codex":0.00009405631,"about_ca_system_score_gemma":0.0001821008,"threshold_uncertainty_score":0.43233168},"labels":[],"label_agreement":null},{"id":"W4395095509","doi":"10.1017/9781108682404","title":"Computational Principles of Mobile Robotics","year":2024,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; McGill University","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Mobile robot; Human–computer interaction; Robot","score_opus":0.030121199146705885,"score_gpt":0.2285061262564518,"score_spread":0.19838492710974592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395095509","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017377769,0.000114024144,0.26012033,0.000017477088,0.00018798473,0.00028823203,0.000086888766,0.00015442645,0.73902893],"genre_scores_gemma":[0.00006798676,0.000039373208,0.023706237,0.000027310205,0.000037728285,0.0000010450595,0.00006714276,0.000018749544,0.9760344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987112,0.000058295464,0.00022252873,0.0004188307,0.0003960881,0.00019301343],"domain_scores_gemma":[0.99886984,0.00010025043,0.00016339326,0.00045404336,0.00029278293,0.00011972197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012586649,0.00019848417,0.00028386418,0.00025066224,0.00008121799,0.000091494214,0.00106323,0.00018286033,0.0000016712252],"category_scores_gemma":[0.0000059817025,0.00022695573,0.00015141538,0.000039364008,0.00016657505,0.00012681543,0.00097458507,0.00032722144,0.000020983427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034216569,0.000013530757,3.1466777e-7,0.00020583703,0.000063333544,0.000058093276,0.00009494495,0.08251264,0.0000016523115,0.8702676,0.04633164,0.0004469796],"study_design_scores_gemma":[0.0001926723,0.000056480705,0.0000017154641,0.00016599729,0.00003462296,0.0000073687183,0.0000071993277,0.22442998,0.000030163988,0.00008201793,0.7747806,0.00021118243],"about_ca_topic_score_codex":0.0000108052855,"about_ca_topic_score_gemma":2.9676858e-7,"teacher_disagreement_score":0.8701856,"about_ca_system_score_codex":0.00017207951,"about_ca_system_score_gemma":0.00073159684,"threshold_uncertainty_score":0.9254986},"labels":[],"label_agreement":null},{"id":"W4395095515","doi":"10.1017/9781108682404.019","title":"The Future of Mobile Robotics","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; McGill University","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Robot","score_opus":0.014953934929542969,"score_gpt":0.20570373519094645,"score_spread":0.19074980026140348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395095515","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.1870302e-7,0.0012145397,0.024946792,0.000114816816,0.00061697233,0.00032114776,0.000041486222,0.00012940622,0.9726144],"genre_scores_gemma":[0.000049251685,0.00093674596,0.0015420254,0.000025611203,0.0000992558,6.444791e-7,0.000006807737,0.000018321476,0.9973213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901116,0.000023873828,0.00015974713,0.00032301465,0.00029502015,0.00018716377],"domain_scores_gemma":[0.9987795,0.00007363946,0.00012716312,0.00071686093,0.00020639598,0.00009649097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012419044,0.0001855092,0.00020048225,0.000102908525,0.00018224325,0.00012222676,0.0013276744,0.00018967966,0.0000013098193],"category_scores_gemma":[0.000001725588,0.00015573013,0.00016153045,0.000017192777,0.00018732184,0.00008469371,0.0008525581,0.0003983793,0.0000181261],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004614812,0.0000030159968,5.846125e-8,0.000054731234,0.00005718354,0.00004446285,0.000055715143,0.00047489416,0.0000029010646,0.971457,0.023570282,0.004275134],"study_design_scores_gemma":[0.000107023574,0.00004612118,2.4865497e-7,0.000071013914,0.00003143474,0.0000054254206,0.000024277699,0.008662979,0.000037699167,0.00020696413,0.9906462,0.00016062724],"about_ca_topic_score_codex":0.000008106857,"about_ca_topic_score_gemma":0.00000139635,"teacher_disagreement_score":0.97125006,"about_ca_system_score_codex":0.00006600191,"about_ca_system_score_gemma":0.0001346717,"threshold_uncertainty_score":0.63504905},"labels":[],"label_agreement":null},{"id":"W4395470976","doi":"10.2139/ssrn.4804794","title":"Quality Versus Quantity in Dynamic Matching with Impatient Agents","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Quality (philosophy); Matching (statistics); Computer science; Statistics; Mathematics; Physics","score_opus":0.023568945361679316,"score_gpt":0.331891409282994,"score_spread":0.3083224639213147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395470976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30761898,0.00077661994,0.689455,0.00096816185,0.00038711508,0.00010792098,7.2589285e-7,0.00008471373,0.0006008168],"genre_scores_gemma":[0.99686,0.00083329756,0.0019650059,0.000039847262,0.000020560197,0.0000035028831,0.0000017091784,0.000010019908,0.0002660549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977439,0.0001620542,0.00024472582,0.00023852875,0.00038222977,0.0012285644],"domain_scores_gemma":[0.9995871,0.00005769878,0.000055640863,0.00017835162,0.000045339664,0.00007587895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019068968,0.00010461732,0.00011402339,0.000190525,0.00011444075,0.0003406213,0.00045238898,0.000034028442,0.000012713649],"category_scores_gemma":[0.000018165292,0.00008116421,0.00005012139,0.00049911556,0.000019751607,0.00064673997,0.00007919845,0.0012905282,0.000034104665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009151387,0.000101975216,0.0008126569,0.00002659954,0.00009829127,0.000038561095,0.0017625975,0.01542868,0.000060351034,0.93415934,0.000022025773,0.047397416],"study_design_scores_gemma":[0.0028438093,0.0013822281,0.0041531823,0.00018020584,0.000010645059,0.00029809156,0.0014152529,0.7261188,0.000017177834,0.26236314,0.00070259074,0.0005148861],"about_ca_topic_score_codex":0.00017064194,"about_ca_topic_score_gemma":0.0038071836,"teacher_disagreement_score":0.7106901,"about_ca_system_score_codex":0.0010738918,"about_ca_system_score_gemma":0.001648364,"threshold_uncertainty_score":0.56067747},"labels":[],"label_agreement":null},{"id":"W4399167020","doi":"10.2139/ssrn.4848615","title":"On the Computational Power of Energy-Constrained Mobile Robots","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Power (physics); Mobile robot; Computer science; Energy (signal processing); Robot; Artificial intelligence; Physics","score_opus":0.010207806511504665,"score_gpt":0.25424299666228856,"score_spread":0.2440351901507839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399167020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026784176,0.0019726856,0.9840711,0.0050470536,0.00070892624,0.00023280813,0.000009015032,0.00007895182,0.00520106],"genre_scores_gemma":[0.99378633,0.00071702804,0.0036426445,0.000341199,0.00008577646,0.000029205112,0.000009168819,0.000021953316,0.0013666964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973026,0.00021387628,0.00042397773,0.00034845364,0.00064118527,0.0010698868],"domain_scores_gemma":[0.9987997,0.00022852822,0.00025595925,0.00039074806,0.00024840375,0.00007667741],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017285319,0.00021439159,0.00022894493,0.0002424951,0.00014557755,0.00029158304,0.0013514918,0.00013220562,0.0000873205],"category_scores_gemma":[0.00004264294,0.0001454069,0.00023694032,0.00028279005,0.00009289088,0.00007475066,0.00069594715,0.0033447936,0.00003076899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004208075,0.000040226387,0.000001281295,0.000006925255,0.0001186056,0.0000025284542,0.00017199239,0.29200363,0.000005839461,0.7035101,0.0004066625,0.0037280042],"study_design_scores_gemma":[0.00013914553,0.00022440006,0.000004065076,0.00008428778,0.000008330833,0.00009971109,0.00008403836,0.16329122,0.000021811926,0.8357318,0.0001851249,0.00012607948],"about_ca_topic_score_codex":0.000012008716,"about_ca_topic_score_gemma":0.000019402954,"teacher_disagreement_score":0.9911079,"about_ca_system_score_codex":0.00040332563,"about_ca_system_score_gemma":0.005600542,"threshold_uncertainty_score":0.99895453},"labels":[],"label_agreement":null},{"id":"W4399254466","doi":"10.1145/3652963.3655074","title":"Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm; Artificial intelligence","score_opus":0.01702083849957166,"score_gpt":0.24947373007213117,"score_spread":0.2324528915725595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399254466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038168626,0.00015374293,0.9906673,0.0024227165,0.00008739247,0.00010598198,6.6289783e-7,0.00041936224,0.0023260182],"genre_scores_gemma":[0.33115128,0.00041396086,0.6532333,0.0011076797,0.00007259401,0.000008282409,0.000032654334,0.00002693147,0.013953332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992703,0.000047890055,0.00008655419,0.0002657977,0.00018389107,0.00014557611],"domain_scores_gemma":[0.99967146,0.00006819456,0.000014051878,0.0001087269,0.000050389128,0.00008720579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019990247,0.00007707229,0.00006793442,0.00009636414,0.00012286418,0.00036800464,0.00014980149,0.000025542906,0.00006446908],"category_scores_gemma":[0.000012161302,0.000053646065,0.00001214419,0.0003125451,0.000019947382,0.00045454514,0.00013440063,0.0002208815,0.000025754465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043799562,0.00047775797,0.0024630805,0.00039256734,0.00024179423,0.00041571696,0.0061368737,0.0930353,0.0017075797,0.1308244,0.0066469684,0.75761414],"study_design_scores_gemma":[0.0002454467,0.00014071919,0.00011518006,0.00006658577,0.0000024531357,0.000023118417,0.00018068728,0.9915429,0.0000711159,0.00003117206,0.007492564,0.0000880965],"about_ca_topic_score_codex":0.00006148456,"about_ca_topic_score_gemma":0.000012383123,"teacher_disagreement_score":0.89850754,"about_ca_system_score_codex":0.00003431107,"about_ca_system_score_gemma":0.00004180306,"threshold_uncertainty_score":0.35486773},"labels":[],"label_agreement":null},{"id":"W4399371091","doi":"10.7155/jgaa.v28i1.2929","title":"The Minimum Consistent Spanning Subset Problem on Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Computer science","score_opus":0.018457793447468035,"score_gpt":0.2757615769877305,"score_spread":0.2573037835402625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399371091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046279823,0.003853628,0.97870183,0.014687827,0.00017332139,0.00029317813,0.0000057852044,0.00005284314,0.001768807],"genre_scores_gemma":[0.51826537,0.01754501,0.45671114,0.0016981841,0.001286442,0.00041463107,0.000010149971,0.00006597732,0.00400307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992012,0.000032140386,0.00027363808,0.00013349426,0.00022542046,0.00013412036],"domain_scores_gemma":[0.9992882,0.00021228392,0.00009503124,0.000165128,0.00013603191,0.00010334405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045773457,0.00007270651,0.00008973263,0.00013629245,0.00031993067,0.00051854923,0.00031784596,0.00002499371,0.000002597551],"category_scores_gemma":[0.000007930681,0.0000433052,0.00007845256,0.00043552654,0.0000814331,0.00018566767,0.000044127355,0.00018407754,0.000005996375],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004571902,0.000085791056,0.000054501157,0.000021253636,0.00008532403,0.000012461615,0.0004916115,0.0011076571,0.00023368251,0.5495132,0.0076629263,0.440727],"study_design_scores_gemma":[0.00050183723,0.0005044496,0.0011411596,0.00020594991,0.000036478505,0.00032766897,0.0003625015,0.21608374,0.0002122391,0.0958059,0.6845638,0.00025428968],"about_ca_topic_score_codex":0.0000017097591,"about_ca_topic_score_gemma":0.000002037867,"teacher_disagreement_score":0.67690086,"about_ca_system_score_codex":0.00001191843,"about_ca_system_score_gemma":0.00006705708,"threshold_uncertainty_score":0.5000382},"labels":[],"label_agreement":null},{"id":"W4399411102","doi":"10.1109/jas.2024.124356","title":"Semi-Decentralized Convex Optimization on $\\mathcal{SO}(3)$","year":2024,"lang":"en","type":"article","venue":"IEEE/CAA Journal of Automatica Sinica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Conic optimization; Regular polygon; Convex optimization; Mathematical optimization; Convex analysis; Mathematics; Computer science; Geometry","score_opus":0.020985921517236397,"score_gpt":0.30264534218709926,"score_spread":0.2816594206698629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399411102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017398567,0.0005938624,0.98039305,0.011508862,0.002114398,0.00024900152,0.000003970352,0.00037400093,0.003023011],"genre_scores_gemma":[0.55864257,0.0014667311,0.43588075,0.002527136,0.000385254,0.000010827122,0.0000047655844,0.00007152059,0.0010104715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705267,0.00028956358,0.001047692,0.00029769982,0.00092521025,0.0003871531],"domain_scores_gemma":[0.9978953,0.0006396456,0.00032786813,0.0004541201,0.00035757947,0.00032549998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012303301,0.00021697815,0.00042298654,0.00040500364,0.00014465633,0.001031019,0.0009609839,0.00012940212,0.0003732741],"category_scores_gemma":[0.00031098386,0.00016978131,0.0002465814,0.00077583344,0.00011129879,0.0009478994,0.00007334154,0.00047530595,0.00022062448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010628753,0.0008855184,0.000043257907,0.00040839493,0.0005377785,0.00074532104,0.0046441765,0.75291634,0.0017657675,0.101301745,0.08902424,0.047621183],"study_design_scores_gemma":[0.0006899096,0.00040644474,0.00004161322,0.0005376848,0.000027023,0.00021225539,0.000015731954,0.97631776,0.0007550652,0.0017840286,0.019014724,0.00019773853],"about_ca_topic_score_codex":0.0000015540078,"about_ca_topic_score_gemma":2.9188544e-7,"teacher_disagreement_score":0.5569027,"about_ca_system_score_codex":0.00011604243,"about_ca_system_score_gemma":0.0005737553,"threshold_uncertainty_score":0.99421406},"labels":[],"label_agreement":null},{"id":"W4399412507","doi":"10.1016/j.dam.2024.05.024","title":"Graph exploration by a deterministic memoryless automaton with pebbles","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Deterministic automaton; Two-way deterministic finite automaton; Automaton; Graph; Büchi automaton; Combinatorics; Theoretical computer science; Discrete mathematics; Nondeterministic finite automaton; Algorithm; Finite-state machine; Computer science; Automata theory","score_opus":0.01631122847895078,"score_gpt":0.2548495017715611,"score_spread":0.23853827329261035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399412507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010495533,0.000079598125,0.98687017,0.00040942282,0.00006521263,0.00039215962,0.000008139384,0.0007171311,0.010408592],"genre_scores_gemma":[0.6053607,0.0000655026,0.39324403,0.00016590669,0.000033516462,0.00034039465,0.000054821063,0.00005977503,0.00067534915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987229,0.0000152472385,0.00025712443,0.00034925944,0.0004013859,0.0002540673],"domain_scores_gemma":[0.9992539,0.00010463267,0.00006193517,0.0004389458,0.000039313047,0.00010125889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021858087,0.0001817877,0.00018041253,0.00012106492,0.00011909695,0.000672283,0.00044368595,0.00005322693,0.000022349961],"category_scores_gemma":[0.000008631501,0.00013519105,0.000039068807,0.00049444556,0.000065357715,0.00045809976,0.00010292424,0.00012108954,0.00009605495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039978213,0.00008561234,0.0000013330224,0.0005877022,0.00005031486,0.000022460275,0.00636273,0.0010676282,0.002223566,0.9787791,0.0033566314,0.007458957],"study_design_scores_gemma":[0.00029010972,0.00008872255,0.0000018711208,0.00017735215,0.000028695815,0.000025813184,0.00059888884,0.9067975,0.0037305774,0.086197235,0.0016920884,0.00037111016],"about_ca_topic_score_codex":0.0000013070456,"about_ca_topic_score_gemma":0.000002229118,"teacher_disagreement_score":0.9057299,"about_ca_system_score_codex":0.000023888266,"about_ca_system_score_gemma":0.000065172026,"threshold_uncertainty_score":0.6482841},"labels":[],"label_agreement":null},{"id":"W4399554409","doi":"10.48550/arxiv.2406.06460","title":"Towards Real-World Efficiency: Domain Randomization in Reinforcement Learning for Pre-Capture of Free-Floating Moving Targets by Autonomous Robots","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Space Agency","keywords":"Reinforcement learning; Robot; Computer science; Domain (mathematical analysis); Artificial intelligence; Randomization; Human–computer interaction; Mathematics; Randomized controlled trial","score_opus":0.02910153536264999,"score_gpt":0.21804519692698826,"score_spread":0.18894366156433828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399554409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010628376,0.0001294319,0.98150444,0.00016457679,0.00031073976,0.0012195244,0.0000095875075,0.0002136426,0.005819699],"genre_scores_gemma":[0.97415835,0.00016115021,0.020926058,0.00003253697,0.000029072417,0.000008638553,0.00008180546,0.000028234654,0.004574146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772394,0.00022983238,0.00050574186,0.00092929247,0.00018438183,0.00042684237],"domain_scores_gemma":[0.9984431,0.00018156378,0.00042163866,0.0006316684,0.00020600247,0.0001159916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010456364,0.00029934276,0.00046810223,0.00064530293,0.00014720907,0.00015681487,0.0012701871,0.00022244065,0.000022962826],"category_scores_gemma":[0.00015841055,0.00033569048,0.00017188107,0.0010391354,0.000065275206,0.00026655986,0.0020118745,0.00067159627,0.0000035902326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000758118,0.000041154428,0.0001428453,0.00030984837,0.00003727804,0.000012748228,0.0019301351,0.9362617,0.00016330292,0.060386173,0.00021039738,0.00042861607],"study_design_scores_gemma":[0.002223442,0.00007189217,0.000038959817,0.0003090929,0.000024862407,3.7719892e-7,0.00008469871,0.97831875,0.0003689121,0.018073825,0.00017513608,0.00031004954],"about_ca_topic_score_codex":0.000852587,"about_ca_topic_score_gemma":0.00017307726,"teacher_disagreement_score":0.96353,"about_ca_system_score_codex":0.00042835504,"about_ca_system_score_gemma":0.00043617914,"threshold_uncertainty_score":0.9999095},"labels":[],"label_agreement":null},{"id":"W4399718769","doi":"10.1109/cdc56724.2024.10886085","title":"A Parallel in Time Algorithm Based on ParaExp for Optimal Control Problems","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Mitacs; Institut national de recherche en informatique et en automatique (INRIA); Agence Nationale de la Recherche; City University of Hong Kong","keywords":"Computer science; Control (management); Algorithm design; Algorithm; Parallel computing; Artificial intelligence","score_opus":0.021526549232450946,"score_gpt":0.27568797591531463,"score_spread":0.2541614266828637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399718769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013469809,0.00008637049,0.98543805,0.0062644216,0.00033710353,0.002905783,0.00006408186,0.00045808815,0.0044326345],"genre_scores_gemma":[0.0054212622,0.000017269556,0.9824182,0.0020165213,0.00010434882,0.0023232135,0.000098314165,0.000049744565,0.007551146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972019,0.00013530157,0.00051176606,0.0010775104,0.0005295643,0.00054395717],"domain_scores_gemma":[0.9985077,0.00027694236,0.00010115651,0.0008053569,0.00014146481,0.00016737946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010137765,0.00036156276,0.00046361936,0.00045862424,0.00005444294,0.0007646621,0.0014555634,0.0003055759,0.00011733336],"category_scores_gemma":[0.00004506976,0.0003077063,0.00022849842,0.00030566187,0.000038744533,0.00010091998,0.0007866205,0.0007166546,0.00035889295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022631699,0.00020234252,0.000006670786,0.00017115603,0.00002833928,0.000014786442,0.0001437384,0.9745884,0.000005557117,0.008034838,0.005338521,0.011443038],"study_design_scores_gemma":[0.0016718288,0.00023553024,0.000009248167,0.000248102,0.000007445624,0.0000012883094,0.000002021687,0.9820821,0.000016139491,0.012411209,0.0029525512,0.00036252485],"about_ca_topic_score_codex":0.000036663278,"about_ca_topic_score_gemma":0.0000058041715,"teacher_disagreement_score":0.011080513,"about_ca_system_score_codex":0.00012487493,"about_ca_system_score_gemma":0.00048052377,"threshold_uncertainty_score":0.9999375},"labels":[],"label_agreement":null},{"id":"W4399888593","doi":"10.1007/978-3-031-63021-7_30","title":"Linear Search for an Escaping Target with Unknown Speed","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.03745006556088688,"score_gpt":0.29406948813272427,"score_spread":0.2566194225718374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399888593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015481912,0.00024642443,0.9916228,0.0011145204,0.00082417764,0.0008463677,0.000010054941,0.00028810464,0.0050320616],"genre_scores_gemma":[0.008508913,0.000032201326,0.9873739,0.0009943376,0.0006196073,0.000013236237,0.0000250092,0.00006791039,0.002364898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960353,0.000032302087,0.0003887563,0.001702933,0.0010480625,0.00079265004],"domain_scores_gemma":[0.9977893,0.00030951775,0.000099088,0.0011221165,0.00039433403,0.00028564603],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012820367,0.0004545072,0.00042354895,0.0009349552,0.00029617664,0.0011172501,0.002839431,0.00023572068,0.000022450004],"category_scores_gemma":[0.000027073704,0.0003611845,0.000100580444,0.0008243317,0.000533255,0.00084242225,0.0008920136,0.00081851275,0.00004446736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143847,0.00003939538,0.000008806662,0.00016195248,0.000021359618,0.000055329678,0.0016649686,0.6964542,0.0001047655,0.13414529,0.000038548387,0.16728924],"study_design_scores_gemma":[0.0002522812,0.0005597998,0.000002355477,0.00034996032,0.00000465327,0.00003443867,2.783489e-7,0.92708457,0.0009324914,0.06545642,0.0048480006,0.00047476578],"about_ca_topic_score_codex":0.000013333458,"about_ca_topic_score_gemma":0.000042112068,"teacher_disagreement_score":0.23063035,"about_ca_system_score_codex":0.00019536518,"about_ca_system_score_gemma":0.0007923504,"threshold_uncertainty_score":0.9999197},"labels":[],"label_agreement":null},{"id":"W4399889184","doi":"10.1007/978-3-031-63021-7_3","title":"Weighted Group Search on the Disk and Improved LP-Based Lower Bounds for Priority Evacuation","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Group (periodic table)","score_opus":0.021702256398009257,"score_gpt":0.27178199063311365,"score_spread":0.2500797342351044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399889184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090449386,0.00018865791,0.9848039,0.011506289,0.001152675,0.0012423954,0.000013259502,0.00014166281,0.0008606795],"genre_scores_gemma":[0.24465965,0.00015761185,0.7346944,0.016663728,0.0008236752,0.00020819245,0.000052791267,0.00013384513,0.002606109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687,0.000052854743,0.00034300855,0.0013256235,0.0008753034,0.00053325685],"domain_scores_gemma":[0.99737513,0.0011241488,0.000103536564,0.00094373676,0.00030573923,0.00014773443],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018704507,0.0003729203,0.00028390496,0.00052164064,0.00046554682,0.0015011281,0.0017002283,0.00020393346,0.000016246808],"category_scores_gemma":[0.000092152906,0.0002528294,0.00010915784,0.00058047357,0.000608806,0.00034722316,0.00064445316,0.00077612465,0.000017204757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058672504,0.00010518594,0.000018827723,0.00020082992,0.000031870022,0.000020568894,0.0010808946,0.025368502,0.00045615307,0.4005695,0.00021045493,0.57187855],"study_design_scores_gemma":[0.00025604968,0.00041750653,0.000021657825,0.00019882742,0.0000051133184,0.0000033514648,1.2272413e-7,0.89228094,0.00029195868,0.10238884,0.0038525753,0.0002830764],"about_ca_topic_score_codex":0.000012742671,"about_ca_topic_score_gemma":0.000042946765,"teacher_disagreement_score":0.8669124,"about_ca_system_score_codex":0.00022399766,"about_ca_system_score_gemma":0.00048473515,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W4399910498","doi":"10.1007/978-3-031-63021-7_36","title":"The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Algorithm; Robot; Artificial intelligence","score_opus":0.012286328378413605,"score_gpt":0.2474559018471405,"score_spread":0.2351695734687269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399910498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037663901,0.0022923376,0.9895913,0.0023508207,0.0020489744,0.00042333713,0.000009256614,0.00013662213,0.0031435646],"genre_scores_gemma":[0.013374907,0.0011873005,0.97491544,0.0017160543,0.0004599829,0.000029200659,0.000007688373,0.00008243832,0.0082270065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961817,0.000044165143,0.00063348445,0.0011936546,0.001278083,0.00066886784],"domain_scores_gemma":[0.99675524,0.0013258131,0.00024702676,0.0012112987,0.0002923833,0.00016824174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012296333,0.0004167998,0.0004159416,0.00035033977,0.00032806213,0.00093065493,0.0037406462,0.00022890912,0.000015413008],"category_scores_gemma":[0.00012064001,0.00030148024,0.00015427491,0.000811173,0.0008500829,0.00036846226,0.001767345,0.00080054416,0.000040603838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021636308,0.000029297695,0.0000026654777,0.00005963841,0.00002303595,0.000035749308,0.00097445765,0.037137866,0.00021749848,0.02151435,0.0003628994,0.9396404],"study_design_scores_gemma":[0.00013462882,0.00014636085,0.0000041285875,0.00036976265,0.0000055285996,0.00002539504,3.825729e-7,0.9060676,0.0006568844,0.087969445,0.0042667193,0.00035316736],"about_ca_topic_score_codex":0.0000216615,"about_ca_topic_score_gemma":0.000024351866,"teacher_disagreement_score":0.9392872,"about_ca_system_score_codex":0.00020242043,"about_ca_system_score_gemma":0.0004380066,"threshold_uncertainty_score":0.99994373},"labels":[],"label_agreement":null},{"id":"W4399999583","doi":"10.1016/j.comgeo.2024.102120","title":"Online class cover problem","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Human Resource Development Group; Council of Scientific and Industrial Research, India","keywords":"Cover (algebra); Class (philosophy); Computer science; Artificial intelligence; Engineering","score_opus":0.02232847278315972,"score_gpt":0.29096735695886516,"score_spread":0.2686388841757055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399999583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008681122,0.00034697875,0.98513407,0.003974225,0.0003866063,0.0001292512,0.000018328547,0.00044376552,0.008698683],"genre_scores_gemma":[0.40367234,0.000034768003,0.5828684,0.0022707614,0.0002282798,0.000018041588,0.00021979911,0.000024926021,0.010662673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987786,0.000041715157,0.00020208376,0.00035448343,0.00042150303,0.00020161773],"domain_scores_gemma":[0.9993096,0.00024188093,0.000024350033,0.00017767954,0.00014557019,0.00010094103],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002336659,0.000100522055,0.00009312931,0.0003486518,0.00008370186,0.0004327637,0.00043260044,0.0000465153,0.00035591354],"category_scores_gemma":[0.000030321213,0.00009284722,0.00005980198,0.0013532615,0.0000369057,0.00050867954,0.00018994253,0.00016985377,0.0017286263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012962327,0.00011324491,0.000080131234,0.00006253151,0.00003241809,0.000026613421,0.00015571494,0.5298159,0.0000146901975,0.40150198,0.033181306,0.035014156],"study_design_scores_gemma":[0.000116124094,0.000024174034,0.0006745383,0.000029337862,0.0000018806202,0.000021397986,0.0000043155974,0.8800277,0.0000068105987,0.035992913,0.08299014,0.00011064773],"about_ca_topic_score_codex":0.0000022480324,"about_ca_topic_score_gemma":3.7502062e-7,"teacher_disagreement_score":0.40280423,"about_ca_system_score_codex":0.000051797597,"about_ca_system_score_gemma":0.0001983316,"threshold_uncertainty_score":0.99904865},"labels":[],"label_agreement":null},{"id":"W4400084250","doi":"10.1007/978-3-031-57603-4_7","title":"Models for Network Flow and Network Design Problems with Piecewise Linear Costs","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Piecewise linear function; Flow network; Flow (mathematics); Computer science; Network planning and design; Mathematical optimization; Mathematics; Computer network; Mathematical analysis; Geometry","score_opus":0.08004079593170674,"score_gpt":0.3732164675606285,"score_spread":0.2931756716289218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400084250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004552493,0.00045088507,0.49734277,0.024317993,0.0022577608,0.00991301,0.0001192287,0.00026578736,0.46528703],"genre_scores_gemma":[0.01008158,0.011545678,0.5336388,0.0003011079,0.0005683036,0.0047272616,0.00028731054,0.00012983674,0.43872017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9839788,0.0003119192,0.0014594769,0.0033496858,0.008499801,0.0024002802],"domain_scores_gemma":[0.9932435,0.00037251797,0.00010118673,0.0016360856,0.0041392255,0.0005074817],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.02167344,0.0007254666,0.0005485566,0.0073517496,0.0037179103,0.009142621,0.008809415,0.00021476686,0.0003115772],"category_scores_gemma":[0.00042450198,0.0006794919,0.000113162096,0.0061254892,0.0065309913,0.011165143,0.0074414024,0.0016626373,0.00014807061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008953891,0.000080697086,0.000009739429,0.000065488835,0.00007639756,0.00007861132,0.00035562314,0.49559897,0.000011459609,0.49977145,0.0015533273,0.0023086963],"study_design_scores_gemma":[0.00074216013,0.00033779108,0.000053749085,0.001007277,0.000010832933,0.000029979014,0.00043719343,0.80552554,0.000017710816,0.11811681,0.073122196,0.0005987611],"about_ca_topic_score_codex":0.00021908725,"about_ca_topic_score_gemma":0.0033764048,"teacher_disagreement_score":0.38165465,"about_ca_system_score_codex":0.0034919567,"about_ca_system_score_gemma":0.0011402416,"threshold_uncertainty_score":0.9995656},"labels":[],"label_agreement":null},{"id":"W4400102744","doi":"10.1007/978-3-031-57603-4_2","title":"Variable Neighborhood Search with Dynamic Exploration for the Set Union Knapsack Problem","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Knapsack problem; Set (abstract data type); Variable (mathematics); Mathematical optimization; Variable neighborhood search; Computer science; Mathematics; Metaheuristic","score_opus":0.06572608255923652,"score_gpt":0.39040621065674097,"score_spread":0.32468012809750446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400102744","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054624074,0.00020544388,0.2956712,0.068518795,0.0024583547,0.009840022,0.00022146471,0.00025872322,0.6227714],"genre_scores_gemma":[0.05010992,0.0085773235,0.15050158,0.00028396968,0.00031858217,0.0064908783,0.0006371928,0.00015377002,0.7829268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.981513,0.00037596215,0.0015233811,0.0032519854,0.011185456,0.0021501915],"domain_scores_gemma":[0.9913306,0.00045088513,0.00010078907,0.0021847868,0.0055533326,0.00037956118],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts","scholarly_communication"],"category_scores_codex":[0.024778994,0.000718707,0.0004601841,0.010813223,0.004605773,0.0128093185,0.013180936,0.0002134942,0.0007365133],"category_scores_gemma":[0.0005002444,0.0005910134,0.00013697625,0.008561664,0.0066712317,0.014471822,0.0074643786,0.0021209226,0.000390557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008940423,0.00014515816,0.000011300234,0.00010300923,0.000116251686,0.00006780808,0.000964496,0.3179335,0.00009783898,0.67627496,0.00083182816,0.0033644657],"study_design_scores_gemma":[0.0009652756,0.00039650127,0.000135024,0.0008879046,0.00001718887,0.00003501874,0.0034436933,0.7366066,0.00008915941,0.11288649,0.14382386,0.00071328576],"about_ca_topic_score_codex":0.00045946048,"about_ca_topic_score_gemma":0.004855275,"teacher_disagreement_score":0.56338847,"about_ca_system_score_codex":0.0048695044,"about_ca_system_score_gemma":0.001773879,"threshold_uncertainty_score":0.9996541},"labels":[],"label_agreement":null},{"id":"W4400909999","doi":"10.1109/icde60146.2024.00156","title":"PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reputation; Algorithm; Political science","score_opus":0.026729554656408628,"score_gpt":0.2711238063916415,"score_spread":0.24439425173523288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001254907,0.0005803881,0.98683757,0.0076486054,0.00017418053,0.0002976172,8.9934105e-7,0.00042464762,0.0039105853],"genre_scores_gemma":[0.11454995,0.00025873096,0.8811387,0.00058606785,0.000039319602,0.000079379446,0.00000782578,0.000018733259,0.0033212956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893695,0.00007906191,0.00015361034,0.00036378924,0.00024925088,0.00021736087],"domain_scores_gemma":[0.9995338,0.000082248705,0.000024673232,0.0002160159,0.00007739265,0.000065906424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043584604,0.000094908544,0.00009949907,0.00020071316,0.00006633871,0.0002826199,0.0001994946,0.000040410247,0.000049692906],"category_scores_gemma":[0.000029634897,0.00007363641,0.000015483965,0.0008153923,0.000028139482,0.00025956353,0.00007676898,0.00011589699,0.000051573494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000501666,0.000045960925,0.000049481903,0.00017526699,0.000021454456,0.00017575118,0.0017963243,0.012498898,0.00071514794,0.8713026,0.0015679416,0.111646146],"study_design_scores_gemma":[0.00016060696,0.0001032857,0.00014859597,0.00018647332,0.0000025875322,0.00005122222,0.000055378314,0.9834977,0.00059982395,0.011489634,0.0035678775,0.00013682687],"about_ca_topic_score_codex":0.00006958619,"about_ca_topic_score_gemma":0.00018931783,"teacher_disagreement_score":0.97099876,"about_ca_system_score_codex":0.00004404152,"about_ca_system_score_gemma":0.000115652525,"threshold_uncertainty_score":0.30028054},"labels":[],"label_agreement":null},{"id":"W4401024529","doi":"10.24963/ijcai.2024/781","title":"LEKA: LLM-Enhanced Knowledge Augmentation","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Submodular set function; Computer science; Maximization; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.022152509384422876,"score_gpt":0.3182585027294919,"score_spread":0.29610599334506904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401024529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019094664,0.00016380237,0.8506712,0.0011151616,0.0004161598,0.00007896395,2.2836961e-7,0.00044804587,0.14691554],"genre_scores_gemma":[0.8426868,0.00007425616,0.095235825,0.00037468347,0.00007680461,0.000029676676,0.0000054714924,0.00000894095,0.061507594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994631,0.00002687398,0.00009188804,0.00019530025,0.00010413165,0.00011871174],"domain_scores_gemma":[0.9997167,0.000037789367,0.0000064740943,0.0001458603,0.000044212225,0.000048973765],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013803266,0.00004895663,0.00004051178,0.00008515888,0.000049327075,0.00031854576,0.00022200952,0.000020141264,0.00030335106],"category_scores_gemma":[0.00000755825,0.0000398596,0.0000245777,0.00040909278,0.000011624668,0.0005340641,0.000080186976,0.00005374502,0.001408639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.452594e-7,0.000059053607,0.000003928596,0.000039599872,0.000011890014,0.0000035944142,0.0023285947,0.0007617088,0.0039402624,0.7370158,0.02214738,0.23368739],"study_design_scores_gemma":[0.00014485176,0.00005740897,0.00004871983,0.000024313775,0.0000014085141,0.0000022812058,0.00003371116,0.94363344,0.01212024,0.005056308,0.038769454,0.00010787363],"about_ca_topic_score_codex":0.000004316848,"about_ca_topic_score_gemma":0.0000069310313,"teacher_disagreement_score":0.9428717,"about_ca_system_score_codex":0.00002800159,"about_ca_system_score_gemma":0.00006380313,"threshold_uncertainty_score":0.9993689},"labels":[],"label_agreement":null},{"id":"W4401074641","doi":"10.1016/j.jcss.2024.103574","title":"Minimum separator reconfiguration","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Control reconfiguration; Separator (oil production); Computer science; Mathematical optimization; Mathematics; Embedded system; Physics","score_opus":0.024473958951421855,"score_gpt":0.2856749715242304,"score_spread":0.26120101257280853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401074641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007836621,0.0012725795,0.98385185,0.0013224914,0.0019502023,0.000059212784,3.5303117e-7,0.000048573947,0.0036580886],"genre_scores_gemma":[0.9410422,0.00004786858,0.05840824,0.000096930045,0.0002950623,7.2235173e-7,7.426781e-8,0.0000021113308,0.00010680182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.00009287173,0.00032622408,0.00014896427,0.0003355229,0.00011538063],"domain_scores_gemma":[0.999515,0.00010297025,0.000095688745,0.00007249889,0.00012242625,0.00009144702],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001305048,0.00006164053,0.00012958291,0.0002334492,0.00012627123,0.0011451453,0.00039751525,0.000023882814,0.000003358061],"category_scores_gemma":[0.000005070954,0.000040096173,0.000047347574,0.00040339405,0.00005466744,0.0011133038,0.000047631398,0.00007551829,0.000011239966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009776324,0.000056448418,0.0005405587,0.000519039,0.000090310765,0.00025944904,0.006316246,0.010430472,0.0010171284,0.69313294,0.03657694,0.2510507],"study_design_scores_gemma":[0.000095982236,0.0002961019,0.0001600386,0.00023151281,0.0000028828515,0.0006918699,0.00009323334,0.99105746,0.00009497294,0.00050594844,0.0067024245,0.00006758339],"about_ca_topic_score_codex":0.0000010861089,"about_ca_topic_score_gemma":3.6529315e-7,"teacher_disagreement_score":0.980627,"about_ca_system_score_codex":0.000018536528,"about_ca_system_score_gemma":0.00016183138,"threshold_uncertainty_score":0.99989176},"labels":[],"label_agreement":null},{"id":"W4401269927","doi":"10.1016/j.tcs.2024.114761","title":"Overcoming probabilistic faults in disoriented linear search","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","keywords":"Probabilistic logic; Competitive analysis; Randomized algorithm; Deterministic algorithm; Mathematics; Algorithm; Path (computing); Constant (computer programming); Computer science; Leverage (statistics); Mathematical optimization; Upper and lower bounds; Artificial intelligence","score_opus":0.01692713087326652,"score_gpt":0.29772330390821694,"score_spread":0.2807961730349504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401269927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019661695,0.000041807685,0.9749825,0.0017322939,0.00054942904,0.00027972867,0.0000014535841,0.00034408254,0.0024070216],"genre_scores_gemma":[0.8819534,0.000007208362,0.11774094,0.00018890208,0.00006263518,0.000009573164,0.0000011479912,0.000008005253,0.000028148726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723595,0.00014986265,0.0002913121,0.00083660136,0.0008221494,0.00066410116],"domain_scores_gemma":[0.9987045,0.00035437505,0.000013811509,0.0005658792,0.00010702402,0.00025440103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158753,0.00014903497,0.00015486602,0.0004302864,0.00020080029,0.00060366787,0.0017918543,0.00004606251,0.000044081586],"category_scores_gemma":[0.00013144276,0.000119043354,0.000047405214,0.0031668402,0.0014345003,0.00095251994,0.0010956131,0.0003640131,0.00013609427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003367362,0.00005025227,0.000046801495,0.000027353884,0.0000014134232,0.000031093692,0.0010443103,0.008593124,0.00012784397,0.96794796,0.000013997586,0.022112487],"study_design_scores_gemma":[0.00013758779,0.000102899256,0.0003262543,0.00010393497,8.2535314e-7,0.00001681145,0.000005367832,0.9362243,0.0002799421,0.06243779,0.0002149293,0.00014937612],"about_ca_topic_score_codex":0.000007748317,"about_ca_topic_score_gemma":0.0000015836342,"teacher_disagreement_score":0.92763114,"about_ca_system_score_codex":0.000121651305,"about_ca_system_score_gemma":0.00025094853,"threshold_uncertainty_score":0.58211833},"labels":[],"label_agreement":null},{"id":"W4401974097","doi":"10.37256/cm.5320243304","title":"An Efficient Algorithm for Solving the 2-MAXSAT Problem","year":2024,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Maximum satisfiability problem; Mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Computer science; Boolean function","score_opus":0.04618635100849945,"score_gpt":0.3021554689343263,"score_spread":0.2559691179258269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401974097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006517976,0.0007448964,0.99042875,0.001789116,0.00029501275,0.00091824005,0.000008576321,0.0004664188,0.005283791],"genre_scores_gemma":[0.06544633,0.000013591712,0.9318701,0.00030526245,0.000113275746,0.0001907824,0.000012134443,0.00003358075,0.0020149532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988531,0.000040416795,0.00030938914,0.00029941156,0.00026445824,0.00023323791],"domain_scores_gemma":[0.9988258,0.00034804197,0.00005718059,0.0005687528,0.00010862229,0.00009161096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010431387,0.00013524831,0.0001428612,0.00008257231,0.0002141163,0.00080502295,0.00084802066,0.000046196194,0.000009601581],"category_scores_gemma":[0.00003069418,0.00008608173,0.00008286103,0.00030883824,0.000051602186,0.0004123716,0.0001300952,0.0001237193,0.000042728585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016710044,0.00034408687,0.0000029965975,0.0006196916,0.000069426766,0.000024247945,0.017026924,0.005982606,0.00037367348,0.8478639,0.024278328,0.10341242],"study_design_scores_gemma":[0.000121780555,0.00007908977,5.9179524e-7,0.00010513207,0.0000037122338,0.000010959782,0.00018658223,0.9642617,0.00020568998,0.020693496,0.014211264,0.00011998706],"about_ca_topic_score_codex":0.0000021121089,"about_ca_topic_score_gemma":4.0794504e-7,"teacher_disagreement_score":0.95827913,"about_ca_system_score_codex":0.00002518493,"about_ca_system_score_gemma":0.00019413434,"threshold_uncertainty_score":0.77628547},"labels":[],"label_agreement":null},{"id":"W4402290566","doi":"10.1145/3695411.3695415","title":"Risk-Sensitive Online Algorithms","year":2024,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","score_opus":0.08780638005564445,"score_gpt":0.37878093031266896,"score_spread":0.2909745502570245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402290566","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002497048,0.29834053,0.6825898,0.008209732,0.0018029363,0.0024193213,0.0000339224,0.00076667836,0.0033399868],"genre_scores_gemma":[0.040945526,0.7713379,0.18331933,0.003142941,0.0002278725,0.00015922391,0.0001742484,0.000031371812,0.00066153746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706864,0.0003638938,0.00049249746,0.0005113592,0.0012774492,0.0002861583],"domain_scores_gemma":[0.9974882,0.0004613214,0.00014351303,0.00093993114,0.00084787555,0.00011913385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0053191315,0.0001789049,0.00025243772,0.00054148474,0.00017028773,0.000255868,0.0008950149,0.000059445014,0.00022572739],"category_scores_gemma":[0.0032714847,0.00014735645,0.00011007557,0.0054384437,0.000031515778,0.0011513347,0.00031506337,0.0003427172,0.0007822952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.498265e-7,0.000032798143,0.00011440329,0.0004907795,0.0000214677,0.0000023707505,0.0000842964,0.0013310428,0.0000026238354,0.00079621,0.0051813605,0.9919423],"study_design_scores_gemma":[0.00014596988,0.00008868684,0.0014716096,0.0011952425,0.00006231425,0.000013279879,0.0000042093784,0.94133633,0.000052349627,0.00031234667,0.05512624,0.00019144673],"about_ca_topic_score_codex":0.000005273404,"about_ca_topic_score_gemma":0.0000010399758,"teacher_disagreement_score":0.99175084,"about_ca_system_score_codex":0.00015652679,"about_ca_system_score_gemma":0.0003479552,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W4402290638","doi":"10.1145/3695411.3695414","title":"Online Conversion with Group Fairness Constraints","year":2024,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Group (periodic table); Computer science; Chemistry","score_opus":0.07235907221506278,"score_gpt":0.3433352758791231,"score_spread":0.27097620366406033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402290638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007567185,0.14312647,0.8327155,0.007921141,0.0011547786,0.0030066494,0.000014532813,0.0007137768,0.0037799359],"genre_scores_gemma":[0.58800685,0.29082075,0.115532115,0.0044441186,0.00012961778,0.00023188673,0.00032771335,0.00004152731,0.00046544932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751616,0.0001821835,0.00037463036,0.0004509039,0.0012259757,0.00025016905],"domain_scores_gemma":[0.9982109,0.00025151856,0.00010067267,0.0007409132,0.0005835309,0.00011246407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030346203,0.00016728407,0.00022969539,0.00043099356,0.00012734895,0.00022208266,0.0008663591,0.00005098352,0.00059111096],"category_scores_gemma":[0.00062581437,0.00012333831,0.000058615227,0.0042285114,0.00007872619,0.0012475926,0.00020964067,0.00022332757,0.00033546353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018538751,0.000071493385,0.00049920625,0.0021942563,0.000024446283,0.0000048422735,0.00007093048,0.000695109,0.000007191749,0.0041856887,0.0031535337,0.98909146],"study_design_scores_gemma":[0.00047881083,0.00025943213,0.0016911726,0.0039151213,0.00007088392,0.00004050876,0.000011199395,0.9471736,0.000048063564,0.00015812962,0.04586472,0.00028835353],"about_ca_topic_score_codex":0.0000017446745,"about_ca_topic_score_gemma":7.7709564e-7,"teacher_disagreement_score":0.9888031,"about_ca_system_score_codex":0.00012786515,"about_ca_system_score_gemma":0.00034092073,"threshold_uncertainty_score":0.6472251},"labels":[],"label_agreement":null},{"id":"W4402329836","doi":"10.2139/ssrn.4949863","title":"The Power of Knowledge in Linear Search for an Escaping Target","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Power (physics); Computer science; Political science; Physics","score_opus":0.026935230575928393,"score_gpt":0.32747909175312845,"score_spread":0.30054386117720006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402329836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007271321,0.018876107,0.96775615,0.0023321747,0.001410725,0.0007327854,0.000007152016,0.00006514717,0.001548421],"genre_scores_gemma":[0.96625954,0.0088210665,0.021718206,0.00004799871,0.0004136219,0.00006182094,0.000011330346,0.00006118563,0.0026052208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967956,0.00029986497,0.00047941596,0.00036527062,0.0003229621,0.0017369012],"domain_scores_gemma":[0.9988798,0.00016949963,0.00013030559,0.00045899698,0.000269923,0.00009146233],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0072718454,0.00017313873,0.00023643026,0.00031343193,0.00019114632,0.00030544863,0.0017708301,0.00014778855,0.0000043682167],"category_scores_gemma":[0.000053887867,0.0001250363,0.00017450513,0.00035008873,0.000057204925,0.00015293453,0.00095756,0.0042288075,0.000009804309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038164693,0.0001605616,0.00005257778,0.00013305394,0.00016175043,0.0000022094835,0.0044696606,0.03415492,0.000090684916,0.9202935,0.00027466548,0.040168233],"study_design_scores_gemma":[0.00028194967,0.00034549707,0.000013893217,0.00012794496,0.000004772859,0.000029358665,0.0005721728,0.48092592,0.00013941765,0.51573884,0.001669115,0.00015114622],"about_ca_topic_score_codex":0.000024707693,"about_ca_topic_score_gemma":0.00035185294,"teacher_disagreement_score":0.95898825,"about_ca_system_score_codex":0.00058045064,"about_ca_system_score_gemma":0.006929811,"threshold_uncertainty_score":0.99869996},"labels":[],"label_agreement":null},{"id":"W4402426965","doi":"10.48550/arxiv.2408.06553","title":"Centralization vs. decentralization in multi-robot sweep coverage with ground robots and UAVs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research Global; Office of Naval Research; China Scholarship Council; European Commission; Government of Ontario; University of Ottawa","keywords":"Decentralization; Robot; Business; Computer science; Artificial intelligence; Economics; Market economy","score_opus":0.07412246750598184,"score_gpt":0.2076468936296617,"score_spread":0.13352442612367987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402426965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058583863,0.000109888184,0.9397372,0.00022067426,0.00023921797,0.0005394429,0.0000075160046,0.00021428487,0.0003479011],"genre_scores_gemma":[0.9904396,0.0014138505,0.0071853455,0.000115983436,0.00001629836,0.0000019651343,0.00006817891,0.000025519043,0.0007332386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980683,0.00017102329,0.0002176278,0.0010308898,0.00013215843,0.000380028],"domain_scores_gemma":[0.9990024,0.00004193968,0.00013297306,0.0005045281,0.00013917226,0.00017900151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001976902,0.00028751043,0.00026155985,0.00040715805,0.00010202349,0.0004398933,0.0005859909,0.00022639483,0.000026629914],"category_scores_gemma":[0.000019232615,0.00030369178,0.000052429237,0.0010240668,0.00008332827,0.00053803955,0.0010353249,0.00044437635,0.00002242022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022761933,0.00008266095,0.0068311626,0.00015712647,0.000029976021,0.00017003225,0.0005650822,0.85117763,0.000010089468,0.14054386,0.000037116064,0.00037247635],"study_design_scores_gemma":[0.00091831194,0.000050810628,0.009483078,0.00025611202,0.000027318087,0.0000050369454,0.000028491548,0.97702384,0.000029377312,0.01173962,0.00007517913,0.00036280137],"about_ca_topic_score_codex":0.00035415802,"about_ca_topic_score_gemma":0.00044660698,"teacher_disagreement_score":0.93255186,"about_ca_system_score_codex":0.00026791534,"about_ca_system_score_gemma":0.00020027293,"threshold_uncertainty_score":0.9999415},"labels":[],"label_agreement":null},{"id":"W4402625841","doi":"10.1007/978-981-97-7798-3_11","title":"A Distributed Approximation Algorithm for the Total Dominating Set Problem","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Approximation algorithm; Dominating set; Set (abstract data type); Algorithm; Distributed algorithm; Theoretical computer science; Distributed computing; Programming language","score_opus":0.01999182747992082,"score_gpt":0.2666103806226894,"score_spread":0.24661855314276857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402625841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.743861e-7,0.00034124844,0.9932156,0.0028191735,0.0010809746,0.0013793827,0.000058582496,0.00021272815,0.0008916301],"genre_scores_gemma":[0.0019311216,0.000025883242,0.9958134,0.00036399253,0.0003761787,0.00011910014,0.000053519816,0.000034604218,0.0012821798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698997,0.000024463701,0.00047287054,0.001129304,0.000814736,0.00056865456],"domain_scores_gemma":[0.99768907,0.0008564672,0.00019859028,0.000788763,0.000359461,0.00010764409],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014386819,0.00037448565,0.00031096122,0.00040337717,0.00044132874,0.0014472476,0.0021156317,0.00020346609,0.000010120851],"category_scores_gemma":[0.000079355144,0.0002642169,0.00014440306,0.0007574567,0.00039042826,0.0005374469,0.0010879799,0.00064914563,0.000025234376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013455337,0.0000102565145,3.1276227e-7,0.00006455605,0.000013552738,0.0000074811537,0.00077756145,0.14274397,0.00001429129,0.04971327,0.00007001522,0.8065834],"study_design_scores_gemma":[0.00017794553,0.00008580891,0.0000022411336,0.0002132545,0.000007957111,0.00003874676,4.4181968e-7,0.8390442,0.00012193994,0.15869562,0.0013343961,0.00027741003],"about_ca_topic_score_codex":0.000008240728,"about_ca_topic_score_gemma":0.000007682714,"teacher_disagreement_score":0.806306,"about_ca_system_score_codex":0.00024867768,"about_ca_system_score_gemma":0.0003820403,"threshold_uncertainty_score":0.999981},"labels":[],"label_agreement":null},{"id":"W4403420399","doi":"10.1109/ojcoms.2024.3480987","title":"Dynamic Pricing in Multi-Tenant MANO With Resource Sharing: A Stackelberg Game Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stackelberg competition; Computer science; Sequential game; Microeconomics; Resource (disambiguation); Game theory; Economics; Computer network","score_opus":0.08424936554807923,"score_gpt":0.344879353859206,"score_spread":0.26062998831112677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403420399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027194403,0.0011918597,0.97177875,0.02061698,0.00013303568,0.00068432186,0.0000026238645,0.000043073935,0.0028299207],"genre_scores_gemma":[0.46449023,0.00059082505,0.53203994,0.00035211287,0.000007742387,0.000021729038,0.0000015513012,0.000018601542,0.0024772543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986563,0.00026291088,0.0004049237,0.00018508316,0.00028850033,0.00020233009],"domain_scores_gemma":[0.99775743,0.0001473363,0.0002071517,0.0016666454,0.00014995805,0.00007146466],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0018175432,0.00010633706,0.0001757047,0.00007410312,0.00027231706,0.00088350417,0.008246388,0.000045323282,0.0000031962647],"category_scores_gemma":[0.000026440535,0.000057894682,0.00014044132,0.001043307,0.00013456987,0.00083984516,0.002026177,0.00076851645,0.0000038127923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102901,0.0027632313,0.003737779,0.00038578705,0.0009928967,0.000033683667,0.15865463,0.7442829,0.0020002301,0.04402138,0.013410696,0.029635768],"study_design_scores_gemma":[0.00048793448,0.000045134384,0.0004361639,0.00037896246,0.000010968748,0.00009984801,0.0007803332,0.9875067,0.000024604587,0.00039788513,0.009730366,0.000101111014],"about_ca_topic_score_codex":0.000031860633,"about_ca_topic_score_gemma":0.000049924598,"teacher_disagreement_score":0.4617708,"about_ca_system_score_codex":0.00022674103,"about_ca_system_score_gemma":0.00030292914,"threshold_uncertainty_score":0.9971195},"labels":[],"label_agreement":null},{"id":"W4403557064","doi":"10.1007/978-3-031-74498-3_2","title":"Invited Paper: A Survey of the Impact of Knowledge on the Competitive Ratio in Linear Search","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Competitive analysis; Operations research; Information retrieval; Mathematics","score_opus":0.04304661691225021,"score_gpt":0.3129956036367817,"score_spread":0.2699489867245315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403557064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014539986,0.00040987856,0.98643386,0.0036473966,0.00093115,0.0012553142,0.00006422826,0.0000494944,0.00575468],"genre_scores_gemma":[0.9896477,0.00007107665,0.008968835,0.00085261656,0.00007550996,0.00000936613,0.00000809838,0.00002883407,0.00033799463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972558,0.00031305646,0.0005258274,0.0007152649,0.0008109715,0.0003790581],"domain_scores_gemma":[0.99611264,0.0020309456,0.00017517309,0.0011368586,0.00047333908,0.00007102522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026914836,0.00030398183,0.00042112655,0.0006603519,0.00011233923,0.00016245582,0.003156961,0.00016635524,0.000025471823],"category_scores_gemma":[0.00028423764,0.0001637835,0.0001646348,0.0022243687,0.0010279998,0.00019968516,0.0014632669,0.0010581993,0.0000132735095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034894892,0.00022442367,0.0016165721,0.00013144851,0.0000599012,0.000016586137,0.00959362,0.8109746,0.00048162634,0.1244855,0.0001860332,0.052194767],"study_design_scores_gemma":[0.00017609418,0.00027115125,0.007852226,0.00077128026,0.000001950736,0.0000046121363,5.3490976e-7,0.9779721,0.0009005537,0.011769216,0.00007760584,0.00020267381],"about_ca_topic_score_codex":0.00047748623,"about_ca_topic_score_gemma":0.0009440585,"teacher_disagreement_score":0.9881937,"about_ca_system_score_codex":0.0002258445,"about_ca_system_score_gemma":0.00077123067,"threshold_uncertainty_score":0.6678897},"labels":[],"label_agreement":null},{"id":"W4404028777","doi":"10.1016/j.jii.2024.100727","title":"Proximal policy optimization with population-based variable neighborhood search algorithm for coordinating photo-etching and acid-etching processes in sustainable storage chip manufacturing","year":2024,"lang":"en","type":"article","venue":"Journal of Industrial Information Integration","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Etching (microfabrication); Variable (mathematics); Chip; Materials science; Population; Nanotechnology; Computer science; Algorithm; Mathematics; Telecommunications; Layer (electronics); Medicine","score_opus":0.017794392334267727,"score_gpt":0.2688782613785026,"score_spread":0.2510838690442349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404028777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056806044,0.00003289585,0.9920612,0.0009374602,0.00015871998,0.0007891194,0.0000073597835,0.00006305332,0.00026958674],"genre_scores_gemma":[0.7275033,0.000011400774,0.27193975,0.00011801867,0.00026110667,0.000034158973,0.00007753741,0.000014773512,0.00003995028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981381,0.00010952139,0.0008242469,0.00015569114,0.00046960727,0.00030280516],"domain_scores_gemma":[0.99828327,0.00025619837,0.00041733464,0.00010346858,0.0008399248,0.000099824705],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017885533,0.00017539138,0.00022516983,0.0014020615,0.00027090815,0.0018577941,0.00023888923,0.00014421018,0.000009824435],"category_scores_gemma":[0.00077547855,0.0001388937,0.000038303988,0.0012244793,0.00001685719,0.009557865,0.000044078013,0.000539818,4.3917498e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006667743,0.000031157502,0.00015194205,0.00021489564,0.000019693505,0.0000034968791,0.0029476567,0.87681866,0.000025863294,0.010363688,0.00003249706,0.109323755],"study_design_scores_gemma":[0.0014345995,0.00034568546,0.000041501087,0.00061942684,0.000009290121,0.000031092397,0.0013352921,0.9930875,0.0022717263,0.00049238175,0.00017722767,0.00015431874],"about_ca_topic_score_codex":0.0002807514,"about_ca_topic_score_gemma":0.000008203478,"teacher_disagreement_score":0.7218227,"about_ca_system_score_codex":0.00047734403,"about_ca_system_score_gemma":0.0015798217,"threshold_uncertainty_score":0.99917835},"labels":[],"label_agreement":null},{"id":"W4404314575","doi":"10.48550/arxiv.2410.20900","title":"Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Department of Science and Technology, Ministry of Science and Technology, India; York University; New York University Shanghai","keywords":"Parameterized complexity; Set (abstract data type); Mathematical optimization; Mathematics; Computer science; Combinatorics","score_opus":0.13864227380894031,"score_gpt":0.20796505521441244,"score_spread":0.06932278140547213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404314575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09965785,0.000022702925,0.8968593,0.0002604639,0.0003529048,0.00085884565,0.00007149678,0.000535745,0.0013807326],"genre_scores_gemma":[0.9076283,0.000037866623,0.08874946,0.000093945244,0.000043391978,0.000017163044,0.000114717615,0.00003230841,0.0032828704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981888,0.00013526842,0.00021626464,0.00096655206,0.00012095999,0.00037218397],"domain_scores_gemma":[0.99850565,0.0001575494,0.00019396846,0.0006884521,0.00032206514,0.00013230066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040078218,0.00029438292,0.0003149279,0.00034856884,0.00018536639,0.00043715237,0.0008668539,0.00020342594,0.000014078542],"category_scores_gemma":[0.000052681324,0.00028837417,0.00015066945,0.00058557524,0.0001706575,0.00036713624,0.0007168668,0.00048997864,0.000038673712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010200968,0.00005631877,0.00008836984,0.0010291671,0.00029101895,0.00008658456,0.0045289434,0.61135554,0.00017821696,0.3807054,0.00094911625,0.00062931725],"study_design_scores_gemma":[0.0005512817,0.000096172844,0.000010904343,0.00020590008,0.000051441577,0.0000045266397,0.00037267405,0.9228512,0.00023877333,0.07495089,0.0003070626,0.00035917142],"about_ca_topic_score_codex":0.000058754624,"about_ca_topic_score_gemma":0.00001573808,"teacher_disagreement_score":0.8081098,"about_ca_system_score_codex":0.00016429738,"about_ca_system_score_gemma":0.00025142592,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W4404520437","doi":"10.1109/tro.2024.3502497","title":"Multirobot Persistent Monitoring: Minimizing Latency and Number of Robots With Recharging Constraints","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Latency (audio); Mobile robot; Artificial intelligence; Real-time computing; Telecommunications","score_opus":0.036423058351094544,"score_gpt":0.28368479867927987,"score_spread":0.24726174032818532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404520437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016991833,0.00007332219,0.99618083,0.00065891637,0.00052517414,0.0001603117,0.0000038352437,0.00016949319,0.0005289131],"genre_scores_gemma":[0.65836847,0.00014290924,0.3410647,0.000017472808,0.00001267546,0.000007385848,3.483852e-7,0.000013729055,0.00037230313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989418,0.000044258803,0.0002157238,0.00031936646,0.0002551407,0.00022371659],"domain_scores_gemma":[0.999393,0.0001296292,0.00003652484,0.00023077923,0.00009423868,0.000115816365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013984235,0.00014285072,0.0001556152,0.00014770233,0.00013564175,0.000148935,0.00018261666,0.00006395889,0.000025116717],"category_scores_gemma":[0.0000029369721,0.00012433498,0.00007304658,0.00038938897,0.00012308845,0.00030657116,0.000003619835,0.00024663782,0.000017012422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065901568,0.00007981477,0.00010650506,0.00008585542,0.00007356787,0.000017376939,0.0012484306,0.9726072,0.0004581942,0.0016067107,0.0000073492906,0.023702437],"study_design_scores_gemma":[0.00043526673,0.00016737232,0.00006445735,0.0005211206,0.000048516282,0.00012342556,0.0002953124,0.9930254,0.0049713994,0.000089317364,0.000018686416,0.00023971546],"about_ca_topic_score_codex":0.00000890596,"about_ca_topic_score_gemma":0.0000016335174,"teacher_disagreement_score":0.6566693,"about_ca_system_score_codex":0.000041626103,"about_ca_system_score_gemma":0.00007790883,"threshold_uncertainty_score":0.5070234},"labels":[],"label_agreement":null},{"id":"W4405364028","doi":"10.11591/ijape.v14.i1.pp146-154","title":"Multi-objective hunter prey optimizer technique for distributed generation placement","year":2024,"lang":"en","type":"article","venue":"International Journal of Applied Power Engineering (IJAPE)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Predation; Mathematical optimization; Biology; Mathematics; Ecology","score_opus":0.013713111865695016,"score_gpt":0.26961463615411785,"score_spread":0.25590152428842283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405364028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036895348,0.00007693642,0.99645245,0.00062534853,0.0017581513,0.0003686668,0.000030168563,0.000094090006,0.0002252628],"genre_scores_gemma":[0.50326174,0.00002277858,0.49597043,0.00014556115,0.0003405757,0.00010860498,0.000032924334,0.000024744759,0.000092668204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987789,0.000008643284,0.00040881077,0.00020889367,0.00041904644,0.00017571454],"domain_scores_gemma":[0.9991593,0.00008359518,0.0001062788,0.0001247523,0.0004526228,0.000073496325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043350668,0.00014656082,0.0001429159,0.00035703936,0.000031862073,0.00041361258,0.00061504904,0.000067616435,0.000042362364],"category_scores_gemma":[0.000044134402,0.00013057531,0.00011947071,0.00017327137,0.000011828453,0.00047484724,0.00010661691,0.0002250492,0.00000965888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058508464,0.00010650102,0.000003985607,0.000025730804,0.00031290384,0.00002616629,0.00077048625,0.88399625,0.08689249,0.023112668,0.0038415114,0.0008527908],"study_design_scores_gemma":[0.0007649421,0.00008778723,0.000038088816,0.000090030524,0.000009974867,0.000055952285,0.000016966436,0.95155716,0.027960988,0.00018171546,0.019062243,0.00017416164],"about_ca_topic_score_codex":5.36698e-7,"about_ca_topic_score_gemma":4.5055958e-7,"teacher_disagreement_score":0.5028928,"about_ca_system_score_codex":0.00022672115,"about_ca_system_score_gemma":0.00009884311,"threshold_uncertainty_score":0.5324707},"labels":[],"label_agreement":null},{"id":"W4405490714","doi":"10.1109/iccspa61559.2024.10794313","title":"Continuous Action Learning Automata Game Optimizer Applied to Convolutional Neural Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Computer science; Learning automata; Action (physics); Artificial intelligence; Automaton; Convolutional neural network; Cellular automaton; Machine learning","score_opus":0.023425782140693553,"score_gpt":0.27986909336945665,"score_spread":0.25644331122876307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405490714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004481957,0.000044786706,0.98453134,0.0026261893,0.0006072482,0.00023204667,4.7182814e-7,0.0013086417,0.010201098],"genre_scores_gemma":[0.92305106,0.000017578333,0.06761996,0.00095322257,0.00014613735,0.000046007328,0.000014488755,0.00001513122,0.0081364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988182,0.000053130854,0.00017823747,0.00038463183,0.00026046688,0.00030531845],"domain_scores_gemma":[0.99946994,0.000094646864,0.00002069288,0.00020049432,0.00006392832,0.00015031034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023215928,0.00011241236,0.000114736096,0.0001369344,0.000108585984,0.0006185334,0.00034276946,0.000059285358,0.000253749],"category_scores_gemma":[0.000019703337,0.000099612414,0.000045894783,0.00050893286,0.000023894558,0.0003917695,0.00022280472,0.00026168427,0.0003001234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055503087,0.000013220081,0.000013534923,0.0000062785475,0.00001111347,0.0000075854196,0.00016490351,0.8913185,0.00017412473,0.06529021,0.0061328476,0.03686214],"study_design_scores_gemma":[0.00016987872,0.000046523157,0.00012243654,0.000008944832,0.000002138575,0.000018271914,0.000024128223,0.9814409,0.000037558617,0.00015225323,0.017846454,0.00013051226],"about_ca_topic_score_codex":0.000009790265,"about_ca_topic_score_gemma":0.0000019575905,"teacher_disagreement_score":0.9226029,"about_ca_system_score_codex":0.00004989314,"about_ca_system_score_gemma":0.00004816099,"threshold_uncertainty_score":0.5964532},"labels":[],"label_agreement":null},{"id":"W4405801658","doi":"10.1007/978-3-031-74580-5_7","title":"Bike Assisted Evacuation on a Line of Robots with S/R Communication Faults","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Robot; Line (geometry); Human–computer interaction; Simulation; Artificial intelligence","score_opus":0.03905140899428842,"score_gpt":0.2925748422041652,"score_spread":0.25352343320987675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029711873,0.00025335263,0.9894015,0.001975507,0.00030539394,0.00044819017,0.000004858375,0.00014108568,0.0074403672],"genre_scores_gemma":[0.2605633,0.0001391383,0.7366167,0.00085036893,0.00010556192,0.000019425584,0.000034431876,0.00004396914,0.0016271129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723417,0.00004862734,0.00046050476,0.00088757224,0.0010616499,0.00030747527],"domain_scores_gemma":[0.9973302,0.0003732501,0.00027769938,0.0014380171,0.00047738457,0.000103461825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079990446,0.00032274282,0.0003565905,0.0009530608,0.00013951147,0.00027907875,0.0021447483,0.00019851168,0.000014448855],"category_scores_gemma":[0.00005722993,0.00025114598,0.00006998005,0.0009988059,0.00044200255,0.00040368602,0.0006772172,0.0006634192,0.000039716007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016138256,0.000058801874,0.000009565149,0.00007636285,0.000017598475,0.000016007438,0.00078746193,0.5988152,0.00009497247,0.0716858,0.000017360071,0.32840475],"study_design_scores_gemma":[0.0002744725,0.00052601204,0.00007731663,0.0012173726,0.000007800471,0.000020634356,1.6250192e-7,0.9462712,0.000799842,0.050161462,0.00034044907,0.0003032772],"about_ca_topic_score_codex":0.000014801598,"about_ca_topic_score_gemma":0.00007186799,"teacher_disagreement_score":0.347456,"about_ca_system_score_codex":0.00018882642,"about_ca_system_score_gemma":0.00042387628,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W4405993490","doi":"10.1145/3700838.3700858","title":"Deterministic Collision-Free Exploration of Unknown Anonymous Graphs","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Computer science; Collision; Theoretical computer science; Computer security","score_opus":0.02466638784754523,"score_gpt":0.2855213981294213,"score_spread":0.2608550102818761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405993490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066724507,0.000020938664,0.9512296,0.0012426428,0.0001787371,0.00017509975,0.0000010693526,0.000093223614,0.046391457],"genre_scores_gemma":[0.7668846,0.00007074053,0.21904437,0.00073567603,0.000008627243,0.000040230974,0.0000050848657,0.000005546838,0.013205107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992904,0.00004811655,0.00020497454,0.00017194655,0.0001725282,0.00011202781],"domain_scores_gemma":[0.99915075,0.000098325036,0.000042580807,0.0005042749,0.00016587075,0.000038222555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017432644,0.00005918317,0.00009421959,0.0001916918,0.00006792892,0.00007401987,0.000634568,0.00003284376,0.00002673957],"category_scores_gemma":[0.000124625,0.00005045544,0.00003310595,0.00075346767,0.00003674083,0.00047682438,0.00023021441,0.000040718383,0.000011365788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003594198,0.00006265482,0.00008596435,0.000021669748,0.000006251069,0.0000018407563,0.00020935638,0.002917717,0.00026938357,0.9800191,0.004603131,0.0117993215],"study_design_scores_gemma":[0.0008996494,0.0001858155,0.0003985495,0.00005271913,0.000006161477,0.0000015964106,0.0000628524,0.75273854,0.008129496,0.2291828,0.008168575,0.00017325439],"about_ca_topic_score_codex":0.000013228911,"about_ca_topic_score_gemma":0.000024941344,"teacher_disagreement_score":0.76621735,"about_ca_system_score_codex":0.000010825002,"about_ca_system_score_gemma":0.00011677248,"threshold_uncertainty_score":0.20575131},"labels":[],"label_agreement":null},{"id":"W4406023013","doi":"10.1007/s10107-024-02184-y","title":"Online bipartite matching in the probe-commit model","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Patience; Bipartite graph; Matching (statistics); Online algorithm; Vertex (graph theory); Combinatorics; Mathematics; Commit; Graph; Discrete mathematics; Computer science; Mathematical optimization; Upper and lower bounds; Statistics","score_opus":0.03770484380387491,"score_gpt":0.32009627445079264,"score_spread":0.28239143064691774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406023013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015599853,0.00003640173,0.9849664,0.006984193,0.000024060753,0.0005119689,3.7418494e-7,0.00014719869,0.0057694493],"genre_scores_gemma":[0.21953323,0.0000034307654,0.77868176,0.0010261219,0.000011058136,0.00012182281,0.0000024380572,0.0000068599,0.00061329576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.000096104144,0.0003204787,0.00022766461,0.00027317644,0.00032903955],"domain_scores_gemma":[0.9992383,0.00019905345,0.000038366255,0.00044291455,0.00003857077,0.00004279068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009421752,0.000106969055,0.00014820069,0.00012147898,0.0001235887,0.00038252148,0.0009171085,0.000045952806,0.0000074656987],"category_scores_gemma":[0.00012615624,0.000070294846,0.000051349463,0.0007247401,0.00004587031,0.00023543296,0.00025100354,0.00026113336,0.000028071443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011588469,0.00046650422,0.00004128507,0.000119083525,0.0000054351253,0.000004837037,0.00280489,0.005321315,0.000021732581,0.94872105,0.00007882323,0.042413868],"study_design_scores_gemma":[0.00011807137,0.000010367019,0.000013486395,0.000079833575,0.0000020653363,0.0000020552623,0.00011847484,0.6653948,0.00001180083,0.3335762,0.00061531406,0.00005757831],"about_ca_topic_score_codex":0.0000050319954,"about_ca_topic_score_gemma":0.000012519662,"teacher_disagreement_score":0.66007346,"about_ca_system_score_codex":0.00002484676,"about_ca_system_score_gemma":0.00004862099,"threshold_uncertainty_score":0.36886632},"labels":[],"label_agreement":null},{"id":"W4406142010","doi":"10.1137/1.9781611978322.48","title":"Parameterized Approximation for Capacitated <i>d</i>-Hitting Set with Hard Capacities","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Department of Science and Technology, Ministry of Science and Technology, India; York University; New York University Shanghai","keywords":"Parameterized complexity; Combinatorics; Set cover problem; Vertex (graph theory); Mathematics; Set (abstract data type); Integer (computer science); Vertex cover; Function (biology); Cover (algebra); Discrete mathematics; Minimum weight; Mathematical optimization; Approximation algorithm; Graph; Computer science","score_opus":0.09124989470558423,"score_gpt":0.251023487810218,"score_spread":0.15977359310463377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406142010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057991365,0.000017203873,0.8648281,0.00022011959,0.00015824157,0.0045917504,0.0003308617,0.00025550075,0.12954022],"genre_scores_gemma":[0.00012334378,0.000015284751,0.81983835,0.0002758473,0.00018910044,0.0010141272,0.00021686859,0.00006424177,0.17826283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982361,0.000006782397,0.00056120293,0.00052394497,0.00030556158,0.0003663639],"domain_scores_gemma":[0.99827236,0.00058271305,0.00046314584,0.0003624888,0.00021542734,0.00010388698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006569151,0.00042188988,0.00064555585,0.00007605119,0.0004351631,0.00036863427,0.00036468776,0.00056795357,0.0000040114037],"category_scores_gemma":[0.000041700467,0.00035369425,0.0003158115,0.000039459894,0.0002695265,0.000081837934,0.0001257148,0.00038277873,0.0000011262355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004211876,0.000013993505,2.7060333e-8,0.0008987974,0.00030760287,1.2764032e-7,0.004550778,0.000039457245,0.00017692386,0.9781339,0.006545586,0.009290672],"study_design_scores_gemma":[0.008247589,0.0004768737,1.6888908e-8,0.0012848913,0.0004632299,0.000008510178,0.0018257865,0.11200118,0.0025167265,0.7858658,0.08588011,0.0014292788],"about_ca_topic_score_codex":0.0000014585148,"about_ca_topic_score_gemma":9.533321e-7,"teacher_disagreement_score":0.1922681,"about_ca_system_score_codex":0.000060298225,"about_ca_system_score_gemma":0.00025209517,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W4407080566","doi":"10.1007/s10107-025-02195-3","title":"Cut-sufficient directed 2-commodity multiflow topologies","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Network topology; Commodity; Numerical analysis; Mathematical optimization; Mathematical economics; Topology (electrical circuits); Combinatorics; Computer science; Economics; Mathematical analysis; Market economy","score_opus":0.026063294850880613,"score_gpt":0.3037517958765076,"score_spread":0.277688501025627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407080566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001807965,0.000046879806,0.98288155,0.0025657506,0.0001601724,0.0004141404,6.1915335e-7,0.0011396254,0.010983295],"genre_scores_gemma":[0.28834933,0.0000046574273,0.7097733,0.00026679935,0.000014541553,0.00010176273,0.00000332143,0.0000072202106,0.0014790801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866235,0.00009099057,0.0002944899,0.0003134276,0.000252386,0.00038634957],"domain_scores_gemma":[0.998982,0.00029125315,0.000045822086,0.00048950966,0.00010492333,0.000086491054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048070442,0.00013028183,0.00020002178,0.00011540458,0.00021074661,0.0003538189,0.0007020609,0.00006976541,0.000047595735],"category_scores_gemma":[0.00055476674,0.00010432504,0.00007508393,0.0006411654,0.00011644063,0.00018336845,0.00045786786,0.0001773862,0.00009599794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034338523,0.0005801955,0.00015052423,0.00017070814,0.000026452304,0.000008604304,0.000937987,0.00038316555,0.000059231617,0.7578192,0.0012330814,0.23862743],"study_design_scores_gemma":[0.00032560434,0.00005455022,0.00012283564,0.0000994678,0.000007685255,0.000003936428,0.00014140923,0.92946726,0.0009516646,0.05310578,0.015516324,0.00020345178],"about_ca_topic_score_codex":0.000005047451,"about_ca_topic_score_gemma":0.0000030954088,"teacher_disagreement_score":0.9290841,"about_ca_system_score_codex":0.000050753588,"about_ca_system_score_gemma":0.00005107519,"threshold_uncertainty_score":0.42542514},"labels":[],"label_agreement":null},{"id":"W4407189119","doi":"10.1007/978-3-031-82670-2_1","title":"Distributed Computing by Mobile Robots: Exploring the Computational Landscape (Extended Abstract)","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile robot; Distributed computing; Robot; Human–computer interaction; Theoretical computer science; Artificial intelligence","score_opus":0.022312432559130575,"score_gpt":0.2629811802111595,"score_spread":0.24066874765202895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000373409,0.00045650953,0.99336785,0.0014402434,0.0012421189,0.00064093276,0.00003800742,0.00026512312,0.0025118815],"genre_scores_gemma":[0.29384908,0.00028423616,0.69844294,0.0046722176,0.0006865184,0.00012521747,0.00040770066,0.00009121377,0.001440855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959089,0.000057939607,0.000697464,0.0013646216,0.0012210815,0.0007499904],"domain_scores_gemma":[0.99678504,0.001250503,0.00030390904,0.0010449761,0.00043646758,0.00017909564],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011017558,0.000516357,0.0004758712,0.0005149574,0.00071427797,0.001174441,0.0036701425,0.00019034049,0.000042568015],"category_scores_gemma":[0.00010063173,0.00040875067,0.00014457783,0.001038632,0.0005297212,0.00072223967,0.0016426711,0.0010946578,0.00003182274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023920754,0.00002904045,0.000013802748,0.000024528317,0.000013083503,0.000015624464,0.0003419798,0.6971488,0.0000067923456,0.006913429,0.00060632505,0.29488423],"study_design_scores_gemma":[0.00030176697,0.00007395613,0.00015497397,0.00029566776,0.000005613213,0.00002109855,9.709137e-7,0.97085404,0.00009752892,0.024855461,0.0028754137,0.0004635176],"about_ca_topic_score_codex":0.00001536639,"about_ca_topic_score_gemma":0.000012494266,"teacher_disagreement_score":0.29492489,"about_ca_system_score_codex":0.00023945692,"about_ca_system_score_gemma":0.00063862966,"threshold_uncertainty_score":0.99986243},"labels":[],"label_agreement":null},{"id":"W4407189250","doi":"10.1007/978-3-031-82670-2_23","title":"Multi-agent Search-Type Problems on Polygons","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Type (biology)","score_opus":0.04104181170680093,"score_gpt":0.2888128697729929,"score_spread":0.24777105806619198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006128672,0.00026765594,0.98526186,0.0025574684,0.0018849123,0.000784623,0.0000063509456,0.00025895739,0.00897204],"genre_scores_gemma":[0.01878739,0.0003292778,0.9594827,0.006312104,0.00029183723,0.000023111746,0.000018559704,0.000057223555,0.014697744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954517,0.00007850464,0.0005149747,0.0017632073,0.0013105025,0.00088112114],"domain_scores_gemma":[0.99699557,0.0004076377,0.00014656925,0.001686824,0.0004753018,0.00028807647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010466618,0.00053583033,0.0004690779,0.0014337703,0.00039434555,0.0007888984,0.003971732,0.00032895737,0.000048737566],"category_scores_gemma":[0.00014123021,0.00047544308,0.0001325207,0.0012872212,0.0005953855,0.00042038917,0.0018593391,0.0012499257,0.00018491193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008288038,0.00013434172,0.000037037244,0.00009939696,0.000022440585,0.00007036211,0.0010889417,0.5000366,0.00016510468,0.052232474,0.00025601403,0.445849],"study_design_scores_gemma":[0.00037702092,0.0003243726,0.000051623378,0.00064658595,0.000003922991,0.000013416959,1.2947172e-7,0.9794501,0.0005003514,0.01216128,0.005900895,0.0005702894],"about_ca_topic_score_codex":0.000032671673,"about_ca_topic_score_gemma":0.000059710746,"teacher_disagreement_score":0.47941354,"about_ca_system_score_codex":0.000392576,"about_ca_system_score_gemma":0.0013291796,"threshold_uncertainty_score":0.99976975},"labels":[],"label_agreement":null},{"id":"W4407194208","doi":"10.1007/s00521-024-10546-y","title":"Optimizing a continuous action learning automata (CALA) optimizer for training artificial neural networks","year":2025,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational Science and Engineering; Computer science; Artificial neural network; Training (meteorology); Action (physics); Artificial intelligence; Automaton; Machine learning; Meteorology; Geography","score_opus":0.050106216401688435,"score_gpt":0.3288892452449029,"score_spread":0.27878302884321443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407194208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036445146,0.00008910063,0.9923363,0.0019638746,0.00019208484,0.00065575255,0.0000013097524,0.0005909483,0.000526123],"genre_scores_gemma":[0.888094,0.000015353806,0.11088234,0.00044071474,0.00017025843,0.00013683777,0.000021176673,0.000012637408,0.00022665912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862236,0.000087725115,0.00032231826,0.00048187363,0.00011360739,0.00037212312],"domain_scores_gemma":[0.999022,0.00038985768,0.0001233778,0.00024654524,0.00012577446,0.00009242867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035354987,0.00015449266,0.00020661335,0.00013353568,0.0010083126,0.00050152873,0.0003471336,0.00008001077,0.0000016832707],"category_scores_gemma":[0.000053739026,0.00015947432,0.000071550334,0.00051061774,0.000059026625,0.00022528238,0.00020140319,0.00031531835,0.0000011801839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055080454,0.00002089652,0.00003558356,0.000013648436,0.000008403951,2.6059166e-7,0.00022656968,0.6067979,0.00015753091,0.017839605,0.00009696903,0.37479714],"study_design_scores_gemma":[0.00036233605,0.000048431073,0.0000922588,0.000020830648,0.000010727727,0.000007305169,0.00016341866,0.995506,0.000059153146,0.00066759594,0.0029162525,0.00014572608],"about_ca_topic_score_codex":0.0000067639953,"about_ca_topic_score_gemma":0.0000019793392,"teacher_disagreement_score":0.8844495,"about_ca_system_score_codex":0.000022921262,"about_ca_system_score_gemma":0.00003494112,"threshold_uncertainty_score":0.77552265},"labels":[],"label_agreement":null},{"id":"W4407263581","doi":"10.1016/j.ic.2025.105280","title":"On the computational power of energy-constrained mobile robots","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Japan Society for the Promotion of Science London","keywords":"Computer science; Energy (signal processing); Mobile robot; Power (physics); Robot; Human–computer interaction; Artificial intelligence; Physics","score_opus":0.008253946251145946,"score_gpt":0.24746364461184642,"score_spread":0.23920969836070047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407263581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044486113,0.000013800818,0.9802252,0.0015330478,0.000093992676,0.00014921554,0.0000023848959,0.00005214616,0.013481606],"genre_scores_gemma":[0.9860568,0.0000057372836,0.011612576,0.0022252398,0.0000020461391,0.000019683945,0.000022964796,0.0000011383469,0.000053807347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993491,0.000048851656,0.00026687962,0.00007215559,0.00018803269,0.00007498029],"domain_scores_gemma":[0.999333,0.00023000175,0.00010849806,0.00009552817,0.00020874476,0.000024224426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019695886,0.00006291613,0.00006957245,0.00017785578,0.00012110573,0.0001361553,0.0001544613,0.000029767749,0.000016818018],"category_scores_gemma":[0.000031289255,0.000047249716,0.00002385292,0.00035757018,0.000050521296,0.00058574404,0.000053409032,0.000050570998,0.000008955317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034865295,0.000012871298,0.000011834715,0.0000058758405,0.0000061002906,4.142529e-8,0.0004464563,0.32369772,0.0000022290014,0.6415595,0.0008518139,0.033402104],"study_design_scores_gemma":[0.0003159728,0.00006256624,0.00080059824,0.000020969368,0.0000012441086,0.0000013911418,0.00011384149,0.9431921,0.00006524435,0.054295395,0.0010805959,0.000050045135],"about_ca_topic_score_codex":0.0000046891682,"about_ca_topic_score_gemma":4.5953496e-7,"teacher_disagreement_score":0.9816082,"about_ca_system_score_codex":0.000013588139,"about_ca_system_score_gemma":0.000076562734,"threshold_uncertainty_score":0.19267875},"labels":[],"label_agreement":null},{"id":"W4407366263","doi":"10.1007/978-3-031-81396-2","title":"Approximation and Online Algorithms","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Birkbeck, University of London; Indian Institute of Technology Delhi; Syddansk Universitet; Indian Institute of Technology Bombay; Sorbonne Université; University of Twente; University of Waterloo; Eidgenössische Technische Hochschule Zürich; Nanjing University; Dalhousie University; Centre National de la Recherche Scientifique; University of Oxford; Université Grenoble Alpes; Aarhus Universitet","keywords":"Computer science; Algorithm","score_opus":0.017033240149665344,"score_gpt":0.27136077012937876,"score_spread":0.2543275299797134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407366263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044975795,0.00036142286,0.9943845,0.0017021763,0.00074815267,0.00037863577,0.000006466379,0.00014766364,0.002266459],"genre_scores_gemma":[0.0005028277,0.00013147107,0.9942358,0.0018769727,0.0001964325,0.000009904523,0.000027037177,0.00001085548,0.0030086758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744815,0.000056694556,0.00034252513,0.0010749883,0.0006498593,0.0004277785],"domain_scores_gemma":[0.99844223,0.00030538367,0.00012939001,0.0007598209,0.00023749984,0.00012568565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068600976,0.00028352183,0.00031468796,0.00084892276,0.00019607318,0.0006548616,0.001847128,0.00021186343,0.000005567857],"category_scores_gemma":[0.0001175812,0.00025794434,0.000043971555,0.0012349708,0.0003877575,0.00059666636,0.0013231194,0.000565192,0.0000062833215],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5931905e-7,0.000035800906,0.000012838414,0.000068725065,0.0000041478743,0.000010434472,0.00043772344,0.031482905,0.000008771082,0.006180579,0.0001956801,0.9615616],"study_design_scores_gemma":[0.00018405647,0.00005854695,0.00004558758,0.00021819607,0.0000021737458,0.000013616078,9.252392e-8,0.92978734,0.00008383112,0.06720018,0.0021555047,0.00025089018],"about_ca_topic_score_codex":0.0000088356755,"about_ca_topic_score_gemma":0.000021924725,"teacher_disagreement_score":0.96131074,"about_ca_system_score_codex":0.00022097581,"about_ca_system_score_gemma":0.0012136742,"threshold_uncertainty_score":0.9999873},"labels":[],"label_agreement":null},{"id":"W4408013772","doi":"10.1016/j.orl.2025.107257","title":"Single sample prophet inequality for uniform matroids of rank 2","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Rank (graph theory); Mathematics; Inequality; Sample (material); Combinatorics; Mathematical analysis; Physics","score_opus":0.09306778438594705,"score_gpt":0.38871001137835837,"score_spread":0.2956422269924113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408013772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01065181,0.000016411612,0.95569235,0.031321365,0.00007826344,0.00087841146,0.000030128764,0.000045090495,0.0012861476],"genre_scores_gemma":[0.48649836,0.00001913142,0.5099704,0.0016106548,0.000042175627,0.0004178247,0.00007125777,0.000010752319,0.0013594447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984353,0.00025677975,0.00028495907,0.00027406254,0.0004084422,0.00034041217],"domain_scores_gemma":[0.9982418,0.00040767598,0.000015746702,0.00053954124,0.0007301867,0.00006504008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803727,0.000072355346,0.00012557064,0.00037907818,0.00040020482,0.00034396054,0.00070209126,0.000037649756,0.000041435815],"category_scores_gemma":[0.00088510866,0.00006488783,0.000052409086,0.0011278392,0.00014750483,0.00051221217,0.00023191416,0.00016029307,0.000008614405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005107286,0.00054517214,0.0003681649,0.00029262336,0.000069374,0.000001779331,0.0017244422,0.096401215,0.17802964,0.6579254,0.044662464,0.019928655],"study_design_scores_gemma":[0.0010702839,0.00025591304,0.00017217253,0.000054959037,0.0000030691767,7.1548624e-7,0.00011626448,0.9374853,0.02845961,0.0033676268,0.028855784,0.00015832987],"about_ca_topic_score_codex":0.00025643985,"about_ca_topic_score_gemma":0.00011731308,"teacher_disagreement_score":0.84108406,"about_ca_system_score_codex":0.00009733702,"about_ca_system_score_gemma":0.00027670414,"threshold_uncertainty_score":0.33168194},"labels":[],"label_agreement":null},{"id":"W4408128235","doi":"10.1007/978-981-96-1090-7_2","title":"An Optimal Absolute Approximation Algorithm for Computing k Restricted Shortest Paths","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Algorithm; Approximation algorithm; Shortest path problem; Theoretical computer science; Graph","score_opus":0.01996489278085252,"score_gpt":0.27794704484643046,"score_spread":0.25798215206557795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408128235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069085745,0.00012710571,0.99517107,0.0004977893,0.0012072531,0.0011647294,0.000023459275,0.00036659028,0.0014350823],"genre_scores_gemma":[0.0031155103,0.000034065735,0.99525046,0.00078673393,0.0003482326,0.000023572555,0.00007586282,0.000031289874,0.0003342466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957235,0.0000609716,0.00071926886,0.0017734596,0.0009066197,0.00081619853],"domain_scores_gemma":[0.9967925,0.0006068314,0.00032227207,0.0013153043,0.0007232546,0.00023983515],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010804548,0.0005209092,0.0005305265,0.0011746141,0.0005249259,0.0011342131,0.0033161868,0.0003779562,0.000009688852],"category_scores_gemma":[0.0001007113,0.00051735155,0.00013905135,0.0010512996,0.00035679646,0.0009830351,0.00089290034,0.0006872315,0.000007779386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030038948,0.00003903149,0.0000023165164,0.000027512557,0.000007651571,0.0000107895585,0.00032222332,0.18649918,0.00002582103,0.008378274,0.00004329999,0.8046409],"study_design_scores_gemma":[0.00035927657,0.0002817108,0.00002729983,0.00026044794,0.0000073983747,0.000015799596,3.290263e-7,0.9816556,0.00021349387,0.015836962,0.00081075996,0.000530907],"about_ca_topic_score_codex":0.000011717,"about_ca_topic_score_gemma":0.000010577227,"teacher_disagreement_score":0.80411,"about_ca_system_score_codex":0.0002923096,"about_ca_system_score_gemma":0.00094263215,"threshold_uncertainty_score":0.9999027},"labels":[],"label_agreement":null},{"id":"W4408215908","doi":"10.56553/popets-2025-0055","title":"Private Shared Random Minimum Spanning Forests","year":2025,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Royal Bank of Canada","keywords":"Spanning tree; Business; Mathematics; Combinatorics","score_opus":0.01709837059611084,"score_gpt":0.2727739251701088,"score_spread":0.25567555457399793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408215908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13484098,0.00023738864,0.8274788,0.015763592,0.00038924412,0.0010470696,0.0000014267837,0.009814973,0.010426493],"genre_scores_gemma":[0.8707086,0.0000872634,0.1281019,0.0003080856,0.0000130372655,0.0001660381,0.000001445227,0.000016050857,0.00059761066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978257,0.000010280718,0.00043632285,0.00074548874,0.0003645693,0.0006176805],"domain_scores_gemma":[0.9988148,0.00015605781,0.00018140192,0.00054472545,0.00025415036,0.000048869257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005605236,0.00028116608,0.00032896822,0.0007918562,0.00033464437,0.00061030197,0.002626949,0.00021739981,0.0000069718844],"category_scores_gemma":[0.0026032873,0.00024932428,0.00008730629,0.0016334356,0.00011537926,0.00089618005,0.0017394251,0.00045597428,0.000045993118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013487534,0.00023522794,0.009741818,0.00049253774,0.00011645081,0.000017888922,0.0020078667,0.00038707518,0.04542668,0.82371414,0.012707335,0.10501811],"study_design_scores_gemma":[0.002636014,0.00031869215,0.0010662542,0.0010708666,0.00001549748,0.000011492821,0.000420633,0.11837676,0.6648466,0.19549443,0.014998,0.00074478233],"about_ca_topic_score_codex":0.0000019774905,"about_ca_topic_score_gemma":0.0000010116028,"teacher_disagreement_score":0.7358676,"about_ca_system_score_codex":0.00011422957,"about_ca_system_score_gemma":0.00007779027,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W4408285114","doi":"10.1145/3711701","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya; VMware","keywords":"Computer science; Algorithm; Artificial intelligence; Distributed computing","score_opus":0.036851129680717055,"score_gpt":0.282232683337481,"score_spread":0.24538155365676398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408285114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26220104,0.00017695647,0.7314068,0.0037817173,0.0001648988,0.0013339899,0.0000128884885,0.00010378178,0.00081789197],"genre_scores_gemma":[0.97619313,0.000009047114,0.023628756,0.000050907016,0.000015036482,0.00000809033,0.000009444743,0.000004684584,0.00008088469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984429,0.00003843158,0.000468161,0.00029064371,0.00060165743,0.00015820753],"domain_scores_gemma":[0.9971592,0.00011345289,0.0005772783,0.0002230957,0.0018903292,0.000036649762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364774,0.00013348053,0.0004012273,0.00038395193,0.00016409044,0.00009872221,0.0007945953,0.000038211332,5.2965567e-7],"category_scores_gemma":[0.00048338494,0.000091969014,0.00010658846,0.0013132902,0.000108765205,0.00009946864,0.00021557257,0.00010184579,7.86327e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034024366,0.0016953119,0.2965546,0.0028964644,0.012060181,4.0263348e-7,0.005400287,0.30708903,0.026312867,0.2980981,0.00081809924,0.048734445],"study_design_scores_gemma":[0.0008483701,0.00027105727,0.010731516,0.00080121215,0.00034105591,4.6255087e-7,0.00063708605,0.9828104,0.0032160904,0.00014013992,0.00008786937,0.0001147371],"about_ca_topic_score_codex":0.000025984937,"about_ca_topic_score_gemma":0.0000060854913,"teacher_disagreement_score":0.7139921,"about_ca_system_score_codex":0.000051766954,"about_ca_system_score_gemma":0.000064893626,"threshold_uncertainty_score":0.37503877},"labels":[],"label_agreement":null},{"id":"W4408343545","doi":"10.1145/3723351","title":"Threshold Policies with Tight Guarantees for Online Selection with Convex Costs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Economics and Computation","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo; University of Alberta","funders":"","keywords":"Selection (genetic algorithm); Regular polygon; Computer science; Mathematical optimization; Operations research; Business; Mathematics; Artificial intelligence","score_opus":0.016571547734413043,"score_gpt":0.26647594002704195,"score_spread":0.2499043922926289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408343545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05513928,0.00001708856,0.93988657,0.0042447783,0.0000649367,0.00034418522,0.00001227004,0.0000736508,0.00021722137],"genre_scores_gemma":[0.8357649,0.00018809504,0.16283342,0.00082692516,0.000013526115,0.00005736892,0.000021951966,0.0000094023735,0.00028441078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994152,0.000013238981,0.00014441826,0.00025282108,0.000042328087,0.00013195506],"domain_scores_gemma":[0.99954927,0.00010288314,0.00005184817,0.00014493924,0.00011350813,0.000037551876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006861865,0.000104897445,0.000120890756,0.0001920924,0.00025181935,0.00018677073,0.00015467094,0.000038804876,0.0000022235622],"category_scores_gemma":[0.0000022149918,0.00008876586,0.000022393173,0.00021734048,0.000042885833,0.00031117853,0.0000052497044,0.000076159195,0.0000010783966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016838271,0.00020665646,0.00021776285,0.000032426316,0.00011611905,2.6834974e-7,0.0003356256,0.69679517,0.000030001467,0.076447524,0.00007793346,0.22557212],"study_design_scores_gemma":[0.0012370866,0.0004969042,0.0011936828,0.000036533267,0.000016100472,0.000007736801,0.00005319794,0.9892518,0.0005183329,0.005763037,0.0012883462,0.00013724624],"about_ca_topic_score_codex":0.000031798936,"about_ca_topic_score_gemma":0.00032248613,"teacher_disagreement_score":0.78062564,"about_ca_system_score_codex":0.00005576182,"about_ca_system_score_gemma":0.00009612785,"threshold_uncertainty_score":0.36197668},"labels":[],"label_agreement":null},{"id":"W4408370374","doi":"10.1007/978-981-96-2220-7_16","title":"Distributed Mission Planning for Multi-spacecraft Based on Potential Game","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Aerospace engineering; Computer science; Potential game; Aeronautics; Astrobiology; Systems engineering; Game theory; Engineering; Physics; Mathematics","score_opus":0.018472598786174996,"score_gpt":0.26504284200933675,"score_spread":0.24657024322316176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408370374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.54395e-7,0.00034296687,0.9972263,0.0007285029,0.00025282544,0.00054302596,0.000020678963,0.00028366616,0.00060115976],"genre_scores_gemma":[0.07188907,0.00008306792,0.9146863,0.001734316,0.0004805172,0.00012794927,0.0006556769,0.0002182521,0.010124846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821556,0.000017285472,0.0003224131,0.00060267927,0.00032339816,0.00051869464],"domain_scores_gemma":[0.9987478,0.000584347,0.00007635617,0.00036881515,0.00008916414,0.00013352002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015784157,0.00039008236,0.00039438708,0.0006317825,0.00006198082,0.00011715789,0.0005393041,0.0004997946,0.0000130452445],"category_scores_gemma":[0.0006312342,0.00037421854,0.00017073347,0.00031880123,0.000011701041,0.00006546865,0.000081767816,0.0009481831,0.000003353248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002495635,0.000028008317,0.0000018011605,0.00006932857,0.000015121644,0.000026697237,0.000019554913,0.9792883,0.0002149595,0.0061576613,0.00012621313,0.01402741],"study_design_scores_gemma":[0.0007347844,0.00014948042,0.000008158684,0.0004078552,0.0000095977775,0.0000022553265,3.557444e-8,0.9855057,0.0004911817,0.000901105,0.011423491,0.0003663723],"about_ca_topic_score_codex":0.0000021160336,"about_ca_topic_score_gemma":7.444366e-7,"teacher_disagreement_score":0.08254002,"about_ca_system_score_codex":0.00025290676,"about_ca_system_score_gemma":0.00015386185,"threshold_uncertainty_score":0.99987096},"labels":[],"label_agreement":null},{"id":"W4409473625","doi":"10.1109/tase.2025.3560956","title":"Only Pick Once: Algorithms for Efficiently Picking an Exact Number of Multiple Identical Objects","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Algorithm; Computer science","score_opus":0.019212677745341508,"score_gpt":0.3065254537848646,"score_spread":0.2873127760395231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409473625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054896906,0.000004447893,0.9439993,0.000107747466,0.00043470837,0.00023030392,0.0000029831883,0.00018332561,0.00014026582],"genre_scores_gemma":[0.8839467,0.000005958342,0.11587617,0.00005928795,0.0000068421323,0.000024193172,5.460203e-7,0.000004506486,0.00007576218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988139,0.00001490844,0.000250476,0.00030536824,0.00037887777,0.00023646271],"domain_scores_gemma":[0.9992244,0.00015501096,0.000040914256,0.0002316415,0.0002519687,0.000096066025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006665708,0.0000974165,0.00011850507,0.0003820819,0.00026799642,0.00022352743,0.00034360154,0.000042538602,0.0000050844187],"category_scores_gemma":[0.00006938217,0.000097057666,0.000036050256,0.0011949665,0.000085958876,0.0010724566,0.000005333306,0.000092116745,0.0000032557998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069508965,0.00020265975,0.000110853434,0.00012204415,0.000015613197,7.1290634e-7,0.0018611081,0.8694853,0.020415306,0.012941427,0.000014327309,0.0948237],"study_design_scores_gemma":[0.0003424666,0.00004766533,0.0011557561,0.000058674985,0.0000043377518,0.0000044552776,0.00005814376,0.97785527,0.020246206,0.00006141641,0.00007304639,0.00009259387],"about_ca_topic_score_codex":0.0000117745,"about_ca_topic_score_gemma":0.000004422172,"teacher_disagreement_score":0.8290498,"about_ca_system_score_codex":0.00006965824,"about_ca_system_score_gemma":0.00020854909,"threshold_uncertainty_score":0.39578968},"labels":[],"label_agreement":null},{"id":"W4410397800","doi":"10.1016/j.jcss.2025.103678","title":"Weighted group search on the disk &amp; improved lower bounds for priority evacuation","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Group (periodic table); Computer science; Combinatorics; Mathematics; Mathematical optimization; Chemistry","score_opus":0.031114535952634755,"score_gpt":0.3065126150479861,"score_spread":0.27539807909535136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410397800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027654767,0.00012829731,0.9630796,0.007012205,0.001141902,0.0003019072,9.4075705e-7,0.000019600668,0.00066078466],"genre_scores_gemma":[0.9242814,0.000029774998,0.07448256,0.0008480705,0.00014344783,0.0000071557874,3.4737755e-7,0.0000026250277,0.00020461551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855584,0.00021923274,0.00036902097,0.00020391648,0.0004577679,0.00019425],"domain_scores_gemma":[0.9987436,0.00048797994,0.00016598507,0.00018156793,0.00034971518,0.000071144284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036967017,0.000088466426,0.00017348999,0.00021563264,0.00056572986,0.0008901543,0.0008241615,0.000031544056,0.0000017166153],"category_scores_gemma":[0.00002754278,0.000047648795,0.00008009421,0.00054314296,0.00012017772,0.0004775775,0.00012599988,0.00012979873,0.0000015138653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010815513,0.0002565669,0.0015516548,0.0002334689,0.00010636394,0.000004267179,0.002262562,0.0039913496,0.00066464976,0.88413936,0.013218341,0.093463235],"study_design_scores_gemma":[0.0004541178,0.00056779286,0.0012831134,0.00018202332,0.000005248567,0.000019018787,0.000080701844,0.9884664,0.000052858,0.0018277173,0.0069845896,0.0000764479],"about_ca_topic_score_codex":0.000005513192,"about_ca_topic_score_gemma":0.0000037105572,"teacher_disagreement_score":0.984475,"about_ca_system_score_codex":0.000045342524,"about_ca_system_score_gemma":0.0001877792,"threshold_uncertainty_score":0.8583778},"labels":[],"label_agreement":null},{"id":"W4410432240","doi":"10.1287/mnsc.2023.00309","title":"Uncertain Search with Knowledge Transfer","year":2025,"lang":"en","type":"article","venue":"Management Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Knowledge transfer; Knowledge management","score_opus":0.020966666172799145,"score_gpt":0.29874203160311097,"score_spread":0.27777536543031184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410432240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007678903,0.00002089691,0.7407649,0.0018430743,0.00008810454,0.00024138411,1.4652619e-7,0.000103378654,0.2561702],"genre_scores_gemma":[0.8989691,0.000033171575,0.07299017,0.00081305095,0.0000067253704,0.00004297081,5.3017465e-7,0.0000039237575,0.027140329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855393,0.00003623285,0.00010456953,0.00047385512,0.00045179366,0.00037962533],"domain_scores_gemma":[0.99927413,0.000021972026,0.000006047306,0.0005074179,0.00010727856,0.00008314808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009202958,0.00008256434,0.00006933184,0.00046382262,0.00036380012,0.00041547415,0.0017073079,0.000012246923,0.00002503503],"category_scores_gemma":[0.000005558782,0.00006323599,0.00001678659,0.0037761999,0.00030534712,0.0005994783,0.00041843965,0.000076356504,0.00007768714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030400943,0.00006352532,0.00028822233,0.000039231483,0.0000074848135,0.000007790276,0.00042146127,0.005563089,0.000102392034,0.9496672,0.0005938241,0.04324272],"study_design_scores_gemma":[0.0012983015,0.00017857061,0.0078683505,0.0001652645,0.000010253305,0.000002879265,0.0003718051,0.9231503,0.0037455682,0.0048256908,0.057969715,0.0004133027],"about_ca_topic_score_codex":0.0000066423736,"about_ca_topic_score_gemma":0.0000070417927,"teacher_disagreement_score":0.9448415,"about_ca_system_score_codex":0.00007018098,"about_ca_system_score_gemma":0.00013879925,"threshold_uncertainty_score":0.40064266},"labels":[],"label_agreement":null},{"id":"W4410553862","doi":"10.1007/978-3-031-91736-3_18","title":"Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Robot; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.024793170628626637,"score_gpt":0.25921107446130714,"score_spread":0.23441790383268052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008486404,0.000117466305,0.9893287,0.0020698328,0.0014586211,0.00042069302,0.000005052149,0.00022437182,0.006366813],"genre_scores_gemma":[0.14450975,0.00022679301,0.8432412,0.0074221864,0.0005306386,0.000016895803,0.000059539834,0.00005879527,0.003934162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678606,0.00006120613,0.0004558206,0.001097165,0.0009783279,0.0006214508],"domain_scores_gemma":[0.9980314,0.00020186162,0.00022395578,0.0010082006,0.00036248929,0.00017209571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059933093,0.00041656874,0.00036112737,0.0012325279,0.00030630664,0.00090274494,0.0027117196,0.0003185648,0.000054338023],"category_scores_gemma":[0.00003739923,0.00040832962,0.00012222957,0.0007956554,0.00040075523,0.0015023256,0.0014751328,0.00074306346,0.00006449884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029929813,0.000025741358,0.0000106593825,0.00005263996,0.000013715317,0.00004179105,0.0005501378,0.46481383,0.000039933348,0.04581371,0.000108301254,0.48852655],"study_design_scores_gemma":[0.0003550569,0.00008740444,0.000018901916,0.0003518679,0.0000063172542,0.000026626694,4.3117677e-7,0.9493255,0.00031110182,0.0483893,0.00068322243,0.00044427483],"about_ca_topic_score_codex":0.000034348315,"about_ca_topic_score_gemma":0.000111303,"teacher_disagreement_score":0.4880823,"about_ca_system_score_codex":0.00053794216,"about_ca_system_score_gemma":0.00089826004,"threshold_uncertainty_score":0.99983686},"labels":[],"label_agreement":null},{"id":"W4410553941","doi":"10.1007/978-3-031-91736-3_5","title":"Exploration of Convex Terrains by a Deterministic Automaton with Pebbles","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Automaton; Deterministic automaton; Regular polygon; Terrain; Büchi automaton; Algorithm; Theoretical computer science; Geometry; Mathematics; Cartography","score_opus":0.02013115548736642,"score_gpt":0.25897559071636617,"score_spread":0.23884443522899976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001455153,0.000118400785,0.9934081,0.00084475876,0.00033653463,0.00043053218,0.000010003001,0.00013388129,0.0047032833],"genre_scores_gemma":[0.15435182,0.000113985836,0.8406356,0.0016795428,0.00009544487,0.000038369057,0.000032424337,0.000040551844,0.0030122525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973651,0.000040505915,0.00046331223,0.0009363854,0.0008097182,0.00038493882],"domain_scores_gemma":[0.99807835,0.00030589977,0.00028766802,0.000887196,0.0003279412,0.00011293375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044742646,0.00034425376,0.00044842283,0.0006901791,0.00015299846,0.00033320757,0.0018826042,0.00018402899,0.000016245644],"category_scores_gemma":[0.000064434294,0.0002868217,0.00005996553,0.0006264734,0.00069994025,0.0008355971,0.0005726413,0.00036334354,0.000006952178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024038443,0.00012833103,0.000078607925,0.00038800374,0.000040342984,0.000071963485,0.0042955,0.10567576,0.000444198,0.08308712,0.00049023103,0.8052759],"study_design_scores_gemma":[0.00032750453,0.0003471812,0.000010998608,0.000660444,0.0000068594723,0.00001614487,4.4546718e-7,0.9660094,0.0015296027,0.029273447,0.0014276578,0.0003903378],"about_ca_topic_score_codex":0.000013159106,"about_ca_topic_score_gemma":0.000041836924,"teacher_disagreement_score":0.8603336,"about_ca_system_score_codex":0.000118773285,"about_ca_system_score_gemma":0.00085635856,"threshold_uncertainty_score":0.9999584},"labels":[],"label_agreement":null},{"id":"W4410553953","doi":"10.1007/978-3-031-91736-3_16","title":"Multi-agent Disk Inspection","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Engineering drawing; Engineering","score_opus":0.024340273850264316,"score_gpt":0.27294378866989777,"score_spread":0.24860351481963344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410553953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026399748,0.00023590884,0.98806095,0.001250809,0.002179024,0.00043103867,0.0000036544857,0.00036538442,0.007470613],"genre_scores_gemma":[0.012927963,0.00019144262,0.9794908,0.002098665,0.00023213789,0.000015928892,0.000008002652,0.00002319727,0.0050118533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683934,0.000039895884,0.00043290175,0.0013499636,0.0008083226,0.0005295726],"domain_scores_gemma":[0.99801314,0.00019651704,0.00016591596,0.001171881,0.00028772478,0.00016484402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006503034,0.0003839889,0.00035068105,0.0010444112,0.0003499236,0.00065595045,0.0026223906,0.00025112266,0.000027260096],"category_scores_gemma":[0.00010111299,0.00035352824,0.00011509304,0.0008657702,0.00043031367,0.00057199097,0.0014442737,0.00073071197,0.000073658695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035898495,0.000077151526,0.0000684242,0.00005930047,0.000015253189,0.00005051519,0.0008209342,0.14694625,0.000092752176,0.05266159,0.00023585855,0.7989684],"study_design_scores_gemma":[0.000266616,0.000074970114,0.00010047907,0.00023570936,0.000003375356,0.0000123511345,8.342435e-8,0.97132283,0.00026495178,0.02280328,0.004522548,0.00039278594],"about_ca_topic_score_codex":0.0000239627,"about_ca_topic_score_gemma":0.00008641043,"teacher_disagreement_score":0.8243766,"about_ca_system_score_codex":0.00039204615,"about_ca_system_score_gemma":0.0006400992,"threshold_uncertainty_score":0.9998917},"labels":[],"label_agreement":null},{"id":"W4410789742","doi":"10.1080/03155986.2025.2510171","title":"A stochastic leader-follower model in competitive facility location","year":2025,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Facility location problem; Stochastic modelling; Computer science; Operations research; Engineering; Mathematics; Statistics","score_opus":0.06720263850202583,"score_gpt":0.35704757993454095,"score_spread":0.2898449414325151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410789742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015579778,0.00007764381,0.97226924,0.0016196906,0.00011037898,0.000886446,0.00002171731,0.00004098968,0.023415942],"genre_scores_gemma":[0.9958674,0.00001625734,0.0018949657,0.000351526,0.000008968722,0.00024422831,0.00007018831,0.000001498012,0.0015450121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817634,0.00012904256,0.00052528037,0.00016192962,0.0007413504,0.00026608675],"domain_scores_gemma":[0.9979855,0.00021437497,0.00004494434,0.00022201664,0.0014532277,0.00007998219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002146626,0.0000925048,0.00013294934,0.0007513447,0.00030834938,0.0009364141,0.0003107019,0.00008485999,0.000007898447],"category_scores_gemma":[0.00042205592,0.00008387106,0.000017742857,0.0010608146,0.00009191814,0.0034088893,0.00018658147,0.00026747302,0.00010241012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009047139,0.000013013471,0.00013960991,0.000056232766,0.0000040875166,1.3305409e-7,0.0014202805,0.44535768,0.000004119677,0.5509241,0.00054458156,0.0015271108],"study_design_scores_gemma":[0.0005060914,0.000025711865,0.0009598129,0.00008105407,4.013726e-7,0.0000018704827,0.00090534386,0.99121267,0.0000072537982,0.0006157352,0.0056045293,0.000079545855],"about_ca_topic_score_codex":0.00018356822,"about_ca_topic_score_gemma":0.000037722646,"teacher_disagreement_score":0.99430937,"about_ca_system_score_codex":0.00016609543,"about_ca_system_score_gemma":0.00078767905,"threshold_uncertainty_score":0.9029863},"labels":[],"label_agreement":null},{"id":"W4411019970","doi":"10.1145/3726854.3727292","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Competitive analysis; Distributed computing; Artificial intelligence","score_opus":0.021685867616091585,"score_gpt":0.2997642033887987,"score_spread":0.27807833577270713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411019970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047809843,0.000008499877,0.9875066,0.005510444,0.00007031605,0.0005032156,0.0000069700754,0.00019846311,0.00571738],"genre_scores_gemma":[0.25382027,0.000013499758,0.7355494,0.0011121838,0.000023029148,0.000050325165,0.00025120087,0.0000073963624,0.00917272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991552,0.00005424225,0.00018294691,0.00027328942,0.00015419787,0.00018007676],"domain_scores_gemma":[0.9991951,0.000106832114,0.00006098767,0.00016068852,0.00042039726,0.000055984005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020241387,0.000098327546,0.00011818247,0.00012335519,0.00012944137,0.000099875455,0.0002527501,0.000038294915,0.00004768287],"category_scores_gemma":[0.00005384315,0.0000796512,0.000026244923,0.00037685913,0.000091389615,0.00021494264,0.00006496084,0.000102925245,0.000006941026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059817638,0.0005061139,0.002127188,0.00006501529,0.00011871108,0.0000040415557,0.0005494508,0.02073711,0.0002629356,0.77692676,0.0012613385,0.19738153],"study_design_scores_gemma":[0.0014586515,0.00034168782,0.00082497206,0.00005004694,0.0000053761414,0.0000021797166,0.00021734367,0.9884795,0.001002605,0.0005826693,0.0069103874,0.00012459843],"about_ca_topic_score_codex":0.000024402387,"about_ca_topic_score_gemma":0.00007700698,"teacher_disagreement_score":0.9677424,"about_ca_system_score_codex":0.000037051752,"about_ca_system_score_gemma":0.00019551891,"threshold_uncertainty_score":0.32480818},"labels":[],"label_agreement":null},{"id":"W4411137410","doi":"10.1016/j.tcs.2025.115395","title":"Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Università degli Studi di Milano-Bicocca; Université du Québec en Outaouais","keywords":"Sniffing; Rendezvous; Computer science; Grid; Computer security; Distributed computing; Mathematics; Psychology; Engineering","score_opus":0.021273114272894248,"score_gpt":0.31530384470650036,"score_spread":0.2940307304336061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411137410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0133972205,0.000010294954,0.9723757,0.0032748189,0.00044889929,0.00030452907,0.0000011432052,0.00005021304,0.010137175],"genre_scores_gemma":[0.9189322,0.0000022042216,0.07861532,0.0023934317,0.000024788988,0.000011171745,2.1806751e-7,0.0000028151994,0.00001785644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978723,0.00021028354,0.0003352242,0.0004909054,0.0006403102,0.00045100125],"domain_scores_gemma":[0.998535,0.00037644524,0.000046495636,0.00077610713,0.00014821847,0.00011773003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002105256,0.00012124233,0.00017627202,0.00037813326,0.00021592517,0.00031619627,0.0035244727,0.000032401866,0.000013525873],"category_scores_gemma":[0.00023489463,0.000085144406,0.000040989806,0.0027795297,0.0008913692,0.00024393968,0.0010559192,0.00011951731,0.000014191731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048087695,0.00006576141,0.00007866713,0.000010583801,0.0000014264232,0.000012821814,0.0013625206,0.003206273,0.00013821879,0.9797917,0.000215894,0.015111311],"study_design_scores_gemma":[0.0002642767,0.00023942189,0.0026495047,0.00009576553,0.0000027876129,0.000014725094,0.000026547894,0.9046473,0.0010495037,0.090602174,0.00025098695,0.00015703977],"about_ca_topic_score_codex":0.000005862032,"about_ca_topic_score_gemma":0.0000042125585,"teacher_disagreement_score":0.905535,"about_ca_system_score_codex":0.000043926186,"about_ca_system_score_gemma":0.00018170617,"threshold_uncertainty_score":0.6549406},"labels":[],"label_agreement":null},{"id":"W4411142825","doi":"10.1109/tro.2025.3578228","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Backpropagation; Artificial intelligence; Robotics; Computer science; Polynomial; Robot; Artificial neural network; Mathematics","score_opus":0.028160943682883313,"score_gpt":0.26998085358039997,"score_spread":0.24181990989751667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411142825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020493328,0.000031619085,0.9907282,0.0043846234,0.0011777146,0.00065256614,0.000003950461,0.00026703687,0.0027337824],"genre_scores_gemma":[0.19115417,0.0003087975,0.80403733,0.0011252615,0.000036862526,0.00009952286,0.000013415086,0.0000366108,0.0031879966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979839,0.00015212929,0.00054950383,0.0005269772,0.00034153461,0.00044597025],"domain_scores_gemma":[0.998918,0.00012027595,0.00009752379,0.00058959774,0.00019158934,0.00008299168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027789458,0.00023945881,0.00024998488,0.00045638872,0.00028071387,0.00029591625,0.00056698907,0.00018914008,0.000043328757],"category_scores_gemma":[0.000014295461,0.00025347515,0.000090679816,0.0018229102,0.00007022407,0.0010153378,0.000008690955,0.00041270637,0.000052538075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011379141,0.00033703307,0.00001993735,0.000040603645,0.00002082595,0.0000019262752,0.00030686142,0.99196136,0.00010566733,0.004093314,0.00037763373,0.002723436],"study_design_scores_gemma":[0.00085553696,0.000098508935,0.000016890597,0.00011735434,0.000014793925,0.0000026358073,0.00003937797,0.995661,0.0018036246,0.0009951515,0.00015717694,0.00023794205],"about_ca_topic_score_codex":0.00008025181,"about_ca_topic_score_gemma":0.00008413976,"teacher_disagreement_score":0.19113368,"about_ca_system_score_codex":0.0002614327,"about_ca_system_score_gemma":0.00025352926,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W4411188042","doi":"10.1007/978-3-031-93112-3_28","title":"Unsplittable Multicommodity Flows in Outerplanar Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorics; Outerplanar graph; Discrete mathematics; Mathematics; Pathwidth; Graph; Line graph","score_opus":0.01757865680214116,"score_gpt":0.259238448870317,"score_spread":0.24165979206817584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411188042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025594567,0.0002519898,0.9862718,0.0014007232,0.0013603646,0.0005605594,0.0000092443815,0.00016940387,0.009950302],"genre_scores_gemma":[0.032939322,0.00020534314,0.9607058,0.0035152151,0.00014750483,0.000031406704,0.000021283975,0.00003528531,0.0023988474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959967,0.00007518618,0.00063658657,0.0015745139,0.0008923356,0.00082469336],"domain_scores_gemma":[0.9973899,0.00048184174,0.00016621238,0.0015451363,0.00022479583,0.00019212668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011896321,0.00049214566,0.00058524206,0.0018103663,0.0002199993,0.0006321141,0.0039296397,0.0003511429,0.00003546711],"category_scores_gemma":[0.00011018264,0.00046857158,0.00012641064,0.0013385828,0.00036715379,0.00073657953,0.0015927658,0.0010927669,0.00004103285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008904405,0.00010417119,0.00042538898,0.000115510506,0.000013584441,0.000156006,0.0010129097,0.34745347,0.00003287134,0.11605738,0.00019505555,0.5344247],"study_design_scores_gemma":[0.0003643344,0.000056877318,0.000099744204,0.00038992008,0.0000024372264,0.000009664273,9.403135e-8,0.8665743,0.00010267349,0.12929477,0.0026589471,0.00044623783],"about_ca_topic_score_codex":0.000115809984,"about_ca_topic_score_gemma":0.0006038117,"teacher_disagreement_score":0.5339785,"about_ca_system_score_codex":0.00033711185,"about_ca_system_score_gemma":0.00076386594,"threshold_uncertainty_score":0.9997766},"labels":[],"label_agreement":null},{"id":"W4411411471","doi":"10.1145/3744970.3727292","title":"Learning-Augmented Competitive Algorithms for Spatiotemporal Online Allocation with Deadline Constraints","year":2025,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya","keywords":"Computer science; Online algorithm; Workload; Scheduling (production processes); Competitive analysis; Robustness (evolution); Metric (unit); Mathematical optimization; Algorithm; Upper and lower bounds","score_opus":0.07449504690266098,"score_gpt":0.37452110492905766,"score_spread":0.3000260580263967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411411471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015893313,0.007526142,0.9797158,0.0063980683,0.00021346644,0.0032552327,0.000011329014,0.00015265911,0.0011379373],"genre_scores_gemma":[0.23097275,0.07213898,0.6850426,0.006713741,0.00010387362,0.0012392269,0.0021407532,0.00003822954,0.0016098379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976616,0.00025727198,0.00056751724,0.000453685,0.00078948506,0.00027042237],"domain_scores_gemma":[0.9962144,0.00041364,0.00033327972,0.00058328937,0.0023773902,0.00007798958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031049368,0.00019536536,0.00032601383,0.0004871537,0.00025446335,0.00010727023,0.00072249945,0.0000628642,0.0000952143],"category_scores_gemma":[0.0025972791,0.00016527342,0.000064370164,0.0032782333,0.00008476159,0.00060127047,0.00014842286,0.00021559787,0.000023503131],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011644091,0.00015587088,0.0017275062,0.00094049866,0.000053092575,3.0289846e-7,0.000068405585,0.007548928,0.000010322715,0.0053683673,0.0008846005,0.9832305],"study_design_scores_gemma":[0.0015746924,0.00047278454,0.0031555227,0.0018562303,0.00008594979,0.0000032523374,0.000027679633,0.9735572,0.00017891788,0.00015412692,0.018707456,0.00022623123],"about_ca_topic_score_codex":0.0000037087625,"about_ca_topic_score_gemma":0.000005159366,"teacher_disagreement_score":0.9830042,"about_ca_system_score_codex":0.00017842362,"about_ca_system_score_gemma":0.00064098474,"threshold_uncertainty_score":0.67396545},"labels":[],"label_agreement":null},{"id":"W4411488214","doi":"10.1016/j.jpdc.2025.105139","title":"Dispersion of mobile robots on directed anonymous graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Robot; Theoretical computer science; Artificial intelligence","score_opus":0.010369928098864294,"score_gpt":0.2679163254368854,"score_spread":0.25754639733802115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411488214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08941647,0.00050158,0.9087526,0.00042706923,0.00020168432,0.00009609937,0.0000041650073,0.000036571124,0.00056373415],"genre_scores_gemma":[0.9738385,0.00011323737,0.025892137,0.0000894736,0.000015936464,5.607747e-7,0.0000047214508,0.0000026173589,0.00004282666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00009068264,0.0004466373,0.00014012589,0.00022604608,0.00016753376],"domain_scores_gemma":[0.9990286,0.00016577236,0.00030316677,0.00014322287,0.00026882268,0.00009039167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034370582,0.000097340875,0.00025236054,0.00020351262,0.00012049597,0.00007520959,0.00033904854,0.000046892674,0.0000041678272],"category_scores_gemma":[0.0000722433,0.000076884055,0.00008813433,0.00057038036,0.00004178807,0.00014752755,0.00014294116,0.00017292125,6.929517e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013611885,0.0005454704,0.010509767,0.00010878891,0.00014315317,0.000046567166,0.00057145546,0.8732581,0.0011840113,0.043562427,0.004911554,0.065022565],"study_design_scores_gemma":[0.0020954378,0.0006887275,0.020128958,0.0004435297,0.000021463733,0.000043910848,0.00014182438,0.970473,0.00044597234,0.00426903,0.001060715,0.00018746554],"about_ca_topic_score_codex":0.00000566783,"about_ca_topic_score_gemma":5.2974514e-7,"teacher_disagreement_score":0.884422,"about_ca_system_score_codex":0.00002332656,"about_ca_system_score_gemma":0.000070328,"threshold_uncertainty_score":0.31352407},"labels":[],"label_agreement":null},{"id":"W4411547426","doi":"10.1007/s00446-025-00489-5","title":"Fast deterministic rendezvous in labeled lines","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Computer science; Aerospace engineering; Engineering","score_opus":0.013014461166883933,"score_gpt":0.28455956800656634,"score_spread":0.2715451068396824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411547426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012305577,0.000061012142,0.98457617,0.00089319126,0.00025344978,0.00013909461,0.000008340768,0.000247662,0.0015155111],"genre_scores_gemma":[0.9801683,0.00000473738,0.019368902,0.00027558955,0.00002115236,0.000004941671,0.000041303138,0.0000042955844,0.000110796675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987605,0.00009433403,0.00032363355,0.00033304977,0.0001452346,0.0003432234],"domain_scores_gemma":[0.99924374,0.0001747844,0.00006422506,0.00035025863,0.00010966198,0.000057306825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028688696,0.00011702016,0.00016963796,0.00017777049,0.00013638145,0.00022010434,0.0007028352,0.000056554174,0.0000050612243],"category_scores_gemma":[0.0001722071,0.00011976001,0.00003719863,0.0012949285,0.000028106497,0.00011587032,0.0002885449,0.00017758888,0.000015641761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002243002,0.00054246176,0.02961127,0.00018779236,0.00006178445,0.00023024397,0.0012848933,0.33612838,0.0013745031,0.21465583,0.0039780797,0.41192234],"study_design_scores_gemma":[0.00047633552,0.00002063195,0.004631778,0.000087838,0.0000018719858,0.0000034752957,0.000028957425,0.992118,0.0002674616,0.0012647758,0.00097603834,0.00012283734],"about_ca_topic_score_codex":0.000016994827,"about_ca_topic_score_gemma":0.000010615805,"teacher_disagreement_score":0.9678627,"about_ca_system_score_codex":0.00006474942,"about_ca_system_score_gemma":0.00010966759,"threshold_uncertainty_score":0.48836714},"labels":[],"label_agreement":null},{"id":"W4412031854","doi":"10.1016/j.tcs.2025.115438","title":"Bike-assisted evacuation of robots on a line with asymmetric S/R communication","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Line (geometry); Computer science; Human–computer interaction; Artificial intelligence; Mathematics","score_opus":0.021304030791348322,"score_gpt":0.30058114467350033,"score_spread":0.27927711388215204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412031854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025781414,0.000022895581,0.9816123,0.0029494106,0.00009344007,0.00023226939,5.435742e-7,0.00010611782,0.012404832],"genre_scores_gemma":[0.728725,0.000009388286,0.27078274,0.00044008103,0.0000059456647,0.000006743387,0.0000013675102,0.0000026484377,0.000026062344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982217,0.00018817362,0.0002724624,0.00040735496,0.0006475146,0.00026279502],"domain_scores_gemma":[0.9978699,0.00040382045,0.00009479654,0.0010003733,0.00052688987,0.00010421966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206148,0.00011489628,0.0001676461,0.0006570733,0.0002690947,0.0002192611,0.0019287392,0.000039624996,0.000010373128],"category_scores_gemma":[0.00015367473,0.00008447777,0.00003178608,0.0048743244,0.0012624867,0.00040329053,0.0005547351,0.00016210931,0.000014562299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015639525,0.00012108142,0.000043145366,0.00000841088,0.0000041888297,5.778441e-7,0.000104171115,0.014442337,0.00011242274,0.9079338,0.000029126297,0.07718511],"study_design_scores_gemma":[0.00040556001,0.00048402708,0.0025075758,0.00011557054,0.000004018325,0.0000030989306,0.0000033209974,0.9520213,0.004228496,0.04009634,0.000029391425,0.00010127716],"about_ca_topic_score_codex":0.000004290072,"about_ca_topic_score_gemma":9.663953e-7,"teacher_disagreement_score":0.937579,"about_ca_system_score_codex":0.000061993545,"about_ca_system_score_gemma":0.00021846192,"threshold_uncertainty_score":0.46516848},"labels":[],"label_agreement":null},{"id":"W4412198485","doi":"10.4171/aihpd/212","title":"Counting mobiles by integrable systems","year":2025,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Integrable system; Computer science; Mathematics; Mathematical physics","score_opus":0.01221853338093233,"score_gpt":0.2567638169124274,"score_spread":0.24454528353149507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412198485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077417106,0.0021932486,0.94400096,0.0010680351,0.001492484,0.00033960023,0.000027879056,0.000263192,0.04287288],"genre_scores_gemma":[0.9951796,0.00063491456,0.0005450253,0.0004250084,0.0000470637,0.000089802605,0.000025063338,0.000012953513,0.0030406045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.00009322189,0.00029758725,0.00038057222,0.0001483943,0.00038341217],"domain_scores_gemma":[0.99877435,0.0002362867,0.00011568592,0.00043263214,0.0003168985,0.00012413488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027575062,0.00022468592,0.00024630065,0.00014511567,0.0006147216,0.00077200436,0.00055571046,0.00006595232,0.0000042286824],"category_scores_gemma":[0.00004204249,0.00020364067,0.000091767746,0.00070015626,0.000099705314,0.0009548666,0.00028795545,0.00039289665,0.000015457754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030741312,0.00023370316,0.0005330765,0.00006123749,0.0000871303,0.0000024710034,0.00057071494,0.0016087543,0.0004931634,0.97841156,0.012815733,0.0051793912],"study_design_scores_gemma":[0.00049557944,0.000070172515,0.00004190547,0.00025871317,0.000014738852,0.000025218947,0.0006504211,0.48392016,0.0016262409,0.16164233,0.350905,0.00034952254],"about_ca_topic_score_codex":0.00017294238,"about_ca_topic_score_gemma":0.000010782658,"teacher_disagreement_score":0.98743784,"about_ca_system_score_codex":0.00012612692,"about_ca_system_score_gemma":0.00020328317,"threshold_uncertainty_score":0.8304225},"labels":[],"label_agreement":null},{"id":"W4412220241","doi":"10.4230/lipics.swat.2024.16","title":"On the Online Weighted Non-Crossing Matching Problem","year":2024,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Danmarks Frie Forskningsfond","keywords":"Matching (statistics); Computer science; Level crossing; Mathematics; Statistics; Geography; Archaeology","score_opus":0.02915519909427842,"score_gpt":0.2591531528757423,"score_spread":0.2299979537814639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412220241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783561,0.00029641335,0.14997685,0.005270155,0.00016915,0.0013849819,0.0009917944,0.0003016303,0.058048055],"genre_scores_gemma":[0.94821393,0.000109669956,0.018879075,0.000048810896,0.000045858935,2.2072267e-7,0.000036594578,0.000045355046,0.0326205],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99609154,0.00054142333,0.00026690093,0.0007741722,0.0015939727,0.00073197694],"domain_scores_gemma":[0.99728376,0.00073074194,0.00020608304,0.00088629243,0.00059496163,0.00029817154],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022627567,0.00028052737,0.0003859096,0.00083736994,0.0014310322,0.00029637967,0.0027812237,0.00022039749,0.0042946227],"category_scores_gemma":[0.000052346168,0.00027046216,0.00033534775,0.0018894669,0.0013662996,0.0004940402,0.0011880194,0.0010596052,0.0019153903],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002066942,0.0036184185,0.0052504223,0.0028130647,0.0031726898,0.0070167226,0.5873402,0.006433823,0.014119161,0.18814918,0.05884023,0.12117918],"study_design_scores_gemma":[0.004210637,0.0011324785,0.0009513614,0.0037915015,0.00018574022,0.00008923327,0.5629145,0.3481433,0.00032931127,0.05336171,0.023004852,0.0018853584],"about_ca_topic_score_codex":0.00196462,"about_ca_topic_score_gemma":0.0008684262,"teacher_disagreement_score":0.3417095,"about_ca_system_score_codex":0.00010746287,"about_ca_system_score_gemma":0.00066064455,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W4412375049","doi":"10.1109/tsipn.2025.3587399","title":"An ADMM-Based Approach to Quadratically-Regularized Distributed Optimal Transport on Graphs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Computer science; Mathematics; Regularization (linguistics); Mathematical optimization; Econometrics; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.008588321185572597,"score_gpt":0.2394253606992774,"score_spread":0.2308370395137048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095878367,0.0000074674426,0.9963338,0.00042255895,0.000114485316,0.00040121353,0.000016924776,0.00025356602,0.0014912434],"genre_scores_gemma":[0.9550873,0.0000068082322,0.040977903,0.003684736,0.0000100157085,0.000097651246,0.00006774326,0.0000067686055,0.00006109057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985475,0.00006420802,0.00044520065,0.00028537697,0.00035900628,0.00029873545],"domain_scores_gemma":[0.9992,0.000051198494,0.00008098518,0.0002543416,0.00019268967,0.00022082741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063369,0.00021119801,0.0002015644,0.00039078883,0.00050753605,0.000508986,0.00034113467,0.00014248001,0.000023724737],"category_scores_gemma":[0.0000025582594,0.00018716817,0.000069957925,0.0011909243,0.00006391365,0.0026393544,0.000002063395,0.00031899838,0.0000054425823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001592007,0.00022683958,0.0000056029126,0.000045322045,0.000014281504,2.9160165e-7,0.00029789706,0.9420684,0.000025655947,0.0059898184,0.0001072312,0.051059455],"study_design_scores_gemma":[0.0009310763,0.0002485272,0.00020065632,0.000098721415,0.000014759419,0.0000011706511,0.000037133006,0.99678236,0.0006149361,0.00014618311,0.00071341096,0.00021108135],"about_ca_topic_score_codex":0.0000057044354,"about_ca_topic_score_gemma":0.0000013784073,"teacher_disagreement_score":0.9553559,"about_ca_system_score_codex":0.00004247407,"about_ca_system_score_gemma":0.00017072688,"threshold_uncertainty_score":0.7632497},"labels":[],"label_agreement":null},{"id":"W4412398761","doi":"10.1109/icccs65393.2025.11069970","title":"Comparative Analysis of Shortest-Path Algorithms in Network Routing","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Computer science; Shortest path problem; K shortest path routing; Routing (electronic design automation); Path (computing); Equal-cost multi-path routing; Routing algorithm; Link-state routing protocol; Algorithm; Routing protocol; Computer network; Theoretical computer science; Graph","score_opus":0.03011207326568078,"score_gpt":0.3251645753135578,"score_spread":0.29505250204787703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412398761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015036385,0.000035296925,0.9541558,0.00024225864,0.00004653079,0.000090099835,5.0073567e-7,0.00003695269,0.0438889],"genre_scores_gemma":[0.8394722,0.000007288556,0.15961635,0.00020495232,0.0000044879607,0.0000047229846,0.00000333702,7.288891e-7,0.0006859288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920976,0.00007724143,0.000242051,0.00018561487,0.00012401257,0.0001613087],"domain_scores_gemma":[0.99949324,0.00012976538,0.00004247516,0.0002199609,0.00008743746,0.00002712515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037825367,0.000055112454,0.00023470257,0.00030016107,0.000036222264,0.000045230816,0.0003385778,0.000023653962,0.00003279303],"category_scores_gemma":[0.000015009898,0.0000480059,0.000052585186,0.0043823244,0.000021484913,0.00014063371,0.0001506271,0.000068027075,0.0000023156958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011048465,0.000044392993,0.031872544,0.0000015250228,0.00013163252,0.0000010468898,0.00073244714,0.78850144,0.000008997121,0.17524669,0.00041990922,0.003038279],"study_design_scores_gemma":[0.00009464178,0.000011392151,0.025436917,0.000011788302,0.000015211537,4.296125e-8,0.00006497707,0.9734655,0.000052990177,0.0007152631,0.000087017834,0.000044252505],"about_ca_topic_score_codex":0.000103879676,"about_ca_topic_score_gemma":0.0001890314,"teacher_disagreement_score":0.8379686,"about_ca_system_score_codex":0.000020410043,"about_ca_system_score_gemma":0.000057373327,"threshold_uncertainty_score":0.21055616},"labels":[],"label_agreement":null},{"id":"W4412508555","doi":"10.1609/socs.v18i1.35996","title":"Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Psychology; Sociology","score_opus":0.03636055977328928,"score_gpt":0.3097754427812473,"score_spread":0.273414883007958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6934779,0.0001404066,0.02647291,0.16106825,0.008240982,0.0040335823,0.00013917664,0.00019018327,0.10623661],"genre_scores_gemma":[0.99762833,0.000081575505,0.0008259116,0.0002289241,0.000064006534,0.000043363812,0.000004323396,0.000008149507,0.0011154203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99826163,0.0000254414,0.00033058942,0.0002743987,0.00089054316,0.00021740151],"domain_scores_gemma":[0.997924,0.00024700628,0.000100175945,0.0001337902,0.0015422989,0.0000527483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016503136,0.00010753599,0.00016434967,0.00023175923,0.00016773287,0.00016634645,0.0012881577,0.00007333733,0.000011468497],"category_scores_gemma":[0.00018750913,0.00008844775,0.000081929495,0.00031251047,0.00009407525,0.00035817322,0.0007073364,0.00016026743,8.7973643e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010017792,0.00015616589,0.0018692156,0.00011102896,0.00004823319,6.1306004e-8,0.00048464228,0.000050487975,0.012726319,0.98239547,0.0010298796,0.0010283444],"study_design_scores_gemma":[0.006848825,0.0010905954,0.0032680933,0.0007294063,0.000038032507,0.0000041722406,0.00060801493,0.25944215,0.5649211,0.1509672,0.011694538,0.0003878898],"about_ca_topic_score_codex":0.000019976984,"about_ca_topic_score_gemma":4.4869049e-7,"teacher_disagreement_score":0.83142823,"about_ca_system_score_codex":0.000094696894,"about_ca_system_score_gemma":0.00015545558,"threshold_uncertainty_score":0.36067945},"labels":[],"label_agreement":null},{"id":"W4412742899","doi":"10.1109/rait65068.2025.11089067","title":"Convex Hull and Incremental Insertion for a TSP Solution","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Convex hull; Regular polygon; Hull; Computer science; Mathematical optimization; Mathematics; Materials science; Geometry; Composite material","score_opus":0.019062847512279234,"score_gpt":0.28713866223568063,"score_spread":0.2680758147234014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412742899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043686624,0.000025299778,0.9853413,0.0035130768,0.00008186119,0.0002216308,4.6746342e-7,0.00007132303,0.006376339],"genre_scores_gemma":[0.85244846,0.000023687577,0.14170317,0.0019503911,0.000009717885,0.000042010324,0.0000059318513,0.0000019344493,0.0038147008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965155,0.000015655776,0.00007384368,0.00012066857,0.00005295422,0.000085303036],"domain_scores_gemma":[0.999814,0.00002421703,0.000011945059,0.00007995312,0.000046309033,0.000023580515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015065786,0.000032195687,0.000039029634,0.000059279773,0.00008828759,0.00007833427,0.00009369769,0.000020482752,0.000012248526],"category_scores_gemma":[0.000017631515,0.000028864946,0.000011352369,0.00011718804,0.000014967271,0.00021649677,0.00008430229,0.000021492722,0.0000042614147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016603955,0.00006555587,0.0013351499,0.00004824866,0.000015364702,2.354987e-7,0.00029007648,0.0001229083,0.010804799,0.92135227,0.013187508,0.052761294],"study_design_scores_gemma":[0.0006265458,0.00006897756,0.0013513495,0.000009811515,0.0000016420184,6.7878824e-7,0.000024614243,0.9802678,0.0032001259,0.006857532,0.0075351284,0.00005577344],"about_ca_topic_score_codex":0.000026972195,"about_ca_topic_score_gemma":0.00001673729,"teacher_disagreement_score":0.9801449,"about_ca_system_score_codex":0.000017133847,"about_ca_system_score_gemma":0.000029710953,"threshold_uncertainty_score":0.11770783},"labels":[],"label_agreement":null},{"id":"W4412791354","doi":"10.1016/j.jcss.2025.103696","title":"Exploring wedges of an oriented grid by an automaton with pebbles","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Grid; Automaton; Computer science; Cellular automaton; Theoretical computer science; Mathematics; Algorithm; Geometry","score_opus":0.042991125658790104,"score_gpt":0.2750190246847915,"score_spread":0.2320278990260014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34480506,0.00017608222,0.6537928,0.00021864475,0.0005328091,0.00006520158,8.28277e-7,0.000031619507,0.0003769813],"genre_scores_gemma":[0.8989145,0.000035882,0.10092496,0.00004106405,0.000060051072,0.0000016210792,2.9185912e-7,0.0000021645924,0.00001945676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866414,0.0001611757,0.00038553594,0.00019127326,0.00044466346,0.00015318916],"domain_scores_gemma":[0.9991348,0.00006309887,0.00024783047,0.00015366354,0.0002776674,0.00012294138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001122794,0.00008829121,0.0002381267,0.00030162887,0.00019451688,0.00031427213,0.00068626343,0.00001884781,7.466489e-7],"category_scores_gemma":[0.0000046663245,0.000055664204,0.000028001634,0.0006225176,0.00013322297,0.0022797543,0.0000882422,0.000071507035,2.0345068e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019978118,0.0014294523,0.041161448,0.001761519,0.00034860024,0.000165213,0.027054368,0.13839816,0.0037573737,0.45271435,0.0046881596,0.32832158],"study_design_scores_gemma":[0.00066219695,0.001906805,0.0038050015,0.00068111374,0.000008907299,0.00021010016,0.0014295127,0.98820835,0.002027018,0.0001247154,0.00079482084,0.0001414268],"about_ca_topic_score_codex":0.000012638406,"about_ca_topic_score_gemma":0.000002821901,"teacher_disagreement_score":0.84981024,"about_ca_system_score_codex":0.000015786254,"about_ca_system_score_gemma":0.00016172622,"threshold_uncertainty_score":0.30305335},"labels":[],"label_agreement":null},{"id":"W4412791763","doi":"10.1016/j.jcss.2025.103695","title":"Triangle evacuation of 2 agents in the wireless model &amp; the power of choosing a starting point","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Computer science; Point (geometry); Power (physics); Power point; Mathematical economics; Mathematics; Telecommunications; Physics","score_opus":0.06209018673215274,"score_gpt":0.32834209363200356,"score_spread":0.26625190689985084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412791763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20943871,0.00015455062,0.78808993,0.001439699,0.00016376427,0.000112469286,3.1898742e-7,0.000002553687,0.00059800793],"genre_scores_gemma":[0.9820668,0.000010500748,0.017730877,0.00016464983,0.000012675663,7.9135344e-7,4.285712e-8,7.8576585e-7,0.000012877303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984925,0.00030053302,0.0005537703,0.00009111092,0.00046094297,0.00010118178],"domain_scores_gemma":[0.9990201,0.00022973277,0.00040430418,0.00013091319,0.0001947321,0.000020239735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004742281,0.00005101149,0.00018047635,0.00020965862,0.00012659386,0.00016563549,0.00073330273,0.000017120741,7.619235e-7],"category_scores_gemma":[0.000027364322,0.000025102425,0.000053116324,0.00063023856,0.00008268677,0.00038512697,0.0000950605,0.00008052753,1.2465462e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042193435,0.00023781855,0.007231602,0.00032276937,0.000059651033,0.0000057247626,0.059550267,0.7605505,0.00089186244,0.1368627,0.0025018426,0.031743065],"study_design_scores_gemma":[0.00028547528,0.000076581826,0.0015594788,0.00032844706,0.000003305704,0.00001154708,0.000846329,0.9954882,0.00007181819,0.001277514,0.000024240626,0.00002701619],"about_ca_topic_score_codex":0.000011755596,"about_ca_topic_score_gemma":0.000004497993,"teacher_disagreement_score":0.77262807,"about_ca_system_score_codex":0.000016812479,"about_ca_system_score_gemma":0.00015195526,"threshold_uncertainty_score":0.16435894},"labels":[],"label_agreement":null},{"id":"W4412965319","doi":"10.15803/ijnc.15.2_199","title":"Asynchronous Separation of Unconscious Colored Robots","year":2025,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Colored; Asynchronous communication; Unconscious mind; Separation (statistics); Robot; Artificial intelligence; Machine learning; Computer network; Psychology","score_opus":0.010477545434982735,"score_gpt":0.3124047701585097,"score_spread":0.30192722472352695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412965319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02932284,0.0005483396,0.966029,0.0010896394,0.0015374343,0.00003934215,1.8418376e-7,0.000015005624,0.0014182504],"genre_scores_gemma":[0.95280993,0.000094759904,0.046686262,0.0001821371,0.00019615867,2.0164649e-7,5.7807875e-7,0.0000020555965,0.00002789397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.000074927426,0.00040597824,0.00009269368,0.0002461059,0.000094749244],"domain_scores_gemma":[0.99882793,0.0002474275,0.00034271268,0.00006557649,0.00048327996,0.000033064985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057020434,0.00005798618,0.00013619459,0.00019336445,0.00006102001,0.00012985663,0.00043485436,0.000033264663,0.0000015841221],"category_scores_gemma":[0.000050952087,0.000053553067,0.000046470737,0.00018871625,0.00003173648,0.00016370333,0.00015668836,0.0001274814,3.5670854e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041885196,0.00008714647,0.008658541,0.000015516096,0.00022687811,0.00003029985,0.0010481181,0.54435885,0.00051752734,0.03475886,0.0010455472,0.40921083],"study_design_scores_gemma":[0.0006292355,0.00009000049,0.0024535207,0.00032779848,0.0000069419766,0.000083646,0.000036586203,0.9893035,0.0002180608,0.0052863127,0.0014998565,0.0000645336],"about_ca_topic_score_codex":0.0000046632563,"about_ca_topic_score_gemma":0.000002375192,"teacher_disagreement_score":0.9234871,"about_ca_system_score_codex":0.000043298583,"about_ca_system_score_gemma":0.00012384106,"threshold_uncertainty_score":0.21838307},"labels":[],"label_agreement":null},{"id":"W4413325089","doi":"10.1016/j.econmod.2025.107260","title":"Searching for robots","year":2025,"lang":"en","type":"article","venue":"Economic Modelling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Economics; Robot; Keynesian economics; Mathematical economics; Econometrics; Computer science; Artificial intelligence","score_opus":0.03561935950339513,"score_gpt":0.29380893291628035,"score_spread":0.25818957341288523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413325089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000573986,0.000042795673,0.9848229,0.0012890381,0.00024633342,0.00017626958,7.4463793e-7,0.00007721966,0.012770675],"genre_scores_gemma":[0.19992279,0.000042757245,0.795274,0.0004580992,0.000051681138,0.000042684747,0.0000032708397,0.0000070806395,0.004197637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942726,0.000015189521,0.00013800642,0.00021809264,0.000026020341,0.00017543808],"domain_scores_gemma":[0.9996211,0.00009023623,0.00002277269,0.0002100092,0.000018941482,0.00003695716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031446002,0.000051166924,0.00007723117,0.000099869154,0.00012900632,0.00016780575,0.00036966143,0.000023390741,0.00000945079],"category_scores_gemma":[0.0000051486727,0.00005538983,0.000040603023,0.000048159804,0.0000088218685,0.00027080718,0.00008976293,0.00005537256,0.000033814948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5282534e-7,0.0000025061813,0.000005657896,0.000005487318,0.0000038000383,5.0127632e-8,0.00007232735,0.64024246,0.0000050973267,0.35390833,0.00019886137,0.005554573],"study_design_scores_gemma":[0.00015864185,0.000005861849,0.0000010042893,0.000010071963,7.207712e-7,1.8830444e-7,0.0000043019554,0.94320357,0.00013595761,0.050160404,0.006267797,0.000051509596],"about_ca_topic_score_codex":0.000018999363,"about_ca_topic_score_gemma":0.0000031385337,"teacher_disagreement_score":0.30374792,"about_ca_system_score_codex":0.000052920754,"about_ca_system_score_gemma":0.00009774772,"threshold_uncertainty_score":0.22587317},"labels":[],"label_agreement":null},{"id":"W4413374224","doi":"10.1007/978-3-031-99872-0_2","title":"Cache Management for Mixture-of-Experts LLMs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for International Peace and Security","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Cache; Parallel computing","score_opus":0.019212463666271575,"score_gpt":0.2709219489793063,"score_spread":0.2517094853130348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413374224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.553884e-7,0.00035719396,0.9810578,0.0011158596,0.0012906762,0.00089748285,0.0000068289705,0.00009292715,0.01518023],"genre_scores_gemma":[0.0027901598,0.00012045183,0.99071884,0.0015979684,0.00011914447,0.000040117895,0.000009033022,0.000018761699,0.004585493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714077,0.000024210116,0.0004801829,0.0011327001,0.0007151544,0.0005069771],"domain_scores_gemma":[0.9978341,0.000374497,0.00019799001,0.0011565142,0.0003237733,0.000113152404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072113395,0.0003523673,0.0004275222,0.0009185556,0.00017288576,0.00026881276,0.003041363,0.0002190869,0.000015982185],"category_scores_gemma":[0.00005494632,0.0003144198,0.00015208522,0.0006074786,0.00035061326,0.0002963304,0.0012587113,0.00027742438,0.0000050768394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059547788,0.000036596553,0.000010293237,0.00019811446,0.000023580033,0.000014669636,0.0005271946,0.040945247,0.000024584308,0.20240772,0.00038649514,0.75541955],"study_design_scores_gemma":[0.00044658358,0.00015857052,0.0000118248545,0.00054673594,0.000009851247,0.0000044437948,2.6300532e-7,0.8336589,0.0010195045,0.14412253,0.019550445,0.00047035777],"about_ca_topic_score_codex":0.0000065441327,"about_ca_topic_score_gemma":0.000015665297,"teacher_disagreement_score":0.79271364,"about_ca_system_score_codex":0.00015413635,"about_ca_system_score_gemma":0.00034357127,"threshold_uncertainty_score":0.9999308},"labels":[],"label_agreement":null},{"id":"W4413857336","doi":"10.1007/978-3-032-03639-1_21","title":"Near-Linear MIR Algorithms for Stochastically-Ordered Priors","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Prior probability; Algorithm; Artificial intelligence; Bayesian probability","score_opus":0.02605732205500774,"score_gpt":0.29284712628223464,"score_spread":0.2667898042272269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413857336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019595498,0.00017064327,0.99173075,0.0027759762,0.0015346928,0.0011961168,0.00001778053,0.00023310457,0.0023389715],"genre_scores_gemma":[0.0007362521,0.00002677177,0.99420446,0.0022114627,0.0002440981,0.00004155806,0.000015273336,0.000030612802,0.0024895389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959214,0.00003370174,0.00060223456,0.001662816,0.00093717495,0.00084268773],"domain_scores_gemma":[0.9967667,0.0008612936,0.00019895147,0.0012691183,0.0006531615,0.00025079117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009442806,0.0005101527,0.00055915484,0.0006748981,0.00046452595,0.00081728597,0.003488687,0.0003746995,0.00003004057],"category_scores_gemma":[0.0003349955,0.0004739673,0.00017915382,0.0007933427,0.00075060426,0.0004474424,0.0013775066,0.0007131276,0.000030818428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013069701,0.00005203017,0.000004629363,0.000104477615,0.000021447837,0.000021817315,0.00059928367,0.23465668,0.000026328298,0.06645515,0.00021475345,0.6978303],"study_design_scores_gemma":[0.00046230486,0.00021083323,0.0000058533224,0.0002515119,0.0000062753325,0.000010636482,1.02366506e-7,0.92982006,0.00012396327,0.060279056,0.008357897,0.0004714899],"about_ca_topic_score_codex":0.000011106468,"about_ca_topic_score_gemma":0.00002368372,"teacher_disagreement_score":0.69735885,"about_ca_system_score_codex":0.00021917872,"about_ca_system_score_gemma":0.001638609,"threshold_uncertainty_score":0.9997712},"labels":[],"label_agreement":null},{"id":"W4414646315","doi":"10.1007/978-3-032-06706-7_14","title":"Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Competitive analysis; Bipartite graph; Vertex (graph theory); Hopcroft–Karp algorithm; Degree (music); Cardinality (data modeling); Online algorithm; Graph","score_opus":0.028306919491313427,"score_gpt":0.2735100315596817,"score_spread":0.24520311206836826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414646315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025173304,0.00013650366,0.9964434,0.0010607619,0.0005822201,0.0007492302,0.0000403986,0.00006549543,0.0008968439],"genre_scores_gemma":[0.0017913093,0.00003722365,0.9969296,0.00081960513,0.000090666304,0.000022356367,0.000019914925,0.000019764071,0.00026956442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693745,0.000024978224,0.0005725027,0.0010972105,0.00086457387,0.00050327985],"domain_scores_gemma":[0.99768084,0.0006431419,0.0003001427,0.0007839184,0.00048097913,0.0001109819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007374282,0.00038277937,0.00054336444,0.0013613901,0.00013868623,0.00020400221,0.002285686,0.00023594822,0.000014603707],"category_scores_gemma":[0.00006110246,0.0003239632,0.000116914605,0.000965932,0.00047712884,0.0005271534,0.00065836246,0.0006464562,0.0000020913244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011148871,0.00009763159,0.00016789178,0.000077166274,0.000016425736,0.00001625346,0.00023417597,0.043813948,0.000013064533,0.0274992,0.000030842068,0.92802227],"study_design_scores_gemma":[0.00049277215,0.00018890739,0.00025795528,0.0004841256,0.0000041608782,0.000012615458,1.9736267e-7,0.7099964,0.000108069085,0.2876555,0.0005082858,0.00029100224],"about_ca_topic_score_codex":0.000055619057,"about_ca_topic_score_gemma":0.0005349558,"teacher_disagreement_score":0.9277313,"about_ca_system_score_codex":0.00014982754,"about_ca_system_score_gemma":0.0009240592,"threshold_uncertainty_score":0.99992126},"labels":[],"label_agreement":null},{"id":"W4414942510","doi":"10.1146/annurev-control-022624-033840","title":"On Operator Theory and Applications in Game Theory","year":2025,"lang":"en","type":"article","venue":"Annual Review of Control Robotics and Autonomous Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Game theory; Focus (optics); Convergence (economics); Operator (biology); Algorithmic game theory; Symbolic convergence theory","score_opus":0.005322821630489083,"score_gpt":0.264844566113749,"score_spread":0.25952174448325993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414942510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004435618,0.111008786,0.88256043,0.0010508752,0.00008629337,0.0012554554,0.000015351332,0.000029693587,0.003948743],"genre_scores_gemma":[0.9682702,0.026212852,0.0009111046,0.003082837,0.000023471777,0.00022444366,0.0000046713726,0.000009931712,0.0012604758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986891,0.00040867162,0.00041165354,0.00023663226,0.00010600019,0.00014791508],"domain_scores_gemma":[0.9987671,0.00062901154,0.000102324455,0.00030226816,0.00013907441,0.000060268507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017104757,0.00011293265,0.00039005216,0.00010774466,0.00005468945,0.0000750658,0.00025676622,0.000042276326,0.0000017863317],"category_scores_gemma":[0.00015696383,0.00008541555,0.00003441546,0.00025585268,0.00006135187,0.00012278608,0.000071662034,0.000093955874,0.0000027396707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040800087,0.00003619702,0.000050172945,0.0010825123,0.000016142785,6.0218247e-7,0.00010811896,0.004205305,0.000003884475,0.9801323,0.000060586175,0.014300113],"study_design_scores_gemma":[0.00833403,0.0012523163,0.0031285938,0.040377934,0.00026450606,0.000035889698,0.0013445403,0.5627954,0.00004380714,0.22165202,0.15907623,0.0016947186],"about_ca_topic_score_codex":0.000007001047,"about_ca_topic_score_gemma":9.954078e-7,"teacher_disagreement_score":0.96822584,"about_ca_system_score_codex":0.000017469536,"about_ca_system_score_gemma":0.0001053635,"threshold_uncertainty_score":0.34831452},"labels":[],"label_agreement":null},{"id":"W4415100966","doi":"10.48550/arxiv.2503.08833","title":"Randomization in Optimal Execution Games","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nash equilibrium; Uniqueness; Simple (philosophy); Kernel (algebra); Backward induction; Best response; Regular polygon; Sample (material)","score_opus":0.036252964613442726,"score_gpt":0.29393324101778445,"score_spread":0.2576802764043417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415100966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060635105,0.0002486205,0.9302268,0.0019409464,0.0008563263,0.00072684156,0.0000054661623,0.00024995176,0.0051099667],"genre_scores_gemma":[0.9273262,0.0009749559,0.064169616,0.0007973976,0.00013245262,0.00027973374,0.00014149076,0.0000185683,0.0061595677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819934,0.00024029108,0.00041666822,0.00061452936,0.00024980502,0.000279389],"domain_scores_gemma":[0.9988833,0.00009411949,0.0001442656,0.0006516153,0.00015853715,0.00006814392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058453565,0.0002024726,0.00030850395,0.0003862131,0.00007007354,0.0001744075,0.0008778074,0.00023860153,0.00004031985],"category_scores_gemma":[0.0001755354,0.0002054352,0.00009990168,0.00050592056,0.000037363956,0.0003208848,0.0011201085,0.00049021747,0.00005803015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113397815,0.00025212424,0.07714509,0.00026327424,0.000058606845,0.00002374711,0.0024550185,0.8898717,0.0001230069,0.015475376,0.0024628048,0.011755823],"study_design_scores_gemma":[0.0033800527,0.000032270433,0.024297712,0.00036906393,0.000011330541,0.0000018531557,0.00003051626,0.96652925,0.0006768533,0.0016068354,0.002640312,0.00042395372],"about_ca_topic_score_codex":0.00007145302,"about_ca_topic_score_gemma":0.000018176846,"teacher_disagreement_score":0.8666911,"about_ca_system_score_codex":0.000115661554,"about_ca_system_score_gemma":0.00030764233,"threshold_uncertainty_score":0.8377404},"labels":[],"label_agreement":null},{"id":"W4416063924","doi":"10.4230/lipics.stacs.2026.44","title":"Optimal Average Disk-Inspection via Fermat's Principle","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Optimal control; Discretization; Limit (mathematics); Trajectory; Heuristic; Limiting; Unit disk; Upper and lower bounds","score_opus":0.03729664457265921,"score_gpt":0.3010501199671265,"score_spread":0.2637534753944673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416063924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07769618,0.00009150169,0.90797096,0.0015534268,0.0017818209,0.0005898588,0.000013520791,0.0010496493,0.009253065],"genre_scores_gemma":[0.9368069,0.0002549068,0.05262168,0.00068338885,0.00025810793,0.00015050516,0.000090501,0.000026824206,0.009107189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976381,0.00016007622,0.00043794056,0.0009127601,0.0004081785,0.00044295756],"domain_scores_gemma":[0.9980449,0.000055904442,0.0001972032,0.0013145563,0.00021593072,0.00017147171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036167973,0.00032255633,0.00032730392,0.00026173747,0.00029795835,0.00035159956,0.001538579,0.00028121486,0.000088563465],"category_scores_gemma":[0.0000641228,0.00032605536,0.0001823661,0.00043543876,0.000061092345,0.00044485243,0.0030098578,0.00087019434,0.00034919186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003788351,0.00069927995,0.11005389,0.0007478219,0.00029952062,0.00012035453,0.0032429912,0.83929265,0.00051116344,0.030509027,0.005052186,0.0094332285],"study_design_scores_gemma":[0.0004849549,0.000060440147,0.041670058,0.0001702862,0.000016881215,0.000010835284,0.000011022423,0.93893903,0.0013204941,0.00094912323,0.01575602,0.00061083096],"about_ca_topic_score_codex":0.00007550089,"about_ca_topic_score_gemma":0.000014482499,"teacher_disagreement_score":0.8591107,"about_ca_system_score_codex":0.00020215003,"about_ca_system_score_gemma":0.00030756532,"threshold_uncertainty_score":0.9999192},"labels":[],"label_agreement":null},{"id":"W4416288730","doi":"10.1007/978-3-032-11127-2_18","title":"On the Computational Power of Mobile Robots Under Sequential Schedulers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Robot; Mobile robot; Computational complexity theory; Scheduling (production processes); Sequence (biology); Permutation (music); Base (topology)","score_opus":0.022083914878658746,"score_gpt":0.27467391144287007,"score_spread":0.2525899965642113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416288730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004205893,0.000095854506,0.9885791,0.0020696402,0.0009368118,0.00050742185,0.0000065931395,0.00006783812,0.00769467],"genre_scores_gemma":[0.36402932,0.000031386662,0.6264033,0.007656585,0.00011824819,0.00003261376,0.000014842805,0.00003430703,0.0016794368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701506,0.00007078233,0.00046812542,0.0008894216,0.0011598008,0.00039678926],"domain_scores_gemma":[0.99725753,0.0010664304,0.00023593089,0.0009387141,0.00040828926,0.00009311481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084703596,0.0003264124,0.00034507422,0.00066849735,0.00024438614,0.0003225311,0.0026833839,0.00019488498,0.00013287058],"category_scores_gemma":[0.00008137676,0.00024195471,0.00013406774,0.0007236543,0.00081285025,0.00026875432,0.00095484173,0.0006583721,0.000029160828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025362997,0.000020690277,0.0000017842287,0.000009422367,0.000009751507,0.0000034498646,0.00020160039,0.66238946,0.000010306813,0.32184538,0.00007855532,0.015427085],"study_design_scores_gemma":[0.0001709951,0.00013901916,0.000017823992,0.00022791109,0.0000028383013,0.0000054515117,3.4474033e-7,0.7152937,0.00021651828,0.2835163,0.00019044436,0.00021866843],"about_ca_topic_score_codex":0.0000074717045,"about_ca_topic_score_gemma":0.0000074845084,"teacher_disagreement_score":0.36398727,"about_ca_system_score_codex":0.00017823584,"about_ca_system_score_gemma":0.0010229817,"threshold_uncertainty_score":0.9866627},"labels":[],"label_agreement":null},{"id":"W4416309400","doi":"10.1007/978-3-032-09120-8_11","title":"Linear Search for Capturing an Oblivious Mobile Target in the Sender/Receiver Model","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Communication source; Mobile robot; Competitive analysis; Motion (physics); Search and rescue; Search algorithm","score_opus":0.0357485961633655,"score_gpt":0.2959106557265032,"score_spread":0.2601620595631377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416309400","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050146653,0.00016532298,0.994899,0.0008851007,0.00042794022,0.0013259993,0.000016485163,0.00010026597,0.0021297908],"genre_scores_gemma":[0.079924785,0.00007310489,0.91523814,0.0033106068,0.00024031094,0.00010978522,0.000025433335,0.000032680593,0.0010451691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963992,0.000093856775,0.0004423487,0.0013470863,0.0009465082,0.000770995],"domain_scores_gemma":[0.9976215,0.000603049,0.000101182246,0.001274785,0.00026759552,0.00013190955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019892785,0.0003911801,0.00038324183,0.00094803615,0.0003359518,0.000643737,0.004299599,0.00026883447,0.000008449691],"category_scores_gemma":[0.00004867094,0.0003046825,0.000113535345,0.0007890361,0.00036216187,0.00070714415,0.000907696,0.000947072,0.0000062642257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043420064,0.000041237992,0.000009834907,0.00004089005,0.0000035789767,0.000013743684,0.0034985654,0.89984435,0.000014061503,0.01541586,0.00003036759,0.08108316],"study_design_scores_gemma":[0.0002795758,0.00014318961,0.0000069093358,0.00012639251,0.000002332042,0.000010060143,0.0000016105266,0.95060223,0.00021654251,0.047737822,0.00054567185,0.0003276905],"about_ca_topic_score_codex":0.000040656203,"about_ca_topic_score_gemma":0.00010469118,"teacher_disagreement_score":0.08075547,"about_ca_system_score_codex":0.00021292843,"about_ca_system_score_gemma":0.0008909836,"threshold_uncertainty_score":0.9999405},"labels":[],"label_agreement":null},{"id":"W4416339503","doi":"10.48550/arxiv.2511.10792","title":"$\\rm{A}^{\\rm{SAR}}$: $\\varepsilon$-Optimal Graph Search for Minimum Expected-Detection-Time Paths with Path Budget Constraints for Search and Rescue (SAR)","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Incremental heuristic search; Beam search; Probabilistic logic; Search algorithm; Best-first search; Search and rescue; Heuristic; Path (computing); Graph; Local search (optimization)","score_opus":0.04008118726032491,"score_gpt":0.29253745974341944,"score_spread":0.25245627248309455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416339503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2543525,0.0004441516,0.7305691,0.0021379993,0.0010196423,0.009243767,0.001200101,0.00044425207,0.0005884169],"genre_scores_gemma":[0.7317888,0.0009334154,0.25434175,0.00073802145,0.00058053917,0.0017219933,0.00054537604,0.00024818434,0.009101935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9876129,0.0010590721,0.0019812493,0.004716629,0.0016965037,0.0029336389],"domain_scores_gemma":[0.9897981,0.0018312827,0.0004127568,0.0027554317,0.0039382502,0.0012641704],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0038039654,0.0016429353,0.0018839912,0.0015353695,0.002202543,0.0015377803,0.0028544115,0.0012317045,0.00027446565],"category_scores_gemma":[0.00058068056,0.0015998264,0.00077579985,0.002077888,0.0020941424,0.0009960819,0.002858255,0.0022609227,0.00008778968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017104005,0.009628884,0.09786559,0.024932075,0.010545612,0.00072244206,0.08300369,0.41497046,0.027219782,0.0205207,0.008130311,0.28535646],"study_design_scores_gemma":[0.01018713,0.005104441,0.004928739,0.0019784959,0.0003211706,0.00015582386,0.0022209205,0.9503496,0.017778859,0.0006942507,0.0030952704,0.00318529],"about_ca_topic_score_codex":0.00031628832,"about_ca_topic_score_gemma":0.00007674534,"teacher_disagreement_score":0.5353792,"about_ca_system_score_codex":0.00037379054,"about_ca_system_score_gemma":0.0033211438,"threshold_uncertainty_score":0.99963176},"labels":[],"label_agreement":null},{"id":"W4417507764","doi":"10.1080/00207721.2025.2602076","title":"Approximate message passing algorithm for decentralised task assignment and scheduling","year":2025,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Gyeonggi-do Regional Research Center; National Research Foundation of Korea","keywords":"Scheduling (production processes); Message passing; Task (project management); Job shop scheduling; Fair-share scheduling; Rate-monotonic scheduling","score_opus":0.01732953082634017,"score_gpt":0.3076323307883267,"score_spread":0.29030279996198655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417507764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001114,0.0003068106,0.99340945,0.0019007957,0.002721248,0.00016926732,0.000003126598,0.00001533532,0.00035998833],"genre_scores_gemma":[0.6737586,0.000080965125,0.32567436,0.00020591058,0.00012382516,0.000009415971,4.9292606e-7,0.0000034934756,0.00014292338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983377,0.00004161205,0.00042498,0.00020398895,0.00078728126,0.00020444396],"domain_scores_gemma":[0.9982962,0.000115530915,0.00029316943,0.000116368785,0.0010673476,0.00011140867],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019056337,0.000077349505,0.00013600629,0.000409379,0.00018179734,0.0011259968,0.0012154251,0.00002515031,0.0000011017079],"category_scores_gemma":[0.00016474647,0.00006304304,0.000042854877,0.00035366576,0.00013942602,0.0012064921,0.00018858485,0.00008919347,5.641243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046731955,0.0003462432,0.0017494954,0.00014333794,0.0003158024,0.000086937835,0.0024667545,0.097096846,0.07363671,0.37659457,0.0013490295,0.44616753],"study_design_scores_gemma":[0.0006791825,0.00003946734,0.00015911856,0.00028570596,0.0000042060187,0.00007370879,0.0001448646,0.99334574,0.0020367478,0.0013702053,0.001787254,0.0000738025],"about_ca_topic_score_codex":0.0000059580957,"about_ca_topic_score_gemma":1.9798105e-7,"teacher_disagreement_score":0.8962489,"about_ca_system_score_codex":0.0001797774,"about_ca_system_score_gemma":0.00041092487,"threshold_uncertainty_score":0.99991095},"labels":[],"label_agreement":null},{"id":"W54874128","doi":"10.1007/978-3-642-35476-2_9","title":"Tree Exploration by a Swarm of Mobile Agents","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Swarm behaviour; Overhead (engineering); Tree (set theory); Node (physics); Computer science; Range (aeronautics); Mathematical optimization; K-ary tree; Algorithm; Path (computing); Tree structure; Topology (electrical circuits); Mathematics; Combinatorics; Artificial intelligence; Computer network; Binary tree; Engineering","score_opus":0.034696201713548855,"score_gpt":0.2732626250365877,"score_spread":0.23856642332303885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W54874128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024361676,0.0006303014,0.9939011,0.00029415629,0.0007079994,0.00046198827,0.0000063166485,0.00008465082,0.0038891772],"genre_scores_gemma":[0.19189592,0.0007056023,0.8030826,0.0015758664,0.0004122573,0.00007360164,0.000046377052,0.00006878076,0.0021389995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972406,0.00004019449,0.0004898473,0.00078306434,0.0009661685,0.00048010916],"domain_scores_gemma":[0.9981852,0.00016383671,0.0002997751,0.0009122694,0.00026076598,0.00017813258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007450655,0.0003097798,0.00037270156,0.0005374961,0.00012172205,0.00021984095,0.002115987,0.00021012366,0.00006254511],"category_scores_gemma":[0.00003700822,0.00028381744,0.00008864324,0.0005393076,0.0003814602,0.0011931916,0.0007824291,0.00038209406,0.00004848512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032561554,0.00007786678,0.000024615783,0.000042021547,0.000008822113,0.0000051326447,0.002039765,0.057372954,0.00034509585,0.007701184,0.00035229293,0.932027],"study_design_scores_gemma":[0.00041549353,0.00034524896,0.000017858527,0.00024225561,0.0000069500234,0.0000121788335,5.411048e-7,0.93686324,0.007701876,0.04421941,0.0095370645,0.0006378668],"about_ca_topic_score_codex":0.000011578711,"about_ca_topic_score_gemma":0.000014326891,"teacher_disagreement_score":0.93138915,"about_ca_system_score_codex":0.00011263621,"about_ca_system_score_gemma":0.000263818,"threshold_uncertainty_score":0.9999614},"labels":[],"label_agreement":null},{"id":"W599153350","doi":"10.1016/j.jpdc.2015.06.004","title":"Tradeoffs between cost and information for rendezvous and treasure hunt","year":2015,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Rendezvous; Treasure; Computer science; Traverse; Advice (programming); Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Node (physics); A priori and a posteriori; Situated; Network topology; Topology (electrical circuits); Combinatorics; Computer network; Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.05024629657989928,"score_gpt":0.28615009572103967,"score_spread":0.2359037991411404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W599153350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027319679,0.00031125153,0.97034305,0.0017310057,0.00005947629,0.00013333831,0.000016815104,0.000016600507,0.00006875261],"genre_scores_gemma":[0.94701725,0.000060006416,0.052718308,0.00009849979,0.00007877878,9.3691585e-7,0.00001857701,0.000002531637,0.000005081752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.000045144116,0.00034735355,0.00008434092,0.00018079703,0.00015826846],"domain_scores_gemma":[0.9990462,0.00012422881,0.00025446332,0.00006124535,0.0002536393,0.00026018708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007047827,0.000082862185,0.00018549467,0.000081386,0.00012221298,0.0002845067,0.00012729748,0.000047608402,2.5600235e-7],"category_scores_gemma":[0.0001353079,0.00006676247,0.000025278805,0.00011914925,0.000032610897,0.0009089229,0.00008071877,0.00011645041,2.5351537e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024502346,0.00014682923,0.06971235,0.00026958392,0.00024248206,0.000023253191,0.010280971,0.064135395,0.00003536775,0.037246294,0.011050473,0.80661196],"study_design_scores_gemma":[0.005919785,0.00082162966,0.05121543,0.000107023,0.000038637132,0.0003618968,0.00062603585,0.9134972,0.000017486756,0.005004328,0.022108132,0.0002824115],"about_ca_topic_score_codex":0.000004639114,"about_ca_topic_score_gemma":6.378404e-7,"teacher_disagreement_score":0.9196976,"about_ca_system_score_codex":0.00002174884,"about_ca_system_score_gemma":0.000067060886,"threshold_uncertainty_score":0.27435046},"labels":[],"label_agreement":null},{"id":"W646988672","doi":"10.1016/j.tcs.2015.05.034","title":"Competitive algorithms for unbounded one-way trading","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Competitive analysis; Upper and lower bounds; Value (mathematics); Online algorithm; Product (mathematics); Combinatorics; Mathematics; Integer (computer science); Function (biology); Revenue; Logarithm; Sequence (biology); Algorithm; Discrete mathematics; Computer science; Economics; Statistics; Finance","score_opus":0.06660840790346818,"score_gpt":0.31207445656924127,"score_spread":0.2454660486657731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W646988672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004173448,0.000014067651,0.9797343,0.0026115326,0.0006714808,0.00039579495,0.0000029165114,0.00025999546,0.01589259],"genre_scores_gemma":[0.48439103,0.0000013550259,0.5148932,0.00056554814,0.000101384125,0.000015553174,0.000001408543,0.000006385036,0.00002413536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973794,0.00011404896,0.0002684953,0.0007072992,0.00085375283,0.00067700964],"domain_scores_gemma":[0.99781394,0.00032034755,0.000060805185,0.0005712073,0.00061768596,0.00061602413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025210963,0.00016469092,0.00021853484,0.00020371769,0.0004255663,0.0008444858,0.0022846635,0.00004935837,0.000021749893],"category_scores_gemma":[0.00019790587,0.00014434168,0.00006534042,0.001122163,0.0019751536,0.00094925304,0.00065191614,0.00015737486,0.00005416313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070549127,0.00006720281,0.0000045227353,0.0000045071683,0.0000038073683,0.0000022784036,0.00088840094,0.00039785326,0.000083510145,0.98306537,0.00015058686,0.015324879],"study_design_scores_gemma":[0.00047507015,0.00030603042,0.000027367238,0.000016492946,0.0000020266677,0.000014371201,0.000018885517,0.71626174,0.0012837842,0.28068468,0.00074326,0.00016628964],"about_ca_topic_score_codex":0.0000021264323,"about_ca_topic_score_gemma":5.31538e-7,"teacher_disagreement_score":0.7158639,"about_ca_system_score_codex":0.00012322333,"about_ca_system_score_gemma":0.00031659828,"threshold_uncertainty_score":0.81433964},"labels":[],"label_agreement":null},{"id":"W647692831","doi":"10.1007/978-3-642-39274-0","title":"Implementation and Application of Automata : 18th international conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013, proceedings","year":2013,"lang":"en","type":"book","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nested word; Computer science; Automaton; Automata theory; Parsing; Theoretical computer science; Programming language; Quantum finite automata","score_opus":0.016989913192527822,"score_gpt":0.2736276097040486,"score_spread":0.2566376965115208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W647692831","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017045764,0.00010998513,0.3986872,0.008735257,0.00035291625,0.0016734775,0.00018934003,0.00019776233,0.590037],"genre_scores_gemma":[0.0077601625,0.0023761336,0.05561791,0.0016474978,0.00024681483,0.00041605314,0.0020034101,0.00006454297,0.9298675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783283,0.000018164565,0.00056721026,0.0005540369,0.00077137887,0.0002563682],"domain_scores_gemma":[0.99806273,0.000038006994,0.00050646084,0.00029790387,0.0008951898,0.00019968698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026432576,0.00025511402,0.00028457053,0.00025350324,0.000102298975,0.00029883132,0.0009758932,0.00015070483,0.0006322936],"category_scores_gemma":[0.0000109739,0.00024377414,0.000038055976,0.00013209654,0.000075605305,0.0007083265,0.00039513156,0.00019547787,0.000043949887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016509429,0.00001581254,0.00008802714,0.000071476126,0.00003660339,2.8126013e-7,0.000113770206,0.000013827545,0.000015820471,0.20119487,0.7811249,0.017322952],"study_design_scores_gemma":[0.000584534,0.00005939268,0.00028088762,0.000053362648,0.0000143479265,0.000008927842,0.00009198071,0.14223821,0.00006966877,0.008723059,0.84750867,0.00036695364],"about_ca_topic_score_codex":0.22832404,"about_ca_topic_score_gemma":0.18816702,"teacher_disagreement_score":0.34306931,"about_ca_system_score_codex":0.0003386846,"about_ca_system_score_gemma":0.0017578027,"threshold_uncertainty_score":0.99408203},"labels":[],"label_agreement":null},{"id":"W6891765915","doi":"10.4230/lipics.opodis.2024.11","title":"Gathering Teams of Deterministic Finite Automata on a Line","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Task (project management); State (computer science); Set (abstract data type); Node (physics); Deterministic algorithm; Line (geometry); Integer (computer science); Time complexity","score_opus":0.01909302301479185,"score_gpt":0.29656767002335854,"score_spread":0.2774746470085667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891765915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010689695,0.00001508362,0.9705463,0.00051567116,0.0006173859,0.00088638806,0.00013590057,0.00028145607,0.016312093],"genre_scores_gemma":[0.9055332,0.00004741948,0.09063745,0.0019169918,0.000044655222,0.00011792616,0.000114382805,0.000027973365,0.0015599809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789447,0.000036458434,0.0009645091,0.0002315758,0.0003852755,0.00048771588],"domain_scores_gemma":[0.99811625,0.0003110742,0.00030243918,0.0008992976,0.00024720773,0.00012370749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052451465,0.00025647806,0.00036512886,0.0004053011,0.00020012342,0.00026707395,0.0012650337,0.0001308369,0.000018264396],"category_scores_gemma":[0.0002582013,0.0002274184,0.00016400155,0.0005338633,0.00009150539,0.0007203812,0.00048303895,0.00026209434,0.00006715304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005344901,0.0032252027,0.005224151,0.0066300486,0.00078847987,0.00002820317,0.030757884,0.1134453,0.00044933197,0.44172505,0.010031409,0.38716045],"study_design_scores_gemma":[0.0019784002,0.00042892632,0.00017187188,0.00038530483,0.000012458854,0.0000055488113,0.0001439332,0.97543246,0.0011052568,0.0012268146,0.018866098,0.00024290402],"about_ca_topic_score_codex":0.0000058874257,"about_ca_topic_score_gemma":0.000004169732,"teacher_disagreement_score":0.8948435,"about_ca_system_score_codex":0.00007375821,"about_ca_system_score_gemma":0.00015132008,"threshold_uncertainty_score":0.9273853},"labels":[],"label_agreement":null},{"id":"W6906622769","doi":"10.18434/m32212","title":"SHREC'10 Track: Non-rigid 3D Shape Retrieval","year":2010,"lang":"en","type":"dataset","venue":"National Institute of Standards and Technology (NIST)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Object (grammar); Polygon mesh; Class (philosophy); ASCII; Task (project management); 3d model; Pattern recognition (psychology)","score_opus":0.014369764372044892,"score_gpt":0.3028795821873874,"score_spread":0.2885098178153425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6906622769","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009470327,0.00026879506,0.01307413,0.0034232102,0.0009388476,0.00045444616,0.97855896,0.00019367589,0.002993249],"genre_scores_gemma":[0.0023283968,0.00312106,0.11494397,0.0006657425,0.0004521399,0.00008616621,0.87674916,0.00005263769,0.0016007214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697566,0.000021495296,0.00055711844,0.0006719547,0.0014393129,0.00033443133],"domain_scores_gemma":[0.9967219,0.000056730747,0.00034857207,0.00059840106,0.0021563997,0.00011795905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094051333,0.0003217173,0.0004931298,0.0010291106,0.00032282053,0.00017240329,0.0014317444,0.0011918575,0.00042248916],"category_scores_gemma":[0.00067985675,0.00030456338,0.00007555075,0.0010391272,0.0009964827,0.00051728444,0.0005625508,0.00116147,0.000027894088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030041207,0.00011482094,0.0000046254454,0.00010088276,0.00006276815,0.000024877756,0.000008901887,0.000025822537,0.00008268937,0.04531035,0.94661313,0.0076210685],"study_design_scores_gemma":[0.00072745915,0.00022254833,0.000012163042,0.000077570614,0.0000165873,0.000054962828,0.000002488452,0.0038008073,0.0002633809,0.005088059,0.98943466,0.00029928354],"about_ca_topic_score_codex":0.0000215162,"about_ca_topic_score_gemma":0.00010860502,"teacher_disagreement_score":0.101869844,"about_ca_system_score_codex":0.00014874319,"about_ca_system_score_gemma":0.0022534882,"threshold_uncertainty_score":0.99994063},"labels":[],"label_agreement":null},{"id":"W6910493941","doi":"10.4230/lipics.disc.2022.11","title":"How to Meet at a Node of Any Connected Graph","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Strongly connected component; Graph; Node (physics); Set (abstract data type); Task (project management); Finite set; Directed graph; Integer (computer science)","score_opus":0.017399656834605638,"score_gpt":0.2415029935148019,"score_spread":0.22410333668019625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910493941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09446351,0.00004536571,0.887173,0.006294584,0.0011791816,0.0027092653,0.0012284695,0.0004399406,0.006466658],"genre_scores_gemma":[0.8705347,0.000016162337,0.122375995,0.004278485,0.00004767824,0.0004991098,0.00034508173,0.000049709317,0.0018530859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739116,0.00008387858,0.00075055665,0.00028630692,0.00081277336,0.0006753378],"domain_scores_gemma":[0.99796987,0.00012594179,0.00036713513,0.0008715043,0.00037309885,0.0002924507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066465384,0.00026313856,0.00038919805,0.0004967715,0.00056034786,0.00031759604,0.0016596225,0.00007511114,0.00009060414],"category_scores_gemma":[0.0001276754,0.0002552745,0.00020982636,0.0010482704,0.00007235031,0.0010637158,0.0017194782,0.00018691989,0.000019670046],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093854446,0.0026145985,0.015686672,0.002305142,0.0010118934,0.00003984571,0.13059606,0.07719415,0.0041538295,0.43933657,0.31198877,0.0141339125],"study_design_scores_gemma":[0.0064712316,0.0015112051,0.0004899394,0.000093101924,0.00003278436,0.000112483714,0.0031254767,0.55158794,0.0045698755,0.0023923186,0.42847008,0.0011435857],"about_ca_topic_score_codex":0.000010345163,"about_ca_topic_score_gemma":0.000025453517,"teacher_disagreement_score":0.7760712,"about_ca_system_score_codex":0.0001704274,"about_ca_system_score_gemma":0.00009696448,"threshold_uncertainty_score":0.9999899},"labels":[],"label_agreement":null},{"id":"W6930159861","doi":"10.5281/zenodo.12144537","title":"Unravel me becka mack pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paraphernalia; Staring; TSG101; Gloom; Filter (signal processing)","score_opus":0.03197470759588548,"score_gpt":0.2508860078358982,"score_spread":0.21891130024001274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930159861","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.841917e-7,0.00032493906,0.10955704,0.0012845133,0.00033015668,0.00046880663,0.0001226691,0.0027451692,0.88516635],"genre_scores_gemma":[0.00019455579,0.00036928363,0.0056089163,0.00032029112,0.00030808148,8.2983036e-8,0.0008738524,0.006877333,0.9854476],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973914,0.0003154223,0.00028031092,0.00084552105,0.00065519963,0.0005121331],"domain_scores_gemma":[0.99827,0.000013144199,0.00013047634,0.0010040778,0.00029787104,0.00028448176],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005845797,0.00027315892,0.00023709772,0.00073048065,0.0006416445,0.002471613,0.0029380945,0.00019299112,0.12248998],"category_scores_gemma":[0.00018861738,0.0002784349,0.00009576728,0.00083914906,0.00014723842,0.00022202048,0.002943933,0.00052786624,0.3279082],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028612606,0.000050249764,5.9275518e-8,0.00014365077,0.00005635154,0.000027548773,0.00045339976,0.000022421962,0.00005867857,0.030058285,0.95135474,0.017771777],"study_design_scores_gemma":[0.00023477557,0.000101855396,0.0000025851555,0.00014090407,0.000010726526,0.00006604412,0.000037696675,0.0044251643,0.000020433057,0.00078112836,0.9938792,0.00029949384],"about_ca_topic_score_codex":0.000023093966,"about_ca_topic_score_gemma":9.2991377e-7,"teacher_disagreement_score":0.20541821,"about_ca_system_score_codex":0.00013167941,"about_ca_system_score_gemma":0.000011201679,"threshold_uncertainty_score":0.9999668},"labels":[],"label_agreement":null},{"id":"W6930364889","doi":"10.5281/zenodo.12222022","title":"Iso 10000 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Limiting; Nucleofection; Work (physics); Context (archaeology); Quality (philosophy)","score_opus":0.028556968612108175,"score_gpt":0.24845925157954302,"score_spread":0.21990228296743483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930364889","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.1673105e-7,0.0003859786,0.0989365,0.0011610175,0.00031928578,0.00041049192,0.00008775153,0.0032106438,0.895488],"genre_scores_gemma":[0.00015205466,0.00038212427,0.0045312135,0.00029393774,0.00029233546,6.5202926e-8,0.00069029705,0.0068935747,0.9867644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976783,0.0002892502,0.00024561782,0.00076407526,0.0005667994,0.0004559874],"domain_scores_gemma":[0.998433,0.000011130315,0.00011005326,0.0009556613,0.00024428693,0.0002458913],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052793545,0.00023828488,0.00020762555,0.00069909706,0.0006363065,0.0025128664,0.0027683843,0.00017363227,0.15760891],"category_scores_gemma":[0.00015658949,0.00024274942,0.00008560548,0.00096301694,0.00012799942,0.0002218303,0.002601971,0.0004744425,0.3834361],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021907617,0.000044032633,3.46306e-8,0.000115462266,0.000042757485,0.000023999099,0.0002984463,0.0000183598,0.00003864707,0.026566174,0.93684655,0.03600335],"study_design_scores_gemma":[0.00018738228,0.0000968616,0.0000016676337,0.00012582476,0.000008068543,0.000060223316,0.00002307522,0.0029044491,0.0000124077915,0.0005658137,0.9957523,0.00026197045],"about_ca_topic_score_codex":0.000018742869,"about_ca_topic_score_gemma":4.6763745e-7,"teacher_disagreement_score":0.2258272,"about_ca_system_score_codex":0.00011004352,"about_ca_system_score_gemma":0.000009105269,"threshold_uncertainty_score":0.99852264},"labels":[],"label_agreement":null},{"id":"W6931461656","doi":"10.5281/zenodo.4672749","title":"Okanopteryx Archibald & Cannings & Erickson & Bybee & Mathewes 2021, new genus","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Genus; Quadrangle; Sensu; Type species","score_opus":0.030376903784153884,"score_gpt":0.23785191356793725,"score_spread":0.20747500978378336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931461656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041935025,0.0004313855,0.74090064,0.01227055,0.0003888069,0.00053295173,0.00006859352,0.00173538,0.23947817],"genre_scores_gemma":[0.61396927,0.0025583548,0.22696757,0.008113993,0.0020768442,6.73036e-7,0.004399794,0.0066504665,0.13526307],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975256,0.0003744298,0.00030399888,0.0006664761,0.0005747699,0.00055476296],"domain_scores_gemma":[0.99793684,0.00003342478,0.000106064894,0.0008320595,0.0006807693,0.0004108291],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005419092,0.00017967138,0.00018286944,0.0002153251,0.0015345002,0.0021511468,0.0018657523,0.00006458318,0.014054077],"category_scores_gemma":[0.00048136906,0.00019373237,0.00008046251,0.0011765338,0.00009706746,0.0006067004,0.0023326331,0.00032335654,0.0076506557],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019004487,0.00018779282,0.0000095465475,0.000040245068,0.00005783174,0.00013326507,0.0045318115,0.00090281444,0.006488826,0.042693604,0.407362,0.5375732],"study_design_scores_gemma":[0.00042770352,0.00012482556,0.00029379906,0.000033551478,0.000005624225,0.00020064655,0.00011714432,0.007904889,0.0013777558,0.0009427565,0.9883381,0.00023320822],"about_ca_topic_score_codex":0.000042886066,"about_ca_topic_score_gemma":0.0000010201308,"teacher_disagreement_score":0.6097757,"about_ca_system_score_codex":0.00011972444,"about_ca_system_score_gemma":0.00003714382,"threshold_uncertainty_score":0.9997654},"labels":[],"label_agreement":null},{"id":"W6931818618","doi":"10.5281/zenodo.8098073","title":"jessicastockdale/genomicSIs: v1.0.0 Nature Communcations","year":2023,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Resolution (logic); Period (music); High resolution; Natural (archaeology)","score_opus":0.03306462859708053,"score_gpt":0.26174013222251197,"score_spread":0.22867550362543143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931818618","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025288853,0.00030213446,0.09015197,0.002495978,0.00043762123,0.0007729105,0.00036576617,0.008636821,0.89683425],"genre_scores_gemma":[0.0028770505,0.0026515797,0.021339566,0.0011907511,0.0009340091,8.9329257e-7,0.005382555,0.038491704,0.9271319],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975828,0.00042271288,0.00029039144,0.00067853386,0.00053357263,0.000491985],"domain_scores_gemma":[0.99760365,0.00004264143,0.00021483902,0.0014661552,0.00042484212,0.00024785235],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060741295,0.00026033816,0.00024628083,0.00075385335,0.0017357739,0.0016071518,0.00401318,0.00033844382,0.011223292],"category_scores_gemma":[0.00041746112,0.00028005824,0.00009101642,0.0012905677,0.00015361498,0.0002786467,0.0030270782,0.00091543223,0.031641666],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025955767,0.0000697554,4.1821792e-7,0.00004361461,0.000048936145,0.00000823869,0.00038413802,0.00008062078,0.000024349552,0.030336525,0.92634106,0.042659722],"study_design_scores_gemma":[0.0002777084,0.0000688915,0.00003264999,0.00009757545,0.000008807868,0.000030971154,0.000055170578,0.003216789,0.000006758564,0.0003184847,0.995597,0.00028918442],"about_ca_topic_score_codex":0.000028611645,"about_ca_topic_score_gemma":0.000004713392,"teacher_disagreement_score":0.069255926,"about_ca_system_score_codex":0.0001727145,"about_ca_system_score_gemma":0.000013986149,"threshold_uncertainty_score":0.99996513},"labels":[],"label_agreement":null},{"id":"W6948871246","doi":"10.5281/zenodo.11857367","title":"conjonctivite nourrisson pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Limiting; Infectious agent; Chlamydia; Medical screening","score_opus":0.04326887277714394,"score_gpt":0.2560438463703504,"score_spread":0.21277497359320643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948871246","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013051778,0.00096367096,0.14599787,0.0046591097,0.0009589205,0.00081208034,0.00019566489,0.0014440642,0.84495556],"genre_scores_gemma":[0.0023644613,0.00072963256,0.0034613214,0.0005764456,0.0007102942,1.2240132e-7,0.0009588085,0.00701589,0.984183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954704,0.0009483521,0.0005016528,0.0013084629,0.0008629347,0.00090821675],"domain_scores_gemma":[0.99711674,0.000046362165,0.00022845506,0.0011414788,0.0009294105,0.0005375322],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012592652,0.00045835908,0.0004020233,0.0007518374,0.0017564029,0.005851178,0.002961167,0.00032928155,0.4307415],"category_scores_gemma":[0.0006387437,0.00049715757,0.00018092543,0.001558106,0.00043313522,0.00058302406,0.0038665833,0.0010523938,0.62093955],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013292699,0.00017157142,4.2819593e-7,0.00034505752,0.00012151839,0.000086490734,0.0019450223,0.00024091039,0.00025007504,0.10110984,0.7327316,0.1629842],"study_design_scores_gemma":[0.00044943727,0.00033800543,0.000024847215,0.00041770007,0.00003478626,0.0002279534,0.00008920248,0.025515398,0.00004767019,0.0010908707,0.97126395,0.00050019904],"about_ca_topic_score_codex":0.000039550418,"about_ca_topic_score_gemma":0.0000011974414,"teacher_disagreement_score":0.23853235,"about_ca_system_score_codex":0.00038061955,"about_ca_system_score_gemma":0.000022614957,"threshold_uncertainty_score":0.999748},"labels":[],"label_agreement":null},{"id":"W6949119403","doi":"10.5281/zenodo.12636795","title":"PBL Tops CLAMPS observations","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"","keywords":"TOPS; Planetary boundary layer; Radar; Block (permutation group theory); Boundary (topology); Azimuth; Storm","score_opus":0.08163159801935926,"score_gpt":0.26063496799918445,"score_spread":0.1790033699798252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949119403","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017668846,0.000050947576,0.10134954,0.0054760817,0.00033284252,0.00076316786,0.88075566,0.0016131562,0.009656811],"genre_scores_gemma":[0.000042431864,0.00037430972,0.0039448757,0.001326558,0.0002373052,1.2969737e-7,0.99268764,0.0006841824,0.00070256524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688613,0.00054459483,0.00043887363,0.00084109564,0.00077131443,0.00051798974],"domain_scores_gemma":[0.997195,0.00004702109,0.00021563433,0.0012993313,0.0008403496,0.00040265397],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006177695,0.00027831935,0.0002756448,0.0003561902,0.0024082498,0.0028672824,0.0049391575,0.00019359977,0.0069369446],"category_scores_gemma":[0.0009789615,0.0003027681,0.00010349289,0.0014405362,0.00013425176,0.00064074795,0.0042484654,0.0007916084,0.032394055],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064743267,0.000090577065,8.091814e-8,0.00008557062,0.000034592013,0.00002102037,0.0002087342,0.00021522498,0.000038410293,0.005296422,0.9852239,0.00877899],"study_design_scores_gemma":[0.00029965703,0.00017820865,0.000021628248,0.000037072252,0.00001174601,0.00004301655,0.000025680629,0.0039102263,0.000010149723,0.00026740393,0.9948825,0.00031270666],"about_ca_topic_score_codex":0.000021401846,"about_ca_topic_score_gemma":7.3321695e-7,"teacher_disagreement_score":0.11193196,"about_ca_system_score_codex":0.00016306037,"about_ca_system_score_gemma":0.000022414179,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W6989303635","doi":"","title":"An AO* based exact algorithm for the Canadian traveler problem","year":2016,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Markov process; Vertex (graph theory); Time complexity; Markov decision process; Node (physics); Graph; Graph traversal; Markov chain","score_opus":0.051152866382500155,"score_gpt":0.27769085016560907,"score_spread":0.2265379837831089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989303635","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.9442995e-7,0.000049979033,0.8983083,0.0110199535,0.00010328722,0.0015320345,0.08400832,0.00023979814,0.004737481],"genre_scores_gemma":[0.09679367,0.0000076046695,0.83388096,0.016431408,0.0008126133,0.00539934,0.033742383,0.00014674097,0.012785272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917203,0.000036890273,0.00009265933,0.0002256904,0.00015682894,0.0003159117],"domain_scores_gemma":[0.9990134,0.00013967867,0.00003152667,0.00040042252,0.00018428183,0.00023066244],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000119368,0.00008148176,0.00005762066,0.00006354308,0.00027902573,0.00025385863,0.0008235661,0.00005109224,0.022619968],"category_scores_gemma":[0.000091971255,0.00004459217,0.00004016308,0.00016024496,0.0000063303182,0.00034133816,0.000027911636,0.00005121528,0.00042708172],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8557756e-7,0.000016270284,0.000004232257,0.000012043607,0.000004817674,0.0000026691446,0.00011738904,0.00031270966,0.000016113478,0.00043573833,0.34893605,0.6501413],"study_design_scores_gemma":[0.00025715257,0.000054779463,0.0002634468,0.00009303252,7.565616e-7,0.0000011595066,0.0000022208417,0.5565857,0.00016347598,0.0001581152,0.4423214,0.000098759825],"about_ca_topic_score_codex":0.0010254448,"about_ca_topic_score_gemma":0.020759206,"teacher_disagreement_score":0.65004253,"about_ca_system_score_codex":0.00006425431,"about_ca_system_score_gemma":0.0005332846,"threshold_uncertainty_score":0.9971094},"labels":[],"label_agreement":null},{"id":"W6989670241","doi":"","title":"The Canadian Traveller Problem on unit-weighted and arbitrarily weighted outerplanar graphs","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Competitive analysis; Cardinality (data modeling); Treewidth; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Pathwidth; Outerplanar graph","score_opus":0.01459357000948829,"score_gpt":0.2288761969656249,"score_spread":0.2142826269561366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989670241","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033904214,0.001441617,0.38959473,0.13319452,0.00074341474,0.0023104185,0.00019473955,0.0006720286,0.46845812],"genre_scores_gemma":[0.3732129,0.00680547,0.49798885,0.004256292,0.000053748234,0.0005905909,0.0012666074,0.00012358521,0.11570194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935814,0.003848658,0.0005162272,0.00093995646,0.0005296942,0.000584062],"domain_scores_gemma":[0.9938434,0.001311237,0.00028667157,0.002394229,0.0017096903,0.00045482413],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040760194,0.00038061952,0.00031104503,0.00050899683,0.0015255337,0.0018929922,0.002754455,0.0003505836,0.000031145828],"category_scores_gemma":[0.00024112652,0.0003174374,0.00013546343,0.0008379112,0.00031002398,0.00016636914,0.0011332937,0.0010822648,0.000023233066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062695794,0.00012032466,0.0003254549,0.000065129025,0.00008315353,0.000006001739,0.0047641443,0.000072372655,0.000014675805,0.95101273,0.002654818,0.040874906],"study_design_scores_gemma":[0.0013389596,0.0000031258862,0.0036463488,0.0026993102,0.000050011444,0.000015469137,0.0001021582,0.5844717,0.0032508238,0.17138039,0.23178992,0.0012518197],"about_ca_topic_score_codex":0.033323083,"about_ca_topic_score_gemma":0.20967704,"teacher_disagreement_score":0.7796324,"about_ca_system_score_codex":0.00014298863,"about_ca_system_score_gemma":0.0014504119,"threshold_uncertainty_score":0.99992776},"labels":[],"label_agreement":null},{"id":"W7023259415","doi":"","title":"Caribana '68","year":2010,"lang":"en","type":"other","venue":"York University Digital Library (York University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.00892101707503403,"score_gpt":0.1546943905601826,"score_spread":0.14577337348514857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023259415","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010453809,0.0000833303,0.021401605,0.0004207085,0.00041932348,0.00031983218,0.00056325144,0.0021892693,0.9745922],"genre_scores_gemma":[0.0006221956,0.00013289573,0.011563105,0.00014679565,0.00012457884,5.9145428e-8,0.000407022,0.00016957172,0.98683375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979334,0.000093532195,0.00013205656,0.0008900246,0.00039464078,0.00055637717],"domain_scores_gemma":[0.99809617,0.000069930524,0.0002292602,0.0010482146,0.000034646182,0.0005217579],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000027880964,0.0004420257,0.0003993077,0.0015980111,0.00027755502,0.00072877377,0.0036497337,0.00063858763,0.0022477594],"category_scores_gemma":[0.000008582473,0.0005500703,0.00027387854,0.0021554395,0.00028672544,0.0030937274,0.0017089973,0.00071846566,0.0010839287],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022150387,0.00011690487,0.00037327234,0.00003785514,0.00011404593,0.00059161393,0.00010047309,0.000041314557,0.0000015524447,0.11975902,0.874446,0.004395807],"study_design_scores_gemma":[0.0005859067,0.000058465917,0.000018598199,0.00008093208,0.000021990065,0.0000063188095,0.0002216986,0.00040440183,0.0000069891526,0.00012545945,0.9978563,0.0006129055],"about_ca_topic_score_codex":0.00009591778,"about_ca_topic_score_gemma":0.000049424038,"teacher_disagreement_score":0.123410344,"about_ca_system_score_codex":0.00008627122,"about_ca_system_score_gemma":0.00050855277,"threshold_uncertainty_score":0.99969506},"labels":[],"label_agreement":null},{"id":"W7067965317","doi":"","title":"Multi-agent, multi-objective path planning in complex environments","year":2021,"lang":"en","type":"dissertation","venue":"IDEALS (University of Illinois Urbana-Champaign)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Motion planning; A priori and a posteriori; Markov decision process; Path (computing); Graph; Robot; Set (abstract data type); Any-angle path planning","score_opus":0.041088521127256986,"score_gpt":0.26121912140212344,"score_spread":0.22013060027486647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067965317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062621534,0.001442702,0.9303209,0.00020395777,0.00061219034,0.0014032385,0.00017531647,0.00019121752,0.003028942],"genre_scores_gemma":[0.58649725,0.0017666396,0.35729557,0.00034000917,0.000067228924,0.000010167899,0.0038640825,0.00011975758,0.050039276],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970462,0.0003436573,0.00043668397,0.0009831423,0.00065242086,0.0005379323],"domain_scores_gemma":[0.99821526,0.00011612991,0.00057154906,0.000677703,0.00018640391,0.00023298495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042548828,0.00041099094,0.00073102186,0.0007114238,0.00030183556,0.00007905592,0.00120575,0.0003965699,0.00026178177],"category_scores_gemma":[0.000058471946,0.0005466838,0.00026429194,0.00075154915,0.000099982084,0.0005623244,0.0003102952,0.00055387744,0.00006854258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086303084,0.00933855,0.042476818,0.0029540642,0.0027398306,0.0066856965,0.58249265,0.2335299,0.044295046,0.00794369,0.019665422,0.047015313],"study_design_scores_gemma":[0.0070179235,0.00032689175,0.23811947,0.0011319758,0.00009255704,0.000011417574,0.045283444,0.6949376,0.0005806189,0.00027272038,0.010220561,0.0020048139],"about_ca_topic_score_codex":0.0013649111,"about_ca_topic_score_gemma":0.0016678907,"teacher_disagreement_score":0.57302535,"about_ca_system_score_codex":0.00029841176,"about_ca_system_score_gemma":0.00023538592,"threshold_uncertainty_score":0.99969846},"labels":[],"label_agreement":null},{"id":"W7096413328","doi":"","title":"2014 Canadian Conference on Computer and Robot Vision Asymmetric Rendezvous Search at Sea","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Drifter; Rendezvous; Position (finance); Underwater; Trajectory; Robot; Field (mathematics)","score_opus":0.025053082926508374,"score_gpt":0.2639916726582576,"score_spread":0.23893858973174925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096413328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001107906,0.000020477331,0.9231299,0.007094043,0.00018342077,0.00019842814,0.0000022371562,0.00011897429,0.06814458],"genre_scores_gemma":[0.908518,0.000079090125,0.08404037,0.0028488517,0.00005597804,0.000004648129,0.000010358907,0.000011112887,0.0044315727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847555,0.00017277639,0.0001436276,0.00044358792,0.0003524873,0.00041194563],"domain_scores_gemma":[0.9987294,0.00012928295,0.00002423325,0.00043117686,0.00014700493,0.0005388879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447048,0.00012240221,0.00013216614,0.00042206416,0.0002563211,0.0003540305,0.00048279073,0.00007109089,0.00016750259],"category_scores_gemma":[0.000021274374,0.00010146686,0.000023514713,0.0004227499,0.00005124536,0.0002301185,0.0002999641,0.00015018777,0.00053384557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009745787,0.00007648463,0.0036664638,0.000028006807,0.000015900543,0.000016033544,0.00042083793,0.015951695,0.000083777835,0.40746614,0.07694027,0.49532464],"study_design_scores_gemma":[0.00029871732,0.00031667604,0.0073087816,0.000011545249,7.8447425e-7,0.000009873553,0.0000022815625,0.9805464,0.00013631012,0.00037385328,0.01084215,0.0001525877],"about_ca_topic_score_codex":0.010958972,"about_ca_topic_score_gemma":0.016218293,"teacher_disagreement_score":0.9645947,"about_ca_system_score_codex":0.00009793374,"about_ca_system_score_gemma":0.00012021459,"threshold_uncertainty_score":0.99562716},"labels":[],"label_agreement":null},{"id":"W7096631854","doi":"","title":"EFFORT ALLOCATION ALGORITHMS FOR SEARCH AND RESCUE OPERATIONS 1","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Search algorithm; Beam search; Object (grammar); Search and rescue; Best-first search; Incremental heuristic search; Guided Local Search; Constraint satisfaction; Local search (optimization)","score_opus":0.041500704220413895,"score_gpt":0.3076132840125321,"score_spread":0.26611257979211816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096631854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037648757,0.000012017508,0.98858064,0.0058534,0.00004087504,0.0005881477,7.8808085e-7,0.00007713565,0.0010820923],"genre_scores_gemma":[0.16097012,0.000031048367,0.83118343,0.00066302845,0.000029834633,0.00022733613,0.000014571162,0.0000053102785,0.006875339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946976,0.000016330489,0.000095941774,0.00017046067,0.00010867183,0.00013882968],"domain_scores_gemma":[0.999505,0.00002138064,0.000002285719,0.00017326437,0.00021878412,0.0000793121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020198006,0.00004372108,0.000045307133,0.000054577475,0.00015019542,0.00032933019,0.00018313124,0.000025241588,0.000073787116],"category_scores_gemma":[0.000017241879,0.00003534742,0.000012388656,0.00012366817,0.000020568448,0.00062125147,0.000080052225,0.00003574401,0.0000656985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016185373,0.000093248505,0.0001768218,0.000032575175,0.000019352621,2.6289416e-7,0.0014533809,0.11486977,0.0033710462,0.72166103,0.0057891603,0.15253171],"study_design_scores_gemma":[0.00017189058,0.000047810216,0.0005424566,0.00000200347,5.011359e-7,0.00000152301,0.000027299051,0.9972673,0.000660688,0.00050087646,0.0007250699,0.000052562922],"about_ca_topic_score_codex":0.00037709088,"about_ca_topic_score_gemma":0.00007743647,"teacher_disagreement_score":0.88239753,"about_ca_system_score_codex":0.000009867145,"about_ca_system_score_gemma":0.00004263057,"threshold_uncertainty_score":0.31757385},"labels":[],"label_agreement":null},{"id":"W7096864499","doi":"","title":"2010 Published by Canadian Center of Science and Education 139","year":2016,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multinomial distribution; Bayesian probability; Center (category theory); Probability distribution; Optimal stopping; Bayes' theorem","score_opus":0.008435738435133558,"score_gpt":0.23146695873137585,"score_spread":0.22303122029624228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096864499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023443073,0.00010999405,0.47809783,0.16246198,0.00194498,0.0006274902,0.000020732037,0.00013687342,0.33315703],"genre_scores_gemma":[0.9473866,0.000029307155,0.031016152,0.0017620105,0.000012020382,0.000006391066,0.000001385364,0.0000029885773,0.019783108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940974,0.000011112025,0.00007491128,0.0001635404,0.00018492682,0.00015575437],"domain_scores_gemma":[0.9992064,0.0000128816055,0.000020418589,0.0002027652,0.0003272327,0.00023029101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331951,0.000031037205,0.00003402151,0.00018251204,0.000073975505,0.00014712891,0.00040255772,0.000014921155,0.00015389739],"category_scores_gemma":[0.000109356246,0.000019432842,0.0000048555057,0.00035410284,0.00019559775,0.0011926406,0.00007005778,0.000018387773,0.000012021628],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4482823e-7,0.000087470646,0.010859152,0.000007495141,0.0000029992373,1.7540117e-7,0.0004634315,0.0000013227149,0.013372498,0.20812938,0.5027735,0.2643016],"study_design_scores_gemma":[0.0029431456,0.00036388327,0.057863094,0.00016613596,0.000004345047,0.00003640638,0.00027935128,0.054051314,0.060443863,0.022156067,0.80059624,0.001096182],"about_ca_topic_score_codex":0.00892543,"about_ca_topic_score_gemma":0.0039321985,"teacher_disagreement_score":0.9239436,"about_ca_system_score_codex":0.000046372912,"about_ca_system_score_gemma":0.0010445189,"threshold_uncertainty_score":0.9976742},"labels":[],"label_agreement":null},{"id":"W7097241741","doi":"","title":"Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reservation; Competitive analysis; Upper and lower bounds; Matching (statistics); Online algorithm; Reservation system","score_opus":0.07193377675832262,"score_gpt":0.2986140328225581,"score_spread":0.22668025606423547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097241741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053401565,0.000012113589,0.79546493,0.055131543,0.00014018078,0.0012032269,0.0000024809915,0.00010483418,0.1474067],"genre_scores_gemma":[0.8584834,0.00003885202,0.11339262,0.01537782,0.000094168,0.0006017715,0.000015949336,0.000019724077,0.011975696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988114,0.00024720936,0.0001693697,0.00023762813,0.00032292036,0.0002114377],"domain_scores_gemma":[0.9978184,0.0014785692,0.00007288792,0.00040435282,0.00019224586,0.000033561886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011935398,0.00009865048,0.00007269202,0.00004041469,0.00082283025,0.0005612209,0.0006517465,0.000030551953,0.0000996998],"category_scores_gemma":[0.000245726,0.000046998877,0.00003988127,0.00035253935,0.000064117376,0.00036857542,0.000054464337,0.0001397014,0.00003503012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035986998,0.000022533735,0.0000710925,0.0000033955785,0.000007794316,1.427729e-7,0.00044589155,0.007916579,0.000071892515,0.9870923,0.0033996287,0.0009651277],"study_design_scores_gemma":[0.00046356625,0.0004275016,0.00030829228,0.00005850142,0.0000040237587,0.0000021516514,0.00072219805,0.8688287,0.00644588,0.044467416,0.078059226,0.0002125522],"about_ca_topic_score_codex":0.000015258802,"about_ca_topic_score_gemma":0.000048866907,"teacher_disagreement_score":0.9426249,"about_ca_system_score_codex":0.00004108215,"about_ca_system_score_gemma":0.00009925378,"threshold_uncertainty_score":0.6328628},"labels":[],"label_agreement":null},{"id":"W7097417830","doi":"","title":"Scheduling in the Dark (Improved Result)","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Multiprocessor scheduling; Parallelizable manifold; Upper and lower bounds; Execution time; Multiprocessing; Job shop scheduling; Job queue","score_opus":0.026063634888488483,"score_gpt":0.29021631245666496,"score_spread":0.26415267756817645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097417830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032438412,0.000013046557,0.9202529,0.004005746,0.00005835298,0.000111248744,5.5906625e-8,0.000057171557,0.0722576],"genre_scores_gemma":[0.6615054,0.000006035715,0.33485892,0.0026130714,0.000023173076,0.0000031835311,6.133215e-7,0.0000023430478,0.000987265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993712,0.000040067844,0.00012966275,0.00012986823,0.00014463556,0.00018461609],"domain_scores_gemma":[0.99953485,0.00011555062,0.000016949865,0.0002685723,0.00003269939,0.00003137175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001678558,0.000037870857,0.000035734392,0.00006330168,0.000055012388,0.00012441634,0.00059596665,0.000021649726,0.0000108985],"category_scores_gemma":[0.00006845253,0.000023262977,0.000013866783,0.00044807364,0.000011604999,0.00020240126,0.000075013755,0.000104204904,0.000028510143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017270391,0.00019865575,0.0020054828,0.0000117852105,0.000006733028,0.00003856407,0.0087338565,0.010968493,0.0034294443,0.86599576,0.0026047511,0.10598919],"study_design_scores_gemma":[0.0005206973,0.00004995672,0.003259882,0.00000781697,3.9767926e-7,0.0000060507546,0.0004050779,0.98314923,0.00083006884,0.0057355333,0.005915548,0.000119725955],"about_ca_topic_score_codex":0.000048848255,"about_ca_topic_score_gemma":0.00012070356,"teacher_disagreement_score":0.9721807,"about_ca_system_score_codex":0.000015446925,"about_ca_system_score_gemma":0.000028622853,"threshold_uncertainty_score":0.11997496},"labels":[],"label_agreement":null},{"id":"W7105505977","doi":"","title":"A Learning Perspective on Random-Order Covering Problems","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; York University; National Science Foundation","keywords":"Cover (algebra); Mathematical proof; Multiplicative function; Set cover problem; Set (abstract data type); Regret; Connection (principal bundle); Perspective (graphical); Matching (statistics)","score_opus":0.028332926318305737,"score_gpt":0.29239508428658206,"score_spread":0.2640621579682763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105505977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10001945,0.0013828562,0.7312915,0.014155763,0.0020324425,0.0020324914,0.000003147083,0.0005524589,0.14852995],"genre_scores_gemma":[0.96287346,0.0007521827,0.0019831206,0.0016747863,0.00011761594,0.00008897773,0.0000033634328,0.00003489226,0.03247159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961503,0.0005430794,0.00060185493,0.0012372823,0.00056438794,0.0009030794],"domain_scores_gemma":[0.9975296,0.00040721963,0.00022091102,0.0007553314,0.000861882,0.00022501498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001012815,0.0004447113,0.00051315385,0.00047437983,0.00095607596,0.0005903708,0.0010154056,0.00020667954,0.00034566422],"category_scores_gemma":[0.0010301719,0.00044664115,0.00020864875,0.0023619349,0.00020915648,0.0007377124,0.0006977485,0.001213259,0.00076159707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045847215,0.0009710518,0.111970246,0.00033779303,0.00055645173,0.00006159569,0.02701929,0.72852784,0.0013377964,0.105717085,0.0014341943,0.021608165],"study_design_scores_gemma":[0.010182398,0.0012173578,0.017228749,0.0013547491,0.00006666058,0.000008303417,0.002364464,0.93496704,0.0011239201,0.0021674163,0.028270368,0.00104859],"about_ca_topic_score_codex":0.00018048486,"about_ca_topic_score_gemma":0.000022617172,"teacher_disagreement_score":0.862854,"about_ca_system_score_codex":0.0004476446,"about_ca_system_score_gemma":0.0006174576,"threshold_uncertainty_score":0.99979854},"labels":[],"label_agreement":null},{"id":"W7106672325","doi":"10.1007/978-981-95-4721-0_12","title":"On Online Self-Organizing Linear Search","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Online algorithm; Bounded function; Quality (philosophy); Online search","score_opus":0.04907550252332892,"score_gpt":0.32425391086749494,"score_spread":0.275178408344166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106672325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016957281,0.00013701916,0.6359824,0.0033382168,0.00026603087,0.0005019214,0.000021798227,0.00025873617,0.35947695],"genre_scores_gemma":[0.0056645796,0.0066467565,0.97335607,0.00588159,0.00005117969,0.00001869486,0.00018362408,0.000014889108,0.008182605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823564,0.00004547923,0.00058520975,0.0003073791,0.0005701016,0.00025616548],"domain_scores_gemma":[0.99680823,0.00032358797,0.00015413134,0.002112925,0.00048202538,0.000119100434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010511222,0.00019916399,0.00021342449,0.0015472737,0.00055413146,0.00061032467,0.0038471096,0.00012440802,0.000011888987],"category_scores_gemma":[0.00006142976,0.00019745587,0.00003745497,0.00082689815,0.00039294263,0.0039367676,0.0032731819,0.00066420244,0.000078199635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.319555e-7,0.000031498777,0.0000049158834,0.000025225701,0.0000042130227,2.6742347e-7,0.0010887819,0.0016981834,5.2368745e-7,0.887059,0.00043381212,0.10965269],"study_design_scores_gemma":[0.00022815117,0.00006007985,0.00009915217,0.00022468995,0.0000020301638,0.000005025864,0.000010051059,0.8968538,0.0000056426215,0.0045724316,0.09773357,0.00020535804],"about_ca_topic_score_codex":0.0000068757417,"about_ca_topic_score_gemma":0.000004435575,"teacher_disagreement_score":0.8951556,"about_ca_system_score_codex":0.00018044762,"about_ca_system_score_gemma":0.0005781797,"threshold_uncertainty_score":0.80520165},"labels":[],"label_agreement":null},{"id":"W7110080440","doi":"10.4230/lipics.disc.2025.56","title":"Brief Announcement: Universal Dancing by Luminous Robots Under Sequential Schedulers","year":2025,"lang":"en","type":"article","venue":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Sequence (biology); Swarm behaviour; Bounded function; AKA; Mobile robot; Swarm robotics; Class (philosophy)","score_opus":0.01870643762224727,"score_gpt":0.24158779274814296,"score_spread":0.22288135512589569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110080440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011272971,0.0006622395,0.8452724,0.002932075,0.0006537477,0.0005183254,0.00007717996,0.00031097652,0.13830006],"genre_scores_gemma":[0.9146502,0.0007435374,0.038282406,0.0020737096,0.00010442135,0.000017614697,0.00037635793,0.000042836557,0.04370894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706143,0.0001934242,0.0003175057,0.0009613779,0.00070106506,0.0007651673],"domain_scores_gemma":[0.9984254,0.00021060581,0.00013984331,0.0006828533,0.00027025238,0.0002710245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028364736,0.00036493124,0.00035398846,0.0005372957,0.0010751883,0.00022601626,0.0015465424,0.00010580658,0.00009744541],"category_scores_gemma":[0.000027394046,0.00042404747,0.00017028861,0.0013830899,0.00030854996,0.0008949441,0.0012127821,0.00036978634,0.00009611321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011765437,0.00068840716,0.004376688,0.000109569686,0.00079870445,0.00026183654,0.002604955,0.077726305,0.002699597,0.84605753,0.058463335,0.006095401],"study_design_scores_gemma":[0.015580137,0.0008366646,0.029557522,0.0007106038,0.00060380314,0.00012262174,0.007712957,0.6437379,0.0008402294,0.01187307,0.2842387,0.004185753],"about_ca_topic_score_codex":0.0002699005,"about_ca_topic_score_gemma":0.00016535065,"teacher_disagreement_score":0.90337723,"about_ca_system_score_codex":0.00051850313,"about_ca_system_score_gemma":0.00060295407,"threshold_uncertainty_score":0.9998211},"labels":[],"label_agreement":null},{"id":"W7117339766","doi":"","title":"Fairness in the k-Server Problem","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Competitive analysis; Online algorithm; Randomized algorithm; Metric (unit); Deterministic algorithm; Tree (set theory); Adversary; Key (lock)","score_opus":0.04458286777791705,"score_gpt":0.2949136726583961,"score_spread":0.25033080488047904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117339766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4674289,0.001777818,0.33369747,0.09482918,0.0024332162,0.0034661877,0.0000058629766,0.00027945,0.09608191],"genre_scores_gemma":[0.98380595,0.00024817663,0.0017345314,0.0048763542,0.00006051944,0.00010206309,0.0000036362492,0.00001231608,0.009156434],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99678236,0.000636996,0.00062514807,0.0007392211,0.0004970587,0.0007192292],"domain_scores_gemma":[0.99811006,0.00023825301,0.00011855796,0.0012201744,0.0002190938,0.00009387378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017535116,0.0002769512,0.0002792368,0.0002803684,0.0003691702,0.00052400364,0.0025761889,0.00016475598,0.0002077709],"category_scores_gemma":[0.00012018221,0.00020960224,0.00012395225,0.0030308426,0.00018775876,0.00080377614,0.0007256781,0.0006347684,0.0005107123],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025524827,0.0008060133,0.73426706,0.0002869945,0.00006264638,0.00007090121,0.010098074,0.008245443,0.000090384245,0.21456736,0.006754433,0.024725161],"study_design_scores_gemma":[0.0025698987,0.00024383557,0.72324646,0.00069528737,0.000033171662,0.000010952081,0.0009596973,0.2012216,0.00042063856,0.013535201,0.056279756,0.0007835224],"about_ca_topic_score_codex":0.00017423116,"about_ca_topic_score_gemma":0.00019266305,"teacher_disagreement_score":0.5163771,"about_ca_system_score_codex":0.00008781791,"about_ca_system_score_gemma":0.00044849658,"threshold_uncertainty_score":0.8547331},"labels":[],"label_agreement":null},{"id":"W7117548698","doi":"10.1145/3772290.3772317","title":"Linear Search for Capturing a Moving Target by Two Robots in the F2F Model","year":2025,"lang":"","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Mobile robot; Constant (computer programming); Line (geometry); Trajectory; Search algorithm","score_opus":0.04213346926334563,"score_gpt":0.3350641539226308,"score_spread":0.2929306846592852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117548698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005143861,0.00033633484,0.97139376,0.014216692,0.00018233535,0.0013844859,0.000013286383,0.0000623266,0.0118963625],"genre_scores_gemma":[0.52070886,0.00013834734,0.45172733,0.0055608694,0.000064496155,0.00018989359,0.000016227761,0.000022930442,0.02157105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701893,0.00029547658,0.0005491073,0.0007222122,0.00052599586,0.0008882755],"domain_scores_gemma":[0.99852,0.00040997434,0.000053998865,0.00069736753,0.00019933758,0.00011927676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024476286,0.00024753684,0.0002683166,0.000306088,0.00046719477,0.0007364845,0.0018416864,0.00010948456,0.000047617366],"category_scores_gemma":[0.00008989891,0.00019079924,0.00012680987,0.001245417,0.00009115212,0.00061469065,0.0006569892,0.0005126464,0.000014191609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013232967,0.0001492427,0.00011866005,0.000080384074,0.000014627961,0.0000017922368,0.0038030534,0.93449414,0.00016211106,0.051739685,0.0036268581,0.005796233],"study_design_scores_gemma":[0.0011370134,0.00005063871,0.000011145538,0.000082855404,0.0000046463347,0.0000010215907,0.00032533205,0.99274325,0.0010201044,0.003612507,0.00080667634,0.00020483405],"about_ca_topic_score_codex":0.0003550847,"about_ca_topic_score_gemma":0.00007535178,"teacher_disagreement_score":0.5201945,"about_ca_system_score_codex":0.00010469557,"about_ca_system_score_gemma":0.0005463195,"threshold_uncertainty_score":0.77805674},"labels":[],"label_agreement":null},{"id":"W7118002167","doi":"10.1145/3712285.3787159","title":"10.1145/3712285.3787159","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Matching (statistics); Component (thermodynamics); Key (lock); System integration","score_opus":0.008104480321622224,"score_gpt":0.19079679960172505,"score_spread":0.18269231928010282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118002167","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027244534,0.000020927384,0.0025958787,0.0016452717,0.0000033168503,0.00015008403,0.0000016025364,0.00026508837,0.9952906],"genre_scores_gemma":[0.0000688671,6.670198e-7,0.010965496,0.00029607562,0.00003508361,0.000012423811,0.0000032583948,0.000008177633,0.98860997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910843,0.00004530217,0.00012703748,0.00024399448,0.00021819453,0.00025701552],"domain_scores_gemma":[0.9993151,0.000029019558,0.000014735408,0.0004090612,0.000054332988,0.00017776161],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016612094,0.000086044325,0.00009123745,0.00007614218,0.00008586798,0.0001524426,0.00063280354,0.000033848017,0.9802078],"category_scores_gemma":[0.000017604056,0.00008202428,0.00003382072,0.00040571508,0.000017151486,0.00026541535,0.0000973174,0.00006859709,0.9799808],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055299174,0.000035949586,1.11147756e-7,0.0000019178613,0.0000042815723,0.000003936692,0.000039765426,0.0024350304,0.000019680232,0.00010693468,0.15488684,0.84246004],"study_design_scores_gemma":[0.00013194076,0.000080635196,0.00001167119,0.000005174579,9.382945e-7,0.00000386367,1.4572166e-7,0.063083604,0.000029465049,0.00003598373,0.93650925,0.00010732147],"about_ca_topic_score_codex":0.000008444358,"about_ca_topic_score_gemma":6.59164e-8,"teacher_disagreement_score":0.8423527,"about_ca_system_score_codex":0.000018397397,"about_ca_system_score_gemma":0.000037489164,"threshold_uncertainty_score":0.33448532},"labels":[],"label_agreement":null},{"id":"W7124137218","doi":"10.65109/zbuc3779","title":"Optimal solutions for moving target search","year":2009,"lang":"","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Polynomial; Work (physics); Time complexity; Adaptation (eye)","score_opus":0.06204276209070982,"score_gpt":0.3152180448769508,"score_spread":0.253175282786241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124137218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010469756,0.00027187777,0.9588522,0.021124251,0.0003506781,0.00094962504,0.000013609408,0.0001968693,0.01813619],"genre_scores_gemma":[0.16042477,0.00010520015,0.82060397,0.0017482656,0.00018696737,0.000023934406,0.000012343226,0.000013406899,0.01688111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668586,0.00013531385,0.00046377548,0.00070343964,0.0005260016,0.0014856039],"domain_scores_gemma":[0.9981741,0.00014891055,0.00006125965,0.0006115498,0.00057501177,0.0004292128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014861904,0.00023445606,0.0002447065,0.00025250367,0.0012168247,0.00090853294,0.0010856192,0.00014070189,0.00087464653],"category_scores_gemma":[0.0001169981,0.00023472609,0.0001981329,0.00080255413,0.00010124733,0.0010926798,0.00037281914,0.0002840789,0.00019472056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001726207,0.00032470154,0.000012105943,0.00002276382,0.000020460428,0.0000032028233,0.0012652262,0.5570953,0.0003706324,0.3756849,0.011410787,0.053772684],"study_design_scores_gemma":[0.00066796417,0.00065896154,0.0001284632,0.000023291857,0.0000053383983,0.0000068535933,0.00009718716,0.98676527,0.00046625652,0.002652327,0.008229298,0.00029878947],"about_ca_topic_score_codex":0.000016585826,"about_ca_topic_score_gemma":0.0000017619752,"teacher_disagreement_score":0.42966998,"about_ca_system_score_codex":0.00009467019,"about_ca_system_score_gemma":0.0005496562,"threshold_uncertainty_score":0.9576766},"labels":[],"label_agreement":null},{"id":"W7132860486","doi":"","title":"Online Non-preemptive Resource Constrained Scheduling","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Queue; Scheduling (production processes); Workload; Flow shop scheduling; Job scheduler; Job queue; Rate-monotonic scheduling","score_opus":0.0323710719327489,"score_gpt":0.36089934038133753,"score_spread":0.3285282684485886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132860486","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051940605,0.0045184293,0.7584693,0.013450451,0.0059031225,0.0037425263,0.00012530074,0.0013508877,0.16049941],"genre_scores_gemma":[0.27550825,0.0012154373,0.2919951,0.0016230796,0.0014320292,0.00016146377,0.0033123356,0.00038044876,0.42437187],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501777,0.00026182688,0.0008661614,0.0017298607,0.001121991,0.0010023942],"domain_scores_gemma":[0.99694663,0.00030642576,0.00043151563,0.0010903296,0.00068619277,0.0005388748],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007972045,0.0008117775,0.00075328746,0.00070611463,0.00047524512,0.001280856,0.0016595979,0.00065192,0.0008213324],"category_scores_gemma":[0.00029493612,0.00084970193,0.0003667071,0.001906675,0.0002430591,0.00041177374,0.00048983237,0.001898432,0.0013283277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044280273,0.0020332623,0.000055837132,0.0046931375,0.0014633721,0.0008936215,0.5924782,0.2259914,0.0086879255,0.05811524,0.011875852,0.09326933],"study_design_scores_gemma":[0.0007675621,0.00032379266,0.00007891181,0.002087764,0.00010281451,0.000024578692,0.028537111,0.9547491,0.00088226446,0.0005588155,0.010918957,0.0009683178],"about_ca_topic_score_codex":0.0001753707,"about_ca_topic_score_gemma":0.000128389,"teacher_disagreement_score":0.72875774,"about_ca_system_score_codex":0.0001860467,"about_ca_system_score_gemma":0.0014353938,"threshold_uncertainty_score":0.9997559},"labels":[],"label_agreement":null},{"id":"W7132863946","doi":"","title":"Optimistic Competitive Analysis: Stochastic Models, Predictions, and Revocable Decisions","year":2025,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Greedy algorithm; Matching (statistics); Interval (graph theory); Focus (optics); Selection (genetic algorithm); Measure (data warehouse)","score_opus":0.04402059034877745,"score_gpt":0.342868087598482,"score_spread":0.2988474972497045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132863946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018633505,0.0030388949,0.95952797,0.00063160085,0.0006597506,0.0010726475,0.00007238835,0.0001893261,0.03462107],"genre_scores_gemma":[0.5620333,0.01193557,0.1935861,0.00043813136,0.00016427302,0.00054274255,0.0024747122,0.000097681936,0.22872752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953856,0.00042432582,0.0008806752,0.0016351932,0.0009510139,0.00072321674],"domain_scores_gemma":[0.99526775,0.0012207734,0.0004512102,0.0012147822,0.0013162914,0.0005292034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007523393,0.0006475561,0.0010359976,0.0017308822,0.0011653109,0.00092600356,0.0010392197,0.000494923,0.00034401566],"category_scores_gemma":[0.00075425126,0.00070327416,0.00032472739,0.00456804,0.00015301642,0.00063191744,0.00043863888,0.0009525943,0.000046036323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004924028,0.00015675566,0.0000059756317,0.00009743175,0.0008856676,0.000007354857,0.008151271,0.866532,0.0000040496757,0.12151351,0.00059946976,0.0019972567],"study_design_scores_gemma":[0.00057668384,0.00018302015,0.00018263537,0.000914453,0.0017365986,0.000005055047,0.0064179483,0.9858738,0.0000041000235,0.0031695778,0.00038598286,0.00055015663],"about_ca_topic_score_codex":0.00041381302,"about_ca_topic_score_gemma":0.00051327085,"teacher_disagreement_score":0.76594186,"about_ca_system_score_codex":0.00018736275,"about_ca_system_score_gemma":0.0011673114,"threshold_uncertainty_score":0.9995418},"labels":[],"label_agreement":null},{"id":"W7133027849","doi":"","title":"Approximate truthful mechanisms for the knapsack problem, and negative results using a stack model for local ratio algorithms","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Approximation algorithm; Polynomial-time approximation scheme; Set (abstract data type); Stack (abstract data type); Set cover problem; Bandwidth (computing); Tree (set theory); Facility location problem","score_opus":0.07379328664914889,"score_gpt":0.36653791996931046,"score_spread":0.29274463332016154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133027849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007896925,0.00030700455,0.9859398,0.002791662,0.00041793886,0.0096175065,0.00028143273,0.000113181966,0.00045251477],"genre_scores_gemma":[0.011308901,0.00039597886,0.9686376,0.00032604247,0.00020842429,0.0013525881,0.00042644786,0.00013643785,0.017207613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950163,0.00020957939,0.0011375431,0.0016819055,0.0008039923,0.0011507233],"domain_scores_gemma":[0.99513376,0.0010938003,0.0010227732,0.0008624929,0.0015507413,0.00033641935],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020145033,0.0008334252,0.00077110686,0.0002650896,0.0016946963,0.0013121304,0.0011036403,0.000529373,0.000015802616],"category_scores_gemma":[0.00031963037,0.0006823527,0.00028762178,0.0006420613,0.000262851,0.0009211289,0.00023830142,0.0005517112,0.0000049968185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000862902,0.00013634241,5.4642467e-8,0.00046905753,0.00015687902,8.036996e-7,0.062494874,0.8218862,0.00032774956,0.08516509,0.00028679747,0.02821329],"study_design_scores_gemma":[0.0041996334,0.00053437834,6.829458e-7,0.0002847037,0.00016796477,0.000007682792,0.010802357,0.95444685,0.0018241726,0.026696842,0.00026181643,0.00077290286],"about_ca_topic_score_codex":0.00012171411,"about_ca_topic_score_gemma":0.00025901262,"teacher_disagreement_score":0.13256072,"about_ca_system_score_codex":0.0002653423,"about_ca_system_score_gemma":0.0012231419,"threshold_uncertainty_score":0.9997246},"labels":[],"label_agreement":null},{"id":"W7148952270","doi":"10.70675/95f0b6c8z16efz4491za4fbzfd1a8f4a96fb","title":"A guide book for the traveller on graphs full of blockages","year":2019,"lang":"","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Statistical analysis; Graph; Limiting","score_opus":0.025316668763055265,"score_gpt":0.3028194717871067,"score_spread":0.27750280302405145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148952270","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021049826,0.0014341964,0.8880607,0.002960598,0.0023508903,0.00524591,0.000041389336,0.000070133145,0.0996257],"genre_scores_gemma":[0.018046338,0.004196268,0.028666662,0.0030625002,0.00009154644,0.00039536942,0.00019596585,0.000081132006,0.9452642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688816,0.000125643,0.00091750856,0.00077535625,0.00079755386,0.000495806],"domain_scores_gemma":[0.99613553,0.0011408896,0.0005134862,0.0011537548,0.00093864975,0.00011766003],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008500497,0.0004229532,0.0004898817,0.0003444145,0.00033297838,0.00025331037,0.0018357786,0.00030480788,0.0012207342],"category_scores_gemma":[0.00012407664,0.0002758632,0.00050260895,0.0005198062,0.00010523768,0.00023418317,0.0000899717,0.00032108364,0.00012759506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008049135,0.0009669459,0.000022140113,0.001525951,0.0008493689,0.0000022141164,0.021217855,0.05425228,0.0031396132,0.5774038,0.16207002,0.1777449],"study_design_scores_gemma":[0.0015146041,0.0019103151,0.0001467828,0.00035251377,0.00008651384,0.0000022998627,0.0015977342,0.87409544,0.0076752026,0.001109704,0.110912696,0.0005962215],"about_ca_topic_score_codex":0.00008288129,"about_ca_topic_score_gemma":0.0000515833,"teacher_disagreement_score":0.859394,"about_ca_system_score_codex":0.00002634112,"about_ca_system_score_gemma":0.000503335,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W7154030739","doi":"10.1145/3772318.3808930","title":"10.1145/3772318.3808930","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Key (lock)","score_opus":0.008183086042812435,"score_gpt":0.19128174493136305,"score_spread":0.18309865888855062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154030739","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020813588,0.000021105505,0.0026450367,0.0016257591,0.0000033571569,0.00014872645,0.0000016630801,0.00026598905,0.99526757],"genre_scores_gemma":[0.00006301656,6.834203e-7,0.010868479,0.00028907924,0.000036809266,0.000012130885,0.0000033677188,0.000008260984,0.98871815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991082,0.000045346904,0.00012715178,0.00024406794,0.00021784552,0.00025736785],"domain_scores_gemma":[0.9993148,0.000028069911,0.000014744676,0.0004085308,0.000053600408,0.00018029356],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016572651,0.00008612741,0.00009149416,0.00007519567,0.00008597776,0.00015292988,0.0006351911,0.00003387247,0.9789133],"category_scores_gemma":[0.000017013253,0.00008209406,0.00003391846,0.00039916753,0.000017199613,0.00026575435,0.00009783542,0.00006863975,0.97885644],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005572362,0.00003261469,8.894584e-8,0.0000019255374,0.00000420354,0.000004068367,0.000039297945,0.0032730978,0.000016517999,0.00011399938,0.1440119,0.8524967],"study_design_scores_gemma":[0.00012945989,0.00008030936,0.000009430567,0.000005282301,9.2119456e-7,0.0000043926393,1.5597941e-7,0.06315117,0.00003496654,0.00003666968,0.93644,0.00010725244],"about_ca_topic_score_codex":0.0000063924904,"about_ca_topic_score_gemma":5.8283376e-8,"teacher_disagreement_score":0.85238945,"about_ca_system_score_codex":0.000018445753,"about_ca_system_score_gemma":0.000037180627,"threshold_uncertainty_score":0.33476987},"labels":[],"label_agreement":null},{"id":"W745574","doi":"10.1007/978-1-4939-2864-4_534","title":"Analyzing Cache Behaviour in Multicore Architectures","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Multi-core processor; Computer science; Parallel computing; Computer architecture; Embedded system","score_opus":0.01548729466320558,"score_gpt":0.2563340607380659,"score_spread":0.24084676607486033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W745574","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058952046,0.0008365072,0.19071488,0.0005709608,0.0005976362,0.00056723785,0.000054567077,0.00014394148,0.8064553],"genre_scores_gemma":[0.0026584584,0.0031613775,0.24232368,0.00011881497,0.0005100904,0.0000465323,0.00003766096,0.00012746516,0.7510159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997931,0.000045543296,0.0005891614,0.00059331045,0.0004701685,0.00037083877],"domain_scores_gemma":[0.99857235,0.00016723515,0.00028100898,0.00068720017,0.00013761161,0.00015462081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203724,0.0003366623,0.00047300948,0.0006104787,0.000048068483,0.000042345237,0.0010624815,0.0002836716,0.00015531662],"category_scores_gemma":[0.000056219204,0.0002724699,0.00016669137,0.00011482356,0.00011596545,0.0001377351,0.00037812995,0.0004893832,0.00006188352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011958691,0.00012473861,0.0018356153,0.0001122268,0.00009580894,0.00022301904,0.0022528865,0.0013282561,0.000016362294,0.10152154,0.00085005094,0.89162755],"study_design_scores_gemma":[0.010991136,0.0019006854,0.019807966,0.0066223233,0.00030409932,0.00019813293,0.00010195469,0.16579084,0.0005428586,0.29412127,0.48997137,0.00964736],"about_ca_topic_score_codex":0.000039196548,"about_ca_topic_score_gemma":0.000051056686,"teacher_disagreement_score":0.8819802,"about_ca_system_score_codex":0.00007106244,"about_ca_system_score_gemma":0.00019349658,"threshold_uncertainty_score":0.99997276},"labels":[],"label_agreement":null},{"id":"W86291329","doi":"10.5555/1838206.1838253","title":"On learning in agent-centered search","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Convergence (economics); Measure (data warehouse); Unification; Process (computing); Domain (mathematical analysis); Artificial intelligence; Function (biology); Machine learning; Mathematics; Data mining","score_opus":0.03486345185458317,"score_gpt":0.29377014463131806,"score_spread":0.2589066927767349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86291329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21046676,0.0000030167423,0.63346225,0.0045297523,0.00041136553,0.00023850436,1.6583421e-7,0.0003357943,0.1505524],"genre_scores_gemma":[0.9707588,0.0000037777022,0.022937376,0.00040463268,0.000009988946,0.0000033582483,9.3183263e-7,0.0000033587987,0.0058778026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935496,0.00005226245,0.0000789926,0.00016488074,0.00017002756,0.00017889851],"domain_scores_gemma":[0.9996686,0.000048317484,0.000008762899,0.00018257862,0.000028002616,0.00006372634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030508285,0.000041313804,0.00004304406,0.00011793583,0.000046349433,0.000109919114,0.00034295127,0.00002751549,0.00033933658],"category_scores_gemma":[0.000048155405,0.00003494523,0.0000147268265,0.00023458798,0.000013142229,0.00015435665,0.000113575705,0.0003341521,0.00033567398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009563653,0.00027176735,0.011372252,0.0000095392625,0.0000046614264,0.000028536871,0.0017946098,0.028273119,0.00765759,0.8414928,0.0018887757,0.107196815],"study_design_scores_gemma":[0.0005069939,0.00009107921,0.004222308,0.000006867926,1.1641507e-7,0.0000022758234,0.000023716624,0.98713106,0.0013538763,0.0010332179,0.0055312975,0.00009719902],"about_ca_topic_score_codex":0.000024798981,"about_ca_topic_score_gemma":0.000052077674,"teacher_disagreement_score":0.95885795,"about_ca_system_score_codex":0.000008767517,"about_ca_system_score_gemma":0.000029732635,"threshold_uncertainty_score":0.43145218},"labels":[],"label_agreement":null},{"id":"W905866239","doi":"","title":"An approximate dynamic programming approach for semi-cooperative multi-agent resource management","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Resource management (computing); Dynamic programming; Distributed computing; Algorithm","score_opus":0.03760110983344896,"score_gpt":0.3068174748436359,"score_spread":0.269216365010187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W905866239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012244584,0.00004671392,0.9906872,0.00014057808,0.000057252062,0.001555138,0.000001696094,0.00033843075,0.00705056],"genre_scores_gemma":[0.08313771,0.000007472764,0.91156137,0.0002669945,0.000021130118,0.00048070302,0.000047451522,0.000016106032,0.0044610715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854475,0.0000932985,0.00019716422,0.00038766884,0.00022082,0.0005563013],"domain_scores_gemma":[0.999155,0.000019013774,0.00004843827,0.00048002027,0.000074809024,0.00022270723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031919,0.00014962361,0.00012328202,0.000099248275,0.00023291852,0.00028248213,0.0006100535,0.000044900306,0.000011960666],"category_scores_gemma":[0.0000071545737,0.00012084641,0.000048046313,0.00028792323,0.000032249187,0.000769925,0.00020814996,0.0000792587,0.000015320478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003517937,0.0045150737,0.00064738485,0.00048573356,0.00019681748,0.0000034860384,0.016526243,0.12707311,0.00045695808,0.39660943,0.0017408051,0.45170978],"study_design_scores_gemma":[0.0005284482,0.0000752919,0.000077742414,0.0000052922633,0.000005026015,0.000002639744,0.0007126245,0.9857446,0.0001503985,0.000022448952,0.012490369,0.00018513043],"about_ca_topic_score_codex":0.000003404746,"about_ca_topic_score_gemma":0.0000015675064,"teacher_disagreement_score":0.8586715,"about_ca_system_score_codex":0.00006083491,"about_ca_system_score_gemma":0.000012134776,"threshold_uncertainty_score":0.49279734},"labels":[],"label_agreement":null},{"id":"W964625527","doi":"10.1007/978-3-642-36065-7_1","title":"Mobility and Computations: Some Open Research Directions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed computing; Focus (optics); Class (philosophy); Mobile robot; Robotics; Mobile computing; Software; Distributed algorithm; Task (project management); Artificial intelligence; Robot; Computer network; Systems engineering; Operating system","score_opus":0.08173406732485497,"score_gpt":0.35493234680769836,"score_spread":0.27319827948284336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964625527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026264835,0.0007408246,0.9801983,0.0031036076,0.000638008,0.0014178628,0.0000047971153,0.00013530166,0.01373501],"genre_scores_gemma":[0.021658415,0.0008200009,0.97079253,0.0017406914,0.00032763137,0.00014386674,0.0000114215945,0.000047662965,0.0044577746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958689,0.00016892228,0.0004780451,0.0016714038,0.001114996,0.0006977174],"domain_scores_gemma":[0.99633014,0.0010861286,0.00013622803,0.0013209534,0.0008247018,0.0003018594],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029571797,0.00032832022,0.0004117167,0.0011123057,0.00088367297,0.0029890528,0.0041854624,0.00024090547,0.00008373082],"category_scores_gemma":[0.00023510537,0.00029957507,0.000053047905,0.0010555409,0.0014507251,0.0020499986,0.005045025,0.0011412139,0.00014335394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024417004,0.00007656155,0.000041314357,0.000042465705,0.0000101627875,0.000013142231,0.0008676309,0.023637934,0.000019966483,0.28987455,0.0002368376,0.685177],"study_design_scores_gemma":[0.00017948702,0.00011467938,0.00019474991,0.00014522328,0.0000014049177,0.000019636083,2.9837807e-7,0.5444888,0.00004517937,0.44972143,0.004804962,0.00028412932],"about_ca_topic_score_codex":0.00019635604,"about_ca_topic_score_gemma":0.00008584079,"teacher_disagreement_score":0.6848929,"about_ca_system_score_codex":0.00028662613,"about_ca_system_score_gemma":0.0007961178,"threshold_uncertainty_score":0.99994564},"labels":[],"label_agreement":null},{"id":"W98190632","doi":"10.1007/s00453-003-1018-5","title":"Multicast Pull Scheduling: When Fairness Is Fine","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Unicast; Scheduling (production processes); Computer network; Distributed computing; Competitive analysis; Approximation algorithm; Parallel computing; Algorithm; Mathematical optimization; Upper and lower bounds; Mathematics","score_opus":0.02439670081495226,"score_gpt":0.2598636974486351,"score_spread":0.2354669966336828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98190632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038685504,0.000093604925,0.9861565,0.0032741176,0.00025612715,0.00016745878,0.0000038501908,0.00017315529,0.009488311],"genre_scores_gemma":[0.10704106,0.000016634782,0.88816494,0.0011830974,0.000054531156,0.00002154303,0.000005654853,0.000016866064,0.0034956571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986951,0.0000813308,0.00020079369,0.00038344658,0.00028519396,0.00035415223],"domain_scores_gemma":[0.999054,0.00005942712,0.000047159065,0.00051406317,0.0001554942,0.00016986349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026277194,0.00012983089,0.0001355554,0.00008921467,0.00013489163,0.00019149057,0.0005906733,0.00006603821,0.00039301126],"category_scores_gemma":[0.00010510149,0.000120710116,0.00005475723,0.0003240176,0.00004660517,0.0003619666,0.00012597114,0.00015716428,0.0006197652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000929311,0.00080881885,0.00062540045,0.000058715366,0.00012824892,0.00012949646,0.006939395,0.004198412,0.0011019675,0.5542776,0.019130217,0.41259244],"study_design_scores_gemma":[0.00083187857,0.00007603442,0.00006870527,0.00001737321,0.0000050060403,0.000046581426,0.000041207993,0.87486184,0.006249796,0.011270428,0.106187314,0.00034384578],"about_ca_topic_score_codex":0.000013178526,"about_ca_topic_score_gemma":0.0000015891679,"teacher_disagreement_score":0.8706634,"about_ca_system_score_codex":0.000025612104,"about_ca_system_score_gemma":0.00008376113,"threshold_uncertainty_score":0.79660344},"labels":[],"label_agreement":null}]}