{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":59,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":59,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"99cd3cdc1891","filters":{"venue":"Symposium on Discrete Algorithms"}},"results":[{"id":"W2044014345","doi":"10.5555/1109557.1109599","title":"Rank/select operations on large alphabets: a tool for text indexing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":190,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Search engine indexing; Rank (graph theory); Generalization; String (physics); Variety (cybernetics); Computer science; Representation (politics); Alphabet; Combinatorics; Binary number; Binary search algorithm; Theoretical computer science; Mathematics; Algorithm; Information retrieval; Search algorithm; Artificial intelligence; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.008969900852929844,"gpt":0.2570800764681503,"spread":0.2481101756152204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004621488,0.0003986147,0.0003465864,0.0002276178,0.0007731514,0.0005946356,0.001088927,0.0001568163,0.00002903456],"category_scores_gemma":[0.00003810518,0.0003288819,0.0002052313,0.000460554,0.00004312114,0.0009085161,0.0002862464,0.0002693249,0.0001281529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001078982,"about_ca_system_score_gemma":0.0001046873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001057569,"about_ca_topic_score_gemma":0.00002218427,"domain_scores_codex":[0.9970716,0.00009971038,0.0004888374,0.0009739427,0.0005790313,0.0007869253],"domain_scores_gemma":[0.9983193,0.0002199132,0.0001075594,0.001083206,0.0001405232,0.000129444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003387009,0.002317634,0.0003193447,0.0001334883,0.0002374163,0.0001054098,0.001138558,0.03625705,0.03504686,0.713357,0.08281572,0.1279328],"study_design_scores_gemma":[0.003038549,0.001304524,0.0008025909,0.0001681269,0.00002868795,0.00001756974,0.00002950123,0.9078004,0.01573731,0.003731263,0.06640255,0.0009389583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003877284,0.0001458977,0.9877126,0.002408786,0.0008979346,0.0009985911,0.0003434785,0.0003987123,0.003216733],"genre_scores_gemma":[0.6749784,0.0001077132,0.3080802,0.004397094,0.002994128,0.00124882,0.001201826,0.0001967221,0.006795134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8715433,"threshold_uncertainty_score":0.9999163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081869611","doi":"10.5555/1070432.1070548","title":"An optimal Bloom filter replacement","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; Hash function; Data structure; Set (abstract data type); Computer science; Element (criminal law); Representation (politics); Amortized analysis; Filter (signal processing); Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Constant (computer programming); Bloom; Hash table","retraction":null,"screen_n_in":null,"score":{"opus":0.01162427078857109,"gpt":0.2517560130831717,"spread":0.2401317422946007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225759,0.0002546499,0.0001966103,0.0001237978,0.0001981793,0.0003478378,0.001038953,0.00007651644,0.00007311129],"category_scores_gemma":[0.000006158427,0.0002217141,0.0001361422,0.0001700241,0.00004052916,0.0007879948,0.0001871991,0.0002192614,0.0003556858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008691705,"about_ca_system_score_gemma":0.00004053808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004045701,"about_ca_topic_score_gemma":0.000004396045,"domain_scores_codex":[0.997909,0.0001000076,0.0002899154,0.0007453719,0.0004897884,0.0004658806],"domain_scores_gemma":[0.9983472,0.00003996153,0.00008396807,0.001238605,0.00005711985,0.000233211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009791845,0.003362804,0.0009802654,0.00006871014,0.0006161195,0.0004473019,0.009192023,0.110181,0.1215122,0.052549,0.05121813,0.6488932],"study_design_scores_gemma":[0.001112651,0.001319132,0.0002552042,0.00004219684,0.00002149407,0.00005046865,0.0000657363,0.9515504,0.01388033,0.00008627826,0.03098694,0.0006291275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2524948,0.0005367532,0.688049,0.02278543,0.002534866,0.0008416076,0.00006504972,0.001810663,0.03088186],"genre_scores_gemma":[0.9514112,0.00005956242,0.04084374,0.003032931,0.0008461546,0.00005181735,0.00003055543,0.00003453334,0.003689533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8413695,"threshold_uncertainty_score":0.9041238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395489635","doi":"10.5555/2627817.2627898","title":"Dynamic graph connectivity in polylogarithmic worst case time","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Time complexity; Binary logarithm; Amortized analysis; Computer science; Graph; Enhanced Data Rates for GSM Evolution; Preprocessor; Upper and lower bounds; Data structure; Matching (statistics); Discrete mathematics; Path (computing); Sequence (biology); Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006188313789722419,"gpt":0.2324596412625818,"spread":0.2262713274728593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003857109,0.000445281,0.0004405061,0.0004531453,0.0002768866,0.0004329858,0.001153074,0.0001933742,0.0001534368],"category_scores_gemma":[0.00002963982,0.000378734,0.0001542614,0.0008690794,0.0001262,0.001566306,0.000667551,0.0004798635,0.001064063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001592969,"about_ca_system_score_gemma":0.0000678357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00172307,"about_ca_topic_score_gemma":0.00008720208,"domain_scores_codex":[0.996923,0.0002231898,0.0004771025,0.001101927,0.000475194,0.0007995536],"domain_scores_gemma":[0.9978022,0.0002321976,0.0001631751,0.001406675,0.00008850281,0.0003072566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002476123,0.004760347,0.003463912,0.0002913403,0.0005396834,0.02727442,0.006470518,0.008308977,0.08255586,0.03882865,0.02389927,0.8033594],"study_design_scores_gemma":[0.001296098,0.0004008414,0.004205192,0.0001123478,0.00001068028,0.001130639,0.00007700974,0.9847097,0.0008640258,0.005675933,0.0006729524,0.0008445231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4568598,0.0006146805,0.5140634,0.01002019,0.002685655,0.003322613,0.0002774204,0.001511082,0.0106451],"genre_scores_gemma":[0.952934,0.00007614667,0.04477235,0.0006385566,0.0001214491,0.0002599972,0.00007318627,0.0000633327,0.001060937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764008,"threshold_uncertainty_score":0.9998665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01177073521394966,"gpt":0.2737123337367909,"spread":0.2619415985228413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001016713,0.0003289055,0.0004627979,0.0002569601,0.0003224251,0.0003784203,0.0007339581,0.0001203943,0.00001123436],"category_scores_gemma":[0.00004714889,0.0002864459,0.0003058336,0.0004553773,0.00009251535,0.0008593638,0.00009456021,0.0001509559,0.00005675669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106983,"about_ca_system_score_gemma":0.0001868132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616938,"about_ca_topic_score_gemma":0.000003375875,"domain_scores_codex":[0.9975237,0.0001826716,0.0004643488,0.0008142947,0.000521707,0.0004932464],"domain_scores_gemma":[0.9984729,0.0002632545,0.0001613856,0.0006256927,0.0002117171,0.0002650411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002537957,0.0005535025,0.000001649452,0.00002593074,0.0001874518,0.00003609341,0.001169953,0.3387401,0.002652328,0.1133443,0.000370774,0.5403799],"study_design_scores_gemma":[0.04569648,0.0006866664,0.0000236734,0.00002376771,0.00003462098,0.00003330891,0.00002444792,0.9060016,0.01518344,0.03037797,0.001439736,0.000474337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00108825,0.0001315955,0.9926645,0.002429705,0.001153694,0.001064812,0.00003810847,0.0003008523,0.001128533],"genre_scores_gemma":[0.07526518,0.00004748116,0.922106,0.0008488852,0.000771932,0.0003843209,0.0002251058,0.00003844121,0.000312606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5672614,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512019713","doi":"10.5555/1496770.1496862","title":"Appointment scheduling with discrete random durations","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":108,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Schedule; Scheduling (production processes); Computer science; Discrete time and continuous time; Mathematical optimization; Job shop scheduling; Overtime; Probability distribution; Integer programming; Random variable; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02785109995475595,"gpt":0.3676772088583154,"spread":0.3398261089035595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007299399,0.0003668053,0.0004399203,0.0002014941,0.002039093,0.00008133395,0.0002170881,0.0002463843,0.0002899863],"category_scores_gemma":[0.0000953346,0.0002652803,0.0001072917,0.0004872463,0.00006276175,0.0003636218,0.00003393046,0.0007664937,0.0002718791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002492082,"about_ca_system_score_gemma":0.0004516283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008468948,"about_ca_topic_score_gemma":0.0000589528,"domain_scores_codex":[0.996743,0.0005244403,0.0008192963,0.0006184615,0.0005192868,0.0007755806],"domain_scores_gemma":[0.9981592,0.0002384101,0.0002594455,0.0006404483,0.0003412793,0.0003612156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006543259,0.001861471,0.01073884,0.000688237,0.000787423,0.0002461443,0.02965768,0.7136005,0.01290148,0.1707394,0.01066237,0.04157316],"study_design_scores_gemma":[0.03855046,0.01062694,0.02050314,0.004119234,0.0005616844,0.00006048096,0.01196248,0.8514979,0.00237997,0.004140691,0.05103695,0.004560095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07803412,0.0002745612,0.6392376,0.1730646,0.001706196,0.007101347,0.0002029521,0.001148263,0.09923031],"genre_scores_gemma":[0.9219124,0.000270074,0.0678065,0.004970801,0.0008711265,0.0004585648,0.000475026,0.00007500869,0.003160476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8438783,"threshold_uncertainty_score":0.9999799,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01183958534583239,"gpt":0.2252779971216926,"spread":0.2134384117758601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575101,0.000283273,0.0003039611,0.0001199934,0.0003157083,0.0001491132,0.001549909,0.0001153863,0.00001111961],"category_scores_gemma":[0.00002120245,0.0002112693,0.0002537498,0.0008332045,0.0003039313,0.0003126982,0.0004432723,0.000321604,0.000003696739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223978,"about_ca_system_score_gemma":0.0001283265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007782922,"about_ca_topic_score_gemma":0.00008228325,"domain_scores_codex":[0.9974603,0.0002784406,0.000498274,0.0006326795,0.0007245122,0.000405785],"domain_scores_gemma":[0.9980025,0.0001483516,0.0002766286,0.001320032,0.0001745497,0.00007790491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002296414,0.0009012559,0.002186992,0.0001268126,0.00005174511,0.000007855712,0.0008022469,0.002087749,0.006419525,0.9731246,0.001718886,0.01254943],"study_design_scores_gemma":[0.002715252,0.0009443537,0.05467756,0.0002287768,0.00005277305,0.00004114033,0.000067512,0.1918368,0.1164421,0.620891,0.01083533,0.001267367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.136882,0.0001973264,0.7234284,0.05232142,0.003209949,0.004341499,0.0005597383,0.00100805,0.07805165],"genre_scores_gemma":[0.9699648,0.00001761869,0.0282504,0.0004970201,0.0001092831,0.00008601729,0.00003761558,0.00002551186,0.001011731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8330828,"threshold_uncertainty_score":0.861531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051837689","doi":"10.5555/1109557.1109667","title":"Scalable leader election","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Leader election; Scalability; Computer science; Protocol (science); Set (abstract data type); Parallel computing; Limit (mathematics); Distributed computing; Computer network; Mathematics; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0078637736390246,"gpt":0.230137101409632,"spread":0.2222733277706073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203797,0.0002239309,0.000215415,0.00009775625,0.0002168614,0.0003171628,0.0005887416,0.0001063925,0.00001998096],"category_scores_gemma":[0.000004912332,0.000193502,0.0001115982,0.000551774,0.00004462575,0.0005219994,0.00007262712,0.0001718359,0.0003270047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008746553,"about_ca_system_score_gemma":0.00004051312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003475832,"about_ca_topic_score_gemma":0.00001448858,"domain_scores_codex":[0.9981264,0.00005647909,0.0003134169,0.0005801258,0.00043345,0.0004901653],"domain_scores_gemma":[0.9990564,0.0000295018,0.0001049019,0.0006285188,0.00008682541,0.00009383627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008479463,0.001199573,0.001867912,0.0001435437,0.0001668886,0.0002458237,0.0006438007,0.01804185,0.07629412,0.5148575,0.3109777,0.07547645],"study_design_scores_gemma":[0.002313168,0.0007976054,0.006242939,0.0001978119,0.00002731813,0.0001520486,0.0000661818,0.4767123,0.059403,0.00857582,0.4438121,0.00169974],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00395247,0.0003324747,0.8798588,0.004749803,0.001873012,0.0003917885,0.00003636894,0.0007119723,0.1080933],"genre_scores_gemma":[0.9721354,0.00002217686,0.008951871,0.0005088505,0.0008665645,0.00008530603,0.00006028111,0.00003427586,0.01733524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.968183,"threshold_uncertainty_score":0.7890782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980569719","doi":"10.5555/338219.338586","title":"Estimating DNA sequence entropy","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Entropy (arrow of time); Sequence (biology); Computer science; Statistical physics; Computational biology; Genetics; Biology; Physics; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.009552694781969635,"gpt":0.2604830810511529,"spread":0.2509303862691833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001129573,0.0002266676,0.0001765969,0.00004059164,0.0001490798,0.00005933093,0.000274235,0.0001208676,0.0004377823],"category_scores_gemma":[0.00002214911,0.0001937846,0.0001714283,0.0001498274,0.0001148313,0.00001185399,0.00004350317,0.000110555,0.0003040963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000231155,"about_ca_system_score_gemma":0.00004027867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009236653,"about_ca_topic_score_gemma":0.000006324009,"domain_scores_codex":[0.9985972,0.00005101036,0.0002342219,0.000518273,0.0002315569,0.0003677585],"domain_scores_gemma":[0.9992772,0.00001015804,0.00006351891,0.0004687824,0.00004075457,0.0001395612],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008405477,0.00006616611,0.000231627,0.00001257719,0.00009521412,0.00003520236,0.000058791,0.004793585,0.9626222,0.0001232534,0.001068835,0.03080845],"study_design_scores_gemma":[0.001320889,0.001754583,0.0005342955,0.000112474,0.0001574281,0.000110464,0.0001033785,0.0730582,0.8443888,0.001152463,0.07586085,0.001446191],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9755821,0.0002601187,0.002188851,0.001401858,0.0002453756,0.0002089669,0.00009413868,0.00007197047,0.01994659],"genre_scores_gemma":[0.9845566,0.0002681161,0.006856155,0.00104881,0.0007192595,0.00003672164,0.0004226648,0.00003753988,0.006054184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1182335,"threshold_uncertainty_score":0.7902305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621248669","doi":"10.5555/1109557.1109588","title":"Cake cutting really is not a piece of cake","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Protocol (science); Bounding overwatch; Upper and lower bounds; Divide and conquer algorithms; Mathematics; Computer science; Value (mathematics); Combinatorics; Algorithm; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.008784925928344135,"gpt":0.2371651895573972,"spread":0.2283802636290531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003801266,0.0002972438,0.0003422185,0.0002210878,0.0001897971,0.0001656919,0.001192805,0.0001272687,0.0000254506],"category_scores_gemma":[0.00001628676,0.0002724645,0.0002436426,0.000748262,0.0001315052,0.0005255681,0.0003405057,0.0002412203,0.00004054515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003335994,"about_ca_system_score_gemma":0.0000741454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173649,"about_ca_topic_score_gemma":0.00005764591,"domain_scores_codex":[0.9974474,0.00008290062,0.000532247,0.0007509759,0.0006602631,0.0005261665],"domain_scores_gemma":[0.9981235,0.0001236603,0.0002562649,0.001233725,0.0001273273,0.000135538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001388208,0.000897056,0.003036964,0.000243328,0.0001859877,0.0001894104,0.003924075,0.0004536746,0.0452769,0.888578,0.01920898,0.03786682],"study_design_scores_gemma":[0.007106573,0.003225268,0.04275328,0.0008676931,0.0002507618,0.0002387005,0.0004007375,0.2051759,0.4597622,0.07654434,0.198811,0.004863496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1371417,0.0007811721,0.7554749,0.0112835,0.002465422,0.001336549,0.001753109,0.001186937,0.08857668],"genre_scores_gemma":[0.9105199,0.0001051916,0.08732172,0.001198515,0.0004400359,0.00003515665,0.0001058305,0.00004084523,0.0002328141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8120337,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169088379","doi":"10.5555/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Resource allocation; Distributed computing; Distributed algorithm; Martingale (probability theory); Mathematical optimization; Load balancing (electrical power); Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02486666529941805,"gpt":0.3175646698991393,"spread":0.2926980045997213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001622264,0.0002493523,0.0003148441,0.0001229474,0.0003598251,0.0003697002,0.000903874,0.0001092558,0.0003990822],"category_scores_gemma":[0.0002516891,0.0001870319,0.000192256,0.0009797072,0.0001599928,0.0002528965,0.0001317104,0.0002081791,0.002131171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183394,"about_ca_system_score_gemma":0.00008666646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001140106,"about_ca_topic_score_gemma":0.00003927638,"domain_scores_codex":[0.9964814,0.0001837605,0.0006723912,0.0007446368,0.001451066,0.0004667619],"domain_scores_gemma":[0.9975807,0.0006979263,0.0002325056,0.001046862,0.0002800339,0.0001619583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003058114,0.001223934,0.01320052,0.00002331876,0.0001313345,0.0001314335,0.001040285,0.01961372,0.06399067,0.540624,0.319208,0.04050693],"study_design_scores_gemma":[0.001676116,0.000308937,0.03365022,0.00005737634,0.00006787907,0.00005183988,0.0007109887,0.01985307,0.02732209,0.480234,0.434863,0.001204567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3729243,0.0002809304,0.1939969,0.02667487,0.001882712,0.001443456,0.001943092,0.001079467,0.3997743],"genre_scores_gemma":[0.9897242,0.000006759652,0.001402101,0.0003328931,0.0004637592,0.00005993196,0.0001066326,0.00002476319,0.007878966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6167999,"threshold_uncertainty_score":0.9986458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065457428","doi":"10.5555/365411.365526","title":"Representing dynamic binary trees succinctly","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; Representation (politics); Amortized analysis; Binary tree; Computer science; Constant (computer programming); Binary search tree; Weight-balanced tree; Contrast (vision); Binary decision diagram; Theoretical computer science; Data structure; Binary expression tree; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Arithmetic; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01167444419750935,"gpt":0.2667827410708196,"spread":0.2551082968733102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003853008,0.0003970475,0.0003481179,0.0002646864,0.0004566326,0.0004174401,0.001778662,0.0001394564,0.00006448552],"category_scores_gemma":[0.00003178145,0.0003287522,0.0001930721,0.0007368957,0.00008209708,0.001245952,0.000985734,0.0003354245,0.0003039983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008991072,"about_ca_system_score_gemma":0.0000590415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001414187,"about_ca_topic_score_gemma":0.00001348934,"domain_scores_codex":[0.9967613,0.000143461,0.0004694767,0.001154334,0.0007161075,0.0007553714],"domain_scores_gemma":[0.9974396,0.000148686,0.0001947939,0.001856688,0.00008706294,0.0002731265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004411826,0.002202276,0.008662325,0.0001422557,0.000502488,0.005461508,0.003240625,0.01314551,0.1060305,0.04188257,0.04050666,0.7777821],"study_design_scores_gemma":[0.001013409,0.0005040609,0.008782722,0.0001487559,0.00002021061,0.0001851844,0.00008188678,0.942977,0.002026732,0.002033722,0.04139578,0.0008305701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06855462,0.001254701,0.8618143,0.01500827,0.003866215,0.0009914747,0.00008471026,0.002114367,0.04631139],"genre_scores_gemma":[0.8754609,0.001361155,0.1093397,0.001647513,0.0009435302,0.0001319522,0.0002357891,0.0001437246,0.01073574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9298314,"threshold_uncertainty_score":0.9999164,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01810498012002898,"gpt":0.2619032041318963,"spread":0.2437982240118673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352531,0.0002183733,0.0001728686,0.0002495863,0.0002021088,0.0002369991,0.000646357,0.000084442,0.00003155974],"category_scores_gemma":[0.00001259178,0.0001687747,0.00005853512,0.0006144922,0.00008455082,0.001081741,0.0001156764,0.0002144702,0.0001709031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006366627,"about_ca_system_score_gemma":0.00007762713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002355868,"about_ca_topic_score_gemma":0.0000417519,"domain_scores_codex":[0.9979938,0.00007313723,0.0002797395,0.0005396429,0.0006207288,0.0004929914],"domain_scores_gemma":[0.9988064,0.00008202407,0.0001008127,0.0006421104,0.0001423806,0.0002262448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000509489,0.001020255,0.0003563878,0.0001138608,0.0002634829,0.0006933977,0.01168429,0.04540448,0.01409587,0.1642675,0.006504893,0.755086],"study_design_scores_gemma":[0.004978078,0.003824594,0.001639856,0.0001797525,0.00003189244,0.0001162349,0.0009802798,0.9282581,0.04161007,0.004242227,0.01236941,0.001769531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004258623,0.00002581649,0.9380558,0.00378284,0.0002864884,0.0003925367,0.000002877551,0.0003349183,0.05669292],"genre_scores_gemma":[0.356058,0.0002139585,0.6277052,0.00324654,0.0006691257,0.0001570676,0.0001024221,0.0001173103,0.01173033],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8828536,"threshold_uncertainty_score":0.6882432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077203993","doi":"10.5555/338219.338231","title":"Weakly chordal graph algorithms via handles","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01185173105347955,"gpt":0.2716441030408071,"spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006789045,0.0005991103,0.0005038641,0.0004715566,0.0005845267,0.0004368707,0.002700995,0.0002058485,0.0004693991],"category_scores_gemma":[0.00002223519,0.0005257035,0.0003613773,0.001537717,0.0004209768,0.001235818,0.0003431107,0.0006646394,0.001380009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090424,"about_ca_system_score_gemma":0.00009073924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006956972,"about_ca_topic_score_gemma":0.000007917479,"domain_scores_codex":[0.9949791,0.0003245025,0.0005598507,0.001467669,0.001293801,0.00137501],"domain_scores_gemma":[0.9970009,0.000229436,0.0001209952,0.001932703,0.0001470359,0.0005688986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002822418,0.000601031,0.0001708918,0.00005076629,0.0002630247,0.0004271124,0.001284429,0.003319871,0.01565974,0.06042702,0.002091754,0.9154221],"study_design_scores_gemma":[0.006793365,0.005536453,0.00339887,0.0003890021,0.0001014564,0.0006659569,0.0002119484,0.400705,0.09491116,0.3552905,0.1263213,0.005674962],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01536151,0.001150653,0.9040505,0.006430221,0.001710151,0.001563675,0.00012129,0.001844308,0.06776766],"genre_scores_gemma":[0.590082,0.003561328,0.3445601,0.004031515,0.002811941,0.001047069,0.0002098924,0.0005716953,0.05312443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9097472,"threshold_uncertainty_score":0.9997194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974542877","doi":"10.5555/1283383.1283520","title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03007951308552398,"gpt":0.2687336219725512,"spread":0.2386541088870272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001644348,0.0005773473,0.0005011432,0.0005316822,0.001247048,0.0005354494,0.001167986,0.0002023574,0.00001232978],"category_scores_gemma":[0.00006998628,0.0004888626,0.0002937192,0.001736364,0.0002113499,0.0009749073,0.0002406312,0.0004561238,0.00003158544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002294113,"about_ca_system_score_gemma":0.0001710092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000953799,"about_ca_topic_score_gemma":0.0001738036,"domain_scores_codex":[0.9956868,0.00009008035,0.0007481955,0.001314397,0.0009491385,0.001211381],"domain_scores_gemma":[0.9971563,0.0005007719,0.0003937767,0.001147083,0.0004421515,0.0003598915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00168982,0.004454155,0.00590181,0.001668858,0.001978773,0.0003114214,0.01278887,0.06445301,0.0136921,0.4038747,0.007499862,0.4816866],"study_design_scores_gemma":[0.004418265,0.003657773,0.003181885,0.0003333905,0.0001163565,0.0002299515,0.0004856153,0.9389687,0.006349889,0.01858553,0.02184885,0.001823757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003404912,0.00009437509,0.9862601,0.001394192,0.001076115,0.001634218,0.00006149506,0.0006349487,0.005439672],"genre_scores_gemma":[0.1903277,0.00004496747,0.8016874,0.0006087736,0.001297874,0.001029097,0.0002865407,0.0001764615,0.004541162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8745157,"threshold_uncertainty_score":0.9997563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037688351","doi":"10.5555/545381.545430","title":"I/O-optimal algorithms for planar graphs using separators","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Planar straight-line graph; Breadth-first search; Planar; Algorithm; Book embedding; Computer science; Embedding; Outerplanar graph; Vertex (graph theory); Depth-first search; Graph; Search algorithm; Pathwidth; Theoretical computer science; Line graph; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04744852501361935,"gpt":0.2870264706846065,"spread":0.2395779456709872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000489843,0.0007115955,0.0006434321,0.000572181,0.0008720577,0.0005272673,0.002073695,0.0002639313,0.00007877539],"category_scores_gemma":[0.00003497854,0.0006799398,0.0006069195,0.001225964,0.0002706365,0.0009456938,0.0002782557,0.0004423767,0.0001311025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001391653,"about_ca_system_score_gemma":0.00005494481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005542599,"about_ca_topic_score_gemma":0.000004093473,"domain_scores_codex":[0.9954542,0.0001453174,0.0007249918,0.001500494,0.0008711395,0.001303856],"domain_scores_gemma":[0.9972621,0.0003148271,0.0002813252,0.001489304,0.0001848118,0.0004676349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003376103,0.003471734,0.0007006378,0.0005061171,0.001943485,0.0008148337,0.0103067,0.03862551,0.01456729,0.6589079,0.05640357,0.2134147],"study_design_scores_gemma":[0.001438731,0.0008766563,0.00006558306,0.00007732488,0.00005485813,0.000111871,0.00008044809,0.9636265,0.003574617,0.009473456,0.01950518,0.001114784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009900375,0.0007723764,0.9756552,0.002364377,0.003455321,0.001413042,0.0003357532,0.001002523,0.005101033],"genre_scores_gemma":[0.06366877,0.000335076,0.9302285,0.001864622,0.001294164,0.0003420258,0.00008623087,0.0001976692,0.001982957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.925001,"threshold_uncertainty_score":0.9995652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151534739","doi":"10.5555/1283383.1283519","title":"Approximation algorithms for node-weighted buy-at-bulk network design","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Approximation algorithm; Logarithm; Node (physics); Network planning and design; Computer science; Approximation theory; Constant (computer programming); Algorithm; Mathematics; Mathematical optimization; Physics; Computer network; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03280088017898276,"gpt":0.2760675828761797,"spread":0.243266702697197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002659084,0.0007302454,0.0006540345,0.0004104645,0.001144332,0.0004155391,0.00199944,0.0003513581,0.00004048927],"category_scores_gemma":[0.00005746933,0.0006847922,0.0004615904,0.00144603,0.0002881601,0.0007848977,0.0005665361,0.0004333154,0.0001474409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000335698,"about_ca_system_score_gemma":0.0001124081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002765846,"about_ca_topic_score_gemma":0.00001001879,"domain_scores_codex":[0.9944519,0.0002068695,0.001001812,0.001544147,0.001059324,0.001735901],"domain_scores_gemma":[0.9961106,0.001065949,0.0004334066,0.00158308,0.0003189341,0.0004880311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001219232,0.001480397,0.0001828604,0.0003272009,0.0008269263,0.0002855684,0.003495274,0.03999732,0.006597547,0.4344666,0.04576712,0.4653539],"study_design_scores_gemma":[0.002061637,0.0009787054,0.0002055418,0.0001165651,0.00005602706,0.00007213781,0.00003628668,0.9038568,0.01637665,0.04768504,0.02732657,0.001228071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002274241,0.0003058084,0.9896402,0.001811586,0.002620941,0.00171276,0.00007328043,0.0008062034,0.002801796],"genre_scores_gemma":[0.006060415,0.00009023098,0.9886528,0.001301896,0.001787468,0.0003077452,0.0002023399,0.0001101735,0.001486901],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8638594,"threshold_uncertainty_score":0.9995603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078615143","doi":"10.5555/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Regular polygon; Set (abstract data type); Mathematics; Computational geometry; Euclidean geometry; Point (geometry); Data structure; k-nearest neighbors algorithm; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01186897854049258,"gpt":0.2646139178492995,"spread":0.2527449393088069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001475943,0.0001945891,0.0001806672,0.0001061859,0.0002407023,0.0003585345,0.0005726254,0.00007541267,0.000009709413],"category_scores_gemma":[0.00002181652,0.0001726316,0.0000374056,0.0002469816,0.00007002068,0.0006368107,0.0002838206,0.00009120651,0.000007351525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002745025,"about_ca_system_score_gemma":0.00007565704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004948521,"about_ca_topic_score_gemma":0.00006130925,"domain_scores_codex":[0.9985582,0.00004012549,0.0002313868,0.0006566965,0.0002536565,0.0002599324],"domain_scores_gemma":[0.9989111,0.0001491649,0.00009408934,0.000682547,0.00008677769,0.00007631455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002370293,0.0003303547,0.0006549897,0.0003272136,0.0002393056,0.00005542524,0.001005948,0.04171596,0.06912417,0.6869586,0.01860535,0.1807457],"study_design_scores_gemma":[0.0007178898,0.0002437488,0.003482986,0.00001988062,0.00001803734,0.00002624251,0.00001692669,0.9579796,0.002070885,0.01888291,0.0162142,0.0003266611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02023365,0.0004596846,0.9701172,0.006273831,0.0008985676,0.000627517,0.0006377763,0.0001711802,0.0005805661],"genre_scores_gemma":[0.8132125,0.0000456563,0.1826822,0.0005977168,0.0004342887,0.00004142193,0.001731991,0.000028911,0.001225322],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9162637,"threshold_uncertainty_score":0.7039712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068462176","doi":"","title":"On distance to monotonicity and longest increasing subsequence of a data stream","year":2008,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotonic function; Longest common subsequence problem; Subsequence; Longest increasing subsequence; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Sequence (biology); Approximation algorithm; Space (punctuation); Streaming algorithm; Set (abstract data type); Edit distance; Log-log plot; Data stream; Discrete mathematics; Binary logarithm; Algorithm; Computer science; Statistics; Bounded function","retraction":null,"screen_n_in":null,"score":{"opus":0.04200296111938706,"gpt":0.285111851134366,"spread":0.243108890014979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004771017,0.0003232079,0.0003949298,0.0002039774,0.0003242603,0.0001234356,0.002221622,0.0000801674,0.000005847762],"category_scores_gemma":[0.0001019907,0.0002973251,0.00006819605,0.0006987348,0.0003294615,0.0007627307,0.001081512,0.0002632848,0.00001694252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005959318,"about_ca_system_score_gemma":0.00009950606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005171836,"about_ca_topic_score_gemma":0.00004666286,"domain_scores_codex":[0.9972231,0.0001505665,0.0003998035,0.001133402,0.0006237393,0.0004693532],"domain_scores_gemma":[0.9968167,0.0004144533,0.0001597915,0.002230967,0.00008718562,0.0002909369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001164134,0.0024458,0.01155118,0.0003786283,0.0004064653,0.001283779,0.008608955,0.004053067,0.01672835,0.7282097,0.002527473,0.2226425],"study_design_scores_gemma":[0.003960877,0.005937214,0.08073746,0.001676988,0.00009029858,0.0009245416,0.0002251955,0.8210732,0.03507849,0.04031711,0.006183539,0.00379505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6036962,0.000369426,0.3870234,0.002924781,0.000505661,0.000795806,0.0005429103,0.0003018031,0.003839985],"genre_scores_gemma":[0.9122392,0.0002153601,0.08697618,0.0003576365,0.00007830928,0.00001819009,0.00002900328,0.00002065255,0.00006549988],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8170202,"threshold_uncertainty_score":0.9999479,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153068117","doi":"10.5555/982792.982848","title":"The list partition problem for graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Clique problem; Time complexity; Skew; Discrete mathematics; Clique; Chordal graph; Graph; Computer science; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01577628640029533,"gpt":0.2901337696210354,"spread":0.2743574832207401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006666135,0.0002028417,0.0001467098,0.0001060061,0.0008154583,0.0003561933,0.001240495,0.0000645394,0.000002359942],"category_scores_gemma":[0.00004131074,0.0001372816,0.0001723797,0.0005405883,0.0002304778,0.0004888934,0.0001783762,0.000203462,0.00004942552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009031494,"about_ca_system_score_gemma":0.00007807605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001517154,"about_ca_topic_score_gemma":0.00001824596,"domain_scores_codex":[0.9979717,0.00008568925,0.0002624267,0.0005487416,0.0004730284,0.0006584134],"domain_scores_gemma":[0.9984477,0.0002791052,0.00009544867,0.0008749784,0.0001442896,0.0001584442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004398705,0.00005084137,0.000009340132,0.00001239486,0.00002290121,0.000005325031,0.0002146577,0.00133397,0.002252988,0.983965,0.0002920724,0.01179655],"study_design_scores_gemma":[0.0009397931,0.0006960255,0.0000526656,0.00004044922,0.000006178296,0.00001086254,0.00004305682,0.006389538,0.01743832,0.9602301,0.01388537,0.0002676638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001330701,0.000215665,0.9690411,0.0214399,0.0006116871,0.001461153,0.00003458641,0.0003633865,0.005501797],"genre_scores_gemma":[0.7363243,0.0007491141,0.2542,0.001452155,0.0005814186,0.002907464,0.00006851648,0.0001442417,0.003572754],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7349936,"threshold_uncertainty_score":0.6271929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963693432","doi":"10.5555/2634074.2634192","title":"Parameters of two-prover-one-round game and the hardness of connectivity problems","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Soundness; Connection (principal bundle); Hardness of approximation; Gas meter prover; Constant (computer programming); Class (philosophy); Task (project management); Mathematics; Computer science; Discrete mathematics; Approximation algorithm; Combinatorics; Artificial intelligence; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.01954055939591269,"gpt":0.2463180992991209,"spread":0.2267775399032083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332168,0.0002780363,0.0006036627,0.000140212,0.0001473506,0.0001319061,0.001091587,0.00007792374,0.000004549904],"category_scores_gemma":[0.0001039659,0.0001982164,0.0002114457,0.000464995,0.001025844,0.0003804335,0.0004511625,0.0002548905,0.000003775311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002228374,"about_ca_system_score_gemma":0.00004131813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004053326,"about_ca_topic_score_gemma":0.00002246969,"domain_scores_codex":[0.9975179,0.000420457,0.0005107301,0.0005994028,0.0005795207,0.0003720099],"domain_scores_gemma":[0.9974661,0.0007921873,0.0003904405,0.001098045,0.0001402407,0.0001129182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00019574,0.0004271864,0.000724755,0.0003302798,0.0003106373,0.000002478567,0.003814531,0.001854081,0.007122255,0.915807,0.00008344292,0.06932762],"study_design_scores_gemma":[0.007446325,0.001489837,0.00293802,0.0003378767,0.0001097513,0.00003277498,0.0001156937,0.7162338,0.03435123,0.2351973,0.0009675756,0.0007798054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2030129,0.0003210069,0.7836266,0.004023309,0.001442125,0.001369539,0.00005982277,0.000174526,0.005970193],"genre_scores_gemma":[0.9767103,0.00006669393,0.02280889,0.0001893177,0.00006880421,0.00005306448,0.000003365008,0.00001788656,0.00008172526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7736974,"threshold_uncertainty_score":0.8083032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013696768","doi":"10.5555/1109557.1109575","title":"An asymptotic approximation algorithm for 3D-strip packing","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Approximation algorithm; Mathematics; Algorithm; Combinatorics; Packing problems; Bin; Set (abstract data type); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.00843081260272268,"gpt":0.231809257577146,"spread":0.2233784449744234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002362774,0.0003369607,0.0002667691,0.000192691,0.0001835624,0.0002170199,0.0002187336,0.000178355,0.00003772611],"category_scores_gemma":[0.000006511974,0.0003373019,0.0001153105,0.0002845488,0.00004081532,0.000383274,0.0000139483,0.000166574,0.00004851236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001118217,"about_ca_system_score_gemma":0.00001934395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002401956,"about_ca_topic_score_gemma":0.00000525147,"domain_scores_codex":[0.998365,0.00004086063,0.0004133759,0.0003970546,0.0002873436,0.0004963777],"domain_scores_gemma":[0.9992401,0.0000653622,0.00008013572,0.0004004358,0.00009059987,0.000123369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001276793,0.0001375838,0.00007903466,0.0001336984,0.00006335908,0.000004187907,0.0002425289,0.8815109,0.00418216,0.002369948,0.001773908,0.1094899],"study_design_scores_gemma":[0.0008240507,0.0001926222,0.000134336,0.00005223328,0.00003407502,0.000006212303,0.00003182553,0.9872912,0.004375192,0.000710742,0.00588572,0.0004617734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007556271,0.0001041096,0.9850903,0.0001275764,0.0009192692,0.0007267048,0.0001641631,0.001015458,0.01109679],"genre_scores_gemma":[0.2730432,0.0001296887,0.7195329,0.0002511725,0.00207195,0.0004915741,0.002659757,0.0004041378,0.001415591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2722876,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03494794727384103,"gpt":0.2655295085494122,"spread":0.2305815612755711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572324,0.0001465449,0.000238466,0.00009769147,0.0001195486,0.00004168117,0.000742003,0.00007201316,0.00004124704],"category_scores_gemma":[0.0000591313,0.00009788411,0.00010846,0.0004937997,0.0001349663,0.0003059934,0.0001330523,0.0001146195,0.00001430528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001864508,"about_ca_system_score_gemma":0.00008959039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006558123,"about_ca_topic_score_gemma":0.000003217165,"domain_scores_codex":[0.9986483,0.00006348957,0.0004051072,0.0002883061,0.0003343641,0.0002603981],"domain_scores_gemma":[0.9986082,0.0001963735,0.0002291921,0.0005744899,0.0003172804,0.00007445883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001810589,0.00527926,0.01290829,0.001228708,0.001579271,0.00001082466,0.02667565,0.6295406,0.04359151,0.1243542,0.005234735,0.1477864],"study_design_scores_gemma":[0.0006037694,0.0003459567,0.0006338934,0.0001046842,0.00001651787,0.000001118716,0.00004517577,0.9886449,0.008396907,0.0007526089,0.0003187339,0.0001357397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00421367,0.00009525689,0.990728,0.002351208,0.0002483088,0.0007710353,0.00004559651,0.00008194035,0.001464945],"genre_scores_gemma":[0.08373391,0.0001081087,0.9138989,0.0003667592,0.00008619406,0.00007070971,0.00004880418,0.00003129458,0.001655296],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3591043,"threshold_uncertainty_score":0.3991598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059884147","doi":"10.5555/1070432.1070437","title":"A categorization theorem on suffix arrays with applications to space efficient text indexes","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Suffix; Suffix array; Combinatorics; String (physics); Binary number; Permutation (music); Cardinality (data modeling); Compressed suffix array; Discrete mathematics; Generalized suffix tree; Suffix tree; Mathematics; Computer science; Arithmetic; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.008185812719306998,"gpt":0.2437248519696897,"spread":0.2355390392503827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002643751,0.0004033511,0.0002782527,0.0002906964,0.0004278625,0.0003647598,0.001198263,0.000109023,0.00002460739],"category_scores_gemma":[0.00001165368,0.0002925838,0.00007782297,0.0009775363,0.00007786485,0.0003628895,0.0003054802,0.0002681078,0.0005947323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001664446,"about_ca_system_score_gemma":0.00009523293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004037492,"about_ca_topic_score_gemma":0.00000990576,"domain_scores_codex":[0.9971415,0.00008672904,0.000325071,0.001065902,0.0008143178,0.000566509],"domain_scores_gemma":[0.9977365,0.0001159856,0.0001599653,0.001489461,0.000141766,0.0003563443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001763541,0.0009787668,0.00008405824,0.00002778163,0.00006673613,0.00001905898,0.002644607,0.3102696,0.005684987,0.5390686,0.003037462,0.137942],"study_design_scores_gemma":[0.002031532,0.002513999,0.001051562,0.0002776654,0.00004553552,0.00004839049,0.0002241033,0.8057501,0.04184639,0.001910479,0.1425156,0.001784703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002046172,0.000045471,0.9809983,0.007225086,0.0002012698,0.001013717,0.00005377768,0.0003701632,0.008046043],"genre_scores_gemma":[0.7895667,0.0000510291,0.2051342,0.002038577,0.0009751138,0.0006970363,0.0001448251,0.00009224893,0.001300259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7875205,"threshold_uncertainty_score":0.9999526,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02435609350982374,"gpt":0.2632225026411814,"spread":0.2388664091313576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004463471,0.0003428609,0.0002909083,0.0002336546,0.0003724384,0.0004524019,0.001378147,0.000132617,0.0004291617],"category_scores_gemma":[0.00002981671,0.0003071682,0.0001588015,0.0007427223,0.000113614,0.0009005999,0.0004383372,0.0003653613,0.001173763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001431449,"about_ca_system_score_gemma":0.0000343029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004773168,"about_ca_topic_score_gemma":0.000003503183,"domain_scores_codex":[0.9968771,0.0001877977,0.0004352275,0.0008535386,0.0009198871,0.0007264537],"domain_scores_gemma":[0.9982026,0.00008300958,0.00012892,0.001076689,0.0001280084,0.0003808221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006150902,0.003162021,0.00111733,0.0002044387,0.0005158584,0.0005529934,0.01124149,0.01054904,0.01351559,0.2159218,0.06389142,0.6792665],"study_design_scores_gemma":[0.001357668,0.0006127447,0.0003741068,0.00004569947,0.00001096408,0.00003563457,0.00005040589,0.9553661,0.003477945,0.001213042,0.03674391,0.0007117513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00148193,0.0005233068,0.8211851,0.02070309,0.002250874,0.001493169,0.00005944268,0.001663774,0.1506394],"genre_scores_gemma":[0.4071974,0.002730316,0.552513,0.008768098,0.001365534,0.0003985479,0.00009320662,0.0002145313,0.02671934],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9448171,"threshold_uncertainty_score":0.9999381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029415290","doi":"10.5555/1496770.1496780","title":"On the hitting times of quantum versus random walks","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum walk; Hitting time; Random walk; Mathematics; Quantum; Quantum algorithm; Statistical physics; Markov chain; Discrete mathematics; Quantum mechanics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01063437195247198,"gpt":0.2439889803909162,"spread":0.2333546084384442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140412,0.0003723364,0.0004093251,0.0001620793,0.0003698846,0.0001766296,0.001558433,0.0001049812,0.0000249627],"category_scores_gemma":[0.0001357265,0.0002323147,0.0002883066,0.000534148,0.0001161106,0.0001421336,0.0001861393,0.0004789664,0.00005823774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003810129,"about_ca_system_score_gemma":0.00006334105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001941184,"about_ca_topic_score_gemma":4.353137e-7,"domain_scores_codex":[0.9973271,0.0002439705,0.0004692645,0.0006621137,0.0007213238,0.0005761512],"domain_scores_gemma":[0.9971206,0.001245216,0.0002692975,0.001147054,0.00008251102,0.0001353354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007206067,0.0003986846,0.000009446965,0.00002726642,0.0001780392,0.00007578205,0.002784885,0.03348484,0.003832738,0.8006373,0.004290729,0.1535597],"study_design_scores_gemma":[0.00241484,0.002098235,0.0002198361,0.0001611406,0.00001983128,0.00001276345,0.0000442319,0.9636533,0.006566178,0.02345549,0.0009452408,0.0004089509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2386246,0.0009283311,0.5581671,0.1095788,0.008872228,0.002487736,0.00007654342,0.001881209,0.0793834],"genre_scores_gemma":[0.9908939,0.00002819173,0.00747288,0.001031787,0.0003294108,0.00001068259,0.000005368756,0.00002423013,0.0002035749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9301684,"threshold_uncertainty_score":0.9473519,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963575846","doi":"10.5555/2627817.2627912","title":"Frozen variables in random boolean constraint satisfaction problems","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Heuristics; Cluster analysis; Constraint satisfaction; Local consistency; Mathematics; Random variable; Algorithm; Computer science; Hypergraph; Discrete mathematics; Mathematical optimization; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01019987232403821,"gpt":0.2224017870505514,"spread":0.2122019147265132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005492748,0.0003475457,0.000359574,0.0003272614,0.0001440852,0.0007539478,0.0009632724,0.0001090543,0.0001836291],"category_scores_gemma":[0.00002555008,0.000298143,0.0001084953,0.0005343602,0.0001004726,0.001980294,0.0003640744,0.0002884985,0.0006417702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024453,"about_ca_system_score_gemma":0.00005561053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001309081,"about_ca_topic_score_gemma":0.00005399193,"domain_scores_codex":[0.9973421,0.0001511279,0.0005216721,0.000831308,0.0005141801,0.0006396628],"domain_scores_gemma":[0.998584,0.000125406,0.0001627553,0.0008897849,0.00006369951,0.0001743639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008485984,0.0007210276,0.009153967,0.0002719193,0.0004191007,0.0001863382,0.002743537,0.01028732,0.01444256,0.1532087,0.02579742,0.7826833],"study_design_scores_gemma":[0.007969729,0.0006149204,0.0233237,0.0003564257,0.00003921539,0.00002992623,0.0003229078,0.9297317,0.001364923,0.02168449,0.01296408,0.001598029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01232809,0.0001788568,0.9213549,0.008655631,0.002345873,0.003256253,0.00007183638,0.0008717786,0.05093681],"genre_scores_gemma":[0.8645242,0.0004572991,0.1276204,0.00182534,0.0005761,0.0009281047,0.0002031875,0.00009903946,0.003766225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9194443,"threshold_uncertainty_score":0.9999471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963204788","doi":"10.5555/3310435.3310519","title":"Proportional volume sampling and approximation algorithms for A-optimal design","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Approximation algorithm; Mathematics; Matrix (chemical analysis); Mathematical optimization; Algorithm; Measure (data warehouse); Applied mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02753062799451619,"gpt":0.2601438406716673,"spread":0.2326132126771512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002134353,0.0002636807,0.0002533605,0.0001221199,0.00009701595,0.0001015261,0.0001308547,0.0001331232,0.00002293857],"category_scores_gemma":[0.00001117607,0.0002511899,0.00008276152,0.0001016854,0.00004444455,0.0002139159,0.00003529374,0.0001551103,0.00003410923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000619167,"about_ca_system_score_gemma":0.00001983612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006383969,"about_ca_topic_score_gemma":2.271109e-7,"domain_scores_codex":[0.9987453,0.00002537593,0.0002757523,0.0003742777,0.0002335312,0.0003457811],"domain_scores_gemma":[0.9994149,0.00008143769,0.00006330441,0.0002717333,0.00008109128,0.00008751277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003744233,0.0001895187,0.0007845302,0.0004701942,0.0005118399,0.00001660125,0.001061412,0.6320803,0.2546478,0.005869745,0.007699525,0.09629414],"study_design_scores_gemma":[0.0004718975,0.0003341439,0.00036486,0.00008989916,0.00002902084,0.00001813059,0.00004179118,0.9544729,0.03953379,0.001233767,0.003020636,0.0003891868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02810663,0.0001722227,0.9679072,0.0001814588,0.0004602846,0.001265315,0.00004505531,0.0008010371,0.001060809],"genre_scores_gemma":[0.496785,0.0001144028,0.5014225,0.0001012307,0.0004265876,0.0002680286,0.0001536205,0.0001383903,0.0005901957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4686784,"threshold_uncertainty_score":0.999994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034389879","doi":"10.5555/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Hash chain; Function (biology); Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007456395841719261,"gpt":0.2256655254684238,"spread":0.2182091296267046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001994941,0.0003205422,0.0002570834,0.0003045057,0.0004078305,0.0003698482,0.0008370175,0.0001030352,0.00002342609],"category_scores_gemma":[0.00001096198,0.0002421451,0.00008829184,0.0012856,0.00007017443,0.0009218325,0.0002273822,0.0002210201,0.0002193009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009959088,"about_ca_system_score_gemma":0.00008509133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003932851,"about_ca_topic_score_gemma":0.00002934847,"domain_scores_codex":[0.9975722,0.00007487318,0.0003367503,0.0008207485,0.0006788641,0.0005165826],"domain_scores_gemma":[0.9982786,0.0001028009,0.000171717,0.001140595,0.0001516319,0.00015464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000398487,0.002910957,0.006383965,0.0001619263,0.0003987529,0.0003413048,0.0005523019,0.06426985,0.02376972,0.1874132,0.2557336,0.457666],"study_design_scores_gemma":[0.003718073,0.002015228,0.02832482,0.0001462371,0.00007555727,0.0001091944,0.00007188054,0.7826589,0.01214031,0.005878045,0.1630497,0.001812047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001832578,0.0001499517,0.9777534,0.001572839,0.000513373,0.0003577599,0.00006449077,0.0004905098,0.01726511],"genre_scores_gemma":[0.8635343,0.00007940918,0.1286435,0.0007639183,0.00105601,0.0002237302,0.0008955357,0.00008734554,0.004716273],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8617017,"threshold_uncertainty_score":0.987439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118893502","doi":"10.5555/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Planarity testing; Morphing; Planar graph; Vertex (graph theory); Computer science; Orthogonality; Combinatorics; Graph drawing; Planar; Graph; Book embedding; Mathematics; Pathwidth; Line graph; Computer graphics (images); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007873912044065968,"gpt":0.2265386083005266,"spread":0.2186646962564606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002575862,0.0002154642,0.0001649896,0.0002689766,0.000297156,0.0002813783,0.0004664357,0.00007207669,0.00001610033],"category_scores_gemma":[0.00000860513,0.0002009615,0.0001283714,0.0006386934,0.00004121318,0.0005463452,0.00008319847,0.0001592515,0.0001057134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004391307,"about_ca_system_score_gemma":0.00006142048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006555924,"about_ca_topic_score_gemma":0.000008189165,"domain_scores_codex":[0.9981809,0.0000620996,0.000299489,0.000548703,0.0005581369,0.0003506806],"domain_scores_gemma":[0.9992398,0.00009271356,0.0001063702,0.0003764569,0.00008207701,0.0001025872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000032542,0.000244495,0.000644227,0.00002614244,0.00006350491,0.0001398674,0.0003520024,0.08216804,0.02859305,0.8570341,0.01203994,0.01866207],"study_design_scores_gemma":[0.002457235,0.000877694,0.025834,0.000128872,0.00005050722,0.0002423683,0.00004303526,0.6394483,0.03443556,0.2542249,0.0402373,0.002020214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03301088,0.0001769209,0.9472009,0.005260344,0.001079553,0.0002243669,0.00002206526,0.0003565335,0.01266843],"genre_scores_gemma":[0.9271852,0.00001966173,0.0686781,0.001020397,0.001011784,0.0000377575,0.0001757521,0.00002625908,0.001845115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8941743,"threshold_uncertainty_score":0.8194972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01323844639757141,"gpt":0.3080781382825517,"spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006241282,0.0003525968,0.0004108291,0.0004693272,0.0003646059,0.0001713141,0.00184616,0.000131075,0.00002369286],"category_scores_gemma":[0.00001543849,0.0003331254,0.0003142911,0.00074059,0.0002011466,0.001304318,0.0002106598,0.0002742965,0.00004720195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008910955,"about_ca_system_score_gemma":0.00008929524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002382635,"about_ca_topic_score_gemma":0.000006466801,"domain_scores_codex":[0.9969476,0.0001943231,0.0005353418,0.0008769845,0.0006815972,0.0007641225],"domain_scores_gemma":[0.9974373,0.0003203273,0.0002021868,0.001434033,0.000259485,0.0003466652],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001793583,0.001270175,0.00005247989,0.00007353262,0.0002418938,0.00002206625,0.002889137,0.01310971,0.1016569,0.4586363,0.000632007,0.4212364],"study_design_scores_gemma":[0.002604389,0.00265884,0.0003332872,0.0001054554,0.00003911277,0.00004660678,0.0002295245,0.6590117,0.1259669,0.2051498,0.002849882,0.001004496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008726283,0.00010405,0.9871163,0.001136521,0.00028748,0.000813236,0.0002929877,0.0002727922,0.001250363],"genre_scores_gemma":[0.1917589,0.00006701821,0.806882,0.0003648673,0.0002360964,0.0002096173,0.00008342561,0.00006887796,0.0003291625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.645902,"threshold_uncertainty_score":0.9999121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01978642089397287,"gpt":0.2940209903722933,"spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305544,0.0005154379,0.0005114097,0.000198817,0.000630365,0.0005510226,0.001392758,0.000236492,0.00007295918],"category_scores_gemma":[0.0002560743,0.0004596269,0.0001814672,0.0007906207,0.0003369928,0.001331252,0.00125382,0.001191679,0.000116479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000077438,"about_ca_system_score_gemma":0.0001025371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001290229,"about_ca_topic_score_gemma":0.00009772328,"domain_scores_codex":[0.9953496,0.0002730713,0.0006956481,0.001523343,0.001038088,0.001120247],"domain_scores_gemma":[0.9970074,0.0002878615,0.000333956,0.00167264,0.0002419586,0.0004562384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008951654,0.002046635,0.009452774,0.0002687882,0.0005003774,0.0007262701,0.008110292,0.0001992315,0.1419198,0.5393721,0.001881049,0.2946276],"study_design_scores_gemma":[0.007191716,0.002542989,0.05348399,0.0003921413,0.00008072758,0.0002542521,0.0004555516,0.2159144,0.06538697,0.6335759,0.01712476,0.003596538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6527158,0.0003444906,0.3094678,0.005685002,0.002735127,0.002557301,0.0001749004,0.001166578,0.02515303],"genre_scores_gemma":[0.8906796,0.0002703315,0.1077152,0.0004658555,0.0003002025,0.0001217462,0.00003909807,0.00007311522,0.0003348028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.291031,"threshold_uncertainty_score":0.9997855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570771845","doi":"10.5555/1496770.1496840","title":"Succinct geometric indexes supporting point location queries","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Point location; Point (geometry); Bounded function; Entropy (arrow of time); Combinatorics; Computational geometry; Mathematics; Set (abstract data type); Planar; Computer science; Line segment; Geometric primitive; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.009640366075033085,"gpt":0.2627214722801992,"spread":0.2530811062051661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289267,0.0002354295,0.0002086253,0.0005877189,0.0002770107,0.0003233666,0.0004664659,0.00008519179,0.00002242023],"category_scores_gemma":[0.0001038965,0.0002173731,0.00009443346,0.002040528,0.0000289607,0.0009330664,0.00008878075,0.0001678581,0.00009762267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009807634,"about_ca_system_score_gemma":0.0001191941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002364028,"about_ca_topic_score_gemma":0.000002890546,"domain_scores_codex":[0.9979333,0.00008345846,0.0004372347,0.0005759632,0.0005671168,0.0004029561],"domain_scores_gemma":[0.9988286,0.0001144092,0.0002100256,0.0004834142,0.000215214,0.0001483277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007571555,0.0005446855,0.000860095,0.00006276811,0.00008864069,0.00008176501,0.001918088,0.08830842,0.01339497,0.2791069,0.005234256,0.6103237],"study_design_scores_gemma":[0.002620446,0.004236096,0.1038034,0.0001937726,0.00006334597,0.0002156488,0.0002149501,0.6841287,0.1191109,0.07077801,0.01221073,0.002424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01992196,0.0002400656,0.9630325,0.01106915,0.0007399539,0.0003259307,0.000006007742,0.0003511385,0.004313316],"genre_scores_gemma":[0.9745679,0.00003460939,0.02327628,0.001113456,0.0003241412,0.00001673632,0.00006072432,0.00001091057,0.0005952547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9546459,"threshold_uncertainty_score":0.8864217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1561175729","doi":"10.5555/1496770.1496824","title":"Biased range trees","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Set (abstract data type); Preprocessor; Tree (set theory); Tree structure; Query optimization; Segment tree; Interval tree; Data mining; Mathematics; Algorithm; Combinatorics; Sargable; Artificial intelligence; Web search query; Information retrieval; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.01441717215288716,"gpt":0.2591209271457658,"spread":0.2447037549928787,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001974589,0.0001726491,0.0001490102,0.0001878157,0.0001601813,0.0001902262,0.0004426965,0.00005749274,0.0000202453],"category_scores_gemma":[0.00001764939,0.0001516848,0.0001017702,0.0005473479,0.00001981079,0.0004132347,0.00004402541,0.0001042841,0.000151171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003754986,"about_ca_system_score_gemma":0.00004499002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005771255,"about_ca_topic_score_gemma":0.0000019243,"domain_scores_codex":[0.9986206,0.0000663343,0.0002101775,0.0004342062,0.0004016121,0.0002671011],"domain_scores_gemma":[0.9992312,0.00007262119,0.00006707075,0.0004349691,0.00006747124,0.0001266946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009274849,0.0006080862,0.0001203044,0.00001383204,0.00007029236,0.0001237103,0.001325847,0.03677823,0.03765314,0.295036,0.01528182,0.612896],"study_design_scores_gemma":[0.002651375,0.002299821,0.02595295,0.00007101013,0.00002783223,0.00005708182,0.00002818618,0.8657123,0.03402587,0.03660045,0.03140629,0.001166859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0134455,0.0002976478,0.9401494,0.0224783,0.001117202,0.0003689601,0.00001484721,0.0005268321,0.02160131],"genre_scores_gemma":[0.9584111,0.00004578133,0.03640444,0.002786118,0.0004938754,0.0000164557,0.00003939752,0.00001017938,0.001792647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9449656,"threshold_uncertainty_score":0.6185526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01650779417379294,"gpt":0.2897351951554409,"spread":0.2732274009816479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001462206,0.0005197211,0.0004724676,0.0002058596,0.0007956898,0.0005705699,0.00243204,0.0001696974,0.00001842488],"category_scores_gemma":[0.0001002726,0.0003466014,0.0004259523,0.000863046,0.0002740982,0.0008985559,0.0003953881,0.0007539449,0.0001541079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001496586,"about_ca_system_score_gemma":0.0001359078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004012273,"about_ca_topic_score_gemma":0.000005295663,"domain_scores_codex":[0.9958907,0.0002651602,0.0005596132,0.00113559,0.0009180244,0.001230879],"domain_scores_gemma":[0.9968549,0.0007046424,0.000213574,0.001610217,0.0002929435,0.0003237365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008493748,0.0002477966,0.00001210888,0.00001774334,0.00009700379,0.00004419048,0.001226177,0.0007224966,0.002733231,0.05553354,0.0007680358,0.9385127],"study_design_scores_gemma":[0.001003214,0.00176279,0.0002241466,0.0001000471,0.00002808463,0.00003823431,0.00007657231,0.9192542,0.004316478,0.06303423,0.00953118,0.0006308131],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002821941,0.000266261,0.9848246,0.01054635,0.0003598527,0.001725816,0.00009792324,0.0004547259,0.001442281],"genre_scores_gemma":[0.04370147,0.0002158678,0.9476577,0.002244764,0.001261655,0.0006983242,0.00009006953,0.000142889,0.003987258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9378819,"threshold_uncertainty_score":0.9998986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01763125246592238,"gpt":0.252691496209125,"spread":0.2350602437432026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471137,0.0003993743,0.0003601619,0.0001987421,0.0004093542,0.0002995592,0.001318588,0.0001563034,0.00004054367],"category_scores_gemma":[0.00003261932,0.0003470768,0.0002221379,0.0008615116,0.0001128168,0.00108158,0.0005503097,0.0004697356,0.0001421709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007073064,"about_ca_system_score_gemma":0.00002858514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003085508,"about_ca_topic_score_gemma":0.000001751549,"domain_scores_codex":[0.9969958,0.000169889,0.0004954635,0.0006175496,0.0006006275,0.001120679],"domain_scores_gemma":[0.9979985,0.0001870098,0.0001978592,0.001151921,0.00007605001,0.0003886669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005630689,0.001213324,0.003023449,0.0001085291,0.0003631088,0.00006735515,0.004121207,0.01505253,0.002217643,0.6228827,0.007127437,0.3437665],"study_design_scores_gemma":[0.0006964356,0.0002505582,0.0019599,0.00008608544,0.00002298962,0.00005705482,0.00006817582,0.9797342,0.001669646,0.002868376,0.01172891,0.0008576547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002322627,0.000600891,0.9730944,0.001374168,0.002465477,0.0003757666,0.00001020175,0.0007070472,0.01904941],"genre_scores_gemma":[0.7546618,0.00007818204,0.2402007,0.001423968,0.002200867,0.000122631,0.00004382005,0.00007989012,0.001188144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646817,"threshold_uncertainty_score":0.9998981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990177682","doi":"10.5555/1873601.1873636","title":"Asymmetric traveling salesman path and directed latency problems","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Linear programming relaxation; Combinatorics; Approximation algorithm; Binary logarithm; Mathematics; Log-log plot; Path (computing); Upper and lower bounds; Relaxation (psychology); Latency (audio); Linear programming; Discrete mathematics; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01167170768584514,"gpt":0.2338271851916558,"spread":0.2221554775058107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335181,0.0004070022,0.0003666404,0.0003756653,0.0004457154,0.0004402665,0.001107907,0.000192808,0.00001815861],"category_scores_gemma":[0.00005955602,0.0003559271,0.0001473605,0.001345073,0.0001991049,0.0005381595,0.0003813226,0.0007648719,0.00005157329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002405767,"about_ca_system_score_gemma":0.0000602076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009829803,"about_ca_topic_score_gemma":0.00003108284,"domain_scores_codex":[0.9972224,0.00009675469,0.0004410848,0.0009986671,0.0005672025,0.0006739086],"domain_scores_gemma":[0.9982219,0.00020784,0.0001570645,0.0009561472,0.0001203902,0.0003366527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004062082,0.0008810429,0.003148595,0.0002289269,0.0002642792,0.0002347671,0.003952698,0.0002228504,0.04452967,0.2912487,0.001355107,0.6538928],"study_design_scores_gemma":[0.002779436,0.001365307,0.03408733,0.0002565579,0.00007468067,0.0003364087,0.00006848514,0.8610567,0.009266636,0.0666084,0.02160929,0.002490798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2476582,0.002462551,0.6070995,0.01464061,0.01562499,0.0040536,0.0002587888,0.007640324,0.1005614],"genre_scores_gemma":[0.813997,0.0005537362,0.1834542,0.0004647907,0.0005817824,0.00009848763,0.00003631467,0.00007582361,0.0007379337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608338,"threshold_uncertainty_score":0.9998893,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01828212569785315,"gpt":0.2676465739180216,"spread":0.2493644482201685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251547,0.0001894537,0.0001502142,0.0001224261,0.0001858013,0.000209184,0.0006936507,0.00006827224,0.00006986094],"category_scores_gemma":[0.00001741883,0.0001601772,0.00009001925,0.000352597,0.00004213738,0.0008707475,0.0002265847,0.0001863779,0.0004970516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004660123,"about_ca_system_score_gemma":0.00002942625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001055365,"about_ca_topic_score_gemma":7.418863e-7,"domain_scores_codex":[0.9983156,0.00009842888,0.0002138877,0.0003323712,0.0004023577,0.0006373072],"domain_scores_gemma":[0.9988844,0.00005532175,0.00006488777,0.0006084582,0.0000501917,0.0003366782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007972529,0.001654241,0.005764138,0.0001948627,0.0003499952,0.00007382613,0.02530325,0.02924728,0.04413137,0.670208,0.00926118,0.2137321],"study_design_scores_gemma":[0.002271391,0.000903554,0.005104564,0.0001728472,0.00002657181,0.0000860542,0.0002174575,0.801528,0.02243518,0.002581316,0.1627318,0.001941257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002897792,0.0002882412,0.9321342,0.003466149,0.001159669,0.0003735338,0.000006415185,0.0005371552,0.05913684],"genre_scores_gemma":[0.6709684,0.0002987124,0.3176371,0.00266212,0.0008876772,0.0001228779,0.00002122479,0.0000865507,0.007315294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7722808,"threshold_uncertainty_score":0.6531836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.007603731631552604,"gpt":0.2650003601434302,"spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001143617,0.0002456439,0.0002908183,0.0003145799,0.0001684475,0.0001840844,0.0006941229,0.00006543302,9.150781e-7],"category_scores_gemma":[0.00005629057,0.00020164,0.00003580284,0.0009928058,0.00009504022,0.0006122889,0.0002045782,0.000270024,0.00001167471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009570656,"about_ca_system_score_gemma":0.00005296293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001454148,"about_ca_topic_score_gemma":0.0002142361,"domain_scores_codex":[0.9975296,0.0002309982,0.0002427183,0.0008669228,0.0005919217,0.0005378292],"domain_scores_gemma":[0.9984386,0.0002195257,0.00008824507,0.0008606564,0.0001063659,0.0002866227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001807314,0.0004114451,0.04787087,0.0001350258,0.00008183288,0.0000819582,0.007432512,0.02531331,0.05602621,0.4530275,0.00003928982,0.4077727],"study_design_scores_gemma":[0.007119462,0.003382936,0.04516872,0.0003377132,0.00001941338,0.00004500444,0.0002403516,0.8299905,0.01634307,0.09478946,0.001084261,0.001479091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311215,0.00003715933,0.8653305,0.0008456578,0.00006671048,0.0005814435,0.000002460664,0.0001504357,0.00186407],"genre_scores_gemma":[0.9536109,0.00001538592,0.04586405,0.0002561033,0.00006257593,0.0001296597,0.000004000245,0.00002631543,0.00003104074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8224893,"threshold_uncertainty_score":0.8222641,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer science; Scheduling (production processes); Competitive analysis; Computer network; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01377934051919067,"gpt":0.2597916619559201,"spread":0.2460123214367295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278103,0.0001790218,0.0003253041,0.0005316924,0.000128565,0.0001377866,0.0009168108,0.0000760666,0.00007635251],"category_scores_gemma":[0.00002238177,0.000154385,0.0002300965,0.002064262,0.0000842556,0.0003793744,0.0002088921,0.0001324844,0.0001049455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009125632,"about_ca_system_score_gemma":0.00007794376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001624485,"about_ca_topic_score_gemma":0.00008453336,"domain_scores_codex":[0.9982145,0.00005110464,0.0003502453,0.0004837501,0.0005533207,0.0003470439],"domain_scores_gemma":[0.998689,0.00006681802,0.0001326094,0.0008029033,0.0001315222,0.0001771625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002481464,0.0004117571,0.001000775,0.00005154669,0.001080742,0.00005797673,0.003308675,0.8564544,0.0009210091,0.1327868,0.0002872453,0.00361433],"study_design_scores_gemma":[0.002066666,0.001008035,0.009919254,0.0001209562,0.0003527723,0.00001025753,0.00009886577,0.9733,0.005672678,0.003677977,0.002975448,0.0007970887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005296947,0.00009341816,0.967518,0.01235649,0.0002992282,0.0004077013,0.00004646418,0.0002509874,0.01373071],"genre_scores_gemma":[0.9086021,0.0002871537,0.08917253,0.0006108008,0.00007897071,0.00004909026,0.00005937,0.00002868253,0.001111314],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033052,"threshold_uncertainty_score":0.6295636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W88251305","doi":"10.5555/2095116.2095168","title":"A little advice can be very helpful","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Logarithm; Advice (programming); Communication complexity; Multiplicative function; Conjecture; Computer science; Set (abstract data type); Protocol (science); Mathematics; Time complexity; Theoretical computer science; Upper and lower bounds; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02044801421950783,"gpt":0.2604827027832461,"spread":0.2400346885637383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005303709,0.0004266248,0.0003624419,0.0002563548,0.0003900577,0.0002734965,0.001562578,0.000149403,0.00008279161],"category_scores_gemma":[0.000037385,0.0003906954,0.0002623932,0.0008518828,0.0001577785,0.0009593375,0.0005974031,0.0004144939,0.0002503814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183935,"about_ca_system_score_gemma":0.00008793204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002044893,"about_ca_topic_score_gemma":0.00001825738,"domain_scores_codex":[0.9968318,0.0001641957,0.0003977771,0.0007038805,0.0007616631,0.001140653],"domain_scores_gemma":[0.9976383,0.000207429,0.000141946,0.001377346,0.000100801,0.0005341126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001521521,0.00277626,0.003595464,0.0002765134,0.0006695748,0.0002393854,0.02127177,0.0005557976,0.008277929,0.7264768,0.05632147,0.1793869],"study_design_scores_gemma":[0.00461535,0.002395656,0.01245041,0.0004347542,0.000179438,0.0005350432,0.001053341,0.1872497,0.04250026,0.0253617,0.7176598,0.005564542],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05171162,0.005557974,0.5167189,0.09880995,0.03187602,0.003415453,0.0008182649,0.008331177,0.2827607],"genre_scores_gemma":[0.8300374,0.0003675179,0.1486918,0.01006593,0.003534111,0.0002569991,0.0001179107,0.0001551076,0.006773205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7783258,"threshold_uncertainty_score":0.9998545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118345845","doi":"10.5555/982792.982935","title":"Bipartite roots of graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0109872731967097,"gpt":0.2419567528321393,"spread":0.2309694796354296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002623708,0.0001795686,0.0002476926,0.0001694841,0.0001014356,0.00009164349,0.0006379812,0.00008420121,0.00001162452],"category_scores_gemma":[0.000008125356,0.0001471265,0.0001789127,0.0004883083,0.00005798268,0.000318011,0.0001058088,0.0001319591,0.00008785137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004739486,"about_ca_system_score_gemma":0.00004352159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001295214,"about_ca_topic_score_gemma":0.00001683082,"domain_scores_codex":[0.9984662,0.00006009231,0.0003836655,0.0004067269,0.000360926,0.0003223811],"domain_scores_gemma":[0.998935,0.00003833977,0.0001537453,0.0006599204,0.00009659665,0.0001163904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003550887,0.0002556606,0.0003285287,0.00005669099,0.0001336884,0.00005529217,0.001434176,0.03413075,0.01822599,0.9359263,0.001634311,0.007783087],"study_design_scores_gemma":[0.01196551,0.00923718,0.01177916,0.002283826,0.0001248481,0.0005357188,0.0006476586,0.373506,0.3268313,0.1942159,0.06430931,0.004563529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06124002,0.0003701847,0.8891243,0.004437004,0.005521492,0.0006118834,0.00002194719,0.0004885655,0.0381846],"genre_scores_gemma":[0.9944232,0.00003574919,0.004695212,0.0002409256,0.0001584068,0.00002379296,0.000003420173,0.00001518307,0.0004041478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9331831,"threshold_uncertainty_score":0.5999646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2243190840","doi":"10.5555/2722129.2722244","title":"Four terminal planar Delta-Wye reducibility via rooted K2,4 minors","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Graph; Discrete mathematics; Terminal (telecommunication); Mathematical proof; Computer science; Geometry; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03958629530490731,"gpt":0.3045966474345863,"spread":0.2650103521296789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488615,0.0004490397,0.0004327003,0.0003330561,0.0002528131,0.0002246296,0.002261284,0.0001803935,0.00002060044],"category_scores_gemma":[0.0001722229,0.0003904667,0.0002023696,0.0009497541,0.0003149547,0.0008778899,0.0004842345,0.000549641,0.000332894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002625401,"about_ca_system_score_gemma":0.0002434703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001459584,"about_ca_topic_score_gemma":0.00002385713,"domain_scores_codex":[0.9953057,0.0004616412,0.0005121356,0.001428387,0.001246079,0.001046059],"domain_scores_gemma":[0.9962295,0.0002072138,0.0001741912,0.002299077,0.000291819,0.0007982308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003519899,0.003144911,0.01049056,0.0004247807,0.001007447,0.007225552,0.01455399,0.008994184,0.07047115,0.1317451,0.03211871,0.7163037],"study_design_scores_gemma":[0.008904023,0.007856113,0.009465993,0.000335357,0.0001270575,0.001616077,0.0007531564,0.4766793,0.09753144,0.3661431,0.02546778,0.005120583],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1358679,0.0003675857,0.8346226,0.007498368,0.002477979,0.001685947,0.0001525156,0.001208174,0.01611895],"genre_scores_gemma":[0.8962444,0.00002670059,0.0991867,0.0005550157,0.0005464601,0.000153923,0.00006706596,0.0000958337,0.003123925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7603765,"threshold_uncertainty_score":0.9998547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970126214","doi":"10.5555/1109557.1109603","title":"Implicit dictionaries with O(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Constant (computer programming); Set (abstract data type); Computer science; Order (exchange); Search cost; Combinatorics; Binary logarithm; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.008316166533379635,"gpt":0.2350977895385778,"spread":0.2267816230051982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001449423,0.0002513077,0.0001935516,0.0001501579,0.000550797,0.0004813783,0.0006042972,0.00007097473,0.00001678858],"category_scores_gemma":[0.000002175865,0.0001837412,0.00004391236,0.0003094924,0.000175047,0.0008056604,0.000343674,0.0002042316,0.00007591466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000041685,"about_ca_system_score_gemma":0.00005950875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003148194,"about_ca_topic_score_gemma":0.00001461199,"domain_scores_codex":[0.9980819,0.00005911068,0.0002356122,0.0007165738,0.0004944511,0.0004124082],"domain_scores_gemma":[0.9987646,0.00005841121,0.00007020712,0.0008416095,0.0001141868,0.0001509658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001102259,0.0004960765,0.001770843,0.00005160382,0.0001150017,0.00006687103,0.0009129713,0.01070707,0.01095221,0.8873478,0.007409977,0.08005938],"study_design_scores_gemma":[0.002477215,0.001107288,0.05001795,0.0001499303,0.00006210169,0.0003112735,0.0003031932,0.854056,0.008321501,0.01326565,0.06822626,0.001701667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00985623,0.0002824143,0.9776972,0.006302881,0.0001811005,0.0003352352,0.0001572837,0.0003065779,0.004881106],"genre_scores_gemma":[0.7836423,0.000375743,0.2121032,0.0006127688,0.0005945004,0.0001774979,0.0003466698,0.00007190985,0.00207543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8740821,"threshold_uncertainty_score":0.7492747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081622490","doi":"10.5555/338219.338260","title":"A fast algorithm to generate unlabeled necklaces","year":2000,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.009245848424656271,"gpt":0.2503925321792809,"spread":0.2411466837546246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000407951,0.0004961346,0.0004380175,0.0003526911,0.0003122178,0.0005942025,0.001607574,0.0001741188,0.0005993999],"category_scores_gemma":[0.00001494048,0.0004494015,0.000190956,0.001127856,0.00007729486,0.0007365729,0.0002412259,0.0003111307,0.003074656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213847,"about_ca_system_score_gemma":0.0000882612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008325704,"about_ca_topic_score_gemma":0.000005996405,"domain_scores_codex":[0.9965079,0.000194744,0.0005289541,0.001181498,0.0007295637,0.0008573205],"domain_scores_gemma":[0.9979436,0.00007623962,0.00009927425,0.001196422,0.0001658784,0.0005186047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001741979,0.0001261917,0.000007058545,0.000007947593,0.00004188494,0.0000755253,0.0005129603,0.000158678,0.004418968,0.001121335,0.00583948,0.9876726],"study_design_scores_gemma":[0.002945738,0.003940029,0.0004680603,0.0003929658,0.00007128357,0.000268656,0.0001093973,0.335895,0.4622877,0.008417352,0.1814963,0.003707506],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01259312,0.0001570799,0.9259532,0.009957537,0.0007375167,0.001378613,0.0001360146,0.002778519,0.04630839],"genre_scores_gemma":[0.03168552,0.0005637662,0.9322719,0.009608596,0.00100625,0.0007815154,0.00008695993,0.0001558914,0.02383962],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.983965,"threshold_uncertainty_score":0.9997958,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02388050190607395,"gpt":0.2873125432453776,"spread":0.2634320413393036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002257151,0.0002488353,0.000178038,0.000208455,0.0007318632,0.0004797731,0.001607913,0.00009929008,0.00001441135],"category_scores_gemma":[0.0001991112,0.0001295608,0.0001843723,0.001122845,0.0001203243,0.0002002371,0.0002132787,0.0003458188,0.00004407649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009467161,"about_ca_system_score_gemma":0.00008539968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004507657,"about_ca_topic_score_gemma":0.00000836168,"domain_scores_codex":[0.9977428,0.0001116871,0.0003622431,0.0005349485,0.0005916959,0.0006566705],"domain_scores_gemma":[0.99676,0.001645499,0.0001416795,0.001126065,0.0001712899,0.0001554779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001583096,0.0002979537,0.000009387498,0.00002864372,0.0001707913,0.00001209741,0.001346356,0.0147674,0.00219671,0.8469909,0.005521742,0.1284996],"study_design_scores_gemma":[0.000714899,0.00109956,0.0001063281,0.00002044029,0.00001516647,0.000006897799,0.00007481786,0.9639472,0.004289582,0.002743848,0.02672403,0.0002572833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001247992,0.0001617811,0.9559953,0.030501,0.001056593,0.001219806,0.00001947104,0.0001954557,0.01072585],"genre_scores_gemma":[0.7963209,0.001034951,0.1414844,0.02988007,0.002918139,0.0009803327,0.00008261863,0.0002399761,0.02705862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9491798,"threshold_uncertainty_score":0.5628974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071492694","doi":"10.5555/365411.365780","title":"On validating planar worlds","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Correctness; Planar straight-line graph; Planar; Planar graph; Embedding; Computer science; Graph; Robot; Book embedding; Graph embedding; Theoretical computer science; Algorithm; Artificial intelligence; Computer graphics (images); Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01043334910638345,"gpt":0.2273625299195004,"spread":0.216929180813117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001047517,0.0002436317,0.0001890903,0.0001469987,0.0001109007,0.00008347069,0.0001528997,0.00009937824,0.00008755903],"category_scores_gemma":[0.00001453931,0.0002272695,0.00007838423,0.0002741463,0.00002401286,0.00008629912,0.00001056035,0.0001984889,0.0002478605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008722754,"about_ca_system_score_gemma":0.000008171598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001594034,"about_ca_topic_score_gemma":0.000004828085,"domain_scores_codex":[0.9987794,0.00003213175,0.0002543012,0.0002661425,0.0002995987,0.0003684069],"domain_scores_gemma":[0.9993949,0.0000820151,0.00003401333,0.0003348546,0.00002672396,0.000127516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000244834,0.00003610813,0.0001468592,0.00002445827,0.00004402885,0.00005949729,0.0001454921,0.9819348,0.00457942,0.006121363,0.003013882,0.003869603],"study_design_scores_gemma":[0.0006652154,0.0002801348,0.0002530008,0.0001338526,0.00002688731,0.00001426699,0.00006177869,0.9773085,0.009918115,0.0008327247,0.009944455,0.0005610584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2163399,0.0003054182,0.4250563,0.00280957,0.004466583,0.001105299,0.0001347842,0.002837449,0.3469446],"genre_scores_gemma":[0.9947155,0.0002151343,0.002459993,0.0004769357,0.0004724542,0.00002195224,0.0001696647,0.0001250667,0.00134326],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7783756,"threshold_uncertainty_score":0.9267781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994128719","doi":"10.5555/365411.365789","title":"Linear reductions of maximum matching","year":2001,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matching (statistics); Computer science; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02791080801521452,"gpt":0.2495155277405985,"spread":0.221604719725384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006176422,0.0001715406,0.0003895005,0.0002136894,0.0001256369,0.00003115036,0.000249773,0.0001005242,0.0002713401],"category_scores_gemma":[0.00003212225,0.0001830031,0.0001702336,0.0002829224,0.00007940038,0.0001576578,0.00004268523,0.0001753009,0.0006868659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004615645,"about_ca_system_score_gemma":0.000009720596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002192178,"about_ca_topic_score_gemma":0.000002721464,"domain_scores_codex":[0.9985841,0.00003451503,0.0006487987,0.0003783947,0.00005624404,0.0002979815],"domain_scores_gemma":[0.9990312,0.00004843019,0.0003478115,0.0004573283,0.00002837198,0.00008683337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001700918,0.0004879418,0.00875839,0.0001670793,0.0003256256,0.0000327335,0.003892165,0.006852321,0.00464892,0.9709771,0.001335024,0.002352602],"study_design_scores_gemma":[0.003992162,0.001797577,0.008540212,0.0005374902,0.00008698805,0.0003147957,0.002806206,0.01988195,0.01069448,0.726833,0.2218698,0.002645314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6983019,0.0008494668,0.02593168,0.003060581,0.002892993,0.0005331677,0.0003640819,0.0002362382,0.26783],"genre_scores_gemma":[0.9918842,0.0001414849,0.001454083,0.0000795294,0.000434843,0.00001876202,0.00002385917,0.00003891585,0.005924318],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2935824,"threshold_uncertainty_score":0.8828501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962748838","doi":"10.5555/3310435.3310479","title":"Testing halfspaces over rotation-invariant distributions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Logarithm; Invariant (physics); Mathematics; Rotation (mathematics); Function (biology); Distribution (mathematics); Probability distribution; Sign (mathematics); Discrete mathematics; Combinatorics; Sign function; Algorithm; Mathematical analysis; Geometry; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01017916966396251,"gpt":0.2524591371140157,"spread":0.2422799674500532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003921039,0.0003174331,0.0002798745,0.000150826,0.000341182,0.0004534248,0.0008917601,0.00009971084,0.00009099009],"category_scores_gemma":[0.00012183,0.000270549,0.0001325586,0.0007816085,0.00005337748,0.0005741689,0.0002672736,0.0003975596,0.0008149503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008012302,"about_ca_system_score_gemma":0.0001016524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002457319,"about_ca_topic_score_gemma":0.000003421882,"domain_scores_codex":[0.997577,0.0001474813,0.0003348631,0.000795963,0.0005707943,0.0005739318],"domain_scores_gemma":[0.9982074,0.0003619707,0.0001890765,0.0009175515,0.0001200083,0.000203972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008309192,0.001211125,0.06523225,0.0003255738,0.0005728656,0.000386456,0.004558646,0.05436204,0.07231454,0.5930205,0.01219981,0.1957331],"study_design_scores_gemma":[0.001055855,0.000612201,0.02909151,0.0001500497,0.0000215946,0.00004877159,0.00005996022,0.9537192,0.002126321,0.003032166,0.009272696,0.0008096736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07629576,0.0001883862,0.8492208,0.01247693,0.004903639,0.00112064,0.0001458323,0.00175222,0.05389577],"genre_scores_gemma":[0.8764171,0.00001578346,0.1166536,0.0006730569,0.0005993964,0.00008262232,0.000110395,0.0000578262,0.005390185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8993571,"threshold_uncertainty_score":0.9999747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569985645","doi":"10.5555/2627817.2627876","title":"The traveling salesman problem for lines, balls and planes","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Travelling salesman problem; Combinatorics; Plane (geometry); Approximation algorithm; Mathematics; Space (punctuation); Unit sphere; Set (abstract data type); Unit (ring theory); Mathematical optimization; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01009252159896281,"gpt":0.2369226588160777,"spread":0.2268301372171149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587191,0.0001369896,0.0001037726,0.00004432683,0.0004145614,0.0004571211,0.0003038347,0.00004620096,0.000002114264],"category_scores_gemma":[0.00001671069,0.00009195614,0.00004577976,0.000149173,0.00003930018,0.0002964506,0.00007357028,0.00007285326,0.00002466027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424161,"about_ca_system_score_gemma":0.00003621143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002382929,"about_ca_topic_score_gemma":0.000007800691,"domain_scores_codex":[0.9989833,0.00003845761,0.0002093474,0.0003284395,0.0001977083,0.0002427586],"domain_scores_gemma":[0.9991804,0.0003270968,0.00007010253,0.0002286938,0.0001082613,0.00008541505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004258201,0.0001115066,0.0001313875,0.0001036569,0.0001270805,0.000004501484,0.001526522,0.01503322,0.01653087,0.4167976,0.01018079,0.5394102],"study_design_scores_gemma":[0.0006610944,0.0003999628,0.001644064,0.00003622319,0.00001214509,0.00002569154,0.00004472766,0.9145833,0.004096947,0.04992718,0.02822927,0.0003393914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472046,0.0005992151,0.9505548,0.02975249,0.0009035452,0.001565364,0.00002070998,0.0001913301,0.001692008],"genre_scores_gemma":[0.7271419,0.0004872682,0.2634975,0.001434253,0.001346039,0.0008023576,0.0001305882,0.00004436971,0.00511574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8995501,"threshold_uncertainty_score":0.4408029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984099766","doi":"10.5555/1283383.1283472","title":"Lower bounds on average-case delay for video-on-demand broadcast protocols","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Communication source; Upper and lower bounds; Bandwidth (computing); Atomic broadcast; Video on demand; Matching (statistics); Computer network; Set (abstract data type); Constant (computer programming); Broadcasting (networking); Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02433597484567163,"gpt":0.3356211953914677,"spread":0.311285220545796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00201243,0.0005485762,0.0004354995,0.0005030652,0.0006782118,0.0004649954,0.001458757,0.0001807595,0.00003646286],"category_scores_gemma":[0.0001430543,0.0004576416,0.0003281307,0.0007611147,0.0002418859,0.0006340345,0.0003081472,0.000575324,0.0002606066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002242046,"about_ca_system_score_gemma":0.0001051437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008122057,"about_ca_topic_score_gemma":0.000005699027,"domain_scores_codex":[0.9954302,0.0001833518,0.0005913607,0.001384083,0.001033342,0.001377609],"domain_scores_gemma":[0.9961662,0.001055242,0.0002076064,0.001811126,0.0002352873,0.0005244903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.01159863,0.003969599,0.0001867337,0.0005278292,0.0005955489,0.02308855,0.003657999,0.01626047,0.02164758,0.607834,0.01106622,0.2995668],"study_design_scores_gemma":[0.01982193,0.04345284,0.0002610558,0.001454982,0.00006937222,0.003711581,0.000280027,0.2138437,0.1967443,0.122143,0.3926353,0.005582022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007474455,0.00003691685,0.9571854,0.001252538,0.0008753093,0.01992387,0.000109971,0.0004438502,0.0126977],"genre_scores_gemma":[0.7615498,0.00003847992,0.1727916,0.008623507,0.002957193,0.03885227,0.00007555883,0.0005780288,0.01453356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7843938,"threshold_uncertainty_score":0.9997875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}