{"meta":{"query_hash":"99cd3cdc1891","filters":{"venue":"Symposium on Discrete Algorithms"},"cohort_total":59,"direct_labels_cover":0,"predictions_cover":59,"exported":59,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/99cd3cdc1891","api":"https://metacan.xera.ac/api/v1/cohort?venue=Symposium+on+Discrete+Algorithms"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01650779417379294,"score_gpt":0.2897351951554409,"score_spread":0.27322740098164794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509794588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028219406,0.000266261,0.9848246,0.010546347,0.00035985274,0.0017258164,0.000097923235,0.00045472593,0.0014422812],"genre_scores_gemma":[0.043701474,0.00021586783,0.9476577,0.0022447645,0.0012616548,0.00069832423,0.00009006953,0.000142889,0.003987258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589074,0.0002651602,0.0005596132,0.0011355896,0.0009180244,0.0012308792],"domain_scores_gemma":[0.9968549,0.00070464244,0.00021357399,0.0016102172,0.00029294347,0.00032373655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014622061,0.00051972107,0.00047246763,0.0002058596,0.0007956898,0.0005705699,0.00243204,0.00016969742,0.000018424878],"category_scores_gemma":[0.000100272606,0.00034660145,0.00042595234,0.00086304604,0.00027409816,0.0008985559,0.00039538814,0.00075394486,0.00015410793],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084937485,0.00024779656,0.000012108878,0.000017743341,0.00009700379,0.000044190478,0.0012261769,0.0007224966,0.0027332308,0.05553354,0.0007680358,0.93851274],"study_design_scores_gemma":[0.0010032144,0.0017627903,0.00022414664,0.000100047146,0.000028084629,0.00003823431,0.00007657231,0.9192542,0.004316478,0.06303423,0.00953118,0.00063081307],"about_ca_topic_score_codex":0.000040122726,"about_ca_topic_score_gemma":0.0000052956625,"teacher_disagreement_score":0.93788195,"about_ca_system_score_codex":0.00014965865,"about_ca_system_score_gemma":0.00013590777,"threshold_uncertainty_score":0.9998986},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; 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","score_opus":0.027851099954755952,"score_gpt":0.3676772088583154,"score_spread":0.33982610890355947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512019713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07803412,0.00027456117,0.63923764,0.17306459,0.0017061961,0.0071013467,0.00020295213,0.0011482632,0.09923031],"genre_scores_gemma":[0.92191243,0.00027007397,0.0678065,0.0049708006,0.00087112654,0.00045856475,0.00047502597,0.00007500869,0.0031604762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674296,0.00052444026,0.00081929634,0.00061846146,0.0005192868,0.00077558064],"domain_scores_gemma":[0.9981592,0.00023841011,0.00025944554,0.0006404483,0.00034127932,0.00036121564],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007299399,0.00036680527,0.00043992026,0.00020149407,0.002039093,0.00008133395,0.00021708813,0.00024638427,0.0002899863],"category_scores_gemma":[0.0000953346,0.00026528034,0.00010729169,0.0004872463,0.00006276175,0.00036362177,0.00003393046,0.0007664937,0.00027187914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006543259,0.0018614708,0.010738841,0.000688237,0.000787423,0.00024614434,0.029657684,0.7136005,0.012901485,0.17073943,0.010662371,0.041573163],"study_design_scores_gemma":[0.038550463,0.010626942,0.02050314,0.004119234,0.00056168437,0.000060480965,0.011962479,0.8514979,0.0023799697,0.0041406914,0.05103695,0.0045600953],"about_ca_topic_score_codex":0.000084689476,"about_ca_topic_score_gemma":0.0000589528,"teacher_disagreement_score":0.8438783,"about_ca_system_score_codex":0.00024920818,"about_ca_system_score_gemma":0.00045162832,"threshold_uncertainty_score":0.9999799},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01441717215288716,"score_gpt":0.25912092714576584,"score_spread":0.2447037549928787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561175729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013445498,0.00029764776,0.9401494,0.022478305,0.0011172025,0.00036896014,0.0000148472145,0.0005268321,0.021601306],"genre_scores_gemma":[0.9584111,0.000045781333,0.036404442,0.0027861178,0.0004938754,0.000016455702,0.000039397524,0.000010179377,0.0017926471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862057,0.0000663343,0.0002101775,0.00043420622,0.0004016121,0.00026710107],"domain_scores_gemma":[0.99923116,0.000072621195,0.00006707075,0.0004349691,0.00006747124,0.0001266946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019745885,0.00017264909,0.00014901016,0.00018781572,0.00016018134,0.00019022619,0.0004426965,0.00005749274,0.000020245303],"category_scores_gemma":[0.000017649392,0.00015168478,0.00010177018,0.0005473479,0.000019810792,0.00041323472,0.00004402541,0.00010428414,0.00015117096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092748494,0.00060808624,0.000120304445,0.000013832041,0.000070292364,0.00012371033,0.0013258473,0.03677823,0.037653137,0.29503605,0.015281817,0.61289597],"study_design_scores_gemma":[0.0026513755,0.0022998212,0.025952948,0.00007101013,0.00002783223,0.000057081823,0.000028186176,0.8657123,0.034025874,0.036600452,0.031406287,0.0011668587],"about_ca_topic_score_codex":0.0000057712555,"about_ca_topic_score_gemma":0.0000019242996,"teacher_disagreement_score":0.9449656,"about_ca_system_score_codex":0.00003754986,"about_ca_system_score_gemma":0.00004499002,"threshold_uncertainty_score":0.6185526},"labels":[],"label_agreement":null},{"id":"W1866560977","doi":"10.5555/2884435.2884542","title":"Connectivity in bridge-addable graph classes: the mcdiarmid-steger-welsh conjecture","year":2016,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Random graph; Combinatorics; 1-planar graph; Bounded function; Discrete mathematics; Planar graph; Randomness; Class (philosophy); Graph; Chordal graph; Computer science","score_opus":0.03266091748356323,"score_gpt":0.30880514286604677,"score_spread":0.2761442253824835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866560977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028237712,0.0002198861,0.94659173,0.012641641,0.0012815291,0.0014494094,0.00066150626,0.00029517323,0.008621409],"genre_scores_gemma":[0.99472976,0.00012435921,0.003082755,0.0005576999,0.00026497064,0.00019300486,0.000007968962,0.00008188826,0.00095760595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742335,0.00017846521,0.0004938007,0.00064198475,0.0005414467,0.0007209747],"domain_scores_gemma":[0.99536353,0.003441658,0.00018789833,0.0007197252,0.000105099156,0.00018208101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064374536,0.0004071315,0.0005171479,0.00012002233,0.00020059527,0.00008748297,0.00051952456,0.00021304167,0.00016498403],"category_scores_gemma":[0.0011092555,0.00021257617,0.0001650719,0.00041508343,0.00019184589,0.00016507451,0.00013370872,0.00037709763,0.00010047558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019805209,0.00034072105,0.00014166208,0.00018203088,0.00012554617,0.00010669085,0.00066245324,0.000028565835,0.002667226,0.97680765,0.0058524082,0.012886968],"study_design_scores_gemma":[0.0022613618,0.0007090036,0.0006135668,0.00043927776,0.000101782636,0.000055978704,0.00021359089,0.0037517236,0.004853708,0.983972,0.0023219099,0.0007060924],"about_ca_topic_score_codex":0.00009796245,"about_ca_topic_score_gemma":0.00017972627,"teacher_disagreement_score":0.96649206,"about_ca_system_score_codex":0.00013726523,"about_ca_system_score_gemma":0.00010955419,"threshold_uncertainty_score":0.86686045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008316166533379635,"score_gpt":0.23509778953857782,"score_spread":0.2267816230051982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970126214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00985623,0.00028241432,0.9776972,0.006302881,0.0001811005,0.00033523518,0.0001572837,0.00030657792,0.004881106],"genre_scores_gemma":[0.7836423,0.00037574302,0.21210319,0.00061276875,0.0005945004,0.00017749789,0.00034666978,0.00007190985,0.0020754295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808186,0.00005911068,0.0002356122,0.00071657385,0.0004944511,0.0004124082],"domain_scores_gemma":[0.99876463,0.000058411206,0.00007020712,0.0008416095,0.000114186754,0.00015096582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014494229,0.0002513077,0.00019355158,0.00015015794,0.000550797,0.00048137832,0.00060429715,0.00007097473,0.000016788583],"category_scores_gemma":[0.000002175865,0.00018374117,0.00004391236,0.00030949237,0.000175047,0.00080566044,0.00034367404,0.00020423163,0.00007591466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110225876,0.00049607654,0.0017708432,0.000051603824,0.00011500166,0.00006687103,0.0009129713,0.010707068,0.010952212,0.88734776,0.007409977,0.08005938],"study_design_scores_gemma":[0.002477215,0.001107288,0.050017945,0.00014993035,0.00006210169,0.0003112735,0.0003031932,0.854056,0.008321501,0.013265647,0.06822626,0.0017016671],"about_ca_topic_score_codex":0.00031481936,"about_ca_topic_score_gemma":0.000014611991,"teacher_disagreement_score":0.87408215,"about_ca_system_score_codex":0.000041685,"about_ca_system_score_gemma":0.000059508755,"threshold_uncertainty_score":0.74927473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","score_opus":0.03007951308552398,"score_gpt":0.2687336219725512,"score_spread":0.2386541088870272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974542877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034049123,0.00009437509,0.98626006,0.0013941916,0.0010761147,0.0016342177,0.00006149506,0.0006349487,0.005439672],"genre_scores_gemma":[0.19032773,0.000044967474,0.80168736,0.00060877355,0.0012978743,0.0010290975,0.00028654074,0.00017646149,0.004541162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956868,0.00009008035,0.0007481955,0.0013143965,0.0009491385,0.0012113814],"domain_scores_gemma":[0.9971563,0.0005007719,0.00039377672,0.0011470829,0.00044215153,0.00035989154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016443476,0.0005773473,0.0005011432,0.0005316822,0.001247048,0.00053544936,0.001167986,0.00020235742,0.000012329781],"category_scores_gemma":[0.00006998628,0.0004888626,0.00029371923,0.001736364,0.00021134988,0.0009749073,0.00024063121,0.00045612376,0.00003158544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016898199,0.004454155,0.0059018102,0.0016688575,0.0019787732,0.00031142143,0.012788867,0.06445301,0.013692101,0.4038747,0.007499862,0.48168662],"study_design_scores_gemma":[0.004418265,0.003657773,0.0031818852,0.00033339055,0.00011635645,0.00022995146,0.00048561534,0.9389687,0.0063498886,0.01858553,0.021848848,0.0018237571],"about_ca_topic_score_codex":0.0000953799,"about_ca_topic_score_gemma":0.00017380364,"teacher_disagreement_score":0.8745157,"about_ca_system_score_codex":0.00022941128,"about_ca_system_score_gemma":0.00017100916,"threshold_uncertainty_score":0.9997563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009552694781969635,"score_gpt":0.2604830810511529,"score_spread":0.2509303862691833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980569719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755821,0.00026011866,0.0021888511,0.0014018584,0.00024537556,0.00020896689,0.00009413868,0.00007197047,0.01994659],"genre_scores_gemma":[0.98455656,0.00026811607,0.006856155,0.0010488103,0.0007192595,0.00003672164,0.0004226648,0.000037539885,0.0060541844],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985972,0.00005101036,0.00023422188,0.000518273,0.00023155693,0.0003677585],"domain_scores_gemma":[0.99927723,0.000010158042,0.00006351891,0.00046878235,0.00004075457,0.0001395612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011295732,0.00022666757,0.00017659692,0.000040591643,0.00014907983,0.000059330934,0.00027423498,0.00012086764,0.00043778232],"category_scores_gemma":[0.000022149112,0.00019378455,0.00017142827,0.00014982744,0.00011483134,0.000011853994,0.000043503172,0.00011055498,0.0003040963],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084054765,0.00006616611,0.00023162695,0.000012577191,0.00009521412,0.00003520236,0.000058791004,0.004793585,0.9626222,0.00012325337,0.001068835,0.030808445],"study_design_scores_gemma":[0.0013208893,0.0017545831,0.0005342955,0.000112473965,0.00015742808,0.00011046399,0.00010337845,0.0730582,0.8443888,0.0011524631,0.07586085,0.0014461909],"about_ca_topic_score_codex":0.00009236653,"about_ca_topic_score_gemma":0.0000063240086,"teacher_disagreement_score":0.11823347,"about_ca_system_score_codex":0.000023115505,"about_ca_system_score_gemma":0.000040278668,"threshold_uncertainty_score":0.79023045},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; 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","score_opus":0.024335974845671633,"score_gpt":0.3356211953914677,"score_spread":0.31128522054579605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984099766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074744546,0.000036916852,0.9571854,0.0012525377,0.0008753093,0.019923868,0.000109971006,0.00044385018,0.012697698],"genre_scores_gemma":[0.7615498,0.00003847992,0.17279162,0.008623507,0.0029571927,0.038852274,0.00007555883,0.00057802885,0.014533563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99543023,0.00018335183,0.0005913607,0.0013840826,0.0010333423,0.0013776091],"domain_scores_gemma":[0.9961662,0.0010552417,0.00020760635,0.0018111265,0.00023528734,0.00052449026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00201243,0.00054857624,0.00043549947,0.00050306524,0.0006782118,0.0004649954,0.0014587571,0.00018075948,0.000036462858],"category_scores_gemma":[0.00014305432,0.00045764155,0.00032813073,0.0007611147,0.00024188588,0.00063403446,0.00030814717,0.000575324,0.00026060658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011598625,0.0039695986,0.00018673373,0.0005278292,0.00059554895,0.023088554,0.003657999,0.016260473,0.021647576,0.60783404,0.011066222,0.2995668],"study_design_scores_gemma":[0.01982193,0.043452844,0.0002610558,0.0014549819,0.000069372225,0.0037115805,0.00028002704,0.21384366,0.19674426,0.12214301,0.39263526,0.0055820225],"about_ca_topic_score_codex":0.000008122057,"about_ca_topic_score_gemma":0.0000056990266,"teacher_disagreement_score":0.7843938,"about_ca_system_score_codex":0.00022420457,"about_ca_system_score_gemma":0.000105143656,"threshold_uncertainty_score":0.9997875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01978642089397287,"score_gpt":0.29402099037229334,"score_spread":0.2742345694783205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987809901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527158,0.0003444906,0.30946776,0.005685002,0.0027351275,0.0025573014,0.00017490043,0.0011665784,0.025153028],"genre_scores_gemma":[0.8906796,0.0002703315,0.10771524,0.0004658555,0.0003002025,0.00012174621,0.000039098075,0.00007311522,0.00033480284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953496,0.0002730713,0.00069564814,0.0015233435,0.0010380879,0.0011202468],"domain_scores_gemma":[0.99700737,0.00028786153,0.000333956,0.0016726402,0.00024195864,0.0004562384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013055442,0.00051543786,0.00051140966,0.00019881697,0.00063036504,0.0005510226,0.0013927575,0.00023649202,0.00007295918],"category_scores_gemma":[0.0002560743,0.0004596269,0.0001814672,0.0007906207,0.00033699285,0.0013312522,0.0012538201,0.0011916786,0.00011647896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008951654,0.0020466354,0.009452774,0.00026878822,0.0005003774,0.0007262701,0.008110292,0.00019923145,0.14191979,0.5393721,0.0018810491,0.29462758],"study_design_scores_gemma":[0.0071917158,0.0025429893,0.053483985,0.00039214126,0.00008072758,0.0002542521,0.00045555164,0.21591444,0.065386966,0.6335759,0.017124757,0.0035965375],"about_ca_topic_score_codex":0.0001290229,"about_ca_topic_score_gemma":0.00009772328,"teacher_disagreement_score":0.29103103,"about_ca_system_score_codex":0.000077437995,"about_ca_system_score_gemma":0.00010253705,"threshold_uncertainty_score":0.99978554},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011671707685845136,"score_gpt":0.23382718519165582,"score_spread":0.2221554775058107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990177682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24765824,0.0024625515,0.60709953,0.014640607,0.015624987,0.0040536,0.0002587888,0.0076403236,0.10056139],"genre_scores_gemma":[0.813997,0.0005537362,0.18345419,0.00046479068,0.0005817824,0.00009848763,0.00003631467,0.000075823606,0.00073793373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722236,0.00009675469,0.00044108476,0.0009986671,0.0005672025,0.0006739086],"domain_scores_gemma":[0.99822193,0.00020783996,0.00015706451,0.00095614715,0.00012039019,0.0003366527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335181,0.0004070022,0.00036664036,0.00037566526,0.00044571538,0.00044026648,0.0011079072,0.00019280805,0.000018158607],"category_scores_gemma":[0.000059556016,0.0003559271,0.00014736048,0.0013450735,0.00019910494,0.00053815945,0.00038132264,0.0007648719,0.00005157329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040620816,0.0008810429,0.003148595,0.00022892692,0.0002642792,0.00023476708,0.0039526983,0.0002228504,0.04452967,0.2912487,0.0013551066,0.65389276],"study_design_scores_gemma":[0.002779436,0.0013653069,0.034087334,0.0002565579,0.00007468067,0.0003364087,0.00006848514,0.8610567,0.009266636,0.0666084,0.021609286,0.0024907985],"about_ca_topic_score_codex":0.000098298035,"about_ca_topic_score_gemma":0.000031082836,"teacher_disagreement_score":0.8608338,"about_ca_system_score_codex":0.000024057672,"about_ca_system_score_gemma":0.000060207596,"threshold_uncertainty_score":0.99988925},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.02791080801521452,"score_gpt":0.24951552774059851,"score_spread":0.22160471972538398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994128719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69830185,0.00084946677,0.02593168,0.003060581,0.0028929932,0.0005331677,0.00036408193,0.00023623816,0.26782995],"genre_scores_gemma":[0.99188423,0.00014148485,0.0014540828,0.000079529396,0.00043484298,0.000018762017,0.000023859173,0.000038915852,0.0059243175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985841,0.000034515033,0.00064879865,0.0003783947,0.000056244036,0.0002979815],"domain_scores_gemma":[0.99903125,0.000048430185,0.00034781152,0.0004573283,0.000028371978,0.000086833374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006176422,0.00017154057,0.00038950046,0.00021368937,0.00012563687,0.000031150365,0.00024977297,0.00010052423,0.00027134013],"category_scores_gemma":[0.00003212225,0.00018300314,0.00017023363,0.0002829224,0.00007940038,0.00015765784,0.00004268523,0.00017530087,0.0006868659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017009184,0.00048794175,0.00875839,0.00016707934,0.00032562562,0.0000327335,0.0038921654,0.006852321,0.00464892,0.9709771,0.0013350245,0.0023526023],"study_design_scores_gemma":[0.0039921617,0.0017975766,0.008540212,0.00053749024,0.000086988046,0.00031479573,0.0028062055,0.01988195,0.010694482,0.72683305,0.22186977,0.0026453144],"about_ca_topic_score_codex":0.00021921779,"about_ca_topic_score_gemma":0.0000027214637,"teacher_disagreement_score":0.29358238,"about_ca_system_score_codex":0.00004615645,"about_ca_system_score_gemma":0.000009720596,"threshold_uncertainty_score":0.88285005},"labels":[],"label_agreement":null},{"id":"W2006093991","doi":"10.5555/982792.982915","title":"A maiden analysis of Longest Wait First","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer science; Scheduling (production processes); Competitive analysis; Computer network; Mathematical optimization; Mathematics","score_opus":0.013779340519190672,"score_gpt":0.25979166195592013,"score_spread":0.24601232143672946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006093991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052969465,0.00009341816,0.96751803,0.012356493,0.00029922815,0.00040770133,0.000046464178,0.0002509874,0.013730708],"genre_scores_gemma":[0.9086021,0.0002871537,0.08917253,0.00061080075,0.00007897071,0.00004909026,0.000059370002,0.000028682529,0.0011113142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00005110464,0.0003502453,0.00048375007,0.00055332074,0.00034704385],"domain_scores_gemma":[0.998689,0.00006681802,0.00013260938,0.00080290326,0.00013152216,0.00017716252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278103,0.00017902175,0.00032530408,0.0005316924,0.000128565,0.00013778663,0.0009168108,0.0000760666,0.00007635251],"category_scores_gemma":[0.000022381766,0.00015438496,0.00023009646,0.0020642618,0.000084255604,0.00037937443,0.00020889207,0.00013248439,0.00010494552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024814637,0.00041175706,0.0010007747,0.00005154669,0.0010807416,0.00005797673,0.0033086746,0.8564544,0.00092100905,0.13278677,0.00028724526,0.00361433],"study_design_scores_gemma":[0.0020666658,0.0010080353,0.009919254,0.00012095616,0.00035277233,0.000010257533,0.00009886577,0.9733,0.005672678,0.003677977,0.0029754476,0.00079708867],"about_ca_topic_score_codex":0.00016244852,"about_ca_topic_score_gemma":0.00008453336,"teacher_disagreement_score":0.9033052,"about_ca_system_score_codex":0.00009125632,"about_ca_system_score_gemma":0.00007794376,"threshold_uncertainty_score":0.6295636},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011839585345832392,"score_gpt":0.22527799712169255,"score_spread":0.21343841177586015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010996873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688202,0.0001973264,0.72342837,0.052321415,0.0032099488,0.0043414994,0.0005597383,0.00100805,0.07805165],"genre_scores_gemma":[0.9699648,0.000017618695,0.0282504,0.00049702014,0.00010928308,0.000086017295,0.000037615584,0.00002551186,0.0010117306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974603,0.00027844057,0.000498274,0.0006326795,0.0007245122,0.00040578496],"domain_scores_gemma":[0.9980025,0.00014835158,0.0002766286,0.0013200324,0.00017454971,0.00007790491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055751007,0.000283273,0.0003039611,0.0001199934,0.00031570825,0.00014911321,0.0015499091,0.00011538627,0.00001111961],"category_scores_gemma":[0.000021202448,0.00021126926,0.00025374978,0.00083320454,0.00030393133,0.00031269822,0.00044327226,0.000321604,0.0000036967392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022964141,0.0009012559,0.002186992,0.00012681262,0.000051745108,0.000007855712,0.0008022469,0.0020877488,0.0064195246,0.97312456,0.0017188862,0.012549432],"study_design_scores_gemma":[0.0027152519,0.0009443537,0.05467756,0.0002287768,0.000052773048,0.000041140327,0.000067511995,0.19183676,0.11644214,0.62089103,0.010835334,0.0012673669],"about_ca_topic_score_codex":0.0007782922,"about_ca_topic_score_gemma":0.00008228325,"teacher_disagreement_score":0.8330828,"about_ca_system_score_codex":0.00012239779,"about_ca_system_score_gemma":0.00012832646,"threshold_uncertainty_score":0.861531},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00843081260272268,"score_gpt":0.23180925757714604,"score_spread":0.22337844497442336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013696768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075562706,0.000104109626,0.9850903,0.00012757636,0.0009192692,0.0007267048,0.00016416311,0.0010154577,0.011096787],"genre_scores_gemma":[0.27304322,0.00012968875,0.7195329,0.0002511725,0.0020719504,0.00049157406,0.0026597567,0.0004041378,0.0014155911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998365,0.00004086063,0.00041337594,0.00039705457,0.00028734357,0.0004963777],"domain_scores_gemma":[0.9992401,0.0000653622,0.00008013572,0.00040043585,0.000090599875,0.00012336895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023627738,0.00033696066,0.00026676906,0.00019269103,0.00018356237,0.00021701989,0.00021873356,0.00017835495,0.000037726106],"category_scores_gemma":[0.000006511974,0.0003373019,0.00011531054,0.00028454876,0.00004081532,0.00038327402,0.000013948303,0.00016657403,0.00004851236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001276793,0.00013758382,0.00007903466,0.00013369843,0.000063359075,0.0000041879066,0.00024252893,0.8815109,0.0041821604,0.0023699482,0.001773908,0.109489925],"study_design_scores_gemma":[0.0008240507,0.0001926222,0.00013433602,0.00005223328,0.000034075023,0.000006212303,0.00003182553,0.9872912,0.0043751923,0.000710742,0.00588572,0.00046177336],"about_ca_topic_score_codex":0.000024019557,"about_ca_topic_score_gemma":0.00000525147,"teacher_disagreement_score":0.2722876,"about_ca_system_score_codex":0.00011182166,"about_ca_system_score_gemma":0.000019343948,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W2015639925","doi":"10.5555/1283383.1283392","title":"Improved bounds for the symmetric rendezvous value on the line","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rendezvous; Conjecture; Mathematics; Semidefinite programming; Value (mathematics); Markov decision process; Line (geometry); Mathematical optimization; Quadratic equation; Markov chain; Applied mathematics; Combinatorics; Markov process; Discrete mathematics; Physics; Statistics; Geometry","score_opus":0.023880501906073954,"score_gpt":0.2873125432453776,"score_spread":0.26343204133930365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015639925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012479925,0.00016178108,0.95599526,0.030500997,0.0010565931,0.0012198063,0.000019471043,0.0001954557,0.010725849],"genre_scores_gemma":[0.79632086,0.001034951,0.14148441,0.029880065,0.0029181389,0.0009803327,0.00008261863,0.00023997606,0.027058618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977428,0.00011168712,0.0003622431,0.00053494854,0.00059169595,0.0006566705],"domain_scores_gemma":[0.99676,0.001645499,0.00014167951,0.0011260654,0.00017128985,0.00015547794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022571508,0.0002488353,0.000178038,0.00020845502,0.0007318632,0.00047977307,0.0016079128,0.000099290075,0.000014411351],"category_scores_gemma":[0.0001991112,0.00012956084,0.00018437234,0.0011228449,0.000120324265,0.00020023707,0.00021327872,0.00034581884,0.000044076485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015830957,0.00029795372,0.000009387498,0.000028643717,0.0001707913,0.000012097409,0.0013463555,0.014767396,0.0021967099,0.84699094,0.0055217417,0.12849964],"study_design_scores_gemma":[0.00071489904,0.0010995603,0.000106328116,0.000020440293,0.000015166466,0.000006897799,0.00007481786,0.9639472,0.004289582,0.0027438477,0.026724026,0.00025728333],"about_ca_topic_score_codex":0.000045076573,"about_ca_topic_score_gemma":0.00000836168,"teacher_disagreement_score":0.94917977,"about_ca_system_score_codex":0.00009467161,"about_ca_system_score_gemma":0.000085399675,"threshold_uncertainty_score":0.56289744},"labels":[],"label_agreement":null},{"id":"W2018043895","doi":"10.5555/2133036.2133045","title":"Online scalable scheduling for the lk-norms of flow time without conservation of work","year":2011,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Cloud computing; Competitive analysis; Distributed computing; Flow shop scheduling; Job shop scheduling; Parallel computing; Mathematical optimization; Computer network; Mathematics; Upper and lower bounds; Operating system","score_opus":0.034947947273841026,"score_gpt":0.26552950854941215,"score_spread":0.2305815612755711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018043895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00421367,0.00009525689,0.990728,0.0023512084,0.00024830885,0.0007710353,0.00004559651,0.00008194035,0.001464945],"genre_scores_gemma":[0.08373391,0.000108108674,0.91389894,0.00036675917,0.000086194064,0.00007070971,0.000048804184,0.00003129458,0.0016552964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864835,0.00006348957,0.00040510722,0.0002883061,0.0003343641,0.00026039805],"domain_scores_gemma":[0.99860823,0.0001963735,0.00022919205,0.0005744899,0.00031728038,0.000074458825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572324,0.00014654487,0.00023846597,0.000097691474,0.00011954859,0.000041681174,0.00074200303,0.000072013165,0.000041247036],"category_scores_gemma":[0.000059131296,0.000097884105,0.00010845997,0.0004937997,0.00013496634,0.00030599337,0.00013305232,0.000114619535,0.000014305279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018105889,0.00527926,0.012908291,0.0012287082,0.0015792714,0.000010824659,0.026675645,0.62954056,0.043591514,0.124354154,0.005234735,0.14778642],"study_design_scores_gemma":[0.0006037694,0.0003459567,0.0006338934,0.00010468417,0.000016517866,0.0000011187165,0.000045175773,0.9886449,0.008396907,0.00075260893,0.00031873395,0.00013573973],"about_ca_topic_score_codex":0.000065581225,"about_ca_topic_score_gemma":0.000003217165,"teacher_disagreement_score":0.3591043,"about_ca_system_score_codex":0.00001864508,"about_ca_system_score_gemma":0.00008959039,"threshold_uncertainty_score":0.39915982},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010634371952471982,"score_gpt":0.2439889803909162,"score_spread":0.23335460843844422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029415290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23862462,0.00092833105,0.5581671,0.10957881,0.008872228,0.0024877358,0.00007654342,0.0018812093,0.0793834],"genre_scores_gemma":[0.9908939,0.000028191735,0.0074728797,0.0010317868,0.0003294108,0.00001068259,0.0000053687563,0.000024230132,0.00020357495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732715,0.00024397045,0.00046926455,0.0006621137,0.0007213238,0.00057615124],"domain_scores_gemma":[0.99712056,0.0012452162,0.00026929748,0.0011470541,0.00008251102,0.00013533545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140412,0.00037233642,0.0004093251,0.00016207935,0.00036988457,0.00017662959,0.0015584332,0.00010498117,0.000024962697],"category_scores_gemma":[0.00013572653,0.0002323147,0.00028830656,0.000534148,0.00011611059,0.00014213365,0.0001861393,0.0004789664,0.000058237736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007206067,0.00039868455,0.000009446965,0.000027266422,0.00017803922,0.000075782045,0.002784885,0.03348484,0.0038327384,0.8006373,0.004290729,0.15355967],"study_design_scores_gemma":[0.0024148398,0.0020982346,0.00021983606,0.0001611406,0.000019831283,0.000012763446,0.0000442319,0.96365327,0.0065661776,0.023455488,0.0009452408,0.0004089509],"about_ca_topic_score_codex":0.000019411837,"about_ca_topic_score_gemma":4.3531372e-7,"teacher_disagreement_score":0.93016845,"about_ca_system_score_codex":0.000038101294,"about_ca_system_score_gemma":0.000063341045,"threshold_uncertainty_score":0.9473519},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007456395841719261,"score_gpt":0.2256655254684238,"score_spread":0.21820912962670455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034389879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018325777,0.00014995174,0.9777534,0.0015728392,0.000513373,0.00035775994,0.00006449077,0.00049050985,0.017265106],"genre_scores_gemma":[0.8635343,0.00007940918,0.12864348,0.00076391833,0.0010560104,0.00022373023,0.0008955357,0.00008734554,0.004716273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975722,0.00007487318,0.0003367503,0.0008207485,0.00067886413,0.0005165826],"domain_scores_gemma":[0.9982786,0.0001028009,0.00017171702,0.001140595,0.00015163187,0.00015463996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019949411,0.00032054223,0.00025708345,0.00030450572,0.00040783052,0.00036984822,0.00083701755,0.000103035156,0.000023426092],"category_scores_gemma":[0.000010961977,0.00024214508,0.00008829184,0.0012856,0.00007017443,0.0009218325,0.00022738219,0.00022102009,0.00021930085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039848703,0.0029109565,0.006383965,0.00016192628,0.00039875295,0.00034130475,0.0005523019,0.06426985,0.023769716,0.18741316,0.2557336,0.45766598],"study_design_scores_gemma":[0.0037180732,0.002015228,0.028324818,0.00014623714,0.00007555727,0.00010919437,0.00007188054,0.78265893,0.012140311,0.0058780448,0.16304965,0.001812047],"about_ca_topic_score_codex":0.00039328507,"about_ca_topic_score_gemma":0.00002934847,"teacher_disagreement_score":0.8617017,"about_ca_system_score_codex":0.00009959088,"about_ca_system_score_gemma":0.00008509133,"threshold_uncertainty_score":0.987439},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.047448525013619354,"score_gpt":0.2870264706846065,"score_spread":0.23957794567098717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037688351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009900375,0.0007723764,0.9756552,0.002364377,0.003455321,0.001413042,0.00033575317,0.0010025235,0.0051010335],"genre_scores_gemma":[0.06366877,0.000335076,0.9302285,0.0018646221,0.0012941635,0.0003420258,0.000086230866,0.0001976692,0.0019829574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954542,0.00014531745,0.00072499184,0.0015004943,0.00087113946,0.0013038558],"domain_scores_gemma":[0.9972621,0.0003148271,0.00028132516,0.0014893037,0.00018481175,0.00046763493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048984296,0.0007115955,0.00064343214,0.00057218096,0.00087205775,0.00052726734,0.002073695,0.00026393135,0.00007877539],"category_scores_gemma":[0.000034978537,0.00067993975,0.0006069195,0.0012259638,0.00027063655,0.0009456938,0.0002782557,0.00044237668,0.00013110245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033761025,0.003471734,0.0007006378,0.0005061171,0.0019434853,0.0008148337,0.0103066955,0.03862551,0.014567289,0.6589079,0.05640357,0.21341465],"study_design_scores_gemma":[0.0014387311,0.00087665627,0.00006558306,0.00007732488,0.000054858134,0.000111870955,0.00008044809,0.9636265,0.0035746167,0.009473456,0.01950518,0.0011147837],"about_ca_topic_score_codex":0.000055425993,"about_ca_topic_score_gemma":0.000004093473,"teacher_disagreement_score":0.92500097,"about_ca_system_score_codex":0.0001391653,"about_ca_system_score_gemma":0.000054944805,"threshold_uncertainty_score":0.9995652},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008969900852929844,"score_gpt":0.2570800764681503,"score_spread":0.24811017561522045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044014345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038772842,0.00014589773,0.98771256,0.0024087862,0.0008979346,0.0009985911,0.00034347855,0.00039871235,0.0032167328],"genre_scores_gemma":[0.6749784,0.00010771321,0.30808017,0.004397094,0.0029941278,0.00124882,0.0012018259,0.00019672212,0.0067951344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707156,0.00009971038,0.00048883737,0.00097394275,0.0005790313,0.0007869253],"domain_scores_gemma":[0.9983193,0.00021991318,0.00010755945,0.0010832063,0.0001405232,0.00012944403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046214878,0.00039861473,0.00034658643,0.00022761778,0.0007731514,0.0005946356,0.0010889269,0.00015681627,0.000029034563],"category_scores_gemma":[0.000038105183,0.00032888193,0.00020523129,0.00046055403,0.00004312114,0.00090851606,0.00028624645,0.0002693249,0.00012815285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033870095,0.0023176344,0.00031934475,0.00013348827,0.00023741629,0.00010540975,0.001138558,0.036257055,0.03504686,0.713357,0.08281572,0.12793285],"study_design_scores_gemma":[0.0030385486,0.001304524,0.0008025909,0.0001681269,0.000028687946,0.000017569735,0.000029501234,0.9078004,0.01573731,0.0037312629,0.066402555,0.00093895826],"about_ca_topic_score_codex":0.00010575692,"about_ca_topic_score_gemma":0.000022184266,"teacher_disagreement_score":0.8715433,"about_ca_system_score_codex":0.00010789818,"about_ca_system_score_gemma":0.000104687315,"threshold_uncertainty_score":0.9999163},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011770735213949658,"score_gpt":0.27371233373679094,"score_spread":0.26194159852284127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051690202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010882498,0.00013159547,0.99266446,0.002429705,0.0011536937,0.0010648124,0.00003810847,0.0003008523,0.0011285328],"genre_scores_gemma":[0.07526518,0.000047481164,0.922106,0.0008488852,0.00077193195,0.00038432088,0.00022510585,0.000038441212,0.00031260602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975237,0.00018267162,0.00046434876,0.0008142947,0.000521707,0.00049324636],"domain_scores_gemma":[0.9984729,0.00026325454,0.00016138556,0.0006256927,0.00021171708,0.0002650411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001016713,0.00032890553,0.00046279788,0.00025696013,0.00032242507,0.00037842034,0.00073395815,0.000120394274,0.000011234356],"category_scores_gemma":[0.000047148886,0.0002864459,0.00030583362,0.00045537733,0.00009251535,0.0008593638,0.00009456021,0.00015095586,0.00005675669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002537957,0.00055350247,0.0000016494516,0.00002593074,0.00018745185,0.00003609341,0.0011699528,0.33874014,0.0026523282,0.11334435,0.00037077395,0.5403799],"study_design_scores_gemma":[0.04569648,0.0006866664,0.000023673396,0.000023767712,0.000034620978,0.000033308912,0.000024447923,0.90600157,0.0151834395,0.030377967,0.0014397361,0.000474337],"about_ca_topic_score_codex":0.000026169384,"about_ca_topic_score_gemma":0.0000033758754,"teacher_disagreement_score":0.5672614,"about_ca_system_score_codex":0.000110698296,"about_ca_system_score_gemma":0.00018681322,"threshold_uncertainty_score":0.99995875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0078637736390246,"score_gpt":0.23013710140963195,"score_spread":0.22227332777060735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051837689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00395247,0.00033247468,0.8798588,0.0047498033,0.0018730116,0.00039178855,0.00003636894,0.0007119723,0.10809331],"genre_scores_gemma":[0.9721354,0.000022176862,0.008951871,0.0005088505,0.0008665645,0.000085306034,0.000060281112,0.000034275858,0.01733524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981264,0.000056479086,0.00031341688,0.00058012584,0.00043345,0.00049016526],"domain_scores_gemma":[0.9990564,0.000029501798,0.000104901905,0.00062851876,0.00008682541,0.00009383627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020379697,0.0002239309,0.00021541498,0.00009775625,0.00021686142,0.0003171628,0.00058874156,0.000106392494,0.000019980962],"category_scores_gemma":[0.000004912332,0.000193502,0.00011159822,0.000551774,0.00004462575,0.00052199943,0.000072627125,0.00017183593,0.00032700467],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008479463,0.0011995727,0.0018679125,0.00014354369,0.0001668886,0.00024582373,0.00064380065,0.018041845,0.076294124,0.51485753,0.31097773,0.075476445],"study_design_scores_gemma":[0.0023131685,0.0007976054,0.006242939,0.00019781191,0.00002731813,0.00015204858,0.000066181805,0.47671226,0.059403,0.00857582,0.44381213,0.0016997398],"about_ca_topic_score_codex":0.00034758318,"about_ca_topic_score_gemma":0.000014488581,"teacher_disagreement_score":0.968183,"about_ca_system_score_codex":0.00008746553,"about_ca_system_score_gemma":0.000040513118,"threshold_uncertainty_score":0.78907824},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008185812719306998,"score_gpt":0.24372485196968968,"score_spread":0.2355390392503827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059884147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002046172,0.000045471003,0.9809983,0.0072250864,0.00020126981,0.0010137169,0.000053777676,0.00037016324,0.008046043],"genre_scores_gemma":[0.7895667,0.000051029103,0.20513423,0.0020385766,0.00097511377,0.00069703633,0.0001448251,0.000092248934,0.0013002595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971415,0.00008672904,0.000325071,0.0010659018,0.0008143178,0.00056650897],"domain_scores_gemma":[0.99773645,0.00011598562,0.00015996532,0.0014894609,0.00014176601,0.00035634433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026437512,0.00040335112,0.00027825273,0.00029069642,0.00042786254,0.0003647598,0.0011982626,0.000109022985,0.00002460739],"category_scores_gemma":[0.00001165368,0.00029258378,0.00007782297,0.0009775363,0.000077864854,0.00036288952,0.00030548024,0.0002681078,0.0005947323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017635411,0.0009787668,0.000084058236,0.000027781625,0.00006673613,0.000019058978,0.002644607,0.3102696,0.0056849867,0.53906864,0.003037462,0.13794196],"study_design_scores_gemma":[0.0020315323,0.0025139994,0.0010515624,0.00027766536,0.000045535522,0.00004839049,0.00022410332,0.8057501,0.04184639,0.0019104792,0.14251558,0.0017847026],"about_ca_topic_score_codex":0.000040374918,"about_ca_topic_score_gemma":0.00000990576,"teacher_disagreement_score":0.7875205,"about_ca_system_score_codex":0.00016644462,"about_ca_system_score_gemma":0.00009523293,"threshold_uncertainty_score":0.9999526},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011674444197509347,"score_gpt":0.26678274107081956,"score_spread":0.2551082968733102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065457428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06855462,0.0012547014,0.86181426,0.0150082745,0.0038662152,0.0009914747,0.00008471026,0.0021143667,0.046311386],"genre_scores_gemma":[0.8754609,0.0013611554,0.109339654,0.0016475125,0.00094353023,0.00013195221,0.00023578915,0.00014372455,0.010735741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676126,0.00014346103,0.00046947668,0.001154334,0.00071610755,0.0007553714],"domain_scores_gemma":[0.9974396,0.000148686,0.00019479395,0.0018566883,0.000087062945,0.0002731265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038530084,0.00039704752,0.00034811793,0.0002646864,0.0004566326,0.00041744005,0.0017786616,0.00013945643,0.00006448552],"category_scores_gemma":[0.00003178145,0.00032875218,0.0001930721,0.00073689566,0.00008209708,0.0012459519,0.000985734,0.00033542453,0.00030399827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004411826,0.002202276,0.008662325,0.00014225571,0.000502488,0.0054615084,0.0032406251,0.013145514,0.10603048,0.041882567,0.04050666,0.77778214],"study_design_scores_gemma":[0.0010134092,0.0005040609,0.008782722,0.00014875589,0.000020210613,0.00018518436,0.000081886785,0.94297695,0.002026732,0.0020337217,0.04139578,0.00083057006],"about_ca_topic_score_codex":0.00014141871,"about_ca_topic_score_gemma":0.000013489338,"teacher_disagreement_score":0.92983145,"about_ca_system_score_codex":0.00008991072,"about_ca_system_score_gemma":0.0000590415,"threshold_uncertainty_score":0.99991643},"labels":[],"label_agreement":null},{"id":"W2067326981","doi":"10.5555/545381.545481","title":"Incremental) priority algorithms","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Computer science; Simplicity; Greedy randomized adaptive search procedure; Mathematical optimization; Algorithm; Scheduling (production processes); Limit (mathematics); Approximation algorithm; Theoretical computer science; Mathematics","score_opus":0.024356093509823745,"score_gpt":0.26322250264118136,"score_spread":0.23886640913135762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067326981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014819298,0.00052330684,0.82118505,0.020703092,0.0022508737,0.0014931689,0.00005944268,0.001663774,0.15063936],"genre_scores_gemma":[0.40719742,0.0027303165,0.552513,0.008768098,0.0013655345,0.00039854785,0.00009320662,0.00021453132,0.026719335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968771,0.00018779768,0.0004352275,0.0008535386,0.0009198871,0.0007264537],"domain_scores_gemma":[0.99820256,0.00008300958,0.00012891999,0.0010766886,0.00012800844,0.0003808221],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044634705,0.0003428609,0.00029090833,0.0002336546,0.00037243843,0.00045240187,0.0013781467,0.000132617,0.00042916168],"category_scores_gemma":[0.000029816705,0.0003071682,0.00015880154,0.0007427223,0.00011361401,0.00090059993,0.00043833716,0.00036536134,0.0011737631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006150902,0.0031620208,0.0011173299,0.00020443866,0.00051585835,0.0005529934,0.011241486,0.010549039,0.013515585,0.21592182,0.06389142,0.6792665],"study_design_scores_gemma":[0.001357668,0.0006127447,0.0003741068,0.00004569947,0.000010964082,0.000035634574,0.000050405888,0.95536613,0.0034779455,0.0012130417,0.03674391,0.0007117513],"about_ca_topic_score_codex":0.000047731675,"about_ca_topic_score_gemma":0.000003503183,"teacher_disagreement_score":0.94481707,"about_ca_system_score_codex":0.00014314493,"about_ca_system_score_gemma":0.000034302902,"threshold_uncertainty_score":0.9999381},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04200296111938706,"score_gpt":0.28511185113436605,"score_spread":0.24310889001497898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068462176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60369617,0.000369426,0.38702345,0.0029247806,0.000505661,0.000795806,0.0005429103,0.00030180308,0.003839985],"genre_scores_gemma":[0.9122392,0.00021536011,0.08697618,0.0003576365,0.00007830928,0.000018190087,0.000029003282,0.00002065255,0.00006549988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722314,0.00015056645,0.00039980345,0.0011334021,0.00062373927,0.00046935322],"domain_scores_gemma":[0.9968167,0.0004144533,0.00015979148,0.0022309667,0.000087185625,0.00029093688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004771017,0.00032320787,0.00039492978,0.00020397741,0.0003242603,0.0001234356,0.0022216216,0.0000801674,0.0000058477617],"category_scores_gemma":[0.000101990685,0.00029732505,0.00006819605,0.0006987348,0.00032946147,0.00076273066,0.0010815123,0.00026328478,0.000016942518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001164134,0.0024458,0.011551185,0.0003786283,0.00040646532,0.0012837792,0.008608955,0.004053067,0.016728347,0.7282097,0.0025274733,0.22264251],"study_design_scores_gemma":[0.003960877,0.0059372145,0.080737464,0.0016769881,0.00009029858,0.0009245416,0.00022519546,0.82107323,0.03507849,0.04031711,0.006183539,0.0037950503],"about_ca_topic_score_codex":0.0005171836,"about_ca_topic_score_gemma":0.000046662855,"teacher_disagreement_score":0.8170202,"about_ca_system_score_codex":0.00005959318,"about_ca_system_score_gemma":0.00009950606,"threshold_uncertainty_score":0.9999479},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01043334910638345,"score_gpt":0.2273625299195004,"score_spread":0.21692918081311696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071492694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21633993,0.0003054182,0.42505634,0.00280957,0.004466583,0.0011052993,0.00013478425,0.002837449,0.34694463],"genre_scores_gemma":[0.9947155,0.00021513434,0.0024599927,0.0004769357,0.00047245415,0.00002195224,0.00016966465,0.00012506671,0.0013432598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987794,0.000032131753,0.00025430118,0.00026614248,0.0002995987,0.00036840685],"domain_scores_gemma":[0.9993949,0.000082015096,0.000034013327,0.00033485465,0.000026723956,0.00012751605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010475172,0.00024363174,0.00018909031,0.00014699869,0.0001109007,0.00008347069,0.00015289971,0.00009937824,0.00008755903],"category_scores_gemma":[0.000014539311,0.0002272695,0.000078384226,0.0002741463,0.000024012857,0.00008629912,0.000010560353,0.00019848891,0.0002478605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024483397,0.000036108126,0.00014685924,0.000024458266,0.000044028853,0.00005949729,0.00014549209,0.9819348,0.0045794197,0.006121363,0.0030138819,0.003869603],"study_design_scores_gemma":[0.0006652154,0.0002801348,0.00025300076,0.00013385265,0.000026887308,0.000014266992,0.00006177869,0.9773085,0.009918115,0.00083272473,0.009944455,0.0005610584],"about_ca_topic_score_codex":0.000015940337,"about_ca_topic_score_gemma":0.000004828085,"teacher_disagreement_score":0.7783756,"about_ca_system_score_codex":0.00008722754,"about_ca_system_score_gemma":0.000008171598,"threshold_uncertainty_score":0.9267781},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Graph; Theoretical computer science","score_opus":0.01185173105347955,"score_gpt":0.27164410304080705,"score_spread":0.2597923719873275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077203993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153615065,0.0011506528,0.9040505,0.0064302213,0.0017101513,0.0015636755,0.000121290024,0.0018443076,0.06776766],"genre_scores_gemma":[0.59008205,0.0035613277,0.3445601,0.004031515,0.0028119409,0.0010470686,0.00020989239,0.0005716953,0.053124428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497914,0.00032450253,0.00055985065,0.0014676694,0.0012938012,0.0013750101],"domain_scores_gemma":[0.99700093,0.00022943599,0.00012099515,0.0019327032,0.00014703585,0.00056889857],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067890453,0.0005991103,0.00050386414,0.00047155665,0.00058452674,0.0004368707,0.0027009947,0.0002058485,0.00046939912],"category_scores_gemma":[0.00002223519,0.0005257035,0.00036137726,0.001537717,0.0004209768,0.001235818,0.00034311073,0.0006646394,0.001380009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028224176,0.000601031,0.00017089183,0.000050766288,0.0002630247,0.00042711242,0.001284429,0.0033198714,0.015659744,0.060427018,0.0020917545,0.91542214],"study_design_scores_gemma":[0.0067933653,0.005536453,0.0033988701,0.00038900212,0.00010145643,0.00066595693,0.00021194835,0.400705,0.09491116,0.3552905,0.12632133,0.005674962],"about_ca_topic_score_codex":0.000069569716,"about_ca_topic_score_gemma":0.000007917479,"teacher_disagreement_score":0.9097472,"about_ca_system_score_codex":0.000109042354,"about_ca_system_score_gemma":0.00009073924,"threshold_uncertainty_score":0.99971944},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011868978540492582,"score_gpt":0.2646139178492995,"score_spread":0.2527449393088069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078615143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020233653,0.00045968455,0.9701172,0.006273831,0.00089856755,0.000627517,0.00063777633,0.0001711802,0.0005805661],"genre_scores_gemma":[0.81321245,0.0000456563,0.18268225,0.00059771683,0.00043428873,0.000041421932,0.0017319907,0.000028911003,0.0012253219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985582,0.000040125495,0.00023138677,0.0006566965,0.00025365653,0.00025993236],"domain_scores_gemma":[0.9989111,0.00014916493,0.000094089344,0.00068254705,0.00008677769,0.00007631455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014759427,0.00019458911,0.00018066716,0.000106185944,0.00024070227,0.00035853448,0.0005726254,0.000075412674,0.000009709413],"category_scores_gemma":[0.000021816517,0.00017263158,0.000037405604,0.0002469816,0.00007002068,0.00063681067,0.00028382064,0.00009120651,0.0000073515253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023702932,0.00033035467,0.0006549897,0.00032721355,0.00023930556,0.00005542524,0.0010059478,0.041715957,0.06912417,0.68695855,0.01860535,0.18074569],"study_design_scores_gemma":[0.00071788975,0.0002437488,0.003482986,0.000019880621,0.000018037344,0.000026242515,0.000016926686,0.9579796,0.0020708852,0.018882912,0.016214203,0.0003266611],"about_ca_topic_score_codex":0.00004948521,"about_ca_topic_score_gemma":0.00006130925,"teacher_disagreement_score":0.9162637,"about_ca_system_score_codex":0.000027450245,"about_ca_system_score_gemma":0.00007565704,"threshold_uncertainty_score":0.7039712},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.009245848424656271,"score_gpt":0.2503925321792809,"score_spread":0.24114668375462464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081622490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012593121,0.00015707988,0.9259532,0.009957537,0.00073751673,0.0013786134,0.00013601455,0.0027785187,0.04630839],"genre_scores_gemma":[0.03168552,0.00056376617,0.9322719,0.009608596,0.0010062497,0.00078151544,0.00008695993,0.00015589141,0.023839623],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99650794,0.00019474402,0.00052895414,0.0011814984,0.0007295637,0.0008573205],"domain_scores_gemma":[0.9979436,0.00007623962,0.00009927425,0.0011964219,0.00016587836,0.0005186047],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040795104,0.0004961346,0.00043801745,0.00035269107,0.00031221783,0.00059420255,0.0016075744,0.00017411883,0.0005993999],"category_scores_gemma":[0.000014940479,0.0004494015,0.00019095601,0.001127856,0.00007729486,0.0007365729,0.0002412259,0.00031113075,0.003074656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017419794,0.00012619174,0.000007058545,0.000007947593,0.000041884938,0.0000755253,0.00051296025,0.00015867798,0.004418968,0.0011213354,0.00583948,0.98767257],"study_design_scores_gemma":[0.002945738,0.003940029,0.0004680603,0.0003929658,0.00007128357,0.00026865603,0.00010939726,0.335895,0.46228772,0.008417352,0.18149629,0.0037075062],"about_ca_topic_score_codex":0.00008325704,"about_ca_topic_score_gemma":0.000005996405,"teacher_disagreement_score":0.98396504,"about_ca_system_score_codex":0.000121384706,"about_ca_system_score_gemma":0.0000882612,"threshold_uncertainty_score":0.9997958},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01162427078857109,"score_gpt":0.25175601308317175,"score_spread":0.24013174229460066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081869611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25249475,0.00053675316,0.688049,0.02278543,0.0025348663,0.0008416076,0.000065049724,0.0018106631,0.030881856],"genre_scores_gemma":[0.9514112,0.000059562422,0.040843744,0.0030329314,0.00084615464,0.000051817355,0.000030555428,0.000034533336,0.0036895333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997909,0.000100007645,0.00028991545,0.0007453719,0.00048978836,0.0004658806],"domain_scores_gemma":[0.99834716,0.00003996153,0.000083968065,0.0012386054,0.000057119854,0.00023321103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032257586,0.00025464993,0.00019661027,0.00012379778,0.00019817935,0.0003478378,0.0010389532,0.000076516444,0.00007311129],"category_scores_gemma":[0.000006158427,0.00022171409,0.00013614216,0.00017002413,0.000040529158,0.00078799477,0.00018719911,0.0002192614,0.0003556858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009791845,0.0033628044,0.0009802654,0.00006871014,0.00061611953,0.00044730192,0.009192023,0.11018101,0.12151225,0.052549,0.05121813,0.6488932],"study_design_scores_gemma":[0.0011126507,0.0013191317,0.00025520416,0.000042196836,0.000021494068,0.000050468647,0.0000657363,0.9515504,0.013880329,0.00008627826,0.030986944,0.00062912755],"about_ca_topic_score_codex":0.00004045701,"about_ca_topic_score_gemma":0.000004396045,"teacher_disagreement_score":0.84136945,"about_ca_system_score_codex":0.00008691705,"about_ca_system_score_gemma":0.000040538078,"threshold_uncertainty_score":0.90412384},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line graph","score_opus":0.010987273196709698,"score_gpt":0.24195675283213933,"score_spread":0.23096947963542963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118345845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06124002,0.0003701847,0.8891243,0.0044370038,0.005521492,0.0006118834,0.000021947188,0.00048856554,0.0381846],"genre_scores_gemma":[0.99442315,0.000035749188,0.0046952125,0.0002409256,0.00015840675,0.000023792958,0.0000034201726,0.000015183073,0.00040414778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984662,0.000060092312,0.00038366552,0.00040672687,0.000360926,0.00032238112],"domain_scores_gemma":[0.998935,0.000038339767,0.00015374529,0.00065992045,0.000096596654,0.000116390445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026237077,0.00017956855,0.00024769263,0.00016948409,0.0001014356,0.000091643495,0.00063798117,0.00008420121,0.00001162452],"category_scores_gemma":[0.000008125356,0.00014712653,0.00017891268,0.00048830826,0.00005798268,0.000318011,0.00010580884,0.00013195907,0.000087851375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035508874,0.0002556606,0.0003285287,0.00005669099,0.00013368843,0.00005529217,0.001434176,0.034130752,0.018225987,0.9359263,0.0016343106,0.0077830865],"study_design_scores_gemma":[0.011965513,0.00923718,0.011779156,0.0022838262,0.00012484805,0.0005357188,0.0006476586,0.37350604,0.3268313,0.19421592,0.064309314,0.0045635286],"about_ca_topic_score_codex":0.00012952136,"about_ca_topic_score_gemma":0.000016830823,"teacher_disagreement_score":0.93318313,"about_ca_system_score_codex":0.000047394864,"about_ca_system_score_gemma":0.000043521588,"threshold_uncertainty_score":0.59996456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007873912044065968,"score_gpt":0.22653860830052655,"score_spread":0.2186646962564606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118893502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033010878,0.00017692095,0.9472009,0.0052603437,0.0010795526,0.00022436686,0.000022065262,0.00035653348,0.012668434],"genre_scores_gemma":[0.9271852,0.00001966173,0.068678096,0.0010203967,0.0010117838,0.0000377575,0.00017575211,0.000026259078,0.0018451147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.0000620996,0.00029948895,0.000548703,0.0005581369,0.0003506806],"domain_scores_gemma":[0.9992398,0.000092713555,0.00010637019,0.00037645694,0.000082077015,0.00010258718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025758616,0.00021546423,0.00016498957,0.00026897664,0.00029715596,0.00028137834,0.0004664357,0.00007207669,0.000016100328],"category_scores_gemma":[0.0000086051305,0.0002009615,0.00012837141,0.0006386934,0.000041213185,0.0005463452,0.00008319847,0.00015925146,0.00010571344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032542,0.00024449496,0.00064422697,0.000026142445,0.000063504915,0.00013986744,0.00035200245,0.082168035,0.028593048,0.85703415,0.012039942,0.018662067],"study_design_scores_gemma":[0.0024572352,0.000877694,0.025834003,0.00012887195,0.00005050722,0.00024236829,0.000043035263,0.6394483,0.034435563,0.2542249,0.040237296,0.0020202145],"about_ca_topic_score_codex":0.00006555924,"about_ca_topic_score_gemma":0.000008189165,"teacher_disagreement_score":0.8941743,"about_ca_system_score_codex":0.00004391307,"about_ca_system_score_gemma":0.00006142048,"threshold_uncertainty_score":0.8194972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007603731631552604,"score_gpt":0.2650003601434302,"score_spread":0.2573966285118776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143618826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13112155,0.000037159327,0.8653305,0.00084565784,0.000066710476,0.00058144354,0.0000024606643,0.0001504357,0.00186407],"genre_scores_gemma":[0.9536109,0.000015385922,0.04586405,0.00025610326,0.00006257593,0.00012965972,0.000004000245,0.000026315425,0.000031040745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975296,0.00023099815,0.00024271835,0.0008669228,0.00059192174,0.00053782924],"domain_scores_gemma":[0.9984386,0.00021952568,0.00008824507,0.0008606564,0.000106365864,0.0002866227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001143617,0.00024564387,0.0002908183,0.00031457987,0.0001684475,0.00018408439,0.0006941229,0.00006543302,9.1507815e-7],"category_scores_gemma":[0.000056290566,0.00020164001,0.00003580284,0.0009928058,0.000095040225,0.00061228895,0.0002045782,0.000270024,0.000011674713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018073141,0.0004114451,0.04787087,0.00013502578,0.00008183288,0.0000819582,0.0074325125,0.025313307,0.056026205,0.4530275,0.00003928982,0.40777275],"study_design_scores_gemma":[0.007119462,0.0033829364,0.045168724,0.0003377132,0.000019413375,0.00004500444,0.00024035157,0.8299905,0.016343074,0.09478946,0.0010842612,0.0014790915],"about_ca_topic_score_codex":0.00014541477,"about_ca_topic_score_gemma":0.00021423613,"teacher_disagreement_score":0.8224893,"about_ca_system_score_codex":0.000095706564,"about_ca_system_score_gemma":0.000052962925,"threshold_uncertainty_score":0.8222641},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032800880178982764,"score_gpt":0.2760675828761797,"score_spread":0.24326670269719697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151534739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022742414,0.00030580844,0.9896402,0.0018115855,0.0026209413,0.0017127601,0.00007328043,0.0008062034,0.0028017957],"genre_scores_gemma":[0.006060415,0.000090230984,0.9886528,0.0013018961,0.0017874675,0.00030774518,0.0002023399,0.000110173496,0.0014869006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99445194,0.00020686949,0.0010018118,0.0015441469,0.0010593245,0.0017359009],"domain_scores_gemma":[0.9961106,0.0010659489,0.00043340665,0.0015830799,0.00031893412,0.00048803113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026590843,0.0007302454,0.0006540345,0.00041046448,0.0011443315,0.0004155391,0.0019994401,0.00035135806,0.000040489267],"category_scores_gemma":[0.00005746933,0.0006847922,0.00046159042,0.0014460296,0.00028816005,0.0007848977,0.0005665361,0.00043331544,0.00014744094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001219232,0.0014803972,0.0001828604,0.00032720086,0.0008269263,0.0002855684,0.0034952743,0.039997324,0.0065975473,0.4344666,0.045767117,0.46535394],"study_design_scores_gemma":[0.0020616371,0.0009787054,0.00020554177,0.0001165651,0.000056027064,0.00007213781,0.000036286685,0.90385675,0.016376654,0.04768504,0.027326567,0.0012280712],"about_ca_topic_score_codex":0.000027658456,"about_ca_topic_score_gemma":0.00001001879,"teacher_disagreement_score":0.8638594,"about_ca_system_score_codex":0.000335698,"about_ca_system_score_gemma":0.00011240808,"threshold_uncertainty_score":0.9995603},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015776286400295332,"score_gpt":0.2901337696210354,"score_spread":0.27435748322074005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153068117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013307013,0.00021566502,0.9690411,0.021439897,0.0006116871,0.0014611529,0.000034586414,0.00036338647,0.005501797],"genre_scores_gemma":[0.7363243,0.0007491141,0.25420004,0.0014521551,0.00058141863,0.0029074636,0.00006851648,0.00014424171,0.003572754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979717,0.00008568925,0.0002624267,0.0005487416,0.00047302837,0.0006584134],"domain_scores_gemma":[0.9984477,0.00027910518,0.000095448675,0.00087497843,0.00014428957,0.00015844418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066661346,0.00020284171,0.00014670985,0.00010600607,0.0008154583,0.0003561933,0.0012404952,0.0000645394,0.0000023599416],"category_scores_gemma":[0.00004131074,0.00013728162,0.00017237966,0.00054058834,0.00023047785,0.00048889336,0.0001783762,0.00020346197,0.00004942552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043987046,0.000050841365,0.000009340132,0.00001239486,0.000022901213,0.000005325031,0.00021465769,0.0013339702,0.0022529883,0.983965,0.00029207242,0.011796545],"study_design_scores_gemma":[0.0009397931,0.0006960255,0.0000526656,0.000040449224,0.0000061782957,0.000010862535,0.00004305682,0.0063895383,0.01743832,0.96023005,0.0138853695,0.00026766383],"about_ca_topic_score_codex":0.000015171542,"about_ca_topic_score_gemma":0.000018245955,"teacher_disagreement_score":0.7349936,"about_ca_system_score_codex":0.00009031494,"about_ca_system_score_gemma":0.00007807605,"threshold_uncertainty_score":0.62719285},"labels":[],"label_agreement":null},{"id":"W2154903757","doi":"10.5555/2095116.2095161","title":"Gathering despite mischief","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Byzantine architecture; Computer science; Node (physics); Upper and lower bounds; Matching (statistics); Byzantine fault tolerance; Theoretical computer science; Combinatorics; Mathematics; Distributed computing; Fault tolerance; Physics","score_opus":0.018282125697853154,"score_gpt":0.2676465739180216,"score_spread":0.24936444822016846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154903757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028977923,0.00028824116,0.9321342,0.003466149,0.0011596692,0.00037353378,0.0000064151855,0.0005371552,0.05913684],"genre_scores_gemma":[0.6709684,0.0002987124,0.31763715,0.0026621204,0.0008876772,0.00012287794,0.000021224785,0.0000865507,0.007315294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831563,0.00009842888,0.00021388767,0.0003323712,0.0004023577,0.00063730724],"domain_scores_gemma":[0.99888444,0.000055321747,0.00006488777,0.00060845824,0.000050191702,0.00033667823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042515472,0.00018945368,0.00015021418,0.0001224261,0.00018580131,0.00020918397,0.0006936507,0.00006827224,0.00006986094],"category_scores_gemma":[0.000017418834,0.0001601772,0.00009001925,0.000352597,0.00004213738,0.0008707475,0.00022658474,0.00018637792,0.00049705163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007972529,0.0016542412,0.005764138,0.00019486273,0.00034999516,0.00007382613,0.025303252,0.029247276,0.044131372,0.67020804,0.00926118,0.21373212],"study_design_scores_gemma":[0.002271391,0.00090355397,0.0051045637,0.0001728472,0.000026571808,0.0000860542,0.00021745755,0.80152804,0.02243518,0.0025813156,0.16273178,0.0019412567],"about_ca_topic_score_codex":0.000010553651,"about_ca_topic_score_gemma":7.4188625e-7,"teacher_disagreement_score":0.77228075,"about_ca_system_score_codex":0.000046601228,"about_ca_system_score_gemma":0.000029426254,"threshold_uncertainty_score":0.65318364},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013238446397571412,"score_gpt":0.30807813828255165,"score_spread":0.2948396918849802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165352378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008726283,0.00010404996,0.9871163,0.0011365213,0.00028747998,0.000813236,0.00029298765,0.0002727922,0.0012503634],"genre_scores_gemma":[0.19175889,0.00006701821,0.806882,0.00036486727,0.00023609637,0.00020961725,0.00008342561,0.00006887796,0.00032916252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694765,0.00019432312,0.0005353418,0.0008769845,0.0006815972,0.00076412247],"domain_scores_gemma":[0.9974373,0.00032032726,0.00020218684,0.0014340333,0.00025948498,0.0003466652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006241282,0.00035259684,0.0004108291,0.00046932718,0.00036460586,0.0001713141,0.0018461596,0.00013107495,0.000023692859],"category_scores_gemma":[0.000015438485,0.00033312535,0.0003142911,0.00074059,0.00020114655,0.0013043182,0.00021065981,0.00027429647,0.000047201953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017935834,0.001270175,0.000052479892,0.00007353262,0.00024189378,0.000022066246,0.0028891368,0.013109708,0.10165693,0.4586363,0.000632007,0.4212364],"study_design_scores_gemma":[0.0026043893,0.0026588398,0.00033328717,0.000105455365,0.000039112772,0.000046606776,0.00022952446,0.6590117,0.12596688,0.20514983,0.0028498818,0.0010044962],"about_ca_topic_score_codex":0.000023826355,"about_ca_topic_score_gemma":0.0000064668006,"teacher_disagreement_score":0.645902,"about_ca_system_score_codex":0.00008910955,"about_ca_system_score_gemma":0.000089295245,"threshold_uncertainty_score":0.9999121},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02486666529941805,"score_gpt":0.31756466989913934,"score_spread":0.2926980045997213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169088379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37292427,0.0002809304,0.19399688,0.026674874,0.0018827117,0.0014434559,0.0019430919,0.0010794675,0.3997743],"genre_scores_gemma":[0.9897242,0.0000067596525,0.001402101,0.00033289313,0.00046375924,0.00005993196,0.00010663261,0.000024763189,0.007878966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648136,0.00018376048,0.00067239115,0.0007446368,0.0014510663,0.0004667619],"domain_scores_gemma":[0.9975807,0.0006979263,0.00023250558,0.0010468618,0.00028003386,0.00016195828],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016222642,0.0002493523,0.00031484407,0.00012294739,0.0003598251,0.00036970017,0.000903874,0.00010925576,0.00039908223],"category_scores_gemma":[0.00025168905,0.00018703192,0.00019225603,0.0009797072,0.00015999281,0.00025289654,0.00013171042,0.00020817912,0.0021311706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030581138,0.0012239338,0.01320052,0.000023318764,0.00013133447,0.0001314335,0.0010402848,0.019613722,0.063990675,0.540624,0.31920803,0.040506925],"study_design_scores_gemma":[0.0016761158,0.00030893701,0.033650223,0.000057376343,0.000067879075,0.00005183988,0.00071098865,0.019853072,0.027322087,0.48023397,0.43486297,0.001204567],"about_ca_topic_score_codex":0.000114010596,"about_ca_topic_score_gemma":0.000039276376,"teacher_disagreement_score":0.6167999,"about_ca_system_score_codex":0.000118339376,"about_ca_system_score_gemma":0.000086666456,"threshold_uncertainty_score":0.9986458},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017631252465922377,"score_gpt":0.252691496209125,"score_spread":0.23506024374320264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177638926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023226275,0.00060089095,0.9730944,0.001374168,0.0024654767,0.0003757666,0.000010201751,0.0007070472,0.019049414],"genre_scores_gemma":[0.7546618,0.00007818204,0.2402007,0.0014239681,0.0022008668,0.00012263095,0.000043820055,0.000079890124,0.0011881436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969958,0.00016988901,0.0004954635,0.00061754964,0.0006006275,0.0011206787],"domain_scores_gemma":[0.9979985,0.00018700983,0.00019785925,0.0011519208,0.00007605001,0.00038866687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471137,0.0003993743,0.00036016194,0.00019874211,0.00040935416,0.00029955918,0.0013185877,0.00015630339,0.00004054367],"category_scores_gemma":[0.000032619322,0.00034707683,0.00022213793,0.00086151157,0.00011281676,0.0010815796,0.00055030966,0.00046973562,0.00014217087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056306886,0.0012133244,0.0030234489,0.00010852907,0.00036310882,0.000067355155,0.004121207,0.015052525,0.0022176434,0.62288266,0.0071274373,0.34376645],"study_design_scores_gemma":[0.00069643557,0.00025055822,0.0019599001,0.00008608544,0.000022989625,0.000057054818,0.00006817582,0.9797342,0.0016696462,0.0028683764,0.011728911,0.00085765467],"about_ca_topic_score_codex":0.000030855084,"about_ca_topic_score_gemma":0.000001751549,"teacher_disagreement_score":0.9646817,"about_ca_system_score_codex":0.00007073064,"about_ca_system_score_gemma":0.000028585142,"threshold_uncertainty_score":0.99989814},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03958629530490731,"score_gpt":0.30459664743458625,"score_spread":0.26501035212967894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243190840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13586791,0.00036758572,0.83462256,0.0074983677,0.0024779786,0.0016859474,0.00015251561,0.0012081738,0.016118953],"genre_scores_gemma":[0.8962444,0.000026700593,0.099186696,0.0005550157,0.0005464601,0.00015392296,0.00006706596,0.0000958337,0.0031239248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953057,0.0004616412,0.0005121356,0.001428387,0.0012460791,0.0010460591],"domain_scores_gemma":[0.99622947,0.00020721382,0.00017419115,0.0022990769,0.00029181904,0.00079823076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488615,0.00044903965,0.00043270033,0.00033305612,0.0002528131,0.00022462964,0.002261284,0.00018039349,0.000020600444],"category_scores_gemma":[0.00017222292,0.00039046668,0.00020236956,0.0009497541,0.00031495473,0.00087788986,0.00048423448,0.00054964103,0.00033289404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003519899,0.0031449113,0.010490556,0.0004247807,0.0010074475,0.0072255516,0.014553992,0.0089941835,0.07047115,0.1317451,0.032118708,0.7163037],"study_design_scores_gemma":[0.008904023,0.007856113,0.009465993,0.000335357,0.00012705747,0.0016160768,0.00075315643,0.4766793,0.09753144,0.36614314,0.025467776,0.005120583],"about_ca_topic_score_codex":0.00014595837,"about_ca_topic_score_gemma":0.000023857134,"teacher_disagreement_score":0.76037645,"about_ca_system_score_codex":0.00026254012,"about_ca_system_score_gemma":0.00024347029,"threshold_uncertainty_score":0.99985474},"labels":[],"label_agreement":null},{"id":"W2250014226","doi":"10.5555/2722129.2722164","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems: extended abstract","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Approximation algorithm; Linear programming; Latency (audio); Leverage (statistics); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Computer network; Artificial intelligence; Telecommunications","score_opus":0.05793689123546252,"score_gpt":0.31696333685336847,"score_spread":0.25902644561790594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250014226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045836032,0.00021645523,0.98820966,0.00048079956,0.0010133159,0.002570213,0.00013798359,0.0018470365,0.0009409321],"genre_scores_gemma":[0.07465415,0.000022178147,0.9227457,0.00010218589,0.0004672987,0.0009126606,0.00042954242,0.00028023907,0.00038602485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696416,0.00010547341,0.0008135645,0.0006894328,0.0005851077,0.0008422451],"domain_scores_gemma":[0.99819636,0.00015871829,0.00020804157,0.00062230864,0.00038700516,0.00042757866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012068065,0.00055774325,0.00048897177,0.0002679932,0.00017332968,0.00017348984,0.00040834962,0.00033607156,0.000016142727],"category_scores_gemma":[0.00018469013,0.00054401637,0.00022783809,0.0005216062,0.00009358278,0.00038957823,0.000043385768,0.00037123318,0.00006998212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000834486,0.00038605722,0.00010285729,0.00042031507,0.00011252922,0.000009042432,0.00094702124,0.944911,0.0047690975,0.000100513054,0.00047515339,0.04768297],"study_design_scores_gemma":[0.0033032778,0.00044264307,0.00015488247,0.000121978796,0.000058730835,0.000004587068,0.00014121058,0.9793668,0.012608415,0.000119957986,0.0029937555,0.0006838033],"about_ca_topic_score_codex":0.000022156453,"about_ca_topic_score_gemma":0.000004507473,"teacher_disagreement_score":0.07007055,"about_ca_system_score_codex":0.00025646295,"about_ca_system_score_gemma":0.00012353691,"threshold_uncertainty_score":0.99970114},"labels":[],"label_agreement":null},{"id":"W2293881964","doi":"10.5555/982792.982868","title":"Quantum computing","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.009554623655394454,"score_gpt":0.245890453918573,"score_spread":0.23633583026317856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293881964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285592,0.0001782748,0.9282051,0.010167495,0.0021433642,0.00033765702,0.000010978423,0.0012549045,0.0048463275],"genre_scores_gemma":[0.8829164,0.000026100313,0.11456686,0.0015706157,0.00071264233,0.000009536425,0.000011561357,0.000055083616,0.00013121188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690735,0.000094784526,0.00045184174,0.001012464,0.0006729477,0.0008606021],"domain_scores_gemma":[0.99820244,0.00012782573,0.0001759123,0.0011096799,0.00008286308,0.00030127694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003994936,0.00044171145,0.0003725647,0.00023897454,0.0005061428,0.00039241984,0.0016251508,0.00012938726,0.0000066146313],"category_scores_gemma":[0.00002789369,0.0003727763,0.0002357845,0.000717384,0.00011203398,0.000299141,0.0005318402,0.0005195685,0.0002810973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003123253,0.00053568184,0.000104214545,0.00006978251,0.00015286908,0.00054448284,0.004544119,0.34350997,0.005445219,0.5304529,0.0008775337,0.11373196],"study_design_scores_gemma":[0.0016461009,0.0008586539,0.00097218103,0.00021933598,0.000013270827,0.00020609907,0.000043714146,0.95305866,0.0057902536,0.031746496,0.004475332,0.00096988963],"about_ca_topic_score_codex":0.00007663171,"about_ca_topic_score_gemma":0.0000020325724,"teacher_disagreement_score":0.8300605,"about_ca_system_score_codex":0.00011459155,"about_ca_system_score_gemma":0.00012844773,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W2295288220","doi":"10.5555/2884435.2884580","title":"Weak duality for packing edge-disjoint odd (u, v)-trails","year":2016,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Duality (order theory); Time complexity; Discrete mathematics","score_opus":0.029410264380123948,"score_gpt":0.3144581138483648,"score_spread":0.28504784946824085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295288220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018722399,0.000103594604,0.977922,0.010507975,0.0008944815,0.000885802,0.000115642026,0.0004302815,0.00726794],"genre_scores_gemma":[0.79427254,0.00030191004,0.18664289,0.001265254,0.0015428442,0.0010942509,0.00003355078,0.00023126886,0.014615525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630994,0.00024845367,0.0004708396,0.0011462871,0.0007290272,0.0010954785],"domain_scores_gemma":[0.996817,0.0008431105,0.00017192092,0.001573451,0.00022864176,0.0003658575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012845913,0.00037799953,0.0003850752,0.00024073318,0.00035846175,0.00022433742,0.0016327099,0.00013452626,0.000039014554],"category_scores_gemma":[0.00021116348,0.00025412874,0.00030776396,0.00048830744,0.00027751084,0.0009770789,0.0004822156,0.00021082057,0.0002045362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001752087,0.00018765447,0.0002496524,0.00007616587,0.00011688509,0.000027616543,0.0005711285,0.000063999505,0.087131694,0.6981179,0.0025640393,0.21071807],"study_design_scores_gemma":[0.0062995665,0.0027288245,0.0026113002,0.00063369324,0.00004401172,0.000074953634,0.00022400059,0.019687274,0.27594024,0.59490496,0.09426556,0.00258561],"about_ca_topic_score_codex":0.000007909097,"about_ca_topic_score_gemma":0.0000055462897,"teacher_disagreement_score":0.7924003,"about_ca_system_score_codex":0.00017374658,"about_ca_system_score_gemma":0.00010853118,"threshold_uncertainty_score":0.9999911},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0061883137897224185,"score_gpt":0.23245964126258176,"score_spread":0.22627132747285933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395489635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45685983,0.00061468047,0.5140634,0.01002019,0.0026856554,0.003322613,0.00027742045,0.0015110816,0.010645099],"genre_scores_gemma":[0.952934,0.000076146665,0.044772346,0.0006385566,0.000121449084,0.00025999718,0.000073186275,0.0000633327,0.0010609372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996923,0.00022318983,0.00047710247,0.0011019268,0.00047519404,0.0007995536],"domain_scores_gemma":[0.9978022,0.0002321976,0.00016317508,0.0014066753,0.000088502806,0.0003072566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038571085,0.00044528098,0.00044050606,0.00045314527,0.00027688657,0.00043298583,0.0011530737,0.00019337423,0.00015343683],"category_scores_gemma":[0.000029639818,0.00037873397,0.00015426138,0.0008690794,0.00012620003,0.0015663056,0.000667551,0.00047986346,0.0010640628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002476123,0.004760347,0.003463912,0.00029134026,0.0005396834,0.02727442,0.0064705177,0.008308977,0.08255586,0.03882865,0.023899274,0.8033594],"study_design_scores_gemma":[0.0012960985,0.00040084144,0.0042051924,0.000112347836,0.000010680278,0.001130639,0.00007700974,0.98470974,0.0008640258,0.0056759333,0.00067295245,0.0008445231],"about_ca_topic_score_codex":0.0017230697,"about_ca_topic_score_gemma":0.000087202076,"teacher_disagreement_score":0.9764008,"about_ca_system_score_codex":0.00015929693,"about_ca_system_score_gemma":0.000067835696,"threshold_uncertainty_score":0.9998665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010092521598962808,"score_gpt":0.23692265881607769,"score_spread":0.22683013721711487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569985645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014720459,0.0005992151,0.95055485,0.029752493,0.0009035452,0.0015653642,0.000020709982,0.00019133011,0.0016920079],"genre_scores_gemma":[0.7271419,0.00048726823,0.26349747,0.0014342527,0.0013460394,0.00080235756,0.00013058822,0.00004436971,0.0051157395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898326,0.000038457612,0.00020934742,0.00032843952,0.00019770826,0.00024275863],"domain_scores_gemma":[0.99918044,0.00032709684,0.00007010253,0.00022869384,0.000108261294,0.00008541505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587191,0.0001369896,0.0001037726,0.000044326825,0.00041456136,0.00045712106,0.00030383468,0.00004620096,0.0000021142637],"category_scores_gemma":[0.000016710692,0.000091956135,0.000045779758,0.00014917296,0.00003930018,0.00029645063,0.00007357028,0.00007285326,0.000024660267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042582014,0.00011150665,0.0001313875,0.000103656945,0.00012708052,0.000004501484,0.0015265222,0.015033221,0.016530868,0.41679764,0.01018079,0.53941023],"study_design_scores_gemma":[0.00066109444,0.0003999628,0.001644064,0.00003622319,0.000012145092,0.00002569154,0.00004472766,0.9145833,0.0040969467,0.049927175,0.02822927,0.00033939135],"about_ca_topic_score_codex":0.000023829289,"about_ca_topic_score_gemma":0.0000078006915,"teacher_disagreement_score":0.8995501,"about_ca_system_score_codex":0.000014241609,"about_ca_system_score_gemma":0.000036211426,"threshold_uncertainty_score":0.44080287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"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)","score_opus":0.009640366075033085,"score_gpt":0.26272147228019915,"score_spread":0.25308110620516605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570771845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01992196,0.00024006561,0.9630325,0.011069145,0.00073995395,0.00032593068,0.0000060077423,0.00035113853,0.004313316],"genre_scores_gemma":[0.9745679,0.00003460939,0.023276279,0.001113456,0.00032414123,0.00001673632,0.00006072432,0.0000109105695,0.0005952547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793327,0.00008345846,0.00043723473,0.0005759632,0.0005671168,0.00040295607],"domain_scores_gemma":[0.9988286,0.000114409195,0.00021002555,0.0004834142,0.00021521396,0.0001483277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052892667,0.00023542951,0.00020862532,0.0005877189,0.0002770107,0.00032336664,0.00046646592,0.00008519179,0.000022420234],"category_scores_gemma":[0.000103896506,0.00021737309,0.00009443346,0.0020405285,0.000028960701,0.0009330664,0.00008878075,0.00016785813,0.000097622666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007571555,0.00054468546,0.000860095,0.00006276811,0.00008864069,0.00008176501,0.001918088,0.08830842,0.013394966,0.2791069,0.0052342564,0.6103237],"study_design_scores_gemma":[0.0026204456,0.0042360956,0.103803426,0.00019377262,0.00006334597,0.00021564885,0.00021495011,0.6841287,0.11911086,0.07077801,0.012210732,0.0024240003],"about_ca_topic_score_codex":0.000023640283,"about_ca_topic_score_gemma":0.000002890546,"teacher_disagreement_score":0.95464593,"about_ca_system_score_codex":0.000098076336,"about_ca_system_score_gemma":0.00011919408,"threshold_uncertainty_score":0.88642174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008784925928344135,"score_gpt":0.2371651895573972,"score_spread":0.2283802636290531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621248669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13714172,0.00078117213,0.7554749,0.011283497,0.0024654218,0.0013365492,0.001753109,0.0011869373,0.08857668],"genre_scores_gemma":[0.9105199,0.00010519163,0.08732172,0.001198515,0.00044003595,0.000035156645,0.00010583054,0.000040845225,0.0002328141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99744743,0.00008290062,0.00053224695,0.00075097586,0.00066026306,0.00052616646],"domain_scores_gemma":[0.99812347,0.00012366034,0.00025626493,0.0012337253,0.00012732725,0.00013553798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038012658,0.00029724377,0.00034221853,0.00022108782,0.00018979705,0.00016569193,0.001192805,0.00012726868,0.000025450601],"category_scores_gemma":[0.000016286764,0.00027246447,0.00024364256,0.00074826204,0.00013150524,0.00052556815,0.00034050568,0.00024122033,0.00004054515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013882085,0.00089705596,0.0030369638,0.000243328,0.00018598772,0.00018941036,0.0039240746,0.00045367458,0.0452769,0.888578,0.019208975,0.037866823],"study_design_scores_gemma":[0.007106573,0.0032252679,0.042753283,0.0008676931,0.00025076183,0.00023870054,0.00040073754,0.20517589,0.45976225,0.076544344,0.198811,0.004863496],"about_ca_topic_score_codex":0.0011736489,"about_ca_topic_score_gemma":0.000057645906,"teacher_disagreement_score":0.81203365,"about_ca_system_score_codex":0.000033359942,"about_ca_system_score_gemma":0.0000741454,"threshold_uncertainty_score":0.99997276},"labels":[],"label_agreement":null},{"id":"W2621324178","doi":"10.5555/1283383.1283446","title":"Tree exploration with logarithmic memory","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Computer science; Node (physics); Tree (set theory); Network topology; Logarithm; Binary logarithm; Graph; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Task (project management); Topology (electrical circuits); Mathematics; Combinatorics; Computer network; Artificial intelligence","score_opus":0.018104980120028976,"score_gpt":0.2619032041318963,"score_spread":0.24379822401186735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621324178","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004258623,0.000025816487,0.93805575,0.0037828397,0.00028648844,0.00039253666,0.0000028775507,0.0003349183,0.05669292],"genre_scores_gemma":[0.356058,0.00021395847,0.6277052,0.0032465397,0.0006691257,0.00015706757,0.00010242215,0.00011731032,0.011730327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799377,0.000073137235,0.00027973947,0.00053964293,0.00062072877,0.0004929914],"domain_scores_gemma":[0.9988064,0.000082024075,0.00010081266,0.00064211036,0.00014238058,0.00022624484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352531,0.00021837332,0.0001728686,0.00024958633,0.00020210879,0.00023699913,0.000646357,0.000084442,0.000031559735],"category_scores_gemma":[0.000012591782,0.00016877467,0.000058535115,0.00061449216,0.00008455082,0.0010817408,0.000115676376,0.00021447016,0.00017090309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000509489,0.0010202553,0.0003563878,0.000113860784,0.00026348286,0.00069339765,0.011684295,0.045404483,0.014095874,0.16426754,0.0065048933,0.755086],"study_design_scores_gemma":[0.004978078,0.0038245944,0.0016398565,0.00017975252,0.000031892436,0.00011623487,0.0009802798,0.92825806,0.04161007,0.0042422274,0.012369415,0.0017695312],"about_ca_topic_score_codex":0.000023558681,"about_ca_topic_score_gemma":0.000041751897,"teacher_disagreement_score":0.88285357,"about_ca_system_score_codex":0.00006366627,"about_ca_system_score_gemma":0.00007762713,"threshold_uncertainty_score":0.68824315},"labels":[],"label_agreement":null},{"id":"W2897123632","doi":"10.5555/3310435.3310596","title":"Short cycles via low-diameter decompositions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Graph; Running time; Undirected graph; Time complexity; Disjoint sets; Discrete mathematics; Algorithm","score_opus":0.010860816644116018,"score_gpt":0.2537178479733224,"score_spread":0.2428570313292064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897123632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060606416,0.00019102068,0.89524,0.004101301,0.0040640365,0.0011082395,0.000087836954,0.0011020497,0.03349911],"genre_scores_gemma":[0.8753535,0.000072270304,0.12133492,0.0015241527,0.00039937985,0.00010085676,0.00006472339,0.00006753979,0.0010826704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692327,0.00013046131,0.00046466343,0.0010537677,0.00068475923,0.0007430689],"domain_scores_gemma":[0.9976774,0.0002152749,0.00009230297,0.0016262288,0.00010005613,0.00028877027],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028839483,0.0004355467,0.0004160237,0.00034059284,0.00030948396,0.00038631188,0.0017265114,0.00015073323,0.00013834103],"category_scores_gemma":[0.0000071271456,0.00040133976,0.00036515406,0.0006933651,0.00013654598,0.000804148,0.00051735784,0.0004042529,0.0012901463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018757403,0.0029202634,0.007832928,0.00036669677,0.0010759874,0.00048607128,0.0037523874,0.0086419275,0.09931277,0.34721696,0.0083130635,0.51989335],"study_design_scores_gemma":[0.0023906056,0.001970044,0.024824418,0.00048847287,0.00009128029,0.00032340764,0.0001309589,0.8389057,0.057185847,0.054455154,0.015611079,0.0036230537],"about_ca_topic_score_codex":0.000033793753,"about_ca_topic_score_gemma":0.0000056227004,"teacher_disagreement_score":0.83026373,"about_ca_system_score_codex":0.0000889564,"about_ca_system_score_gemma":0.000046867164,"threshold_uncertainty_score":0.99984384},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010179169663962507,"score_gpt":0.2524591371140157,"score_spread":0.24227996745005317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962748838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629576,0.00018838623,0.8492208,0.01247693,0.0049036387,0.0011206397,0.00014583228,0.0017522199,0.05389577],"genre_scores_gemma":[0.8764171,0.000015783457,0.11665363,0.00067305693,0.00059939636,0.00008262232,0.000110395034,0.000057826204,0.0053901854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757695,0.00014748127,0.00033486306,0.00079596305,0.0005707943,0.0005739318],"domain_scores_gemma":[0.99820745,0.0003619707,0.00018907647,0.0009175515,0.00012000829,0.00020397195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003921039,0.0003174331,0.00027987448,0.00015082603,0.000341182,0.0004534248,0.0008917601,0.000099710844,0.00009099009],"category_scores_gemma":[0.000121829966,0.00027054898,0.00013255858,0.0007816085,0.00005337748,0.00057416887,0.00026727363,0.0003975596,0.00081495027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008309192,0.0012111254,0.06523225,0.00032557384,0.0005728656,0.000386456,0.0045586457,0.054362036,0.07231454,0.5930205,0.0121998135,0.19573313],"study_design_scores_gemma":[0.001055855,0.000612201,0.029091513,0.00015004973,0.000021594598,0.00004877159,0.00005996022,0.9537192,0.0021263207,0.0030321656,0.0092726955,0.00080967357],"about_ca_topic_score_codex":0.00024573188,"about_ca_topic_score_gemma":0.000003421882,"teacher_disagreement_score":0.89935714,"about_ca_system_score_codex":0.00008012302,"about_ca_system_score_gemma":0.000101652426,"threshold_uncertainty_score":0.99997467},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02753062799451619,"score_gpt":0.26014384067166735,"score_spread":0.23261321267715115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963204788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028106626,0.00017222272,0.9679072,0.0001814588,0.00046028456,0.001265315,0.000045055313,0.0008010371,0.0010608089],"genre_scores_gemma":[0.49678499,0.000114402785,0.5014225,0.00010123073,0.00042658762,0.00026802864,0.00015362048,0.0001383903,0.0005901957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874526,0.000025375934,0.0002757523,0.00037427773,0.00023353122,0.00034578107],"domain_scores_gemma":[0.9994149,0.00008143769,0.00006330441,0.00027173333,0.000081091275,0.000087512766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021343533,0.00026368067,0.00025336051,0.00012211992,0.00009701595,0.000101526064,0.00013085469,0.00013312325,0.000022938566],"category_scores_gemma":[0.000011176068,0.00025118992,0.00008276152,0.000101685386,0.00004444455,0.00021391595,0.00003529374,0.00015511026,0.00003410923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037442334,0.00018951867,0.00078453025,0.00047019424,0.00051183987,0.000016601252,0.0010614118,0.63208026,0.25464782,0.0058697453,0.0076995254,0.09629414],"study_design_scores_gemma":[0.00047189745,0.00033414387,0.00036486,0.00008989916,0.000029020837,0.000018130588,0.000041791183,0.9544729,0.039533794,0.0012337673,0.0030206363,0.00038918684],"about_ca_topic_score_codex":0.0000063839693,"about_ca_topic_score_gemma":2.2711095e-7,"teacher_disagreement_score":0.46867836,"about_ca_system_score_codex":0.0000619167,"about_ca_system_score_gemma":0.000019836123,"threshold_uncertainty_score":0.99999404},"labels":[],"label_agreement":null},{"id":"W2963371280","doi":"10.5555/3039686.3039807","title":"Random walks and evolving sets: faster convergences and limitations","year":2017,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random walk; Mathematics; Random graph; Vertex (graph theory); Graph partition; Spectral gap; Graph; Combinatorics; Expander graph; Discrete mathematics","score_opus":0.07027895424714435,"score_gpt":0.34703074391581556,"score_spread":0.2767517896686712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963371280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6522592,0.0029283185,0.050119143,0.016580168,0.0045525352,0.0029288898,0.00027804126,0.00042486042,0.26992884],"genre_scores_gemma":[0.9117634,0.0018524672,0.0801686,0.00029037334,0.00029428347,0.000101051584,0.000011220801,0.00006802256,0.005450538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987073,0.0001337435,0.0002735629,0.000389258,0.00022009893,0.00027604945],"domain_scores_gemma":[0.9980887,0.0008966869,0.00020295155,0.0005648584,0.00007923544,0.00016753128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006638851,0.00023299312,0.00034404203,0.00006897881,0.0006170894,0.0003441134,0.00020886176,0.000106226726,0.000020848733],"category_scores_gemma":[0.0006858279,0.00018230664,0.00007840803,0.000029922941,0.00024241561,0.00029724554,0.0001773287,0.00015837801,5.534473e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015191176,0.0007854083,0.021700714,0.002829281,0.002168863,0.00034230217,0.061266307,0.000034197674,0.038491223,0.14573935,0.03564985,0.6894734],"study_design_scores_gemma":[0.06420694,0.0059077237,0.040225398,0.0049016294,0.0033931436,0.0006136808,0.03530113,0.46664718,0.028692422,0.21805254,0.12071692,0.011341296],"about_ca_topic_score_codex":0.000044795957,"about_ca_topic_score_gemma":0.00006531917,"teacher_disagreement_score":0.6781321,"about_ca_system_score_codex":0.00001679778,"about_ca_system_score_gemma":0.000018981822,"threshold_uncertainty_score":0.7434249},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010199872324038213,"score_gpt":0.22240178705055139,"score_spread":0.21220191472651317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963575846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012328087,0.00017885676,0.9213549,0.008655631,0.002345873,0.0032562527,0.00007183638,0.0008717786,0.050936807],"genre_scores_gemma":[0.86452425,0.00045729912,0.12762043,0.0018253397,0.0005761,0.0009281047,0.0002031875,0.00009903946,0.0037662252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734205,0.00015112788,0.00052167213,0.00083130796,0.00051418005,0.0006396628],"domain_scores_gemma":[0.998584,0.000125406,0.00016275527,0.0008897849,0.00006369951,0.00017436391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054927485,0.0003475457,0.000359574,0.00032726143,0.00014408518,0.00075394777,0.00096327235,0.00010905426,0.00018362913],"category_scores_gemma":[0.000025550082,0.00029814296,0.00010849528,0.0005343602,0.00010047264,0.001980294,0.00036407437,0.00028849847,0.0006417702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084859836,0.00072102755,0.009153967,0.00027191927,0.00041910072,0.00018633818,0.0027435373,0.01028732,0.014442563,0.1532087,0.025797425,0.78268325],"study_design_scores_gemma":[0.007969729,0.0006149204,0.023323698,0.0003564257,0.00003921539,0.000029926228,0.00032290784,0.92973167,0.0013649232,0.021684494,0.012964077,0.0015980287],"about_ca_topic_score_codex":0.0013090805,"about_ca_topic_score_gemma":0.000053991927,"teacher_disagreement_score":0.9194443,"about_ca_system_score_codex":0.00010244528,"about_ca_system_score_gemma":0.000055610533,"threshold_uncertainty_score":0.9999471},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019540559395912687,"score_gpt":0.24631809929912094,"score_spread":0.22677753990320826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963693432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301285,0.0003210069,0.7836266,0.0040233093,0.001442125,0.0013695388,0.000059822774,0.00017452597,0.0059701926],"genre_scores_gemma":[0.97671026,0.00006669393,0.022808895,0.0001893177,0.00006880421,0.00005306448,0.0000033650083,0.000017886556,0.00008172526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975179,0.00042045696,0.0005107301,0.00059940276,0.0005795207,0.00037200993],"domain_scores_gemma":[0.99746615,0.00079218735,0.00039044052,0.0010980447,0.00014024072,0.0001129182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332168,0.00027803626,0.0006036627,0.00014021197,0.00014735057,0.00013190614,0.0010915875,0.00007792374,0.000004549904],"category_scores_gemma":[0.000103965926,0.00019821644,0.00021144573,0.00046499498,0.0010258444,0.00038043354,0.0004511625,0.00025489047,0.000003775311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019573998,0.0004271864,0.000724755,0.0003302798,0.0003106373,0.000002478567,0.0038145308,0.0018540814,0.007122255,0.915807,0.00008344292,0.06932762],"study_design_scores_gemma":[0.0074463254,0.0014898368,0.0029380198,0.0003378767,0.000109751316,0.00003277498,0.00011569372,0.71623385,0.03435123,0.23519726,0.00096757564,0.0007798054],"about_ca_topic_score_codex":0.00040533257,"about_ca_topic_score_gemma":0.00002246969,"teacher_disagreement_score":0.7736974,"about_ca_system_score_codex":0.000022283744,"about_ca_system_score_gemma":0.000041318133,"threshold_uncertainty_score":0.8083032},"labels":[],"label_agreement":null},{"id":"W2963846312","doi":"10.5555/3310435.3310527","title":"Every collinear set in a planar graph is free","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Plane (geometry); Mathematics; Planar straight-line graph; Set (abstract data type); Graph drawing; Discrete mathematics; Computer science; Geometry; Line graph; 1-planar graph; Computer graphics (images)","score_opus":0.011157125908587074,"score_gpt":0.24427974828954613,"score_spread":0.23312262238095904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963846312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49647826,0.00075090525,0.4358565,0.030766709,0.0059059816,0.0024113797,0.00044402175,0.00065478694,0.026731461],"genre_scores_gemma":[0.92179006,0.00016853109,0.064082205,0.0060111578,0.0005631305,0.000097057855,0.00020769273,0.000050547744,0.0070296023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983007,0.0000759792,0.00027808824,0.00055928226,0.0004783701,0.00030760153],"domain_scores_gemma":[0.9989501,0.00010764763,0.00008075672,0.00070197764,0.00006057488,0.00009894884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027702135,0.00018877785,0.00020005647,0.00033627922,0.00007087105,0.00013769038,0.0006907137,0.000087279084,0.000047596564],"category_scores_gemma":[0.000013238293,0.00017837144,0.00009353019,0.00090903643,0.000021222419,0.00043618286,0.0001405135,0.00016896486,0.00036150104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066004385,0.0016538972,0.019102657,0.0004311272,0.0005605876,0.00058661646,0.017972846,0.27133393,0.052422546,0.4067499,0.18127982,0.047246013],"study_design_scores_gemma":[0.0036239612,0.0011006814,0.011781394,0.00014051185,0.000014736359,0.00004598148,0.00010891073,0.9017927,0.01430708,0.038808927,0.027170843,0.0011042954],"about_ca_topic_score_codex":0.000056257555,"about_ca_topic_score_gemma":0.000012474795,"teacher_disagreement_score":0.6304587,"about_ca_system_score_codex":0.000058301204,"about_ca_system_score_gemma":0.0000870386,"threshold_uncertainty_score":0.7273776},"labels":[],"label_agreement":null},{"id":"W3136071702","doi":"10.5555/2722129.2722235","title":"Compatible connectivity-augmentation of planar disconnected graphs","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Upper and lower bounds; Planar; Morphing; Mathematics; Graph; Vertex connectivity; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.027862759519157045,"score_gpt":0.2748712602260167,"score_spread":0.24700850070685967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136071702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15140104,0.00013503943,0.83916134,0.002371482,0.0011830931,0.00042439558,0.00004609878,0.00019509447,0.00508242],"genre_scores_gemma":[0.9708434,0.000011475335,0.028531434,0.00019608106,0.00008713598,0.000025693727,0.00013326398,0.000011295739,0.00016022674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983788,0.00015537941,0.00031688588,0.00039776345,0.00053898414,0.00021220294],"domain_scores_gemma":[0.99890643,0.0001629997,0.00018400734,0.00037720118,0.00020591654,0.00016344718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035493152,0.00017393095,0.0002243096,0.0002753568,0.00009549984,0.00008759481,0.0003520888,0.000054297176,0.0000072066164],"category_scores_gemma":[0.000042823045,0.00015950589,0.00007978856,0.0007635683,0.000051171755,0.00055616227,0.000068487665,0.00009737377,0.000032524036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024427078,0.00073988456,0.0016285006,0.00006960247,0.00020953313,0.000029747145,0.0045640273,0.061387923,0.033811133,0.8684001,0.006413425,0.022501845],"study_design_scores_gemma":[0.005659013,0.0029894374,0.009303186,0.000121410514,0.000057674177,0.000049752467,0.0005210505,0.70980597,0.13413824,0.13406992,0.002218979,0.0010653761],"about_ca_topic_score_codex":0.00007839514,"about_ca_topic_score_gemma":0.000013566258,"teacher_disagreement_score":0.81944233,"about_ca_system_score_codex":0.00005693474,"about_ca_system_score_gemma":0.00010898672,"threshold_uncertainty_score":0.6504461},"labels":[],"label_agreement":null},{"id":"W34613702","doi":"10.1021/acs.est.1c04111","title":"Rigorous analysis of heuristics for NP-hard problems.","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada First Research Excellence Fund","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.023512675040069493,"score_gpt":0.2730710835262716,"score_spread":0.2495584084862021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34613702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026654217,0.00027224547,0.9883709,0.0035232385,0.00057625497,0.00065176847,0.00034591235,0.0002709026,0.0033233562],"genre_scores_gemma":[0.2894679,0.0002677907,0.7062239,0.0011871863,0.0006759789,0.00024221641,0.00017737536,0.000067828965,0.0016898174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727786,0.00007908841,0.0006702799,0.00079826434,0.00060042937,0.0005741059],"domain_scores_gemma":[0.9977406,0.00031597607,0.0003003992,0.0012078687,0.0002463504,0.0001887626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051091594,0.00033724878,0.0006436811,0.0006632651,0.0002228726,0.0001507114,0.0014370681,0.00012199611,0.000030262829],"category_scores_gemma":[0.000044095636,0.00030778156,0.0006085185,0.0017750517,0.0001584533,0.0003534039,0.00025556184,0.00019397952,0.00002309496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001722272,0.0021578297,0.0012848169,0.00039991835,0.006201998,0.000032011398,0.005107417,0.14675333,0.0062022116,0.54386365,0.01109202,0.27673256],"study_design_scores_gemma":[0.0008609706,0.00064526894,0.0010593095,0.000037133253,0.00052227394,0.000007956627,0.000021909816,0.94667447,0.004022172,0.0072114985,0.03834776,0.00058929913],"about_ca_topic_score_codex":0.000046686455,"about_ca_topic_score_gemma":0.000034455883,"teacher_disagreement_score":0.7999211,"about_ca_system_score_codex":0.00007252883,"about_ca_system_score_gemma":0.000061566156,"threshold_uncertainty_score":0.9999374},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020448014219507833,"score_gpt":0.26048270278324615,"score_spread":0.2400346885637383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88251305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05171162,0.0055579743,0.51671886,0.09880995,0.031876016,0.0034154525,0.0008182649,0.008331177,0.2827607],"genre_scores_gemma":[0.8300374,0.00036751787,0.1486918,0.010065927,0.003534111,0.0002569991,0.00011791075,0.00015510755,0.006773205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683183,0.00016419569,0.00039777713,0.0007038805,0.0007616631,0.0011406534],"domain_scores_gemma":[0.99763834,0.000207429,0.000141946,0.0013773463,0.000100801,0.0005341126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005303709,0.00042662476,0.00036244188,0.00025635483,0.0003900577,0.0002734965,0.0015625778,0.00014940303,0.00008279161],"category_scores_gemma":[0.000037385,0.0003906954,0.0002623932,0.0008518828,0.00015777847,0.00095933746,0.0005974031,0.00041449387,0.00025038136],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015215209,0.0027762605,0.0035954637,0.00027651343,0.00066957483,0.00023938535,0.021271769,0.0005557976,0.008277929,0.7264768,0.056321472,0.17938687],"study_design_scores_gemma":[0.0046153497,0.002395656,0.012450412,0.00043475424,0.00017943804,0.0005350432,0.001053341,0.1872497,0.04250026,0.0253617,0.7176598,0.0055645425],"about_ca_topic_score_codex":0.00020448928,"about_ca_topic_score_gemma":0.000018257382,"teacher_disagreement_score":0.7783258,"about_ca_system_score_codex":0.0001183935,"about_ca_system_score_gemma":0.00008793204,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null}]}