{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":463,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":463,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"40f29b27c88c","filters":{"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)"}},"results":[{"id":"W4394666350","doi":"10.48550/arxiv.1303.3997","title":"Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5348,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Human Genome Research Institute; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; Comisión Nacional de Investigación Científica y Tecnológica; Directorate for Biological Sciences; Israel Institute for Biological Research; Japan Society for the Promotion of Science; Centre for Biotechnology and Bioengineering; National Institutes of Health; National Science Foundation","keywords":"Contig; Sequence (biology); clone (Java method); Sequence assembly; Computational biology; Genetics; Biology; Computer science; Genome; DNA; Gene","authors":[{"name":"Heng Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01493816194743081,"gpt":0.2756569372533093,"spread":0.2607187753058785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335207,0.002970512,0.002071576,0.003956048,0.00183336,0.002583344,0.003824882,0.001440967,0.04150293],"category_scores_gemma":[0.008505639,0.001885312,0.001652536,0.004416403,0.0006049994,0.002153295,0.002197991,0.002843599,0.04492043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006852458,"about_ca_system_score_gemma":0.001221787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00136967,"about_ca_topic_score_gemma":0.001659492,"domain_scores_codex":[0.9985461,0.0002430848,0.0001567563,0.0005607912,0.0003923393,0.0001009388],"domain_scores_gemma":[0.9984705,0.0004945894,0.000121703,0.0004745878,0.0003539196,0.0000847499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002265471,0.0004124356,0.003301967,0.004301869,0.0009690953,0.001051097,0.00102483,0.01436767,0.2124188,0.01923448,0.3021132,0.438539],"study_design_scores_gemma":[0.0004086045,0.0002902457,0.005120041,0.0003160153,0.0004093128,0.001043345,0.0003844179,0.2151954,0.2894323,0.05206274,0.4351116,0.0002259469],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01590965,0.0007247954,0.821079,0.0003045962,0.0005298784,0.000314301,0.02714466,0.1262842,0.007708979],"genre_scores_gemma":[0.03105995,0.0004387844,0.8368524,0.0001590481,0.0001263881,0.001117697,0.08977723,0.0315491,0.008919293],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04150293,"threshold_uncertainty_score":0.1388411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883173799","doi":"10.4230/lipics.aft.2025.15","title":"A Modular Approach for the Analysis of Blockchain Consensus Protocol Under Churn (Poster)","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Gossip; Computer science; Political science; Law","authors":[{"name":"Ethan Buchman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03124505584141129,"gpt":0.2978693558438446,"spread":0.2666243000024333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200294,0.000635494,0.0004730868,0.001543061,0.0005371289,0.001070123,0.001044667,0.0008511576,0.002446995],"category_scores_gemma":[0.005710979,0.0002859868,0.001133739,0.0007530478,0.001837831,0.00210384,0.002777191,0.001505602,0.0005323247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007457908,"about_ca_system_score_gemma":0.0007835396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005346335,"about_ca_topic_score_gemma":0.0002742276,"domain_scores_codex":[0.9987482,0.0004280609,0.00006422833,0.0001950734,0.0004294212,0.0001349835],"domain_scores_gemma":[0.997677,0.001007935,0.0003494633,0.0003825358,0.0004075495,0.0001754841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001337152,0.0001055182,0.002047278,0.0002505306,0.0001570495,0.0007472351,0.0007388029,0.271367,0.03132432,0.6428873,0.002639363,0.04760198],"study_design_scores_gemma":[0.00001102884,0.00008208939,0.000419416,0.00002660877,0.0000344071,0.0001467666,0.00005236818,0.7947567,0.003044643,0.1986323,0.002776264,0.00001747239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01637573,0.0001890365,0.9805236,0.0001795681,0.0000401845,0.0001011546,0.00004651433,0.0001705665,0.00237359],"genre_scores_gemma":[0.7098916,0.0006817555,0.282765,0.0002203959,0.0002891344,0.0006160814,0.0002412091,0.000242038,0.005052652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002446995,"threshold_uncertainty_score":0.0105927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465968014","doi":"10.4230/lipics.ccc.2016.10","title":"Learning Algorithms from Natural Proofs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Algorithm; Mathematics; Constant (computer programming); Class (philosophy); Natural number; Discrete mathematics; Prime (order theory); Upper and lower bounds; Combinatorics; Concept class; Computer science; Artificial intelligence","authors":[{"name":"Marco Carmosino","is_ca":false},{"name":"Russell Impagliazzo","is_ca":false},{"name":"Valentine Kabanets","is_ca":true},{"name":"Antonina Kolokolova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01391521125942484,"gpt":0.2417513759784208,"spread":0.227836164718996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367894,0.0008903968,0.0008388662,0.001778612,0.001209997,0.003990665,0.003053548,0.00144781,0.01064613],"category_scores_gemma":[0.03631848,0.0008693753,0.001686133,0.002050509,0.003637842,0.01371781,0.005384964,0.004743666,0.001701112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003040008,"about_ca_system_score_gemma":0.002167453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275819,"about_ca_topic_score_gemma":0.001683446,"domain_scores_codex":[0.9944898,0.001953111,0.0003699709,0.001429435,0.001420829,0.000336765],"domain_scores_gemma":[0.9681359,0.0252516,0.0009341626,0.003977551,0.001301156,0.0003997372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001675797,0.000104252,0.0006463905,0.0004734161,0.00005046898,0.00005992665,0.0003312162,0.02471915,0.001444433,0.841346,0.00898734,0.1216699],"study_design_scores_gemma":[0.00005347209,0.00002693576,0.00009995086,0.00004153563,0.00001330362,0.00006206854,0.00002622099,0.08034723,0.001169597,0.9099945,0.008152144,0.00001309294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01416486,0.001133068,0.9664042,0.002893298,0.0001636029,0.0001782638,0.0004310301,0.001776962,0.01285466],"genre_scores_gemma":[0.2882204,0.001704806,0.6938996,0.001980314,0.0007076013,0.0006852563,0.001912663,0.0006053309,0.01028408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064613,"threshold_uncertainty_score":0.03561485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2252374344","doi":"10.4230/lipics.ecoop.2015.76","title":"Concrete Types for TypeScript","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Agence Nationale de la Recherche; National Science Foundation","keywords":"TypeScript; JavaScript; Computer science; Programming language; Compiler; Toolchain; Code (set theory); Point (geometry); Software engineering; Set (abstract data type); Software","authors":[{"name":"Gregor Richards","is_ca":true},{"name":"Francesco Zappa Nardelli","is_ca":false},{"name":"Jan Vítek","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04170734998501201,"gpt":0.2783358575516958,"spread":0.2366285075666838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976814,0.001151921,0.0009022248,0.001732375,0.001700786,0.007179991,0.002838022,0.002154942,0.04556665],"category_scores_gemma":[0.01447994,0.001564994,0.002339583,0.002439528,0.003078999,0.01115457,0.004887882,0.005736912,0.02436257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00189241,"about_ca_system_score_gemma":0.002685864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001101268,"about_ca_topic_score_gemma":0.001335434,"domain_scores_codex":[0.9957662,0.000741101,0.0007366455,0.0006245239,0.001787387,0.0003442094],"domain_scores_gemma":[0.9930723,0.002298717,0.0005438536,0.002579571,0.001223589,0.0002819035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001462821,0.00003485083,0.0005880876,0.0005035128,0.00002798378,0.0002205118,0.000479779,0.001488463,0.004132437,0.8807845,0.04173117,0.06986246],"study_design_scores_gemma":[0.00005564325,0.00002504591,0.0001558149,0.00028436,0.00003435947,0.0005206724,0.00008018193,0.007068187,0.007844289,0.5528443,0.4310212,0.00006604939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001897848,0.0007265611,0.9542669,0.0009120608,0.0009027706,0.0001375195,0.00170008,0.01632395,0.02313234],"genre_scores_gemma":[0.08832259,0.001988376,0.8515744,0.002174711,0.001027921,0.0008819838,0.005526833,0.01633809,0.03216513],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04556665,"threshold_uncertainty_score":0.1524356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2277373197","doi":"10.4230/lipics.ecoop.2015.321","title":"Hybrid DOM-Sensitive Change Impact Analysis for JavaScript","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"JavaScript; Computer science; Asynchronous communication; Static analysis; Unobtrusive JavaScript; Task (project management); Set (abstract data type); Ranking (information retrieval); Distributed computing; Data mining; Artificial intelligence; Programming language; Rich Internet application; Computer network","authors":[{"name":"Saba Alimadadi","is_ca":true},{"name":"Ali Mesbah","is_ca":true},{"name":"Karthik Pattabiraman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05926056696419222,"gpt":0.3147781806116966,"spread":0.2555176136475044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002584334,0.001139521,0.0009025902,0.007613788,0.0006473356,0.001678908,0.001129756,0.0007755783,0.0009542256],"category_scores_gemma":[0.01194248,0.0004055859,0.0009575397,0.002811351,0.0005005861,0.001878415,0.001793147,0.0009985118,0.0005259534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007212867,"about_ca_system_score_gemma":0.0008544319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002688889,"about_ca_topic_score_gemma":0.004075209,"domain_scores_codex":[0.9949988,0.001071018,0.0003710976,0.0007280527,0.00251417,0.0003168145],"domain_scores_gemma":[0.9891431,0.004850044,0.001232521,0.001698721,0.002738805,0.0003367527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007245992,0.0009339466,0.07915751,0.0006072295,0.0003522804,0.0007616153,0.0008230566,0.0820094,0.0903322,0.006480772,0.005639836,0.7321776],"study_design_scores_gemma":[0.00002950066,0.0002381862,0.02692812,0.00004016519,0.00009445381,0.000465118,0.00021892,0.9212724,0.04015869,0.006660903,0.003812103,0.00008150336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1676979,0.0006656379,0.8112844,0.0001316051,0.00005715516,0.0004231829,0.0008919651,0.01596506,0.002883154],"genre_scores_gemma":[0.6730058,0.0001752648,0.323178,0.00007653781,0.00004323665,0.0001913702,0.001514938,0.000649043,0.001165769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007613788,"threshold_uncertainty_score":0.01366746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397354107","doi":"10.4230/lipics.icalp.2016.31","title":"Block-Wise Non-Malleable Codes","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Air Force Office of Scientific Research; University of Waterloo; Defense Advanced Research Projects Agency; U.S. Department of Defense; National Science Foundation","keywords":"Code word; Block (permutation group theory); Computer science; Function (biology); Adversary; Construct (python library); Block code; Theoretical computer science; Mathematics; Combinatorics; Discrete mathematics; Decoding methods; Computer security; Algorithm; Computer network","authors":[{"name":"Nishanth Chandran","is_ca":false},{"name":"Vipul Goyal","is_ca":false},{"name":"Pratyay Mukherjee","is_ca":false},{"name":"Omkant Pandey","is_ca":false},{"name":"Jalaj Upadhyay","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01014518439349074,"gpt":0.2328710351997363,"spread":0.2227258508062455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598285,0.0009030746,0.0009079752,0.0009887296,0.0008603783,0.001756026,0.001842395,0.001757431,0.003020575],"category_scores_gemma":[0.01207221,0.000523598,0.00068855,0.001151176,0.003127012,0.003974102,0.003035775,0.003157425,0.001758165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766561,"about_ca_system_score_gemma":0.001915464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001570196,"about_ca_topic_score_gemma":0.001399392,"domain_scores_codex":[0.9967107,0.0006912823,0.0002210552,0.0007768458,0.001090125,0.0005100846],"domain_scores_gemma":[0.990311,0.003651646,0.00115786,0.00315787,0.00138471,0.0003368417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003681915,0.00004701386,0.0007790457,0.0001871914,0.00004591091,0.0002169974,0.0003422764,0.06736872,0.00812732,0.8842095,0.003050983,0.03525689],"study_design_scores_gemma":[0.0000925901,0.0001722638,0.000285397,0.0001185314,0.00003539212,0.0004103771,0.00007295688,0.3365837,0.01322457,0.6367304,0.0121979,0.00007579748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04971899,0.001013245,0.9345629,0.001118171,0.0001655632,0.0001654317,0.0005309575,0.0007467469,0.01197801],"genre_scores_gemma":[0.8225143,0.0009725741,0.1553877,0.000871853,0.0001787167,0.0004132726,0.0007823917,0.0002264559,0.01865268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003020575,"threshold_uncertainty_score":0.01281738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1537398137","doi":"10.4230/lipics.rta.2011.21","title":"Automated Certified Proofs with CiME3","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Mathematical proof; Proof assistant; Rewriting; Computer science; Programming language; Certification; Scripting language; Automated theorem proving; Automation; Confluence; Mathematics; Engineering","authors":[{"name":"Évelyne Contejean","is_ca":true},{"name":"Pierre Courtieu","is_ca":false},{"name":"Julien Forest","is_ca":false},{"name":"Olivier Pons","is_ca":false},{"name":"Xavier Urbain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0355182454461572,"gpt":0.2575704401851536,"spread":0.2220521947389964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005313697,0.0008169292,0.0007765109,0.001517134,0.0007812213,0.003485115,0.002727162,0.001438107,0.02421631],"category_scores_gemma":[0.01908994,0.0012043,0.002031514,0.001095401,0.002112341,0.003866698,0.005336081,0.002929606,0.007660095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376186,"about_ca_system_score_gemma":0.001549041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001517231,"about_ca_topic_score_gemma":0.001696702,"domain_scores_codex":[0.9935607,0.001913012,0.000449851,0.0009662848,0.002640058,0.0004700789],"domain_scores_gemma":[0.9899213,0.003961971,0.0004267832,0.004636737,0.0008639101,0.0001892725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004884056,0.0001931375,0.001310613,0.001176363,0.0001966536,0.0010281,0.000929443,0.03188504,0.0233413,0.6444481,0.05845065,0.2365523],"study_design_scores_gemma":[0.0003426741,0.000092802,0.0004610579,0.0002351957,0.00009446501,0.001271062,0.00007809043,0.1713306,0.06538238,0.2623306,0.4982189,0.0001621181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003529185,0.0003520632,0.9307411,0.0005841316,0.00020381,0.0001676886,0.0008073979,0.0480587,0.01555598],"genre_scores_gemma":[0.1367275,0.0005264686,0.8367413,0.0005966524,0.0001880125,0.0004371047,0.002595441,0.00824276,0.01394476],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02421631,"threshold_uncertainty_score":0.08101159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2733045287","doi":"10.4230/lipics.ecrts.2017.24","title":"WCET-Driven Dynamic Data Scratchpad Management With Compiler-Directed Prefetching","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Worst-case execution time; Parallel computing; Latency (audio); CAS latency; Scheme (mathematics); Embedded system; Operating system; Execution time; Memory controller; Semiconductor memory","authors":[{"name":"Muhammad Refaat Sedky Soliman","is_ca":true},{"name":"Rodolfo Pellizzoni","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03026048546202369,"gpt":0.298696953606814,"spread":0.2684364681447903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745419,0.0006109497,0.0004754738,0.0007440644,0.000331206,0.000633528,0.0009915078,0.000344925,0.001319624],"category_scores_gemma":[0.001794766,0.0003234559,0.0002673123,0.0006485587,0.0007482465,0.0008829467,0.0006247882,0.0005699092,0.0002555514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006089485,"about_ca_system_score_gemma":0.001480723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003764008,"about_ca_topic_score_gemma":0.005255542,"domain_scores_codex":[0.9994082,0.00009178363,0.00003917469,0.0001021836,0.0002179293,0.000140708],"domain_scores_gemma":[0.9988748,0.0004349997,0.0001662048,0.0003019172,0.0001878546,0.00003410379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006865427,0.0002964091,0.006550299,0.0002862664,0.00006563255,0.0004492138,0.0003041295,0.5502403,0.1924649,0.01595294,0.004404411,0.228299],"study_design_scores_gemma":[0.00003081174,0.0000803712,0.0005395439,0.000008726295,0.00001861848,0.00004187692,0.00001281795,0.926584,0.0687982,0.002636956,0.001233698,0.00001439169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3502134,0.0006208817,0.6262094,0.0002880656,0.00009815175,0.0001037158,0.0001630244,0.01843996,0.003863239],"genre_scores_gemma":[0.8750478,0.000118725,0.1221479,0.00007524852,0.0000227471,0.00007964603,0.0001314412,0.0006398488,0.001736623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003764008,"threshold_uncertainty_score":0.007484198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145563891","doi":"10.4230/lipics.stacs.2010.2443","title":"The Tropical Double Description Method","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ministère des Transports","funders":"","keywords":"Polyhedron; Hypergraph; Extreme point; Representation (politics); Point (geometry); Component (thermodynamics); Mathematics; Algorithm; Linear inequality; Connected component; Computer science; Mathematical optimization; Combinatorics; Inequality; Geometry","authors":[{"name":"Xavier Allamigeon","is_ca":true},{"name":"Stéphane Gaubert","is_ca":false},{"name":"Éric Goubault","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02545824391412968,"gpt":0.2878129683022088,"spread":0.2623547243880791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116914,0.0006204332,0.0008178693,0.001526157,0.0007185445,0.001857023,0.002508836,0.000710412,0.01540307],"category_scores_gemma":[0.004215355,0.000664397,0.001603362,0.001442863,0.001191759,0.003393374,0.003341946,0.001888673,0.002944079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00079241,"about_ca_system_score_gemma":0.001755946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001641133,"about_ca_topic_score_gemma":0.002123889,"domain_scores_codex":[0.9986498,0.0002590727,0.00007954537,0.0002164425,0.0005945053,0.0002006263],"domain_scores_gemma":[0.9981151,0.0005194065,0.0001183366,0.0007835396,0.0003577906,0.0001058476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003222201,0.0000815937,0.001410271,0.0005806387,0.00009934987,0.0003466666,0.0003785812,0.06897863,0.0134292,0.5907178,0.01450147,0.3091536],"study_design_scores_gemma":[0.0001105,0.0001052579,0.0003226961,0.0001116883,0.00007161476,0.000582994,0.0001416109,0.6267296,0.01851905,0.3016937,0.05153213,0.00007917014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00507805,0.00008328688,0.9884915,0.0001128733,0.00004041353,0.00006294707,0.0002470356,0.00114587,0.004738037],"genre_scores_gemma":[0.209403,0.000260402,0.7790484,0.0002211396,0.00006701459,0.0003243601,0.001255008,0.001192494,0.008228187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01540307,"threshold_uncertainty_score":0.05152839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2979929440","doi":"10.4230/lipics.tqc.2020.4","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Pseudorandom function family; Theoretical computer science; Quantum cryptography; Random oracle; Quantum; Probabilistic encryption; Cryptography; Quantum information; Computer security; Public-key cryptography; Physics; Quantum mechanics","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Sébastien Lord","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01342349499243985,"gpt":0.2472337597318089,"spread":0.233810264739369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002120472,0.000651119,0.0007632265,0.0007486212,0.0006813626,0.002585392,0.001725123,0.001515156,0.005957094],"category_scores_gemma":[0.006531095,0.0004790049,0.0009018423,0.000689727,0.004521359,0.008201187,0.004374778,0.003546933,0.001337145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001394447,"about_ca_system_score_gemma":0.0009141215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004222876,"about_ca_topic_score_gemma":0.0003431264,"domain_scores_codex":[0.9970726,0.0009109083,0.000196487,0.0004879535,0.0008816567,0.0004503341],"domain_scores_gemma":[0.9960063,0.00204707,0.000324598,0.001101815,0.0003266027,0.0001936189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000457216,0.00001565593,0.00008510288,0.00003697214,0.000004372112,0.00005239842,0.00009304665,0.00320902,0.001598723,0.9907081,0.0003199423,0.003830843],"study_design_scores_gemma":[0.00004238652,0.00005339224,0.0001029924,0.00004483224,0.0000150305,0.0001890998,0.00004308876,0.09460903,0.01390013,0.8836824,0.007283687,0.00003389706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09998409,0.0008149059,0.8615865,0.001820387,0.0001486055,0.0001219859,0.0002186116,0.0005891438,0.03471569],"genre_scores_gemma":[0.8879367,0.0007481623,0.09583329,0.0003893252,0.0001007995,0.0001913527,0.0002019334,0.0002178481,0.01438058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005957094,"threshold_uncertainty_score":0.01992846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158685441","doi":"10.4230/lipics.stacs.2012.601","title":"The Power of Local Search: Maximum Coverage over a Matroid","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Power (physics); Matroid partitioning; Computer science; Mathematics; Combinatorics; Graphic matroid; Physics","authors":[{"name":"Justin Ward","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01917763530506628,"gpt":0.260322615637854,"spread":0.2411449803327877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463957,0.000803374,0.001289213,0.001000303,0.0006751566,0.0012627,0.002242638,0.001150333,0.003288206],"category_scores_gemma":[0.007537836,0.0005965135,0.001223724,0.001571554,0.001244883,0.003036536,0.002047714,0.001568717,0.0007729079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001467302,"about_ca_system_score_gemma":0.001222685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003450392,"about_ca_topic_score_gemma":0.003917459,"domain_scores_codex":[0.9983799,0.0006528524,0.00004786616,0.0002490282,0.0004684216,0.0002019092],"domain_scores_gemma":[0.9967973,0.002059275,0.0002334072,0.0006322456,0.0001717376,0.0001062132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003812808,0.0002367727,0.001601604,0.000270906,0.00008035745,0.0002006986,0.0003204261,0.7586009,0.01090388,0.04586931,0.004959963,0.176574],"study_design_scores_gemma":[0.00003692352,0.0000774161,0.0001327583,0.00001458228,0.00001576095,0.00008660358,0.00002495206,0.9810929,0.002912942,0.01452027,0.001075907,0.000008869407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04202479,0.0004290287,0.9492443,0.0004756393,0.00001256074,0.00008904185,0.00007873353,0.001266803,0.006379072],"genre_scores_gemma":[0.4938725,0.0003152997,0.501862,0.0002062379,0.00004122263,0.000284479,0.0002369918,0.0003263934,0.002854956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003450392,"threshold_uncertainty_score":0.01100016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962752375","doi":"10.4230/lipics.icdt.2019.6","title":"A Formal Framework for Probabilistic Unclean Databases.","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Computer science; Tuple; Cardinality (data modeling); Database; Probabilistic database; Realization (probability); Data mining; Theoretical computer science; Database theory; Database design; Artificial intelligence; Mathematics","authors":[{"name":"Christopher De","is_ca":false},{"name":"Ihab F. Ilyas","is_ca":true},{"name":"Benny Kimelfeld","is_ca":false},{"name":"Christopher Ré","is_ca":false},{"name":"Theodoros Rekatsinas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1331143116709655,"gpt":0.405443553735199,"spread":0.2723292420642335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01664356,0.001736876,0.001560747,0.004538955,0.002910065,0.009443833,0.007617663,0.004219567,0.009494969],"category_scores_gemma":[0.03499837,0.002361881,0.006052098,0.005791965,0.008919773,0.01963958,0.01096869,0.009946758,0.002901128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004734007,"about_ca_system_score_gemma":0.005305792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006224689,"about_ca_topic_score_gemma":0.004551849,"domain_scores_codex":[0.9816391,0.005825458,0.002138463,0.003962256,0.005409418,0.001025351],"domain_scores_gemma":[0.9687572,0.01917444,0.002392842,0.005818984,0.002974364,0.0008822261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002112031,0.00002599408,0.0002551866,0.0001149257,0.00002729472,0.000131855,0.0002918835,0.009814603,0.0002905387,0.9777899,0.001532151,0.009704633],"study_design_scores_gemma":[0.00002373004,0.00002331513,0.00007767458,0.00008916252,0.00003004649,0.0002840674,0.0001021599,0.05013483,0.0005398064,0.9249571,0.02370533,0.00003292916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008294635,0.0005629461,0.9939103,0.001109821,0.00007170974,0.0001143903,0.0004585175,0.0002627785,0.002680094],"genre_scores_gemma":[0.1014207,0.001718685,0.8847226,0.001847651,0.0006301024,0.001321258,0.002252975,0.0003938925,0.005692112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01664356,"threshold_uncertainty_score":0.08802056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164928349","doi":"10.4230/lipics.tqc.2013.270","title":"The Quantum Entropy Cone of Stabiliser States","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Centre for Quantum Technologies; Grantová Agentura České Republiky; National Science Foundation; National University of Singapore; National Research Foundation; European Commission; Banff International Research Station for Mathematical Innovation and Discovery; Leverhulme Trust","keywords":"Stabiliser; Von Neumann entropy; Subadditivity; Inequality; Mathematics; Quantum relative entropy; Entropy (arrow of time); Monotonic function; Pure mathematics; Quantum; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics; Quantum discord; Quantum entanglement","authors":[{"name":"Noah Linden","is_ca":false},{"name":"František Matúš","is_ca":false},{"name":"Mary Beth Ruskai","is_ca":false},{"name":"Andreas Winter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01021544677544756,"gpt":0.2388327944280547,"spread":0.2286173476526072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271683,0.0004258261,0.0004386414,0.0009671269,0.0007284082,0.00191386,0.0008911077,0.0006718692,0.004625207],"category_scores_gemma":[0.003869887,0.0002400537,0.0003539123,0.0004929804,0.002501324,0.003328718,0.001712514,0.001495357,0.0002954829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008687927,"about_ca_system_score_gemma":0.0004104418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006256445,"about_ca_topic_score_gemma":0.0004706481,"domain_scores_codex":[0.9991931,0.0002089143,0.00003311198,0.00009787404,0.0002974837,0.0001695646],"domain_scores_gemma":[0.9981943,0.001043289,0.0002889409,0.0001369305,0.0001649875,0.0001714993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005995351,0.00002958029,0.0005822229,0.00003948885,0.00000900265,0.0001343983,0.0001507541,0.01753676,0.006463423,0.9716134,0.0002532714,0.003127891],"study_design_scores_gemma":[0.00001211262,0.00005241857,0.0008473396,0.00001596331,0.000004373468,0.00005437932,0.00007610879,0.1908302,0.004663256,0.8028916,0.0005281337,0.00002406059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.770305,0.0004429327,0.1821579,0.0008925663,0.00004718147,0.00005274719,0.0002426035,0.0001034387,0.04575574],"genre_scores_gemma":[0.9910253,0.0001241196,0.005761523,0.0000599479,0.00003306514,0.0000385827,0.00007624803,0.00002560945,0.00285571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004625207,"threshold_uncertainty_score":0.01547283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1895441878","doi":"10.4230/dagsemproc.06301.7","title":"Detection of Plagiarism in University Projects Using Metrics-based Spectral Similarity","year":2007,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Plagiarism detection; Similarity (geometry); Computer science; Spectral analysis; Source code; Data mining; Clan; Information retrieval; Artificial intelligence; Programming language; Physics","authors":[{"name":"Ettore Merlo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02642885969981242,"gpt":0.2678502540887758,"spread":0.2414213943889633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002543228,0.0005795935,0.001066194,0.01427349,0.000858112,0.001746208,0.0009041701,0.0008156213,0.001018724],"category_scores_gemma":[0.0206524,0.0002673377,0.0005403699,0.008216036,0.0007084139,0.00241819,0.001611441,0.0006302497,0.000737093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007712278,"about_ca_system_score_gemma":0.000704962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001222029,"about_ca_topic_score_gemma":0.001326515,"domain_scores_codex":[0.9939207,0.0009898143,0.0005598473,0.0008513083,0.00340765,0.0002707743],"domain_scores_gemma":[0.9833477,0.004986032,0.003432642,0.001927872,0.005551481,0.0007542248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009378669,0.0004036856,0.09253872,0.0005399409,0.0002845683,0.0004547162,0.001634252,0.01378039,0.09432578,0.006148288,0.003286421,0.7856653],"study_design_scores_gemma":[0.0001111305,0.001097794,0.2039321,0.0001117768,0.0001598586,0.004932876,0.001465527,0.6420588,0.1159069,0.01903327,0.01087236,0.0003175608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5270267,0.0008200661,0.463793,0.0002045934,0.00006234107,0.0002949605,0.0007783643,0.004055218,0.002964765],"genre_scores_gemma":[0.8299459,0.000194052,0.1675661,0.00002430027,0.00004033661,0.000178155,0.001110716,0.0001664407,0.000773883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9991844,"threshold_uncertainty_score":0.01345003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296156273","doi":"10.4230/lipics.icalp.2017.52","title":"Randomized Communication vs. Partition Number.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Partition (number theory); Randomized algorithm; Mathematics; Combinatorics; Clique; Upper and lower bounds; Set (abstract data type); Computational complexity theory; Discrete mathematics; Computer science; Algorithm","authors":[{"name":"Mika Göös","is_ca":false},{"name":"T. S. Jayram","is_ca":false},{"name":"Toniann Pitassi","is_ca":true},{"name":"Thomas Watson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04041832574937575,"gpt":0.2913102703181808,"spread":0.250891944568805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098421,0.002114249,0.002207789,0.001429739,0.002835635,0.005770423,0.005778044,0.003675864,0.01741627],"category_scores_gemma":[0.05888246,0.001183287,0.00173847,0.002675814,0.00442953,0.01451112,0.005381756,0.007054313,0.002469515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006085685,"about_ca_system_score_gemma":0.005341155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709994,"about_ca_topic_score_gemma":0.002963051,"domain_scores_codex":[0.985904,0.005184954,0.000419681,0.003072049,0.003241014,0.002178232],"domain_scores_gemma":[0.9079216,0.06762008,0.004852323,0.01524418,0.001916101,0.002445711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002998352,0.0007500749,0.002977524,0.0008314077,0.0002086255,0.0001874066,0.0003419768,0.2915904,0.01281713,0.5882291,0.0222651,0.0768029],"study_design_scores_gemma":[0.0002672469,0.0002947984,0.0007627283,0.00008278219,0.00009949033,0.0002146503,0.00007470095,0.5682288,0.006643204,0.4187803,0.004488216,0.00006306416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381128,0.003092665,0.7791209,0.01276439,0.0009700555,0.0007919366,0.00293452,0.003725063,0.05848772],"genre_scores_gemma":[0.8728389,0.0009222871,0.1117936,0.001951969,0.0007484359,0.000994492,0.001589724,0.0009450953,0.008215529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01741627,"threshold_uncertainty_score":0.05826324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567455550","doi":"10.4230/dagrep.4.2.38","title":"Graph Modification Problems (Dagstuhl Seminar 14071)","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Universität Ulm; Université de Montpellier; Universität Rostock; Korea Advanced Institute of Science and Technology; Technische Universität Berlin; University of Haifa; National and Kapodistrian University of Athens; Goethe-Universität Frankfurt am Main; Magyar Tudományos Akadémia; Universität Trier; Durham University; University of Oregon; Universitetet i Bergen; University of Leeds; Uniwersytet Warszawski; Indian Institute of Science; University of Toronto; University of Ioannina; Universiteit Maastricht","keywords":"Graph; Computer science; Theoretical computer science","authors":[{"name":"Hans L. Bodlaender","is_ca":false},{"name":"Pinar Heggernes","is_ca":false},{"name":"Daniel Lokshtanov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02362844855885657,"gpt":0.2844284748760495,"spread":0.260800026317193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232301,0.001339522,0.001064407,0.001625147,0.001637111,0.002818608,0.001487671,0.0022521,0.04356588],"category_scores_gemma":[0.00405857,0.000574113,0.001017825,0.002231752,0.001238767,0.002845882,0.002746913,0.004651709,0.01361291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003726732,"about_ca_system_score_gemma":0.00208246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001930917,"about_ca_topic_score_gemma":0.002575171,"domain_scores_codex":[0.9981434,0.0005330469,0.00007262609,0.0003560028,0.0006495696,0.0002453944],"domain_scores_gemma":[0.9988734,0.0004065855,0.00007912823,0.0001412719,0.0001806712,0.0003188329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002780871,0.0001647259,0.0002311994,0.0003486629,0.00003966352,0.0001590863,0.0001726151,0.002587808,0.001474223,0.279801,0.6052328,0.1095102],"study_design_scores_gemma":[0.0001660747,0.0001047284,0.001365341,0.000216948,0.00004017332,0.0002285789,0.0001031185,0.003815101,0.001874243,0.4976927,0.4943459,0.00004707702],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.04007286,0.07248122,0.14116,0.1708078,0.03539886,0.0005496682,0.009631948,0.003343712,0.526554],"genre_scores_gemma":[0.3553837,0.03471143,0.1117243,0.02016192,0.02037244,0.001277899,0.0215738,0.002288979,0.4325056],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.04356588,"threshold_uncertainty_score":0.1457424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964084063","doi":"10.4230/lipics.ecoop.2015.101","title":"Simple and Effective Type Check Removal through Lazy Basic Block Versioning","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Software versioning; Compiler; Just-in-time compilation; JavaScript; Type inference; Python (programming language); Toolchain; Parallel computing; Software; Inference","authors":[{"name":"Maxime Chevalier-Boisvert","is_ca":true},{"name":"Marc Feeley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02412128749120615,"gpt":0.2821698156898441,"spread":0.258048528198638,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245274,0.0006664536,0.0006227158,0.0007859045,0.0005116737,0.001318871,0.001575394,0.0004866387,0.002784564],"category_scores_gemma":[0.006099765,0.000729501,0.0008733806,0.0007249301,0.0009936871,0.002397746,0.001624945,0.00143763,0.001549437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004501653,"about_ca_system_score_gemma":0.001873678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001404115,"about_ca_topic_score_gemma":0.001742234,"domain_scores_codex":[0.9984157,0.0002884056,0.0001609525,0.0002541309,0.000671039,0.0002097541],"domain_scores_gemma":[0.9949023,0.001302922,0.000508986,0.002602808,0.000560087,0.0001229593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009608751,0.0002924692,0.02055181,0.0008150927,0.0001733808,0.0006508691,0.001029534,0.04144486,0.2870661,0.03351204,0.01164436,0.6018586],"study_design_scores_gemma":[0.0002276709,0.0005042346,0.0086745,0.0002331047,0.0002475985,0.001422263,0.0001546346,0.3973671,0.492489,0.03868454,0.05976366,0.0002316314],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09032282,0.0005337058,0.8584301,0.0001595606,0.0001175879,0.000161836,0.0002795529,0.04620769,0.003787153],"genre_scores_gemma":[0.4782031,0.0004258103,0.5034189,0.0002499444,0.00007703648,0.000186426,0.000808046,0.01190556,0.004725202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002784564,"threshold_uncertainty_score":0.009315252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1599413552","doi":"10.4230/lipics.stacs.2014.482","title":"An optimal quantum algorithm for the oracle identification problem","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum algorithm; Oracle; Algorithm; Mathematics; Matrix multiplication; Conjecture; Discrete mathematics; Reduction (mathematics); Quantum; Computer science","authors":[{"name":"Robin Kothari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01459900078775074,"gpt":0.2688054297050613,"spread":0.2542064289173106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750218,0.0007163361,0.001238708,0.0007629512,0.00146065,0.001786479,0.002492222,0.002533995,0.008709878],"category_scores_gemma":[0.007420434,0.0005214494,0.001028137,0.001123489,0.001851052,0.00501407,0.004058773,0.002852106,0.001949015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164971,"about_ca_system_score_gemma":0.003456751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090805,"about_ca_topic_score_gemma":0.00149178,"domain_scores_codex":[0.9972134,0.0006408812,0.0001774178,0.0008465188,0.0007820035,0.0003398098],"domain_scores_gemma":[0.9974422,0.001315626,0.0001406754,0.0006253782,0.0003372107,0.0001389012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008766205,0.0005223248,0.00101845,0.0003025838,0.0000885072,0.0001937892,0.0004450955,0.07970192,0.0171943,0.5342183,0.01745254,0.3479856],"study_design_scores_gemma":[0.000236113,0.0001174735,0.0002439691,0.0000272888,0.00003402042,0.0001780234,0.0000898244,0.5667415,0.01073241,0.4156796,0.005869098,0.00005067085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02060456,0.0001119103,0.9707569,0.001046924,0.00009562098,0.0001408856,0.0001376737,0.001465188,0.005640261],"genre_scores_gemma":[0.278413,0.0001207288,0.7123793,0.0005695114,0.0001112231,0.0003752924,0.0004891982,0.0003708072,0.007170861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008709878,"threshold_uncertainty_score":0.02913743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1499762049","doi":"10.4230/dfu.vol6.12191.21","title":"Pathfinding in Games","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Workgroup; Testbed; Computer science; Human–computer interaction; Toolbox; Artificial intelligence; World Wide Web; Shortest path problem; Theoretical computer science; Programming language","authors":[{"name":"Adi Botea","is_ca":false},{"name":"Bruno Bouzy","is_ca":false},{"name":"Michael Buro","is_ca":true},{"name":"Christian Bauckhage","is_ca":false},{"name":"Dana Nau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0205290463472283,"gpt":0.2652369112787808,"spread":0.2447078649315525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224052,0.001138923,0.0006651899,0.0009697414,0.001972096,0.004533002,0.001407019,0.001986162,0.01530842],"category_scores_gemma":[0.005613916,0.0004782061,0.0007978475,0.0008599607,0.003664828,0.006619875,0.004355549,0.001795332,0.002126207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001836155,"about_ca_system_score_gemma":0.001817508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008085561,"about_ca_topic_score_gemma":0.008027293,"domain_scores_codex":[0.9987987,0.0005944091,0.00007458259,0.000237011,0.0001860392,0.0001093705],"domain_scores_gemma":[0.9987413,0.0006890683,0.0001040079,0.0001431425,0.0001569606,0.0001655392],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007176461,0.00004274807,0.000540099,0.0003497466,0.00003304566,0.0001313298,0.002056466,0.02418215,0.0007451735,0.9015218,0.01085107,0.05947455],"study_design_scores_gemma":[0.00004802303,0.00006713354,0.0005031612,0.0002526396,0.00002736041,0.0002251841,0.001794225,0.05700536,0.0008488486,0.7255393,0.2136503,0.00003837698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04325051,0.005669332,0.7010915,0.008940444,0.0004961065,0.0004170898,0.0006656462,0.001598121,0.2378712],"genre_scores_gemma":[0.5551317,0.005848275,0.387197,0.0009699296,0.000170893,0.0007793811,0.001197469,0.0004943722,0.04821096],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01530842,"threshold_uncertainty_score":0.05121171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994217331","doi":"10.4230/lipics.stacs.2021.6","title":"A Unified Framework of Quantum Walk Search","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; Institute for Quantum Information and Matter, California Institute of Technology; Samsung; California Institute of Technology; National Science Foundation","keywords":"Quantum walk; Hitting time; Electric network; Quantum; Random walk; Computer science; Quantum algorithm; Operator (biology); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Physics; Quantum mechanics","authors":[{"name":"Simon Apers","is_ca":false},{"name":"András Gilyén","is_ca":false},{"name":"Stacey Jeffery","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01853019871031418,"gpt":0.2745284521993785,"spread":0.2559982534890644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181528,0.0011615,0.001501283,0.001723075,0.001427475,0.003707093,0.003216741,0.002597342,0.008826911],"category_scores_gemma":[0.006618276,0.0007468701,0.001711066,0.00169031,0.003611738,0.007934469,0.002899599,0.004136666,0.001491615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002304183,"about_ca_system_score_gemma":0.002221843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003278336,"about_ca_topic_score_gemma":0.002529188,"domain_scores_codex":[0.9980384,0.0007122611,0.00009188134,0.000352547,0.0005443927,0.0002605387],"domain_scores_gemma":[0.9970602,0.001620093,0.0001450847,0.0005807226,0.0004251602,0.0001686389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000110823,0.00001387836,0.00005886071,0.00003471981,0.000007921629,0.00002142991,0.00003769105,0.03063199,0.0003503172,0.9627155,0.0007313953,0.005385247],"study_design_scores_gemma":[0.00001689345,0.00002820182,0.00004689855,0.0000183786,0.000007468756,0.00002535274,0.00001912768,0.2371793,0.0002030301,0.7581915,0.004247483,0.00001630036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004156321,0.0008691737,0.9807751,0.0008369447,0.0001130306,0.0000602078,0.0001003078,0.0001693393,0.01291946],"genre_scores_gemma":[0.3408738,0.003471374,0.6388016,0.0008448323,0.0008292925,0.0005564525,0.0003197184,0.0003278,0.01397522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008826911,"threshold_uncertainty_score":0.02952898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2412311009","doi":"10.4230/lipics.fun.2016.13","title":"Super Mario Bros. is Harder/Easier Than We Thought","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"PSPACE; Constant (computer programming); Mathematical proof; Video game; Time complexity; Combinatorics; Mathematics; Computational complexity theory; Computer science; State (computer science); Discrete mathematics; Algorithm; Multimedia","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Giovanni Viglietta","is_ca":true},{"name":"Aaron Williams","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02679281900818871,"gpt":0.2707790672997005,"spread":0.2439862482915118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005197686,0.0008697171,0.0007528655,0.0002853489,0.001522856,0.002081751,0.001389198,0.001472154,0.02650303],"category_scores_gemma":[0.003795123,0.0006616574,0.001620738,0.0003848292,0.001586307,0.005503809,0.002256192,0.003250567,0.003383053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125635,"about_ca_system_score_gemma":0.001084037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006044473,"about_ca_topic_score_gemma":0.01047175,"domain_scores_codex":[0.9990337,0.0001541695,0.00004818702,0.0003277917,0.0001814388,0.0002547098],"domain_scores_gemma":[0.9985867,0.0006158996,0.0001636791,0.0002925906,0.0001314509,0.0002097798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001708066,0.0004227826,0.006374543,0.001875364,0.000282081,0.001887878,0.002396545,0.03752468,0.02813716,0.6293534,0.1351237,0.1549138],"study_design_scores_gemma":[0.0001533115,0.0002519234,0.004949011,0.0003708153,0.0001261301,0.001314267,0.001855882,0.08091977,0.008518229,0.6739564,0.2274554,0.0001288707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2407025,0.001500236,0.3936582,0.037497,0.001894566,0.0009483896,0.006626768,0.005557371,0.311615],"genre_scores_gemma":[0.714531,0.0008245797,0.1721417,0.005826294,0.0002652736,0.0003534155,0.003880275,0.001377093,0.1008004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02650303,"threshold_uncertainty_score":0.08866143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964334818","doi":"10.4230/lipics.socg.2016.19","title":"On Visibility Representations of Non-Planar Graphs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Embedding; Book embedding; Time complexity; Mathematics; Discrete mathematics; Rectangle; Visibility; 1-planar graph; Computer science; Graph; Chordal graph; Geometry; Artificial intelligence; Physics","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Fabrizio Montecchiani","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01313978758595751,"gpt":0.2759873943598449,"spread":0.2628476067738874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309733,0.001108272,0.0008920375,0.001206589,0.0006680819,0.002619015,0.001948365,0.001320347,0.005358356],"category_scores_gemma":[0.01104157,0.0006949585,0.001161732,0.002461263,0.002041405,0.006857023,0.002689622,0.00252071,0.000846291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001161126,"about_ca_system_score_gemma":0.0005307351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265216,"about_ca_topic_score_gemma":0.001310344,"domain_scores_codex":[0.9974497,0.0007913969,0.0001897544,0.0006242903,0.0005912244,0.0003536306],"domain_scores_gemma":[0.9902045,0.006196363,0.001308205,0.001617127,0.0004377085,0.0002361229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007375189,0.0003053957,0.002420039,0.0005486049,0.00007147672,0.0006588648,0.001221416,0.3195478,0.02108606,0.4963643,0.005534408,0.1515042],"study_design_scores_gemma":[0.0001030345,0.0002002144,0.0007141628,0.0001082751,0.00003842457,0.0003873194,0.0003127877,0.433873,0.007709332,0.5511704,0.005334619,0.00004838375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1646931,0.0006902347,0.8249366,0.0008692947,0.00006315158,0.000156368,0.0007693005,0.001254092,0.006567756],"genre_scores_gemma":[0.6894175,0.001116273,0.3006442,0.0002649057,0.000163816,0.0002720275,0.003418238,0.000440324,0.004262832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005358356,"threshold_uncertainty_score":0.0179255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037695460","doi":"10.4230/lipics.icalp.2020.85","title":"Proportionally Fair Clustering Revisited","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Metric space; Mathematics; Centroid; Combinatorics; Metric (unit); Generalization; Discrete mathematics; Cluster (spacecraft); Approximation algorithm; k-medians clustering; Correlation clustering; Computer science; CURE data clustering algorithm; Statistics; Geometry","authors":[{"name":"Evi Micha","is_ca":true},{"name":"Nisarg Shah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03339787288379148,"gpt":0.2676198671543172,"spread":0.2342219942705257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004914843,0.001161456,0.001821777,0.001114822,0.003121925,0.002978511,0.004432275,0.00311694,0.006324113],"category_scores_gemma":[0.01725073,0.0005642354,0.001295165,0.002236614,0.003639172,0.007310608,0.003625576,0.003803462,0.001133228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004931226,"about_ca_system_score_gemma":0.002801156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005329821,"about_ca_topic_score_gemma":0.003166778,"domain_scores_codex":[0.9945168,0.001712559,0.000171319,0.00144681,0.001485997,0.0006665598],"domain_scores_gemma":[0.9926041,0.004047407,0.0003976685,0.001670354,0.0008867771,0.0003937106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001839692,0.00009661648,0.0007052392,0.0001456015,0.00007370656,0.0001446133,0.0004013891,0.2093722,0.00127838,0.7260173,0.007329776,0.05425123],"study_design_scores_gemma":[0.00004085439,0.0000668856,0.0002048403,0.00003254026,0.00002730411,0.0002049002,0.0001055103,0.5327991,0.001631508,0.4528675,0.01198112,0.00003780771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01790575,0.002205377,0.956822,0.002369606,0.0005307914,0.000141671,0.0001142905,0.0003124232,0.01959801],"genre_scores_gemma":[0.7546905,0.002070896,0.2172295,0.001422407,0.001085031,0.0002253377,0.0002233537,0.0003311804,0.02272186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006324113,"threshold_uncertainty_score":0.0357787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023180869","doi":"10.4230/lipics.tqc.2020.8","title":"Simpler Proofs of Quantumness","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Canadian Institute for Advanced Research; Multidisciplinary University Research Initiative; European Commission; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; National Science Foundation","keywords":"Mathematical proof; Computer science; Oracle; Learning with errors; Theoretical computer science; Random oracle; Hash function; Cryptography; Heuristic; Property (philosophy); Cryptographic primitive; Function (biology); Quantum computer; Quantum; Algorithm; Cryptographic protocol; Mathematics; Encryption; Public-key cryptography; Artificial intelligence; Computer security; Programming language","authors":[{"name":"Zvika Brakerski","is_ca":false},{"name":"Venkata Koppula","is_ca":false},{"name":"Umesh Vazirani","is_ca":false},{"name":"Thomas Vidick","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03765500163756597,"gpt":0.2865085311426028,"spread":0.2488535295050368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007110254,0.001018481,0.001150845,0.001904696,0.001896662,0.005040388,0.002547268,0.002668887,0.03171939],"category_scores_gemma":[0.0206426,0.0007383378,0.002035203,0.001301665,0.006326619,0.01348751,0.007393958,0.007818874,0.004887346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002521789,"about_ca_system_score_gemma":0.001688911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004927452,"about_ca_topic_score_gemma":0.0004092343,"domain_scores_codex":[0.9923855,0.002427336,0.0004500523,0.00144977,0.002569954,0.0007173704],"domain_scores_gemma":[0.9782727,0.01266019,0.0008634332,0.005748083,0.001967885,0.0004877454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003060447,0.00003490443,0.00006067671,0.000206848,0.00001598532,0.00007731785,0.0001875592,0.0008668968,0.001804213,0.9833995,0.003635354,0.009679984],"study_design_scores_gemma":[0.00004566825,0.00004877498,0.000100152,0.00007695102,0.00001221127,0.000111726,0.00004429773,0.003087461,0.003488587,0.9642024,0.02874825,0.000033569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03178738,0.005638523,0.785749,0.01574983,0.002927026,0.0003129633,0.0008906456,0.002040634,0.154904],"genre_scores_gemma":[0.6339608,0.004008899,0.3047272,0.007438681,0.002659773,0.0007586514,0.0009543084,0.001117346,0.04437442],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03171939,"threshold_uncertainty_score":0.1061119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034373981","doi":"10.4230/lipics.cpm.2021.13","title":"A Fast and Small Subsampled R-Index","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03198763216395205,"gpt":0.256348860827089,"spread":0.2243612286631369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173068,0.001763419,0.001945003,0.002566265,0.001412545,0.002381641,0.00331614,0.001245016,0.01954069],"category_scores_gemma":[0.007769736,0.0007224879,0.001425388,0.004123377,0.0007924621,0.004375838,0.003918101,0.001624468,0.02284185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007653,"about_ca_system_score_gemma":0.002562434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00494125,"about_ca_topic_score_gemma":0.007068627,"domain_scores_codex":[0.997983,0.0001892438,0.0001727484,0.0004276476,0.001053959,0.0001734566],"domain_scores_gemma":[0.9972459,0.0004350775,0.0001737308,0.001192155,0.0007876542,0.0001654391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001275891,0.0002611743,0.002110091,0.0005002707,0.0001590254,0.0005793625,0.0003372502,0.01513049,0.03523492,0.02102612,0.1358575,0.7875279],"study_design_scores_gemma":[0.0007510658,0.0008332105,0.003006332,0.0001790056,0.0001997708,0.002370932,0.0004445485,0.6185625,0.08344088,0.08038123,0.2094065,0.0004240245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02526711,0.002983943,0.8828052,0.0009141923,0.00084799,0.0005524734,0.007261424,0.06704502,0.01232261],"genre_scores_gemma":[0.06797004,0.0006849946,0.8895251,0.0006411357,0.0002846306,0.0006105216,0.01903319,0.004338296,0.01691219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01954069,"threshold_uncertainty_score":0.06537014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963859684","doi":"10.4230/lipics.itcs.2018.22","title":"Convergence Results for Neural Networks via Electrodynamics","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Gradient descent; Electron; Convergence (economics); Node (physics); Artificial neural network; Physics; Function (biology); Equivalence (formal languages); Descent (aeronautics); Mathematics; Topology (electrical circuits); Computer science; Mathematical analysis; Quantum mechanics; Combinatorics; Discrete mathematics; Artificial intelligence","authors":[{"name":"Rina Panigrahy‎","is_ca":false},{"name":"Ali Rahimi","is_ca":false},{"name":"Sushant Sachdeva","is_ca":true},{"name":"Qiuyi Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01146829422794097,"gpt":0.2544976077305464,"spread":0.2430293135026054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397285,0.001856146,0.001128846,0.001707893,0.0009388394,0.001425472,0.001929266,0.002577269,0.005157313],"category_scores_gemma":[0.02261153,0.0007511894,0.001328512,0.0008387016,0.003356696,0.004412599,0.003656556,0.004253359,0.0009110034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002155797,"about_ca_system_score_gemma":0.001076618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003011075,"about_ca_topic_score_gemma":0.002205743,"domain_scores_codex":[0.9987483,0.000567292,0.00006137496,0.0002298362,0.0002703067,0.0001229095],"domain_scores_gemma":[0.9908,0.007272431,0.0003967705,0.0003488952,0.0009107307,0.0002712109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001060605,0.00006860981,0.001376264,0.0002892754,0.0001293231,0.0001276296,0.0002345257,0.345319,0.001998337,0.622111,0.003124611,0.02511549],"study_design_scores_gemma":[0.00001578851,0.00004415398,0.0001583753,0.00004221238,0.00001202125,0.00002812382,0.00001828104,0.7661498,0.0004180325,0.2321002,0.001002228,0.00001095795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02742666,0.003046585,0.9432549,0.003245241,0.000201249,0.00007777745,0.0001334329,0.0003803124,0.0222338],"genre_scores_gemma":[0.7511125,0.00433744,0.2119597,0.001901687,0.0006519299,0.000812265,0.0005180222,0.0005958477,0.02811072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005157313,"threshold_uncertainty_score":0.02325535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2495677458","doi":"10.4230/lipics.icalp.2016.69","title":"Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bounded function; Linear programming relaxation; Sigma; Outlier; Mathematics; Upper and lower bounds; Relaxation (psychology); Cluster analysis; Algorithm; Discrete mathematics; Linear programming; Physics; Mathematical analysis; Statistics","authors":[{"name":"Sara Ahmadian","is_ca":true},{"name":"Chaitanya Swamy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03067713943686306,"gpt":0.2454111956609366,"spread":0.2147340562240735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007313291,0.004262058,0.004701941,0.002827642,0.002118966,0.004564434,0.006193941,0.004609143,0.004921614],"category_scores_gemma":[0.03234944,0.001738302,0.003450759,0.007019785,0.002678503,0.007748715,0.004742307,0.007776896,0.00194167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006224144,"about_ca_system_score_gemma":0.003901611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01180648,"about_ca_topic_score_gemma":0.01063986,"domain_scores_codex":[0.9922518,0.002781534,0.0004778492,0.001510628,0.001809435,0.001168772],"domain_scores_gemma":[0.9808753,0.01290627,0.001558089,0.00221706,0.00177466,0.000668649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002919131,0.0001693995,0.0008056052,0.0004163246,0.000167911,0.00006898067,0.0002133251,0.9052807,0.0005926255,0.04142688,0.007003006,0.04356336],"study_design_scores_gemma":[0.00003221838,0.00003143407,0.00008882014,0.00003245176,0.00001830502,0.00003366529,0.00004462939,0.9614031,0.0002662487,0.03685238,0.001185986,0.00001080246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008035978,0.002040241,0.9839759,0.001060075,0.0001364448,0.0001135036,0.0002638731,0.0008023508,0.003571546],"genre_scores_gemma":[0.2673347,0.002704504,0.719062,0.001054248,0.0005428895,0.0006893944,0.002227528,0.0008506328,0.005534115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01180648,"threshold_uncertainty_score":0.04515952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953924437","doi":"10.4230/lipics.fscd.2019.27","title":"Hilbert’s Tenth Problem in Coq","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Diophantine equation; Recursively enumerable language; Computability; Constructive; Recursively enumerable set; Diophantine set; Mathematics; Proof assistant; Discrete mathematics; Type (biology); Algebra over a field; Computer science; Calculus (dental); Pure mathematics; Programming language; Mathematical proof","authors":[{"name":"Dominique Larchey-Wendling","is_ca":true},{"name":"Yannick Forster","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01939949537691218,"gpt":0.2582195057091013,"spread":0.2388200103321892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060836,0.0004671964,0.0005158333,0.001120207,0.001792567,0.002704456,0.001271705,0.001383799,0.009874287],"category_scores_gemma":[0.005312913,0.0003585238,0.0009219847,0.001013746,0.00670225,0.008009917,0.003460321,0.00397612,0.001576539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002312821,"about_ca_system_score_gemma":0.001236762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00225726,"about_ca_topic_score_gemma":0.001545996,"domain_scores_codex":[0.9987024,0.0003287457,0.00006205152,0.0003030269,0.0003623729,0.0002413643],"domain_scores_gemma":[0.9973546,0.001669973,0.0001241328,0.0004007939,0.0003381564,0.0001124193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009373578,0.000004047293,0.00009149216,0.00001806325,0.000002070973,0.00003455281,0.0001284518,0.0004184032,0.0001790954,0.9962288,0.0006828756,0.002202905],"study_design_scores_gemma":[0.00000906043,0.000007208768,0.00008652464,0.00001308629,0.000004097245,0.00007477815,0.00008215233,0.004150251,0.001254629,0.9827848,0.01152318,0.00001012163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08894397,0.001224315,0.7486078,0.01016966,0.0007848458,0.000108385,0.00059511,0.001066077,0.1484998],"genre_scores_gemma":[0.8722721,0.0006078218,0.09470006,0.00134332,0.0003478977,0.0001437574,0.0003605428,0.0004216067,0.02980288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009874287,"threshold_uncertainty_score":0.03303277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965627508","doi":"10.4230/lipics.ecrts.2019.4","title":"PREM-Based Optimal Task Segmentation Under Fixed Priority Scheduling","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Compiler; Computation; Parallel computing; Scheduling (production processes); Task (project management); Task analysis; Theoretical computer science; Algorithm; Programming language; Mathematical optimization","authors":[{"name":"Muhammad Refaat Sedky Soliman","is_ca":true},{"name":"Rodolfo Pellizzoni","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01253958398344384,"gpt":0.2631112749119384,"spread":0.2505716909284945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009853,0.0008515923,0.0008508335,0.000860336,0.0005782709,0.0008783345,0.00129079,0.0006121268,0.002172819],"category_scores_gemma":[0.002380634,0.000470546,0.0004646079,0.0007260366,0.0006498317,0.0008871158,0.0007187181,0.0008089076,0.0004658658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001172924,"about_ca_system_score_gemma":0.002850826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003637491,"about_ca_topic_score_gemma":0.005731358,"domain_scores_codex":[0.9992551,0.0001700451,0.00003690596,0.0001869008,0.0001514969,0.0001994752],"domain_scores_gemma":[0.9990383,0.0004363234,0.0001179572,0.0001595332,0.0001493377,0.00009855635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009295988,0.0002324221,0.00171105,0.0002277476,0.00004346365,0.0001638031,0.0002118788,0.7526582,0.02530563,0.01715849,0.004977051,0.1963807],"study_design_scores_gemma":[0.0000349632,0.00008431827,0.0001919859,0.000009297606,0.00001216499,0.00003084889,0.00002763415,0.9870535,0.004065073,0.007586991,0.0008958923,0.000007374826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09012143,0.0006572437,0.8995957,0.000246074,0.00009425954,0.0001598741,0.0001826598,0.003320201,0.005622521],"genre_scores_gemma":[0.629776,0.0001471061,0.3671968,0.000149922,0.00003403129,0.0001393785,0.0003464514,0.0003826467,0.001827698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003637491,"threshold_uncertainty_score":0.008510232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886070095","doi":"10.4230/lipics.ecoop.2018.18","title":"ThingsMigrate: Platform-Independent Migration of Stateful JavaScript IoT Applications","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Institute for Computing, Information and Cognitive Systems","keywords":"Stateful firewall; Computer science; JavaScript; Cloud computing; Unobtrusive JavaScript; Middleware (distributed applications); Operating system; Programmer; Rich Internet application; Virtual machine; State (computer science); AspectJ; Internet of Things; Distributed computing; Embedded system; Programming language; Software; Computer network","authors":[{"name":"Julien Gascon‐Samson","is_ca":true},{"name":"Kumseok Jung","is_ca":true},{"name":"Shivanshu Goyal","is_ca":true},{"name":"Armin Rezaiean‐Asel","is_ca":true},{"name":"Karthik Pattabiraman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01615054406101783,"gpt":0.2538347034134585,"spread":0.2376841593524407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008443946,0.001202407,0.0004596326,0.0005121988,0.000469251,0.001122671,0.00201185,0.0008533749,0.001763994],"category_scores_gemma":[0.003185307,0.0007405293,0.0006090283,0.0003414355,0.0007169771,0.001541085,0.002247744,0.001499432,0.0009070194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004115266,"about_ca_system_score_gemma":0.0008521643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001209882,"about_ca_topic_score_gemma":0.001170803,"domain_scores_codex":[0.9990711,0.0001086471,0.00009223335,0.0002251759,0.0003393081,0.0001635883],"domain_scores_gemma":[0.9983553,0.0002788817,0.0001580604,0.0008261707,0.0002049461,0.0001765429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003052693,0.001285777,0.01929365,0.001020891,0.0005291468,0.002104661,0.002248353,0.04897377,0.4448436,0.01387909,0.06167038,0.401098],"study_design_scores_gemma":[0.0007075447,0.0008620601,0.01624976,0.0001674542,0.0001972224,0.00120546,0.0003077403,0.5100378,0.3580959,0.007410683,0.1044254,0.0003330361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2498718,0.0009767379,0.4292468,0.0004123999,0.0007907214,0.0007928108,0.0008171126,0.304484,0.01260749],"genre_scores_gemma":[0.8124716,0.0004921264,0.1570787,0.0006073074,0.0001069134,0.0003685588,0.003186075,0.01536516,0.01032353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00201185,"threshold_uncertainty_score":0.005901158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2787986197","doi":"10.4230/lipics.icalp.2018.141","title":"The Beta-Bernoulli process and algebraic effects","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Engineering and Physical Sciences Research Council; Ministry of Science and ICT, South Korea","keywords":"Bernoulli's principle; Computer science; Bernoulli process; Algebraic number; Theoretical computer science; Process (computing); Semantics (computer science); Bayesian probability; Block (permutation group theory); Mathematics; Algebra over a field; Programming language; Artificial intelligence; Pure mathematics","authors":[{"name":"Sam Staton","is_ca":false},{"name":"Dario Stein","is_ca":false},{"name":"Hongseok Yang","is_ca":true},{"name":"Nathanael Ackerman","is_ca":false},{"name":"Cameron E. Freer","is_ca":false},{"name":"Daniel M. Roy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01377090671736057,"gpt":0.2611088724838626,"spread":0.247337965766502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005539894,0.0006262831,0.0006942873,0.001969459,0.001587539,0.00415714,0.001340604,0.00139691,0.005418338],"category_scores_gemma":[0.01492831,0.0005789853,0.001429946,0.001745502,0.007173889,0.01124412,0.00356467,0.004271294,0.0007921944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939896,"about_ca_system_score_gemma":0.001614239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243146,"about_ca_topic_score_gemma":0.000847815,"domain_scores_codex":[0.9960158,0.001368954,0.0002020739,0.0006046458,0.001526241,0.0002822271],"domain_scores_gemma":[0.9897082,0.006635726,0.00109098,0.0009659625,0.001185842,0.0004133741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002522529,0.00000251395,0.00007329749,0.000007815856,0.000002059161,0.0000151532,0.00004126678,0.0006632896,0.00006548494,0.9979085,0.00008377081,0.001134501],"study_design_scores_gemma":[0.000005485615,0.00000761993,0.00005658336,0.00001422366,0.000006449477,0.00006144989,0.00002097115,0.007596694,0.0002059426,0.9882734,0.003742713,0.000008451549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01617216,0.0006694632,0.9616283,0.002114976,0.0001454922,0.00003509108,0.00009939264,0.0001025308,0.01903264],"genre_scores_gemma":[0.6403246,0.002492448,0.3376846,0.001396788,0.0008398533,0.0003377375,0.0001828772,0.0002692938,0.01647175],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005539894,"threshold_uncertainty_score":0.02929813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2224071963","doi":"10.4230/lipics.tqc.2015.147","title":"Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Random oracle; Computer science; Schnorr signature; Oracle; Quantum; Theoretical computer science; Quantum computer; Signature (topology); Cryptography; Provable security; Algorithm; Digital signature; Mathematics; Hash function; Encryption; Blind signature; Public-key cryptography; Computer security; Programming language; Quantum mechanics; Physics","authors":[{"name":"Edward Eaton","is_ca":true},{"name":"Fang Song","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06318378054687857,"gpt":0.3127094173486242,"spread":0.2495256368017456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003191773,0.0006754671,0.0009180575,0.0007300966,0.001048382,0.00293799,0.001640079,0.001849527,0.003227478],"category_scores_gemma":[0.007891372,0.0005796587,0.00169241,0.001232685,0.006657368,0.01058572,0.004119613,0.005848511,0.0008955085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578793,"about_ca_system_score_gemma":0.001582582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006453398,"about_ca_topic_score_gemma":0.0003904324,"domain_scores_codex":[0.9951332,0.001459473,0.0003012037,0.0008212409,0.001604636,0.0006802848],"domain_scores_gemma":[0.994669,0.002298502,0.0004104056,0.002155404,0.0002816032,0.0001850247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007520649,0.00003783078,0.0001302457,0.00003965092,0.00001597358,0.0001097375,0.0002008339,0.01299505,0.002798371,0.9751827,0.0006514799,0.007763056],"study_design_scores_gemma":[0.00004688289,0.00003611673,0.00009725634,0.00001530808,0.00002717004,0.00009917397,0.00002996319,0.06483987,0.01050345,0.9194244,0.004845384,0.00003508618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05609186,0.0001683471,0.9299299,0.002058711,0.0001162645,0.0001060275,0.0001774017,0.001056034,0.01029552],"genre_scores_gemma":[0.8091501,0.0006038346,0.1786016,0.0007239921,0.0002207828,0.0002620209,0.0003546616,0.0003730293,0.009709939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003227478,"threshold_uncertainty_score":0.01687992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3133750907","doi":"10.4230/lipics.socg.2017.28","title":"Dynamic Orthogonal Range Searching on the RAM, Revisited","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Combinatorics; Binary logarithm; Log-log plot; Range (aeronautics); Data structure; Mathematics; Upper and lower bounds; Computational geometry; Amortized analysis; Constant (computer programming); Word (group theory); Algorithm; Computer science; Geometry; Mathematical analysis","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Konstantinos Tsakalidis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02503697079969792,"gpt":0.2930977348193112,"spread":0.2680607640196133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017735,0.0009036745,0.001738868,0.001529017,0.0008619669,0.002653154,0.003486431,0.001225526,0.005661551],"category_scores_gemma":[0.0112023,0.0006761334,0.0007047387,0.00427645,0.002470225,0.01352037,0.005782412,0.002140424,0.001890817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009579449,"about_ca_system_score_gemma":0.0008059089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370321,"about_ca_topic_score_gemma":0.001264935,"domain_scores_codex":[0.9973848,0.0006646058,0.00015871,0.0005995284,0.0008176701,0.0003745718],"domain_scores_gemma":[0.993679,0.002428922,0.0006369082,0.00268287,0.0003479909,0.0002242775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001215478,0.000332112,0.003659619,0.0006129055,0.0001092129,0.0004570479,0.0009127282,0.1120096,0.0179834,0.4845689,0.02220003,0.3559391],"study_design_scores_gemma":[0.0001180977,0.0005154902,0.0008442489,0.0001223181,0.00006581232,0.001135324,0.000414044,0.632917,0.01455331,0.3232883,0.0259161,0.000110032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1257092,0.005771958,0.8400382,0.00339275,0.0003742262,0.0001581201,0.0007538279,0.002747645,0.02105406],"genre_scores_gemma":[0.6342789,0.003209371,0.350033,0.0009677081,0.0005857256,0.00028982,0.0008355916,0.000443729,0.009356193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005661551,"threshold_uncertainty_score":0.01893973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907584067","doi":"10.4230/lipics.isaac.2018.67","title":"Succinct Data Structures for Chordal Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Chordal graph; Computer science; Interval graph; Theoretical computer science; Graph; 1-planar graph","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Kaiyu Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04590123781032047,"gpt":0.3401335636795662,"spread":0.2942323258692457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001888101,0.0009374458,0.001387185,0.001348751,0.001171984,0.003026527,0.003780999,0.001399311,0.006399553],"category_scores_gemma":[0.01385807,0.000727559,0.0008522081,0.003873676,0.001580252,0.01308602,0.003415612,0.002223665,0.00137629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002581466,"about_ca_system_score_gemma":0.001837585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001734607,"about_ca_topic_score_gemma":0.00276375,"domain_scores_codex":[0.9972059,0.0004816751,0.0004729351,0.000503525,0.001050572,0.0002853597],"domain_scores_gemma":[0.9863418,0.004802834,0.001253478,0.006023081,0.001238168,0.0003406894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003228726,0.000622884,0.006442609,0.001963784,0.0001661939,0.0003849885,0.001270665,0.1758824,0.03046871,0.3627348,0.04191531,0.3749189],"study_design_scores_gemma":[0.0003502938,0.000599869,0.0007697047,0.000235755,0.0001072898,0.0005150294,0.0005790727,0.4291629,0.04037671,0.495616,0.03155696,0.0001303844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.10426,0.001948801,0.8716367,0.002543391,0.0003097157,0.0004300984,0.006767253,0.007421229,0.00468277],"genre_scores_gemma":[0.5503799,0.001135297,0.4329083,0.0008490313,0.0002243652,0.0006574321,0.008722457,0.0005276825,0.004595509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006399553,"threshold_uncertainty_score":0.02140862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296549964","doi":"10.4230/lipics.socg.2015.719","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic algorithm; Computational geometry; Algorithm; Voronoi diagram; Combinatorics; Mathematics; Time complexity; Regular polygon; Dynamic programming; Randomized algorithm; Linear programming; Approximation algorithm; Mathematical optimization; Computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Konstantinos Tsakalidis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04233832791099378,"gpt":0.2922397059483311,"spread":0.2499013780373373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00139955,0.00128287,0.001552681,0.0012045,0.001297737,0.002210984,0.003052979,0.001827285,0.01044427],"category_scores_gemma":[0.007954277,0.001174583,0.002198037,0.002017564,0.001455201,0.003494218,0.00428244,0.00226813,0.002309734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002390318,"about_ca_system_score_gemma":0.002496128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00358453,"about_ca_topic_score_gemma":0.006978776,"domain_scores_codex":[0.9978889,0.0003448903,0.0002040431,0.0005219411,0.0006645594,0.0003756659],"domain_scores_gemma":[0.9952583,0.002400568,0.0003692613,0.001327492,0.000457727,0.0001867437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004636951,0.0002188489,0.001476012,0.0005223179,0.00007442643,0.00009135385,0.0002291275,0.4397383,0.006674679,0.1653202,0.01251194,0.3726791],"study_design_scores_gemma":[0.000109154,0.00009158828,0.0003012461,0.00004127613,0.00003631956,0.00009544023,0.0000719301,0.8265741,0.003669786,0.162186,0.006789104,0.00003409253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0109305,0.0002517407,0.9832181,0.0002387845,0.00005425466,0.00009312348,0.0002269541,0.0009539272,0.004032724],"genre_scores_gemma":[0.1149838,0.0002716216,0.8798372,0.0001507037,0.00003602252,0.0002873937,0.000825941,0.0003737592,0.003233486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01044427,"threshold_uncertainty_score":0.03493953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963552320","doi":"10.4230/lipics.icalp.2018.31","title":"Orthogonal Point Location and Rectangle Stabbing Queries in 3-d","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Rectangle; Data structure; Disjoint sets; Point location; Combinatorics; Recursion (computer science); Linear space; Computer science; Logarithm; Pointer (user interface); Binary logarithm; Time complexity; Mathematics; Discrete mathematics; Point (geometry); Algorithm; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":false},{"name":"Yakov Nekrich","is_ca":true},{"name":"Saladi Rahul","is_ca":false},{"name":"Konstantinos Tsakalidis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01140972599290588,"gpt":0.2488259606362195,"spread":0.2374162346433136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001522662,0.00160381,0.002663713,0.001677821,0.002280636,0.004213249,0.004998465,0.003112992,0.01429236],"category_scores_gemma":[0.008834611,0.001085176,0.0020655,0.007578013,0.002533094,0.01506465,0.008696923,0.002960621,0.006122561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00276793,"about_ca_system_score_gemma":0.002393303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007410379,"about_ca_topic_score_gemma":0.008150823,"domain_scores_codex":[0.9945898,0.0006995974,0.0006141187,0.0013168,0.001766859,0.001012838],"domain_scores_gemma":[0.9922854,0.00241002,0.0006280042,0.003638718,0.000741135,0.0002967597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002793165,0.0006431795,0.005619751,0.001270084,0.0001805342,0.0005854829,0.001620668,0.1639264,0.03634725,0.293213,0.06154446,0.432256],"study_design_scores_gemma":[0.0003443557,0.0005671311,0.001317351,0.0001241068,0.0001072066,0.000787063,0.001046192,0.6450471,0.03590453,0.2657385,0.04881742,0.0001989714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1000102,0.001969947,0.8653846,0.001899465,0.0003470158,0.0002952452,0.002856526,0.01050138,0.01673567],"genre_scores_gemma":[0.3819142,0.00092818,0.593847,0.001037407,0.0003169377,0.0005454811,0.005736363,0.001430367,0.01424411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01429236,"threshold_uncertainty_score":0.0478127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3011330615","doi":"10.4230/lipics.opodis.2019.25","title":"On Memory, Communication, and Synchronous Schedulers When Moving and Computing","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Strategic International Collaborative Research Program; Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Constant (computer programming); Focus (optics); Shared memory; Euclidean geometry; Distributed computing; Theoretical computer science; Artificial intelligence; Parallel computing; Mathematics; Programming language","authors":[{"name":"Paola Flocchini","is_ca":true},{"name":"Nicola Santoro","is_ca":true},{"name":"Koichi Wada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519221613903183,"gpt":0.232456800512032,"spread":0.2172645843730002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003221138,0.0009397034,0.0008875795,0.001191037,0.001859946,0.002739264,0.002153617,0.001379818,0.004845106],"category_scores_gemma":[0.01553132,0.0005299991,0.0009085044,0.001600043,0.006570325,0.01012026,0.003375886,0.002759212,0.0005175464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002666828,"about_ca_system_score_gemma":0.002084396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003670407,"about_ca_topic_score_gemma":0.002800987,"domain_scores_codex":[0.9968035,0.001135554,0.0001266673,0.0004948514,0.000752304,0.0006871046],"domain_scores_gemma":[0.9883598,0.008388852,0.0009520525,0.001366735,0.000461349,0.0004711981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001013337,0.0000429562,0.0005948736,0.00007716764,0.00001374818,0.0001168661,0.0003781317,0.03833994,0.0009261339,0.9493648,0.0009851239,0.009058883],"study_design_scores_gemma":[0.00005178047,0.000105393,0.0003597782,0.00003749969,0.00003323432,0.0001138434,0.0001837112,0.3102876,0.001635639,0.6813664,0.005793729,0.0000314601],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1370443,0.003139512,0.8055553,0.004407726,0.0004167742,0.0001916434,0.0001561295,0.0006608088,0.0484278],"genre_scores_gemma":[0.8949156,0.001849607,0.0916516,0.0007659061,0.0008437382,0.0003110966,0.00009212104,0.0002448354,0.009325442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004845106,"threshold_uncertainty_score":0.01934928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2245114686","doi":"10.4230/lipics.stacs.2009.1835","title":"Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Bounded function; Steiner tree problem; Combinatorics; Planar graph; Pathwidth; Mathematics; Genus; Chordal graph; 1-planar graph; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Clique-sum; Polynomial; Graph; Line graph","authors":[{"name":"Glencora Borradaile","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Siamak Tazari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01680353275891705,"gpt":0.2479081749960707,"spread":0.2311046422371536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150599,0.001580635,0.001780588,0.0009029055,0.001479882,0.003593362,0.004500554,0.001933071,0.007170175],"category_scores_gemma":[0.01287731,0.0006312841,0.00197265,0.002659602,0.001174691,0.00851693,0.002673653,0.00332072,0.001237736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003566611,"about_ca_system_score_gemma":0.002349067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003132296,"about_ca_topic_score_gemma":0.004824162,"domain_scores_codex":[0.9979503,0.0004530084,0.0001342935,0.0004382321,0.0005414923,0.0004827327],"domain_scores_gemma":[0.9898122,0.006326037,0.0005910421,0.002473841,0.000434682,0.0003621376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001996503,0.0005169633,0.004269623,0.001058898,0.0002436923,0.0002383756,0.001269737,0.5445245,0.01203258,0.1632836,0.017571,0.2529946],"study_design_scores_gemma":[0.0001801729,0.0001364773,0.0004729432,0.00004784644,0.0001153599,0.000236617,0.0002354941,0.8486695,0.005978796,0.1389488,0.004952426,0.00002559758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.184388,0.001449847,0.7960003,0.002373332,0.0001547469,0.0003890979,0.001171011,0.003478484,0.01059509],"genre_scores_gemma":[0.6457407,0.0009323612,0.3461587,0.0003160112,0.0001513893,0.0003722486,0.002337919,0.0004154257,0.003575115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007170175,"threshold_uncertainty_score":0.02587765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2249023948","doi":"10.4230/lipics.approx-random.2014.721","title":"Communication Complexity of Set-Disjointness for All Probabilities","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication complexity; Characterization (materials science); Mathematics; Bounded function; Upper and lower bounds; Class (philosophy); Complexity class; Discrete mathematics; Set (abstract data type); Combinatorics; Alpha (finance); Computational complexity theory; Time complexity; Computer science; Algorithm","authors":[{"name":"Mika Göös","is_ca":true},{"name":"Thomas Watson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05522852973585569,"gpt":0.2891848481189355,"spread":0.2339563183830798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006013395,0.001379045,0.00198668,0.001381169,0.001770616,0.005417663,0.003873867,0.002654161,0.006118221],"category_scores_gemma":[0.03940003,0.0008043469,0.00267588,0.001582162,0.005461429,0.01331083,0.00635508,0.00936303,0.000583549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005763544,"about_ca_system_score_gemma":0.002310385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001903094,"about_ca_topic_score_gemma":0.0009425822,"domain_scores_codex":[0.9904974,0.003541545,0.0003830694,0.001923192,0.002130169,0.001524598],"domain_scores_gemma":[0.9024466,0.08206389,0.005239782,0.006973353,0.00146238,0.001814001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005231291,0.0002079947,0.002255402,0.0002362166,0.0001416942,0.0002421434,0.0006679469,0.1791535,0.003192335,0.798717,0.002207244,0.01245548],"study_design_scores_gemma":[0.00006703153,0.00005254791,0.0003668416,0.00001748984,0.00003657052,0.00006743516,0.00006140632,0.4534473,0.001718711,0.5434777,0.0006566548,0.00003022858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4900705,0.0007065273,0.4864632,0.00649581,0.00009719648,0.0002216902,0.0008750766,0.0005589224,0.01451101],"genre_scores_gemma":[0.9672155,0.0003761904,0.0270608,0.000389385,0.0002315872,0.0003236519,0.0003410563,0.0001657045,0.003896045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006118221,"threshold_uncertainty_score":0.04181767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963080927","doi":"10.4230/lipics.ecoop.2016.7","title":"Interprocedural Type Specialization of JavaScript Programs Without Type Analysis","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Software Engineering Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Programming language; JavaScript; Compiler; Software versioning; Block (permutation group theory); Simple (philosophy); Source code; Context (archaeology); Software","authors":[{"name":"Maxime Chevalier-Boisvert","is_ca":true},{"name":"Marc Feeley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02067169632040756,"gpt":0.2782466223932611,"spread":0.2575749260728535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002530643,0.0008105198,0.000893332,0.001162528,0.0007672807,0.001790107,0.002096004,0.0005932273,0.002611543],"category_scores_gemma":[0.0138153,0.0008828099,0.001248603,0.001558341,0.001425239,0.003721005,0.002394407,0.001779585,0.001259211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009993816,"about_ca_system_score_gemma":0.002176529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002819659,"about_ca_topic_score_gemma":0.004226581,"domain_scores_codex":[0.9962183,0.001025308,0.0003367383,0.0007433583,0.001264604,0.0004117455],"domain_scores_gemma":[0.9813442,0.004412152,0.001352079,0.01144244,0.001250118,0.0001989534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001012083,0.0002985792,0.03500131,0.0007861822,0.0002305668,0.0004161526,0.001674556,0.03140976,0.1145529,0.04162876,0.006829896,0.7661592],"study_design_scores_gemma":[0.0001631032,0.0006645132,0.01579596,0.0002523548,0.0003565169,0.001451953,0.0002741249,0.560777,0.3094493,0.05843474,0.05217262,0.0002078448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1341391,0.0005237037,0.8110126,0.0002263539,0.00008351471,0.0002079457,0.0004203136,0.04644657,0.006939932],"genre_scores_gemma":[0.6140419,0.0003122343,0.3678502,0.0003341751,0.00006762885,0.0001375116,0.001026574,0.009110563,0.007119247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002819659,"threshold_uncertainty_score":0.01338351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2534763950","doi":"10.4230/lipics.cpm.2016.14","title":"Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation Cost","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Tree (set theory); Binary tree; Computer science; Function (biology); K-ary tree; Time complexity; Gene; Algorithm; Mathematics; Tree structure; Computational biology; Biology; Combinatorics; Genetics","authors":[{"name":"Manuel Lafond","is_ca":true},{"name":"Emmanuel Noutahi","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01070809377943325,"gpt":0.2379367081829139,"spread":0.2272286144034806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002447924,0.001282744,0.002103758,0.001744572,0.001201662,0.00199736,0.003981882,0.002683945,0.007387564],"category_scores_gemma":[0.0100441,0.0007063067,0.001470295,0.002840634,0.00101766,0.004225793,0.002524188,0.001740636,0.001643572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208253,"about_ca_system_score_gemma":0.001935008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002854036,"about_ca_topic_score_gemma":0.003949393,"domain_scores_codex":[0.9982399,0.0006630589,0.0001067965,0.0004283084,0.0003372972,0.0002248148],"domain_scores_gemma":[0.9929253,0.004344285,0.0004732037,0.001488563,0.0005583662,0.0002103226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008176189,0.000408653,0.002447878,0.0004833631,0.0001918318,0.0002802618,0.0004193739,0.5183864,0.01107513,0.0232772,0.009244312,0.4329679],"study_design_scores_gemma":[0.0001034636,0.00007695144,0.0004982954,0.00001347855,0.00004275504,0.0001331514,0.00007285498,0.9750665,0.003097578,0.01936734,0.00150428,0.00002340235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1137036,0.0008032153,0.8763143,0.0006536829,0.0001136773,0.0002605556,0.0005310151,0.004245258,0.003374665],"genre_scores_gemma":[0.297765,0.0001775611,0.6956347,0.0001869139,0.00006768942,0.0003001358,0.002006769,0.0008438096,0.003017519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007387564,"threshold_uncertainty_score":0.02471381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2793662473","doi":"10.4230/lipics.stacs.2018.54","title":"Sums of Palindromes: an Approach via Automata","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Palindrome; Natural number; Automaton; Base (topology); Representation (politics); Combinatorics; Constant (computer programming); Mathematics; Natural (archaeology); Discrete mathematics; Computer science; Theoretical computer science","authors":[{"name":"Aayush Rajasekaran","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true},{"name":"Tim Smith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01634454913542841,"gpt":0.2622592057988951,"spread":0.2459146566634667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192198,0.001193342,0.00168208,0.003389712,0.002084397,0.005030676,0.003158049,0.001726314,0.006851376],"category_scores_gemma":[0.009419452,0.001499936,0.003715217,0.001600861,0.004801178,0.01050608,0.004504921,0.004754758,0.001381079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002000254,"about_ca_system_score_gemma":0.0008043415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006795974,"about_ca_topic_score_gemma":0.001000921,"domain_scores_codex":[0.9960245,0.001467498,0.0003875132,0.0009765378,0.0008964206,0.0002474955],"domain_scores_gemma":[0.9938498,0.004026308,0.0003396051,0.0009234694,0.0005929826,0.0002678697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004961636,0.00003071207,0.0001988428,0.00009554222,0.0000308196,0.0001129105,0.0002873151,0.00459757,0.001527453,0.9820004,0.0005215027,0.01054724],"study_design_scores_gemma":[0.00001267018,0.00002043415,0.00004066736,0.000028451,0.00001628545,0.00006604748,0.00004511015,0.02728471,0.000965922,0.9675273,0.003974268,0.00001805927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03133012,0.002244072,0.9442293,0.001238911,0.0003362144,0.0001218149,0.0001585944,0.0003855496,0.01995529],"genre_scores_gemma":[0.331329,0.001546049,0.6542704,0.0005857521,0.0007676771,0.0003633146,0.0003136705,0.0003442907,0.0104797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006851376,"threshold_uncertainty_score":0.02292013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037400974","doi":"10.4230/lipics.itc.2020.7","title":"Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Leakage (economics); Secret sharing; Affine transformation; Bounded function; Mathematics; Access structure; Oracle; Computer science; Information leakage; Random oracle; Discrete mathematics; Topology (electrical circuits); Cryptography; Encryption; Combinatorics; Algorithm; Computer network; Public-key cryptography; Pure mathematics; Mathematical analysis","authors":[{"name":"Fuchun Lin","is_ca":false},{"name":"Mahdi Cheraghchi","is_ca":false},{"name":"Venkatesan Guruswami","is_ca":false},{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Huaxiong Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02844676203923193,"gpt":0.2550328808854351,"spread":0.2265861188462031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004944887,0.001552246,0.002245356,0.001249911,0.001570447,0.003819875,0.00345965,0.003338716,0.00504286],"category_scores_gemma":[0.01815908,0.001057432,0.003528239,0.001751737,0.005348669,0.01643522,0.006978175,0.006304977,0.001167656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004619994,"about_ca_system_score_gemma":0.002114956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053844,"about_ca_topic_score_gemma":0.0005805406,"domain_scores_codex":[0.9934683,0.002087659,0.0003850783,0.001322224,0.001535184,0.001201404],"domain_scores_gemma":[0.9833965,0.007673257,0.001936025,0.005653706,0.0007884746,0.0005519766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003143429,0.00008168031,0.0003843477,0.0002764746,0.0001355445,0.0002706215,0.0005071387,0.1404611,0.007222082,0.8400273,0.001340106,0.008979331],"study_design_scores_gemma":[0.00005623669,0.0001387285,0.0001337384,0.0000808414,0.00007515346,0.0002869569,0.00008283699,0.4346027,0.006837599,0.5545959,0.003032413,0.00007703891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06521232,0.001145469,0.9232182,0.001064766,0.0001125864,0.0002047545,0.0003502544,0.0007258023,0.007965839],"genre_scores_gemma":[0.9461171,0.0008909889,0.04551795,0.0003983149,0.00009781087,0.0002039337,0.00022815,0.0001489135,0.006396878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00504286,"threshold_uncertainty_score":0.03352058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1502375285","doi":"10.4230/lipics.stacs.2011.380","title":"A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; University of Waterloo","funders":"","keywords":"Preemption; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Algorithm; Processor scheduling; Computational complexity theory; Time complexity; Parallel computing; Mathematical optimization; Mathematics; Operating system","authors":[{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02940853977823463,"gpt":0.2561213773527595,"spread":0.2267128375745249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200843,0.001855839,0.001349299,0.001204996,0.001227157,0.001559487,0.002159755,0.002321423,0.004755462],"category_scores_gemma":[0.004299118,0.0008695492,0.001098576,0.002048334,0.0008317331,0.003347963,0.001785704,0.002275733,0.001942659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268146,"about_ca_system_score_gemma":0.002803033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001978781,"about_ca_topic_score_gemma":0.002642651,"domain_scores_codex":[0.9989367,0.0002708101,0.00006502945,0.0002394442,0.0003424872,0.0001455351],"domain_scores_gemma":[0.9985709,0.0008235636,0.00008515787,0.0002036552,0.0002472738,0.00006948347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004681087,0.0002808211,0.0005495139,0.0004875388,0.000121726,0.0001729828,0.0001870121,0.2968154,0.009288555,0.05562349,0.01738229,0.6186226],"study_design_scores_gemma":[0.0004262489,0.0002314175,0.0003424065,0.00005411327,0.00004200535,0.0002216702,0.00004350197,0.8942625,0.004072484,0.08180749,0.0184498,0.0000463877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003663323,0.0003863051,0.9931324,0.0001820556,0.000108325,0.000109181,0.00009423488,0.0008906799,0.001433551],"genre_scores_gemma":[0.02893056,0.0002526096,0.9684547,0.00008022478,0.00007726673,0.0003416566,0.0003216691,0.0001401676,0.001401312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004755462,"threshold_uncertainty_score":0.0159086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2612636087","doi":"10.4230/lipics.opodis.2016.34","title":"Deletion without Rebalancing in Non-Blocking Binary Search Trees","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Blocking (statistics); Computer science; Binary search tree; Tree (set theory); Binary tree; Lock (firearm); Bounded function; Optimal binary search tree; Algorithm; Theoretical computer science; K-ary tree; Combinatorics; Mathematics; Tree structure","authors":[{"name":"Meng He","is_ca":true},{"name":"Mengdu Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02315242208962659,"gpt":0.3028318129520669,"spread":0.2796793908624403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869347,0.0007816267,0.001059751,0.0007655892,0.001119307,0.001726772,0.002848278,0.001095943,0.004062423],"category_scores_gemma":[0.006140542,0.0007784342,0.0009515673,0.001236705,0.001223076,0.003576007,0.002445995,0.00180727,0.00152075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242608,"about_ca_system_score_gemma":0.002573906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003508571,"about_ca_topic_score_gemma":0.004516314,"domain_scores_codex":[0.9975721,0.0005772191,0.0001518805,0.0003653347,0.000761319,0.0005721179],"domain_scores_gemma":[0.9964682,0.001388223,0.0004892183,0.000859903,0.0005583192,0.0002362299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001670081,0.0005993347,0.003275023,0.001130468,0.0001121016,0.0004641894,0.001163681,0.449583,0.07172158,0.0932657,0.009679994,0.3673348],"study_design_scores_gemma":[0.0003811075,0.0003982296,0.0005936341,0.00008044463,0.00007781918,0.0003854187,0.0002860866,0.9143007,0.02339964,0.04843636,0.0115903,0.00007028835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08440622,0.0006685607,0.9018636,0.0005027236,0.00008405554,0.0003115495,0.0003154642,0.005328973,0.006518881],"genre_scores_gemma":[0.4449048,0.0003658609,0.5446966,0.0005239371,0.00007198796,0.0004238257,0.0008652643,0.0009569644,0.0071908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004062423,"threshold_uncertainty_score":0.01359016,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082819694","doi":"10.4230/lipics.esa.2020.67","title":"Light Euclidean Spanners with Steiner Points","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Blavatnik Family Foundation","keywords":"Spanner; Combinatorics; Bounded function; Upper and lower bounds; Mathematics; Euclidean geometry; Point (geometry); Euclidean distance; Lightness; Discrete mathematics; Binary logarithm; Computer science; Geometry; Mathematical analysis; Artificial intelligence","authors":[{"name":"Hung Le","is_ca":true},{"name":"Shay Solomon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01517548488795632,"gpt":0.2244119450501791,"spread":0.2092364601622228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530274,0.0007891535,0.000780279,0.001077122,0.0006973044,0.001196151,0.001100032,0.0009947219,0.008778192],"category_scores_gemma":[0.004358931,0.0005789073,0.0008596649,0.001237822,0.001511585,0.00289233,0.003379048,0.002136775,0.002678023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007112483,"about_ca_system_score_gemma":0.0003263424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004252552,"about_ca_topic_score_gemma":0.0006475722,"domain_scores_codex":[0.9991794,0.000173568,0.00005192253,0.0002138097,0.0002616238,0.0001197198],"domain_scores_gemma":[0.9985588,0.0005661132,0.0002155692,0.0002998939,0.0001533749,0.0002063148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002823667,0.00005050462,0.0008061487,0.0001927525,0.00004095562,0.0002535366,0.0003846572,0.04732479,0.01396719,0.8804141,0.004157855,0.0521252],"study_design_scores_gemma":[0.0000468556,0.0001828806,0.0004681667,0.00004545386,0.00001743574,0.0002931943,0.0001109601,0.06001803,0.005149409,0.9214145,0.0122162,0.00003698997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2993561,0.001279794,0.6566464,0.0006607613,0.0001837966,0.0001015375,0.0007448612,0.0007988935,0.04022786],"genre_scores_gemma":[0.7409743,0.00115424,0.2259855,0.0004555379,0.0002255205,0.0002033923,0.001269197,0.0004409935,0.02929128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008778192,"threshold_uncertainty_score":0.02936596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014455327","doi":"10.4230/lipics.tqc.2020.7","title":"Beyond Product State Approximations for a Quantum Analogue of Max Cut","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Maximum cut; Semidefinite programming; Hamiltonian (control theory); Qubit; Mathematics; Bounded function; Eigenvalues and eigenvectors; Relaxation (psychology); Quantum; Upper and lower bounds; Quantum computer; Graph; Product (mathematics); Discrete mathematics; Combinatorics; Quantum mechanics; Mathematical optimization; Mathematical analysis; Physics","authors":[{"name":"Anurag Anshu","is_ca":true},{"name":"Karen J. Morenz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01661698165759976,"gpt":0.2428065866925685,"spread":0.2261896050349687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157303,0.0008649555,0.0009270391,0.0005833869,0.0006479955,0.001991341,0.001770794,0.001450147,0.005712303],"category_scores_gemma":[0.009797412,0.0004810736,0.001043139,0.001104033,0.002421823,0.004754396,0.001787288,0.003833576,0.0005418935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001749038,"about_ca_system_score_gemma":0.0009714048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001359687,"about_ca_topic_score_gemma":0.001542298,"domain_scores_codex":[0.9986328,0.0005712332,0.00004634755,0.0002528145,0.0003483892,0.0001482822],"domain_scores_gemma":[0.9947589,0.003690548,0.0002320028,0.0009222534,0.0002656416,0.0001306567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003531832,0.0001463159,0.0005848364,0.0001611221,0.00005618088,0.00008430468,0.0001789241,0.4519745,0.00303314,0.5091568,0.002562768,0.03170794],"study_design_scores_gemma":[0.00001546938,0.00003155013,0.00005559789,0.00001071565,0.000006872015,0.00002220348,0.00001828878,0.7196213,0.00117543,0.2782262,0.0008100902,0.000006363229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09103633,0.0004333435,0.8919733,0.001246264,0.00008577677,0.00007272197,0.0001796927,0.0006709586,0.01430169],"genre_scores_gemma":[0.7359473,0.0003215302,0.2569264,0.0003788617,0.00007752822,0.00016219,0.0004058496,0.0003767638,0.005403392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005712303,"threshold_uncertainty_score":0.01910955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2982393288","doi":"10.4230/lipics.ccc.2020.12","title":"Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Invariant (physics); Invariant theory; Conjecture; Mathematics; Computational complexity theory; Algebraic number; Proof complexity; Polynomial ring; Algebra over a field; Discrete mathematics; Theoretical computer science; Polynomial; Pure mathematics; Computer science; Algorithm; Mathematical proof","authors":[{"name":"Ankit Garg","is_ca":false},{"name":"Christian Ikenmeyer","is_ca":false},{"name":"Visu Makam","is_ca":false},{"name":"Rafael Oliveira","is_ca":true},{"name":"Michael Walter","is_ca":false},{"name":"Avi Wigderson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06788203052079886,"gpt":0.2681875824002677,"spread":0.2003055518794688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00289355,0.0006654076,0.001114701,0.001589102,0.002066539,0.005819764,0.002479142,0.002086339,0.01020188],"category_scores_gemma":[0.0213255,0.0005437497,0.001828382,0.003031928,0.005018842,0.0163773,0.003306379,0.005113472,0.0008225545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003857675,"about_ca_system_score_gemma":0.002463715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002264733,"about_ca_topic_score_gemma":0.002455905,"domain_scores_codex":[0.9971831,0.0009576672,0.0001790074,0.0006943838,0.0005953693,0.0003905927],"domain_scores_gemma":[0.9732249,0.02299411,0.001081828,0.001716403,0.0005591146,0.0004235765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002741053,0.0001910458,0.002379211,0.0005554348,0.00006248585,0.0002791233,0.0007806577,0.04449818,0.001861273,0.8785471,0.009143741,0.06142777],"study_design_scores_gemma":[0.00004747054,0.00003810922,0.0003232701,0.00003237456,0.00003268638,0.0001510604,0.0002762303,0.05369622,0.002235891,0.9401904,0.002952593,0.00002367955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3962992,0.002499722,0.5376399,0.02598729,0.0002414603,0.000425948,0.003070629,0.001535948,0.03229981],"genre_scores_gemma":[0.8553589,0.001349663,0.1309807,0.001163115,0.0004248836,0.0002846219,0.002450036,0.000329681,0.00765835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01020188,"threshold_uncertainty_score":0.03412867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798468821","doi":"10.4230/lipics.socg.2018.24","title":"Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Binary logarithm; Unit disk; Bounded function; Upper and lower bounds; Time complexity; Metric space; Graph; Oracle; Discrete mathematics; Computer science","authors":[{"name":"Timothy M. Chan","is_ca":false},{"name":"Dimitrios Skrepetos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01431332347726334,"gpt":0.2540391938587569,"spread":0.2397258703814936,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012814,0.001485156,0.00176975,0.001476817,0.0007239373,0.00231628,0.004297673,0.00172988,0.006296665],"category_scores_gemma":[0.01156676,0.00069862,0.0009160967,0.003576866,0.001021994,0.009055033,0.003523301,0.002158451,0.002034408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705564,"about_ca_system_score_gemma":0.0008987148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003047047,"about_ca_topic_score_gemma":0.003621594,"domain_scores_codex":[0.9974068,0.0005760009,0.0001984897,0.0007243383,0.0008230143,0.0002714],"domain_scores_gemma":[0.9950526,0.002246108,0.0005407151,0.001577951,0.0003622405,0.0002204395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002612932,0.0004334786,0.004025789,0.001293206,0.0001998915,0.0003461607,0.000594379,0.3925565,0.01875103,0.150039,0.02067009,0.4084775],"study_design_scores_gemma":[0.0001355365,0.0001934082,0.0007798657,0.00003839094,0.00004438435,0.0003505117,0.0001684422,0.8146656,0.008130988,0.1686838,0.006768909,0.00004008652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09848199,0.001854367,0.8861956,0.001018789,0.0001187208,0.0001570167,0.001575117,0.004218126,0.00638026],"genre_scores_gemma":[0.4929958,0.0009274324,0.495472,0.0002890609,0.000161635,0.0002596671,0.003673238,0.000553548,0.005667707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006296665,"threshold_uncertainty_score":0.02106446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571737124","doi":"10.4230/lipics.isaac.2016.24","title":"All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary logarithm; Shortest path problem; Logarithm; Mathematics; Vertex (graph theory); Time complexity; Running time; Unit disk; Graph; Discrete mathematics; Log-log plot; Algorithm","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Dimitrios Skrepetos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01558402400576505,"gpt":0.2481013665065303,"spread":0.2325173425007652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157917,0.001685107,0.001936178,0.001208458,0.001572962,0.003602009,0.003319439,0.001574991,0.01137524],"category_scores_gemma":[0.01020994,0.0008668152,0.001263287,0.003353222,0.001655858,0.01043339,0.003122112,0.002421819,0.003164256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002755377,"about_ca_system_score_gemma":0.002021172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00489004,"about_ca_topic_score_gemma":0.008210505,"domain_scores_codex":[0.9969399,0.0008626091,0.0001593053,0.0008968847,0.0006691168,0.0004722849],"domain_scores_gemma":[0.9941076,0.003960632,0.0004352352,0.0009120011,0.0003181447,0.0002662897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002688989,0.0005301082,0.002929011,0.001895332,0.0002406252,0.0005001934,0.001236132,0.4768464,0.01607309,0.1671319,0.03804258,0.2918857],"study_design_scores_gemma":[0.0003420758,0.0001766682,0.0007096305,0.00004994965,0.00009037521,0.0003119219,0.0003077803,0.6984363,0.004680454,0.2846149,0.0102441,0.00003588705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2206414,0.002456769,0.741227,0.002983963,0.0002619445,0.0003457615,0.001616128,0.004899655,0.02556726],"genre_scores_gemma":[0.4143993,0.001047655,0.5645488,0.0005767369,0.0002704327,0.0003330256,0.002984996,0.001527595,0.01431143],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01137524,"threshold_uncertainty_score":0.03805399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}